./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread-wmm/mix052_pso.opt_rmo.opt_tso.opt.i --full-output --witness-type correctness_witness --witnessparser.only.consider.loop.invariants false --cacsl2boogietranslator.check.unreachability.of.reach_error.function false --validate ./goblint.2024-05-21_14-57-05.files/mutex-meet/mix052_pso.opt_rmo.opt_tso.opt.yml/witness.yml --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version cde23df1 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReachWitnessValidation.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix052_pso.opt_rmo.opt_tso.opt.i ./goblint.2024-05-21_14-57-05.files/mutex-meet/mix052_pso.opt_rmo.opt_tso.opt.yml/witness.yml -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --traceabstraction.compute.hoare.annotation.of.negated.interpolant.automaton,.abstraction.and.cfg false --witnessparser.only.consider.loop.invariants false --cacsl2boogietranslator.check.unreachability.of.reach_error.function false --- Real Ultimate output --- This is Ultimate 0.2.4-tmp.fs.goblint-validation-cde23df-m [2024-06-14 15:26:38,814 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-06-14 15:26:38,882 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-06-14 15:26:38,887 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-06-14 15:26:38,888 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-06-14 15:26:38,915 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-06-14 15:26:38,917 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-06-14 15:26:38,918 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-06-14 15:26:38,918 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-06-14 15:26:38,923 INFO L153 SettingsManager]: * Use memory slicer=true [2024-06-14 15:26:38,923 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-06-14 15:26:38,924 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-06-14 15:26:38,925 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-06-14 15:26:38,926 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-06-14 15:26:38,926 INFO L153 SettingsManager]: * Use SBE=true [2024-06-14 15:26:38,927 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-06-14 15:26:38,927 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-06-14 15:26:38,927 INFO L153 SettingsManager]: * sizeof long=4 [2024-06-14 15:26:38,927 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-06-14 15:26:38,928 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-06-14 15:26:38,928 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-06-14 15:26:38,928 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-06-14 15:26:38,928 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-06-14 15:26:38,929 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-06-14 15:26:38,929 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-06-14 15:26:38,929 INFO L153 SettingsManager]: * sizeof long double=12 [2024-06-14 15:26:38,929 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-06-14 15:26:38,930 INFO L153 SettingsManager]: * Use constant arrays=true [2024-06-14 15:26:38,930 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-06-14 15:26:38,931 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-06-14 15:26:38,931 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-06-14 15:26:38,932 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-06-14 15:26:38,943 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-14 15:26:38,943 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-06-14 15:26:38,943 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-06-14 15:26:38,943 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-06-14 15:26:38,944 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-06-14 15:26:38,944 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-06-14 15:26:38,944 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-06-14 15:26:38,944 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-06-14 15:26:38,944 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-06-14 15:26:38,945 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-06-14 15:26:38,945 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-06-14 15:26:38,945 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessparser: Only consider loop invariants -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check unreachability of reach_error function -> false [2024-06-14 15:26:39,140 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-06-14 15:26:39,156 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-06-14 15:26:39,158 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-06-14 15:26:39,159 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-06-14 15:26:39,160 INFO L274 PluginConnector]: Witness Parser initialized [2024-06-14 15:26:39,161 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/mix052_pso.opt_rmo.opt_tso.opt.yml/witness.yml [2024-06-14 15:26:39,406 INFO L270 PluginConnector]: Initializing CDTParser... [2024-06-14 15:26:39,406 INFO L274 PluginConnector]: CDTParser initialized [2024-06-14 15:26:39,407 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix052_pso.opt_rmo.opt_tso.opt.i [2024-06-14 15:26:40,484 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-06-14 15:26:40,692 INFO L384 CDTParser]: Found 1 translation units. [2024-06-14 15:26:40,696 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix052_pso.opt_rmo.opt_tso.opt.i [2024-06-14 15:26:40,708 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/68d6e15d1/c66e466953764ed9874b931f78b36485/FLAG19311f699 [2024-06-14 15:26:40,720 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/68d6e15d1/c66e466953764ed9874b931f78b36485 [2024-06-14 15:26:40,721 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-06-14 15:26:40,722 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-06-14 15:26:40,723 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-06-14 15:26:40,723 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-06-14 15:26:40,727 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-06-14 15:26:40,728 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 14.06 03:26:39" (1/2) ... [2024-06-14 15:26:40,728 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@473554f8 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 14.06 03:26:40, skipping insertion in model container [2024-06-14 15:26:40,729 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 14.06 03:26:39" (1/2) ... [2024-06-14 15:26:40,730 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@454b915c and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 14.06 03:26:40, skipping insertion in model container [2024-06-14 15:26:40,731 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.06 03:26:40" (2/2) ... [2024-06-14 15:26:40,731 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@473554f8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.06 03:26:40, skipping insertion in model container [2024-06-14 15:26:40,731 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.06 03:26:40" (2/2) ... [2024-06-14 15:26:40,731 INFO L83 nessWitnessExtractor]: Extracting all invariants from correctness witness [2024-06-14 15:26:40,863 INFO L95 edCorrectnessWitness]: Found the following entries in the witness: [2024-06-14 15:26:40,864 INFO L97 edCorrectnessWitness]: Location invariant before [L826-L826] ((((((((((((((((((! multithreaded || y$r_buff1_thd1 == (_Bool)0) && (! multithreaded || ((0 <= __unbuffered_p2_EAX && __unbuffered_p2_EAX <= 1) && (__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1)))) && (! multithreaded || ((0 <= __unbuffered_p1_EAX && __unbuffered_p1_EAX <= 1) && (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1)))) && (! multithreaded || y$read_delayed_var == 0)) && (! multithreaded || (((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((0LL - (long long )__unbuffered_p2_EAX) + (long long )z >= 0LL && (0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff0_thd1 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff0_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff0_thd3 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff1_thd1 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff1_thd3 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )z >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$r_buff0_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$r_buff0_thd3 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$r_buff1_thd1 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$r_buff1_thd3 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )z >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$r_buff0_thd3 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$r_buff1_thd1 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$r_buff1_thd3 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )z >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$r_buff1_thd1 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$r_buff1_thd3 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )z >= 0LL) && (0LL - (long long )y$r_buff1_thd1) + (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff1_thd1) + (long long )y$r_buff1_thd3 >= 0LL) && (0LL - (long long )y$r_buff1_thd1) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd1) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff1_thd1) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff1_thd1) + (long long )z >= 0LL) && (0LL - (long long )y$r_buff1_thd2) + (long long )y$r_buff1_thd3 >= 0LL) && (0LL - (long long )y$r_buff1_thd2) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd2) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff1_thd2) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff1_thd2) + (long long )z >= 0LL) && (0LL - (long long )y$read_delayed) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$read_delayed) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$read_delayed) + (long long )z >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) + (long long )main$tmp_guard1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) + (long long )x >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) + (long long )y >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) + (long long )y$flush_delayed >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) + (long long )y$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) + (long long )y$r_buff0_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) + (long long )y$r_buff0_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) + (long long )y$r_buff0_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) + (long long )y$r_buff0_thd3 >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) + (long long )y$r_buff1_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) + (long long )y$r_buff1_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) + (long long )y$r_buff1_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) + (long long )y$r_buff1_thd3 >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) + (long long )y$read_delayed >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) + (long long )y$w_buff0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) + (long long )y$w_buff1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) + (long long )weak$$choice0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p1_EAX >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p2_EAX >= 0LL) && (long long )__unbuffered_cnt + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_cnt + (long long )x >= 0LL) && (long long )__unbuffered_cnt + (long long )y >= 0LL) && (long long )__unbuffered_cnt + (long long )y$flush_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )y$mem_tmp >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )y$w_buff0 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$w_buff1 >= 0LL) && (long long )__unbuffered_cnt + (long long )z >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )__unbuffered_p2_EAX >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$flush_delayed >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$mem_tmp >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$w_buff0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$w_buff1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$flush_delayed >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$mem_tmp >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$w_buff0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$w_buff1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )weak$$choice2 >= 0LL) && (long long )main$tmp_guard1 + (long long )x >= 0LL) && (long long )main$tmp_guard1 + (long long )y >= 0LL) && (long long )main$tmp_guard1 + (long long )y$flush_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )y$mem_tmp >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff0_thd1 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff0_thd2 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff0_thd3 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff1_thd1 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff1_thd3 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$read_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )y$w_buff0 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$w_buff1 >= 0LL) && (long long )main$tmp_guard1 + (long long )z >= 0LL) && (long long )main$tmp_guard1 + (long long )weak$$choice0 >= 0LL) && (long long )main$tmp_guard1 + (long long )weak$$choice2 >= 0LL) && (long long )x + (long long )y >= 0LL) && (long long )x + (long long )y$flush_delayed >= 0LL) && (long long )x + (long long )y$mem_tmp >= 0LL) && (long long )x + (long long )y$r_buff0_thd0 >= 0LL) && (long long )x + (long long )y$r_buff0_thd1 >= 0LL) && (long long )x + (long long )y$r_buff0_thd2 >= 0LL) && (long long )x + (long long )y$r_buff0_thd3 >= 0LL) && (long long )x + (long long )y$r_buff1_thd0 >= 0LL) && (long long )x + (long long )y$r_buff1_thd1 >= 0LL) && (long long )x + (long long )y$r_buff1_thd2 >= 0LL) && (long long )x + (long long )y$r_buff1_thd3 >= 0LL) && (long long )x + (long long )y$read_delayed >= 0LL) && (long long )x + (long long )y$w_buff0 >= 0LL) && (long long )x + (long long )y$w_buff1 >= 0LL) && (long long )x + (long long )z >= 0LL) && (long long )y + (long long )y$flush_delayed >= 0LL) && (long long )y + (long long )y$mem_tmp >= 0LL) && (long long )y + (long long )y$r_buff0_thd0 >= 0LL) && (long long )y + (long long )y$r_buff0_thd1 >= 0LL) && (long long )y + (long long )y$r_buff0_thd2 >= 0LL) && (long long )y + (long long )y$r_buff0_thd3 >= 0LL) && (long long )y + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y + (long long )y$r_buff1_thd3 >= 0LL) && (long long )y + (long long )y$read_delayed >= 0LL) && (long long )y + (long long )y$w_buff0 >= 0LL) && (long long )y + (long long )y$w_buff1 >= 0LL) && (long long )y + (long long )z >= 0LL) && (long long )y$flush_delayed + (long long )y$mem_tmp >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff0_thd0 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff0_thd1 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff0_thd3 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$flush_delayed + (long long )y$read_delayed >= 0LL) && (long long )y$flush_delayed + (long long )y$w_buff0 >= 0LL) && (long long )y$flush_delayed + (long long )y$w_buff1 >= 0LL) && (long long )y$flush_delayed + (long long )z >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff0_thd0 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff0_thd1 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff0_thd3 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$mem_tmp + (long long )y$read_delayed >= 0LL) && (long long )y$mem_tmp + (long long )y$w_buff0 >= 0LL) && (long long )y$mem_tmp + (long long )y$w_buff1 >= 0LL) && (long long )y$mem_tmp + (long long )z >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff0_thd1 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff0_thd3 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )z >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$r_buff0_thd3 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )z >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$r_buff0_thd3 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )z >= 0LL) && (long long )y$r_buff0_thd3 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd3 + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff0_thd3 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd3 + (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$r_buff0_thd3 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd3 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff0_thd3 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff0_thd3 + (long long )z >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff1_thd0 + (long long )z >= 0LL) && (long long )y$r_buff1_thd1 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff1_thd1 + (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$r_buff1_thd1 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd1 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff1_thd1 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff1_thd1 + (long long )z >= 0LL) && (long long )y$r_buff1_thd2 + (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$r_buff1_thd2 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd2 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff1_thd2 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff1_thd2 + (long long )z >= 0LL) && (long long )y$r_buff1_thd3 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd3 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff1_thd3 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff1_thd3 + (long long )z >= 0LL) && (long long )y$read_delayed + (long long )y$w_buff0 >= 0LL) && (long long )y$read_delayed + (long long )y$w_buff1 >= 0LL) && (long long )y$read_delayed + (long long )z >= 0LL) && (long long )y$w_buff0 + (long long )y$w_buff1 >= 0LL) && (long long )y$w_buff0 + (long long )z >= 0LL) && (long long )y$w_buff1 + (long long )z >= 0LL) && (long long )weak$$choice0 + (long long )x >= 0LL) && (long long )weak$$choice0 + (long long )y >= 0LL) && (long long )weak$$choice0 + (long long )y$flush_delayed >= 0LL) && (long long )weak$$choice0 + (long long )y$mem_tmp >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff0_thd1 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff0_thd2 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff0_thd3 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff1_thd1 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff1_thd3 >= 0LL) && (long long )weak$$choice0 + (long long )y$read_delayed >= 0LL) && (long long )weak$$choice0 + (long long )y$w_buff0 >= 0LL) && (long long )weak$$choice0 + (long long )y$w_buff1 >= 0LL) && (long long )weak$$choice0 + (long long )z >= 0LL) && (long long )weak$$choice0 + (long long )weak$$choice2 >= 0LL) && (long long )weak$$choice2 + (long long )x >= 0LL) && (long long )weak$$choice2 + (long long )y >= 0LL) && (long long )weak$$choice2 + (long long )y$flush_delayed >= 0LL) && (long long )weak$$choice2 + (long long )y$mem_tmp >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff0_thd1 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff0_thd2 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff0_thd3 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff1_thd1 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff1_thd3 >= 0LL) && (long long )weak$$choice2 + (long long )y$read_delayed >= 0LL) && (long long )weak$$choice2 + (long long )y$w_buff0 >= 0LL) && (long long )weak$$choice2 + (long long )y$w_buff1 >= 0LL) && (long long )weak$$choice2 + (long long )z >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )__unbuffered_p2_EAX >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )z >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )__unbuffered_p2_EAX >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )z >= 0LL) && (1LL + (long long )__unbuffered_p2_EAX) - (long long )z >= 0LL) && (1LL + (long long )main$tmp_guard1) - (long long )z >= 0LL) && (1LL + (long long )x) - (long long )z >= 0LL) && (1LL + (long long )y) - (long long )z >= 0LL) && (1LL + (long long )y$flush_delayed) - (long long )z >= 0LL) && (1LL + (long long )y$mem_tmp) - (long long )z >= 0LL) && (1LL + (long long )y$r_buff0_thd0) - (long long )z >= 0LL) && (1LL + (long long )y$r_buff0_thd1) - (long long )z >= 0LL) && (1LL + (long long )y$r_buff0_thd2) - (long long )z >= 0LL) && (1LL + (long long )y$r_buff0_thd3) - (long long )z >= 0LL) && (1LL + (long long )y$r_buff1_thd0) - (long long )z >= 0LL) && (1LL + (long long )y$r_buff1_thd1) - (long long )z >= 0LL) && (1LL + (long long )y$r_buff1_thd2) - (long long )z >= 0LL) && (1LL + (long long )y$r_buff1_thd3) - (long long )z >= 0LL) && (1LL + (long long )y$read_delayed) - (long long )z >= 0LL) && (1LL + (long long )y$w_buff0) - (long long )z >= 0LL) && (1LL + (long long )y$w_buff1) - (long long )z >= 0LL) && (1LL + (long long )weak$$choice0) - (long long )z >= 0LL) && (1LL + (long long )weak$$choice2) - (long long )z >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$r_buff0_thd1 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$r_buff0_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$r_buff1_thd1 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff0_thd1) - (long long )y$r_buff0_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) - (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) - (long long )y$r_buff1_thd1 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) - (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) - (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff0_thd2) - (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) - (long long )y$r_buff1_thd1 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) - (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) - (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd0) - (long long )y$r_buff1_thd1 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) - (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) - (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd1) - (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff1_thd1) - (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd2) - (long long )y$read_delayed >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) - (long long )y$r_buff0_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) - (long long )y$r_buff0_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) - (long long )y$r_buff0_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) - (long long )y$r_buff1_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) - (long long )y$r_buff1_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) - (long long )y$r_buff1_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) - (long long )y$read_delayed >= 0LL) && (1LL - (long long )y$r_buff0_thd0) - (long long )z >= 0LL) && (1LL - (long long )y$r_buff0_thd1) - (long long )z >= 0LL) && (1LL - (long long )y$r_buff0_thd2) - (long long )z >= 0LL) && (1LL - (long long )y$r_buff1_thd0) - (long long )z >= 0LL) && (1LL - (long long )y$r_buff1_thd1) - (long long )z >= 0LL) && (1LL - (long long )y$r_buff1_thd2) - (long long )z >= 0LL) && (1LL - (long long )y$read_delayed) - (long long )z >= 0LL) && (2LL - (long long )__unbuffered_p2_EAX) - (long long )z >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )y$read_delayed >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff0_thd1 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff0_thd2 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff1_thd1 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$read_delayed >= 0LL) && (long long )x - (long long )y$r_buff0_thd0 >= 0LL) && (long long )x - (long long )y$r_buff0_thd1 >= 0LL) && (long long )x - (long long )y$r_buff0_thd2 >= 0LL) && (long long )x - (long long )y$r_buff1_thd0 >= 0LL) && (long long )x - (long long )y$r_buff1_thd1 >= 0LL) && (long long )x - (long long )y$r_buff1_thd2 >= 0LL) && (long long )x - (long long )y$read_delayed >= 0LL) && (long long )y - (long long )y$r_buff0_thd0 >= 0LL) && (long long )y - (long long )y$r_buff0_thd1 >= 0LL) && (long long )y - (long long )y$r_buff0_thd2 >= 0LL) && (long long )y - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y - (long long )y$r_buff1_thd1 >= 0LL) && (long long )y - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y - (long long )y$read_delayed >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff0_thd0 >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff0_thd1 >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$flush_delayed - (long long )y$read_delayed >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff0_thd0 >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff0_thd1 >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$mem_tmp - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$r_buff0_thd1 >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd1 - (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$r_buff0_thd1 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd1 - (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff0_thd1 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd1 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd2 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd2 - (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff0_thd2 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd2 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd3 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd3 - (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff0_thd3 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd3 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd0 - (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff1_thd0 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff1_thd0 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd1 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff1_thd1 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd2 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd3 - (long long )y$read_delayed >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff0_thd1 >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff0_thd2 >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff1_thd1 >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )weak$$choice0 - (long long )y$read_delayed >= 0LL) && (long long )weak$$choice2 - (long long )y$flush_delayed >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff0_thd1 >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff0_thd2 >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff1_thd1 >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )weak$$choice2 - (long long )y$read_delayed >= 0LL))) && (! multithreaded || y$r_buff0_thd2 == (_Bool)0)) && (! multithreaded || ((0 <= y$mem_tmp && y$mem_tmp <= 1) && (y$mem_tmp == 0 || y$mem_tmp == 1)))) && (! multithreaded || ((((((((((((((((((((((((((((((((0 <= __unbuffered_cnt && 0 <= __unbuffered_p1_EAX) && 0 <= __unbuffered_p2_EAX) && 0 <= x) && 0 <= y) && 0 <= y$mem_tmp) && 0 <= y$w_buff0) && 0 <= y$w_buff1) && 0 <= z) && __unbuffered_p1_EAX <= 1) && __unbuffered_p2_EAX <= 1) && y <= 1) && y$mem_tmp <= 1) && y$w_buff0 <= 1) && y$w_buff1 <= 1) && z <= 1) && y$flush_delayed == (_Bool)0) && y$r_buff0_thd0 == (_Bool)0) && y$r_buff0_thd1 == (_Bool)0) && y$r_buff0_thd2 == (_Bool)0) && y$r_buff1_thd0 == (_Bool)0) && y$r_buff1_thd1 == (_Bool)0) && y$r_buff1_thd2 == (_Bool)0) && y$read_delayed == (_Bool)0) && y$read_delayed_var == 0) && (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1)) && (__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1)) && (y == 0 || y == 1)) && (y$mem_tmp == 0 || y$mem_tmp == 1)) && (y$w_buff0 == 0 || y$w_buff0 == 1)) && (y$w_buff1 == 0 || y$w_buff1 == 1)) && (z == 0 || z == 1)) && ((x == 0 || x == 1) || x == 2)))) && (! multithreaded || y$r_buff1_thd2 == (_Bool)0)) && (! multithreaded || ((0 <= y$w_buff1 && y$w_buff1 <= 1) && (y$w_buff1 == 0 || y$w_buff1 == 1)))) && (! multithreaded || y$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || y$r_buff0_thd1 == (_Bool)0)) && (! multithreaded || y$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || y$read_delayed == (_Bool)0)) && (! multithreaded || (((0 <= x && x <= 2) && x <= 127) && ((x == 0 || x == 1) || x == 2)))) && (! multithreaded || ((0 <= y && y <= 1) && (y == 0 || y == 1)))) && (! multithreaded || ((0 <= y$w_buff0 && y$w_buff0 <= 1) && (y$w_buff0 == 0 || y$w_buff0 == 1)))) && (! multithreaded || ((0 <= z && z <= 1) && (z == 0 || z == 1))) [2024-06-14 15:26:40,865 INFO L97 edCorrectnessWitness]: Location invariant before [L828-L828] ((((((((((((((((((! multithreaded || y$r_buff1_thd1 == (_Bool)0) && (! multithreaded || ((0 <= __unbuffered_p2_EAX && __unbuffered_p2_EAX <= 1) && (__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1)))) && (! multithreaded || ((0 <= __unbuffered_p1_EAX && __unbuffered_p1_EAX <= 1) && (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1)))) && (! multithreaded || y$read_delayed_var == 0)) && (! multithreaded || (((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((0LL - (long long )__unbuffered_p2_EAX) + (long long )z >= 0LL && (0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff0_thd1 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff0_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff0_thd3 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff1_thd1 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff1_thd3 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )z >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$r_buff0_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$r_buff0_thd3 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$r_buff1_thd1 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$r_buff1_thd3 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )z >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$r_buff0_thd3 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$r_buff1_thd1 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$r_buff1_thd3 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )z >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$r_buff1_thd1 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$r_buff1_thd3 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )z >= 0LL) && (0LL - (long long )y$r_buff1_thd1) + (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff1_thd1) + (long long )y$r_buff1_thd3 >= 0LL) && (0LL - (long long )y$r_buff1_thd1) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd1) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff1_thd1) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff1_thd1) + (long long )z >= 0LL) && (0LL - (long long )y$r_buff1_thd2) + (long long )y$r_buff1_thd3 >= 0LL) && (0LL - (long long )y$r_buff1_thd2) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd2) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff1_thd2) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff1_thd2) + (long long )z >= 0LL) && (0LL - (long long )y$read_delayed) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$read_delayed) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$read_delayed) + (long long )z >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) + (long long )main$tmp_guard1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) + (long long )x >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) + (long long )y >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) + (long long )y$flush_delayed >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) + (long long )y$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) + (long long )y$r_buff0_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) + (long long )y$r_buff0_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) + (long long )y$r_buff0_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) + (long long )y$r_buff0_thd3 >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) + (long long )y$r_buff1_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) + (long long )y$r_buff1_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) + (long long )y$r_buff1_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) + (long long )y$r_buff1_thd3 >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) + (long long )y$read_delayed >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) + (long long )y$w_buff0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) + (long long )y$w_buff1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) + (long long )weak$$choice0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p1_EAX >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p2_EAX >= 0LL) && (long long )__unbuffered_cnt + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_cnt + (long long )x >= 0LL) && (long long )__unbuffered_cnt + (long long )y >= 0LL) && (long long )__unbuffered_cnt + (long long )y$flush_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )y$mem_tmp >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )y$w_buff0 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$w_buff1 >= 0LL) && (long long )__unbuffered_cnt + (long long )z >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )__unbuffered_p2_EAX >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$flush_delayed >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$mem_tmp >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$w_buff0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$w_buff1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$flush_delayed >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$mem_tmp >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$w_buff0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$w_buff1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )weak$$choice2 >= 0LL) && (long long )main$tmp_guard1 + (long long )x >= 0LL) && (long long )main$tmp_guard1 + (long long )y >= 0LL) && (long long )main$tmp_guard1 + (long long )y$flush_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )y$mem_tmp >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff0_thd1 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff0_thd2 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff0_thd3 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff1_thd1 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff1_thd3 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$read_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )y$w_buff0 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$w_buff1 >= 0LL) && (long long )main$tmp_guard1 + (long long )z >= 0LL) && (long long )main$tmp_guard1 + (long long )weak$$choice0 >= 0LL) && (long long )main$tmp_guard1 + (long long )weak$$choice2 >= 0LL) && (long long )x + (long long )y >= 0LL) && (long long )x + (long long )y$flush_delayed >= 0LL) && (long long )x + (long long )y$mem_tmp >= 0LL) && (long long )x + (long long )y$r_buff0_thd0 >= 0LL) && (long long )x + (long long )y$r_buff0_thd1 >= 0LL) && (long long )x + (long long )y$r_buff0_thd2 >= 0LL) && (long long )x + (long long )y$r_buff0_thd3 >= 0LL) && (long long )x + (long long )y$r_buff1_thd0 >= 0LL) && (long long )x + (long long )y$r_buff1_thd1 >= 0LL) && (long long )x + (long long )y$r_buff1_thd2 >= 0LL) && (long long )x + (long long )y$r_buff1_thd3 >= 0LL) && (long long )x + (long long )y$read_delayed >= 0LL) && (long long )x + (long long )y$w_buff0 >= 0LL) && (long long )x + (long long )y$w_buff1 >= 0LL) && (long long )x + (long long )z >= 0LL) && (long long )y + (long long )y$flush_delayed >= 0LL) && (long long )y + (long long )y$mem_tmp >= 0LL) && (long long )y + (long long )y$r_buff0_thd0 >= 0LL) && (long long )y + (long long )y$r_buff0_thd1 >= 0LL) && (long long )y + (long long )y$r_buff0_thd2 >= 0LL) && (long long )y + (long long )y$r_buff0_thd3 >= 0LL) && (long long )y + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y + (long long )y$r_buff1_thd3 >= 0LL) && (long long )y + (long long )y$read_delayed >= 0LL) && (long long )y + (long long )y$w_buff0 >= 0LL) && (long long )y + (long long )y$w_buff1 >= 0LL) && (long long )y + (long long )z >= 0LL) && (long long )y$flush_delayed + (long long )y$mem_tmp >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff0_thd0 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff0_thd1 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff0_thd3 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$flush_delayed + (long long )y$read_delayed >= 0LL) && (long long )y$flush_delayed + (long long )y$w_buff0 >= 0LL) && (long long )y$flush_delayed + (long long )y$w_buff1 >= 0LL) && (long long )y$flush_delayed + (long long )z >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff0_thd0 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff0_thd1 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff0_thd3 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$mem_tmp + (long long )y$read_delayed >= 0LL) && (long long )y$mem_tmp + (long long )y$w_buff0 >= 0LL) && (long long )y$mem_tmp + (long long )y$w_buff1 >= 0LL) && (long long )y$mem_tmp + (long long )z >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff0_thd1 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff0_thd3 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )z >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$r_buff0_thd3 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )z >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$r_buff0_thd3 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )z >= 0LL) && (long long )y$r_buff0_thd3 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd3 + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff0_thd3 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd3 + (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$r_buff0_thd3 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd3 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff0_thd3 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff0_thd3 + (long long )z >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff1_thd0 + (long long )z >= 0LL) && (long long )y$r_buff1_thd1 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff1_thd1 + (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$r_buff1_thd1 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd1 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff1_thd1 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff1_thd1 + (long long )z >= 0LL) && (long long )y$r_buff1_thd2 + (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$r_buff1_thd2 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd2 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff1_thd2 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff1_thd2 + (long long )z >= 0LL) && (long long )y$r_buff1_thd3 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd3 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff1_thd3 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff1_thd3 + (long long )z >= 0LL) && (long long )y$read_delayed + (long long )y$w_buff0 >= 0LL) && (long long )y$read_delayed + (long long )y$w_buff1 >= 0LL) && (long long )y$read_delayed + (long long )z >= 0LL) && (long long )y$w_buff0 + (long long )y$w_buff1 >= 0LL) && (long long )y$w_buff0 + (long long )z >= 0LL) && (long long )y$w_buff1 + (long long )z >= 0LL) && (long long )weak$$choice0 + (long long )x >= 0LL) && (long long )weak$$choice0 + (long long )y >= 0LL) && (long long )weak$$choice0 + (long long )y$flush_delayed >= 0LL) && (long long )weak$$choice0 + (long long )y$mem_tmp >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff0_thd1 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff0_thd2 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff0_thd3 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff1_thd1 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff1_thd3 >= 0LL) && (long long )weak$$choice0 + (long long )y$read_delayed >= 0LL) && (long long )weak$$choice0 + (long long )y$w_buff0 >= 0LL) && (long long )weak$$choice0 + (long long )y$w_buff1 >= 0LL) && (long long )weak$$choice0 + (long long )z >= 0LL) && (long long )weak$$choice0 + (long long )weak$$choice2 >= 0LL) && (long long )weak$$choice2 + (long long )x >= 0LL) && (long long )weak$$choice2 + (long long )y >= 0LL) && (long long )weak$$choice2 + (long long )y$flush_delayed >= 0LL) && (long long )weak$$choice2 + (long long )y$mem_tmp >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff0_thd1 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff0_thd2 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff0_thd3 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff1_thd1 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff1_thd3 >= 0LL) && (long long )weak$$choice2 + (long long )y$read_delayed >= 0LL) && (long long )weak$$choice2 + (long long )y$w_buff0 >= 0LL) && (long long )weak$$choice2 + (long long )y$w_buff1 >= 0LL) && (long long )weak$$choice2 + (long long )z >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )__unbuffered_p2_EAX >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )z >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )__unbuffered_p2_EAX >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )z >= 0LL) && (1LL + (long long )__unbuffered_p2_EAX) - (long long )z >= 0LL) && (1LL + (long long )main$tmp_guard1) - (long long )z >= 0LL) && (1LL + (long long )x) - (long long )z >= 0LL) && (1LL + (long long )y) - (long long )z >= 0LL) && (1LL + (long long )y$flush_delayed) - (long long )z >= 0LL) && (1LL + (long long )y$mem_tmp) - (long long )z >= 0LL) && (1LL + (long long )y$r_buff0_thd0) - (long long )z >= 0LL) && (1LL + (long long )y$r_buff0_thd1) - (long long )z >= 0LL) && (1LL + (long long )y$r_buff0_thd2) - (long long )z >= 0LL) && (1LL + (long long )y$r_buff0_thd3) - (long long )z >= 0LL) && (1LL + (long long )y$r_buff1_thd0) - (long long )z >= 0LL) && (1LL + (long long )y$r_buff1_thd1) - (long long )z >= 0LL) && (1LL + (long long )y$r_buff1_thd2) - (long long )z >= 0LL) && (1LL + (long long )y$r_buff1_thd3) - (long long )z >= 0LL) && (1LL + (long long )y$read_delayed) - (long long )z >= 0LL) && (1LL + (long long )y$w_buff0) - (long long )z >= 0LL) && (1LL + (long long )y$w_buff1) - (long long )z >= 0LL) && (1LL + (long long )weak$$choice0) - (long long )z >= 0LL) && (1LL + (long long )weak$$choice2) - (long long )z >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$r_buff0_thd1 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$r_buff0_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$r_buff1_thd1 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff0_thd1) - (long long )y$r_buff0_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) - (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) - (long long )y$r_buff1_thd1 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) - (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) - (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff0_thd2) - (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) - (long long )y$r_buff1_thd1 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) - (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) - (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd0) - (long long )y$r_buff1_thd1 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) - (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) - (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd1) - (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff1_thd1) - (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd2) - (long long )y$read_delayed >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) - (long long )y$r_buff0_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) - (long long )y$r_buff0_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) - (long long )y$r_buff0_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) - (long long )y$r_buff1_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) - (long long )y$r_buff1_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) - (long long )y$r_buff1_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) - (long long )y$read_delayed >= 0LL) && (1LL - (long long )y$r_buff0_thd0) - (long long )z >= 0LL) && (1LL - (long long )y$r_buff0_thd1) - (long long )z >= 0LL) && (1LL - (long long )y$r_buff0_thd2) - (long long )z >= 0LL) && (1LL - (long long )y$r_buff1_thd0) - (long long )z >= 0LL) && (1LL - (long long )y$r_buff1_thd1) - (long long )z >= 0LL) && (1LL - (long long )y$r_buff1_thd2) - (long long )z >= 0LL) && (1LL - (long long )y$read_delayed) - (long long )z >= 0LL) && (2LL - (long long )__unbuffered_p2_EAX) - (long long )z >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )y$read_delayed >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff0_thd1 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff0_thd2 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff1_thd1 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$read_delayed >= 0LL) && (long long )x - (long long )y$r_buff0_thd0 >= 0LL) && (long long )x - (long long )y$r_buff0_thd1 >= 0LL) && (long long )x - (long long )y$r_buff0_thd2 >= 0LL) && (long long )x - (long long )y$r_buff1_thd0 >= 0LL) && (long long )x - (long long )y$r_buff1_thd1 >= 0LL) && (long long )x - (long long )y$r_buff1_thd2 >= 0LL) && (long long )x - (long long )y$read_delayed >= 0LL) && (long long )y - (long long )y$r_buff0_thd0 >= 0LL) && (long long )y - (long long )y$r_buff0_thd1 >= 0LL) && (long long )y - (long long )y$r_buff0_thd2 >= 0LL) && (long long )y - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y - (long long )y$r_buff1_thd1 >= 0LL) && (long long )y - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y - (long long )y$read_delayed >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff0_thd0 >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff0_thd1 >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$flush_delayed - (long long )y$read_delayed >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff0_thd0 >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff0_thd1 >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$mem_tmp - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$r_buff0_thd1 >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd1 - (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$r_buff0_thd1 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd1 - (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff0_thd1 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd1 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd2 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd2 - (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff0_thd2 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd2 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd3 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd3 - (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff0_thd3 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd3 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd0 - (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff1_thd0 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff1_thd0 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd1 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff1_thd1 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd2 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd3 - (long long )y$read_delayed >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff0_thd1 >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff0_thd2 >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff1_thd1 >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )weak$$choice0 - (long long )y$read_delayed >= 0LL) && (long long )weak$$choice2 - (long long )y$flush_delayed >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff0_thd1 >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff0_thd2 >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff1_thd1 >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )weak$$choice2 - (long long )y$read_delayed >= 0LL))) && (! multithreaded || y$r_buff0_thd2 == (_Bool)0)) && (! multithreaded || ((0 <= y$mem_tmp && y$mem_tmp <= 1) && (y$mem_tmp == 0 || y$mem_tmp == 1)))) && (! multithreaded || ((((((((((((((((((((((((((((((((0 <= __unbuffered_cnt && 0 <= __unbuffered_p1_EAX) && 0 <= __unbuffered_p2_EAX) && 0 <= x) && 0 <= y) && 0 <= y$mem_tmp) && 0 <= y$w_buff0) && 0 <= y$w_buff1) && 0 <= z) && __unbuffered_p1_EAX <= 1) && __unbuffered_p2_EAX <= 1) && y <= 1) && y$mem_tmp <= 1) && y$w_buff0 <= 1) && y$w_buff1 <= 1) && z <= 1) && y$flush_delayed == (_Bool)0) && y$r_buff0_thd0 == (_Bool)0) && y$r_buff0_thd1 == (_Bool)0) && y$r_buff0_thd2 == (_Bool)0) && y$r_buff1_thd0 == (_Bool)0) && y$r_buff1_thd1 == (_Bool)0) && y$r_buff1_thd2 == (_Bool)0) && y$read_delayed == (_Bool)0) && y$read_delayed_var == 0) && (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1)) && (__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1)) && (y == 0 || y == 1)) && (y$mem_tmp == 0 || y$mem_tmp == 1)) && (y$w_buff0 == 0 || y$w_buff0 == 1)) && (y$w_buff1 == 0 || y$w_buff1 == 1)) && (z == 0 || z == 1)) && ((x == 0 || x == 1) || x == 2)))) && (! multithreaded || y$r_buff1_thd2 == (_Bool)0)) && (! multithreaded || ((0 <= y$w_buff1 && y$w_buff1 <= 1) && (y$w_buff1 == 0 || y$w_buff1 == 1)))) && (! multithreaded || y$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || y$r_buff0_thd1 == (_Bool)0)) && (! multithreaded || y$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || y$read_delayed == (_Bool)0)) && (! multithreaded || (((0 <= x && x <= 2) && x <= 127) && ((x == 0 || x == 1) || x == 2)))) && (! multithreaded || ((0 <= y && y <= 1) && (y == 0 || y == 1)))) && (! multithreaded || ((0 <= y$w_buff0 && y$w_buff0 <= 1) && (y$w_buff0 == 0 || y$w_buff0 == 1)))) && (! multithreaded || ((0 <= z && z <= 1) && (z == 0 || z == 1))) [2024-06-14 15:26:40,865 INFO L97 edCorrectnessWitness]: Location invariant before [L829-L829] ((((((((((((((((((! multithreaded || y$r_buff1_thd1 == (_Bool)0) && (! multithreaded || ((0 <= __unbuffered_p2_EAX && __unbuffered_p2_EAX <= 1) && (__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1)))) && (! multithreaded || ((0 <= __unbuffered_p1_EAX && __unbuffered_p1_EAX <= 1) && (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1)))) && (! multithreaded || y$read_delayed_var == 0)) && (! multithreaded || (((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((0LL - (long long )__unbuffered_p2_EAX) + (long long )z >= 0LL && (0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff0_thd1 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff0_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff0_thd3 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff1_thd1 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff1_thd3 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )z >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$r_buff0_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$r_buff0_thd3 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$r_buff1_thd1 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$r_buff1_thd3 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )z >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$r_buff0_thd3 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$r_buff1_thd1 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$r_buff1_thd3 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )z >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$r_buff1_thd1 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$r_buff1_thd3 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )z >= 0LL) && (0LL - (long long )y$r_buff1_thd1) + (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff1_thd1) + (long long )y$r_buff1_thd3 >= 0LL) && (0LL - (long long )y$r_buff1_thd1) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd1) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff1_thd1) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff1_thd1) + (long long )z >= 0LL) && (0LL - (long long )y$r_buff1_thd2) + (long long )y$r_buff1_thd3 >= 0LL) && (0LL - (long long )y$r_buff1_thd2) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd2) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff1_thd2) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff1_thd2) + (long long )z >= 0LL) && (0LL - (long long )y$read_delayed) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$read_delayed) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$read_delayed) + (long long )z >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) + (long long )main$tmp_guard1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) + (long long )x >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) + (long long )y >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) + (long long )y$flush_delayed >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) + (long long )y$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) + (long long )y$r_buff0_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) + (long long )y$r_buff0_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) + (long long )y$r_buff0_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) + (long long )y$r_buff0_thd3 >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) + (long long )y$r_buff1_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) + (long long )y$r_buff1_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) + (long long )y$r_buff1_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) + (long long )y$r_buff1_thd3 >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) + (long long )y$read_delayed >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) + (long long )y$w_buff0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) + (long long )y$w_buff1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) + (long long )weak$$choice0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p1_EAX >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p2_EAX >= 0LL) && (long long )__unbuffered_cnt + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_cnt + (long long )x >= 0LL) && (long long )__unbuffered_cnt + (long long )y >= 0LL) && (long long )__unbuffered_cnt + (long long )y$flush_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )y$mem_tmp >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )y$w_buff0 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$w_buff1 >= 0LL) && (long long )__unbuffered_cnt + (long long )z >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )__unbuffered_p2_EAX >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$flush_delayed >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$mem_tmp >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$w_buff0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$w_buff1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$flush_delayed >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$mem_tmp >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$w_buff0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$w_buff1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )weak$$choice2 >= 0LL) && (long long )main$tmp_guard1 + (long long )x >= 0LL) && (long long )main$tmp_guard1 + (long long )y >= 0LL) && (long long )main$tmp_guard1 + (long long )y$flush_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )y$mem_tmp >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff0_thd1 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff0_thd2 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff0_thd3 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff1_thd1 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff1_thd3 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$read_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )y$w_buff0 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$w_buff1 >= 0LL) && (long long )main$tmp_guard1 + (long long )z >= 0LL) && (long long )main$tmp_guard1 + (long long )weak$$choice0 >= 0LL) && (long long )main$tmp_guard1 + (long long )weak$$choice2 >= 0LL) && (long long )x + (long long )y >= 0LL) && (long long )x + (long long )y$flush_delayed >= 0LL) && (long long )x + (long long )y$mem_tmp >= 0LL) && (long long )x + (long long )y$r_buff0_thd0 >= 0LL) && (long long )x + (long long )y$r_buff0_thd1 >= 0LL) && (long long )x + (long long )y$r_buff0_thd2 >= 0LL) && (long long )x + (long long )y$r_buff0_thd3 >= 0LL) && (long long )x + (long long )y$r_buff1_thd0 >= 0LL) && (long long )x + (long long )y$r_buff1_thd1 >= 0LL) && (long long )x + (long long )y$r_buff1_thd2 >= 0LL) && (long long )x + (long long )y$r_buff1_thd3 >= 0LL) && (long long )x + (long long )y$read_delayed >= 0LL) && (long long )x + (long long )y$w_buff0 >= 0LL) && (long long )x + (long long )y$w_buff1 >= 0LL) && (long long )x + (long long )z >= 0LL) && (long long )y + (long long )y$flush_delayed >= 0LL) && (long long )y + (long long )y$mem_tmp >= 0LL) && (long long )y + (long long )y$r_buff0_thd0 >= 0LL) && (long long )y + (long long )y$r_buff0_thd1 >= 0LL) && (long long )y + (long long )y$r_buff0_thd2 >= 0LL) && (long long )y + (long long )y$r_buff0_thd3 >= 0LL) && (long long )y + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y + (long long )y$r_buff1_thd3 >= 0LL) && (long long )y + (long long )y$read_delayed >= 0LL) && (long long )y + (long long )y$w_buff0 >= 0LL) && (long long )y + (long long )y$w_buff1 >= 0LL) && (long long )y + (long long )z >= 0LL) && (long long )y$flush_delayed + (long long )y$mem_tmp >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff0_thd0 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff0_thd1 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff0_thd3 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$flush_delayed + (long long )y$read_delayed >= 0LL) && (long long )y$flush_delayed + (long long )y$w_buff0 >= 0LL) && (long long )y$flush_delayed + (long long )y$w_buff1 >= 0LL) && (long long )y$flush_delayed + (long long )z >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff0_thd0 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff0_thd1 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff0_thd3 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$mem_tmp + (long long )y$read_delayed >= 0LL) && (long long )y$mem_tmp + (long long )y$w_buff0 >= 0LL) && (long long )y$mem_tmp + (long long )y$w_buff1 >= 0LL) && (long long )y$mem_tmp + (long long )z >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff0_thd1 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff0_thd3 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )z >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$r_buff0_thd3 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )z >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$r_buff0_thd3 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )z >= 0LL) && (long long )y$r_buff0_thd3 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd3 + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff0_thd3 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd3 + (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$r_buff0_thd3 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd3 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff0_thd3 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff0_thd3 + (long long )z >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff1_thd0 + (long long )z >= 0LL) && (long long )y$r_buff1_thd1 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff1_thd1 + (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$r_buff1_thd1 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd1 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff1_thd1 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff1_thd1 + (long long )z >= 0LL) && (long long )y$r_buff1_thd2 + (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$r_buff1_thd2 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd2 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff1_thd2 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff1_thd2 + (long long )z >= 0LL) && (long long )y$r_buff1_thd3 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd3 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff1_thd3 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff1_thd3 + (long long )z >= 0LL) && (long long )y$read_delayed + (long long )y$w_buff0 >= 0LL) && (long long )y$read_delayed + (long long )y$w_buff1 >= 0LL) && (long long )y$read_delayed + (long long )z >= 0LL) && (long long )y$w_buff0 + (long long )y$w_buff1 >= 0LL) && (long long )y$w_buff0 + (long long )z >= 0LL) && (long long )y$w_buff1 + (long long )z >= 0LL) && (long long )weak$$choice0 + (long long )x >= 0LL) && (long long )weak$$choice0 + (long long )y >= 0LL) && (long long )weak$$choice0 + (long long )y$flush_delayed >= 0LL) && (long long )weak$$choice0 + (long long )y$mem_tmp >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff0_thd1 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff0_thd2 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff0_thd3 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff1_thd1 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff1_thd3 >= 0LL) && (long long )weak$$choice0 + (long long )y$read_delayed >= 0LL) && (long long )weak$$choice0 + (long long )y$w_buff0 >= 0LL) && (long long )weak$$choice0 + (long long )y$w_buff1 >= 0LL) && (long long )weak$$choice0 + (long long )z >= 0LL) && (long long )weak$$choice0 + (long long )weak$$choice2 >= 0LL) && (long long )weak$$choice2 + (long long )x >= 0LL) && (long long )weak$$choice2 + (long long )y >= 0LL) && (long long )weak$$choice2 + (long long )y$flush_delayed >= 0LL) && (long long )weak$$choice2 + (long long )y$mem_tmp >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff0_thd1 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff0_thd2 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff0_thd3 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff1_thd1 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff1_thd3 >= 0LL) && (long long )weak$$choice2 + (long long )y$read_delayed >= 0LL) && (long long )weak$$choice2 + (long long )y$w_buff0 >= 0LL) && (long long )weak$$choice2 + (long long )y$w_buff1 >= 0LL) && (long long )weak$$choice2 + (long long )z >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )__unbuffered_p2_EAX >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )z >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )__unbuffered_p2_EAX >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )z >= 0LL) && (1LL + (long long )__unbuffered_p2_EAX) - (long long )z >= 0LL) && (1LL + (long long )main$tmp_guard1) - (long long )z >= 0LL) && (1LL + (long long )x) - (long long )z >= 0LL) && (1LL + (long long )y) - (long long )z >= 0LL) && (1LL + (long long )y$flush_delayed) - (long long )z >= 0LL) && (1LL + (long long )y$mem_tmp) - (long long )z >= 0LL) && (1LL + (long long )y$r_buff0_thd0) - (long long )z >= 0LL) && (1LL + (long long )y$r_buff0_thd1) - (long long )z >= 0LL) && (1LL + (long long )y$r_buff0_thd2) - (long long )z >= 0LL) && (1LL + (long long )y$r_buff0_thd3) - (long long )z >= 0LL) && (1LL + (long long )y$r_buff1_thd0) - (long long )z >= 0LL) && (1LL + (long long )y$r_buff1_thd1) - (long long )z >= 0LL) && (1LL + (long long )y$r_buff1_thd2) - (long long )z >= 0LL) && (1LL + (long long )y$r_buff1_thd3) - (long long )z >= 0LL) && (1LL + (long long )y$read_delayed) - (long long )z >= 0LL) && (1LL + (long long )y$w_buff0) - (long long )z >= 0LL) && (1LL + (long long )y$w_buff1) - (long long )z >= 0LL) && (1LL + (long long )weak$$choice0) - (long long )z >= 0LL) && (1LL + (long long )weak$$choice2) - (long long )z >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$r_buff0_thd1 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$r_buff0_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$r_buff1_thd1 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff0_thd1) - (long long )y$r_buff0_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) - (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) - (long long )y$r_buff1_thd1 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) - (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) - (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff0_thd2) - (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) - (long long )y$r_buff1_thd1 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) - (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) - (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd0) - (long long )y$r_buff1_thd1 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) - (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) - (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd1) - (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff1_thd1) - (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd2) - (long long )y$read_delayed >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) - (long long )y$r_buff0_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) - (long long )y$r_buff0_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) - (long long )y$r_buff0_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) - (long long )y$r_buff1_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) - (long long )y$r_buff1_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) - (long long )y$r_buff1_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) - (long long )y$read_delayed >= 0LL) && (1LL - (long long )y$r_buff0_thd0) - (long long )z >= 0LL) && (1LL - (long long )y$r_buff0_thd1) - (long long )z >= 0LL) && (1LL - (long long )y$r_buff0_thd2) - (long long )z >= 0LL) && (1LL - (long long )y$r_buff1_thd0) - (long long )z >= 0LL) && (1LL - (long long )y$r_buff1_thd1) - (long long )z >= 0LL) && (1LL - (long long )y$r_buff1_thd2) - (long long )z >= 0LL) && (1LL - (long long )y$read_delayed) - (long long )z >= 0LL) && (2LL - (long long )__unbuffered_p2_EAX) - (long long )z >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )y$read_delayed >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff0_thd1 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff0_thd2 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff1_thd1 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$read_delayed >= 0LL) && (long long )x - (long long )y$r_buff0_thd0 >= 0LL) && (long long )x - (long long )y$r_buff0_thd1 >= 0LL) && (long long )x - (long long )y$r_buff0_thd2 >= 0LL) && (long long )x - (long long )y$r_buff1_thd0 >= 0LL) && (long long )x - (long long )y$r_buff1_thd1 >= 0LL) && (long long )x - (long long )y$r_buff1_thd2 >= 0LL) && (long long )x - (long long )y$read_delayed >= 0LL) && (long long )y - (long long )y$r_buff0_thd0 >= 0LL) && (long long )y - (long long )y$r_buff0_thd1 >= 0LL) && (long long )y - (long long )y$r_buff0_thd2 >= 0LL) && (long long )y - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y - (long long )y$r_buff1_thd1 >= 0LL) && (long long )y - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y - (long long )y$read_delayed >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff0_thd0 >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff0_thd1 >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$flush_delayed - (long long )y$read_delayed >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff0_thd0 >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff0_thd1 >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$mem_tmp - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$r_buff0_thd1 >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd1 - (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$r_buff0_thd1 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd1 - (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff0_thd1 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd1 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd2 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd2 - (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff0_thd2 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd2 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd3 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd3 - (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff0_thd3 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd3 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd0 - (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff1_thd0 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff1_thd0 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd1 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff1_thd1 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd2 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd3 - (long long )y$read_delayed >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff0_thd1 >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff0_thd2 >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff1_thd1 >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )weak$$choice0 - (long long )y$read_delayed >= 0LL) && (long long )weak$$choice2 - (long long )y$flush_delayed >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff0_thd1 >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff0_thd2 >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff1_thd1 >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )weak$$choice2 - (long long )y$read_delayed >= 0LL))) && (! multithreaded || y$r_buff0_thd2 == (_Bool)0)) && (! multithreaded || ((0 <= y$mem_tmp && y$mem_tmp <= 1) && (y$mem_tmp == 0 || y$mem_tmp == 1)))) && (! multithreaded || ((((((((((((((((((((((((((((((((0 <= __unbuffered_cnt && 0 <= __unbuffered_p1_EAX) && 0 <= __unbuffered_p2_EAX) && 0 <= x) && 0 <= y) && 0 <= y$mem_tmp) && 0 <= y$w_buff0) && 0 <= y$w_buff1) && 0 <= z) && __unbuffered_p1_EAX <= 1) && __unbuffered_p2_EAX <= 1) && y <= 1) && y$mem_tmp <= 1) && y$w_buff0 <= 1) && y$w_buff1 <= 1) && z <= 1) && y$flush_delayed == (_Bool)0) && y$r_buff0_thd0 == (_Bool)0) && y$r_buff0_thd1 == (_Bool)0) && y$r_buff0_thd2 == (_Bool)0) && y$r_buff1_thd0 == (_Bool)0) && y$r_buff1_thd1 == (_Bool)0) && y$r_buff1_thd2 == (_Bool)0) && y$read_delayed == (_Bool)0) && y$read_delayed_var == 0) && (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1)) && (__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1)) && (y == 0 || y == 1)) && (y$mem_tmp == 0 || y$mem_tmp == 1)) && (y$w_buff0 == 0 || y$w_buff0 == 1)) && (y$w_buff1 == 0 || y$w_buff1 == 1)) && (z == 0 || z == 1)) && ((x == 0 || x == 1) || x == 2)))) && (! multithreaded || y$r_buff1_thd2 == (_Bool)0)) && (! multithreaded || ((0 <= y$w_buff1 && y$w_buff1 <= 1) && (y$w_buff1 == 0 || y$w_buff1 == 1)))) && (! multithreaded || y$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || y$r_buff0_thd1 == (_Bool)0)) && (! multithreaded || y$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || y$read_delayed == (_Bool)0)) && (! multithreaded || (((0 <= x && x <= 2) && x <= 127) && ((x == 0 || x == 1) || x == 2)))) && (! multithreaded || ((0 <= y && y <= 1) && (y == 0 || y == 1)))) && (! multithreaded || ((0 <= y$w_buff0 && y$w_buff0 <= 1) && (y$w_buff0 == 0 || y$w_buff0 == 1)))) && (! multithreaded || ((0 <= z && z <= 1) && (z == 0 || z == 1))) [2024-06-14 15:26:40,866 INFO L103 edCorrectnessWitness]: ghost_variable multithreaded = 0 [2024-06-14 15:26:40,866 INFO L106 edCorrectnessWitness]: ghost_update [L824-L824] multithreaded = 1; [2024-06-14 15:26:40,903 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-06-14 15:26:41,271 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-14 15:26:41,280 INFO L202 MainTranslator]: Completed pre-run Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local [2024-06-14 15:26:41,559 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-14 15:26:41,592 INFO L206 MainTranslator]: Completed translation [2024-06-14 15:26:41,593 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.06 03:26:41 WrapperNode [2024-06-14 15:26:41,593 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-06-14 15:26:41,594 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-06-14 15:26:41,594 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-06-14 15:26:41,594 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-06-14 15:26:41,600 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.06 03:26:41" (1/1) ... [2024-06-14 15:26:41,641 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.06 03:26:41" (1/1) ... [2024-06-14 15:26:41,788 INFO L138 Inliner]: procedures = 175, calls = 43, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 125 [2024-06-14 15:26:41,789 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-06-14 15:26:41,790 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-06-14 15:26:41,790 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-06-14 15:26:41,790 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-06-14 15:26:41,798 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.06 03:26:41" (1/1) ... [2024-06-14 15:26:41,799 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.06 03:26:41" (1/1) ... [2024-06-14 15:26:41,822 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.06 03:26:41" (1/1) ... [2024-06-14 15:26:41,861 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-06-14 15:26:41,861 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.06 03:26:41" (1/1) ... [2024-06-14 15:26:41,861 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.06 03:26:41" (1/1) ... [2024-06-14 15:26:41,904 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.06 03:26:41" (1/1) ... [2024-06-14 15:26:41,906 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.06 03:26:41" (1/1) ... [2024-06-14 15:26:41,918 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.06 03:26:41" (1/1) ... [2024-06-14 15:26:41,923 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.06 03:26:41" (1/1) ... [2024-06-14 15:26:41,939 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-06-14 15:26:41,941 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-06-14 15:26:41,941 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-06-14 15:26:41,941 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-06-14 15:26:41,942 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.06 03:26:41" (1/1) ... [2024-06-14 15:26:41,946 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-14 15:26:41,953 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-14 15:26:41,986 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-06-14 15:26:42,021 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-06-14 15:26:42,036 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-06-14 15:26:42,037 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-06-14 15:26:42,037 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-06-14 15:26:42,037 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-06-14 15:26:42,037 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-06-14 15:26:42,037 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-06-14 15:26:42,038 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2024-06-14 15:26:42,038 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2024-06-14 15:26:42,038 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-06-14 15:26:42,038 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-06-14 15:26:42,038 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-06-14 15:26:42,038 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-06-14 15:26:42,040 WARN L214 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-06-14 15:26:42,182 INFO L244 CfgBuilder]: Building ICFG [2024-06-14 15:26:42,184 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-06-14 15:26:43,290 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-06-14 15:26:43,290 INFO L293 CfgBuilder]: Performing block encoding [2024-06-14 15:26:43,538 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-06-14 15:26:43,539 INFO L320 CfgBuilder]: Removed 0 assume(true) statements. [2024-06-14 15:26:43,539 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.06 03:26:43 BoogieIcfgContainer [2024-06-14 15:26:43,539 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-06-14 15:26:43,542 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-06-14 15:26:43,542 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-06-14 15:26:43,545 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-06-14 15:26:43,545 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 14.06 03:26:39" (1/4) ... [2024-06-14 15:26:43,546 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f9e8b8d and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 14.06 03:26:43, skipping insertion in model container [2024-06-14 15:26:43,546 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.06 03:26:40" (2/4) ... [2024-06-14 15:26:43,546 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f9e8b8d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.06 03:26:43, skipping insertion in model container [2024-06-14 15:26:43,546 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.06 03:26:41" (3/4) ... [2024-06-14 15:26:43,547 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f9e8b8d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.06 03:26:43, skipping insertion in model container [2024-06-14 15:26:43,547 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.06 03:26:43" (4/4) ... [2024-06-14 15:26:43,548 INFO L112 eAbstractionObserver]: Analyzing ICFG mix052_pso.opt_rmo.opt_tso.opt.i [2024-06-14 15:26:43,562 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-06-14 15:26:43,562 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations. [2024-06-14 15:26:43,562 INFO L522 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-06-14 15:26:43,670 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-06-14 15:26:43,702 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 51 places, 41 transitions, 94 flow [2024-06-14 15:26:43,750 INFO L124 PetriNetUnfolderBase]: 0/38 cut-off events. [2024-06-14 15:26:43,750 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-14 15:26:43,753 INFO L83 FinitePrefix]: Finished finitePrefix Result has 48 conditions, 38 events. 0/38 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/35 useless extension candidates. Maximal degree in co-relation 0. Up to 1 conditions per place. [2024-06-14 15:26:43,753 INFO L82 GeneralOperation]: Start removeDead. Operand has 51 places, 41 transitions, 94 flow [2024-06-14 15:26:43,756 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 42 places, 32 transitions, 73 flow [2024-06-14 15:26:43,768 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-06-14 15:26:43,775 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;@44c02ba5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-06-14 15:26:43,775 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2024-06-14 15:26:43,783 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-06-14 15:26:43,783 INFO L124 PetriNetUnfolderBase]: 0/7 cut-off events. [2024-06-14 15:26:43,783 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-14 15:26:43,783 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:26:43,784 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2024-06-14 15:26:43,785 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 15:26:43,825 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:26:43,826 INFO L85 PathProgramCache]: Analyzing trace with hash -1879000425, now seen corresponding path program 1 times [2024-06-14 15:26:43,834 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:26:43,835 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1924458764] [2024-06-14 15:26:43,835 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:26:43,836 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:26:44,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:26:49,067 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:26:49,068 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:26:49,068 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1924458764] [2024-06-14 15:26:49,069 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1924458764] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:26:49,069 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:26:49,069 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-06-14 15:26:49,070 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [292380554] [2024-06-14 15:26:49,071 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:26:49,077 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-06-14 15:26:49,081 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:26:49,103 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-06-14 15:26:49,104 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-06-14 15:26:49,169 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 41 [2024-06-14 15:26:49,171 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 32 transitions, 73 flow. Second operand has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:26:49,172 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:26:49,172 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 41 [2024-06-14 15:26:49,173 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:26:49,922 INFO L124 PetriNetUnfolderBase]: 946/1517 cut-off events. [2024-06-14 15:26:49,923 INFO L125 PetriNetUnfolderBase]: For 28/28 co-relation queries the response was YES. [2024-06-14 15:26:49,929 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3025 conditions, 1517 events. 946/1517 cut-off events. For 28/28 co-relation queries the response was YES. Maximal size of possible extension queue 79. Compared 7364 event pairs, 638 based on Foata normal form. 1/1473 useless extension candidates. Maximal degree in co-relation 3010. Up to 1431 conditions per place. [2024-06-14 15:26:49,937 INFO L140 encePairwiseOnDemand]: 34/41 looper letters, 32 selfloop transitions, 4 changer transitions 0/42 dead transitions. [2024-06-14 15:26:49,937 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 42 transitions, 171 flow [2024-06-14 15:26:49,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-06-14 15:26:49,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-06-14 15:26:49,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 75 transitions. [2024-06-14 15:26:49,948 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6097560975609756 [2024-06-14 15:26:49,949 INFO L175 Difference]: Start difference. First operand has 42 places, 32 transitions, 73 flow. Second operand 3 states and 75 transitions. [2024-06-14 15:26:49,950 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 42 transitions, 171 flow [2024-06-14 15:26:49,952 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 42 transitions, 166 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-06-14 15:26:49,954 INFO L231 Difference]: Finished difference. Result has 42 places, 35 transitions, 100 flow [2024-06-14 15:26:49,956 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=70, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=100, PETRI_PLACES=42, PETRI_TRANSITIONS=35} [2024-06-14 15:26:49,958 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 0 predicate places. [2024-06-14 15:26:49,959 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 35 transitions, 100 flow [2024-06-14 15:26:49,959 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:26:49,959 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:26:49,959 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:26:49,959 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-06-14 15:26:49,960 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 15:26:49,960 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:26:49,961 INFO L85 PathProgramCache]: Analyzing trace with hash -1833111882, now seen corresponding path program 1 times [2024-06-14 15:26:49,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:26:49,961 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1847376103] [2024-06-14 15:26:49,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:26:49,962 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:26:50,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:26:53,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-14 15:26:53,510 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:26:53,510 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1847376103] [2024-06-14 15:26:53,510 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1847376103] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:26:53,511 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:26:53,511 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-06-14 15:26:53,511 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [253547173] [2024-06-14 15:26:53,511 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:26:53,513 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-06-14 15:26:53,513 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:26:53,513 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-06-14 15:26:53,514 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-06-14 15:26:53,585 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 41 [2024-06-14 15:26:53,585 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 35 transitions, 100 flow. Second operand has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:26:53,585 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:26:53,585 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 41 [2024-06-14 15:26:53,585 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:26:54,247 INFO L124 PetriNetUnfolderBase]: 1110/1713 cut-off events. [2024-06-14 15:26:54,247 INFO L125 PetriNetUnfolderBase]: For 338/338 co-relation queries the response was YES. [2024-06-14 15:26:54,250 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3936 conditions, 1713 events. 1110/1713 cut-off events. For 338/338 co-relation queries the response was YES. Maximal size of possible extension queue 88. Compared 8085 event pairs, 641 based on Foata normal form. 3/1710 useless extension candidates. Maximal degree in co-relation 3921. Up to 1652 conditions per place. [2024-06-14 15:26:54,259 INFO L140 encePairwiseOnDemand]: 33/41 looper letters, 40 selfloop transitions, 7 changer transitions 0/52 dead transitions. [2024-06-14 15:26:54,259 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 52 transitions, 240 flow [2024-06-14 15:26:54,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-06-14 15:26:54,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-06-14 15:26:54,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 94 transitions. [2024-06-14 15:26:54,262 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.573170731707317 [2024-06-14 15:26:54,262 INFO L175 Difference]: Start difference. First operand has 42 places, 35 transitions, 100 flow. Second operand 4 states and 94 transitions. [2024-06-14 15:26:54,262 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 52 transitions, 240 flow [2024-06-14 15:26:54,263 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 52 transitions, 236 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-06-14 15:26:54,265 INFO L231 Difference]: Finished difference. Result has 45 places, 38 transitions, 136 flow [2024-06-14 15:26:54,265 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=96, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=136, PETRI_PLACES=45, PETRI_TRANSITIONS=38} [2024-06-14 15:26:54,266 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 3 predicate places. [2024-06-14 15:26:54,266 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 38 transitions, 136 flow [2024-06-14 15:26:54,266 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:26:54,267 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:26:54,267 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:26:54,269 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-06-14 15:26:54,269 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 15:26:54,269 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:26:54,270 INFO L85 PathProgramCache]: Analyzing trace with hash -991892426, now seen corresponding path program 1 times [2024-06-14 15:26:54,270 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:26:54,274 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [407624542] [2024-06-14 15:26:54,275 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:26:54,275 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:26:54,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:26:58,146 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:26:58,146 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:26:58,147 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [407624542] [2024-06-14 15:26:58,147 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [407624542] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:26:58,147 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:26:58,147 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-14 15:26:58,147 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [612357464] [2024-06-14 15:26:58,147 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:26:58,148 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-14 15:26:58,148 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:26:58,148 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-14 15:26:58,149 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-06-14 15:26:58,239 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 41 [2024-06-14 15:26:58,239 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 38 transitions, 136 flow. Second operand has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:26:58,239 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:26:58,240 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 41 [2024-06-14 15:26:58,240 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:26:59,001 INFO L124 PetriNetUnfolderBase]: 1132/1764 cut-off events. [2024-06-14 15:26:59,001 INFO L125 PetriNetUnfolderBase]: For 989/989 co-relation queries the response was YES. [2024-06-14 15:26:59,004 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4498 conditions, 1764 events. 1132/1764 cut-off events. For 989/989 co-relation queries the response was YES. Maximal size of possible extension queue 89. Compared 8404 event pairs, 401 based on Foata normal form. 7/1766 useless extension candidates. Maximal degree in co-relation 4481. Up to 1555 conditions per place. [2024-06-14 15:26:59,012 INFO L140 encePairwiseOnDemand]: 31/41 looper letters, 56 selfloop transitions, 16 changer transitions 0/77 dead transitions. [2024-06-14 15:26:59,012 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 77 transitions, 406 flow [2024-06-14 15:26:59,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-14 15:26:59,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-14 15:26:59,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 126 transitions. [2024-06-14 15:26:59,014 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6146341463414634 [2024-06-14 15:26:59,014 INFO L175 Difference]: Start difference. First operand has 45 places, 38 transitions, 136 flow. Second operand 5 states and 126 transitions. [2024-06-14 15:26:59,014 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 77 transitions, 406 flow [2024-06-14 15:26:59,015 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 77 transitions, 392 flow, removed 2 selfloop flow, removed 2 redundant places. [2024-06-14 15:26:59,016 INFO L231 Difference]: Finished difference. Result has 50 places, 49 transitions, 235 flow [2024-06-14 15:26:59,017 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=122, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=235, PETRI_PLACES=50, PETRI_TRANSITIONS=49} [2024-06-14 15:26:59,017 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 8 predicate places. [2024-06-14 15:26:59,017 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 49 transitions, 235 flow [2024-06-14 15:26:59,018 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:26:59,018 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:26:59,018 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:26:59,018 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-06-14 15:26:59,018 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 15:26:59,019 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:26:59,019 INFO L85 PathProgramCache]: Analyzing trace with hash 274153525, now seen corresponding path program 1 times [2024-06-14 15:26:59,019 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:26:59,019 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1644372834] [2024-06-14 15:26:59,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:26:59,019 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:26:59,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:27:02,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-14 15:27:02,723 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:27:02,723 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1644372834] [2024-06-14 15:27:02,723 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1644372834] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:27:02,723 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:27:02,724 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-14 15:27:02,724 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1269601490] [2024-06-14 15:27:02,724 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:27:02,724 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-14 15:27:02,725 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:27:02,725 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-14 15:27:02,725 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-06-14 15:27:02,803 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 41 [2024-06-14 15:27:02,803 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 49 transitions, 235 flow. Second operand has 6 states, 6 states have (on average 12.5) internal successors, (75), 6 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:27:02,803 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:27:02,803 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 41 [2024-06-14 15:27:02,803 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:27:03,676 INFO L124 PetriNetUnfolderBase]: 1214/1910 cut-off events. [2024-06-14 15:27:03,677 INFO L125 PetriNetUnfolderBase]: For 2570/2570 co-relation queries the response was YES. [2024-06-14 15:27:03,680 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5816 conditions, 1910 events. 1214/1910 cut-off events. For 2570/2570 co-relation queries the response was YES. Maximal size of possible extension queue 107. Compared 9480 event pairs, 273 based on Foata normal form. 26/1931 useless extension candidates. Maximal degree in co-relation 5796. Up to 1519 conditions per place. [2024-06-14 15:27:03,687 INFO L140 encePairwiseOnDemand]: 31/41 looper letters, 64 selfloop transitions, 18 changer transitions 0/87 dead transitions. [2024-06-14 15:27:03,687 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 87 transitions, 523 flow [2024-06-14 15:27:03,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-14 15:27:03,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-14 15:27:03,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 147 transitions. [2024-06-14 15:27:03,691 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5975609756097561 [2024-06-14 15:27:03,691 INFO L175 Difference]: Start difference. First operand has 50 places, 49 transitions, 235 flow. Second operand 6 states and 147 transitions. [2024-06-14 15:27:03,691 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 87 transitions, 523 flow [2024-06-14 15:27:03,693 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 87 transitions, 515 flow, removed 4 selfloop flow, removed 0 redundant places. [2024-06-14 15:27:03,695 INFO L231 Difference]: Finished difference. Result has 55 places, 50 transitions, 283 flow [2024-06-14 15:27:03,695 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=219, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=283, PETRI_PLACES=55, PETRI_TRANSITIONS=50} [2024-06-14 15:27:03,695 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 13 predicate places. [2024-06-14 15:27:03,696 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 50 transitions, 283 flow [2024-06-14 15:27:03,696 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.5) internal successors, (75), 6 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:27:03,696 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:27:03,696 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:27:03,696 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-06-14 15:27:03,696 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-14 15:27:03,697 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:27:03,697 INFO L85 PathProgramCache]: Analyzing trace with hash -306618633, now seen corresponding path program 1 times [2024-06-14 15:27:03,697 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:27:03,697 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1452301429] [2024-06-14 15:27:03,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:27:03,698 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:27:03,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:27:12,089 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:27:12,089 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:27:12,089 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1452301429] [2024-06-14 15:27:12,089 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1452301429] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:27:12,089 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:27:12,089 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-14 15:27:12,090 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1954469280] [2024-06-14 15:27:12,090 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:27:12,090 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-14 15:27:12,090 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:27:12,090 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-14 15:27:12,091 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-06-14 15:27:12,177 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 41 [2024-06-14 15:27:12,178 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 50 transitions, 283 flow. Second operand has 6 states, 6 states have (on average 12.666666666666666) internal successors, (76), 6 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:27:12,178 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:27:12,178 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 41 [2024-06-14 15:27:12,178 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:27:12,881 INFO L124 PetriNetUnfolderBase]: 1034/1715 cut-off events. [2024-06-14 15:27:12,882 INFO L125 PetriNetUnfolderBase]: For 3193/3193 co-relation queries the response was YES. [2024-06-14 15:27:12,886 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5554 conditions, 1715 events. 1034/1715 cut-off events. For 3193/3193 co-relation queries the response was YES. Maximal size of possible extension queue 99. Compared 8808 event pairs, 374 based on Foata normal form. 4/1718 useless extension candidates. Maximal degree in co-relation 5531. Up to 1569 conditions per place. [2024-06-14 15:27:12,893 INFO L140 encePairwiseOnDemand]: 33/41 looper letters, 48 selfloop transitions, 8 changer transitions 0/62 dead transitions. [2024-06-14 15:27:12,894 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 62 transitions, 425 flow [2024-06-14 15:27:12,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-14 15:27:12,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-14 15:27:12,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 100 transitions. [2024-06-14 15:27:12,895 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4878048780487805 [2024-06-14 15:27:12,895 INFO L175 Difference]: Start difference. First operand has 55 places, 50 transitions, 283 flow. Second operand 5 states and 100 transitions. [2024-06-14 15:27:12,895 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 62 transitions, 425 flow [2024-06-14 15:27:12,898 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 62 transitions, 381 flow, removed 6 selfloop flow, removed 4 redundant places. [2024-06-14 15:27:12,899 INFO L231 Difference]: Finished difference. Result has 56 places, 50 transitions, 263 flow [2024-06-14 15:27:12,899 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=239, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=263, PETRI_PLACES=56, PETRI_TRANSITIONS=50} [2024-06-14 15:27:12,900 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 14 predicate places. [2024-06-14 15:27:12,900 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 50 transitions, 263 flow [2024-06-14 15:27:12,900 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.666666666666666) internal successors, (76), 6 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:27:12,900 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:27:12,900 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:27:12,900 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-06-14 15:27:12,900 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 15:27:12,901 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:27:12,901 INFO L85 PathProgramCache]: Analyzing trace with hash -513407064, now seen corresponding path program 1 times [2024-06-14 15:27:12,901 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:27:12,901 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [723962652] [2024-06-14 15:27:12,901 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:27:12,901 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:27:12,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:27:21,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-14 15:27:21,795 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:27:21,796 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [723962652] [2024-06-14 15:27:21,796 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [723962652] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:27:21,796 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:27:21,796 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-14 15:27:21,796 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2007946966] [2024-06-14 15:27:21,796 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:27:21,797 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-14 15:27:21,797 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:27:21,797 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-14 15:27:21,797 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-06-14 15:27:21,972 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 41 [2024-06-14 15:27:21,972 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 50 transitions, 263 flow. Second operand has 7 states, 7 states have (on average 11.571428571428571) internal successors, (81), 7 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:27:21,973 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:27:21,973 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 41 [2024-06-14 15:27:21,973 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:27:22,851 INFO L124 PetriNetUnfolderBase]: 1216/1914 cut-off events. [2024-06-14 15:27:22,852 INFO L125 PetriNetUnfolderBase]: For 4160/4160 co-relation queries the response was YES. [2024-06-14 15:27:22,857 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6250 conditions, 1914 events. 1216/1914 cut-off events. For 4160/4160 co-relation queries the response was YES. Maximal size of possible extension queue 106. Compared 9437 event pairs, 392 based on Foata normal form. 8/1918 useless extension candidates. Maximal degree in co-relation 6225. Up to 1698 conditions per place. [2024-06-14 15:27:22,865 INFO L140 encePairwiseOnDemand]: 31/41 looper letters, 52 selfloop transitions, 19 changer transitions 0/76 dead transitions. [2024-06-14 15:27:22,865 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 76 transitions, 503 flow [2024-06-14 15:27:22,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-14 15:27:22,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-14 15:27:22,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 124 transitions. [2024-06-14 15:27:22,866 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5040650406504065 [2024-06-14 15:27:22,866 INFO L175 Difference]: Start difference. First operand has 56 places, 50 transitions, 263 flow. Second operand 6 states and 124 transitions. [2024-06-14 15:27:22,866 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 76 transitions, 503 flow [2024-06-14 15:27:22,869 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 76 transitions, 481 flow, removed 2 selfloop flow, removed 4 redundant places. [2024-06-14 15:27:22,870 INFO L231 Difference]: Finished difference. Result has 58 places, 53 transitions, 313 flow [2024-06-14 15:27:22,870 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=241, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=313, PETRI_PLACES=58, PETRI_TRANSITIONS=53} [2024-06-14 15:27:22,870 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 16 predicate places. [2024-06-14 15:27:22,871 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 53 transitions, 313 flow [2024-06-14 15:27:22,871 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.571428571428571) internal successors, (81), 7 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:27:22,871 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:27:22,871 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:27:22,871 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-06-14 15:27:22,871 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 15:27:22,871 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:27:22,872 INFO L85 PathProgramCache]: Analyzing trace with hash 1692578784, now seen corresponding path program 2 times [2024-06-14 15:27:22,872 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:27:22,872 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1147463216] [2024-06-14 15:27:22,872 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:27:22,872 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:27:22,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:27:32,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-14 15:27:32,400 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:27:32,400 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1147463216] [2024-06-14 15:27:32,400 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1147463216] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:27:32,400 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:27:32,401 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-14 15:27:32,401 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1729414403] [2024-06-14 15:27:32,401 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:27:32,401 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-14 15:27:32,401 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:27:32,402 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-14 15:27:32,402 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-06-14 15:27:32,532 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 41 [2024-06-14 15:27:32,533 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 53 transitions, 313 flow. Second operand has 7 states, 7 states have (on average 11.571428571428571) internal successors, (81), 7 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:27:32,533 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:27:32,533 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 41 [2024-06-14 15:27:32,533 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:27:33,394 INFO L124 PetriNetUnfolderBase]: 1184/1850 cut-off events. [2024-06-14 15:27:33,395 INFO L125 PetriNetUnfolderBase]: For 4925/4925 co-relation queries the response was YES. [2024-06-14 15:27:33,398 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6307 conditions, 1850 events. 1184/1850 cut-off events. For 4925/4925 co-relation queries the response was YES. Maximal size of possible extension queue 100. Compared 8903 event pairs, 380 based on Foata normal form. 4/1853 useless extension candidates. Maximal degree in co-relation 6282. Up to 1650 conditions per place. [2024-06-14 15:27:33,404 INFO L140 encePairwiseOnDemand]: 31/41 looper letters, 57 selfloop transitions, 21 changer transitions 0/83 dead transitions. [2024-06-14 15:27:33,404 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 83 transitions, 543 flow [2024-06-14 15:27:33,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 15:27:33,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 15:27:33,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 156 transitions. [2024-06-14 15:27:33,407 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47560975609756095 [2024-06-14 15:27:33,407 INFO L175 Difference]: Start difference. First operand has 58 places, 53 transitions, 313 flow. Second operand 8 states and 156 transitions. [2024-06-14 15:27:33,407 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 83 transitions, 543 flow [2024-06-14 15:27:33,410 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 83 transitions, 514 flow, removed 4 selfloop flow, removed 3 redundant places. [2024-06-14 15:27:33,411 INFO L231 Difference]: Finished difference. Result has 63 places, 53 transitions, 334 flow [2024-06-14 15:27:33,411 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=284, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=334, PETRI_PLACES=63, PETRI_TRANSITIONS=53} [2024-06-14 15:27:33,412 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 21 predicate places. [2024-06-14 15:27:33,412 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 53 transitions, 334 flow [2024-06-14 15:27:33,413 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.571428571428571) internal successors, (81), 7 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:27:33,413 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:27:33,413 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:27:33,413 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-06-14 15:27:33,413 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 15:27:33,413 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:27:33,413 INFO L85 PathProgramCache]: Analyzing trace with hash -1293915648, now seen corresponding path program 1 times [2024-06-14 15:27:33,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:27:33,414 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1377367948] [2024-06-14 15:27:33,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:27:33,414 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:27:33,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:27:41,703 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:27:41,704 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:27:41,704 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1377367948] [2024-06-14 15:27:41,704 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1377367948] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:27:41,704 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:27:41,704 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-14 15:27:41,705 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1581458278] [2024-06-14 15:27:41,705 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:27:41,705 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-14 15:27:41,705 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:27:41,705 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-14 15:27:41,706 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-06-14 15:27:41,869 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 41 [2024-06-14 15:27:41,870 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 53 transitions, 334 flow. Second operand has 8 states, 8 states have (on average 12.5) internal successors, (100), 8 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:27:41,870 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:27:41,870 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 41 [2024-06-14 15:27:41,870 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:27:42,671 INFO L124 PetriNetUnfolderBase]: 1006/1656 cut-off events. [2024-06-14 15:27:42,671 INFO L125 PetriNetUnfolderBase]: For 5168/5168 co-relation queries the response was YES. [2024-06-14 15:27:42,675 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5683 conditions, 1656 events. 1006/1656 cut-off events. For 5168/5168 co-relation queries the response was YES. Maximal size of possible extension queue 88. Compared 8341 event pairs, 336 based on Foata normal form. 4/1659 useless extension candidates. Maximal degree in co-relation 5657. Up to 1497 conditions per place. [2024-06-14 15:27:42,684 INFO L140 encePairwiseOnDemand]: 32/41 looper letters, 59 selfloop transitions, 13 changer transitions 0/78 dead transitions. [2024-06-14 15:27:42,684 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 78 transitions, 565 flow [2024-06-14 15:27:42,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-14 15:27:42,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-14 15:27:42,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 135 transitions. [2024-06-14 15:27:42,687 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47038327526132406 [2024-06-14 15:27:42,687 INFO L175 Difference]: Start difference. First operand has 63 places, 53 transitions, 334 flow. Second operand 7 states and 135 transitions. [2024-06-14 15:27:42,687 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 78 transitions, 565 flow [2024-06-14 15:27:42,690 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 78 transitions, 493 flow, removed 3 selfloop flow, removed 8 redundant places. [2024-06-14 15:27:42,691 INFO L231 Difference]: Finished difference. Result has 63 places, 58 transitions, 342 flow [2024-06-14 15:27:42,691 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=267, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=342, PETRI_PLACES=63, PETRI_TRANSITIONS=58} [2024-06-14 15:27:42,692 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 21 predicate places. [2024-06-14 15:27:42,692 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 58 transitions, 342 flow [2024-06-14 15:27:42,692 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 12.5) internal successors, (100), 8 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:27:42,692 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:27:42,692 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:27:42,693 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-06-14 15:27:42,693 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 15:27:42,693 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:27:42,693 INFO L85 PathProgramCache]: Analyzing trace with hash -1825711828, now seen corresponding path program 1 times [2024-06-14 15:27:42,693 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:27:42,693 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1315558116] [2024-06-14 15:27:42,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:27:42,694 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:27:42,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:27:51,762 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:27:51,762 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:27:51,762 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1315558116] [2024-06-14 15:27:51,763 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1315558116] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:27:51,763 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:27:51,763 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-14 15:27:51,763 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [493063043] [2024-06-14 15:27:51,763 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:27:51,763 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-14 15:27:51,764 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:27:51,764 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-14 15:27:51,764 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-06-14 15:27:51,846 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 41 [2024-06-14 15:27:51,847 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 58 transitions, 342 flow. Second operand has 6 states, 6 states have (on average 13.166666666666666) internal successors, (79), 6 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-14 15:27:51,848 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:27:51,848 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 41 [2024-06-14 15:27:51,848 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:27:52,402 INFO L124 PetriNetUnfolderBase]: 1003/1657 cut-off events. [2024-06-14 15:27:52,403 INFO L125 PetriNetUnfolderBase]: For 5744/5744 co-relation queries the response was YES. [2024-06-14 15:27:52,406 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5873 conditions, 1657 events. 1003/1657 cut-off events. For 5744/5744 co-relation queries the response was YES. Maximal size of possible extension queue 89. Compared 8370 event pairs, 347 based on Foata normal form. 1/1657 useless extension candidates. Maximal degree in co-relation 5845. Up to 1526 conditions per place. [2024-06-14 15:27:52,411 INFO L140 encePairwiseOnDemand]: 34/41 looper letters, 55 selfloop transitions, 8 changer transitions 0/69 dead transitions. [2024-06-14 15:27:52,411 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 69 transitions, 508 flow [2024-06-14 15:27:52,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-14 15:27:52,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-14 15:27:52,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 95 transitions. [2024-06-14 15:27:52,413 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4634146341463415 [2024-06-14 15:27:52,413 INFO L175 Difference]: Start difference. First operand has 63 places, 58 transitions, 342 flow. Second operand 5 states and 95 transitions. [2024-06-14 15:27:52,413 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 69 transitions, 508 flow [2024-06-14 15:27:52,417 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 69 transitions, 475 flow, removed 6 selfloop flow, removed 4 redundant places. [2024-06-14 15:27:52,418 INFO L231 Difference]: Finished difference. Result has 64 places, 61 transitions, 357 flow [2024-06-14 15:27:52,418 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=309, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=357, PETRI_PLACES=64, PETRI_TRANSITIONS=61} [2024-06-14 15:27:52,418 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 22 predicate places. [2024-06-14 15:27:52,418 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 61 transitions, 357 flow [2024-06-14 15:27:52,419 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.166666666666666) internal successors, (79), 6 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-14 15:27:52,419 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:27:52,419 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:27:52,419 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-06-14 15:27:52,419 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 15:27:52,419 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:27:52,419 INFO L85 PathProgramCache]: Analyzing trace with hash -986868379, now seen corresponding path program 1 times [2024-06-14 15:27:52,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:27:52,420 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [199234066] [2024-06-14 15:27:52,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:27:52,420 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:27:52,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:28:02,852 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:28:02,853 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:28:02,853 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [199234066] [2024-06-14 15:28:02,853 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [199234066] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:28:02,853 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:28:02,853 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-14 15:28:02,853 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [254670763] [2024-06-14 15:28:02,853 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:28:02,854 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-14 15:28:02,854 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:28:02,854 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-14 15:28:02,854 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-06-14 15:28:03,035 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 41 [2024-06-14 15:28:03,036 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 61 transitions, 357 flow. Second operand has 8 states, 8 states have (on average 11.625) internal successors, (93), 8 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:28:03,036 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:28:03,036 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 41 [2024-06-14 15:28:03,036 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:28:03,908 INFO L124 PetriNetUnfolderBase]: 1314/2076 cut-off events. [2024-06-14 15:28:03,909 INFO L125 PetriNetUnfolderBase]: For 10143/10143 co-relation queries the response was YES. [2024-06-14 15:28:03,913 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7870 conditions, 2076 events. 1314/2076 cut-off events. For 10143/10143 co-relation queries the response was YES. Maximal size of possible extension queue 116. Compared 10430 event pairs, 284 based on Foata normal form. 16/2088 useless extension candidates. Maximal degree in co-relation 7841. Up to 1419 conditions per place. [2024-06-14 15:28:03,920 INFO L140 encePairwiseOnDemand]: 32/41 looper letters, 71 selfloop transitions, 22 changer transitions 0/98 dead transitions. [2024-06-14 15:28:03,921 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 98 transitions, 699 flow [2024-06-14 15:28:03,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-14 15:28:03,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-14 15:28:03,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 146 transitions. [2024-06-14 15:28:03,923 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5087108013937283 [2024-06-14 15:28:03,923 INFO L175 Difference]: Start difference. First operand has 64 places, 61 transitions, 357 flow. Second operand 7 states and 146 transitions. [2024-06-14 15:28:03,923 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 98 transitions, 699 flow [2024-06-14 15:28:03,929 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 98 transitions, 673 flow, removed 7 selfloop flow, removed 3 redundant places. [2024-06-14 15:28:03,930 INFO L231 Difference]: Finished difference. Result has 68 places, 63 transitions, 407 flow [2024-06-14 15:28:03,930 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=331, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=407, PETRI_PLACES=68, PETRI_TRANSITIONS=63} [2024-06-14 15:28:03,931 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 26 predicate places. [2024-06-14 15:28:03,931 INFO L495 AbstractCegarLoop]: Abstraction has has 68 places, 63 transitions, 407 flow [2024-06-14 15:28:03,931 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.625) internal successors, (93), 8 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:28:03,931 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:28:03,932 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:28:03,932 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-06-14 15:28:03,932 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 15:28:03,932 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:28:03,932 INFO L85 PathProgramCache]: Analyzing trace with hash -36910917, now seen corresponding path program 2 times [2024-06-14 15:28:03,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:28:03,933 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1298127610] [2024-06-14 15:28:03,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:28:03,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:28:03,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:28:14,387 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:28:14,388 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:28:14,388 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1298127610] [2024-06-14 15:28:14,388 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1298127610] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:28:14,389 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:28:14,389 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-14 15:28:14,389 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [616517744] [2024-06-14 15:28:14,389 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:28:14,390 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-14 15:28:14,390 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:28:14,391 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-14 15:28:14,392 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-06-14 15:28:14,505 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 41 [2024-06-14 15:28:14,505 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 63 transitions, 407 flow. Second operand has 8 states, 8 states have (on average 11.625) internal successors, (93), 8 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:28:14,505 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:28:14,506 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 41 [2024-06-14 15:28:14,506 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:28:15,467 INFO L124 PetriNetUnfolderBase]: 1356/2155 cut-off events. [2024-06-14 15:28:15,468 INFO L125 PetriNetUnfolderBase]: For 12306/12306 co-relation queries the response was YES. [2024-06-14 15:28:15,473 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8393 conditions, 2155 events. 1356/2155 cut-off events. For 12306/12306 co-relation queries the response was YES. Maximal size of possible extension queue 122. Compared 11034 event pairs, 418 based on Foata normal form. 24/2175 useless extension candidates. Maximal degree in co-relation 8363. Up to 1806 conditions per place. [2024-06-14 15:28:15,481 INFO L140 encePairwiseOnDemand]: 31/41 looper letters, 66 selfloop transitions, 23 changer transitions 0/94 dead transitions. [2024-06-14 15:28:15,481 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 94 transitions, 685 flow [2024-06-14 15:28:15,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-14 15:28:15,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-14 15:28:15,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 143 transitions. [2024-06-14 15:28:15,483 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49825783972125437 [2024-06-14 15:28:15,483 INFO L175 Difference]: Start difference. First operand has 68 places, 63 transitions, 407 flow. Second operand 7 states and 143 transitions. [2024-06-14 15:28:15,483 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 94 transitions, 685 flow [2024-06-14 15:28:15,490 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 94 transitions, 655 flow, removed 4 selfloop flow, removed 3 redundant places. [2024-06-14 15:28:15,492 INFO L231 Difference]: Finished difference. Result has 72 places, 65 transitions, 455 flow [2024-06-14 15:28:15,492 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=377, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=455, PETRI_PLACES=72, PETRI_TRANSITIONS=65} [2024-06-14 15:28:15,492 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 30 predicate places. [2024-06-14 15:28:15,493 INFO L495 AbstractCegarLoop]: Abstraction has has 72 places, 65 transitions, 455 flow [2024-06-14 15:28:15,493 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.625) internal successors, (93), 8 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:28:15,493 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:28:15,493 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:28:15,493 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-06-14 15:28:15,493 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 15:28:15,494 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:28:15,494 INFO L85 PathProgramCache]: Analyzing trace with hash 2121168459, now seen corresponding path program 1 times [2024-06-14 15:28:15,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:28:15,494 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1786552629] [2024-06-14 15:28:15,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:28:15,494 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:28:15,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:28:25,234 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:28:25,235 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:28:25,235 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1786552629] [2024-06-14 15:28:25,235 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1786552629] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:28:25,235 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:28:25,235 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-14 15:28:25,235 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [504106255] [2024-06-14 15:28:25,235 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:28:25,235 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-14 15:28:25,235 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:28:25,236 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-14 15:28:25,236 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-06-14 15:28:25,373 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 41 [2024-06-14 15:28:25,374 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 65 transitions, 455 flow. Second operand has 8 states, 8 states have (on average 11.75) internal successors, (94), 8 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:28:25,374 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:28:25,374 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 41 [2024-06-14 15:28:25,374 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:28:26,106 INFO L124 PetriNetUnfolderBase]: 1361/2172 cut-off events. [2024-06-14 15:28:26,106 INFO L125 PetriNetUnfolderBase]: For 12925/12925 co-relation queries the response was YES. [2024-06-14 15:28:26,112 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8820 conditions, 2172 events. 1361/2172 cut-off events. For 12925/12925 co-relation queries the response was YES. Maximal size of possible extension queue 122. Compared 11062 event pairs, 473 based on Foata normal form. 1/2172 useless extension candidates. Maximal degree in co-relation 8788. Up to 2073 conditions per place. [2024-06-14 15:28:26,120 INFO L140 encePairwiseOnDemand]: 33/41 looper letters, 67 selfloop transitions, 11 changer transitions 0/83 dead transitions. [2024-06-14 15:28:26,120 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 83 transitions, 671 flow [2024-06-14 15:28:26,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-14 15:28:26,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-14 15:28:26,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 111 transitions. [2024-06-14 15:28:26,121 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45121951219512196 [2024-06-14 15:28:26,121 INFO L175 Difference]: Start difference. First operand has 72 places, 65 transitions, 455 flow. Second operand 6 states and 111 transitions. [2024-06-14 15:28:26,121 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 83 transitions, 671 flow [2024-06-14 15:28:26,131 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 83 transitions, 617 flow, removed 6 selfloop flow, removed 5 redundant places. [2024-06-14 15:28:26,133 INFO L231 Difference]: Finished difference. Result has 73 places, 68 transitions, 457 flow [2024-06-14 15:28:26,133 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=401, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=457, PETRI_PLACES=73, PETRI_TRANSITIONS=68} [2024-06-14 15:28:26,133 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 31 predicate places. [2024-06-14 15:28:26,133 INFO L495 AbstractCegarLoop]: Abstraction has has 73 places, 68 transitions, 457 flow [2024-06-14 15:28:26,134 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.75) internal successors, (94), 8 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:28:26,134 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:28:26,134 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:28:26,134 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-06-14 15:28:26,134 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 15:28:26,134 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:28:26,135 INFO L85 PathProgramCache]: Analyzing trace with hash -364655509, now seen corresponding path program 1 times [2024-06-14 15:28:26,135 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:28:26,135 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1213041476] [2024-06-14 15:28:26,135 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:28:26,135 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:28:26,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:28:35,050 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:28:35,050 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:28:35,050 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1213041476] [2024-06-14 15:28:35,050 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1213041476] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:28:35,050 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:28:35,050 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 15:28:35,050 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1704609317] [2024-06-14 15:28:35,050 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:28:35,050 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 15:28:35,051 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:28:35,051 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 15:28:35,051 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-06-14 15:28:35,255 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 41 [2024-06-14 15:28:35,256 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 68 transitions, 457 flow. Second operand has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:28:35,256 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:28:35,256 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 41 [2024-06-14 15:28:35,256 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:28:36,275 INFO L124 PetriNetUnfolderBase]: 1389/2208 cut-off events. [2024-06-14 15:28:36,276 INFO L125 PetriNetUnfolderBase]: For 14768/14768 co-relation queries the response was YES. [2024-06-14 15:28:36,282 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9197 conditions, 2208 events. 1389/2208 cut-off events. For 14768/14768 co-relation queries the response was YES. Maximal size of possible extension queue 123. Compared 11248 event pairs, 440 based on Foata normal form. 4/2206 useless extension candidates. Maximal degree in co-relation 9164. Up to 1967 conditions per place. [2024-06-14 15:28:36,299 INFO L140 encePairwiseOnDemand]: 30/41 looper letters, 67 selfloop transitions, 28 changer transitions 0/100 dead transitions. [2024-06-14 15:28:36,299 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 100 transitions, 766 flow [2024-06-14 15:28:36,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 15:28:36,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 15:28:36,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 154 transitions. [2024-06-14 15:28:36,302 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4695121951219512 [2024-06-14 15:28:36,302 INFO L175 Difference]: Start difference. First operand has 73 places, 68 transitions, 457 flow. Second operand 8 states and 154 transitions. [2024-06-14 15:28:36,302 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 100 transitions, 766 flow [2024-06-14 15:28:36,311 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 100 transitions, 732 flow, removed 8 selfloop flow, removed 4 redundant places. [2024-06-14 15:28:36,313 INFO L231 Difference]: Finished difference. Result has 78 places, 74 transitions, 549 flow [2024-06-14 15:28:36,313 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=423, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=549, PETRI_PLACES=78, PETRI_TRANSITIONS=74} [2024-06-14 15:28:36,313 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 36 predicate places. [2024-06-14 15:28:36,314 INFO L495 AbstractCegarLoop]: Abstraction has has 78 places, 74 transitions, 549 flow [2024-06-14 15:28:36,314 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:28:36,314 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:28:36,314 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:28:36,314 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-06-14 15:28:36,314 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 15:28:36,314 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:28:36,315 INFO L85 PathProgramCache]: Analyzing trace with hash -358399399, now seen corresponding path program 2 times [2024-06-14 15:28:36,315 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:28:36,315 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1551072472] [2024-06-14 15:28:36,315 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:28:36,315 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:28:36,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:28:45,258 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:28:45,258 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:28:45,258 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1551072472] [2024-06-14 15:28:45,258 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1551072472] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:28:45,258 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:28:45,258 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 15:28:45,258 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1717960357] [2024-06-14 15:28:45,258 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:28:45,258 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 15:28:45,259 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:28:45,259 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 15:28:45,259 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2024-06-14 15:28:45,416 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 41 [2024-06-14 15:28:45,416 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 74 transitions, 549 flow. Second operand has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:28:45,416 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:28:45,416 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 41 [2024-06-14 15:28:45,416 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:28:46,397 INFO L124 PetriNetUnfolderBase]: 1381/2199 cut-off events. [2024-06-14 15:28:46,398 INFO L125 PetriNetUnfolderBase]: For 17265/17265 co-relation queries the response was YES. [2024-06-14 15:28:46,403 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9639 conditions, 2199 events. 1381/2199 cut-off events. For 17265/17265 co-relation queries the response was YES. Maximal size of possible extension queue 122. Compared 11190 event pairs, 438 based on Foata normal form. 4/2198 useless extension candidates. Maximal degree in co-relation 9604. Up to 1955 conditions per place. [2024-06-14 15:28:46,408 INFO L140 encePairwiseOnDemand]: 30/41 looper letters, 68 selfloop transitions, 34 changer transitions 0/107 dead transitions. [2024-06-14 15:28:46,408 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 107 transitions, 904 flow [2024-06-14 15:28:46,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 15:28:46,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 15:28:46,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 154 transitions. [2024-06-14 15:28:46,411 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4695121951219512 [2024-06-14 15:28:46,411 INFO L175 Difference]: Start difference. First operand has 78 places, 74 transitions, 549 flow. Second operand 8 states and 154 transitions. [2024-06-14 15:28:46,411 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 107 transitions, 904 flow [2024-06-14 15:28:46,429 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 107 transitions, 821 flow, removed 11 selfloop flow, removed 5 redundant places. [2024-06-14 15:28:46,431 INFO L231 Difference]: Finished difference. Result has 82 places, 82 transitions, 644 flow [2024-06-14 15:28:46,431 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=476, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=74, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=644, PETRI_PLACES=82, PETRI_TRANSITIONS=82} [2024-06-14 15:28:46,431 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 40 predicate places. [2024-06-14 15:28:46,432 INFO L495 AbstractCegarLoop]: Abstraction has has 82 places, 82 transitions, 644 flow [2024-06-14 15:28:46,432 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:28:46,432 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:28:46,432 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:28:46,432 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-06-14 15:28:46,432 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 15:28:46,433 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:28:46,433 INFO L85 PathProgramCache]: Analyzing trace with hash 2087602655, now seen corresponding path program 3 times [2024-06-14 15:28:46,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:28:46,433 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1126339165] [2024-06-14 15:28:46,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:28:46,433 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:28:46,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:28:56,029 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:28:56,029 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:28:56,030 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1126339165] [2024-06-14 15:28:56,030 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1126339165] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:28:56,030 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:28:56,030 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 15:28:56,030 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1787240504] [2024-06-14 15:28:56,030 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:28:56,030 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 15:28:56,030 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:28:56,030 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 15:28:56,031 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-14 15:28:56,257 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 41 [2024-06-14 15:28:56,258 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 82 transitions, 644 flow. Second operand has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:28:56,258 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:28:56,258 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 41 [2024-06-14 15:28:56,258 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:28:57,318 INFO L124 PetriNetUnfolderBase]: 1414/2268 cut-off events. [2024-06-14 15:28:57,318 INFO L125 PetriNetUnfolderBase]: For 19601/19601 co-relation queries the response was YES. [2024-06-14 15:28:57,324 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10115 conditions, 2268 events. 1414/2268 cut-off events. For 19601/19601 co-relation queries the response was YES. Maximal size of possible extension queue 129. Compared 11771 event pairs, 355 based on Foata normal form. 4/2267 useless extension candidates. Maximal degree in co-relation 10078. Up to 1845 conditions per place. [2024-06-14 15:28:57,337 INFO L140 encePairwiseOnDemand]: 30/41 looper letters, 68 selfloop transitions, 41 changer transitions 0/114 dead transitions. [2024-06-14 15:28:57,338 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 114 transitions, 978 flow [2024-06-14 15:28:57,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 15:28:57,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 15:28:57,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 158 transitions. [2024-06-14 15:28:57,340 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4817073170731707 [2024-06-14 15:28:57,340 INFO L175 Difference]: Start difference. First operand has 82 places, 82 transitions, 644 flow. Second operand 8 states and 158 transitions. [2024-06-14 15:28:57,341 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 89 places, 114 transitions, 978 flow [2024-06-14 15:28:57,356 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 114 transitions, 914 flow, removed 14 selfloop flow, removed 3 redundant places. [2024-06-14 15:28:57,376 INFO L231 Difference]: Finished difference. Result has 88 places, 85 transitions, 726 flow [2024-06-14 15:28:57,377 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=582, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=82, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=38, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=726, PETRI_PLACES=88, PETRI_TRANSITIONS=85} [2024-06-14 15:28:57,378 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 46 predicate places. [2024-06-14 15:28:57,378 INFO L495 AbstractCegarLoop]: Abstraction has has 88 places, 85 transitions, 726 flow [2024-06-14 15:28:57,378 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:28:57,378 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:28:57,378 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:28:57,378 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-06-14 15:28:57,379 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 15:28:57,379 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:28:57,379 INFO L85 PathProgramCache]: Analyzing trace with hash 2132596299, now seen corresponding path program 2 times [2024-06-14 15:28:57,379 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:28:57,379 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [673940074] [2024-06-14 15:28:57,379 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:28:57,379 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:28:57,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:29:07,190 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:29:07,190 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:29:07,190 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [673940074] [2024-06-14 15:29:07,192 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [673940074] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:29:07,192 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:29:07,192 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-14 15:29:07,193 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [92572946] [2024-06-14 15:29:07,193 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:29:07,193 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-14 15:29:07,194 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:29:07,194 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-14 15:29:07,194 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-06-14 15:29:07,339 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 41 [2024-06-14 15:29:07,340 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 85 transitions, 726 flow. Second operand has 8 states, 8 states have (on average 11.75) internal successors, (94), 8 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:29:07,340 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:29:07,340 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 41 [2024-06-14 15:29:07,340 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:29:08,115 INFO L124 PetriNetUnfolderBase]: 1411/2278 cut-off events. [2024-06-14 15:29:08,115 INFO L125 PetriNetUnfolderBase]: For 21505/21505 co-relation queries the response was YES. [2024-06-14 15:29:08,122 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10360 conditions, 2278 events. 1411/2278 cut-off events. For 21505/21505 co-relation queries the response was YES. Maximal size of possible extension queue 130. Compared 11890 event pairs, 435 based on Foata normal form. 1/2278 useless extension candidates. Maximal degree in co-relation 10321. Up to 2153 conditions per place. [2024-06-14 15:29:08,129 INFO L140 encePairwiseOnDemand]: 33/41 looper letters, 85 selfloop transitions, 17 changer transitions 0/107 dead transitions. [2024-06-14 15:29:08,129 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 107 transitions, 1016 flow [2024-06-14 15:29:08,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-14 15:29:08,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-14 15:29:08,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 126 transitions. [2024-06-14 15:29:08,131 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43902439024390244 [2024-06-14 15:29:08,131 INFO L175 Difference]: Start difference. First operand has 88 places, 85 transitions, 726 flow. Second operand 7 states and 126 transitions. [2024-06-14 15:29:08,131 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 107 transitions, 1016 flow [2024-06-14 15:29:08,149 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 89 places, 107 transitions, 926 flow, removed 12 selfloop flow, removed 5 redundant places. [2024-06-14 15:29:08,151 INFO L231 Difference]: Finished difference. Result has 91 places, 91 transitions, 740 flow [2024-06-14 15:29:08,151 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=636, PETRI_DIFFERENCE_MINUEND_PLACES=83, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=85, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=69, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=740, PETRI_PLACES=91, PETRI_TRANSITIONS=91} [2024-06-14 15:29:08,152 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 49 predicate places. [2024-06-14 15:29:08,152 INFO L495 AbstractCegarLoop]: Abstraction has has 91 places, 91 transitions, 740 flow [2024-06-14 15:29:08,152 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.75) internal successors, (94), 8 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:29:08,152 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:29:08,152 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:29:08,152 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-06-14 15:29:08,152 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 15:29:08,153 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:29:08,153 INFO L85 PathProgramCache]: Analyzing trace with hash 1639605209, now seen corresponding path program 1 times [2024-06-14 15:29:08,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:29:08,153 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1172913355] [2024-06-14 15:29:08,153 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:29:08,153 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:29:08,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:29:17,754 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:29:17,755 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:29:17,755 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1172913355] [2024-06-14 15:29:17,755 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1172913355] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:29:17,755 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:29:17,755 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-14 15:29:17,755 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1677720232] [2024-06-14 15:29:17,755 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:29:17,756 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-14 15:29:17,756 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:29:17,756 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-14 15:29:17,756 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-06-14 15:29:17,876 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 41 [2024-06-14 15:29:17,877 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 91 transitions, 740 flow. Second operand has 7 states, 7 states have (on average 13.0) internal successors, (91), 7 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:29:17,877 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:29:17,877 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 41 [2024-06-14 15:29:17,877 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:29:18,643 INFO L124 PetriNetUnfolderBase]: 1338/2213 cut-off events. [2024-06-14 15:29:18,643 INFO L125 PetriNetUnfolderBase]: For 25089/25089 co-relation queries the response was YES. [2024-06-14 15:29:18,651 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10246 conditions, 2213 events. 1338/2213 cut-off events. For 25089/25089 co-relation queries the response was YES. Maximal size of possible extension queue 128. Compared 11864 event pairs, 406 based on Foata normal form. 3/2213 useless extension candidates. Maximal degree in co-relation 10205. Up to 2018 conditions per place. [2024-06-14 15:29:18,659 INFO L140 encePairwiseOnDemand]: 32/41 looper letters, 87 selfloop transitions, 11 changer transitions 0/107 dead transitions. [2024-06-14 15:29:18,659 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 107 transitions, 990 flow [2024-06-14 15:29:18,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-14 15:29:18,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-14 15:29:18,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 114 transitions. [2024-06-14 15:29:18,662 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4634146341463415 [2024-06-14 15:29:18,662 INFO L175 Difference]: Start difference. First operand has 91 places, 91 transitions, 740 flow. Second operand 6 states and 114 transitions. [2024-06-14 15:29:18,662 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 96 places, 107 transitions, 990 flow [2024-06-14 15:29:18,678 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 93 places, 107 transitions, 952 flow, removed 14 selfloop flow, removed 3 redundant places. [2024-06-14 15:29:18,680 INFO L231 Difference]: Finished difference. Result has 94 places, 94 transitions, 754 flow [2024-06-14 15:29:18,680 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=702, PETRI_DIFFERENCE_MINUEND_PLACES=88, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=80, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=754, PETRI_PLACES=94, PETRI_TRANSITIONS=94} [2024-06-14 15:29:18,680 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 52 predicate places. [2024-06-14 15:29:18,681 INFO L495 AbstractCegarLoop]: Abstraction has has 94 places, 94 transitions, 754 flow [2024-06-14 15:29:18,681 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.0) internal successors, (91), 7 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:29:18,681 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:29:18,681 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:29:18,681 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-06-14 15:29:18,681 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-14 15:29:18,681 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:29:18,682 INFO L85 PathProgramCache]: Analyzing trace with hash 2132602251, now seen corresponding path program 2 times [2024-06-14 15:29:18,682 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:29:18,682 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [78201176] [2024-06-14 15:29:18,682 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:29:18,682 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:29:18,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:29:28,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-14 15:29:28,356 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:29:28,356 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [78201176] [2024-06-14 15:29:28,356 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [78201176] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:29:28,356 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:29:28,356 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-14 15:29:28,356 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1456005195] [2024-06-14 15:29:28,356 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:29:28,357 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-14 15:29:28,357 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:29:28,357 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-14 15:29:28,357 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-06-14 15:29:28,464 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 41 [2024-06-14 15:29:28,465 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 94 transitions, 754 flow. Second operand has 7 states, 7 states have (on average 13.0) internal successors, (91), 7 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:29:28,465 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:29:28,465 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 41 [2024-06-14 15:29:28,465 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:29:29,222 INFO L124 PetriNetUnfolderBase]: 1337/2215 cut-off events. [2024-06-14 15:29:29,222 INFO L125 PetriNetUnfolderBase]: For 27134/27137 co-relation queries the response was YES. [2024-06-14 15:29:29,230 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10599 conditions, 2215 events. 1337/2215 cut-off events. For 27134/27137 co-relation queries the response was YES. Maximal size of possible extension queue 128. Compared 11897 event pairs, 409 based on Foata normal form. 5/2216 useless extension candidates. Maximal degree in co-relation 10556. Up to 2007 conditions per place. [2024-06-14 15:29:29,238 INFO L140 encePairwiseOnDemand]: 32/41 looper letters, 81 selfloop transitions, 18 changer transitions 0/108 dead transitions. [2024-06-14 15:29:29,239 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 108 transitions, 1010 flow [2024-06-14 15:29:29,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-14 15:29:29,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-14 15:29:29,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 114 transitions. [2024-06-14 15:29:29,240 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4634146341463415 [2024-06-14 15:29:29,240 INFO L175 Difference]: Start difference. First operand has 94 places, 94 transitions, 754 flow. Second operand 6 states and 114 transitions. [2024-06-14 15:29:29,240 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 108 transitions, 1010 flow [2024-06-14 15:29:29,258 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 95 places, 108 transitions, 980 flow, removed 6 selfloop flow, removed 4 redundant places. [2024-06-14 15:29:29,259 INFO L231 Difference]: Finished difference. Result has 96 places, 97 transitions, 797 flow [2024-06-14 15:29:29,259 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=724, PETRI_DIFFERENCE_MINUEND_PLACES=90, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=94, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=76, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=797, PETRI_PLACES=96, PETRI_TRANSITIONS=97} [2024-06-14 15:29:29,260 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 54 predicate places. [2024-06-14 15:29:29,260 INFO L495 AbstractCegarLoop]: Abstraction has has 96 places, 97 transitions, 797 flow [2024-06-14 15:29:29,260 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.0) internal successors, (91), 7 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:29:29,260 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:29:29,260 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:29:29,261 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-06-14 15:29:29,261 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 15:29:29,261 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:29:29,261 INFO L85 PathProgramCache]: Analyzing trace with hash 2132610187, now seen corresponding path program 1 times [2024-06-14 15:29:29,261 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:29:29,261 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1865768858] [2024-06-14 15:29:29,261 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:29:29,262 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:29:29,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:29:39,410 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:29:39,410 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:29:39,410 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1865768858] [2024-06-14 15:29:39,410 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1865768858] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:29:39,410 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:29:39,410 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-14 15:29:39,411 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2124314529] [2024-06-14 15:29:39,411 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:29:39,412 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-14 15:29:39,415 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:29:39,415 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-14 15:29:39,415 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-06-14 15:29:39,570 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 41 [2024-06-14 15:29:39,571 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 97 transitions, 797 flow. Second operand has 8 states, 8 states have (on average 11.875) internal successors, (95), 8 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:29:39,571 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:29:39,571 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 41 [2024-06-14 15:29:39,571 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:29:40,307 INFO L124 PetriNetUnfolderBase]: 1432/2312 cut-off events. [2024-06-14 15:29:40,307 INFO L125 PetriNetUnfolderBase]: For 28993/28993 co-relation queries the response was YES. [2024-06-14 15:29:40,315 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11364 conditions, 2312 events. 1432/2312 cut-off events. For 28993/28993 co-relation queries the response was YES. Maximal size of possible extension queue 130. Compared 12145 event pairs, 436 based on Foata normal form. 1/2312 useless extension candidates. Maximal degree in co-relation 11320. Up to 2198 conditions per place. [2024-06-14 15:29:40,323 INFO L140 encePairwiseOnDemand]: 32/41 looper letters, 91 selfloop transitions, 14 changer transitions 0/110 dead transitions. [2024-06-14 15:29:40,323 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 110 transitions, 1063 flow [2024-06-14 15:29:40,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-14 15:29:40,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-14 15:29:40,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 119 transitions. [2024-06-14 15:29:40,335 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4146341463414634 [2024-06-14 15:29:40,335 INFO L175 Difference]: Start difference. First operand has 96 places, 97 transitions, 797 flow. Second operand 7 states and 119 transitions. [2024-06-14 15:29:40,335 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 110 transitions, 1063 flow [2024-06-14 15:29:40,353 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 98 places, 110 transitions, 1014 flow, removed 9 selfloop flow, removed 4 redundant places. [2024-06-14 15:29:40,354 INFO L231 Difference]: Finished difference. Result has 99 places, 100 transitions, 820 flow [2024-06-14 15:29:40,354 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=748, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=97, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=83, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=820, PETRI_PLACES=99, PETRI_TRANSITIONS=100} [2024-06-14 15:29:40,355 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 57 predicate places. [2024-06-14 15:29:40,355 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 100 transitions, 820 flow [2024-06-14 15:29:40,355 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.875) internal successors, (95), 8 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:29:40,355 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:29:40,355 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:29:40,355 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-06-14 15:29:40,356 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 15:29:40,356 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:29:40,356 INFO L85 PathProgramCache]: Analyzing trace with hash 1331415537, now seen corresponding path program 1 times [2024-06-14 15:29:40,356 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:29:40,356 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [317635657] [2024-06-14 15:29:40,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:29:40,357 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:29:40,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:29:49,905 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:29:49,905 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:29:49,905 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [317635657] [2024-06-14 15:29:49,905 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [317635657] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:29:49,906 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:29:49,906 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 15:29:49,906 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1677379231] [2024-06-14 15:29:49,906 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:29:49,907 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 15:29:49,908 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:29:49,908 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 15:29:49,909 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-06-14 15:29:50,114 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 41 [2024-06-14 15:29:50,114 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 100 transitions, 820 flow. Second operand has 9 states, 9 states have (on average 11.666666666666666) internal successors, (105), 9 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:29:50,114 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:29:50,114 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 41 [2024-06-14 15:29:50,115 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:29:50,973 INFO L124 PetriNetUnfolderBase]: 1447/2338 cut-off events. [2024-06-14 15:29:50,973 INFO L125 PetriNetUnfolderBase]: For 31668/31671 co-relation queries the response was YES. [2024-06-14 15:29:50,982 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11705 conditions, 2338 events. 1447/2338 cut-off events. For 31668/31671 co-relation queries the response was YES. Maximal size of possible extension queue 132. Compared 12354 event pairs, 434 based on Foata normal form. 5/2341 useless extension candidates. Maximal degree in co-relation 11660. Up to 2139 conditions per place. [2024-06-14 15:29:50,990 INFO L140 encePairwiseOnDemand]: 30/41 looper letters, 101 selfloop transitions, 24 changer transitions 0/130 dead transitions. [2024-06-14 15:29:50,991 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 105 places, 130 transitions, 1188 flow [2024-06-14 15:29:50,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-14 15:29:50,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-14 15:29:51,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 137 transitions. [2024-06-14 15:29:51,020 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47735191637630664 [2024-06-14 15:29:51,020 INFO L175 Difference]: Start difference. First operand has 99 places, 100 transitions, 820 flow. Second operand 7 states and 137 transitions. [2024-06-14 15:29:51,020 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 105 places, 130 transitions, 1188 flow [2024-06-14 15:29:51,042 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 130 transitions, 1118 flow, removed 16 selfloop flow, removed 6 redundant places. [2024-06-14 15:29:51,044 INFO L231 Difference]: Finished difference. Result has 101 places, 107 transitions, 882 flow [2024-06-14 15:29:51,044 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=750, PETRI_DIFFERENCE_MINUEND_PLACES=93, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=100, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=76, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=882, PETRI_PLACES=101, PETRI_TRANSITIONS=107} [2024-06-14 15:29:51,044 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 59 predicate places. [2024-06-14 15:29:51,044 INFO L495 AbstractCegarLoop]: Abstraction has has 101 places, 107 transitions, 882 flow [2024-06-14 15:29:51,045 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.666666666666666) internal successors, (105), 9 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:29:51,045 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:29:51,045 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:29:51,045 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-06-14 15:29:51,046 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 15:29:51,046 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:29:51,046 INFO L85 PathProgramCache]: Analyzing trace with hash -1154797477, now seen corresponding path program 1 times [2024-06-14 15:29:51,046 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:29:51,046 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [956619374] [2024-06-14 15:29:51,046 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:29:51,046 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:29:51,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:29:59,522 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:29:59,522 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:29:59,523 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [956619374] [2024-06-14 15:29:59,523 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [956619374] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:29:59,523 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:29:59,523 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 15:29:59,523 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [996228281] [2024-06-14 15:29:59,523 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:29:59,524 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 15:29:59,525 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:29:59,526 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 15:29:59,526 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-14 15:29:59,675 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 41 [2024-06-14 15:29:59,676 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 101 places, 107 transitions, 882 flow. Second operand has 9 states, 9 states have (on average 11.555555555555555) internal successors, (104), 9 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:29:59,676 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:29:59,676 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 41 [2024-06-14 15:29:59,676 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:30:00,699 INFO L124 PetriNetUnfolderBase]: 1557/2539 cut-off events. [2024-06-14 15:30:00,700 INFO L125 PetriNetUnfolderBase]: For 36888/36888 co-relation queries the response was YES. [2024-06-14 15:30:00,708 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13110 conditions, 2539 events. 1557/2539 cut-off events. For 36888/36888 co-relation queries the response was YES. Maximal size of possible extension queue 152. Compared 13876 event pairs, 442 based on Foata normal form. 12/2547 useless extension candidates. Maximal degree in co-relation 13064. Up to 1961 conditions per place. [2024-06-14 15:30:00,718 INFO L140 encePairwiseOnDemand]: 31/41 looper letters, 103 selfloop transitions, 37 changer transitions 0/145 dead transitions. [2024-06-14 15:30:00,718 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 108 places, 145 transitions, 1312 flow [2024-06-14 15:30:00,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 15:30:00,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 15:30:00,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 159 transitions. [2024-06-14 15:30:00,720 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4847560975609756 [2024-06-14 15:30:00,720 INFO L175 Difference]: Start difference. First operand has 101 places, 107 transitions, 882 flow. Second operand 8 states and 159 transitions. [2024-06-14 15:30:00,720 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 108 places, 145 transitions, 1312 flow [2024-06-14 15:30:00,776 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 104 places, 145 transitions, 1250 flow, removed 17 selfloop flow, removed 4 redundant places. [2024-06-14 15:30:00,780 INFO L231 Difference]: Finished difference. Result has 106 places, 112 transitions, 969 flow [2024-06-14 15:30:00,781 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=820, PETRI_DIFFERENCE_MINUEND_PLACES=97, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=107, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=73, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=969, PETRI_PLACES=106, PETRI_TRANSITIONS=112} [2024-06-14 15:30:00,781 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 64 predicate places. [2024-06-14 15:30:00,781 INFO L495 AbstractCegarLoop]: Abstraction has has 106 places, 112 transitions, 969 flow [2024-06-14 15:30:00,782 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.555555555555555) internal successors, (104), 9 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:30:00,783 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:30:00,783 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:30:00,783 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-06-14 15:30:00,783 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-14 15:30:00,783 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:30:00,783 INFO L85 PathProgramCache]: Analyzing trace with hash 1331714439, now seen corresponding path program 1 times [2024-06-14 15:30:00,783 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:30:00,784 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2083206822] [2024-06-14 15:30:00,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:30:00,784 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:30:00,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:30:10,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-14 15:30:10,826 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:30:10,826 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2083206822] [2024-06-14 15:30:10,826 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2083206822] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:30:10,826 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:30:10,826 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 15:30:10,826 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1015914772] [2024-06-14 15:30:10,826 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:30:10,826 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 15:30:10,827 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:30:10,827 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 15:30:10,827 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-14 15:30:10,959 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 41 [2024-06-14 15:30:10,959 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 106 places, 112 transitions, 969 flow. Second operand has 9 states, 9 states have (on average 11.666666666666666) internal successors, (105), 9 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:30:10,959 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:30:10,960 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 41 [2024-06-14 15:30:10,960 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:30:11,765 INFO L124 PetriNetUnfolderBase]: 1562/2546 cut-off events. [2024-06-14 15:30:11,765 INFO L125 PetriNetUnfolderBase]: For 38928/38928 co-relation queries the response was YES. [2024-06-14 15:30:11,778 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13487 conditions, 2546 events. 1562/2546 cut-off events. For 38928/38928 co-relation queries the response was YES. Maximal size of possible extension queue 152. Compared 13926 event pairs, 452 based on Foata normal form. 1/2546 useless extension candidates. Maximal degree in co-relation 13440. Up to 2399 conditions per place. [2024-06-14 15:30:11,788 INFO L140 encePairwiseOnDemand]: 32/41 looper letters, 112 selfloop transitions, 14 changer transitions 0/131 dead transitions. [2024-06-14 15:30:11,789 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 112 places, 131 transitions, 1307 flow [2024-06-14 15:30:11,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-14 15:30:11,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-14 15:30:11,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 125 transitions. [2024-06-14 15:30:11,790 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4355400696864111 [2024-06-14 15:30:11,790 INFO L175 Difference]: Start difference. First operand has 106 places, 112 transitions, 969 flow. Second operand 7 states and 125 transitions. [2024-06-14 15:30:11,790 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 112 places, 131 transitions, 1307 flow [2024-06-14 15:30:11,822 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 109 places, 131 transitions, 1256 flow, removed 9 selfloop flow, removed 3 redundant places. [2024-06-14 15:30:11,823 INFO L231 Difference]: Finished difference. Result has 110 places, 115 transitions, 1004 flow [2024-06-14 15:30:11,823 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=918, PETRI_DIFFERENCE_MINUEND_PLACES=103, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=112, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=98, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1004, PETRI_PLACES=110, PETRI_TRANSITIONS=115} [2024-06-14 15:30:11,824 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 68 predicate places. [2024-06-14 15:30:11,824 INFO L495 AbstractCegarLoop]: Abstraction has has 110 places, 115 transitions, 1004 flow [2024-06-14 15:30:11,824 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.666666666666666) internal successors, (105), 9 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:30:11,824 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:30:11,824 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:30:11,824 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-06-14 15:30:11,825 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 15:30:11,825 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:30:11,825 INFO L85 PathProgramCache]: Analyzing trace with hash 1674012657, now seen corresponding path program 2 times [2024-06-14 15:30:11,825 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:30:11,825 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1501934669] [2024-06-14 15:30:11,825 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:30:11,826 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:30:11,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:30:21,550 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:30:21,550 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:30:21,550 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1501934669] [2024-06-14 15:30:21,551 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1501934669] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:30:21,551 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:30:21,551 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 15:30:21,551 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1013157883] [2024-06-14 15:30:21,551 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:30:21,551 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 15:30:21,551 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:30:21,551 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 15:30:21,551 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-14 15:30:21,722 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 41 [2024-06-14 15:30:21,723 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 110 places, 115 transitions, 1004 flow. Second operand has 9 states, 9 states have (on average 11.666666666666666) internal successors, (105), 9 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:30:21,723 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:30:21,723 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 41 [2024-06-14 15:30:21,723 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:30:22,627 INFO L124 PetriNetUnfolderBase]: 1613/2632 cut-off events. [2024-06-14 15:30:22,627 INFO L125 PetriNetUnfolderBase]: For 42033/42036 co-relation queries the response was YES. [2024-06-14 15:30:22,636 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14130 conditions, 2632 events. 1613/2632 cut-off events. For 42033/42036 co-relation queries the response was YES. Maximal size of possible extension queue 163. Compared 14496 event pairs, 457 based on Foata normal form. 5/2635 useless extension candidates. Maximal degree in co-relation 14082. Up to 2359 conditions per place. [2024-06-14 15:30:22,643 INFO L140 encePairwiseOnDemand]: 30/41 looper letters, 108 selfloop transitions, 29 changer transitions 0/142 dead transitions. [2024-06-14 15:30:22,643 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 116 places, 142 transitions, 1470 flow [2024-06-14 15:30:22,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-14 15:30:22,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-14 15:30:22,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 134 transitions. [2024-06-14 15:30:22,645 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46689895470383275 [2024-06-14 15:30:22,645 INFO L175 Difference]: Start difference. First operand has 110 places, 115 transitions, 1004 flow. Second operand 7 states and 134 transitions. [2024-06-14 15:30:22,645 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 116 places, 142 transitions, 1470 flow [2024-06-14 15:30:22,677 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 111 places, 142 transitions, 1406 flow, removed 20 selfloop flow, removed 5 redundant places. [2024-06-14 15:30:22,679 INFO L231 Difference]: Finished difference. Result has 113 places, 123 transitions, 1120 flow [2024-06-14 15:30:22,680 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=940, PETRI_DIFFERENCE_MINUEND_PLACES=105, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=115, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=89, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1120, PETRI_PLACES=113, PETRI_TRANSITIONS=123} [2024-06-14 15:30:22,680 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 71 predicate places. [2024-06-14 15:30:22,680 INFO L495 AbstractCegarLoop]: Abstraction has has 113 places, 123 transitions, 1120 flow [2024-06-14 15:30:22,680 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.666666666666666) internal successors, (105), 9 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:30:22,680 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:30:22,680 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:30:22,681 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-06-14 15:30:22,681 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-14 15:30:22,681 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:30:22,681 INFO L85 PathProgramCache]: Analyzing trace with hash -1877054787, now seen corresponding path program 2 times [2024-06-14 15:30:22,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:30:22,681 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1563970323] [2024-06-14 15:30:22,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:30:22,682 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:30:22,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:30:31,291 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:30:31,291 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:30:31,291 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1563970323] [2024-06-14 15:30:31,292 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1563970323] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:30:31,292 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:30:31,292 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 15:30:31,292 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [541742008] [2024-06-14 15:30:31,292 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:30:31,292 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 15:30:31,292 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:30:31,293 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 15:30:31,293 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-06-14 15:30:31,472 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 41 [2024-06-14 15:30:31,472 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 113 places, 123 transitions, 1120 flow. Second operand has 9 states, 9 states have (on average 11.555555555555555) internal successors, (104), 9 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:30:31,472 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:30:31,472 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 41 [2024-06-14 15:30:31,473 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:30:32,398 INFO L124 PetriNetUnfolderBase]: 1593/2599 cut-off events. [2024-06-14 15:30:32,399 INFO L125 PetriNetUnfolderBase]: For 46897/46897 co-relation queries the response was YES. [2024-06-14 15:30:32,409 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14515 conditions, 2599 events. 1593/2599 cut-off events. For 46897/46897 co-relation queries the response was YES. Maximal size of possible extension queue 161. Compared 14176 event pairs, 279 based on Foata normal form. 12/2607 useless extension candidates. Maximal degree in co-relation 14465. Up to 1591 conditions per place. [2024-06-14 15:30:32,418 INFO L140 encePairwiseOnDemand]: 32/41 looper letters, 108 selfloop transitions, 40 changer transitions 0/153 dead transitions. [2024-06-14 15:30:32,418 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 119 places, 153 transitions, 1516 flow [2024-06-14 15:30:32,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-14 15:30:32,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-14 15:30:32,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 143 transitions. [2024-06-14 15:30:32,421 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49825783972125437 [2024-06-14 15:30:32,421 INFO L175 Difference]: Start difference. First operand has 113 places, 123 transitions, 1120 flow. Second operand 7 states and 143 transitions. [2024-06-14 15:30:32,421 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 119 places, 153 transitions, 1516 flow [2024-06-14 15:30:32,463 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 116 places, 153 transitions, 1447 flow, removed 25 selfloop flow, removed 3 redundant places. [2024-06-14 15:30:32,465 INFO L231 Difference]: Finished difference. Result has 117 places, 123 transitions, 1140 flow [2024-06-14 15:30:32,465 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=1051, PETRI_DIFFERENCE_MINUEND_PLACES=110, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=123, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=40, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=83, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1140, PETRI_PLACES=117, PETRI_TRANSITIONS=123} [2024-06-14 15:30:32,465 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 75 predicate places. [2024-06-14 15:30:32,465 INFO L495 AbstractCegarLoop]: Abstraction has has 117 places, 123 transitions, 1140 flow [2024-06-14 15:30:32,466 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.555555555555555) internal successors, (104), 9 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:30:32,466 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:30:32,466 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:30:32,466 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-06-14 15:30:32,466 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 15:30:32,466 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:30:32,467 INFO L85 PathProgramCache]: Analyzing trace with hash -407207635, now seen corresponding path program 3 times [2024-06-14 15:30:32,467 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:30:32,467 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [904655503] [2024-06-14 15:30:32,467 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:30:32,467 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:30:32,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:30:42,538 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:30:42,539 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:30:42,539 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [904655503] [2024-06-14 15:30:42,539 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [904655503] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:30:42,539 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:30:42,539 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 15:30:42,539 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1583454201] [2024-06-14 15:30:42,539 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:30:42,539 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 15:30:42,539 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:30:42,540 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 15:30:42,540 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-06-14 15:30:42,694 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 41 [2024-06-14 15:30:42,695 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 117 places, 123 transitions, 1140 flow. Second operand has 9 states, 9 states have (on average 11.555555555555555) internal successors, (104), 9 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:30:42,695 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:30:42,695 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 41 [2024-06-14 15:30:42,695 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:30:43,589 INFO L124 PetriNetUnfolderBase]: 1573/2569 cut-off events. [2024-06-14 15:30:43,589 INFO L125 PetriNetUnfolderBase]: For 48312/48312 co-relation queries the response was YES. [2024-06-14 15:30:43,599 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14457 conditions, 2569 events. 1573/2569 cut-off events. For 48312/48312 co-relation queries the response was YES. Maximal size of possible extension queue 159. Compared 14060 event pairs, 262 based on Foata normal form. 12/2571 useless extension candidates. Maximal degree in co-relation 14405. Up to 1449 conditions per place. [2024-06-14 15:30:43,607 INFO L140 encePairwiseOnDemand]: 32/41 looper letters, 103 selfloop transitions, 39 changer transitions 0/147 dead transitions. [2024-06-14 15:30:43,607 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 122 places, 147 transitions, 1478 flow [2024-06-14 15:30:43,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-14 15:30:43,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-14 15:30:43,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 135 transitions. [2024-06-14 15:30:43,610 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47038327526132406 [2024-06-14 15:30:43,610 INFO L175 Difference]: Start difference. First operand has 117 places, 123 transitions, 1140 flow. Second operand 7 states and 135 transitions. [2024-06-14 15:30:43,610 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 122 places, 147 transitions, 1478 flow [2024-06-14 15:30:43,649 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 116 places, 147 transitions, 1374 flow, removed 5 selfloop flow, removed 6 redundant places. [2024-06-14 15:30:43,651 INFO L231 Difference]: Finished difference. Result has 117 places, 122 transitions, 1086 flow [2024-06-14 15:30:43,651 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=1004, PETRI_DIFFERENCE_MINUEND_PLACES=110, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=122, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=39, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=83, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1086, PETRI_PLACES=117, PETRI_TRANSITIONS=122} [2024-06-14 15:30:43,651 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 75 predicate places. [2024-06-14 15:30:43,652 INFO L495 AbstractCegarLoop]: Abstraction has has 117 places, 122 transitions, 1086 flow [2024-06-14 15:30:43,652 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.555555555555555) internal successors, (104), 9 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:30:43,652 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:30:43,652 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:30:43,652 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-06-14 15:30:43,652 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-14 15:30:43,653 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:30:43,653 INFO L85 PathProgramCache]: Analyzing trace with hash 1685989569, now seen corresponding path program 2 times [2024-06-14 15:30:43,653 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:30:43,653 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [754235513] [2024-06-14 15:30:43,653 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:30:43,653 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:30:43,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:30:53,702 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:30:53,703 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:30:53,703 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [754235513] [2024-06-14 15:30:53,703 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [754235513] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:30:53,703 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:30:53,703 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-14 15:30:53,704 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1909518464] [2024-06-14 15:30:53,704 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:30:53,705 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-14 15:30:53,706 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:30:53,706 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-14 15:30:53,706 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-06-14 15:30:53,853 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 41 [2024-06-14 15:30:53,854 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 117 places, 122 transitions, 1086 flow. Second operand has 8 states, 8 states have (on average 11.875) internal successors, (95), 8 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:30:53,854 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:30:53,854 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 41 [2024-06-14 15:30:53,854 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:30:54,640 INFO L124 PetriNetUnfolderBase]: 1578/2574 cut-off events. [2024-06-14 15:30:54,640 INFO L125 PetriNetUnfolderBase]: For 45198/45198 co-relation queries the response was YES. [2024-06-14 15:30:54,655 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14443 conditions, 2574 events. 1578/2574 cut-off events. For 45198/45198 co-relation queries the response was YES. Maximal size of possible extension queue 159. Compared 14043 event pairs, 430 based on Foata normal form. 1/2574 useless extension candidates. Maximal degree in co-relation 14390. Up to 2425 conditions per place. [2024-06-14 15:30:54,664 INFO L140 encePairwiseOnDemand]: 32/41 looper letters, 116 selfloop transitions, 14 changer transitions 0/135 dead transitions. [2024-06-14 15:30:54,664 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 123 places, 135 transitions, 1426 flow [2024-06-14 15:30:54,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-14 15:30:54,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-14 15:30:54,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 118 transitions. [2024-06-14 15:30:54,665 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41114982578397213 [2024-06-14 15:30:54,665 INFO L175 Difference]: Start difference. First operand has 117 places, 122 transitions, 1086 flow. Second operand 7 states and 118 transitions. [2024-06-14 15:30:54,665 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 123 places, 135 transitions, 1426 flow [2024-06-14 15:30:54,710 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 117 places, 135 transitions, 1315 flow, removed 6 selfloop flow, removed 6 redundant places. [2024-06-14 15:30:54,712 INFO L231 Difference]: Finished difference. Result has 118 places, 125 transitions, 1071 flow [2024-06-14 15:30:54,712 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=975, PETRI_DIFFERENCE_MINUEND_PLACES=111, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=122, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=108, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1071, PETRI_PLACES=118, PETRI_TRANSITIONS=125} [2024-06-14 15:30:54,712 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 76 predicate places. [2024-06-14 15:30:54,713 INFO L495 AbstractCegarLoop]: Abstraction has has 118 places, 125 transitions, 1071 flow [2024-06-14 15:30:54,713 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.875) internal successors, (95), 8 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:30:54,713 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:30:54,713 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:30:54,713 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-06-14 15:30:54,713 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 15:30:54,713 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:30:54,714 INFO L85 PathProgramCache]: Analyzing trace with hash 1685977107, now seen corresponding path program 3 times [2024-06-14 15:30:54,714 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:30:54,714 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [822264233] [2024-06-14 15:30:54,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:30:54,714 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:30:54,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:31:04,784 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:31:04,784 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:31:04,784 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [822264233] [2024-06-14 15:31:04,785 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [822264233] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:31:04,785 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:31:04,785 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 15:31:04,785 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1078102630] [2024-06-14 15:31:04,785 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:31:04,787 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 15:31:04,788 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:31:04,788 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 15:31:04,788 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-06-14 15:31:04,924 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 41 [2024-06-14 15:31:04,924 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 118 places, 125 transitions, 1071 flow. Second operand has 9 states, 9 states have (on average 11.666666666666666) internal successors, (105), 9 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:31:04,925 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:31:04,925 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 41 [2024-06-14 15:31:04,925 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:31:05,829 INFO L124 PetriNetUnfolderBase]: 1605/2621 cut-off events. [2024-06-14 15:31:05,830 INFO L125 PetriNetUnfolderBase]: For 48520/48523 co-relation queries the response was YES. [2024-06-14 15:31:05,841 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14579 conditions, 2621 events. 1605/2621 cut-off events. For 48520/48523 co-relation queries the response was YES. Maximal size of possible extension queue 163. Compared 14390 event pairs, 430 based on Foata normal form. 5/2624 useless extension candidates. Maximal degree in co-relation 14526. Up to 2282 conditions per place. [2024-06-14 15:31:05,850 INFO L140 encePairwiseOnDemand]: 30/41 looper letters, 112 selfloop transitions, 43 changer transitions 0/160 dead transitions. [2024-06-14 15:31:05,850 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 125 places, 160 transitions, 1687 flow [2024-06-14 15:31:05,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 15:31:05,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 15:31:05,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 152 transitions. [2024-06-14 15:31:05,852 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4634146341463415 [2024-06-14 15:31:05,852 INFO L175 Difference]: Start difference. First operand has 118 places, 125 transitions, 1071 flow. Second operand 8 states and 152 transitions. [2024-06-14 15:31:05,852 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 125 places, 160 transitions, 1687 flow [2024-06-14 15:31:05,893 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 120 places, 160 transitions, 1613 flow, removed 25 selfloop flow, removed 5 redundant places. [2024-06-14 15:31:05,895 INFO L231 Difference]: Finished difference. Result has 123 places, 138 transitions, 1278 flow [2024-06-14 15:31:05,896 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=997, PETRI_DIFFERENCE_MINUEND_PLACES=113, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=125, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=86, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1278, PETRI_PLACES=123, PETRI_TRANSITIONS=138} [2024-06-14 15:31:05,896 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 81 predicate places. [2024-06-14 15:31:05,896 INFO L495 AbstractCegarLoop]: Abstraction has has 123 places, 138 transitions, 1278 flow [2024-06-14 15:31:05,896 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.666666666666666) internal successors, (105), 9 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:31:05,896 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:31:05,897 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:31:05,897 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-06-14 15:31:05,897 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-14 15:31:05,897 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:31:05,897 INFO L85 PathProgramCache]: Analyzing trace with hash 1685977479, now seen corresponding path program 3 times [2024-06-14 15:31:05,897 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:31:05,897 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1918349378] [2024-06-14 15:31:05,898 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:31:05,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:31:05,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:31:15,791 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:31:15,791 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:31:15,791 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1918349378] [2024-06-14 15:31:15,793 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1918349378] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:31:15,793 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:31:15,793 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 15:31:15,793 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1355339564] [2024-06-14 15:31:15,793 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:31:15,794 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 15:31:15,794 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:31:15,794 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 15:31:15,794 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-06-14 15:31:15,869 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 41 [2024-06-14 15:31:15,869 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 123 places, 138 transitions, 1278 flow. Second operand has 9 states, 9 states have (on average 11.666666666666666) internal successors, (105), 9 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:31:15,869 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:31:15,869 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 41 [2024-06-14 15:31:15,870 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:31:16,701 INFO L124 PetriNetUnfolderBase]: 1602/2612 cut-off events. [2024-06-14 15:31:16,702 INFO L125 PetriNetUnfolderBase]: For 53459/53459 co-relation queries the response was YES. [2024-06-14 15:31:16,713 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15356 conditions, 2612 events. 1602/2612 cut-off events. For 53459/53459 co-relation queries the response was YES. Maximal size of possible extension queue 162. Compared 14231 event pairs, 438 based on Foata normal form. 1/2612 useless extension candidates. Maximal degree in co-relation 15300. Up to 2432 conditions per place. [2024-06-14 15:31:16,722 INFO L140 encePairwiseOnDemand]: 32/41 looper letters, 126 selfloop transitions, 27 changer transitions 0/158 dead transitions. [2024-06-14 15:31:16,722 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 130 places, 158 transitions, 1692 flow [2024-06-14 15:31:16,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 15:31:16,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 15:31:16,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 141 transitions. [2024-06-14 15:31:16,732 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4298780487804878 [2024-06-14 15:31:16,732 INFO L175 Difference]: Start difference. First operand has 123 places, 138 transitions, 1278 flow. Second operand 8 states and 141 transitions. [2024-06-14 15:31:16,732 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 130 places, 158 transitions, 1692 flow [2024-06-14 15:31:16,775 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 127 places, 158 transitions, 1603 flow, removed 35 selfloop flow, removed 3 redundant places. [2024-06-14 15:31:16,777 INFO L231 Difference]: Finished difference. Result has 128 places, 141 transitions, 1321 flow [2024-06-14 15:31:16,777 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=1189, PETRI_DIFFERENCE_MINUEND_PLACES=120, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=138, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=111, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1321, PETRI_PLACES=128, PETRI_TRANSITIONS=141} [2024-06-14 15:31:16,782 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 86 predicate places. [2024-06-14 15:31:16,782 INFO L495 AbstractCegarLoop]: Abstraction has has 128 places, 141 transitions, 1321 flow [2024-06-14 15:31:16,782 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.666666666666666) internal successors, (105), 9 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:31:16,782 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:31:16,782 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:31:16,783 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-06-14 15:31:16,783 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-14 15:31:16,783 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:31:16,783 INFO L85 PathProgramCache]: Analyzing trace with hash 1508910315, now seen corresponding path program 1 times [2024-06-14 15:31:16,783 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:31:16,785 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [640984868] [2024-06-14 15:31:16,785 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:31:16,785 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:31:16,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:31:26,645 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:31:26,646 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:31:26,646 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [640984868] [2024-06-14 15:31:26,646 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [640984868] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:31:26,646 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:31:26,646 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-14 15:31:26,646 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [718237179] [2024-06-14 15:31:26,646 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:31:26,646 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-14 15:31:26,646 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:31:26,647 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-14 15:31:26,647 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-06-14 15:31:26,744 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 41 [2024-06-14 15:31:26,745 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 128 places, 141 transitions, 1321 flow. Second operand has 8 states, 8 states have (on average 12.875) internal successors, (103), 8 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:31:26,745 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:31:26,745 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 41 [2024-06-14 15:31:26,745 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:31:27,647 INFO L124 PetriNetUnfolderBase]: 1535/2539 cut-off events. [2024-06-14 15:31:27,648 INFO L125 PetriNetUnfolderBase]: For 56903/56911 co-relation queries the response was YES. [2024-06-14 15:31:27,659 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14863 conditions, 2539 events. 1535/2539 cut-off events. For 56903/56911 co-relation queries the response was YES. Maximal size of possible extension queue 164. Compared 14169 event pairs, 408 based on Foata normal form. 2/2522 useless extension candidates. Maximal degree in co-relation 14805. Up to 2270 conditions per place. [2024-06-14 15:31:27,667 INFO L140 encePairwiseOnDemand]: 32/41 looper letters, 131 selfloop transitions, 14 changer transitions 0/160 dead transitions. [2024-06-14 15:31:27,667 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 134 places, 160 transitions, 1693 flow [2024-06-14 15:31:27,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-14 15:31:27,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-14 15:31:27,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 130 transitions. [2024-06-14 15:31:27,670 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4529616724738676 [2024-06-14 15:31:27,670 INFO L175 Difference]: Start difference. First operand has 128 places, 141 transitions, 1321 flow. Second operand 7 states and 130 transitions. [2024-06-14 15:31:27,670 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 134 places, 160 transitions, 1693 flow [2024-06-14 15:31:27,713 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 128 places, 160 transitions, 1583 flow, removed 30 selfloop flow, removed 6 redundant places. [2024-06-14 15:31:27,715 INFO L231 Difference]: Finished difference. Result has 129 places, 144 transitions, 1293 flow [2024-06-14 15:31:27,715 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=1211, PETRI_DIFFERENCE_MINUEND_PLACES=122, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=141, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=127, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1293, PETRI_PLACES=129, PETRI_TRANSITIONS=144} [2024-06-14 15:31:27,716 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 87 predicate places. [2024-06-14 15:31:27,716 INFO L495 AbstractCegarLoop]: Abstraction has has 129 places, 144 transitions, 1293 flow [2024-06-14 15:31:27,716 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 12.875) internal successors, (103), 8 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:31:27,717 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:31:27,717 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:31:27,717 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-06-14 15:31:27,717 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 15:31:27,717 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:31:27,717 INFO L85 PathProgramCache]: Analyzing trace with hash 1686408069, now seen corresponding path program 1 times [2024-06-14 15:31:27,717 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:31:27,718 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1814170123] [2024-06-14 15:31:27,718 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:31:27,718 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:31:27,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:31:38,228 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:31:38,228 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:31:38,228 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1814170123] [2024-06-14 15:31:38,228 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1814170123] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:31:38,228 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:31:38,228 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 15:31:38,228 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1985767243] [2024-06-14 15:31:38,228 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:31:38,229 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 15:31:38,229 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:31:38,229 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 15:31:38,229 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-06-14 15:31:38,382 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 41 [2024-06-14 15:31:38,382 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 129 places, 144 transitions, 1293 flow. Second operand has 9 states, 9 states have (on average 11.777777777777779) internal successors, (106), 9 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:31:38,382 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:31:38,383 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 41 [2024-06-14 15:31:38,384 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:31:39,194 INFO L124 PetriNetUnfolderBase]: 1591/2597 cut-off events. [2024-06-14 15:31:39,194 INFO L125 PetriNetUnfolderBase]: For 58890/58890 co-relation queries the response was YES. [2024-06-14 15:31:39,205 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15294 conditions, 2597 events. 1591/2597 cut-off events. For 58890/58890 co-relation queries the response was YES. Maximal size of possible extension queue 158. Compared 14163 event pairs, 435 based on Foata normal form. 2/2598 useless extension candidates. Maximal degree in co-relation 15235. Up to 2438 conditions per place. [2024-06-14 15:31:39,213 INFO L140 encePairwiseOnDemand]: 32/41 looper letters, 137 selfloop transitions, 16 changer transitions 0/158 dead transitions. [2024-06-14 15:31:39,213 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 136 places, 158 transitions, 1675 flow [2024-06-14 15:31:39,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 15:31:39,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 15:31:39,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 132 transitions. [2024-06-14 15:31:39,215 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4024390243902439 [2024-06-14 15:31:39,215 INFO L175 Difference]: Start difference. First operand has 129 places, 144 transitions, 1293 flow. Second operand 8 states and 132 transitions. [2024-06-14 15:31:39,215 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 136 places, 158 transitions, 1675 flow [2024-06-14 15:31:39,261 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 131 places, 158 transitions, 1619 flow, removed 16 selfloop flow, removed 5 redundant places. [2024-06-14 15:31:39,263 INFO L231 Difference]: Finished difference. Result has 132 places, 146 transitions, 1326 flow [2024-06-14 15:31:39,264 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=1237, PETRI_DIFFERENCE_MINUEND_PLACES=124, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=144, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=128, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1326, PETRI_PLACES=132, PETRI_TRANSITIONS=146} [2024-06-14 15:31:39,264 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 90 predicate places. [2024-06-14 15:31:39,265 INFO L495 AbstractCegarLoop]: Abstraction has has 132 places, 146 transitions, 1326 flow [2024-06-14 15:31:39,265 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.777777777777779) internal successors, (106), 9 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:31:39,265 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:31:39,265 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-14 15:31:39,265 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-06-14 15:31:39,265 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 15:31:39,265 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:31:39,266 INFO L85 PathProgramCache]: Analyzing trace with hash 475339013, now seen corresponding path program 1 times [2024-06-14 15:31:39,266 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:31:39,266 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [679225787] [2024-06-14 15:31:39,266 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:31:39,266 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:31:39,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:31:49,301 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:31:49,301 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:31:49,301 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [679225787] [2024-06-14 15:31:49,301 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [679225787] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:31:49,301 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:31:49,301 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 15:31:49,301 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [690974822] [2024-06-14 15:31:49,301 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:31:49,301 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 15:31:49,301 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:31:49,302 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 15:31:49,302 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-06-14 15:31:49,428 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 41 [2024-06-14 15:31:49,428 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 132 places, 146 transitions, 1326 flow. Second operand has 10 states, 10 states have (on average 11.6) internal successors, (116), 10 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:31:49,428 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:31:49,428 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 41 [2024-06-14 15:31:49,428 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:31:50,382 INFO L124 PetriNetUnfolderBase]: 1606/2623 cut-off events. [2024-06-14 15:31:50,382 INFO L125 PetriNetUnfolderBase]: For 62641/62644 co-relation queries the response was YES. [2024-06-14 15:31:50,395 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15618 conditions, 2623 events. 1606/2623 cut-off events. For 62641/62644 co-relation queries the response was YES. Maximal size of possible extension queue 160. Compared 14347 event pairs, 436 based on Foata normal form. 5/2626 useless extension candidates. Maximal degree in co-relation 15558. Up to 2374 conditions per place. [2024-06-14 15:31:50,403 INFO L140 encePairwiseOnDemand]: 29/41 looper letters, 142 selfloop transitions, 28 changer transitions 0/175 dead transitions. [2024-06-14 15:31:50,404 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 139 places, 175 transitions, 1810 flow [2024-06-14 15:31:50,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 15:31:50,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 15:31:50,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 152 transitions. [2024-06-14 15:31:50,405 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4634146341463415 [2024-06-14 15:31:50,405 INFO L175 Difference]: Start difference. First operand has 132 places, 146 transitions, 1326 flow. Second operand 8 states and 152 transitions. [2024-06-14 15:31:50,405 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 139 places, 175 transitions, 1810 flow [2024-06-14 15:31:50,458 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 133 places, 175 transitions, 1737 flow, removed 22 selfloop flow, removed 6 redundant places. [2024-06-14 15:31:50,460 INFO L231 Difference]: Finished difference. Result has 134 places, 150 transitions, 1394 flow [2024-06-14 15:31:50,460 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=1253, PETRI_DIFFERENCE_MINUEND_PLACES=126, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=146, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=118, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1394, PETRI_PLACES=134, PETRI_TRANSITIONS=150} [2024-06-14 15:31:50,461 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 92 predicate places. [2024-06-14 15:31:50,461 INFO L495 AbstractCegarLoop]: Abstraction has has 134 places, 150 transitions, 1394 flow [2024-06-14 15:31:50,461 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.6) internal successors, (116), 10 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:31:50,461 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:31:50,461 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-14 15:31:50,461 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-06-14 15:31:50,461 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-14 15:31:50,462 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:31:50,462 INFO L85 PathProgramCache]: Analyzing trace with hash -803082470, now seen corresponding path program 1 times [2024-06-14 15:31:50,462 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:31:50,462 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [149968877] [2024-06-14 15:31:50,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:31:50,462 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:31:50,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:32:00,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-14 15:32:00,281 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:32:00,281 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [149968877] [2024-06-14 15:32:00,281 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [149968877] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:32:00,281 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:32:00,281 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 15:32:00,282 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1537962947] [2024-06-14 15:32:00,282 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:32:00,282 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 15:32:00,282 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:32:00,283 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 15:32:00,283 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-06-14 15:32:00,420 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 41 [2024-06-14 15:32:00,420 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 134 places, 150 transitions, 1394 flow. Second operand has 9 states, 9 states have (on average 11.666666666666666) internal successors, (105), 9 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:32:00,420 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:32:00,420 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 41 [2024-06-14 15:32:00,420 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:32:01,352 INFO L124 PetriNetUnfolderBase]: 1626/2655 cut-off events. [2024-06-14 15:32:01,352 INFO L125 PetriNetUnfolderBase]: For 67713/67716 co-relation queries the response was YES. [2024-06-14 15:32:01,365 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16332 conditions, 2655 events. 1626/2655 cut-off events. For 67713/67716 co-relation queries the response was YES. Maximal size of possible extension queue 162. Compared 14557 event pairs, 434 based on Foata normal form. 6/2659 useless extension candidates. Maximal degree in co-relation 16271. Up to 2410 conditions per place. [2024-06-14 15:32:01,373 INFO L140 encePairwiseOnDemand]: 30/41 looper letters, 146 selfloop transitions, 23 changer transitions 0/174 dead transitions. [2024-06-14 15:32:01,373 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 140 places, 174 transitions, 1848 flow [2024-06-14 15:32:01,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-14 15:32:01,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-14 15:32:01,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 133 transitions. [2024-06-14 15:32:01,374 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4634146341463415 [2024-06-14 15:32:01,375 INFO L175 Difference]: Start difference. First operand has 134 places, 150 transitions, 1394 flow. Second operand 7 states and 133 transitions. [2024-06-14 15:32:01,375 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 140 places, 174 transitions, 1848 flow [2024-06-14 15:32:01,429 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 134 places, 174 transitions, 1735 flow, removed 31 selfloop flow, removed 6 redundant places. [2024-06-14 15:32:01,432 INFO L231 Difference]: Finished difference. Result has 135 places, 154 transitions, 1402 flow [2024-06-14 15:32:01,432 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=1281, PETRI_DIFFERENCE_MINUEND_PLACES=128, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=150, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=127, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1402, PETRI_PLACES=135, PETRI_TRANSITIONS=154} [2024-06-14 15:32:01,433 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 93 predicate places. [2024-06-14 15:32:01,433 INFO L495 AbstractCegarLoop]: Abstraction has has 135 places, 154 transitions, 1402 flow [2024-06-14 15:32:01,433 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.666666666666666) internal successors, (105), 9 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:32:01,433 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:32:01,433 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-14 15:32:01,434 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2024-06-14 15:32:01,434 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 15:32:01,434 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:32:01,434 INFO L85 PathProgramCache]: Analyzing trace with hash -1666531606, now seen corresponding path program 2 times [2024-06-14 15:32:01,434 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:32:01,434 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1750715188] [2024-06-14 15:32:01,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:32:01,435 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:32:01,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:32:11,293 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:32:11,294 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:32:11,294 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1750715188] [2024-06-14 15:32:11,294 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1750715188] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:32:11,294 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:32:11,294 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 15:32:11,294 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1666655650] [2024-06-14 15:32:11,294 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:32:11,294 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 15:32:11,294 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:32:11,294 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 15:32:11,295 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-14 15:32:11,498 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 41 [2024-06-14 15:32:11,499 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 135 places, 154 transitions, 1402 flow. Second operand has 9 states, 9 states have (on average 11.666666666666666) internal successors, (105), 9 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:32:11,499 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:32:11,499 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 41 [2024-06-14 15:32:11,499 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:32:12,332 INFO L124 PetriNetUnfolderBase]: 1630/2665 cut-off events. [2024-06-14 15:32:12,333 INFO L125 PetriNetUnfolderBase]: For 70664/70667 co-relation queries the response was YES. [2024-06-14 15:32:12,346 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16399 conditions, 2665 events. 1630/2665 cut-off events. For 70664/70667 co-relation queries the response was YES. Maximal size of possible extension queue 162. Compared 14686 event pairs, 433 based on Foata normal form. 6/2669 useless extension candidates. Maximal degree in co-relation 16337. Up to 2359 conditions per place. [2024-06-14 15:32:12,356 INFO L140 encePairwiseOnDemand]: 30/41 looper letters, 136 selfloop transitions, 35 changer transitions 0/176 dead transitions. [2024-06-14 15:32:12,356 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 141 places, 176 transitions, 1920 flow [2024-06-14 15:32:12,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-14 15:32:12,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-14 15:32:12,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 133 transitions. [2024-06-14 15:32:12,357 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4634146341463415 [2024-06-14 15:32:12,357 INFO L175 Difference]: Start difference. First operand has 135 places, 154 transitions, 1402 flow. Second operand 7 states and 133 transitions. [2024-06-14 15:32:12,357 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 141 places, 176 transitions, 1920 flow [2024-06-14 15:32:12,421 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 138 places, 176 transitions, 1864 flow, removed 16 selfloop flow, removed 3 redundant places. [2024-06-14 15:32:12,423 INFO L231 Difference]: Finished difference. Result has 139 places, 157 transitions, 1483 flow [2024-06-14 15:32:12,424 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=1346, PETRI_DIFFERENCE_MINUEND_PLACES=132, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=154, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=121, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1483, PETRI_PLACES=139, PETRI_TRANSITIONS=157} [2024-06-14 15:32:12,424 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 97 predicate places. [2024-06-14 15:32:12,424 INFO L495 AbstractCegarLoop]: Abstraction has has 139 places, 157 transitions, 1483 flow [2024-06-14 15:32:12,424 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.666666666666666) internal successors, (105), 9 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:32:12,424 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:32:12,424 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-14 15:32:12,425 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2024-06-14 15:32:12,425 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 15:32:12,425 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:32:12,425 INFO L85 PathProgramCache]: Analyzing trace with hash -1666523670, now seen corresponding path program 1 times [2024-06-14 15:32:12,425 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:32:12,425 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [879665280] [2024-06-14 15:32:12,425 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:32:12,426 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:32:12,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:32:23,804 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:32:23,804 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:32:23,804 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [879665280] [2024-06-14 15:32:23,804 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [879665280] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:32:23,804 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:32:23,805 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 15:32:23,805 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [29408593] [2024-06-14 15:32:23,805 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:32:23,805 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 15:32:23,806 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:32:23,813 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 15:32:23,814 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-06-14 15:32:23,945 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 41 [2024-06-14 15:32:23,945 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 139 places, 157 transitions, 1483 flow. Second operand has 10 states, 10 states have (on average 11.6) internal successors, (116), 10 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:32:23,946 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:32:23,946 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 41 [2024-06-14 15:32:23,946 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:32:24,787 INFO L124 PetriNetUnfolderBase]: 1635/2669 cut-off events. [2024-06-14 15:32:24,788 INFO L125 PetriNetUnfolderBase]: For 73295/73295 co-relation queries the response was YES. [2024-06-14 15:32:24,800 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16615 conditions, 2669 events. 1635/2669 cut-off events. For 73295/73295 co-relation queries the response was YES. Maximal size of possible extension queue 162. Compared 14661 event pairs, 430 based on Foata normal form. 1/2669 useless extension candidates. Maximal degree in co-relation 16552. Up to 2491 conditions per place. [2024-06-14 15:32:24,808 INFO L140 encePairwiseOnDemand]: 31/41 looper letters, 155 selfloop transitions, 17 changer transitions 0/177 dead transitions. [2024-06-14 15:32:24,808 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 146 places, 177 transitions, 1935 flow [2024-06-14 15:32:24,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 15:32:24,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 15:32:24,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 138 transitions. [2024-06-14 15:32:24,810 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42073170731707316 [2024-06-14 15:32:24,810 INFO L175 Difference]: Start difference. First operand has 139 places, 157 transitions, 1483 flow. Second operand 8 states and 138 transitions. [2024-06-14 15:32:24,810 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 146 places, 177 transitions, 1935 flow [2024-06-14 15:32:24,871 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 142 places, 177 transitions, 1854 flow, removed 19 selfloop flow, removed 4 redundant places. [2024-06-14 15:32:24,873 INFO L231 Difference]: Finished difference. Result has 143 places, 160 transitions, 1514 flow [2024-06-14 15:32:24,873 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=1402, PETRI_DIFFERENCE_MINUEND_PLACES=135, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=157, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=140, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1514, PETRI_PLACES=143, PETRI_TRANSITIONS=160} [2024-06-14 15:32:24,874 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 101 predicate places. [2024-06-14 15:32:24,874 INFO L495 AbstractCegarLoop]: Abstraction has has 143 places, 160 transitions, 1514 flow [2024-06-14 15:32:24,874 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.6) internal successors, (116), 10 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:32:24,874 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:32:24,874 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-14 15:32:24,874 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2024-06-14 15:32:24,874 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 15:32:24,875 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:32:24,875 INFO L85 PathProgramCache]: Analyzing trace with hash -1666524073, now seen corresponding path program 2 times [2024-06-14 15:32:24,875 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:32:24,875 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [894850853] [2024-06-14 15:32:24,875 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:32:24,875 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:32:24,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:32:34,730 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:32:34,730 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:32:34,730 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [894850853] [2024-06-14 15:32:34,730 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [894850853] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:32:34,730 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:32:34,730 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 15:32:34,730 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1364640750] [2024-06-14 15:32:34,730 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:32:34,731 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 15:32:34,731 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:32:34,731 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 15:32:34,731 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-06-14 15:32:34,838 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 41 [2024-06-14 15:32:34,838 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 143 places, 160 transitions, 1514 flow. Second operand has 10 states, 10 states have (on average 11.6) internal successors, (116), 10 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:32:34,838 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:32:34,838 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 41 [2024-06-14 15:32:34,838 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:32:35,782 INFO L124 PetriNetUnfolderBase]: 1694/2762 cut-off events. [2024-06-14 15:32:35,782 INFO L125 PetriNetUnfolderBase]: For 81270/81273 co-relation queries the response was YES. [2024-06-14 15:32:35,794 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17599 conditions, 2762 events. 1694/2762 cut-off events. For 81270/81273 co-relation queries the response was YES. Maximal size of possible extension queue 171. Compared 15295 event pairs, 427 based on Foata normal form. 5/2765 useless extension candidates. Maximal degree in co-relation 17535. Up to 2365 conditions per place. [2024-06-14 15:32:35,802 INFO L140 encePairwiseOnDemand]: 29/41 looper letters, 142 selfloop transitions, 44 changer transitions 0/191 dead transitions. [2024-06-14 15:32:35,802 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 150 places, 191 transitions, 2278 flow [2024-06-14 15:32:35,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 15:32:35,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 15:32:35,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 151 transitions. [2024-06-14 15:32:35,803 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4603658536585366 [2024-06-14 15:32:35,803 INFO L175 Difference]: Start difference. First operand has 143 places, 160 transitions, 1514 flow. Second operand 8 states and 151 transitions. [2024-06-14 15:32:35,803 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 150 places, 191 transitions, 2278 flow [2024-06-14 15:32:35,861 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 144 places, 191 transitions, 2188 flow, removed 30 selfloop flow, removed 6 redundant places. [2024-06-14 15:32:35,863 INFO L231 Difference]: Finished difference. Result has 146 places, 168 transitions, 1700 flow [2024-06-14 15:32:35,863 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=1424, PETRI_DIFFERENCE_MINUEND_PLACES=137, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=160, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=39, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=119, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1700, PETRI_PLACES=146, PETRI_TRANSITIONS=168} [2024-06-14 15:32:35,864 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 104 predicate places. [2024-06-14 15:32:35,864 INFO L495 AbstractCegarLoop]: Abstraction has has 146 places, 168 transitions, 1700 flow [2024-06-14 15:32:35,864 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.6) internal successors, (116), 10 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:32:35,864 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:32:35,864 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-14 15:32:35,864 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2024-06-14 15:32:35,864 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 15:32:35,865 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:32:35,865 INFO L85 PathProgramCache]: Analyzing trace with hash 484593443, now seen corresponding path program 3 times [2024-06-14 15:32:35,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:32:35,865 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1682650371] [2024-06-14 15:32:35,865 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:32:35,865 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:32:35,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:32:45,737 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:32:45,737 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:32:45,737 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1682650371] [2024-06-14 15:32:45,737 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1682650371] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:32:45,738 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:32:45,738 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 15:32:45,738 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1219674560] [2024-06-14 15:32:45,738 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:32:45,738 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 15:32:45,738 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:32:45,739 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 15:32:45,739 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-06-14 15:32:45,934 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 41 [2024-06-14 15:32:45,935 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 146 places, 168 transitions, 1700 flow. Second operand has 10 states, 10 states have (on average 11.6) internal successors, (116), 10 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:32:45,935 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:32:45,935 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 41 [2024-06-14 15:32:45,935 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:32:46,809 INFO L124 PetriNetUnfolderBase]: 1705/2780 cut-off events. [2024-06-14 15:32:46,809 INFO L125 PetriNetUnfolderBase]: For 88790/88793 co-relation queries the response was YES. [2024-06-14 15:32:46,822 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18444 conditions, 2780 events. 1705/2780 cut-off events. For 88790/88793 co-relation queries the response was YES. Maximal size of possible extension queue 173. Compared 15455 event pairs, 432 based on Foata normal form. 5/2783 useless extension candidates. Maximal degree in co-relation 18378. Up to 2378 conditions per place. [2024-06-14 15:32:46,833 INFO L140 encePairwiseOnDemand]: 29/41 looper letters, 140 selfloop transitions, 48 changer transitions 0/193 dead transitions. [2024-06-14 15:32:46,833 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 153 places, 193 transitions, 2303 flow [2024-06-14 15:32:46,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 15:32:46,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 15:32:46,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 151 transitions. [2024-06-14 15:32:46,834 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4603658536585366 [2024-06-14 15:32:46,834 INFO L175 Difference]: Start difference. First operand has 146 places, 168 transitions, 1700 flow. Second operand 8 states and 151 transitions. [2024-06-14 15:32:46,834 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 153 places, 193 transitions, 2303 flow [2024-06-14 15:32:46,905 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 149 places, 193 transitions, 2171 flow, removed 47 selfloop flow, removed 4 redundant places. [2024-06-14 15:32:46,907 INFO L231 Difference]: Finished difference. Result has 150 places, 172 transitions, 1764 flow [2024-06-14 15:32:46,907 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=1576, PETRI_DIFFERENCE_MINUEND_PLACES=142, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=168, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=44, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=123, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1764, PETRI_PLACES=150, PETRI_TRANSITIONS=172} [2024-06-14 15:32:46,908 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 108 predicate places. [2024-06-14 15:32:46,908 INFO L495 AbstractCegarLoop]: Abstraction has has 150 places, 172 transitions, 1764 flow [2024-06-14 15:32:46,908 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.6) internal successors, (116), 10 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:32:46,908 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:32:46,908 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-14 15:32:46,908 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2024-06-14 15:32:46,908 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-14 15:32:46,909 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:32:46,909 INFO L85 PathProgramCache]: Analyzing trace with hash -1276748040, now seen corresponding path program 3 times [2024-06-14 15:32:46,909 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:32:46,909 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1504197763] [2024-06-14 15:32:46,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:32:46,909 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:32:46,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:32:58,041 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:32:58,042 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:32:58,042 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1504197763] [2024-06-14 15:32:58,042 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1504197763] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:32:58,042 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:32:58,042 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 15:32:58,042 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [338837649] [2024-06-14 15:32:58,042 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:32:58,042 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 15:32:58,042 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:32:58,042 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 15:32:58,043 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-06-14 15:32:58,172 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 41 [2024-06-14 15:32:58,173 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 150 places, 172 transitions, 1764 flow. Second operand has 9 states, 9 states have (on average 11.666666666666666) internal successors, (105), 9 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:32:58,173 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:32:58,173 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 41 [2024-06-14 15:32:58,173 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:32:59,078 INFO L124 PetriNetUnfolderBase]: 1691/2764 cut-off events. [2024-06-14 15:32:59,078 INFO L125 PetriNetUnfolderBase]: For 91631/91631 co-relation queries the response was YES. [2024-06-14 15:32:59,091 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18381 conditions, 2764 events. 1691/2764 cut-off events. For 91631/91631 co-relation queries the response was YES. Maximal size of possible extension queue 173. Compared 15512 event pairs, 795 based on Foata normal form. 2/2764 useless extension candidates. Maximal degree in co-relation 18313. Up to 2569 conditions per place. [2024-06-14 15:32:59,101 INFO L140 encePairwiseOnDemand]: 30/41 looper letters, 169 selfloop transitions, 16 changer transitions 0/190 dead transitions. [2024-06-14 15:32:59,101 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 157 places, 190 transitions, 2195 flow [2024-06-14 15:32:59,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 15:32:59,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 15:32:59,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 136 transitions. [2024-06-14 15:32:59,102 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4146341463414634 [2024-06-14 15:32:59,103 INFO L175 Difference]: Start difference. First operand has 150 places, 172 transitions, 1764 flow. Second operand 8 states and 136 transitions. [2024-06-14 15:32:59,103 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 157 places, 190 transitions, 2195 flow [2024-06-14 15:32:59,175 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 152 places, 190 transitions, 2045 flow, removed 42 selfloop flow, removed 5 redundant places. [2024-06-14 15:32:59,180 INFO L231 Difference]: Finished difference. Result has 154 places, 174 transitions, 1672 flow [2024-06-14 15:32:59,180 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=1616, PETRI_DIFFERENCE_MINUEND_PLACES=145, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=172, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=157, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1672, PETRI_PLACES=154, PETRI_TRANSITIONS=174} [2024-06-14 15:32:59,181 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 112 predicate places. [2024-06-14 15:32:59,181 INFO L495 AbstractCegarLoop]: Abstraction has has 154 places, 174 transitions, 1672 flow [2024-06-14 15:32:59,181 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.666666666666666) internal successors, (105), 9 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:32:59,181 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:32:59,182 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-14 15:32:59,182 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2024-06-14 15:32:59,182 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-14 15:32:59,182 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:32:59,182 INFO L85 PathProgramCache]: Analyzing trace with hash -464707862, now seen corresponding path program 4 times [2024-06-14 15:32:59,182 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:32:59,182 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1946244508] [2024-06-14 15:32:59,183 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:32:59,183 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:32:59,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:33:09,273 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:33:09,274 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:33:09,274 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1946244508] [2024-06-14 15:33:09,274 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1946244508] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:33:09,274 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:33:09,274 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 15:33:09,274 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [627510283] [2024-06-14 15:33:09,274 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:33:09,275 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 15:33:09,275 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:33:09,275 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 15:33:09,275 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-14 15:33:09,405 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 41 [2024-06-14 15:33:09,406 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 154 places, 174 transitions, 1672 flow. Second operand has 9 states, 9 states have (on average 11.666666666666666) internal successors, (105), 9 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:33:09,406 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:33:09,406 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 41 [2024-06-14 15:33:09,406 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:33:10,340 INFO L124 PetriNetUnfolderBase]: 1701/2772 cut-off events. [2024-06-14 15:33:10,340 INFO L125 PetriNetUnfolderBase]: For 94343/94343 co-relation queries the response was YES. [2024-06-14 15:33:10,357 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18344 conditions, 2772 events. 1701/2772 cut-off events. For 94343/94343 co-relation queries the response was YES. Maximal size of possible extension queue 174. Compared 15411 event pairs, 438 based on Foata normal form. 2/2772 useless extension candidates. Maximal degree in co-relation 18274. Up to 2495 conditions per place. [2024-06-14 15:33:10,367 INFO L140 encePairwiseOnDemand]: 30/41 looper letters, 163 selfloop transitions, 35 changer transitions 0/203 dead transitions. [2024-06-14 15:33:10,368 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 162 places, 203 transitions, 2203 flow [2024-06-14 15:33:10,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 15:33:10,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 15:33:10,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 165 transitions. [2024-06-14 15:33:10,370 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44715447154471544 [2024-06-14 15:33:10,371 INFO L175 Difference]: Start difference. First operand has 154 places, 174 transitions, 1672 flow. Second operand 9 states and 165 transitions. [2024-06-14 15:33:10,371 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 162 places, 203 transitions, 2203 flow [2024-06-14 15:33:10,453 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 152 places, 203 transitions, 2077 flow, removed 9 selfloop flow, removed 10 redundant places. [2024-06-14 15:33:10,455 INFO L231 Difference]: Finished difference. Result has 154 places, 178 transitions, 1702 flow [2024-06-14 15:33:10,455 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=1546, PETRI_DIFFERENCE_MINUEND_PLACES=144, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=174, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=139, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1702, PETRI_PLACES=154, PETRI_TRANSITIONS=178} [2024-06-14 15:33:10,456 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 112 predicate places. [2024-06-14 15:33:10,456 INFO L495 AbstractCegarLoop]: Abstraction has has 154 places, 178 transitions, 1702 flow [2024-06-14 15:33:10,456 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.666666666666666) internal successors, (105), 9 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:33:10,456 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:33:10,456 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-14 15:33:10,456 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2024-06-14 15:33:10,457 INFO L420 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 15:33:10,457 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:33:10,457 INFO L85 PathProgramCache]: Analyzing trace with hash 725688042, now seen corresponding path program 5 times [2024-06-14 15:33:10,457 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:33:10,457 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [919380467] [2024-06-14 15:33:10,457 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:33:10,457 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:33:10,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:33:20,421 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:33:20,421 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:33:20,421 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [919380467] [2024-06-14 15:33:20,421 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [919380467] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:33:20,421 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:33:20,421 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 15:33:20,422 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1222922478] [2024-06-14 15:33:20,422 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:33:20,422 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 15:33:20,422 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:33:20,422 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 15:33:20,422 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-06-14 15:33:20,572 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 41 [2024-06-14 15:33:20,572 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 154 places, 178 transitions, 1702 flow. Second operand has 9 states, 9 states have (on average 11.666666666666666) internal successors, (105), 9 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:33:20,572 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:33:20,573 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 41 [2024-06-14 15:33:20,573 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:33:21,479 INFO L124 PetriNetUnfolderBase]: 1705/2787 cut-off events. [2024-06-14 15:33:21,479 INFO L125 PetriNetUnfolderBase]: For 98824/98827 co-relation queries the response was YES. [2024-06-14 15:33:21,494 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18535 conditions, 2787 events. 1705/2787 cut-off events. For 98824/98827 co-relation queries the response was YES. Maximal size of possible extension queue 174. Compared 15609 event pairs, 445 based on Foata normal form. 6/2790 useless extension candidates. Maximal degree in co-relation 18463. Up to 2399 conditions per place. [2024-06-14 15:33:21,503 INFO L140 encePairwiseOnDemand]: 30/41 looper letters, 142 selfloop transitions, 54 changer transitions 0/201 dead transitions. [2024-06-14 15:33:21,504 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 161 places, 201 transitions, 2288 flow [2024-06-14 15:33:21,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 15:33:21,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 15:33:21,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 151 transitions. [2024-06-14 15:33:21,505 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4603658536585366 [2024-06-14 15:33:21,505 INFO L175 Difference]: Start difference. First operand has 154 places, 178 transitions, 1702 flow. Second operand 8 states and 151 transitions. [2024-06-14 15:33:21,506 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 161 places, 201 transitions, 2288 flow [2024-06-14 15:33:21,591 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 155 places, 201 transitions, 2199 flow, removed 18 selfloop flow, removed 6 redundant places. [2024-06-14 15:33:21,594 INFO L231 Difference]: Finished difference. Result has 156 places, 181 transitions, 1783 flow [2024-06-14 15:33:21,594 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=1613, PETRI_DIFFERENCE_MINUEND_PLACES=148, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=178, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=51, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=126, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1783, PETRI_PLACES=156, PETRI_TRANSITIONS=181} [2024-06-14 15:33:21,595 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 114 predicate places. [2024-06-14 15:33:21,595 INFO L495 AbstractCegarLoop]: Abstraction has has 156 places, 181 transitions, 1783 flow [2024-06-14 15:33:21,595 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.666666666666666) internal successors, (105), 9 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:33:21,595 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:33:21,595 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-14 15:33:21,596 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2024-06-14 15:33:21,596 INFO L420 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 15:33:21,596 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:33:21,596 INFO L85 PathProgramCache]: Analyzing trace with hash -320817332, now seen corresponding path program 6 times [2024-06-14 15:33:21,596 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:33:21,596 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1773571428] [2024-06-14 15:33:21,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:33:21,596 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:33:21,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:33:31,632 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:33:31,633 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:33:31,633 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1773571428] [2024-06-14 15:33:31,633 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1773571428] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:33:31,633 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:33:31,633 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 15:33:31,633 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1551807029] [2024-06-14 15:33:31,633 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:33:31,633 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 15:33:31,634 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:33:31,634 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 15:33:31,634 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-06-14 15:33:31,754 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 41 [2024-06-14 15:33:31,754 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 156 places, 181 transitions, 1783 flow. Second operand has 9 states, 9 states have (on average 11.666666666666666) internal successors, (105), 9 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:33:31,754 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:33:31,755 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 41 [2024-06-14 15:33:31,755 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:33:32,621 INFO L124 PetriNetUnfolderBase]: 1695/2771 cut-off events. [2024-06-14 15:33:32,621 INFO L125 PetriNetUnfolderBase]: For 100332/100335 co-relation queries the response was YES. [2024-06-14 15:33:32,635 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18528 conditions, 2771 events. 1695/2771 cut-off events. For 100332/100335 co-relation queries the response was YES. Maximal size of possible extension queue 173. Compared 15484 event pairs, 449 based on Foata normal form. 4/2772 useless extension candidates. Maximal degree in co-relation 18455. Up to 2391 conditions per place. [2024-06-14 15:33:32,645 INFO L140 encePairwiseOnDemand]: 30/41 looper letters, 137 selfloop transitions, 58 changer transitions 0/200 dead transitions. [2024-06-14 15:33:32,645 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 163 places, 200 transitions, 2239 flow [2024-06-14 15:33:32,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 15:33:32,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 15:33:32,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 149 transitions. [2024-06-14 15:33:32,650 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45426829268292684 [2024-06-14 15:33:32,650 INFO L175 Difference]: Start difference. First operand has 156 places, 181 transitions, 1783 flow. Second operand 8 states and 149 transitions. [2024-06-14 15:33:32,650 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 163 places, 200 transitions, 2239 flow [2024-06-14 15:33:32,746 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 158 places, 200 transitions, 2087 flow, removed 32 selfloop flow, removed 5 redundant places. [2024-06-14 15:33:32,748 INFO L231 Difference]: Finished difference. Result has 159 places, 181 transitions, 1753 flow [2024-06-14 15:33:32,748 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=1631, PETRI_DIFFERENCE_MINUEND_PLACES=151, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=181, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=58, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=123, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1753, PETRI_PLACES=159, PETRI_TRANSITIONS=181} [2024-06-14 15:33:32,755 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 117 predicate places. [2024-06-14 15:33:32,756 INFO L495 AbstractCegarLoop]: Abstraction has has 159 places, 181 transitions, 1753 flow [2024-06-14 15:33:32,756 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.666666666666666) internal successors, (105), 9 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:33:32,756 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:33:32,756 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-14 15:33:32,756 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2024-06-14 15:33:32,756 INFO L420 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 15:33:32,757 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:33:32,757 INFO L85 PathProgramCache]: Analyzing trace with hash -1351036980, now seen corresponding path program 2 times [2024-06-14 15:33:32,757 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:33:32,757 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1082629036] [2024-06-14 15:33:32,757 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:33:32,757 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:33:32,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:33:43,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-14 15:33:43,672 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:33:43,672 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1082629036] [2024-06-14 15:33:43,672 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1082629036] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:33:43,673 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:33:43,673 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 15:33:43,673 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1717181357] [2024-06-14 15:33:43,673 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:33:43,673 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 15:33:43,673 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:33:43,674 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 15:33:43,674 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-06-14 15:33:43,790 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 41 [2024-06-14 15:33:43,791 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 159 places, 181 transitions, 1753 flow. Second operand has 10 states, 10 states have (on average 11.6) internal successors, (116), 10 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:33:43,791 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:33:43,791 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 41 [2024-06-14 15:33:43,791 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:33:44,686 INFO L124 PetriNetUnfolderBase]: 1700/2770 cut-off events. [2024-06-14 15:33:44,686 INFO L125 PetriNetUnfolderBase]: For 103290/103298 co-relation queries the response was YES. [2024-06-14 15:33:44,701 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18622 conditions, 2770 events. 1700/2770 cut-off events. For 103290/103298 co-relation queries the response was YES. Maximal size of possible extension queue 171. Compared 15346 event pairs, 439 based on Foata normal form. 9/2778 useless extension candidates. Maximal degree in co-relation 18548. Up to 2567 conditions per place. [2024-06-14 15:33:44,711 INFO L140 encePairwiseOnDemand]: 31/41 looper letters, 165 selfloop transitions, 31 changer transitions 0/201 dead transitions. [2024-06-14 15:33:44,711 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 167 places, 201 transitions, 2267 flow [2024-06-14 15:33:44,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 15:33:44,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 15:33:44,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 155 transitions. [2024-06-14 15:33:44,713 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42005420054200543 [2024-06-14 15:33:44,713 INFO L175 Difference]: Start difference. First operand has 159 places, 181 transitions, 1753 flow. Second operand 9 states and 155 transitions. [2024-06-14 15:33:44,713 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 167 places, 201 transitions, 2267 flow [2024-06-14 15:33:44,804 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 158 places, 201 transitions, 2097 flow, removed 10 selfloop flow, removed 9 redundant places. [2024-06-14 15:33:44,807 INFO L231 Difference]: Finished difference. Result has 159 places, 184 transitions, 1735 flow [2024-06-14 15:33:44,807 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=1583, PETRI_DIFFERENCE_MINUEND_PLACES=150, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=181, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=150, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1735, PETRI_PLACES=159, PETRI_TRANSITIONS=184} [2024-06-14 15:33:44,807 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 117 predicate places. [2024-06-14 15:33:44,807 INFO L495 AbstractCegarLoop]: Abstraction has has 159 places, 184 transitions, 1735 flow [2024-06-14 15:33:44,808 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.6) internal successors, (116), 10 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:33:44,808 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:33:44,808 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-14 15:33:44,808 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2024-06-14 15:33:44,808 INFO L420 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 15:33:44,808 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:33:44,808 INFO L85 PathProgramCache]: Analyzing trace with hash 738582988, now seen corresponding path program 3 times [2024-06-14 15:33:44,809 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:33:44,809 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1888134167] [2024-06-14 15:33:44,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:33:44,809 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:33:44,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:33:55,615 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:33:55,615 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:33:55,615 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1888134167] [2024-06-14 15:33:55,615 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1888134167] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:33:55,615 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:33:55,616 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 15:33:55,616 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [972991170] [2024-06-14 15:33:55,616 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:33:55,616 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 15:33:55,616 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:33:55,616 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 15:33:55,616 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-06-14 15:33:55,899 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 41 [2024-06-14 15:33:55,900 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 159 places, 184 transitions, 1735 flow. Second operand has 9 states, 9 states have (on average 11.777777777777779) internal successors, (106), 9 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:33:55,900 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:33:55,900 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 41 [2024-06-14 15:33:55,900 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:33:56,814 INFO L124 PetriNetUnfolderBase]: 1705/2782 cut-off events. [2024-06-14 15:33:56,815 INFO L125 PetriNetUnfolderBase]: For 108549/108549 co-relation queries the response was YES. [2024-06-14 15:33:56,830 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18754 conditions, 2782 events. 1705/2782 cut-off events. For 108549/108549 co-relation queries the response was YES. Maximal size of possible extension queue 174. Compared 15594 event pairs, 794 based on Foata normal form. 1/2781 useless extension candidates. Maximal degree in co-relation 18681. Up to 2601 conditions per place. [2024-06-14 15:33:56,840 INFO L140 encePairwiseOnDemand]: 31/41 looper letters, 174 selfloop transitions, 18 changer transitions 0/197 dead transitions. [2024-06-14 15:33:56,841 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 166 places, 197 transitions, 2227 flow [2024-06-14 15:33:56,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 15:33:56,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 15:33:56,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 132 transitions. [2024-06-14 15:33:56,842 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4024390243902439 [2024-06-14 15:33:56,842 INFO L175 Difference]: Start difference. First operand has 159 places, 184 transitions, 1735 flow. Second operand 8 states and 132 transitions. [2024-06-14 15:33:56,842 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 166 places, 197 transitions, 2227 flow [2024-06-14 15:33:56,949 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 159 places, 197 transitions, 2097 flow, removed 36 selfloop flow, removed 7 redundant places. [2024-06-14 15:33:56,952 INFO L231 Difference]: Finished difference. Result has 160 places, 187 transitions, 1737 flow [2024-06-14 15:33:56,952 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=1605, PETRI_DIFFERENCE_MINUEND_PLACES=152, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=184, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=166, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1737, PETRI_PLACES=160, PETRI_TRANSITIONS=187} [2024-06-14 15:33:56,953 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 118 predicate places. [2024-06-14 15:33:56,953 INFO L495 AbstractCegarLoop]: Abstraction has has 160 places, 187 transitions, 1737 flow [2024-06-14 15:33:56,953 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.777777777777779) internal successors, (106), 9 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:33:56,953 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:33:56,953 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-14 15:33:56,953 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2024-06-14 15:33:56,953 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-14 15:33:56,954 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:33:56,954 INFO L85 PathProgramCache]: Analyzing trace with hash 725684415, now seen corresponding path program 4 times [2024-06-14 15:33:56,954 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:33:56,954 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [327504675] [2024-06-14 15:33:56,954 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:33:56,954 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:33:56,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:34:07,402 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:34:07,402 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:34:07,403 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [327504675] [2024-06-14 15:34:07,404 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [327504675] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:34:07,404 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:34:07,404 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 15:34:07,404 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1675168629] [2024-06-14 15:34:07,404 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:34:07,405 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 15:34:07,405 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:34:07,406 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 15:34:07,406 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2024-06-14 15:34:07,573 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 41 [2024-06-14 15:34:07,574 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 160 places, 187 transitions, 1737 flow. Second operand has 10 states, 10 states have (on average 11.6) internal successors, (116), 10 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:34:07,574 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:34:07,574 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 41 [2024-06-14 15:34:07,574 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:34:08,506 INFO L124 PetriNetUnfolderBase]: 1752/2842 cut-off events. [2024-06-14 15:34:08,507 INFO L125 PetriNetUnfolderBase]: For 121033/121036 co-relation queries the response was YES. [2024-06-14 15:34:08,521 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19682 conditions, 2842 events. 1752/2842 cut-off events. For 121033/121036 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 15809 event pairs, 455 based on Foata normal form. 5/2844 useless extension candidates. Maximal degree in co-relation 19608. Up to 2285 conditions per place. [2024-06-14 15:34:08,532 INFO L140 encePairwiseOnDemand]: 29/41 looper letters, 138 selfloop transitions, 80 changer transitions 0/223 dead transitions. [2024-06-14 15:34:08,533 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 168 places, 223 transitions, 2775 flow [2024-06-14 15:34:08,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 15:34:08,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 15:34:08,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 172 transitions. [2024-06-14 15:34:08,534 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46612466124661245 [2024-06-14 15:34:08,534 INFO L175 Difference]: Start difference. First operand has 160 places, 187 transitions, 1737 flow. Second operand 9 states and 172 transitions. [2024-06-14 15:34:08,534 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 168 places, 223 transitions, 2775 flow [2024-06-14 15:34:08,629 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 162 places, 223 transitions, 2665 flow, removed 39 selfloop flow, removed 6 redundant places. [2024-06-14 15:34:08,632 INFO L231 Difference]: Finished difference. Result has 164 places, 199 transitions, 2103 flow [2024-06-14 15:34:08,632 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=1627, PETRI_DIFFERENCE_MINUEND_PLACES=154, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=187, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=72, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=114, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2103, PETRI_PLACES=164, PETRI_TRANSITIONS=199} [2024-06-14 15:34:08,633 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 122 predicate places. [2024-06-14 15:34:08,633 INFO L495 AbstractCegarLoop]: Abstraction has has 164 places, 199 transitions, 2103 flow [2024-06-14 15:34:08,633 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.6) internal successors, (116), 10 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:34:08,633 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:34:08,633 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-14 15:34:08,634 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2024-06-14 15:34:08,634 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-14 15:34:08,634 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:34:08,634 INFO L85 PathProgramCache]: Analyzing trace with hash 725695575, now seen corresponding path program 5 times [2024-06-14 15:34:08,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:34:08,634 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [362711122] [2024-06-14 15:34:08,634 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:34:08,635 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:34:08,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:34:18,991 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:34:18,991 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:34:18,991 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [362711122] [2024-06-14 15:34:18,991 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [362711122] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:34:18,991 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:34:18,992 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 15:34:18,992 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1028442797] [2024-06-14 15:34:18,992 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:34:18,992 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 15:34:18,992 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:34:18,993 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 15:34:18,993 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2024-06-14 15:34:19,233 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 41 [2024-06-14 15:34:19,233 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 164 places, 199 transitions, 2103 flow. Second operand has 10 states, 10 states have (on average 11.6) internal successors, (116), 10 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:34:19,233 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:34:19,233 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 41 [2024-06-14 15:34:19,233 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:34:20,156 INFO L124 PetriNetUnfolderBase]: 1803/2925 cut-off events. [2024-06-14 15:34:20,156 INFO L125 PetriNetUnfolderBase]: For 133031/133034 co-relation queries the response was YES. [2024-06-14 15:34:20,173 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21408 conditions, 2925 events. 1803/2925 cut-off events. For 133031/133034 co-relation queries the response was YES. Maximal size of possible extension queue 182. Compared 16346 event pairs, 457 based on Foata normal form. 5/2927 useless extension candidates. Maximal degree in co-relation 21332. Up to 2328 conditions per place. [2024-06-14 15:34:20,185 INFO L140 encePairwiseOnDemand]: 29/41 looper letters, 143 selfloop transitions, 83 changer transitions 0/231 dead transitions. [2024-06-14 15:34:20,186 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 172 places, 231 transitions, 3090 flow [2024-06-14 15:34:20,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 15:34:20,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 15:34:20,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 172 transitions. [2024-06-14 15:34:20,187 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46612466124661245 [2024-06-14 15:34:20,187 INFO L175 Difference]: Start difference. First operand has 164 places, 199 transitions, 2103 flow. Second operand 9 states and 172 transitions. [2024-06-14 15:34:20,187 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 172 places, 231 transitions, 3090 flow [2024-06-14 15:34:20,374 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 167 places, 231 transitions, 2851 flow, removed 73 selfloop flow, removed 5 redundant places. [2024-06-14 15:34:20,377 INFO L231 Difference]: Finished difference. Result has 169 places, 207 transitions, 2258 flow [2024-06-14 15:34:20,377 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=1890, PETRI_DIFFERENCE_MINUEND_PLACES=159, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=199, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=75, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=122, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2258, PETRI_PLACES=169, PETRI_TRANSITIONS=207} [2024-06-14 15:34:20,377 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 127 predicate places. [2024-06-14 15:34:20,377 INFO L495 AbstractCegarLoop]: Abstraction has has 169 places, 207 transitions, 2258 flow [2024-06-14 15:34:20,377 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.6) internal successors, (116), 10 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:34:20,378 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:34:20,378 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-14 15:34:20,378 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2024-06-14 15:34:20,378 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-14 15:34:20,379 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:34:20,379 INFO L85 PathProgramCache]: Analyzing trace with hash 738582585, now seen corresponding path program 6 times [2024-06-14 15:34:20,379 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:34:20,379 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [107164190] [2024-06-14 15:34:20,379 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:34:20,380 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:34:20,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:34:30,849 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:34:30,850 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:34:30,850 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [107164190] [2024-06-14 15:34:30,850 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [107164190] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:34:30,850 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:34:30,850 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 15:34:30,850 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [815936754] [2024-06-14 15:34:30,851 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:34:30,851 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 15:34:30,851 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:34:30,851 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 15:34:30,851 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-14 15:34:30,966 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 41 [2024-06-14 15:34:30,966 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 169 places, 207 transitions, 2258 flow. Second operand has 9 states, 9 states have (on average 11.777777777777779) internal successors, (106), 9 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:34:30,967 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:34:30,967 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 41 [2024-06-14 15:34:30,967 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:34:31,934 INFO L124 PetriNetUnfolderBase]: 1798/2935 cut-off events. [2024-06-14 15:34:31,935 INFO L125 PetriNetUnfolderBase]: For 132690/132693 co-relation queries the response was YES. [2024-06-14 15:34:31,951 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20970 conditions, 2935 events. 1798/2935 cut-off events. For 132690/132693 co-relation queries the response was YES. Maximal size of possible extension queue 186. Compared 16731 event pairs, 801 based on Foata normal form. 5/2937 useless extension candidates. Maximal degree in co-relation 20892. Up to 2655 conditions per place. [2024-06-14 15:34:31,963 INFO L140 encePairwiseOnDemand]: 29/41 looper letters, 183 selfloop transitions, 34 changer transitions 0/222 dead transitions. [2024-06-14 15:34:31,964 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 176 places, 222 transitions, 2836 flow [2024-06-14 15:34:31,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 15:34:31,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 15:34:31,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 143 transitions. [2024-06-14 15:34:31,965 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43597560975609756 [2024-06-14 15:34:31,965 INFO L175 Difference]: Start difference. First operand has 169 places, 207 transitions, 2258 flow. Second operand 8 states and 143 transitions. [2024-06-14 15:34:31,965 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 176 places, 222 transitions, 2836 flow [2024-06-14 15:34:32,083 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 171 places, 222 transitions, 2563 flow, removed 76 selfloop flow, removed 5 redundant places. [2024-06-14 15:34:32,086 INFO L231 Difference]: Finished difference. Result has 172 places, 207 transitions, 2061 flow [2024-06-14 15:34:32,086 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=1985, PETRI_DIFFERENCE_MINUEND_PLACES=164, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=207, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=34, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=173, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2061, PETRI_PLACES=172, PETRI_TRANSITIONS=207} [2024-06-14 15:34:32,087 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 130 predicate places. [2024-06-14 15:34:32,087 INFO L495 AbstractCegarLoop]: Abstraction has has 172 places, 207 transitions, 2061 flow [2024-06-14 15:34:32,087 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.777777777777779) internal successors, (106), 9 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:34:32,087 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:34:32,087 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-14 15:34:32,087 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2024-06-14 15:34:32,088 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-14 15:34:32,089 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:34:32,089 INFO L85 PathProgramCache]: Analyzing trace with hash 739028458, now seen corresponding path program 4 times [2024-06-14 15:34:32,089 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:34:32,089 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1101992182] [2024-06-14 15:34:32,090 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:34:32,090 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:34:32,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:34:43,182 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:34:43,182 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:34:43,182 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1101992182] [2024-06-14 15:34:43,182 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1101992182] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:34:43,182 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:34:43,182 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 15:34:43,183 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1545338610] [2024-06-14 15:34:43,183 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:34:43,183 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 15:34:43,183 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:34:43,183 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 15:34:43,183 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-06-14 15:34:43,349 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 41 [2024-06-14 15:34:43,350 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 172 places, 207 transitions, 2061 flow. Second operand has 9 states, 9 states have (on average 11.777777777777779) internal successors, (106), 9 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:34:43,350 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:34:43,350 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 41 [2024-06-14 15:34:43,350 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:34:44,312 INFO L124 PetriNetUnfolderBase]: 1795/2926 cut-off events. [2024-06-14 15:34:44,312 INFO L125 PetriNetUnfolderBase]: For 135184/135184 co-relation queries the response was YES. [2024-06-14 15:34:44,329 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20515 conditions, 2926 events. 1795/2926 cut-off events. For 135184/135184 co-relation queries the response was YES. Maximal size of possible extension queue 183. Compared 16603 event pairs, 809 based on Foata normal form. 1/2925 useless extension candidates. Maximal degree in co-relation 20436. Up to 2721 conditions per place. [2024-06-14 15:34:44,342 INFO L140 encePairwiseOnDemand]: 31/41 looper letters, 192 selfloop transitions, 24 changer transitions 0/221 dead transitions. [2024-06-14 15:34:44,342 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 180 places, 221 transitions, 2611 flow [2024-06-14 15:34:44,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 15:34:44,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 15:34:44,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 146 transitions. [2024-06-14 15:34:44,343 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3956639566395664 [2024-06-14 15:34:44,343 INFO L175 Difference]: Start difference. First operand has 172 places, 207 transitions, 2061 flow. Second operand 9 states and 146 transitions. [2024-06-14 15:34:44,343 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 180 places, 221 transitions, 2611 flow [2024-06-14 15:34:44,468 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 170 places, 221 transitions, 2395 flow, removed 14 selfloop flow, removed 10 redundant places. [2024-06-14 15:34:44,471 INFO L231 Difference]: Finished difference. Result has 171 places, 210 transitions, 2001 flow [2024-06-14 15:34:44,471 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=1845, PETRI_DIFFERENCE_MINUEND_PLACES=162, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=207, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=183, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2001, PETRI_PLACES=171, PETRI_TRANSITIONS=210} [2024-06-14 15:34:44,471 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 129 predicate places. [2024-06-14 15:34:44,472 INFO L495 AbstractCegarLoop]: Abstraction has has 171 places, 210 transitions, 2001 flow [2024-06-14 15:34:44,472 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.777777777777779) internal successors, (106), 9 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:34:44,472 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:34:44,472 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-14 15:34:44,472 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2024-06-14 15:34:44,472 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-14 15:34:44,472 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:34:44,473 INFO L85 PathProgramCache]: Analyzing trace with hash -464693974, now seen corresponding path program 1 times [2024-06-14 15:34:44,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:34:44,473 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1169948743] [2024-06-14 15:34:44,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:34:44,473 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:34:44,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:34:55,810 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:34:55,810 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:34:55,810 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1169948743] [2024-06-14 15:34:55,810 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1169948743] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:34:55,810 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:34:55,810 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 15:34:55,810 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1371755094] [2024-06-14 15:34:55,811 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:34:55,811 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 15:34:55,811 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:34:55,811 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 15:34:55,811 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-06-14 15:34:55,901 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 41 [2024-06-14 15:34:55,901 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 171 places, 210 transitions, 2001 flow. Second operand has 9 states, 9 states have (on average 11.777777777777779) internal successors, (106), 9 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:34:55,901 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:34:55,901 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 41 [2024-06-14 15:34:55,901 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:34:56,897 INFO L124 PetriNetUnfolderBase]: 1805/2942 cut-off events. [2024-06-14 15:34:56,897 INFO L125 PetriNetUnfolderBase]: For 141388/141388 co-relation queries the response was YES. [2024-06-14 15:34:56,912 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20461 conditions, 2942 events. 1805/2942 cut-off events. For 141388/141388 co-relation queries the response was YES. Maximal size of possible extension queue 184. Compared 16690 event pairs, 804 based on Foata normal form. 2/2942 useless extension candidates. Maximal degree in co-relation 20385. Up to 2724 conditions per place. [2024-06-14 15:34:56,922 INFO L140 encePairwiseOnDemand]: 30/41 looper letters, 205 selfloop transitions, 19 changer transitions 0/229 dead transitions. [2024-06-14 15:34:56,923 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 178 places, 229 transitions, 2555 flow [2024-06-14 15:34:56,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 15:34:56,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 15:34:56,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 138 transitions. [2024-06-14 15:34:56,925 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42073170731707316 [2024-06-14 15:34:56,925 INFO L175 Difference]: Start difference. First operand has 171 places, 210 transitions, 2001 flow. Second operand 8 states and 138 transitions. [2024-06-14 15:34:56,925 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 178 places, 229 transitions, 2555 flow [2024-06-14 15:34:57,043 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 171 places, 229 transitions, 2435 flow, removed 40 selfloop flow, removed 7 redundant places. [2024-06-14 15:34:57,046 INFO L231 Difference]: Finished difference. Result has 172 places, 214 transitions, 1992 flow [2024-06-14 15:34:57,046 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=1881, PETRI_DIFFERENCE_MINUEND_PLACES=164, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=210, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=191, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1992, PETRI_PLACES=172, PETRI_TRANSITIONS=214} [2024-06-14 15:34:57,047 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 130 predicate places. [2024-06-14 15:34:57,047 INFO L495 AbstractCegarLoop]: Abstraction has has 172 places, 214 transitions, 1992 flow [2024-06-14 15:34:57,047 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.777777777777779) internal successors, (106), 9 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:34:57,047 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:34:57,047 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-14 15:34:57,047 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2024-06-14 15:34:57,047 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-14 15:34:57,048 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:34:57,048 INFO L85 PathProgramCache]: Analyzing trace with hash 731415850, now seen corresponding path program 2 times [2024-06-14 15:34:57,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:34:57,048 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2125971289] [2024-06-14 15:34:57,048 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:34:57,048 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:34:57,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:35:07,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-14 15:35:07,632 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:35:07,632 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2125971289] [2024-06-14 15:35:07,632 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2125971289] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:35:07,632 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:35:07,632 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 15:35:07,632 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1675541856] [2024-06-14 15:35:07,632 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:35:07,633 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 15:35:07,633 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:35:07,633 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 15:35:07,633 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-14 15:35:07,798 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 41 [2024-06-14 15:35:07,799 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 172 places, 214 transitions, 1992 flow. Second operand has 9 states, 9 states have (on average 11.777777777777779) internal successors, (106), 9 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:35:07,799 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:35:07,799 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 41 [2024-06-14 15:35:07,799 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:35:08,678 INFO L124 PetriNetUnfolderBase]: 1815/2963 cut-off events. [2024-06-14 15:35:08,678 INFO L125 PetriNetUnfolderBase]: For 145671/145674 co-relation queries the response was YES. [2024-06-14 15:35:08,693 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21006 conditions, 2963 events. 1815/2963 cut-off events. For 145671/145674 co-relation queries the response was YES. Maximal size of possible extension queue 187. Compared 16911 event pairs, 804 based on Foata normal form. 3/2963 useless extension candidates. Maximal degree in co-relation 20929. Up to 2734 conditions per place. [2024-06-14 15:35:08,703 INFO L140 encePairwiseOnDemand]: 31/41 looper letters, 207 selfloop transitions, 28 changer transitions 0/240 dead transitions. [2024-06-14 15:35:08,704 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 179 places, 240 transitions, 2645 flow [2024-06-14 15:35:08,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 15:35:08,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 15:35:08,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 136 transitions. [2024-06-14 15:35:08,706 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4146341463414634 [2024-06-14 15:35:08,706 INFO L175 Difference]: Start difference. First operand has 172 places, 214 transitions, 1992 flow. Second operand 8 states and 136 transitions. [2024-06-14 15:35:08,706 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 179 places, 240 transitions, 2645 flow [2024-06-14 15:35:08,836 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 173 places, 240 transitions, 2544 flow, removed 25 selfloop flow, removed 6 redundant places. [2024-06-14 15:35:08,839 INFO L231 Difference]: Finished difference. Result has 176 places, 229 transitions, 2143 flow [2024-06-14 15:35:08,840 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=1898, PETRI_DIFFERENCE_MINUEND_PLACES=166, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=214, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=191, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2143, PETRI_PLACES=176, PETRI_TRANSITIONS=229} [2024-06-14 15:35:08,840 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 134 predicate places. [2024-06-14 15:35:08,840 INFO L495 AbstractCegarLoop]: Abstraction has has 176 places, 229 transitions, 2143 flow [2024-06-14 15:35:08,840 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.777777777777779) internal successors, (106), 9 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:35:08,840 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:35:08,841 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-14 15:35:08,841 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2024-06-14 15:35:08,841 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-14 15:35:08,841 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:35:08,841 INFO L85 PathProgramCache]: Analyzing trace with hash 739034410, now seen corresponding path program 3 times [2024-06-14 15:35:08,841 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:35:08,841 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1843075398] [2024-06-14 15:35:08,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:35:08,842 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:35:08,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:35:19,994 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:35:19,994 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:35:19,994 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1843075398] [2024-06-14 15:35:19,995 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1843075398] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:35:19,995 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:35:19,995 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 15:35:19,995 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1239403830] [2024-06-14 15:35:19,995 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:35:19,995 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 15:35:19,995 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:35:19,996 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 15:35:19,996 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-06-14 15:35:20,107 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 41 [2024-06-14 15:35:20,107 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 176 places, 229 transitions, 2143 flow. Second operand has 9 states, 9 states have (on average 11.777777777777779) internal successors, (106), 9 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:35:20,107 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:35:20,107 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 41 [2024-06-14 15:35:20,107 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:35:21,046 INFO L124 PetriNetUnfolderBase]: 1828/2977 cut-off events. [2024-06-14 15:35:21,047 INFO L125 PetriNetUnfolderBase]: For 152689/152692 co-relation queries the response was YES. [2024-06-14 15:35:21,064 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21576 conditions, 2977 events. 1828/2977 cut-off events. For 152689/152692 co-relation queries the response was YES. Maximal size of possible extension queue 186. Compared 16910 event pairs, 804 based on Foata normal form. 3/2977 useless extension candidates. Maximal degree in co-relation 21496. Up to 2714 conditions per place. [2024-06-14 15:35:21,077 INFO L140 encePairwiseOnDemand]: 30/41 looper letters, 194 selfloop transitions, 50 changer transitions 0/249 dead transitions. [2024-06-14 15:35:21,078 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 183 places, 249 transitions, 2901 flow [2024-06-14 15:35:21,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 15:35:21,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 15:35:21,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 140 transitions. [2024-06-14 15:35:21,080 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4268292682926829 [2024-06-14 15:35:21,080 INFO L175 Difference]: Start difference. First operand has 176 places, 229 transitions, 2143 flow. Second operand 8 states and 140 transitions. [2024-06-14 15:35:21,080 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 183 places, 249 transitions, 2901 flow [2024-06-14 15:35:21,240 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 181 places, 249 transitions, 2812 flow, removed 40 selfloop flow, removed 2 redundant places. [2024-06-14 15:35:21,243 INFO L231 Difference]: Finished difference. Result has 183 places, 236 transitions, 2328 flow [2024-06-14 15:35:21,244 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=2070, PETRI_DIFFERENCE_MINUEND_PLACES=174, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=229, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=46, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=182, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2328, PETRI_PLACES=183, PETRI_TRANSITIONS=236} [2024-06-14 15:35:21,244 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 141 predicate places. [2024-06-14 15:35:21,244 INFO L495 AbstractCegarLoop]: Abstraction has has 183 places, 236 transitions, 2328 flow [2024-06-14 15:35:21,244 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.777777777777779) internal successors, (106), 9 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:35:21,244 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:35:21,244 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-14 15:35:21,245 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2024-06-14 15:35:21,245 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-14 15:35:21,245 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:35:21,245 INFO L85 PathProgramCache]: Analyzing trace with hash 738767500, now seen corresponding path program 4 times [2024-06-14 15:35:21,245 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:35:21,245 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [675279720] [2024-06-14 15:35:21,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:35:21,246 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:35:21,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:35:32,910 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:35:32,910 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:35:32,910 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [675279720] [2024-06-14 15:35:32,910 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [675279720] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:35:32,911 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:35:32,911 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 15:35:32,911 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [634175384] [2024-06-14 15:35:32,911 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:35:32,911 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 15:35:32,911 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:35:32,912 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 15:35:32,912 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-14 15:35:33,013 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 41 [2024-06-14 15:35:33,014 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 183 places, 236 transitions, 2328 flow. Second operand has 9 states, 9 states have (on average 11.777777777777779) internal successors, (106), 9 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:35:33,014 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:35:33,014 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 41 [2024-06-14 15:35:33,014 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:35:34,018 INFO L124 PetriNetUnfolderBase]: 1835/2991 cut-off events. [2024-06-14 15:35:34,019 INFO L125 PetriNetUnfolderBase]: For 160717/160720 co-relation queries the response was YES. [2024-06-14 15:35:34,035 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22197 conditions, 2991 events. 1835/2991 cut-off events. For 160717/160720 co-relation queries the response was YES. Maximal size of possible extension queue 188. Compared 17051 event pairs, 804 based on Foata normal form. 4/2992 useless extension candidates. Maximal degree in co-relation 22114. Up to 2740 conditions per place. [2024-06-14 15:35:34,048 INFO L140 encePairwiseOnDemand]: 30/41 looper letters, 208 selfloop transitions, 41 changer transitions 0/254 dead transitions. [2024-06-14 15:35:34,048 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 190 places, 254 transitions, 2960 flow [2024-06-14 15:35:34,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 15:35:34,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 15:35:34,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 139 transitions. [2024-06-14 15:35:34,051 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42378048780487804 [2024-06-14 15:35:34,051 INFO L175 Difference]: Start difference. First operand has 183 places, 236 transitions, 2328 flow. Second operand 8 states and 139 transitions. [2024-06-14 15:35:34,051 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 190 places, 254 transitions, 2960 flow [2024-06-14 15:35:34,199 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 186 places, 254 transitions, 2847 flow, removed 35 selfloop flow, removed 4 redundant places. [2024-06-14 15:35:34,202 INFO L231 Difference]: Finished difference. Result has 187 places, 242 transitions, 2411 flow [2024-06-14 15:35:34,203 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=2226, PETRI_DIFFERENCE_MINUEND_PLACES=179, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=236, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=35, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=198, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2411, PETRI_PLACES=187, PETRI_TRANSITIONS=242} [2024-06-14 15:35:34,203 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 145 predicate places. [2024-06-14 15:35:34,203 INFO L495 AbstractCegarLoop]: Abstraction has has 187 places, 242 transitions, 2411 flow [2024-06-14 15:35:34,203 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.777777777777779) internal successors, (106), 9 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:35:34,203 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:35:34,204 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-14 15:35:34,204 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2024-06-14 15:35:34,204 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-14 15:35:34,204 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:35:34,204 INFO L85 PathProgramCache]: Analyzing trace with hash 1699819182, now seen corresponding path program 1 times [2024-06-14 15:35:34,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:35:34,204 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1616105229] [2024-06-14 15:35:34,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:35:34,205 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:35:34,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:35:43,955 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:35:43,955 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:35:43,955 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1616105229] [2024-06-14 15:35:43,955 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1616105229] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:35:43,955 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:35:43,955 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 15:35:43,956 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1104546195] [2024-06-14 15:35:43,956 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:35:43,956 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 15:35:43,956 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:35:43,957 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 15:35:43,957 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-06-14 15:35:44,144 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 41 [2024-06-14 15:35:44,145 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 187 places, 242 transitions, 2411 flow. Second operand has 9 states, 9 states have (on average 11.777777777777779) internal successors, (106), 9 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:35:44,145 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:35:44,145 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 41 [2024-06-14 15:35:44,145 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:35:45,219 INFO L124 PetriNetUnfolderBase]: 1900/3101 cut-off events. [2024-06-14 15:35:45,220 INFO L125 PetriNetUnfolderBase]: For 175518/175527 co-relation queries the response was YES. [2024-06-14 15:35:45,237 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22715 conditions, 3101 events. 1900/3101 cut-off events. For 175518/175527 co-relation queries the response was YES. Maximal size of possible extension queue 190. Compared 17585 event pairs, 349 based on Foata normal form. 18/3117 useless extension candidates. Maximal degree in co-relation 22630. Up to 2707 conditions per place. [2024-06-14 15:35:45,248 INFO L140 encePairwiseOnDemand]: 29/41 looper letters, 249 selfloop transitions, 31 changer transitions 0/285 dead transitions. [2024-06-14 15:35:45,248 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 195 places, 285 transitions, 3197 flow [2024-06-14 15:35:45,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 15:35:45,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 15:35:45,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 174 transitions. [2024-06-14 15:35:45,254 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4715447154471545 [2024-06-14 15:35:45,254 INFO L175 Difference]: Start difference. First operand has 187 places, 242 transitions, 2411 flow. Second operand 9 states and 174 transitions. [2024-06-14 15:35:45,255 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 195 places, 285 transitions, 3197 flow [2024-06-14 15:35:45,471 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 190 places, 285 transitions, 3073 flow, removed 25 selfloop flow, removed 5 redundant places. [2024-06-14 15:35:45,474 INFO L231 Difference]: Finished difference. Result has 193 places, 251 transitions, 2487 flow [2024-06-14 15:35:45,474 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=2287, PETRI_DIFFERENCE_MINUEND_PLACES=182, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=242, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=214, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2487, PETRI_PLACES=193, PETRI_TRANSITIONS=251} [2024-06-14 15:35:45,475 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 151 predicate places. [2024-06-14 15:35:45,475 INFO L495 AbstractCegarLoop]: Abstraction has has 193 places, 251 transitions, 2487 flow [2024-06-14 15:35:45,475 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.777777777777779) internal successors, (106), 9 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:35:45,475 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:35:45,475 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-14 15:35:45,475 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2024-06-14 15:35:45,475 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-14 15:35:45,476 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:35:45,476 INFO L85 PathProgramCache]: Analyzing trace with hash -2034178704, now seen corresponding path program 2 times [2024-06-14 15:35:45,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:35:45,476 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1777484117] [2024-06-14 15:35:45,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:35:45,476 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:35:45,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:35:55,280 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:35:55,281 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:35:55,281 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1777484117] [2024-06-14 15:35:55,281 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1777484117] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:35:55,281 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:35:55,281 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 15:35:55,281 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1999887722] [2024-06-14 15:35:55,281 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:35:55,282 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 15:35:55,282 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:35:55,284 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 15:35:55,284 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-06-14 15:35:55,508 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 41 [2024-06-14 15:35:55,509 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 193 places, 251 transitions, 2487 flow. Second operand has 9 states, 9 states have (on average 11.777777777777779) internal successors, (106), 9 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:35:55,509 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:35:55,509 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 41 [2024-06-14 15:35:55,509 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:35:56,717 INFO L124 PetriNetUnfolderBase]: 2112/3448 cut-off events. [2024-06-14 15:35:56,717 INFO L125 PetriNetUnfolderBase]: For 187660/187669 co-relation queries the response was YES. [2024-06-14 15:35:56,737 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25448 conditions, 3448 events. 2112/3448 cut-off events. For 187660/187669 co-relation queries the response was YES. Maximal size of possible extension queue 202. Compared 19823 event pairs, 489 based on Foata normal form. 16/3457 useless extension candidates. Maximal degree in co-relation 25360. Up to 2949 conditions per place. [2024-06-14 15:35:56,750 INFO L140 encePairwiseOnDemand]: 29/41 looper letters, 262 selfloop transitions, 45 changer transitions 0/312 dead transitions. [2024-06-14 15:35:56,750 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 201 places, 312 transitions, 3657 flow [2024-06-14 15:35:56,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 15:35:56,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 15:35:56,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 174 transitions. [2024-06-14 15:35:56,775 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4715447154471545 [2024-06-14 15:35:56,775 INFO L175 Difference]: Start difference. First operand has 193 places, 251 transitions, 2487 flow. Second operand 9 states and 174 transitions. [2024-06-14 15:35:56,775 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 201 places, 312 transitions, 3657 flow [2024-06-14 15:35:56,980 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 197 places, 312 transitions, 3464 flow, removed 71 selfloop flow, removed 4 redundant places. [2024-06-14 15:35:56,984 INFO L231 Difference]: Finished difference. Result has 202 places, 278 transitions, 2874 flow [2024-06-14 15:35:56,984 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=2386, PETRI_DIFFERENCE_MINUEND_PLACES=189, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=251, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=218, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2874, PETRI_PLACES=202, PETRI_TRANSITIONS=278} [2024-06-14 15:35:56,984 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 160 predicate places. [2024-06-14 15:35:56,984 INFO L495 AbstractCegarLoop]: Abstraction has has 202 places, 278 transitions, 2874 flow [2024-06-14 15:35:56,985 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.777777777777779) internal successors, (106), 9 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:35:56,985 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:35:56,985 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-14 15:35:56,985 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51 [2024-06-14 15:35:56,985 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-14 15:35:56,985 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:35:56,986 INFO L85 PathProgramCache]: Analyzing trace with hash -2034565124, now seen corresponding path program 3 times [2024-06-14 15:35:56,986 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:35:56,986 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1026514153] [2024-06-14 15:35:56,986 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:35:56,986 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:35:57,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:36:06,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-14 15:36:06,726 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:36:06,726 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1026514153] [2024-06-14 15:36:06,726 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1026514153] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:36:06,726 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:36:06,726 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 15:36:06,726 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [104350965] [2024-06-14 15:36:06,726 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:36:06,727 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 15:36:06,728 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:36:06,728 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 15:36:06,728 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-06-14 15:36:06,848 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 41 [2024-06-14 15:36:06,853 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 202 places, 278 transitions, 2874 flow. Second operand has 9 states, 9 states have (on average 11.777777777777779) internal successors, (106), 9 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:36:06,854 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:36:06,854 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 41 [2024-06-14 15:36:06,854 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:36:08,010 INFO L124 PetriNetUnfolderBase]: 2268/3707 cut-off events. [2024-06-14 15:36:08,010 INFO L125 PetriNetUnfolderBase]: For 192950/192959 co-relation queries the response was YES. [2024-06-14 15:36:08,037 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27377 conditions, 3707 events. 2268/3707 cut-off events. For 192950/192959 co-relation queries the response was YES. Maximal size of possible extension queue 217. Compared 21544 event pairs, 574 based on Foata normal form. 18/3723 useless extension candidates. Maximal degree in co-relation 27283. Up to 3171 conditions per place. [2024-06-14 15:36:08,052 INFO L140 encePairwiseOnDemand]: 29/41 looper letters, 269 selfloop transitions, 59 changer transitions 0/333 dead transitions. [2024-06-14 15:36:08,053 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 210 places, 333 transitions, 3997 flow [2024-06-14 15:36:08,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 15:36:08,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 15:36:08,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 175 transitions. [2024-06-14 15:36:08,058 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4742547425474255 [2024-06-14 15:36:08,058 INFO L175 Difference]: Start difference. First operand has 202 places, 278 transitions, 2874 flow. Second operand 9 states and 175 transitions. [2024-06-14 15:36:08,058 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 210 places, 333 transitions, 3997 flow [2024-06-14 15:36:08,326 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 206 places, 333 transitions, 3851 flow, removed 48 selfloop flow, removed 4 redundant places. [2024-06-14 15:36:08,329 INFO L231 Difference]: Finished difference. Result has 209 places, 300 transitions, 3249 flow [2024-06-14 15:36:08,330 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=2782, PETRI_DIFFERENCE_MINUEND_PLACES=198, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=278, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=37, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=224, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3249, PETRI_PLACES=209, PETRI_TRANSITIONS=300} [2024-06-14 15:36:08,330 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 167 predicate places. [2024-06-14 15:36:08,330 INFO L495 AbstractCegarLoop]: Abstraction has has 209 places, 300 transitions, 3249 flow [2024-06-14 15:36:08,331 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.777777777777779) internal successors, (106), 9 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:36:08,331 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:36:08,331 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-14 15:36:08,331 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52 [2024-06-14 15:36:08,331 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-14 15:36:08,331 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:36:08,331 INFO L85 PathProgramCache]: Analyzing trace with hash -1888470164, now seen corresponding path program 4 times [2024-06-14 15:36:08,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:36:08,332 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1339068803] [2024-06-14 15:36:08,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:36:08,332 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:36:08,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:36:18,070 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:36:18,071 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:36:18,071 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1339068803] [2024-06-14 15:36:18,071 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1339068803] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:36:18,071 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:36:18,071 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 15:36:18,071 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [89078267] [2024-06-14 15:36:18,071 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:36:18,072 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 15:36:18,072 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:36:18,072 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 15:36:18,072 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-06-14 15:36:18,194 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 41 [2024-06-14 15:36:18,208 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 209 places, 300 transitions, 3249 flow. Second operand has 9 states, 9 states have (on average 11.777777777777779) internal successors, (106), 9 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:36:18,208 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:36:18,208 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 41 [2024-06-14 15:36:18,208 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:36:19,414 INFO L124 PetriNetUnfolderBase]: 2327/3798 cut-off events. [2024-06-14 15:36:19,414 INFO L125 PetriNetUnfolderBase]: For 203207/203214 co-relation queries the response was YES. [2024-06-14 15:36:19,441 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28440 conditions, 3798 events. 2327/3798 cut-off events. For 203207/203214 co-relation queries the response was YES. Maximal size of possible extension queue 222. Compared 22129 event pairs, 631 based on Foata normal form. 18/3814 useless extension candidates. Maximal degree in co-relation 28344. Up to 3346 conditions per place. [2024-06-14 15:36:19,457 INFO L140 encePairwiseOnDemand]: 28/41 looper letters, 280 selfloop transitions, 51 changer transitions 0/336 dead transitions. [2024-06-14 15:36:19,458 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 217 places, 336 transitions, 4164 flow [2024-06-14 15:36:19,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 15:36:19,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 15:36:19,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 173 transitions. [2024-06-14 15:36:19,459 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46883468834688347 [2024-06-14 15:36:19,459 INFO L175 Difference]: Start difference. First operand has 209 places, 300 transitions, 3249 flow. Second operand 9 states and 173 transitions. [2024-06-14 15:36:19,459 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 217 places, 336 transitions, 4164 flow [2024-06-14 15:36:19,791 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 212 places, 336 transitions, 4027 flow, removed 22 selfloop flow, removed 5 redundant places. [2024-06-14 15:36:19,795 INFO L231 Difference]: Finished difference. Result has 214 places, 306 transitions, 3339 flow [2024-06-14 15:36:19,795 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=3112, PETRI_DIFFERENCE_MINUEND_PLACES=204, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=300, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=45, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=249, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3339, PETRI_PLACES=214, PETRI_TRANSITIONS=306} [2024-06-14 15:36:19,796 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 172 predicate places. [2024-06-14 15:36:19,796 INFO L495 AbstractCegarLoop]: Abstraction has has 214 places, 306 transitions, 3339 flow [2024-06-14 15:36:19,796 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.777777777777779) internal successors, (106), 9 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:36:19,796 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:36:19,796 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-14 15:36:19,796 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53 [2024-06-14 15:36:19,796 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-14 15:36:19,797 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:36:19,797 INFO L85 PathProgramCache]: Analyzing trace with hash -2024397682, now seen corresponding path program 1 times [2024-06-14 15:36:19,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:36:19,797 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1483193428] [2024-06-14 15:36:19,797 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:36:19,797 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:36:19,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:36:30,259 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:36:30,259 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:36:30,259 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1483193428] [2024-06-14 15:36:30,259 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1483193428] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:36:30,259 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:36:30,259 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 15:36:30,260 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1249145814] [2024-06-14 15:36:30,260 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:36:30,260 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 15:36:30,260 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:36:30,260 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 15:36:30,261 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-06-14 15:36:30,435 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 41 [2024-06-14 15:36:30,435 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 214 places, 306 transitions, 3339 flow. Second operand has 10 states, 10 states have (on average 11.7) internal successors, (117), 10 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:36:30,435 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:36:30,435 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 41 [2024-06-14 15:36:30,436 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:36:31,763 INFO L124 PetriNetUnfolderBase]: 2357/3844 cut-off events. [2024-06-14 15:36:31,763 INFO L125 PetriNetUnfolderBase]: For 198580/198587 co-relation queries the response was YES. [2024-06-14 15:36:31,788 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28906 conditions, 3844 events. 2357/3844 cut-off events. For 198580/198587 co-relation queries the response was YES. Maximal size of possible extension queue 224. Compared 22446 event pairs, 639 based on Foata normal form. 9/3851 useless extension candidates. Maximal degree in co-relation 28808. Up to 3416 conditions per place. [2024-06-14 15:36:31,803 INFO L140 encePairwiseOnDemand]: 26/41 looper letters, 279 selfloop transitions, 58 changer transitions 0/342 dead transitions. [2024-06-14 15:36:31,803 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 223 places, 342 transitions, 4281 flow [2024-06-14 15:36:31,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 15:36:31,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 15:36:31,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 187 transitions. [2024-06-14 15:36:31,809 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4560975609756098 [2024-06-14 15:36:31,809 INFO L175 Difference]: Start difference. First operand has 214 places, 306 transitions, 3339 flow. Second operand 10 states and 187 transitions. [2024-06-14 15:36:31,809 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 223 places, 342 transitions, 4281 flow [2024-06-14 15:36:32,111 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 217 places, 342 transitions, 4135 flow, removed 27 selfloop flow, removed 6 redundant places. [2024-06-14 15:36:32,115 INFO L231 Difference]: Finished difference. Result has 219 places, 315 transitions, 3492 flow [2024-06-14 15:36:32,115 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=3193, PETRI_DIFFERENCE_MINUEND_PLACES=208, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=306, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=49, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=248, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=3492, PETRI_PLACES=219, PETRI_TRANSITIONS=315} [2024-06-14 15:36:32,115 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 177 predicate places. [2024-06-14 15:36:32,116 INFO L495 AbstractCegarLoop]: Abstraction has has 219 places, 315 transitions, 3492 flow [2024-06-14 15:36:32,116 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.7) internal successors, (117), 10 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:36:32,116 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:36:32,116 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-14 15:36:32,116 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54 [2024-06-14 15:36:32,116 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-14 15:36:32,116 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:36:32,117 INFO L85 PathProgramCache]: Analyzing trace with hash -2025607824, now seen corresponding path program 5 times [2024-06-14 15:36:32,117 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:36:32,117 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [700571607] [2024-06-14 15:36:32,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:36:32,117 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:36:32,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:36:42,376 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:36:42,376 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:36:42,377 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [700571607] [2024-06-14 15:36:42,377 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [700571607] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:36:42,377 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:36:42,377 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 15:36:42,377 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [793734587] [2024-06-14 15:36:42,377 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:36:42,377 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 15:36:42,377 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:36:42,377 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 15:36:42,377 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-06-14 15:36:42,490 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 41 [2024-06-14 15:36:42,491 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 219 places, 315 transitions, 3492 flow. Second operand has 9 states, 9 states have (on average 11.777777777777779) internal successors, (106), 9 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:36:42,491 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:36:42,491 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 41 [2024-06-14 15:36:42,491 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:36:43,801 INFO L124 PetriNetUnfolderBase]: 2475/4026 cut-off events. [2024-06-14 15:36:43,801 INFO L125 PetriNetUnfolderBase]: For 220644/220651 co-relation queries the response was YES. [2024-06-14 15:36:43,832 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30603 conditions, 4026 events. 2475/4026 cut-off events. For 220644/220651 co-relation queries the response was YES. Maximal size of possible extension queue 234. Compared 23652 event pairs, 575 based on Foata normal form. 18/4042 useless extension candidates. Maximal degree in co-relation 30503. Up to 3513 conditions per place. [2024-06-14 15:36:43,848 INFO L140 encePairwiseOnDemand]: 28/41 looper letters, 298 selfloop transitions, 53 changer transitions 0/356 dead transitions. [2024-06-14 15:36:43,849 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 227 places, 356 transitions, 4539 flow [2024-06-14 15:36:43,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 15:36:43,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 15:36:43,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 172 transitions. [2024-06-14 15:36:43,860 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46612466124661245 [2024-06-14 15:36:43,860 INFO L175 Difference]: Start difference. First operand has 219 places, 315 transitions, 3492 flow. Second operand 9 states and 172 transitions. [2024-06-14 15:36:43,860 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 227 places, 356 transitions, 4539 flow [2024-06-14 15:36:44,178 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 220 places, 356 transitions, 4313 flow, removed 57 selfloop flow, removed 7 redundant places. [2024-06-14 15:36:44,182 INFO L231 Difference]: Finished difference. Result has 222 places, 327 transitions, 3603 flow [2024-06-14 15:36:44,183 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=3273, PETRI_DIFFERENCE_MINUEND_PLACES=212, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=315, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=41, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=262, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3603, PETRI_PLACES=222, PETRI_TRANSITIONS=327} [2024-06-14 15:36:44,183 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 180 predicate places. [2024-06-14 15:36:44,183 INFO L495 AbstractCegarLoop]: Abstraction has has 222 places, 327 transitions, 3603 flow [2024-06-14 15:36:44,187 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.777777777777779) internal successors, (106), 9 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:36:44,187 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:36:44,187 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-14 15:36:44,187 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55 [2024-06-14 15:36:44,187 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-14 15:36:44,188 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:36:44,188 INFO L85 PathProgramCache]: Analyzing trace with hash -1738720494, now seen corresponding path program 6 times [2024-06-14 15:36:44,188 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:36:44,192 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [184403563] [2024-06-14 15:36:44,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:36:44,192 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:36:44,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:36:55,215 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:36:55,215 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:36:55,215 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [184403563] [2024-06-14 15:36:55,216 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [184403563] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:36:55,216 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:36:55,216 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 15:36:55,216 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [843047244] [2024-06-14 15:36:55,216 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:36:55,216 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 15:36:55,220 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:36:55,221 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 15:36:55,221 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-14 15:36:55,362 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 41 [2024-06-14 15:36:55,363 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 222 places, 327 transitions, 3603 flow. Second operand has 9 states, 9 states have (on average 11.777777777777779) internal successors, (106), 9 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:36:55,363 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:36:55,363 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 41 [2024-06-14 15:36:55,363 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:36:56,618 INFO L124 PetriNetUnfolderBase]: 2589/4223 cut-off events. [2024-06-14 15:36:56,618 INFO L125 PetriNetUnfolderBase]: For 231519/231522 co-relation queries the response was YES. [2024-06-14 15:36:56,650 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31955 conditions, 4223 events. 2589/4223 cut-off events. For 231519/231522 co-relation queries the response was YES. Maximal size of possible extension queue 249. Compared 25082 event pairs, 569 based on Foata normal form. 14/4235 useless extension candidates. Maximal degree in co-relation 31853. Up to 3660 conditions per place. [2024-06-14 15:36:56,668 INFO L140 encePairwiseOnDemand]: 28/41 looper letters, 305 selfloop transitions, 64 changer transitions 0/374 dead transitions. [2024-06-14 15:36:56,668 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 230 places, 374 transitions, 4732 flow [2024-06-14 15:36:56,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 15:36:56,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 15:36:56,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 170 transitions. [2024-06-14 15:36:56,669 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46070460704607047 [2024-06-14 15:36:56,669 INFO L175 Difference]: Start difference. First operand has 222 places, 327 transitions, 3603 flow. Second operand 9 states and 170 transitions. [2024-06-14 15:36:56,669 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 230 places, 374 transitions, 4732 flow [2024-06-14 15:36:57,118 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 224 places, 374 transitions, 4590 flow, removed 27 selfloop flow, removed 6 redundant places. [2024-06-14 15:36:57,123 INFO L231 Difference]: Finished difference. Result has 227 places, 346 transitions, 3888 flow [2024-06-14 15:36:57,123 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=3461, PETRI_DIFFERENCE_MINUEND_PLACES=216, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=327, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=45, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=263, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3888, PETRI_PLACES=227, PETRI_TRANSITIONS=346} [2024-06-14 15:36:57,123 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 185 predicate places. [2024-06-14 15:36:57,123 INFO L495 AbstractCegarLoop]: Abstraction has has 227 places, 346 transitions, 3888 flow [2024-06-14 15:36:57,124 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.777777777777779) internal successors, (106), 9 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:36:57,124 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:36:57,124 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-14 15:36:57,124 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable56 [2024-06-14 15:36:57,124 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-14 15:36:57,125 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:36:57,125 INFO L85 PathProgramCache]: Analyzing trace with hash 2020688750, now seen corresponding path program 1 times [2024-06-14 15:36:57,125 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:36:57,125 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [280997116] [2024-06-14 15:36:57,125 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:36:57,126 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:36:57,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:37:08,624 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:37:08,624 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:37:08,624 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [280997116] [2024-06-14 15:37:08,625 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [280997116] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:37:08,625 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:37:08,625 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 15:37:08,625 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2100710542] [2024-06-14 15:37:08,625 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:37:08,625 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 15:37:08,625 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:37:08,626 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 15:37:08,626 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2024-06-14 15:37:08,727 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 41 [2024-06-14 15:37:08,728 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 227 places, 346 transitions, 3888 flow. Second operand has 10 states, 10 states have (on average 11.6) internal successors, (116), 10 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:37:08,728 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:37:08,728 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 41 [2024-06-14 15:37:08,728 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:37:10,027 INFO L124 PetriNetUnfolderBase]: 2667/4333 cut-off events. [2024-06-14 15:37:10,028 INFO L125 PetriNetUnfolderBase]: For 223389/223392 co-relation queries the response was YES. [2024-06-14 15:37:10,065 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33033 conditions, 4333 events. 2667/4333 cut-off events. For 223389/223392 co-relation queries the response was YES. Maximal size of possible extension queue 261. Compared 25730 event pairs, 591 based on Foata normal form. 4/4335 useless extension candidates. Maximal degree in co-relation 32928. Up to 3833 conditions per place. [2024-06-14 15:37:10,087 INFO L140 encePairwiseOnDemand]: 28/41 looper letters, 334 selfloop transitions, 55 changer transitions 0/394 dead transitions. [2024-06-14 15:37:10,087 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 235 places, 394 transitions, 5071 flow [2024-06-14 15:37:10,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 15:37:10,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 15:37:10,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 171 transitions. [2024-06-14 15:37:10,090 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4634146341463415 [2024-06-14 15:37:10,090 INFO L175 Difference]: Start difference. First operand has 227 places, 346 transitions, 3888 flow. Second operand 9 states and 171 transitions. [2024-06-14 15:37:10,090 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 235 places, 394 transitions, 5071 flow [2024-06-14 15:37:10,474 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 230 places, 394 transitions, 4917 flow, removed 31 selfloop flow, removed 5 redundant places. [2024-06-14 15:37:10,479 INFO L231 Difference]: Finished difference. Result has 234 places, 367 transitions, 4223 flow [2024-06-14 15:37:10,479 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=3739, PETRI_DIFFERENCE_MINUEND_PLACES=222, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=346, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=37, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=296, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=4223, PETRI_PLACES=234, PETRI_TRANSITIONS=367} [2024-06-14 15:37:10,479 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 192 predicate places. [2024-06-14 15:37:10,480 INFO L495 AbstractCegarLoop]: Abstraction has has 234 places, 367 transitions, 4223 flow [2024-06-14 15:37:10,480 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.6) internal successors, (116), 10 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:37:10,480 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:37:10,480 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-14 15:37:10,480 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable57 [2024-06-14 15:37:10,480 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-14 15:37:10,480 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:37:10,481 INFO L85 PathProgramCache]: Analyzing trace with hash -2052589686, now seen corresponding path program 1 times [2024-06-14 15:37:10,481 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:37:10,481 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1348500193] [2024-06-14 15:37:10,481 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:37:10,481 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:37:10,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:37:20,982 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:37:20,982 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:37:20,982 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1348500193] [2024-06-14 15:37:20,982 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1348500193] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:37:20,982 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:37:20,983 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 15:37:20,983 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2141117299] [2024-06-14 15:37:20,983 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:37:20,983 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 15:37:20,983 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:37:20,983 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 15:37:20,984 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-06-14 15:37:21,200 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 41 [2024-06-14 15:37:21,201 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 234 places, 367 transitions, 4223 flow. Second operand has 9 states, 9 states have (on average 11.777777777777779) internal successors, (106), 9 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:37:21,201 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:37:21,201 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 41 [2024-06-14 15:37:21,201 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:37:22,604 INFO L124 PetriNetUnfolderBase]: 2707/4404 cut-off events. [2024-06-14 15:37:22,605 INFO L125 PetriNetUnfolderBase]: For 234591/234594 co-relation queries the response was YES. [2024-06-14 15:37:22,634 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33983 conditions, 4404 events. 2707/4404 cut-off events. For 234591/234594 co-relation queries the response was YES. Maximal size of possible extension queue 269. Compared 26249 event pairs, 571 based on Foata normal form. 6/4408 useless extension candidates. Maximal degree in co-relation 33874. Up to 3926 conditions per place. [2024-06-14 15:37:22,649 INFO L140 encePairwiseOnDemand]: 27/41 looper letters, 342 selfloop transitions, 52 changer transitions 0/399 dead transitions. [2024-06-14 15:37:22,650 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 242 places, 399 transitions, 5242 flow [2024-06-14 15:37:22,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 15:37:22,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 15:37:22,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 169 transitions. [2024-06-14 15:37:22,653 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45799457994579945 [2024-06-14 15:37:22,653 INFO L175 Difference]: Start difference. First operand has 234 places, 367 transitions, 4223 flow. Second operand 9 states and 169 transitions. [2024-06-14 15:37:22,653 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 242 places, 399 transitions, 5242 flow [2024-06-14 15:37:23,016 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 239 places, 399 transitions, 5129 flow, removed 44 selfloop flow, removed 3 redundant places. [2024-06-14 15:37:23,021 INFO L231 Difference]: Finished difference. Result has 241 places, 375 transitions, 4361 flow [2024-06-14 15:37:23,021 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=4110, PETRI_DIFFERENCE_MINUEND_PLACES=231, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=367, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=44, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=315, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=4361, PETRI_PLACES=241, PETRI_TRANSITIONS=375} [2024-06-14 15:37:23,021 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 199 predicate places. [2024-06-14 15:37:23,022 INFO L495 AbstractCegarLoop]: Abstraction has has 241 places, 375 transitions, 4361 flow [2024-06-14 15:37:23,022 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.777777777777779) internal successors, (106), 9 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:37:23,022 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:37:23,022 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-14 15:37:23,022 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable58 [2024-06-14 15:37:23,022 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-14 15:37:23,022 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:37:23,023 INFO L85 PathProgramCache]: Analyzing trace with hash -1878788892, now seen corresponding path program 2 times [2024-06-14 15:37:23,023 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:37:23,023 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1912550779] [2024-06-14 15:37:23,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:37:23,024 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:37:23,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:37:32,934 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:37:32,934 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:37:32,934 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1912550779] [2024-06-14 15:37:32,934 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1912550779] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:37:32,934 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:37:32,935 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 15:37:32,935 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1602554108] [2024-06-14 15:37:32,935 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:37:32,935 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 15:37:32,935 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:37:32,935 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 15:37:32,936 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-06-14 15:37:33,026 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 41 [2024-06-14 15:37:33,027 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 241 places, 375 transitions, 4361 flow. Second operand has 9 states, 9 states have (on average 11.777777777777779) internal successors, (106), 9 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:37:33,027 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:37:33,027 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 41 [2024-06-14 15:37:33,027 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:37:34,465 INFO L124 PetriNetUnfolderBase]: 2813/4575 cut-off events. [2024-06-14 15:37:34,466 INFO L125 PetriNetUnfolderBase]: For 252297/252300 co-relation queries the response was YES. [2024-06-14 15:37:34,498 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35628 conditions, 4575 events. 2813/4575 cut-off events. For 252297/252300 co-relation queries the response was YES. Maximal size of possible extension queue 279. Compared 27431 event pairs, 577 based on Foata normal form. 6/4579 useless extension candidates. Maximal degree in co-relation 35516. Up to 3869 conditions per place. [2024-06-14 15:37:34,517 INFO L140 encePairwiseOnDemand]: 27/41 looper letters, 326 selfloop transitions, 91 changer transitions 0/422 dead transitions. [2024-06-14 15:37:34,517 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 249 places, 422 transitions, 5713 flow [2024-06-14 15:37:34,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 15:37:34,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 15:37:34,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 170 transitions. [2024-06-14 15:37:34,518 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46070460704607047 [2024-06-14 15:37:34,518 INFO L175 Difference]: Start difference. First operand has 241 places, 375 transitions, 4361 flow. Second operand 9 states and 170 transitions. [2024-06-14 15:37:34,519 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 249 places, 422 transitions, 5713 flow [2024-06-14 15:37:34,915 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 244 places, 422 transitions, 5591 flow, removed 26 selfloop flow, removed 5 redundant places. [2024-06-14 15:37:34,920 INFO L231 Difference]: Finished difference. Result has 246 places, 396 transitions, 4739 flow [2024-06-14 15:37:34,920 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=4239, PETRI_DIFFERENCE_MINUEND_PLACES=236, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=375, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=73, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=287, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=4739, PETRI_PLACES=246, PETRI_TRANSITIONS=396} [2024-06-14 15:37:34,922 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 204 predicate places. [2024-06-14 15:37:34,922 INFO L495 AbstractCegarLoop]: Abstraction has has 246 places, 396 transitions, 4739 flow [2024-06-14 15:37:34,922 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.777777777777779) internal successors, (106), 9 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:37:34,922 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:37:34,922 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-14 15:37:34,923 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable59 [2024-06-14 15:37:34,923 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-14 15:37:34,923 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:37:34,923 INFO L85 PathProgramCache]: Analyzing trace with hash -1875458166, now seen corresponding path program 3 times [2024-06-14 15:37:34,923 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:37:34,923 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1635847461] [2024-06-14 15:37:34,923 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:37:34,924 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:37:34,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:37:45,240 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:37:45,240 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:37:45,240 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1635847461] [2024-06-14 15:37:45,240 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1635847461] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:37:45,241 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:37:45,241 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 15:37:45,241 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1803476706] [2024-06-14 15:37:45,241 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:37:45,241 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 15:37:45,241 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:37:45,241 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 15:37:45,241 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-06-14 15:37:45,419 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 41 [2024-06-14 15:37:45,419 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 246 places, 396 transitions, 4739 flow. Second operand has 9 states, 9 states have (on average 11.777777777777779) internal successors, (106), 9 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:37:45,419 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:37:45,419 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 41 [2024-06-14 15:37:45,419 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:37:46,864 INFO L124 PetriNetUnfolderBase]: 2833/4613 cut-off events. [2024-06-14 15:37:46,865 INFO L125 PetriNetUnfolderBase]: For 262803/262806 co-relation queries the response was YES. [2024-06-14 15:37:46,899 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36380 conditions, 4613 events. 2833/4613 cut-off events. For 262803/262806 co-relation queries the response was YES. Maximal size of possible extension queue 280. Compared 27758 event pairs, 596 based on Foata normal form. 6/4617 useless extension candidates. Maximal degree in co-relation 36266. Up to 3885 conditions per place. [2024-06-14 15:37:46,919 INFO L140 encePairwiseOnDemand]: 27/41 looper letters, 328 selfloop transitions, 93 changer transitions 0/426 dead transitions. [2024-06-14 15:37:46,919 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 254 places, 426 transitions, 5962 flow [2024-06-14 15:37:46,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 15:37:46,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 15:37:46,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 171 transitions. [2024-06-14 15:37:46,920 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4634146341463415 [2024-06-14 15:37:46,920 INFO L175 Difference]: Start difference. First operand has 246 places, 396 transitions, 4739 flow. Second operand 9 states and 171 transitions. [2024-06-14 15:37:46,921 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 254 places, 426 transitions, 5962 flow [2024-06-14 15:37:47,317 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 249 places, 426 transitions, 5816 flow, removed 34 selfloop flow, removed 5 redundant places. [2024-06-14 15:37:47,322 INFO L231 Difference]: Finished difference. Result has 251 places, 401 transitions, 4945 flow [2024-06-14 15:37:47,322 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=4593, PETRI_DIFFERENCE_MINUEND_PLACES=241, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=396, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=88, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=306, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=4945, PETRI_PLACES=251, PETRI_TRANSITIONS=401} [2024-06-14 15:37:47,323 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 209 predicate places. [2024-06-14 15:37:47,323 INFO L495 AbstractCegarLoop]: Abstraction has has 251 places, 401 transitions, 4945 flow [2024-06-14 15:37:47,323 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.777777777777779) internal successors, (106), 9 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:37:47,324 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:37:47,324 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-14 15:37:47,324 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable60 [2024-06-14 15:37:47,324 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-14 15:37:47,325 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:37:47,325 INFO L85 PathProgramCache]: Analyzing trace with hash -1235793728, now seen corresponding path program 2 times [2024-06-14 15:37:47,325 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:37:47,325 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [45064995] [2024-06-14 15:37:47,325 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:37:47,325 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:37:47,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:37:58,946 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:37:58,946 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:37:58,946 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [45064995] [2024-06-14 15:37:58,946 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [45064995] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:37:58,946 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:37:58,946 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 15:37:58,946 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [769422767] [2024-06-14 15:37:58,947 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:37:58,947 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 15:37:58,947 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:37:58,947 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 15:37:58,947 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-06-14 15:37:59,137 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 41 [2024-06-14 15:37:59,137 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 251 places, 401 transitions, 4945 flow. Second operand has 10 states, 10 states have (on average 11.7) internal successors, (117), 10 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:37:59,137 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:37:59,137 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 41 [2024-06-14 15:37:59,137 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:38:00,643 INFO L124 PetriNetUnfolderBase]: 2878/4661 cut-off events. [2024-06-14 15:38:00,643 INFO L125 PetriNetUnfolderBase]: For 268493/268500 co-relation queries the response was YES. [2024-06-14 15:38:00,679 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37368 conditions, 4661 events. 2878/4661 cut-off events. For 268493/268500 co-relation queries the response was YES. Maximal size of possible extension queue 283. Compared 27946 event pairs, 616 based on Foata normal form. 9/4668 useless extension candidates. Maximal degree in co-relation 37251. Up to 4135 conditions per place. [2024-06-14 15:38:00,697 INFO L140 encePairwiseOnDemand]: 26/41 looper letters, 364 selfloop transitions, 71 changer transitions 0/440 dead transitions. [2024-06-14 15:38:00,697 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 260 places, 440 transitions, 6150 flow [2024-06-14 15:38:00,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 15:38:00,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 15:38:00,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 186 transitions. [2024-06-14 15:38:00,698 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45365853658536587 [2024-06-14 15:38:00,699 INFO L175 Difference]: Start difference. First operand has 251 places, 401 transitions, 4945 flow. Second operand 10 states and 186 transitions. [2024-06-14 15:38:00,699 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 260 places, 440 transitions, 6150 flow [2024-06-14 15:38:01,141 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 255 places, 440 transitions, 5974 flow, removed 31 selfloop flow, removed 5 redundant places. [2024-06-14 15:38:01,147 INFO L231 Difference]: Finished difference. Result has 257 places, 415 transitions, 5188 flow [2024-06-14 15:38:01,147 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=4772, PETRI_DIFFERENCE_MINUEND_PLACES=246, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=401, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=57, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=330, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=5188, PETRI_PLACES=257, PETRI_TRANSITIONS=415} [2024-06-14 15:38:01,147 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 215 predicate places. [2024-06-14 15:38:01,148 INFO L495 AbstractCegarLoop]: Abstraction has has 257 places, 415 transitions, 5188 flow [2024-06-14 15:38:01,148 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.7) internal successors, (117), 10 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:38:01,148 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:38:01,148 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-14 15:38:01,148 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable61 [2024-06-14 15:38:01,148 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-14 15:38:01,148 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:38:01,149 INFO L85 PathProgramCache]: Analyzing trace with hash -1875224612, now seen corresponding path program 3 times [2024-06-14 15:38:01,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:38:01,149 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1816054804] [2024-06-14 15:38:01,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:38:01,149 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:38:01,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:38:11,667 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:38:11,668 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:38:11,668 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1816054804] [2024-06-14 15:38:11,668 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1816054804] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:38:11,668 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:38:11,668 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 15:38:11,668 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [475831067] [2024-06-14 15:38:11,669 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:38:11,669 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 15:38:11,669 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:38:11,669 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 15:38:11,669 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-06-14 15:38:11,864 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 41 [2024-06-14 15:38:11,864 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 257 places, 415 transitions, 5188 flow. Second operand has 10 states, 10 states have (on average 11.7) internal successors, (117), 10 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:38:11,864 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:38:11,864 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 41 [2024-06-14 15:38:11,865 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:38:13,299 INFO L124 PetriNetUnfolderBase]: 2890/4697 cut-off events. [2024-06-14 15:38:13,299 INFO L125 PetriNetUnfolderBase]: For 279256/279259 co-relation queries the response was YES. [2024-06-14 15:38:13,337 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38232 conditions, 4697 events. 2890/4697 cut-off events. For 279256/279259 co-relation queries the response was YES. Maximal size of possible extension queue 284. Compared 28298 event pairs, 575 based on Foata normal form. 4/4699 useless extension candidates. Maximal degree in co-relation 38113. Up to 4067 conditions per place. [2024-06-14 15:38:13,359 INFO L140 encePairwiseOnDemand]: 27/41 looper letters, 393 selfloop transitions, 87 changer transitions 0/485 dead transitions. [2024-06-14 15:38:13,359 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 266 places, 485 transitions, 7178 flow [2024-06-14 15:38:13,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 15:38:13,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 15:38:13,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 182 transitions. [2024-06-14 15:38:13,361 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44390243902439025 [2024-06-14 15:38:13,361 INFO L175 Difference]: Start difference. First operand has 257 places, 415 transitions, 5188 flow. Second operand 10 states and 182 transitions. [2024-06-14 15:38:13,361 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 266 places, 485 transitions, 7178 flow [2024-06-14 15:38:13,873 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 260 places, 485 transitions, 6940 flow, removed 61 selfloop flow, removed 6 redundant places. [2024-06-14 15:38:13,879 INFO L231 Difference]: Finished difference. Result has 264 places, 460 transitions, 6067 flow [2024-06-14 15:38:13,879 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=4958, PETRI_DIFFERENCE_MINUEND_PLACES=251, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=415, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=43, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=331, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=6067, PETRI_PLACES=264, PETRI_TRANSITIONS=460} [2024-06-14 15:38:13,880 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 222 predicate places. [2024-06-14 15:38:13,880 INFO L495 AbstractCegarLoop]: Abstraction has has 264 places, 460 transitions, 6067 flow [2024-06-14 15:38:13,880 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.7) internal successors, (117), 10 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:38:13,880 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:38:13,880 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-14 15:38:13,880 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable62 [2024-06-14 15:38:13,881 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-14 15:38:13,881 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:38:13,881 INFO L85 PathProgramCache]: Analyzing trace with hash -1875212522, now seen corresponding path program 4 times [2024-06-14 15:38:13,881 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:38:13,881 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1473693952] [2024-06-14 15:38:13,881 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:38:13,881 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:38:13,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:38:25,613 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:38:25,614 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:38:25,614 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1473693952] [2024-06-14 15:38:25,614 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1473693952] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:38:25,614 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:38:25,614 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 15:38:25,614 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [133005179] [2024-06-14 15:38:25,614 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:38:25,614 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 15:38:25,614 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:38:25,614 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 15:38:25,615 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-06-14 15:38:25,798 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 41 [2024-06-14 15:38:25,798 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 264 places, 460 transitions, 6067 flow. Second operand has 10 states, 10 states have (on average 11.7) internal successors, (117), 10 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:38:25,798 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:38:25,798 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 41 [2024-06-14 15:38:25,798 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:38:27,406 INFO L124 PetriNetUnfolderBase]: 2954/4792 cut-off events. [2024-06-14 15:38:27,407 INFO L125 PetriNetUnfolderBase]: For 302700/302703 co-relation queries the response was YES. [2024-06-14 15:38:27,448 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40411 conditions, 4792 events. 2954/4792 cut-off events. For 302700/302703 co-relation queries the response was YES. Maximal size of possible extension queue 288. Compared 28915 event pairs, 575 based on Foata normal form. 5/4795 useless extension candidates. Maximal degree in co-relation 40288. Up to 3929 conditions per place. [2024-06-14 15:38:27,471 INFO L140 encePairwiseOnDemand]: 26/41 looper letters, 331 selfloop transitions, 162 changer transitions 0/498 dead transitions. [2024-06-14 15:38:27,472 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 274 places, 498 transitions, 7780 flow [2024-06-14 15:38:27,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-14 15:38:27,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-14 15:38:27,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 204 transitions. [2024-06-14 15:38:27,473 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4523281596452328 [2024-06-14 15:38:27,473 INFO L175 Difference]: Start difference. First operand has 264 places, 460 transitions, 6067 flow. Second operand 11 states and 204 transitions. [2024-06-14 15:38:27,473 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 274 places, 498 transitions, 7780 flow [2024-06-14 15:38:28,127 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 269 places, 498 transitions, 7536 flow, removed 85 selfloop flow, removed 5 redundant places. [2024-06-14 15:38:28,134 INFO L231 Difference]: Finished difference. Result has 272 places, 473 transitions, 6625 flow [2024-06-14 15:38:28,149 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=5827, PETRI_DIFFERENCE_MINUEND_PLACES=259, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=460, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=153, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=302, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=6625, PETRI_PLACES=272, PETRI_TRANSITIONS=473} [2024-06-14 15:38:28,150 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 230 predicate places. [2024-06-14 15:38:28,150 INFO L495 AbstractCegarLoop]: Abstraction has has 272 places, 473 transitions, 6625 flow [2024-06-14 15:38:28,150 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.7) internal successors, (117), 10 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:38:28,150 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:38:28,151 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-14 15:38:28,151 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable63 [2024-06-14 15:38:28,151 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-14 15:38:28,151 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:38:28,151 INFO L85 PathProgramCache]: Analyzing trace with hash -1875570572, now seen corresponding path program 5 times [2024-06-14 15:38:28,151 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:38:28,151 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [918554705] [2024-06-14 15:38:28,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:38:28,152 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:38:28,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:38:39,896 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:38:39,896 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:38:39,896 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [918554705] [2024-06-14 15:38:39,897 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [918554705] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:38:39,897 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:38:39,897 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 15:38:39,899 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [370778911] [2024-06-14 15:38:39,899 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:38:39,899 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 15:38:39,899 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:38:39,900 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 15:38:39,900 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-06-14 15:38:40,086 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 41 [2024-06-14 15:38:40,087 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 272 places, 473 transitions, 6625 flow. Second operand has 10 states, 10 states have (on average 11.7) internal successors, (117), 10 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:38:40,087 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:38:40,087 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 41 [2024-06-14 15:38:40,087 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:38:41,617 INFO L124 PetriNetUnfolderBase]: 2961/4802 cut-off events. [2024-06-14 15:38:41,617 INFO L125 PetriNetUnfolderBase]: For 313360/313363 co-relation queries the response was YES. [2024-06-14 15:38:41,662 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41254 conditions, 4802 events. 2961/4802 cut-off events. For 313360/313363 co-relation queries the response was YES. Maximal size of possible extension queue 288. Compared 28946 event pairs, 577 based on Foata normal form. 5/4805 useless extension candidates. Maximal degree in co-relation 41128. Up to 4048 conditions per place. [2024-06-14 15:38:41,686 INFO L140 encePairwiseOnDemand]: 26/41 looper letters, 365 selfloop transitions, 131 changer transitions 0/501 dead transitions. [2024-06-14 15:38:41,686 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 281 places, 501 transitions, 7997 flow [2024-06-14 15:38:41,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 15:38:41,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 15:38:41,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 187 transitions. [2024-06-14 15:38:41,687 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4560975609756098 [2024-06-14 15:38:41,688 INFO L175 Difference]: Start difference. First operand has 272 places, 473 transitions, 6625 flow. Second operand 10 states and 187 transitions. [2024-06-14 15:38:41,688 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 281 places, 501 transitions, 7997 flow [2024-06-14 15:38:42,366 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 276 places, 501 transitions, 7706 flow, removed 99 selfloop flow, removed 5 redundant places. [2024-06-14 15:38:42,373 INFO L231 Difference]: Finished difference. Result has 277 places, 478 transitions, 6787 flow [2024-06-14 15:38:42,373 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=6358, PETRI_DIFFERENCE_MINUEND_PLACES=267, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=473, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=126, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=342, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=6787, PETRI_PLACES=277, PETRI_TRANSITIONS=478} [2024-06-14 15:38:42,374 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 235 predicate places. [2024-06-14 15:38:42,374 INFO L495 AbstractCegarLoop]: Abstraction has has 277 places, 478 transitions, 6787 flow [2024-06-14 15:38:42,374 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.7) internal successors, (117), 10 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:38:42,374 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:38:42,374 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-14 15:38:42,374 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable64 [2024-06-14 15:38:42,374 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-14 15:38:42,375 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:38:42,375 INFO L85 PathProgramCache]: Analyzing trace with hash -1738351098, now seen corresponding path program 1 times [2024-06-14 15:38:42,375 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:38:42,375 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [969417837] [2024-06-14 15:38:42,375 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:38:42,375 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:38:42,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:38:53,295 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:38:53,295 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:38:53,295 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [969417837] [2024-06-14 15:38:53,295 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [969417837] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:38:53,295 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:38:53,295 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 15:38:53,295 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1022333455] [2024-06-14 15:38:53,295 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:38:53,296 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 15:38:53,296 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:38:53,296 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 15:38:53,296 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-14 15:38:53,469 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 41 [2024-06-14 15:38:53,469 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 277 places, 478 transitions, 6787 flow. Second operand has 10 states, 10 states have (on average 11.7) internal successors, (117), 10 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:38:53,469 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:38:53,469 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 41 [2024-06-14 15:38:53,470 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:38:55,066 INFO L124 PetriNetUnfolderBase]: 2969/4821 cut-off events. [2024-06-14 15:38:55,066 INFO L125 PetriNetUnfolderBase]: For 319072/319076 co-relation queries the response was YES. [2024-06-14 15:38:55,107 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41547 conditions, 4821 events. 2969/4821 cut-off events. For 319072/319076 co-relation queries the response was YES. Maximal size of possible extension queue 292. Compared 29229 event pairs, 841 based on Foata normal form. 6/4826 useless extension candidates. Maximal degree in co-relation 41419. Up to 4440 conditions per place. [2024-06-14 15:38:55,128 INFO L140 encePairwiseOnDemand]: 29/41 looper letters, 473 selfloop transitions, 25 changer transitions 0/503 dead transitions. [2024-06-14 15:38:55,129 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 286 places, 503 transitions, 7978 flow [2024-06-14 15:38:55,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 15:38:55,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 15:38:55,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 170 transitions. [2024-06-14 15:38:55,131 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4146341463414634 [2024-06-14 15:38:55,131 INFO L175 Difference]: Start difference. First operand has 277 places, 478 transitions, 6787 flow. Second operand 10 states and 170 transitions. [2024-06-14 15:38:55,131 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 286 places, 503 transitions, 7978 flow [2024-06-14 15:38:55,729 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 280 places, 503 transitions, 7682 flow, removed 63 selfloop flow, removed 6 redundant places. [2024-06-14 15:38:55,736 INFO L231 Difference]: Finished difference. Result has 283 places, 482 transitions, 6694 flow [2024-06-14 15:38:55,736 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=6493, PETRI_DIFFERENCE_MINUEND_PLACES=271, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=478, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=453, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=6694, PETRI_PLACES=283, PETRI_TRANSITIONS=482} [2024-06-14 15:38:55,737 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 241 predicate places. [2024-06-14 15:38:55,737 INFO L495 AbstractCegarLoop]: Abstraction has has 283 places, 482 transitions, 6694 flow [2024-06-14 15:38:55,737 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.7) internal successors, (117), 10 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:38:55,737 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:38:55,737 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-14 15:38:55,737 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable65 [2024-06-14 15:38:55,737 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-14 15:38:55,737 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:38:55,738 INFO L85 PathProgramCache]: Analyzing trace with hash 1480197940, now seen corresponding path program 7 times [2024-06-14 15:38:55,738 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:38:55,738 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1462855516] [2024-06-14 15:38:55,738 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:38:55,738 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:38:55,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:39:05,785 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:39:05,785 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:39:05,785 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1462855516] [2024-06-14 15:39:05,786 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1462855516] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:39:05,786 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:39:05,786 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 15:39:05,786 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [255405605] [2024-06-14 15:39:05,787 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:39:05,787 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 15:39:05,787 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:39:05,788 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 15:39:05,792 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-06-14 15:39:05,973 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 41 [2024-06-14 15:39:05,973 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 283 places, 482 transitions, 6694 flow. Second operand has 10 states, 10 states have (on average 11.6) internal successors, (116), 10 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:39:05,973 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:39:05,973 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 41 [2024-06-14 15:39:05,973 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:39:07,638 INFO L124 PetriNetUnfolderBase]: 3005/4873 cut-off events. [2024-06-14 15:39:07,638 INFO L125 PetriNetUnfolderBase]: For 346764/346771 co-relation queries the response was YES. [2024-06-14 15:39:07,682 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41834 conditions, 4873 events. 3005/4873 cut-off events. For 346764/346771 co-relation queries the response was YES. Maximal size of possible extension queue 293. Compared 29437 event pairs, 483 based on Foata normal form. 16/4887 useless extension candidates. Maximal degree in co-relation 41703. Up to 3945 conditions per place. [2024-06-14 15:39:07,705 INFO L140 encePairwiseOnDemand]: 31/41 looper letters, 427 selfloop transitions, 80 changer transitions 0/512 dead transitions. [2024-06-14 15:39:07,705 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 290 places, 512 transitions, 7942 flow [2024-06-14 15:39:07,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 15:39:07,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 15:39:07,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 155 transitions. [2024-06-14 15:39:07,707 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4725609756097561 [2024-06-14 15:39:07,707 INFO L175 Difference]: Start difference. First operand has 283 places, 482 transitions, 6694 flow. Second operand 8 states and 155 transitions. [2024-06-14 15:39:07,707 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 290 places, 512 transitions, 7942 flow [2024-06-14 15:39:08,434 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 286 places, 512 transitions, 7791 flow, removed 60 selfloop flow, removed 4 redundant places. [2024-06-14 15:39:08,441 INFO L231 Difference]: Finished difference. Result has 287 places, 484 transitions, 6824 flow [2024-06-14 15:39:08,441 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=6543, PETRI_DIFFERENCE_MINUEND_PLACES=279, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=482, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=78, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=402, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=6824, PETRI_PLACES=287, PETRI_TRANSITIONS=484} [2024-06-14 15:39:08,441 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 245 predicate places. [2024-06-14 15:39:08,442 INFO L495 AbstractCegarLoop]: Abstraction has has 287 places, 484 transitions, 6824 flow [2024-06-14 15:39:08,442 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.6) internal successors, (116), 10 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:39:08,442 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:39:08,442 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-14 15:39:08,442 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable66 [2024-06-14 15:39:08,442 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-14 15:39:08,442 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:39:08,443 INFO L85 PathProgramCache]: Analyzing trace with hash -1030123274, now seen corresponding path program 8 times [2024-06-14 15:39:08,443 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:39:08,443 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1416911720] [2024-06-14 15:39:08,443 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:39:08,443 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:39:08,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:39:19,516 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:39:19,516 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:39:19,516 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1416911720] [2024-06-14 15:39:19,516 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1416911720] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:39:19,517 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:39:19,517 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 15:39:19,517 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [846908357] [2024-06-14 15:39:19,517 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:39:19,517 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 15:39:19,517 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:39:19,517 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 15:39:19,517 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-06-14 15:39:19,621 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 41 [2024-06-14 15:39:19,621 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 287 places, 484 transitions, 6824 flow. Second operand has 10 states, 10 states have (on average 11.6) internal successors, (116), 10 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:39:19,621 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:39:19,621 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 41 [2024-06-14 15:39:19,621 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:39:21,287 INFO L124 PetriNetUnfolderBase]: 3049/4943 cut-off events. [2024-06-14 15:39:21,287 INFO L125 PetriNetUnfolderBase]: For 363905/363912 co-relation queries the response was YES. [2024-06-14 15:39:21,330 INFO L83 FinitePrefix]: Finished finitePrefix Result has 43108 conditions, 4943 events. 3049/4943 cut-off events. For 363905/363912 co-relation queries the response was YES. Maximal size of possible extension queue 296. Compared 29961 event pairs, 673 based on Foata normal form. 18/4959 useless extension candidates. Maximal degree in co-relation 42976. Up to 4217 conditions per place. [2024-06-14 15:39:21,350 INFO L140 encePairwiseOnDemand]: 30/41 looper letters, 432 selfloop transitions, 76 changer transitions 0/513 dead transitions. [2024-06-14 15:39:21,351 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 294 places, 513 transitions, 8109 flow [2024-06-14 15:39:21,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 15:39:21,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 15:39:21,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 154 transitions. [2024-06-14 15:39:21,352 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4695121951219512 [2024-06-14 15:39:21,352 INFO L175 Difference]: Start difference. First operand has 287 places, 484 transitions, 6824 flow. Second operand 8 states and 154 transitions. [2024-06-14 15:39:21,352 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 294 places, 513 transitions, 8109 flow [2024-06-14 15:39:22,119 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 288 places, 513 transitions, 7878 flow, removed 46 selfloop flow, removed 6 redundant places. [2024-06-14 15:39:22,126 INFO L231 Difference]: Finished difference. Result has 289 places, 486 transitions, 6868 flow [2024-06-14 15:39:22,126 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=6605, PETRI_DIFFERENCE_MINUEND_PLACES=281, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=484, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=74, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=408, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=6868, PETRI_PLACES=289, PETRI_TRANSITIONS=486} [2024-06-14 15:39:22,126 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 247 predicate places. [2024-06-14 15:39:22,127 INFO L495 AbstractCegarLoop]: Abstraction has has 289 places, 486 transitions, 6868 flow [2024-06-14 15:39:22,127 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.6) internal successors, (116), 10 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:39:22,127 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:39:22,127 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-14 15:39:22,127 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable67 [2024-06-14 15:39:22,127 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-14 15:39:22,127 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:39:22,128 INFO L85 PathProgramCache]: Analyzing trace with hash -1870140128, now seen corresponding path program 6 times [2024-06-14 15:39:22,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:39:22,128 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1386104356] [2024-06-14 15:39:22,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:39:22,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:39:22,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:39:33,439 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:39:33,440 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:39:33,440 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1386104356] [2024-06-14 15:39:33,440 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1386104356] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:39:33,440 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:39:33,440 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 15:39:33,440 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [872433546] [2024-06-14 15:39:33,440 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:39:33,440 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 15:39:33,440 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:39:33,440 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 15:39:33,441 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-06-14 15:39:33,644 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 41 [2024-06-14 15:39:33,644 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 289 places, 486 transitions, 6868 flow. Second operand has 11 states, 11 states have (on average 11.545454545454545) internal successors, (127), 11 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:39:33,644 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:39:33,644 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 41 [2024-06-14 15:39:33,644 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:39:35,238 INFO L124 PetriNetUnfolderBase]: 3081/4991 cut-off events. [2024-06-14 15:39:35,239 INFO L125 PetriNetUnfolderBase]: For 331398/331402 co-relation queries the response was YES. [2024-06-14 15:39:35,426 INFO L83 FinitePrefix]: Finished finitePrefix Result has 43052 conditions, 4991 events. 3081/4991 cut-off events. For 331398/331402 co-relation queries the response was YES. Maximal size of possible extension queue 300. Compared 30340 event pairs, 701 based on Foata normal form. 8/4995 useless extension candidates. Maximal degree in co-relation 42919. Up to 4227 conditions per place. [2024-06-14 15:39:35,450 INFO L140 encePairwiseOnDemand]: 28/41 looper letters, 381 selfloop transitions, 137 changer transitions 0/523 dead transitions. [2024-06-14 15:39:35,450 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 297 places, 523 transitions, 8474 flow [2024-06-14 15:39:35,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 15:39:35,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 15:39:35,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 173 transitions. [2024-06-14 15:39:35,466 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46883468834688347 [2024-06-14 15:39:35,466 INFO L175 Difference]: Start difference. First operand has 289 places, 486 transitions, 6868 flow. Second operand 9 states and 173 transitions. [2024-06-14 15:39:35,466 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 297 places, 523 transitions, 8474 flow [2024-06-14 15:39:36,157 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 291 places, 523 transitions, 8261 flow, removed 40 selfloop flow, removed 6 redundant places. [2024-06-14 15:39:36,164 INFO L231 Difference]: Finished difference. Result has 294 places, 497 transitions, 7356 flow [2024-06-14 15:39:36,164 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=6667, PETRI_DIFFERENCE_MINUEND_PLACES=283, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=486, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=128, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=353, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=7356, PETRI_PLACES=294, PETRI_TRANSITIONS=497} [2024-06-14 15:39:36,164 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 252 predicate places. [2024-06-14 15:39:36,165 INFO L495 AbstractCegarLoop]: Abstraction has has 294 places, 497 transitions, 7356 flow [2024-06-14 15:39:36,165 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 11.545454545454545) internal successors, (127), 11 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:39:36,165 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:39:36,165 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-14 15:39:36,165 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable68 [2024-06-14 15:39:36,165 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-14 15:39:36,166 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:39:36,166 INFO L85 PathProgramCache]: Analyzing trace with hash -122993902, now seen corresponding path program 9 times [2024-06-14 15:39:36,166 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:39:36,166 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [427052914] [2024-06-14 15:39:36,166 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:39:36,166 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:39:36,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:39:46,632 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:39:46,632 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:39:46,632 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [427052914] [2024-06-14 15:39:46,633 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [427052914] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:39:46,633 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:39:46,633 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 15:39:46,633 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1989142937] [2024-06-14 15:39:46,633 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:39:46,633 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 15:39:46,633 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:39:46,634 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 15:39:46,634 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-14 15:39:46,789 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 41 [2024-06-14 15:39:46,789 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 294 places, 497 transitions, 7356 flow. Second operand has 10 states, 10 states have (on average 11.6) internal successors, (116), 10 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:39:46,789 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:39:46,789 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 41 [2024-06-14 15:39:46,789 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:39:48,500 INFO L124 PetriNetUnfolderBase]: 3125/5067 cut-off events. [2024-06-14 15:39:48,500 INFO L125 PetriNetUnfolderBase]: For 352870/352873 co-relation queries the response was YES. [2024-06-14 15:39:48,545 INFO L83 FinitePrefix]: Finished finitePrefix Result has 44372 conditions, 5067 events. 3125/5067 cut-off events. For 352870/352873 co-relation queries the response was YES. Maximal size of possible extension queue 301. Compared 30897 event pairs, 585 based on Foata normal form. 14/5079 useless extension candidates. Maximal degree in co-relation 44236. Up to 4298 conditions per place. [2024-06-14 15:39:48,568 INFO L140 encePairwiseOnDemand]: 30/41 looper letters, 413 selfloop transitions, 104 changer transitions 0/522 dead transitions. [2024-06-14 15:39:48,568 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 301 places, 522 transitions, 8657 flow [2024-06-14 15:39:48,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 15:39:48,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 15:39:48,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 150 transitions. [2024-06-14 15:39:48,569 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4573170731707317 [2024-06-14 15:39:48,569 INFO L175 Difference]: Start difference. First operand has 294 places, 497 transitions, 7356 flow. Second operand 8 states and 150 transitions. [2024-06-14 15:39:48,570 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 301 places, 522 transitions, 8657 flow [2024-06-14 15:39:49,412 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 297 places, 522 transitions, 8398 flow, removed 86 selfloop flow, removed 4 redundant places. [2024-06-14 15:39:49,419 INFO L231 Difference]: Finished difference. Result has 298 places, 499 transitions, 7406 flow [2024-06-14 15:39:49,419 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=7097, PETRI_DIFFERENCE_MINUEND_PLACES=290, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=497, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=102, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=393, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=7406, PETRI_PLACES=298, PETRI_TRANSITIONS=499} [2024-06-14 15:39:49,419 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 256 predicate places. [2024-06-14 15:39:49,420 INFO L495 AbstractCegarLoop]: Abstraction has has 298 places, 499 transitions, 7406 flow [2024-06-14 15:39:49,420 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.6) internal successors, (116), 10 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:39:49,420 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:39:49,420 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-14 15:39:49,420 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable69 [2024-06-14 15:39:49,420 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-14 15:39:49,420 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:39:49,421 INFO L85 PathProgramCache]: Analyzing trace with hash -300122260, now seen corresponding path program 2 times [2024-06-14 15:39:49,421 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:39:49,421 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1492841086] [2024-06-14 15:39:49,421 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:39:49,421 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:39:49,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:39:59,180 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:39:59,181 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:39:59,181 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1492841086] [2024-06-14 15:39:59,181 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1492841086] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:39:59,181 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:39:59,181 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 15:39:59,181 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1852385354] [2024-06-14 15:39:59,181 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:39:59,181 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 15:39:59,181 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:39:59,182 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 15:39:59,182 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-06-14 15:39:59,341 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 41 [2024-06-14 15:39:59,341 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 298 places, 499 transitions, 7406 flow. Second operand has 9 states, 9 states have (on average 11.777777777777779) internal successors, (106), 9 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:39:59,341 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:39:59,341 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 41 [2024-06-14 15:39:59,341 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:40:01,064 INFO L124 PetriNetUnfolderBase]: 3135/5063 cut-off events. [2024-06-14 15:40:01,064 INFO L125 PetriNetUnfolderBase]: For 340794/340794 co-relation queries the response was YES. [2024-06-14 15:40:01,111 INFO L83 FinitePrefix]: Finished finitePrefix Result has 44878 conditions, 5063 events. 3135/5063 cut-off events. For 340794/340794 co-relation queries the response was YES. Maximal size of possible extension queue 303. Compared 30653 event pairs, 611 based on Foata normal form. 2/5060 useless extension candidates. Maximal degree in co-relation 44740. Up to 4424 conditions per place. [2024-06-14 15:40:01,134 INFO L140 encePairwiseOnDemand]: 30/41 looper letters, 446 selfloop transitions, 74 changer transitions 0/525 dead transitions. [2024-06-14 15:40:01,134 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 305 places, 525 transitions, 8657 flow [2024-06-14 15:40:01,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 15:40:01,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 15:40:01,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 152 transitions. [2024-06-14 15:40:01,136 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4634146341463415 [2024-06-14 15:40:01,137 INFO L175 Difference]: Start difference. First operand has 298 places, 499 transitions, 7406 flow. Second operand 8 states and 152 transitions. [2024-06-14 15:40:01,137 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 305 places, 525 transitions, 8657 flow [2024-06-14 15:40:01,859 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 299 places, 525 transitions, 8400 flow, removed 29 selfloop flow, removed 6 redundant places. [2024-06-14 15:40:01,866 INFO L231 Difference]: Finished difference. Result has 300 places, 503 transitions, 7438 flow [2024-06-14 15:40:01,866 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=7149, PETRI_DIFFERENCE_MINUEND_PLACES=292, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=499, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=70, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=425, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=7438, PETRI_PLACES=300, PETRI_TRANSITIONS=503} [2024-06-14 15:40:01,866 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 258 predicate places. [2024-06-14 15:40:01,866 INFO L495 AbstractCegarLoop]: Abstraction has has 300 places, 503 transitions, 7438 flow [2024-06-14 15:40:01,867 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.777777777777779) internal successors, (106), 9 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:40:01,867 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:40:01,867 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-14 15:40:01,867 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable70 [2024-06-14 15:40:01,867 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-14 15:40:01,867 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:40:01,867 INFO L85 PathProgramCache]: Analyzing trace with hash -2037328212, now seen corresponding path program 4 times [2024-06-14 15:40:01,868 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:40:01,868 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1692023832] [2024-06-14 15:40:01,868 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:40:01,868 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:40:01,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:40:12,086 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:40:12,087 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:40:12,087 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1692023832] [2024-06-14 15:40:12,087 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1692023832] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:40:12,087 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:40:12,087 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 15:40:12,087 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [443958679] [2024-06-14 15:40:12,087 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:40:12,087 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 15:40:12,087 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:40:12,087 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 15:40:12,087 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-06-14 15:40:12,301 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 41 [2024-06-14 15:40:12,301 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 300 places, 503 transitions, 7438 flow. Second operand has 10 states, 10 states have (on average 11.6) internal successors, (116), 10 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:40:12,301 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:40:12,301 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 41 [2024-06-14 15:40:12,301 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:40:13,971 INFO L124 PetriNetUnfolderBase]: 3159/5102 cut-off events. [2024-06-14 15:40:13,972 INFO L125 PetriNetUnfolderBase]: For 360242/360245 co-relation queries the response was YES. [2024-06-14 15:40:14,023 INFO L83 FinitePrefix]: Finished finitePrefix Result has 45493 conditions, 5102 events. 3159/5102 cut-off events. For 360242/360245 co-relation queries the response was YES. Maximal size of possible extension queue 307. Compared 30912 event pairs, 587 based on Foata normal form. 10/5110 useless extension candidates. Maximal degree in co-relation 45354. Up to 4522 conditions per place. [2024-06-14 15:40:14,049 INFO L140 encePairwiseOnDemand]: 29/41 looper letters, 452 selfloop transitions, 78 changer transitions 0/535 dead transitions. [2024-06-14 15:40:14,049 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 307 places, 535 transitions, 8918 flow [2024-06-14 15:40:14,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 15:40:14,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 15:40:14,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 149 transitions. [2024-06-14 15:40:14,050 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45426829268292684 [2024-06-14 15:40:14,050 INFO L175 Difference]: Start difference. First operand has 300 places, 503 transitions, 7438 flow. Second operand 8 states and 149 transitions. [2024-06-14 15:40:14,051 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 307 places, 535 transitions, 8918 flow [2024-06-14 15:40:14,903 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 300 places, 535 transitions, 8640 flow, removed 52 selfloop flow, removed 7 redundant places. [2024-06-14 15:40:14,911 INFO L231 Difference]: Finished difference. Result has 301 places, 512 transitions, 7642 flow [2024-06-14 15:40:14,911 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=7160, PETRI_DIFFERENCE_MINUEND_PLACES=293, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=503, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=69, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=425, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=7642, PETRI_PLACES=301, PETRI_TRANSITIONS=512} [2024-06-14 15:40:14,911 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 259 predicate places. [2024-06-14 15:40:14,912 INFO L495 AbstractCegarLoop]: Abstraction has has 301 places, 512 transitions, 7642 flow [2024-06-14 15:40:14,912 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.6) internal successors, (116), 10 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:40:14,912 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:40:14,912 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-14 15:40:14,912 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable71 [2024-06-14 15:40:14,912 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-14 15:40:14,912 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:40:14,913 INFO L85 PathProgramCache]: Analyzing trace with hash -122870584, now seen corresponding path program 5 times [2024-06-14 15:40:14,913 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:40:14,913 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1523247717] [2024-06-14 15:40:14,913 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:40:14,913 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:40:14,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:40:25,407 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:40:25,408 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:40:25,408 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1523247717] [2024-06-14 15:40:25,408 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1523247717] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:40:25,408 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:40:25,408 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 15:40:25,408 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1130212895] [2024-06-14 15:40:25,408 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:40:25,408 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 15:40:25,408 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:40:25,408 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 15:40:25,409 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-06-14 15:40:25,524 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 41 [2024-06-14 15:40:25,524 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 301 places, 512 transitions, 7642 flow. Second operand has 10 states, 10 states have (on average 11.6) internal successors, (116), 10 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:40:25,525 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:40:25,525 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 41 [2024-06-14 15:40:25,525 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:40:27,270 INFO L124 PetriNetUnfolderBase]: 3195/5167 cut-off events. [2024-06-14 15:40:27,270 INFO L125 PetriNetUnfolderBase]: For 365894/365897 co-relation queries the response was YES. [2024-06-14 15:40:27,321 INFO L83 FinitePrefix]: Finished finitePrefix Result has 46331 conditions, 5167 events. 3195/5167 cut-off events. For 365894/365897 co-relation queries the response was YES. Maximal size of possible extension queue 313. Compared 31470 event pairs, 599 based on Foata normal form. 6/5171 useless extension candidates. Maximal degree in co-relation 46191. Up to 4218 conditions per place. [2024-06-14 15:40:27,345 INFO L140 encePairwiseOnDemand]: 29/41 looper letters, 372 selfloop transitions, 165 changer transitions 0/542 dead transitions. [2024-06-14 15:40:27,345 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 308 places, 542 transitions, 9329 flow [2024-06-14 15:40:27,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 15:40:27,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 15:40:27,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 152 transitions. [2024-06-14 15:40:27,348 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4634146341463415 [2024-06-14 15:40:27,348 INFO L175 Difference]: Start difference. First operand has 301 places, 512 transitions, 7642 flow. Second operand 8 states and 152 transitions. [2024-06-14 15:40:27,348 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 308 places, 542 transitions, 9329 flow [2024-06-14 15:40:28,194 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 302 places, 542 transitions, 9000 flow, removed 98 selfloop flow, removed 6 redundant places. [2024-06-14 15:40:28,202 INFO L231 Difference]: Finished difference. Result has 303 places, 519 transitions, 7863 flow [2024-06-14 15:40:28,202 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=7331, PETRI_DIFFERENCE_MINUEND_PLACES=295, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=512, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=159, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=353, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=7863, PETRI_PLACES=303, PETRI_TRANSITIONS=519} [2024-06-14 15:40:28,202 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 261 predicate places. [2024-06-14 15:40:28,202 INFO L495 AbstractCegarLoop]: Abstraction has has 303 places, 519 transitions, 7863 flow [2024-06-14 15:40:28,203 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.6) internal successors, (116), 10 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:40:28,203 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:40:28,203 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-14 15:40:28,203 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable72 [2024-06-14 15:40:28,203 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-14 15:40:28,203 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:40:28,203 INFO L85 PathProgramCache]: Analyzing trace with hash -122633434, now seen corresponding path program 6 times [2024-06-14 15:40:28,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:40:28,204 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [809691142] [2024-06-14 15:40:28,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:40:28,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:40:28,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:40:38,525 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:40:38,526 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:40:38,526 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [809691142] [2024-06-14 15:40:38,526 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [809691142] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:40:38,526 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:40:38,526 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 15:40:38,526 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1860833511] [2024-06-14 15:40:38,526 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:40:38,526 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 15:40:38,526 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:40:38,526 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 15:40:38,526 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-06-14 15:40:38,735 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 41 [2024-06-14 15:40:38,736 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 303 places, 519 transitions, 7863 flow. Second operand has 10 states, 10 states have (on average 11.6) internal successors, (116), 10 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:40:38,736 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:40:38,736 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 41 [2024-06-14 15:40:38,736 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:40:40,342 INFO L124 PetriNetUnfolderBase]: 3183/5153 cut-off events. [2024-06-14 15:40:40,342 INFO L125 PetriNetUnfolderBase]: For 357141/357144 co-relation queries the response was YES. [2024-06-14 15:40:40,396 INFO L83 FinitePrefix]: Finished finitePrefix Result has 45865 conditions, 5153 events. 3183/5153 cut-off events. For 357141/357144 co-relation queries the response was YES. Maximal size of possible extension queue 313. Compared 31420 event pairs, 584 based on Foata normal form. 6/5157 useless extension candidates. Maximal degree in co-relation 45724. Up to 4210 conditions per place. [2024-06-14 15:40:40,423 INFO L140 encePairwiseOnDemand]: 29/41 looper letters, 362 selfloop transitions, 172 changer transitions 0/539 dead transitions. [2024-06-14 15:40:40,423 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 310 places, 539 transitions, 9194 flow [2024-06-14 15:40:40,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 15:40:40,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 15:40:40,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 150 transitions. [2024-06-14 15:40:40,424 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4573170731707317 [2024-06-14 15:40:40,424 INFO L175 Difference]: Start difference. First operand has 303 places, 519 transitions, 7863 flow. Second operand 8 states and 150 transitions. [2024-06-14 15:40:40,424 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 310 places, 539 transitions, 9194 flow [2024-06-14 15:40:41,378 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 306 places, 539 transitions, 8910 flow, removed 62 selfloop flow, removed 4 redundant places. [2024-06-14 15:40:41,385 INFO L231 Difference]: Finished difference. Result has 307 places, 519 transitions, 7946 flow [2024-06-14 15:40:41,385 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=7579, PETRI_DIFFERENCE_MINUEND_PLACES=299, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=519, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=172, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=347, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=7946, PETRI_PLACES=307, PETRI_TRANSITIONS=519} [2024-06-14 15:40:41,385 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 265 predicate places. [2024-06-14 15:40:41,385 INFO L495 AbstractCegarLoop]: Abstraction has has 307 places, 519 transitions, 7946 flow [2024-06-14 15:40:41,386 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.6) internal successors, (116), 10 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:40:41,386 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:40:41,386 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-14 15:40:41,386 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable73 [2024-06-14 15:40:41,386 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-14 15:40:41,386 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:40:41,387 INFO L85 PathProgramCache]: Analyzing trace with hash -1019923282, now seen corresponding path program 7 times [2024-06-14 15:40:41,387 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:40:41,387 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1073036282] [2024-06-14 15:40:41,387 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:40:41,387 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:40:41,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat Killed by 15