./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread-wmm/mix052_power.oepc_power.opt_pso.oepc_rmo.oepc.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_power.oepc_power.opt_pso.oepc_rmo.oepc.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_power.oepc_power.opt_pso.oepc_rmo.oepc.i ./goblint.2024-05-21_14-57-05.files/mutex-meet/mix052_power.oepc_power.opt_pso.oepc_rmo.oepc.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:26,162 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-06-14 15:26:26,203 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:26,206 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-06-14 15:26:26,207 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-06-14 15:26:26,225 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-06-14 15:26:26,226 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-06-14 15:26:26,227 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-06-14 15:26:26,227 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-06-14 15:26:26,228 INFO L153 SettingsManager]: * Use memory slicer=true [2024-06-14 15:26:26,228 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-06-14 15:26:26,229 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-06-14 15:26:26,229 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-06-14 15:26:26,231 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-06-14 15:26:26,231 INFO L153 SettingsManager]: * Use SBE=true [2024-06-14 15:26:26,231 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-06-14 15:26:26,232 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-06-14 15:26:26,235 INFO L153 SettingsManager]: * sizeof long=4 [2024-06-14 15:26:26,235 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-06-14 15:26:26,235 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-06-14 15:26:26,235 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-06-14 15:26:26,236 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-06-14 15:26:26,257 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-06-14 15:26:26,258 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-06-14 15:26:26,259 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-06-14 15:26:26,259 INFO L153 SettingsManager]: * sizeof long double=12 [2024-06-14 15:26:26,259 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-06-14 15:26:26,259 INFO L153 SettingsManager]: * Use constant arrays=true [2024-06-14 15:26:26,260 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-06-14 15:26:26,260 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-06-14 15:26:26,261 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-06-14 15:26:26,261 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-06-14 15:26:26,261 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-14 15:26:26,262 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-06-14 15:26:26,262 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-06-14 15:26:26,262 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-06-14 15:26:26,262 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-06-14 15:26:26,262 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-06-14 15:26:26,263 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-06-14 15:26:26,263 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-06-14 15:26:26,263 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-06-14 15:26:26,263 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-06-14 15:26:26,263 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-06-14 15:26:26,264 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:26,536 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-06-14 15:26:26,560 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-06-14 15:26:26,563 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-06-14 15:26:26,564 INFO L270 PluginConnector]: Initializing CDTParser... [2024-06-14 15:26:26,565 INFO L274 PluginConnector]: CDTParser initialized [2024-06-14 15:26:26,566 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix052_power.oepc_power.opt_pso.oepc_rmo.oepc.i [2024-06-14 15:26:27,726 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-06-14 15:26:27,928 INFO L384 CDTParser]: Found 1 translation units. [2024-06-14 15:26:27,929 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix052_power.oepc_power.opt_pso.oepc_rmo.oepc.i [2024-06-14 15:26:27,944 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3f4e3d801/d7f77bb5a9c84776b2ff3979bc1f1216/FLAGa154b3ca3 [2024-06-14 15:26:27,957 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3f4e3d801/d7f77bb5a9c84776b2ff3979bc1f1216 [2024-06-14 15:26:27,959 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-06-14 15:26:27,959 INFO L274 PluginConnector]: Witness Parser initialized [2024-06-14 15:26:27,960 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_power.oepc_power.opt_pso.oepc_rmo.oepc.yml/witness.yml [2024-06-14 15:26:28,139 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-06-14 15:26:28,141 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-06-14 15:26:28,142 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-06-14 15:26:28,142 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-06-14 15:26:28,146 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-06-14 15:26:28,147 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.06 03:26:27" (1/2) ... [2024-06-14 15:26:28,148 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@569de556 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.06 03:26:28, skipping insertion in model container [2024-06-14 15:26:28,148 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.06 03:26:27" (1/2) ... [2024-06-14 15:26:28,149 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@5107e1a0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.06 03:26:28, skipping insertion in model container [2024-06-14 15:26:28,150 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:28" (2/2) ... [2024-06-14 15:26:28,150 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@569de556 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 14.06 03:26:28, skipping insertion in model container [2024-06-14 15:26:28,150 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:28" (2/2) ... [2024-06-14 15:26:28,151 INFO L83 nessWitnessExtractor]: Extracting all invariants from correctness witness [2024-06-14 15:26:28,238 INFO L95 edCorrectnessWitness]: Found the following entries in the witness: [2024-06-14 15:26:28,239 INFO L97 edCorrectnessWitness]: Location invariant before [L838-L838] ((((((((((((((((((! multithreaded || z$r_buff0_thd3 == (_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 || z$r_buff1_thd3 == (_Bool)0)) && (! multithreaded || ((0 <= z && z <= 1) && (z == 0 || z == 1)))) && (! multithreaded || (((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((0LL - (long long )z$r_buff0_thd0) + (long long )z$r_buff0_thd2 >= 0LL && (0LL - (long long )z$r_buff0_thd0) + (long long )z$r_buff0_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) + (long long )z$r_buff1_thd0 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) + (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) + (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) + (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff0_thd0) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) + (long long )z$w_buff1 >= 0LL) && (0LL - (long long )z$r_buff0_thd1) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) + (long long )z$r_buff0_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) + (long long )z$r_buff1_thd0 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) + (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) + (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) + (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff0_thd2) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) + (long long )z$w_buff1 >= 0LL) && (0LL - (long long )z$r_buff0_thd3) + (long long )z$r_buff1_thd0 >= 0LL) && (0LL - (long long )z$r_buff0_thd3) + (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd3) + (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd3) + (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff0_thd3) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff0_thd3) + (long long )z$w_buff1 >= 0LL) && (0LL - (long long )z$r_buff1_thd0) + (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff1_thd0) + (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff1_thd0) + (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff1_thd0) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff1_thd0) + (long long )z$w_buff1 >= 0LL) && (0LL - (long long )z$r_buff1_thd1) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff1_thd1) + (long long )z$w_buff1 >= 0LL) && (0LL - (long long )z$r_buff1_thd2) + (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff1_thd2) + (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff1_thd2) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff1_thd2) + (long long )z$w_buff1 >= 0LL) && (0LL - (long long )z$r_buff1_thd3) + (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff1_thd3) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff1_thd3) + (long long )z$w_buff1 >= 0LL) && (0LL - (long long )z$read_delayed) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$read_delayed) + (long long )z$w_buff1 >= 0LL) && (1LL - (long long )z$r_buff0_thd1) + (long long )z$r_buff0_thd2 >= 0LL) && (1LL - (long long )z$r_buff0_thd1) + (long long )z$r_buff0_thd3 >= 0LL) && (1LL - (long long )z$r_buff0_thd1) + (long long )z$r_buff1_thd0 >= 0LL) && (1LL - (long long )z$r_buff0_thd1) + (long long )z$r_buff1_thd2 >= 0LL) && (1LL - (long long )z$r_buff0_thd1) + (long long )z$r_buff1_thd3 >= 0LL) && (1LL - (long long )z$r_buff0_thd1) + (long long )z$read_delayed >= 0LL) && (1LL - (long long )z$r_buff0_thd1) + (long long )z$w_buff1 >= 0LL) && (1LL - (long long )z$r_buff1_thd1) + (long long )z$r_buff1_thd2 >= 0LL) && (1LL - (long long )z$r_buff1_thd1) + (long long )z$r_buff1_thd3 >= 0LL) && (1LL - (long long )z$r_buff1_thd1) + (long long )z$read_delayed >= 0LL) && (1LL - (long long )z$w_buff0) + (long long )z$w_buff1 >= 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 )z >= 0LL) && (long long )__unbuffered_cnt + (long long )z$flush_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )z$mem_tmp >= 0LL) && (long long )__unbuffered_cnt + (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )z$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_cnt + (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )z$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_cnt + (long long )z$read_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )z$w_buff0 >= 0LL) && (long long )__unbuffered_cnt + (long long )z$w_buff1 >= 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 )z >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$flush_delayed >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$mem_tmp >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$read_delayed >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$w_buff0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$w_buff1 >= 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 )z >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$flush_delayed >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$mem_tmp >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$read_delayed >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$w_buff0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$w_buff1 >= 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 )z >= 0LL) && (long long )main$tmp_guard1 + (long long )z$flush_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )z$mem_tmp >= 0LL) && (long long )main$tmp_guard1 + (long long )z$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )z$r_buff0_thd2 >= 0LL) && (long long )main$tmp_guard1 + (long long )z$r_buff0_thd3 >= 0LL) && (long long )main$tmp_guard1 + (long long )z$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )z$r_buff1_thd2 >= 0LL) && (long long )main$tmp_guard1 + (long long )z$r_buff1_thd3 >= 0LL) && (long long )main$tmp_guard1 + (long long )z$read_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )z$w_buff0 >= 0LL) && (long long )main$tmp_guard1 + (long long )z$w_buff1 >= 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 )z >= 0LL) && (long long )x + (long long )z$flush_delayed >= 0LL) && (long long )x + (long long )z$mem_tmp >= 0LL) && (long long )x + (long long )z$r_buff0_thd0 >= 0LL) && (long long )x + (long long )z$r_buff0_thd2 >= 0LL) && (long long )x + (long long )z$r_buff0_thd3 >= 0LL) && (long long )x + (long long )z$r_buff1_thd0 >= 0LL) && (long long )x + (long long )z$r_buff1_thd2 >= 0LL) && (long long )x + (long long )z$r_buff1_thd3 >= 0LL) && (long long )x + (long long )z$read_delayed >= 0LL) && (long long )x + (long long )z$w_buff0 >= 0LL) && (long long )x + (long long )z$w_buff1 >= 0LL) && (long long )y + (long long )z >= 0LL) && (long long )y + (long long )z$flush_delayed >= 0LL) && (long long )y + (long long )z$mem_tmp >= 0LL) && (long long )y + (long long )z$r_buff0_thd0 >= 0LL) && (long long )y + (long long )z$r_buff0_thd2 >= 0LL) && (long long )y + (long long )z$r_buff0_thd3 >= 0LL) && (long long )y + (long long )z$r_buff1_thd0 >= 0LL) && (long long )y + (long long )z$r_buff1_thd2 >= 0LL) && (long long )y + (long long )z$r_buff1_thd3 >= 0LL) && (long long )y + (long long )z$read_delayed >= 0LL) && (long long )y + (long long )z$w_buff0 >= 0LL) && (long long )y + (long long )z$w_buff1 >= 0LL) && (long long )z + (long long )z$flush_delayed >= 0LL) && (long long )z + (long long )z$mem_tmp >= 0LL) && (long long )z + (long long )z$r_buff0_thd0 >= 0LL) && (long long )z + (long long )z$r_buff0_thd2 >= 0LL) && (long long )z + (long long )z$r_buff0_thd3 >= 0LL) && (long long )z + (long long )z$r_buff1_thd0 >= 0LL) && (long long )z + (long long )z$r_buff1_thd2 >= 0LL) && (long long )z + (long long )z$r_buff1_thd3 >= 0LL) && (long long )z + (long long )z$read_delayed >= 0LL) && (long long )z + (long long )z$w_buff0 >= 0LL) && (long long )z + (long long )z$w_buff1 >= 0LL) && (long long )z$flush_delayed + (long long )z$mem_tmp >= 0LL) && (long long )z$flush_delayed + (long long )z$r_buff0_thd0 >= 0LL) && (long long )z$flush_delayed + (long long )z$r_buff0_thd2 >= 0LL) && (long long )z$flush_delayed + (long long )z$r_buff0_thd3 >= 0LL) && (long long )z$flush_delayed + (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$flush_delayed + (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$flush_delayed + (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$flush_delayed + (long long )z$read_delayed >= 0LL) && (long long )z$flush_delayed + (long long )z$w_buff0 >= 0LL) && (long long )z$flush_delayed + (long long )z$w_buff1 >= 0LL) && (long long )z$mem_tmp + (long long )z$r_buff0_thd0 >= 0LL) && (long long )z$mem_tmp + (long long )z$r_buff0_thd2 >= 0LL) && (long long )z$mem_tmp + (long long )z$r_buff0_thd3 >= 0LL) && (long long )z$mem_tmp + (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$mem_tmp + (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$mem_tmp + (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$mem_tmp + (long long )z$read_delayed >= 0LL) && (long long )z$mem_tmp + (long long )z$w_buff0 >= 0LL) && (long long )z$mem_tmp + (long long )z$w_buff1 >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$r_buff0_thd2 >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$r_buff0_thd3 >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$read_delayed >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$w_buff0 >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$w_buff1 >= 0LL) && (long long )z$r_buff0_thd2 + (long long )z$r_buff0_thd3 >= 0LL) && (long long )z$r_buff0_thd2 + (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$r_buff0_thd2 + (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff0_thd2 + (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff0_thd2 + (long long )z$read_delayed >= 0LL) && (long long )z$r_buff0_thd2 + (long long )z$w_buff0 >= 0LL) && (long long )z$r_buff0_thd2 + (long long )z$w_buff1 >= 0LL) && (long long )z$r_buff0_thd3 + (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$r_buff0_thd3 + (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff0_thd3 + (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff0_thd3 + (long long )z$read_delayed >= 0LL) && (long long )z$r_buff0_thd3 + (long long )z$w_buff0 >= 0LL) && (long long )z$r_buff0_thd3 + (long long )z$w_buff1 >= 0LL) && (long long )z$r_buff1_thd0 + (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff1_thd0 + (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff1_thd0 + (long long )z$read_delayed >= 0LL) && (long long )z$r_buff1_thd0 + (long long )z$w_buff0 >= 0LL) && (long long )z$r_buff1_thd0 + (long long )z$w_buff1 >= 0LL) && (long long )z$r_buff1_thd2 + (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff1_thd2 + (long long )z$read_delayed >= 0LL) && (long long )z$r_buff1_thd2 + (long long )z$w_buff0 >= 0LL) && (long long )z$r_buff1_thd2 + (long long )z$w_buff1 >= 0LL) && (long long )z$r_buff1_thd3 + (long long )z$read_delayed >= 0LL) && (long long )z$r_buff1_thd3 + (long long )z$w_buff0 >= 0LL) && (long long )z$r_buff1_thd3 + (long long )z$w_buff1 >= 0LL) && (long long )z$read_delayed + (long long )z$w_buff0 >= 0LL) && (long long )z$read_delayed + (long long )z$w_buff1 >= 0LL) && (long long )z$w_buff0 + (long long )z$w_buff1 >= 0LL) && (long long )weak$$choice0 + (long long )x >= 0LL) && (long long )weak$$choice0 + (long long )y >= 0LL) && (long long )weak$$choice0 + (long long )z >= 0LL) && (long long )weak$$choice0 + (long long )z$flush_delayed >= 0LL) && (long long )weak$$choice0 + (long long )z$mem_tmp >= 0LL) && (long long )weak$$choice0 + (long long )z$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )z$r_buff0_thd2 >= 0LL) && (long long )weak$$choice0 + (long long )z$r_buff0_thd3 >= 0LL) && (long long )weak$$choice0 + (long long )z$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )z$r_buff1_thd2 >= 0LL) && (long long )weak$$choice0 + (long long )z$r_buff1_thd3 >= 0LL) && (long long )weak$$choice0 + (long long )z$read_delayed >= 0LL) && (long long )weak$$choice0 + (long long )z$w_buff0 >= 0LL) && (long long )weak$$choice0 + (long long )z$w_buff1 >= 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 )z >= 0LL) && (long long )weak$$choice2 + (long long )z$flush_delayed >= 0LL) && (long long )weak$$choice2 + (long long )z$mem_tmp >= 0LL) && (long long )weak$$choice2 + (long long )z$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )z$r_buff0_thd2 >= 0LL) && (long long )weak$$choice2 + (long long )z$r_buff0_thd3 >= 0LL) && (long long )weak$$choice2 + (long long )z$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )z$r_buff1_thd2 >= 0LL) && (long long )weak$$choice2 + (long long )z$r_buff1_thd3 >= 0LL) && (long long )weak$$choice2 + (long long )z$read_delayed >= 0LL) && (long long )weak$$choice2 + (long long )z$w_buff0 >= 0LL) && (long long )weak$$choice2 + (long long )z$w_buff1 >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )z$r_buff0_thd1 >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )z$r_buff0_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )__unbuffered_p2_EAX) - (long long )z$r_buff0_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p2_EAX) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p2_EAX) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )__unbuffered_p2_EAX) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )main$tmp_guard1) - (long long )z$r_buff0_thd1 >= 0LL) && (1LL + (long long )main$tmp_guard1) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL + (long long )main$tmp_guard1) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )main$tmp_guard1) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )x) - (long long )z$r_buff0_thd1 >= 0LL) && (1LL + (long long )x) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL + (long long )x) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )x) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )y) - (long long )z$r_buff0_thd1 >= 0LL) && (1LL + (long long )y) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL + (long long )y) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )y) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )z) - (long long )z$r_buff0_thd1 >= 0LL) && (1LL + (long long )z) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL + (long long )z) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )z) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )z$flush_delayed) - (long long )z$r_buff0_thd1 >= 0LL) && (1LL + (long long )z$flush_delayed) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL + (long long )z$flush_delayed) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )z$flush_delayed) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )z$mem_tmp) - (long long )z$r_buff0_thd1 >= 0LL) && (1LL + (long long )z$mem_tmp) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL + (long long )z$mem_tmp) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )z$mem_tmp) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )z$r_buff0_thd0) - (long long )z$r_buff0_thd1 >= 0LL) && (1LL + (long long )z$r_buff0_thd0) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL + (long long )z$r_buff0_thd0) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )z$r_buff0_thd0) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )z$r_buff0_thd2) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL + (long long )z$r_buff0_thd2) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )z$r_buff0_thd2) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )z$r_buff0_thd3) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL + (long long )z$r_buff0_thd3) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )z$r_buff0_thd3) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )z$r_buff1_thd0) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL + (long long )z$r_buff1_thd0) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )z$r_buff1_thd0) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )z$r_buff1_thd2) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )z$r_buff1_thd2) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )z$r_buff1_thd3) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )z$r_buff1_thd3) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )z$read_delayed) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )z$read_delayed) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )weak$$choice0) - (long long )z$r_buff0_thd1 >= 0LL) && (1LL + (long long )weak$$choice0) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL + (long long )weak$$choice0) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )weak$$choice0) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )weak$$choice2) - (long long )z$r_buff0_thd1 >= 0LL) && (1LL + (long long )weak$$choice2) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL + (long long )weak$$choice2) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )weak$$choice2) - (long long )z$w_buff1 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) - (long long )z$r_buff0_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) - (long long )z$r_buff0_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) - (long long )z$r_buff1_thd0 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) - (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) - (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) - (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff0_thd2) - (long long )z$r_buff0_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) - (long long )z$r_buff1_thd0 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) - (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) - (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) - (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff0_thd3) - (long long )z$r_buff1_thd0 >= 0LL) && (0LL - (long long )z$r_buff0_thd3) - (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd3) - (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd3) - (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff1_thd0) - (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff1_thd0) - (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff1_thd0) - (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff1_thd2) - (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff1_thd2) - (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff1_thd3) - (long long )z$read_delayed >= 0LL) && (1LL - (long long )z$r_buff0_thd0) - (long long )z$r_buff0_thd1 >= 0LL) && (1LL - (long long )z$r_buff0_thd0) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL - (long long )z$r_buff0_thd0) - (long long )z$w_buff0 >= 0LL) && (1LL - (long long )z$r_buff0_thd0) - (long long )z$w_buff1 >= 0LL) && (1LL - (long long )z$r_buff0_thd1) - (long long )z$r_buff0_thd2 >= 0LL) && (1LL - (long long )z$r_buff0_thd1) - (long long )z$r_buff0_thd3 >= 0LL) && (1LL - (long long )z$r_buff0_thd1) - (long long )z$r_buff1_thd0 >= 0LL) && (1LL - (long long )z$r_buff0_thd1) - (long long )z$r_buff1_thd2 >= 0LL) && (1LL - (long long )z$r_buff0_thd1) - (long long )z$r_buff1_thd3 >= 0LL) && (1LL - (long long )z$r_buff0_thd1) - (long long )z$read_delayed >= 0LL) && (1LL - (long long )z$r_buff0_thd2) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL - (long long )z$r_buff0_thd2) - (long long )z$w_buff0 >= 0LL) && (1LL - (long long )z$r_buff0_thd2) - (long long )z$w_buff1 >= 0LL) && (1LL - (long long )z$r_buff0_thd3) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL - (long long )z$r_buff0_thd3) - (long long )z$w_buff0 >= 0LL) && (1LL - (long long )z$r_buff0_thd3) - (long long )z$w_buff1 >= 0LL) && (1LL - (long long )z$r_buff1_thd0) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL - (long long )z$r_buff1_thd0) - (long long )z$w_buff0 >= 0LL) && (1LL - (long long )z$r_buff1_thd0) - (long long )z$w_buff1 >= 0LL) && (1LL - (long long )z$r_buff1_thd1) - (long long )z$r_buff1_thd2 >= 0LL) && (1LL - (long long )z$r_buff1_thd1) - (long long )z$r_buff1_thd3 >= 0LL) && (1LL - (long long )z$r_buff1_thd1) - (long long )z$read_delayed >= 0LL) && (1LL - (long long )z$r_buff1_thd2) - (long long )z$w_buff0 >= 0LL) && (1LL - (long long )z$r_buff1_thd2) - (long long )z$w_buff1 >= 0LL) && (1LL - (long long )z$r_buff1_thd3) - (long long )z$w_buff0 >= 0LL) && (1LL - (long long )z$r_buff1_thd3) - (long long )z$w_buff1 >= 0LL) && (1LL - (long long )z$read_delayed) - (long long )z$w_buff0 >= 0LL) && (1LL - (long long )z$read_delayed) - (long long )z$w_buff1 >= 0LL) && (2LL - (long long )z$r_buff0_thd1) - (long long )z$r_buff1_thd1 >= 0LL) && (2LL - (long long )z$r_buff0_thd1) - (long long )z$w_buff0 >= 0LL) && (2LL - (long long )z$r_buff0_thd1) - (long long )z$w_buff1 >= 0LL) && (2LL - (long long )z$r_buff1_thd1) - (long long )z$w_buff0 >= 0LL) && (2LL - (long long )z$r_buff1_thd1) - (long long )z$w_buff1 >= 0LL) && (2LL - (long long )z$w_buff0) - (long long )z$w_buff1 >= 0LL) && (long long )__unbuffered_cnt - (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_cnt - (long long )z$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_cnt - (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_cnt - (long long )z$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_cnt - (long long )z$read_delayed >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )z$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )z$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )z$read_delayed >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )z$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )z$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )z$read_delayed >= 0LL) && (long long )main$tmp_guard1 - (long long )z$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )z$r_buff0_thd2 >= 0LL) && (long long )main$tmp_guard1 - (long long )z$r_buff0_thd3 >= 0LL) && (long long )main$tmp_guard1 - (long long )z$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )z$r_buff1_thd2 >= 0LL) && (long long )main$tmp_guard1 - (long long )z$r_buff1_thd3 >= 0LL) && (long long )main$tmp_guard1 - (long long )z$read_delayed >= 0LL) && (long long )x - (long long )z$r_buff0_thd0 >= 0LL) && (long long )x - (long long )z$r_buff0_thd2 >= 0LL) && (long long )x - (long long )z$r_buff0_thd3 >= 0LL) && (long long )x - (long long )z$r_buff1_thd0 >= 0LL) && (long long )x - (long long )z$r_buff1_thd2 >= 0LL) && (long long )x - (long long )z$r_buff1_thd3 >= 0LL) && (long long )x - (long long )z$read_delayed >= 0LL) && (long long )y - (long long )z$r_buff0_thd0 >= 0LL) && (long long )y - (long long )z$r_buff0_thd2 >= 0LL) && (long long )y - (long long )z$r_buff0_thd3 >= 0LL) && (long long )y - (long long )z$r_buff1_thd0 >= 0LL) && (long long )y - (long long )z$r_buff1_thd2 >= 0LL) && (long long )y - (long long )z$r_buff1_thd3 >= 0LL) && (long long )y - (long long )z$read_delayed >= 0LL) && (long long )z - (long long )z$r_buff0_thd0 >= 0LL) && (long long )z - (long long )z$r_buff0_thd2 >= 0LL) && (long long )z - (long long )z$r_buff0_thd3 >= 0LL) && (long long )z - (long long )z$r_buff1_thd0 >= 0LL) && (long long )z - (long long )z$r_buff1_thd2 >= 0LL) && (long long )z - (long long )z$r_buff1_thd3 >= 0LL) && (long long )z - (long long )z$read_delayed >= 0LL) && (long long )z$flush_delayed - (long long )z$r_buff0_thd0 >= 0LL) && (long long )z$flush_delayed - (long long )z$r_buff0_thd2 >= 0LL) && (long long )z$flush_delayed - (long long )z$r_buff0_thd3 >= 0LL) && (long long )z$flush_delayed - (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$flush_delayed - (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$flush_delayed - (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$flush_delayed - (long long )z$read_delayed >= 0LL) && (long long )z$mem_tmp - (long long )z$r_buff0_thd0 >= 0LL) && (long long )z$mem_tmp - (long long )z$r_buff0_thd2 >= 0LL) && (long long )z$mem_tmp - (long long )z$r_buff0_thd3 >= 0LL) && (long long )z$mem_tmp - (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$mem_tmp - (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$mem_tmp - (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$mem_tmp - (long long )z$read_delayed >= 0LL) && (long long )z$r_buff0_thd0 - (long long )z$r_buff0_thd2 >= 0LL) && (long long )z$r_buff0_thd0 - (long long )z$r_buff0_thd3 >= 0LL) && (long long )z$r_buff0_thd0 - (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$r_buff0_thd0 - (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff0_thd0 - (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff0_thd0 - (long long )z$read_delayed >= 0LL) && (long long )z$r_buff0_thd2 - (long long )z$r_buff0_thd3 >= 0LL) && (long long )z$r_buff0_thd2 - (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$r_buff0_thd2 - (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff0_thd2 - (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff0_thd2 - (long long )z$read_delayed >= 0LL) && (long long )z$r_buff0_thd3 - (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$r_buff0_thd3 - (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff0_thd3 - (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff0_thd3 - (long long )z$read_delayed >= 0LL) && (long long )z$r_buff1_thd0 - (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff1_thd0 - (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff1_thd0 - (long long )z$read_delayed >= 0LL) && (long long )z$r_buff1_thd2 - (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff1_thd2 - (long long )z$read_delayed >= 0LL) && (long long )z$r_buff1_thd3 - (long long )z$read_delayed >= 0LL) && (long long )z$w_buff0 - (long long )z$w_buff1 >= 0LL) && (long long )weak$$choice0 - (long long )z$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )z$r_buff0_thd2 >= 0LL) && (long long )weak$$choice0 - (long long )z$r_buff0_thd3 >= 0LL) && (long long )weak$$choice0 - (long long )z$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )z$r_buff1_thd2 >= 0LL) && (long long )weak$$choice0 - (long long )z$r_buff1_thd3 >= 0LL) && (long long )weak$$choice0 - (long long )z$read_delayed >= 0LL) && (long long )weak$$choice2 - (long long )z$flush_delayed >= 0LL) && (long long )weak$$choice2 - (long long )z$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )z$r_buff0_thd2 >= 0LL) && (long long )weak$$choice2 - (long long )z$r_buff0_thd3 >= 0LL) && (long long )weak$$choice2 - (long long )z$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )z$r_buff1_thd2 >= 0LL) && (long long )weak$$choice2 - (long long )z$r_buff1_thd3 >= 0LL) && (long long )weak$$choice2 - (long long )z$read_delayed >= 0LL))) && (! multithreaded || z$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || ((((((((((((((((((((((((((((((((0 <= __unbuffered_cnt && 0 <= __unbuffered_p1_EAX) && 0 <= __unbuffered_p2_EAX) && 0 <= x) && 0 <= y) && 0 <= z) && 0 <= z$mem_tmp) && 0 <= z$w_buff0) && 0 <= z$w_buff1) && __unbuffered_p1_EAX <= 1) && __unbuffered_p2_EAX <= 1) && y <= 1) && z <= 1) && z$mem_tmp <= 1) && z$w_buff0 <= 1) && z$w_buff1 <= 1) && z$flush_delayed == (_Bool)0) && z$r_buff0_thd0 == (_Bool)0) && z$r_buff0_thd2 == (_Bool)0) && z$r_buff0_thd3 == (_Bool)0) && z$r_buff1_thd0 == (_Bool)0) && z$r_buff1_thd2 == (_Bool)0) && z$r_buff1_thd3 == (_Bool)0) && z$read_delayed == (_Bool)0) && z$read_delayed_var == 0) && (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1)) && (__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1)) && (y == 0 || y == 1)) && (z == 0 || z == 1)) && (z$mem_tmp == 0 || z$mem_tmp == 1)) && (z$w_buff0 == 0 || z$w_buff0 == 1)) && (z$w_buff1 == 0 || z$w_buff1 == 1)) && ((x == 0 || x == 1) || x == 2)))) && (! multithreaded || z$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || ((0 <= z$w_buff0 && z$w_buff0 <= 1) && (z$w_buff0 == 0 || z$w_buff0 == 1)))) && (! multithreaded || z$r_buff0_thd2 == (_Bool)0)) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || ((0 <= z$mem_tmp && z$mem_tmp <= 1) && (z$mem_tmp == 0 || z$mem_tmp == 1)))) && (! multithreaded || z$read_delayed_var == 0)) && (! multithreaded || z$r_buff1_thd2 == (_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 || z$read_delayed == (_Bool)0)) && (! multithreaded || ((0 <= z$w_buff1 && z$w_buff1 <= 1) && (z$w_buff1 == 0 || z$w_buff1 == 1))) [2024-06-14 15:26:28,240 INFO L97 edCorrectnessWitness]: Location invariant before [L836-L836] ((((((((((((((((((! multithreaded || z$r_buff0_thd3 == (_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 || z$r_buff1_thd3 == (_Bool)0)) && (! multithreaded || ((0 <= z && z <= 1) && (z == 0 || z == 1)))) && (! multithreaded || (((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((0LL - (long long )z$r_buff0_thd0) + (long long )z$r_buff0_thd2 >= 0LL && (0LL - (long long )z$r_buff0_thd0) + (long long )z$r_buff0_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) + (long long )z$r_buff1_thd0 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) + (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) + (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) + (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff0_thd0) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) + (long long )z$w_buff1 >= 0LL) && (0LL - (long long )z$r_buff0_thd1) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) + (long long )z$r_buff0_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) + (long long )z$r_buff1_thd0 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) + (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) + (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) + (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff0_thd2) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) + (long long )z$w_buff1 >= 0LL) && (0LL - (long long )z$r_buff0_thd3) + (long long )z$r_buff1_thd0 >= 0LL) && (0LL - (long long )z$r_buff0_thd3) + (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd3) + (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd3) + (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff0_thd3) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff0_thd3) + (long long )z$w_buff1 >= 0LL) && (0LL - (long long )z$r_buff1_thd0) + (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff1_thd0) + (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff1_thd0) + (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff1_thd0) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff1_thd0) + (long long )z$w_buff1 >= 0LL) && (0LL - (long long )z$r_buff1_thd1) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff1_thd1) + (long long )z$w_buff1 >= 0LL) && (0LL - (long long )z$r_buff1_thd2) + (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff1_thd2) + (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff1_thd2) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff1_thd2) + (long long )z$w_buff1 >= 0LL) && (0LL - (long long )z$r_buff1_thd3) + (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff1_thd3) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff1_thd3) + (long long )z$w_buff1 >= 0LL) && (0LL - (long long )z$read_delayed) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$read_delayed) + (long long )z$w_buff1 >= 0LL) && (1LL - (long long )z$r_buff0_thd1) + (long long )z$r_buff0_thd2 >= 0LL) && (1LL - (long long )z$r_buff0_thd1) + (long long )z$r_buff0_thd3 >= 0LL) && (1LL - (long long )z$r_buff0_thd1) + (long long )z$r_buff1_thd0 >= 0LL) && (1LL - (long long )z$r_buff0_thd1) + (long long )z$r_buff1_thd2 >= 0LL) && (1LL - (long long )z$r_buff0_thd1) + (long long )z$r_buff1_thd3 >= 0LL) && (1LL - (long long )z$r_buff0_thd1) + (long long )z$read_delayed >= 0LL) && (1LL - (long long )z$r_buff0_thd1) + (long long )z$w_buff1 >= 0LL) && (1LL - (long long )z$r_buff1_thd1) + (long long )z$r_buff1_thd2 >= 0LL) && (1LL - (long long )z$r_buff1_thd1) + (long long )z$r_buff1_thd3 >= 0LL) && (1LL - (long long )z$r_buff1_thd1) + (long long )z$read_delayed >= 0LL) && (1LL - (long long )z$w_buff0) + (long long )z$w_buff1 >= 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 )z >= 0LL) && (long long )__unbuffered_cnt + (long long )z$flush_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )z$mem_tmp >= 0LL) && (long long )__unbuffered_cnt + (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )z$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_cnt + (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )z$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_cnt + (long long )z$read_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )z$w_buff0 >= 0LL) && (long long )__unbuffered_cnt + (long long )z$w_buff1 >= 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 )z >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$flush_delayed >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$mem_tmp >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$read_delayed >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$w_buff0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$w_buff1 >= 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 )z >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$flush_delayed >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$mem_tmp >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$read_delayed >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$w_buff0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$w_buff1 >= 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 )z >= 0LL) && (long long )main$tmp_guard1 + (long long )z$flush_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )z$mem_tmp >= 0LL) && (long long )main$tmp_guard1 + (long long )z$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )z$r_buff0_thd2 >= 0LL) && (long long )main$tmp_guard1 + (long long )z$r_buff0_thd3 >= 0LL) && (long long )main$tmp_guard1 + (long long )z$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )z$r_buff1_thd2 >= 0LL) && (long long )main$tmp_guard1 + (long long )z$r_buff1_thd3 >= 0LL) && (long long )main$tmp_guard1 + (long long )z$read_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )z$w_buff0 >= 0LL) && (long long )main$tmp_guard1 + (long long )z$w_buff1 >= 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 )z >= 0LL) && (long long )x + (long long )z$flush_delayed >= 0LL) && (long long )x + (long long )z$mem_tmp >= 0LL) && (long long )x + (long long )z$r_buff0_thd0 >= 0LL) && (long long )x + (long long )z$r_buff0_thd2 >= 0LL) && (long long )x + (long long )z$r_buff0_thd3 >= 0LL) && (long long )x + (long long )z$r_buff1_thd0 >= 0LL) && (long long )x + (long long )z$r_buff1_thd2 >= 0LL) && (long long )x + (long long )z$r_buff1_thd3 >= 0LL) && (long long )x + (long long )z$read_delayed >= 0LL) && (long long )x + (long long )z$w_buff0 >= 0LL) && (long long )x + (long long )z$w_buff1 >= 0LL) && (long long )y + (long long )z >= 0LL) && (long long )y + (long long )z$flush_delayed >= 0LL) && (long long )y + (long long )z$mem_tmp >= 0LL) && (long long )y + (long long )z$r_buff0_thd0 >= 0LL) && (long long )y + (long long )z$r_buff0_thd2 >= 0LL) && (long long )y + (long long )z$r_buff0_thd3 >= 0LL) && (long long )y + (long long )z$r_buff1_thd0 >= 0LL) && (long long )y + (long long )z$r_buff1_thd2 >= 0LL) && (long long )y + (long long )z$r_buff1_thd3 >= 0LL) && (long long )y + (long long )z$read_delayed >= 0LL) && (long long )y + (long long )z$w_buff0 >= 0LL) && (long long )y + (long long )z$w_buff1 >= 0LL) && (long long )z + (long long )z$flush_delayed >= 0LL) && (long long )z + (long long )z$mem_tmp >= 0LL) && (long long )z + (long long )z$r_buff0_thd0 >= 0LL) && (long long )z + (long long )z$r_buff0_thd2 >= 0LL) && (long long )z + (long long )z$r_buff0_thd3 >= 0LL) && (long long )z + (long long )z$r_buff1_thd0 >= 0LL) && (long long )z + (long long )z$r_buff1_thd2 >= 0LL) && (long long )z + (long long )z$r_buff1_thd3 >= 0LL) && (long long )z + (long long )z$read_delayed >= 0LL) && (long long )z + (long long )z$w_buff0 >= 0LL) && (long long )z + (long long )z$w_buff1 >= 0LL) && (long long )z$flush_delayed + (long long )z$mem_tmp >= 0LL) && (long long )z$flush_delayed + (long long )z$r_buff0_thd0 >= 0LL) && (long long )z$flush_delayed + (long long )z$r_buff0_thd2 >= 0LL) && (long long )z$flush_delayed + (long long )z$r_buff0_thd3 >= 0LL) && (long long )z$flush_delayed + (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$flush_delayed + (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$flush_delayed + (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$flush_delayed + (long long )z$read_delayed >= 0LL) && (long long )z$flush_delayed + (long long )z$w_buff0 >= 0LL) && (long long )z$flush_delayed + (long long )z$w_buff1 >= 0LL) && (long long )z$mem_tmp + (long long )z$r_buff0_thd0 >= 0LL) && (long long )z$mem_tmp + (long long )z$r_buff0_thd2 >= 0LL) && (long long )z$mem_tmp + (long long )z$r_buff0_thd3 >= 0LL) && (long long )z$mem_tmp + (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$mem_tmp + (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$mem_tmp + (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$mem_tmp + (long long )z$read_delayed >= 0LL) && (long long )z$mem_tmp + (long long )z$w_buff0 >= 0LL) && (long long )z$mem_tmp + (long long )z$w_buff1 >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$r_buff0_thd2 >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$r_buff0_thd3 >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$read_delayed >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$w_buff0 >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$w_buff1 >= 0LL) && (long long )z$r_buff0_thd2 + (long long )z$r_buff0_thd3 >= 0LL) && (long long )z$r_buff0_thd2 + (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$r_buff0_thd2 + (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff0_thd2 + (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff0_thd2 + (long long )z$read_delayed >= 0LL) && (long long )z$r_buff0_thd2 + (long long )z$w_buff0 >= 0LL) && (long long )z$r_buff0_thd2 + (long long )z$w_buff1 >= 0LL) && (long long )z$r_buff0_thd3 + (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$r_buff0_thd3 + (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff0_thd3 + (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff0_thd3 + (long long )z$read_delayed >= 0LL) && (long long )z$r_buff0_thd3 + (long long )z$w_buff0 >= 0LL) && (long long )z$r_buff0_thd3 + (long long )z$w_buff1 >= 0LL) && (long long )z$r_buff1_thd0 + (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff1_thd0 + (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff1_thd0 + (long long )z$read_delayed >= 0LL) && (long long )z$r_buff1_thd0 + (long long )z$w_buff0 >= 0LL) && (long long )z$r_buff1_thd0 + (long long )z$w_buff1 >= 0LL) && (long long )z$r_buff1_thd2 + (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff1_thd2 + (long long )z$read_delayed >= 0LL) && (long long )z$r_buff1_thd2 + (long long )z$w_buff0 >= 0LL) && (long long )z$r_buff1_thd2 + (long long )z$w_buff1 >= 0LL) && (long long )z$r_buff1_thd3 + (long long )z$read_delayed >= 0LL) && (long long )z$r_buff1_thd3 + (long long )z$w_buff0 >= 0LL) && (long long )z$r_buff1_thd3 + (long long )z$w_buff1 >= 0LL) && (long long )z$read_delayed + (long long )z$w_buff0 >= 0LL) && (long long )z$read_delayed + (long long )z$w_buff1 >= 0LL) && (long long )z$w_buff0 + (long long )z$w_buff1 >= 0LL) && (long long )weak$$choice0 + (long long )x >= 0LL) && (long long )weak$$choice0 + (long long )y >= 0LL) && (long long )weak$$choice0 + (long long )z >= 0LL) && (long long )weak$$choice0 + (long long )z$flush_delayed >= 0LL) && (long long )weak$$choice0 + (long long )z$mem_tmp >= 0LL) && (long long )weak$$choice0 + (long long )z$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )z$r_buff0_thd2 >= 0LL) && (long long )weak$$choice0 + (long long )z$r_buff0_thd3 >= 0LL) && (long long )weak$$choice0 + (long long )z$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )z$r_buff1_thd2 >= 0LL) && (long long )weak$$choice0 + (long long )z$r_buff1_thd3 >= 0LL) && (long long )weak$$choice0 + (long long )z$read_delayed >= 0LL) && (long long )weak$$choice0 + (long long )z$w_buff0 >= 0LL) && (long long )weak$$choice0 + (long long )z$w_buff1 >= 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 )z >= 0LL) && (long long )weak$$choice2 + (long long )z$flush_delayed >= 0LL) && (long long )weak$$choice2 + (long long )z$mem_tmp >= 0LL) && (long long )weak$$choice2 + (long long )z$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )z$r_buff0_thd2 >= 0LL) && (long long )weak$$choice2 + (long long )z$r_buff0_thd3 >= 0LL) && (long long )weak$$choice2 + (long long )z$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )z$r_buff1_thd2 >= 0LL) && (long long )weak$$choice2 + (long long )z$r_buff1_thd3 >= 0LL) && (long long )weak$$choice2 + (long long )z$read_delayed >= 0LL) && (long long )weak$$choice2 + (long long )z$w_buff0 >= 0LL) && (long long )weak$$choice2 + (long long )z$w_buff1 >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )z$r_buff0_thd1 >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )z$r_buff0_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )__unbuffered_p2_EAX) - (long long )z$r_buff0_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p2_EAX) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p2_EAX) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )__unbuffered_p2_EAX) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )main$tmp_guard1) - (long long )z$r_buff0_thd1 >= 0LL) && (1LL + (long long )main$tmp_guard1) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL + (long long )main$tmp_guard1) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )main$tmp_guard1) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )x) - (long long )z$r_buff0_thd1 >= 0LL) && (1LL + (long long )x) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL + (long long )x) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )x) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )y) - (long long )z$r_buff0_thd1 >= 0LL) && (1LL + (long long )y) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL + (long long )y) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )y) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )z) - (long long )z$r_buff0_thd1 >= 0LL) && (1LL + (long long )z) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL + (long long )z) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )z) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )z$flush_delayed) - (long long )z$r_buff0_thd1 >= 0LL) && (1LL + (long long )z$flush_delayed) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL + (long long )z$flush_delayed) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )z$flush_delayed) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )z$mem_tmp) - (long long )z$r_buff0_thd1 >= 0LL) && (1LL + (long long )z$mem_tmp) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL + (long long )z$mem_tmp) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )z$mem_tmp) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )z$r_buff0_thd0) - (long long )z$r_buff0_thd1 >= 0LL) && (1LL + (long long )z$r_buff0_thd0) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL + (long long )z$r_buff0_thd0) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )z$r_buff0_thd0) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )z$r_buff0_thd2) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL + (long long )z$r_buff0_thd2) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )z$r_buff0_thd2) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )z$r_buff0_thd3) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL + (long long )z$r_buff0_thd3) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )z$r_buff0_thd3) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )z$r_buff1_thd0) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL + (long long )z$r_buff1_thd0) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )z$r_buff1_thd0) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )z$r_buff1_thd2) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )z$r_buff1_thd2) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )z$r_buff1_thd3) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )z$r_buff1_thd3) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )z$read_delayed) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )z$read_delayed) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )weak$$choice0) - (long long )z$r_buff0_thd1 >= 0LL) && (1LL + (long long )weak$$choice0) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL + (long long )weak$$choice0) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )weak$$choice0) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )weak$$choice2) - (long long )z$r_buff0_thd1 >= 0LL) && (1LL + (long long )weak$$choice2) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL + (long long )weak$$choice2) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )weak$$choice2) - (long long )z$w_buff1 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) - (long long )z$r_buff0_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) - (long long )z$r_buff0_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) - (long long )z$r_buff1_thd0 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) - (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) - (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) - (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff0_thd2) - (long long )z$r_buff0_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) - (long long )z$r_buff1_thd0 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) - (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) - (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) - (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff0_thd3) - (long long )z$r_buff1_thd0 >= 0LL) && (0LL - (long long )z$r_buff0_thd3) - (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd3) - (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd3) - (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff1_thd0) - (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff1_thd0) - (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff1_thd0) - (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff1_thd2) - (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff1_thd2) - (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff1_thd3) - (long long )z$read_delayed >= 0LL) && (1LL - (long long )z$r_buff0_thd0) - (long long )z$r_buff0_thd1 >= 0LL) && (1LL - (long long )z$r_buff0_thd0) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL - (long long )z$r_buff0_thd0) - (long long )z$w_buff0 >= 0LL) && (1LL - (long long )z$r_buff0_thd0) - (long long )z$w_buff1 >= 0LL) && (1LL - (long long )z$r_buff0_thd1) - (long long )z$r_buff0_thd2 >= 0LL) && (1LL - (long long )z$r_buff0_thd1) - (long long )z$r_buff0_thd3 >= 0LL) && (1LL - (long long )z$r_buff0_thd1) - (long long )z$r_buff1_thd0 >= 0LL) && (1LL - (long long )z$r_buff0_thd1) - (long long )z$r_buff1_thd2 >= 0LL) && (1LL - (long long )z$r_buff0_thd1) - (long long )z$r_buff1_thd3 >= 0LL) && (1LL - (long long )z$r_buff0_thd1) - (long long )z$read_delayed >= 0LL) && (1LL - (long long )z$r_buff0_thd2) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL - (long long )z$r_buff0_thd2) - (long long )z$w_buff0 >= 0LL) && (1LL - (long long )z$r_buff0_thd2) - (long long )z$w_buff1 >= 0LL) && (1LL - (long long )z$r_buff0_thd3) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL - (long long )z$r_buff0_thd3) - (long long )z$w_buff0 >= 0LL) && (1LL - (long long )z$r_buff0_thd3) - (long long )z$w_buff1 >= 0LL) && (1LL - (long long )z$r_buff1_thd0) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL - (long long )z$r_buff1_thd0) - (long long )z$w_buff0 >= 0LL) && (1LL - (long long )z$r_buff1_thd0) - (long long )z$w_buff1 >= 0LL) && (1LL - (long long )z$r_buff1_thd1) - (long long )z$r_buff1_thd2 >= 0LL) && (1LL - (long long )z$r_buff1_thd1) - (long long )z$r_buff1_thd3 >= 0LL) && (1LL - (long long )z$r_buff1_thd1) - (long long )z$read_delayed >= 0LL) && (1LL - (long long )z$r_buff1_thd2) - (long long )z$w_buff0 >= 0LL) && (1LL - (long long )z$r_buff1_thd2) - (long long )z$w_buff1 >= 0LL) && (1LL - (long long )z$r_buff1_thd3) - (long long )z$w_buff0 >= 0LL) && (1LL - (long long )z$r_buff1_thd3) - (long long )z$w_buff1 >= 0LL) && (1LL - (long long )z$read_delayed) - (long long )z$w_buff0 >= 0LL) && (1LL - (long long )z$read_delayed) - (long long )z$w_buff1 >= 0LL) && (2LL - (long long )z$r_buff0_thd1) - (long long )z$r_buff1_thd1 >= 0LL) && (2LL - (long long )z$r_buff0_thd1) - (long long )z$w_buff0 >= 0LL) && (2LL - (long long )z$r_buff0_thd1) - (long long )z$w_buff1 >= 0LL) && (2LL - (long long )z$r_buff1_thd1) - (long long )z$w_buff0 >= 0LL) && (2LL - (long long )z$r_buff1_thd1) - (long long )z$w_buff1 >= 0LL) && (2LL - (long long )z$w_buff0) - (long long )z$w_buff1 >= 0LL) && (long long )__unbuffered_cnt - (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_cnt - (long long )z$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_cnt - (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_cnt - (long long )z$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_cnt - (long long )z$read_delayed >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )z$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )z$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )z$read_delayed >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )z$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )z$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )z$read_delayed >= 0LL) && (long long )main$tmp_guard1 - (long long )z$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )z$r_buff0_thd2 >= 0LL) && (long long )main$tmp_guard1 - (long long )z$r_buff0_thd3 >= 0LL) && (long long )main$tmp_guard1 - (long long )z$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )z$r_buff1_thd2 >= 0LL) && (long long )main$tmp_guard1 - (long long )z$r_buff1_thd3 >= 0LL) && (long long )main$tmp_guard1 - (long long )z$read_delayed >= 0LL) && (long long )x - (long long )z$r_buff0_thd0 >= 0LL) && (long long )x - (long long )z$r_buff0_thd2 >= 0LL) && (long long )x - (long long )z$r_buff0_thd3 >= 0LL) && (long long )x - (long long )z$r_buff1_thd0 >= 0LL) && (long long )x - (long long )z$r_buff1_thd2 >= 0LL) && (long long )x - (long long )z$r_buff1_thd3 >= 0LL) && (long long )x - (long long )z$read_delayed >= 0LL) && (long long )y - (long long )z$r_buff0_thd0 >= 0LL) && (long long )y - (long long )z$r_buff0_thd2 >= 0LL) && (long long )y - (long long )z$r_buff0_thd3 >= 0LL) && (long long )y - (long long )z$r_buff1_thd0 >= 0LL) && (long long )y - (long long )z$r_buff1_thd2 >= 0LL) && (long long )y - (long long )z$r_buff1_thd3 >= 0LL) && (long long )y - (long long )z$read_delayed >= 0LL) && (long long )z - (long long )z$r_buff0_thd0 >= 0LL) && (long long )z - (long long )z$r_buff0_thd2 >= 0LL) && (long long )z - (long long )z$r_buff0_thd3 >= 0LL) && (long long )z - (long long )z$r_buff1_thd0 >= 0LL) && (long long )z - (long long )z$r_buff1_thd2 >= 0LL) && (long long )z - (long long )z$r_buff1_thd3 >= 0LL) && (long long )z - (long long )z$read_delayed >= 0LL) && (long long )z$flush_delayed - (long long )z$r_buff0_thd0 >= 0LL) && (long long )z$flush_delayed - (long long )z$r_buff0_thd2 >= 0LL) && (long long )z$flush_delayed - (long long )z$r_buff0_thd3 >= 0LL) && (long long )z$flush_delayed - (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$flush_delayed - (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$flush_delayed - (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$flush_delayed - (long long )z$read_delayed >= 0LL) && (long long )z$mem_tmp - (long long )z$r_buff0_thd0 >= 0LL) && (long long )z$mem_tmp - (long long )z$r_buff0_thd2 >= 0LL) && (long long )z$mem_tmp - (long long )z$r_buff0_thd3 >= 0LL) && (long long )z$mem_tmp - (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$mem_tmp - (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$mem_tmp - (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$mem_tmp - (long long )z$read_delayed >= 0LL) && (long long )z$r_buff0_thd0 - (long long )z$r_buff0_thd2 >= 0LL) && (long long )z$r_buff0_thd0 - (long long )z$r_buff0_thd3 >= 0LL) && (long long )z$r_buff0_thd0 - (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$r_buff0_thd0 - (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff0_thd0 - (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff0_thd0 - (long long )z$read_delayed >= 0LL) && (long long )z$r_buff0_thd2 - (long long )z$r_buff0_thd3 >= 0LL) && (long long )z$r_buff0_thd2 - (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$r_buff0_thd2 - (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff0_thd2 - (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff0_thd2 - (long long )z$read_delayed >= 0LL) && (long long )z$r_buff0_thd3 - (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$r_buff0_thd3 - (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff0_thd3 - (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff0_thd3 - (long long )z$read_delayed >= 0LL) && (long long )z$r_buff1_thd0 - (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff1_thd0 - (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff1_thd0 - (long long )z$read_delayed >= 0LL) && (long long )z$r_buff1_thd2 - (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff1_thd2 - (long long )z$read_delayed >= 0LL) && (long long )z$r_buff1_thd3 - (long long )z$read_delayed >= 0LL) && (long long )z$w_buff0 - (long long )z$w_buff1 >= 0LL) && (long long )weak$$choice0 - (long long )z$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )z$r_buff0_thd2 >= 0LL) && (long long )weak$$choice0 - (long long )z$r_buff0_thd3 >= 0LL) && (long long )weak$$choice0 - (long long )z$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )z$r_buff1_thd2 >= 0LL) && (long long )weak$$choice0 - (long long )z$r_buff1_thd3 >= 0LL) && (long long )weak$$choice0 - (long long )z$read_delayed >= 0LL) && (long long )weak$$choice2 - (long long )z$flush_delayed >= 0LL) && (long long )weak$$choice2 - (long long )z$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )z$r_buff0_thd2 >= 0LL) && (long long )weak$$choice2 - (long long )z$r_buff0_thd3 >= 0LL) && (long long )weak$$choice2 - (long long )z$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )z$r_buff1_thd2 >= 0LL) && (long long )weak$$choice2 - (long long )z$r_buff1_thd3 >= 0LL) && (long long )weak$$choice2 - (long long )z$read_delayed >= 0LL))) && (! multithreaded || z$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || ((((((((((((((((((((((((((((((((0 <= __unbuffered_cnt && 0 <= __unbuffered_p1_EAX) && 0 <= __unbuffered_p2_EAX) && 0 <= x) && 0 <= y) && 0 <= z) && 0 <= z$mem_tmp) && 0 <= z$w_buff0) && 0 <= z$w_buff1) && __unbuffered_p1_EAX <= 1) && __unbuffered_p2_EAX <= 1) && y <= 1) && z <= 1) && z$mem_tmp <= 1) && z$w_buff0 <= 1) && z$w_buff1 <= 1) && z$flush_delayed == (_Bool)0) && z$r_buff0_thd0 == (_Bool)0) && z$r_buff0_thd2 == (_Bool)0) && z$r_buff0_thd3 == (_Bool)0) && z$r_buff1_thd0 == (_Bool)0) && z$r_buff1_thd2 == (_Bool)0) && z$r_buff1_thd3 == (_Bool)0) && z$read_delayed == (_Bool)0) && z$read_delayed_var == 0) && (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1)) && (__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1)) && (y == 0 || y == 1)) && (z == 0 || z == 1)) && (z$mem_tmp == 0 || z$mem_tmp == 1)) && (z$w_buff0 == 0 || z$w_buff0 == 1)) && (z$w_buff1 == 0 || z$w_buff1 == 1)) && ((x == 0 || x == 1) || x == 2)))) && (! multithreaded || z$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || ((0 <= z$w_buff0 && z$w_buff0 <= 1) && (z$w_buff0 == 0 || z$w_buff0 == 1)))) && (! multithreaded || z$r_buff0_thd2 == (_Bool)0)) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || ((0 <= z$mem_tmp && z$mem_tmp <= 1) && (z$mem_tmp == 0 || z$mem_tmp == 1)))) && (! multithreaded || z$read_delayed_var == 0)) && (! multithreaded || z$r_buff1_thd2 == (_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 || z$read_delayed == (_Bool)0)) && (! multithreaded || ((0 <= z$w_buff1 && z$w_buff1 <= 1) && (z$w_buff1 == 0 || z$w_buff1 == 1))) [2024-06-14 15:26:28,241 INFO L97 edCorrectnessWitness]: Location invariant before [L839-L839] ((((((((((((((((((! multithreaded || z$r_buff0_thd3 == (_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 || z$r_buff1_thd3 == (_Bool)0)) && (! multithreaded || ((0 <= z && z <= 1) && (z == 0 || z == 1)))) && (! multithreaded || (((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((0LL - (long long )z$r_buff0_thd0) + (long long )z$r_buff0_thd2 >= 0LL && (0LL - (long long )z$r_buff0_thd0) + (long long )z$r_buff0_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) + (long long )z$r_buff1_thd0 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) + (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) + (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) + (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff0_thd0) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) + (long long )z$w_buff1 >= 0LL) && (0LL - (long long )z$r_buff0_thd1) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) + (long long )z$r_buff0_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) + (long long )z$r_buff1_thd0 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) + (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) + (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) + (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff0_thd2) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) + (long long )z$w_buff1 >= 0LL) && (0LL - (long long )z$r_buff0_thd3) + (long long )z$r_buff1_thd0 >= 0LL) && (0LL - (long long )z$r_buff0_thd3) + (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd3) + (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd3) + (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff0_thd3) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff0_thd3) + (long long )z$w_buff1 >= 0LL) && (0LL - (long long )z$r_buff1_thd0) + (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff1_thd0) + (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff1_thd0) + (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff1_thd0) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff1_thd0) + (long long )z$w_buff1 >= 0LL) && (0LL - (long long )z$r_buff1_thd1) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff1_thd1) + (long long )z$w_buff1 >= 0LL) && (0LL - (long long )z$r_buff1_thd2) + (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff1_thd2) + (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff1_thd2) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff1_thd2) + (long long )z$w_buff1 >= 0LL) && (0LL - (long long )z$r_buff1_thd3) + (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff1_thd3) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff1_thd3) + (long long )z$w_buff1 >= 0LL) && (0LL - (long long )z$read_delayed) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$read_delayed) + (long long )z$w_buff1 >= 0LL) && (1LL - (long long )z$r_buff0_thd1) + (long long )z$r_buff0_thd2 >= 0LL) && (1LL - (long long )z$r_buff0_thd1) + (long long )z$r_buff0_thd3 >= 0LL) && (1LL - (long long )z$r_buff0_thd1) + (long long )z$r_buff1_thd0 >= 0LL) && (1LL - (long long )z$r_buff0_thd1) + (long long )z$r_buff1_thd2 >= 0LL) && (1LL - (long long )z$r_buff0_thd1) + (long long )z$r_buff1_thd3 >= 0LL) && (1LL - (long long )z$r_buff0_thd1) + (long long )z$read_delayed >= 0LL) && (1LL - (long long )z$r_buff0_thd1) + (long long )z$w_buff1 >= 0LL) && (1LL - (long long )z$r_buff1_thd1) + (long long )z$r_buff1_thd2 >= 0LL) && (1LL - (long long )z$r_buff1_thd1) + (long long )z$r_buff1_thd3 >= 0LL) && (1LL - (long long )z$r_buff1_thd1) + (long long )z$read_delayed >= 0LL) && (1LL - (long long )z$w_buff0) + (long long )z$w_buff1 >= 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 )z >= 0LL) && (long long )__unbuffered_cnt + (long long )z$flush_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )z$mem_tmp >= 0LL) && (long long )__unbuffered_cnt + (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )z$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_cnt + (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )z$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_cnt + (long long )z$read_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )z$w_buff0 >= 0LL) && (long long )__unbuffered_cnt + (long long )z$w_buff1 >= 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 )z >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$flush_delayed >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$mem_tmp >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$read_delayed >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$w_buff0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$w_buff1 >= 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 )z >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$flush_delayed >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$mem_tmp >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$read_delayed >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$w_buff0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$w_buff1 >= 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 )z >= 0LL) && (long long )main$tmp_guard1 + (long long )z$flush_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )z$mem_tmp >= 0LL) && (long long )main$tmp_guard1 + (long long )z$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )z$r_buff0_thd2 >= 0LL) && (long long )main$tmp_guard1 + (long long )z$r_buff0_thd3 >= 0LL) && (long long )main$tmp_guard1 + (long long )z$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )z$r_buff1_thd2 >= 0LL) && (long long )main$tmp_guard1 + (long long )z$r_buff1_thd3 >= 0LL) && (long long )main$tmp_guard1 + (long long )z$read_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )z$w_buff0 >= 0LL) && (long long )main$tmp_guard1 + (long long )z$w_buff1 >= 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 )z >= 0LL) && (long long )x + (long long )z$flush_delayed >= 0LL) && (long long )x + (long long )z$mem_tmp >= 0LL) && (long long )x + (long long )z$r_buff0_thd0 >= 0LL) && (long long )x + (long long )z$r_buff0_thd2 >= 0LL) && (long long )x + (long long )z$r_buff0_thd3 >= 0LL) && (long long )x + (long long )z$r_buff1_thd0 >= 0LL) && (long long )x + (long long )z$r_buff1_thd2 >= 0LL) && (long long )x + (long long )z$r_buff1_thd3 >= 0LL) && (long long )x + (long long )z$read_delayed >= 0LL) && (long long )x + (long long )z$w_buff0 >= 0LL) && (long long )x + (long long )z$w_buff1 >= 0LL) && (long long )y + (long long )z >= 0LL) && (long long )y + (long long )z$flush_delayed >= 0LL) && (long long )y + (long long )z$mem_tmp >= 0LL) && (long long )y + (long long )z$r_buff0_thd0 >= 0LL) && (long long )y + (long long )z$r_buff0_thd2 >= 0LL) && (long long )y + (long long )z$r_buff0_thd3 >= 0LL) && (long long )y + (long long )z$r_buff1_thd0 >= 0LL) && (long long )y + (long long )z$r_buff1_thd2 >= 0LL) && (long long )y + (long long )z$r_buff1_thd3 >= 0LL) && (long long )y + (long long )z$read_delayed >= 0LL) && (long long )y + (long long )z$w_buff0 >= 0LL) && (long long )y + (long long )z$w_buff1 >= 0LL) && (long long )z + (long long )z$flush_delayed >= 0LL) && (long long )z + (long long )z$mem_tmp >= 0LL) && (long long )z + (long long )z$r_buff0_thd0 >= 0LL) && (long long )z + (long long )z$r_buff0_thd2 >= 0LL) && (long long )z + (long long )z$r_buff0_thd3 >= 0LL) && (long long )z + (long long )z$r_buff1_thd0 >= 0LL) && (long long )z + (long long )z$r_buff1_thd2 >= 0LL) && (long long )z + (long long )z$r_buff1_thd3 >= 0LL) && (long long )z + (long long )z$read_delayed >= 0LL) && (long long )z + (long long )z$w_buff0 >= 0LL) && (long long )z + (long long )z$w_buff1 >= 0LL) && (long long )z$flush_delayed + (long long )z$mem_tmp >= 0LL) && (long long )z$flush_delayed + (long long )z$r_buff0_thd0 >= 0LL) && (long long )z$flush_delayed + (long long )z$r_buff0_thd2 >= 0LL) && (long long )z$flush_delayed + (long long )z$r_buff0_thd3 >= 0LL) && (long long )z$flush_delayed + (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$flush_delayed + (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$flush_delayed + (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$flush_delayed + (long long )z$read_delayed >= 0LL) && (long long )z$flush_delayed + (long long )z$w_buff0 >= 0LL) && (long long )z$flush_delayed + (long long )z$w_buff1 >= 0LL) && (long long )z$mem_tmp + (long long )z$r_buff0_thd0 >= 0LL) && (long long )z$mem_tmp + (long long )z$r_buff0_thd2 >= 0LL) && (long long )z$mem_tmp + (long long )z$r_buff0_thd3 >= 0LL) && (long long )z$mem_tmp + (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$mem_tmp + (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$mem_tmp + (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$mem_tmp + (long long )z$read_delayed >= 0LL) && (long long )z$mem_tmp + (long long )z$w_buff0 >= 0LL) && (long long )z$mem_tmp + (long long )z$w_buff1 >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$r_buff0_thd2 >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$r_buff0_thd3 >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$read_delayed >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$w_buff0 >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$w_buff1 >= 0LL) && (long long )z$r_buff0_thd2 + (long long )z$r_buff0_thd3 >= 0LL) && (long long )z$r_buff0_thd2 + (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$r_buff0_thd2 + (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff0_thd2 + (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff0_thd2 + (long long )z$read_delayed >= 0LL) && (long long )z$r_buff0_thd2 + (long long )z$w_buff0 >= 0LL) && (long long )z$r_buff0_thd2 + (long long )z$w_buff1 >= 0LL) && (long long )z$r_buff0_thd3 + (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$r_buff0_thd3 + (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff0_thd3 + (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff0_thd3 + (long long )z$read_delayed >= 0LL) && (long long )z$r_buff0_thd3 + (long long )z$w_buff0 >= 0LL) && (long long )z$r_buff0_thd3 + (long long )z$w_buff1 >= 0LL) && (long long )z$r_buff1_thd0 + (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff1_thd0 + (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff1_thd0 + (long long )z$read_delayed >= 0LL) && (long long )z$r_buff1_thd0 + (long long )z$w_buff0 >= 0LL) && (long long )z$r_buff1_thd0 + (long long )z$w_buff1 >= 0LL) && (long long )z$r_buff1_thd2 + (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff1_thd2 + (long long )z$read_delayed >= 0LL) && (long long )z$r_buff1_thd2 + (long long )z$w_buff0 >= 0LL) && (long long )z$r_buff1_thd2 + (long long )z$w_buff1 >= 0LL) && (long long )z$r_buff1_thd3 + (long long )z$read_delayed >= 0LL) && (long long )z$r_buff1_thd3 + (long long )z$w_buff0 >= 0LL) && (long long )z$r_buff1_thd3 + (long long )z$w_buff1 >= 0LL) && (long long )z$read_delayed + (long long )z$w_buff0 >= 0LL) && (long long )z$read_delayed + (long long )z$w_buff1 >= 0LL) && (long long )z$w_buff0 + (long long )z$w_buff1 >= 0LL) && (long long )weak$$choice0 + (long long )x >= 0LL) && (long long )weak$$choice0 + (long long )y >= 0LL) && (long long )weak$$choice0 + (long long )z >= 0LL) && (long long )weak$$choice0 + (long long )z$flush_delayed >= 0LL) && (long long )weak$$choice0 + (long long )z$mem_tmp >= 0LL) && (long long )weak$$choice0 + (long long )z$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )z$r_buff0_thd2 >= 0LL) && (long long )weak$$choice0 + (long long )z$r_buff0_thd3 >= 0LL) && (long long )weak$$choice0 + (long long )z$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )z$r_buff1_thd2 >= 0LL) && (long long )weak$$choice0 + (long long )z$r_buff1_thd3 >= 0LL) && (long long )weak$$choice0 + (long long )z$read_delayed >= 0LL) && (long long )weak$$choice0 + (long long )z$w_buff0 >= 0LL) && (long long )weak$$choice0 + (long long )z$w_buff1 >= 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 )z >= 0LL) && (long long )weak$$choice2 + (long long )z$flush_delayed >= 0LL) && (long long )weak$$choice2 + (long long )z$mem_tmp >= 0LL) && (long long )weak$$choice2 + (long long )z$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )z$r_buff0_thd2 >= 0LL) && (long long )weak$$choice2 + (long long )z$r_buff0_thd3 >= 0LL) && (long long )weak$$choice2 + (long long )z$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )z$r_buff1_thd2 >= 0LL) && (long long )weak$$choice2 + (long long )z$r_buff1_thd3 >= 0LL) && (long long )weak$$choice2 + (long long )z$read_delayed >= 0LL) && (long long )weak$$choice2 + (long long )z$w_buff0 >= 0LL) && (long long )weak$$choice2 + (long long )z$w_buff1 >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )z$r_buff0_thd1 >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )z$r_buff0_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )__unbuffered_p2_EAX) - (long long )z$r_buff0_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p2_EAX) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p2_EAX) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )__unbuffered_p2_EAX) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )main$tmp_guard1) - (long long )z$r_buff0_thd1 >= 0LL) && (1LL + (long long )main$tmp_guard1) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL + (long long )main$tmp_guard1) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )main$tmp_guard1) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )x) - (long long )z$r_buff0_thd1 >= 0LL) && (1LL + (long long )x) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL + (long long )x) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )x) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )y) - (long long )z$r_buff0_thd1 >= 0LL) && (1LL + (long long )y) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL + (long long )y) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )y) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )z) - (long long )z$r_buff0_thd1 >= 0LL) && (1LL + (long long )z) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL + (long long )z) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )z) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )z$flush_delayed) - (long long )z$r_buff0_thd1 >= 0LL) && (1LL + (long long )z$flush_delayed) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL + (long long )z$flush_delayed) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )z$flush_delayed) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )z$mem_tmp) - (long long )z$r_buff0_thd1 >= 0LL) && (1LL + (long long )z$mem_tmp) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL + (long long )z$mem_tmp) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )z$mem_tmp) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )z$r_buff0_thd0) - (long long )z$r_buff0_thd1 >= 0LL) && (1LL + (long long )z$r_buff0_thd0) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL + (long long )z$r_buff0_thd0) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )z$r_buff0_thd0) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )z$r_buff0_thd2) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL + (long long )z$r_buff0_thd2) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )z$r_buff0_thd2) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )z$r_buff0_thd3) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL + (long long )z$r_buff0_thd3) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )z$r_buff0_thd3) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )z$r_buff1_thd0) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL + (long long )z$r_buff1_thd0) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )z$r_buff1_thd0) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )z$r_buff1_thd2) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )z$r_buff1_thd2) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )z$r_buff1_thd3) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )z$r_buff1_thd3) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )z$read_delayed) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )z$read_delayed) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )weak$$choice0) - (long long )z$r_buff0_thd1 >= 0LL) && (1LL + (long long )weak$$choice0) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL + (long long )weak$$choice0) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )weak$$choice0) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )weak$$choice2) - (long long )z$r_buff0_thd1 >= 0LL) && (1LL + (long long )weak$$choice2) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL + (long long )weak$$choice2) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )weak$$choice2) - (long long )z$w_buff1 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) - (long long )z$r_buff0_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) - (long long )z$r_buff0_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) - (long long )z$r_buff1_thd0 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) - (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) - (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) - (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff0_thd2) - (long long )z$r_buff0_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) - (long long )z$r_buff1_thd0 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) - (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) - (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) - (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff0_thd3) - (long long )z$r_buff1_thd0 >= 0LL) && (0LL - (long long )z$r_buff0_thd3) - (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd3) - (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd3) - (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff1_thd0) - (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff1_thd0) - (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff1_thd0) - (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff1_thd2) - (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff1_thd2) - (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff1_thd3) - (long long )z$read_delayed >= 0LL) && (1LL - (long long )z$r_buff0_thd0) - (long long )z$r_buff0_thd1 >= 0LL) && (1LL - (long long )z$r_buff0_thd0) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL - (long long )z$r_buff0_thd0) - (long long )z$w_buff0 >= 0LL) && (1LL - (long long )z$r_buff0_thd0) - (long long )z$w_buff1 >= 0LL) && (1LL - (long long )z$r_buff0_thd1) - (long long )z$r_buff0_thd2 >= 0LL) && (1LL - (long long )z$r_buff0_thd1) - (long long )z$r_buff0_thd3 >= 0LL) && (1LL - (long long )z$r_buff0_thd1) - (long long )z$r_buff1_thd0 >= 0LL) && (1LL - (long long )z$r_buff0_thd1) - (long long )z$r_buff1_thd2 >= 0LL) && (1LL - (long long )z$r_buff0_thd1) - (long long )z$r_buff1_thd3 >= 0LL) && (1LL - (long long )z$r_buff0_thd1) - (long long )z$read_delayed >= 0LL) && (1LL - (long long )z$r_buff0_thd2) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL - (long long )z$r_buff0_thd2) - (long long )z$w_buff0 >= 0LL) && (1LL - (long long )z$r_buff0_thd2) - (long long )z$w_buff1 >= 0LL) && (1LL - (long long )z$r_buff0_thd3) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL - (long long )z$r_buff0_thd3) - (long long )z$w_buff0 >= 0LL) && (1LL - (long long )z$r_buff0_thd3) - (long long )z$w_buff1 >= 0LL) && (1LL - (long long )z$r_buff1_thd0) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL - (long long )z$r_buff1_thd0) - (long long )z$w_buff0 >= 0LL) && (1LL - (long long )z$r_buff1_thd0) - (long long )z$w_buff1 >= 0LL) && (1LL - (long long )z$r_buff1_thd1) - (long long )z$r_buff1_thd2 >= 0LL) && (1LL - (long long )z$r_buff1_thd1) - (long long )z$r_buff1_thd3 >= 0LL) && (1LL - (long long )z$r_buff1_thd1) - (long long )z$read_delayed >= 0LL) && (1LL - (long long )z$r_buff1_thd2) - (long long )z$w_buff0 >= 0LL) && (1LL - (long long )z$r_buff1_thd2) - (long long )z$w_buff1 >= 0LL) && (1LL - (long long )z$r_buff1_thd3) - (long long )z$w_buff0 >= 0LL) && (1LL - (long long )z$r_buff1_thd3) - (long long )z$w_buff1 >= 0LL) && (1LL - (long long )z$read_delayed) - (long long )z$w_buff0 >= 0LL) && (1LL - (long long )z$read_delayed) - (long long )z$w_buff1 >= 0LL) && (2LL - (long long )z$r_buff0_thd1) - (long long )z$r_buff1_thd1 >= 0LL) && (2LL - (long long )z$r_buff0_thd1) - (long long )z$w_buff0 >= 0LL) && (2LL - (long long )z$r_buff0_thd1) - (long long )z$w_buff1 >= 0LL) && (2LL - (long long )z$r_buff1_thd1) - (long long )z$w_buff0 >= 0LL) && (2LL - (long long )z$r_buff1_thd1) - (long long )z$w_buff1 >= 0LL) && (2LL - (long long )z$w_buff0) - (long long )z$w_buff1 >= 0LL) && (long long )__unbuffered_cnt - (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_cnt - (long long )z$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_cnt - (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_cnt - (long long )z$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_cnt - (long long )z$read_delayed >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )z$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )z$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )z$read_delayed >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )z$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )z$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )z$read_delayed >= 0LL) && (long long )main$tmp_guard1 - (long long )z$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )z$r_buff0_thd2 >= 0LL) && (long long )main$tmp_guard1 - (long long )z$r_buff0_thd3 >= 0LL) && (long long )main$tmp_guard1 - (long long )z$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )z$r_buff1_thd2 >= 0LL) && (long long )main$tmp_guard1 - (long long )z$r_buff1_thd3 >= 0LL) && (long long )main$tmp_guard1 - (long long )z$read_delayed >= 0LL) && (long long )x - (long long )z$r_buff0_thd0 >= 0LL) && (long long )x - (long long )z$r_buff0_thd2 >= 0LL) && (long long )x - (long long )z$r_buff0_thd3 >= 0LL) && (long long )x - (long long )z$r_buff1_thd0 >= 0LL) && (long long )x - (long long )z$r_buff1_thd2 >= 0LL) && (long long )x - (long long )z$r_buff1_thd3 >= 0LL) && (long long )x - (long long )z$read_delayed >= 0LL) && (long long )y - (long long )z$r_buff0_thd0 >= 0LL) && (long long )y - (long long )z$r_buff0_thd2 >= 0LL) && (long long )y - (long long )z$r_buff0_thd3 >= 0LL) && (long long )y - (long long )z$r_buff1_thd0 >= 0LL) && (long long )y - (long long )z$r_buff1_thd2 >= 0LL) && (long long )y - (long long )z$r_buff1_thd3 >= 0LL) && (long long )y - (long long )z$read_delayed >= 0LL) && (long long )z - (long long )z$r_buff0_thd0 >= 0LL) && (long long )z - (long long )z$r_buff0_thd2 >= 0LL) && (long long )z - (long long )z$r_buff0_thd3 >= 0LL) && (long long )z - (long long )z$r_buff1_thd0 >= 0LL) && (long long )z - (long long )z$r_buff1_thd2 >= 0LL) && (long long )z - (long long )z$r_buff1_thd3 >= 0LL) && (long long )z - (long long )z$read_delayed >= 0LL) && (long long )z$flush_delayed - (long long )z$r_buff0_thd0 >= 0LL) && (long long )z$flush_delayed - (long long )z$r_buff0_thd2 >= 0LL) && (long long )z$flush_delayed - (long long )z$r_buff0_thd3 >= 0LL) && (long long )z$flush_delayed - (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$flush_delayed - (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$flush_delayed - (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$flush_delayed - (long long )z$read_delayed >= 0LL) && (long long )z$mem_tmp - (long long )z$r_buff0_thd0 >= 0LL) && (long long )z$mem_tmp - (long long )z$r_buff0_thd2 >= 0LL) && (long long )z$mem_tmp - (long long )z$r_buff0_thd3 >= 0LL) && (long long )z$mem_tmp - (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$mem_tmp - (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$mem_tmp - (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$mem_tmp - (long long )z$read_delayed >= 0LL) && (long long )z$r_buff0_thd0 - (long long )z$r_buff0_thd2 >= 0LL) && (long long )z$r_buff0_thd0 - (long long )z$r_buff0_thd3 >= 0LL) && (long long )z$r_buff0_thd0 - (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$r_buff0_thd0 - (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff0_thd0 - (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff0_thd0 - (long long )z$read_delayed >= 0LL) && (long long )z$r_buff0_thd2 - (long long )z$r_buff0_thd3 >= 0LL) && (long long )z$r_buff0_thd2 - (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$r_buff0_thd2 - (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff0_thd2 - (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff0_thd2 - (long long )z$read_delayed >= 0LL) && (long long )z$r_buff0_thd3 - (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$r_buff0_thd3 - (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff0_thd3 - (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff0_thd3 - (long long )z$read_delayed >= 0LL) && (long long )z$r_buff1_thd0 - (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff1_thd0 - (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff1_thd0 - (long long )z$read_delayed >= 0LL) && (long long )z$r_buff1_thd2 - (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff1_thd2 - (long long )z$read_delayed >= 0LL) && (long long )z$r_buff1_thd3 - (long long )z$read_delayed >= 0LL) && (long long )z$w_buff0 - (long long )z$w_buff1 >= 0LL) && (long long )weak$$choice0 - (long long )z$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )z$r_buff0_thd2 >= 0LL) && (long long )weak$$choice0 - (long long )z$r_buff0_thd3 >= 0LL) && (long long )weak$$choice0 - (long long )z$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )z$r_buff1_thd2 >= 0LL) && (long long )weak$$choice0 - (long long )z$r_buff1_thd3 >= 0LL) && (long long )weak$$choice0 - (long long )z$read_delayed >= 0LL) && (long long )weak$$choice2 - (long long )z$flush_delayed >= 0LL) && (long long )weak$$choice2 - (long long )z$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )z$r_buff0_thd2 >= 0LL) && (long long )weak$$choice2 - (long long )z$r_buff0_thd3 >= 0LL) && (long long )weak$$choice2 - (long long )z$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )z$r_buff1_thd2 >= 0LL) && (long long )weak$$choice2 - (long long )z$r_buff1_thd3 >= 0LL) && (long long )weak$$choice2 - (long long )z$read_delayed >= 0LL))) && (! multithreaded || z$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || ((((((((((((((((((((((((((((((((0 <= __unbuffered_cnt && 0 <= __unbuffered_p1_EAX) && 0 <= __unbuffered_p2_EAX) && 0 <= x) && 0 <= y) && 0 <= z) && 0 <= z$mem_tmp) && 0 <= z$w_buff0) && 0 <= z$w_buff1) && __unbuffered_p1_EAX <= 1) && __unbuffered_p2_EAX <= 1) && y <= 1) && z <= 1) && z$mem_tmp <= 1) && z$w_buff0 <= 1) && z$w_buff1 <= 1) && z$flush_delayed == (_Bool)0) && z$r_buff0_thd0 == (_Bool)0) && z$r_buff0_thd2 == (_Bool)0) && z$r_buff0_thd3 == (_Bool)0) && z$r_buff1_thd0 == (_Bool)0) && z$r_buff1_thd2 == (_Bool)0) && z$r_buff1_thd3 == (_Bool)0) && z$read_delayed == (_Bool)0) && z$read_delayed_var == 0) && (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1)) && (__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1)) && (y == 0 || y == 1)) && (z == 0 || z == 1)) && (z$mem_tmp == 0 || z$mem_tmp == 1)) && (z$w_buff0 == 0 || z$w_buff0 == 1)) && (z$w_buff1 == 0 || z$w_buff1 == 1)) && ((x == 0 || x == 1) || x == 2)))) && (! multithreaded || z$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || ((0 <= z$w_buff0 && z$w_buff0 <= 1) && (z$w_buff0 == 0 || z$w_buff0 == 1)))) && (! multithreaded || z$r_buff0_thd2 == (_Bool)0)) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || ((0 <= z$mem_tmp && z$mem_tmp <= 1) && (z$mem_tmp == 0 || z$mem_tmp == 1)))) && (! multithreaded || z$read_delayed_var == 0)) && (! multithreaded || z$r_buff1_thd2 == (_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 || z$read_delayed == (_Bool)0)) && (! multithreaded || ((0 <= z$w_buff1 && z$w_buff1 <= 1) && (z$w_buff1 == 0 || z$w_buff1 == 1))) [2024-06-14 15:26:28,241 INFO L103 edCorrectnessWitness]: ghost_variable multithreaded = 0 [2024-06-14 15:26:28,242 INFO L106 edCorrectnessWitness]: ghost_update [L834-L834] multithreaded = 1; [2024-06-14 15:26:28,284 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-06-14 15:26:28,605 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-14 15:26:28,613 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:28,942 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-14 15:26:29,018 INFO L206 MainTranslator]: Completed translation [2024-06-14 15:26:29,019 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 14.06 03:26:29 WrapperNode [2024-06-14 15:26:29,019 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-06-14 15:26:29,020 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-06-14 15:26:29,020 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-06-14 15:26:29,020 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-06-14 15:26:29,025 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 14.06 03:26:29" (1/1) ... [2024-06-14 15:26:29,062 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 14.06 03:26:29" (1/1) ... [2024-06-14 15:26:29,172 INFO L138 Inliner]: procedures = 175, calls = 43, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 125 [2024-06-14 15:26:29,172 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-06-14 15:26:29,173 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-06-14 15:26:29,173 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-06-14 15:26:29,174 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-06-14 15:26:29,182 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 14.06 03:26:29" (1/1) ... [2024-06-14 15:26:29,182 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 14.06 03:26:29" (1/1) ... [2024-06-14 15:26:29,202 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 14.06 03:26:29" (1/1) ... [2024-06-14 15:26:29,242 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:29,242 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 14.06 03:26:29" (1/1) ... [2024-06-14 15:26:29,242 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 14.06 03:26:29" (1/1) ... [2024-06-14 15:26:29,271 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 14.06 03:26:29" (1/1) ... [2024-06-14 15:26:29,273 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 14.06 03:26:29" (1/1) ... [2024-06-14 15:26:29,286 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 14.06 03:26:29" (1/1) ... [2024-06-14 15:26:29,291 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 14.06 03:26:29" (1/1) ... [2024-06-14 15:26:29,307 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-06-14 15:26:29,308 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-06-14 15:26:29,308 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-06-14 15:26:29,308 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-06-14 15:26:29,309 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 14.06 03:26:29" (1/1) ... [2024-06-14 15:26:29,313 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-14 15:26:29,320 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-14 15:26:29,332 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:29,354 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:29,366 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-06-14 15:26:29,366 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-06-14 15:26:29,366 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-06-14 15:26:29,367 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-06-14 15:26:29,367 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-06-14 15:26:29,367 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-06-14 15:26:29,367 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2024-06-14 15:26:29,367 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2024-06-14 15:26:29,367 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-06-14 15:26:29,368 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-06-14 15:26:29,368 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-06-14 15:26:29,368 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-06-14 15:26:29,369 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:29,493 INFO L244 CfgBuilder]: Building ICFG [2024-06-14 15:26:29,495 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-06-14 15:26:30,823 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-06-14 15:26:30,825 INFO L293 CfgBuilder]: Performing block encoding [2024-06-14 15:26:31,108 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-06-14 15:26:31,108 INFO L320 CfgBuilder]: Removed 0 assume(true) statements. [2024-06-14 15:26:31,109 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.06 03:26:31 BoogieIcfgContainer [2024-06-14 15:26:31,109 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-06-14 15:26:31,111 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-06-14 15:26:31,111 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-06-14 15:26:31,114 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-06-14 15:26:31,114 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.06 03:26:27" (1/4) ... [2024-06-14 15:26:31,115 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7cee987e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.06 03:26:31, skipping insertion in model container [2024-06-14 15:26:31,115 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:28" (2/4) ... [2024-06-14 15:26:31,115 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7cee987e and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 14.06 03:26:31, skipping insertion in model container [2024-06-14 15:26:31,115 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 14.06 03:26:29" (3/4) ... [2024-06-14 15:26:31,116 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7cee987e and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 14.06 03:26:31, skipping insertion in model container [2024-06-14 15:26:31,116 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.06 03:26:31" (4/4) ... [2024-06-14 15:26:31,117 INFO L112 eAbstractionObserver]: Analyzing ICFG mix052_power.oepc_power.opt_pso.oepc_rmo.oepc.i [2024-06-14 15:26:31,130 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-06-14 15:26:31,130 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations. [2024-06-14 15:26:31,131 INFO L522 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-06-14 15:26:31,231 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-06-14 15:26:31,260 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 51 places, 41 transitions, 94 flow [2024-06-14 15:26:31,313 INFO L124 PetriNetUnfolderBase]: 0/38 cut-off events. [2024-06-14 15:26:31,313 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-14 15:26:31,316 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 58 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:31,316 INFO L82 GeneralOperation]: Start removeDead. Operand has 51 places, 41 transitions, 94 flow [2024-06-14 15:26:31,319 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 42 places, 32 transitions, 73 flow [2024-06-14 15:26:31,331 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-06-14 15:26:31,339 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;@e16a8ec, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-06-14 15:26:31,339 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2024-06-14 15:26:31,348 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-06-14 15:26:31,348 INFO L124 PetriNetUnfolderBase]: 0/6 cut-off events. [2024-06-14 15:26:31,349 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-14 15:26:31,349 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:26:31,349 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2024-06-14 15:26:31,350 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:31,354 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:26:31,354 INFO L85 PathProgramCache]: Analyzing trace with hash -1534033092, now seen corresponding path program 1 times [2024-06-14 15:26:31,363 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:26:31,363 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1620165513] [2024-06-14 15:26:31,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:26:31,364 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:26:31,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:26:37,201 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:37,202 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:26:37,202 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1620165513] [2024-06-14 15:26:37,203 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1620165513] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:26:37,203 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:26:37,203 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-06-14 15:26:37,205 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [64393736] [2024-06-14 15:26:37,205 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:26:37,212 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-06-14 15:26:37,217 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:26:37,240 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-06-14 15:26:37,241 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-06-14 15:26:37,304 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 41 [2024-06-14 15:26:37,307 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 32 transitions, 73 flow. Second operand has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:26:37,307 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:26:37,307 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 41 [2024-06-14 15:26:37,308 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:26:38,197 INFO L124 PetriNetUnfolderBase]: 1363/2075 cut-off events. [2024-06-14 15:26:38,198 INFO L125 PetriNetUnfolderBase]: For 34/34 co-relation queries the response was YES. [2024-06-14 15:26:38,202 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4201 conditions, 2075 events. 1363/2075 cut-off events. For 34/34 co-relation queries the response was YES. Maximal size of possible extension queue 99. Compared 9692 event pairs, 964 based on Foata normal form. 1/2036 useless extension candidates. Maximal degree in co-relation 4186. Up to 2037 conditions per place. [2024-06-14 15:26:38,211 INFO L140 encePairwiseOnDemand]: 34/41 looper letters, 34 selfloop transitions, 4 changer transitions 0/42 dead transitions. [2024-06-14 15:26:38,211 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 42 transitions, 175 flow [2024-06-14 15:26:38,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-06-14 15:26:38,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-06-14 15:26:38,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 71 transitions. [2024-06-14 15:26:38,220 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5772357723577236 [2024-06-14 15:26:38,222 INFO L175 Difference]: Start difference. First operand has 42 places, 32 transitions, 73 flow. Second operand 3 states and 71 transitions. [2024-06-14 15:26:38,222 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 42 transitions, 175 flow [2024-06-14 15:26:38,224 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 42 transitions, 170 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-06-14 15:26:38,226 INFO L231 Difference]: Finished difference. Result has 42 places, 35 transitions, 100 flow [2024-06-14 15:26:38,227 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:38,229 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 0 predicate places. [2024-06-14 15:26:38,230 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 35 transitions, 100 flow [2024-06-14 15:26:38,230 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:26:38,230 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:26:38,230 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:26:38,230 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-06-14 15:26:38,230 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:38,231 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:26:38,231 INFO L85 PathProgramCache]: Analyzing trace with hash -1031985189, now seen corresponding path program 1 times [2024-06-14 15:26:38,231 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:26:38,231 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [224813142] [2024-06-14 15:26:38,232 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:26:38,232 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:26:38,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:26:42,552 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:42,552 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:26:42,552 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [224813142] [2024-06-14 15:26:42,552 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [224813142] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:26:42,553 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:26:42,553 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-06-14 15:26:42,553 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [711070926] [2024-06-14 15:26:42,553 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:26:42,554 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-06-14 15:26:42,554 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:26:42,555 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-06-14 15:26:42,555 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-06-14 15:26:42,640 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 41 [2024-06-14 15:26:42,641 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 35 transitions, 100 flow. Second operand has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 0 states have call successors, (0), 0 states 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:42,641 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:26:42,641 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 41 [2024-06-14 15:26:42,641 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:26:43,514 INFO L124 PetriNetUnfolderBase]: 1357/2071 cut-off events. [2024-06-14 15:26:43,515 INFO L125 PetriNetUnfolderBase]: For 393/393 co-relation queries the response was YES. [2024-06-14 15:26:43,518 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4740 conditions, 2071 events. 1357/2071 cut-off events. For 393/393 co-relation queries the response was YES. Maximal size of possible extension queue 99. Compared 9656 event pairs, 840 based on Foata normal form. 3/2073 useless extension candidates. Maximal degree in co-relation 4725. Up to 2013 conditions per place. [2024-06-14 15:26:43,530 INFO L140 encePairwiseOnDemand]: 33/41 looper letters, 41 selfloop transitions, 7 changer transitions 0/52 dead transitions. [2024-06-14 15:26:43,530 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 52 transitions, 242 flow [2024-06-14 15:26:43,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-06-14 15:26:43,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-06-14 15:26:43,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 91 transitions. [2024-06-14 15:26:43,535 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5548780487804879 [2024-06-14 15:26:43,535 INFO L175 Difference]: Start difference. First operand has 42 places, 35 transitions, 100 flow. Second operand 4 states and 91 transitions. [2024-06-14 15:26:43,535 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 52 transitions, 242 flow [2024-06-14 15:26:43,536 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 52 transitions, 238 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-06-14 15:26:43,539 INFO L231 Difference]: Finished difference. Result has 45 places, 38 transitions, 136 flow [2024-06-14 15:26:43,539 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:43,540 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 3 predicate places. [2024-06-14 15:26:43,540 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 38 transitions, 136 flow [2024-06-14 15:26:43,541 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 0 states have call successors, (0), 0 states 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:43,541 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:26:43,542 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:26:43,544 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-06-14 15:26:43,544 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:43,545 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:26:43,545 INFO L85 PathProgramCache]: Analyzing trace with hash -1926768673, now seen corresponding path program 1 times [2024-06-14 15:26:43,546 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:26:43,551 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1468938390] [2024-06-14 15:26:43,551 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:26:43,552 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:26:43,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:26:47,765 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:47,766 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:26:47,766 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1468938390] [2024-06-14 15:26:47,766 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1468938390] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:26:47,766 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:26:47,766 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-14 15:26:47,767 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1468463678] [2024-06-14 15:26:47,767 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:26:47,767 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-14 15:26:47,767 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:26:47,768 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-14 15:26:47,768 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-06-14 15:26:47,871 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 41 [2024-06-14 15:26:47,871 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 38 transitions, 136 flow. Second operand has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 0 states have call successors, (0), 0 states 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:47,871 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:26:47,871 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 41 [2024-06-14 15:26:47,871 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:26:48,797 INFO L124 PetriNetUnfolderBase]: 1411/2147 cut-off events. [2024-06-14 15:26:48,798 INFO L125 PetriNetUnfolderBase]: For 1163/1163 co-relation queries the response was YES. [2024-06-14 15:26:48,801 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5477 conditions, 2147 events. 1411/2147 cut-off events. For 1163/1163 co-relation queries the response was YES. Maximal size of possible extension queue 99. Compared 10031 event pairs, 629 based on Foata normal form. 7/2152 useless extension candidates. Maximal degree in co-relation 5460. Up to 1982 conditions per place. [2024-06-14 15:26:48,811 INFO L140 encePairwiseOnDemand]: 30/41 looper letters, 56 selfloop transitions, 16 changer transitions 0/76 dead transitions. [2024-06-14 15:26:48,811 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 76 transitions, 404 flow [2024-06-14 15:26:48,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-14 15:26:48,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-14 15:26:48,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 121 transitions. [2024-06-14 15:26:48,816 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5902439024390244 [2024-06-14 15:26:48,816 INFO L175 Difference]: Start difference. First operand has 45 places, 38 transitions, 136 flow. Second operand 5 states and 121 transitions. [2024-06-14 15:26:48,816 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 76 transitions, 404 flow [2024-06-14 15:26:48,818 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 76 transitions, 390 flow, removed 2 selfloop flow, removed 2 redundant places. [2024-06-14 15:26:48,820 INFO L231 Difference]: Finished difference. Result has 50 places, 49 transitions, 237 flow [2024-06-14 15:26:48,820 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=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=237, PETRI_PLACES=50, PETRI_TRANSITIONS=49} [2024-06-14 15:26:48,821 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 8 predicate places. [2024-06-14 15:26:48,821 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 49 transitions, 237 flow [2024-06-14 15:26:48,821 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 0 states have call successors, (0), 0 states 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:48,821 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:26:48,821 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:26:48,822 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-06-14 15:26:48,822 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:48,822 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:26:48,822 INFO L85 PathProgramCache]: Analyzing trace with hash 1286294586, now seen corresponding path program 1 times [2024-06-14 15:26:48,822 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:26:48,823 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1639909219] [2024-06-14 15:26:48,823 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:26:48,823 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:26:48,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:26:54,664 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:26:54,665 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:26:54,667 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1639909219] [2024-06-14 15:26:54,667 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1639909219] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:26:54,668 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:26:54,668 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-14 15:26:54,668 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [340770776] [2024-06-14 15:26:54,668 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:26:54,668 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-14 15:26:54,669 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:26:54,670 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-14 15:26:54,670 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-06-14 15:26:54,805 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 41 [2024-06-14 15:26:54,805 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 49 transitions, 237 flow. Second operand has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:26:54,806 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:26:54,806 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 41 [2024-06-14 15:26:54,806 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:26:55,978 INFO L124 PetriNetUnfolderBase]: 1433/2180 cut-off events. [2024-06-14 15:26:55,978 INFO L125 PetriNetUnfolderBase]: For 2840/2840 co-relation queries the response was YES. [2024-06-14 15:26:55,983 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6747 conditions, 2180 events. 1433/2180 cut-off events. For 2840/2840 co-relation queries the response was YES. Maximal size of possible extension queue 100. Compared 10247 event pairs, 503 based on Foata normal form. 7/2185 useless extension candidates. Maximal degree in co-relation 6727. Up to 1971 conditions per place. [2024-06-14 15:26:55,996 INFO L140 encePairwiseOnDemand]: 29/41 looper letters, 64 selfloop transitions, 20 changer transitions 0/88 dead transitions. [2024-06-14 15:26:55,997 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 88 transitions, 543 flow [2024-06-14 15:26:55,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-14 15:26:55,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-14 15:26:55,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 137 transitions. [2024-06-14 15:26:55,998 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.556910569105691 [2024-06-14 15:26:55,998 INFO L175 Difference]: Start difference. First operand has 50 places, 49 transitions, 237 flow. Second operand 6 states and 137 transitions. [2024-06-14 15:26:55,998 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 88 transitions, 543 flow [2024-06-14 15:26:56,001 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 88 transitions, 535 flow, removed 4 selfloop flow, removed 0 redundant places. [2024-06-14 15:26:56,002 INFO L231 Difference]: Finished difference. Result has 56 places, 53 transitions, 310 flow [2024-06-14 15:26:56,003 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=229, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=310, PETRI_PLACES=56, PETRI_TRANSITIONS=53} [2024-06-14 15:26:56,003 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 14 predicate places. [2024-06-14 15:26:56,003 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 53 transitions, 310 flow [2024-06-14 15:26:56,004 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:26:56,004 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:26:56,004 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:26:56,004 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-06-14 15:26:56,004 INFO L420 AbstractCegarLoop]: === Iteration 5 === 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:56,004 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:26:56,005 INFO L85 PathProgramCache]: Analyzing trace with hash 1220427678, now seen corresponding path program 1 times [2024-06-14 15:26:56,005 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:26:56,005 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [590951786] [2024-06-14 15:26:56,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:26:56,005 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:26:56,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:27:00,401 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:00,401 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:27:00,401 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [590951786] [2024-06-14 15:27:00,402 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [590951786] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:27:00,402 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:27:00,402 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-14 15:27:00,402 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [401233899] [2024-06-14 15:27:00,402 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:27:00,402 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-14 15:27:00,403 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:27:00,403 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-14 15:27:00,403 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-06-14 15:27:00,564 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 41 [2024-06-14 15:27:00,564 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 53 transitions, 310 flow. Second operand has 7 states, 7 states have (on average 11.428571428571429) internal successors, (80), 7 states have internal predecessors, (80), 0 states have call successors, (0), 0 states 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:00,564 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:27:00,564 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 41 [2024-06-14 15:27:00,565 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:27:01,898 INFO L124 PetriNetUnfolderBase]: 1501/2292 cut-off events. [2024-06-14 15:27:01,898 INFO L125 PetriNetUnfolderBase]: For 4698/4698 co-relation queries the response was YES. [2024-06-14 15:27:01,903 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7907 conditions, 2292 events. 1501/2292 cut-off events. For 4698/4698 co-relation queries the response was YES. Maximal size of possible extension queue 111. Compared 11118 event pairs, 334 based on Foata normal form. 20/2310 useless extension candidates. Maximal degree in co-relation 7884. Up to 1908 conditions per place. [2024-06-14 15:27:01,911 INFO L140 encePairwiseOnDemand]: 30/41 looper letters, 73 selfloop transitions, 35 changer transitions 0/112 dead transitions. [2024-06-14 15:27:01,912 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 112 transitions, 792 flow [2024-06-14 15:27:01,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-14 15:27:01,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-14 15:27:01,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 168 transitions. [2024-06-14 15:27:01,915 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5853658536585366 [2024-06-14 15:27:01,915 INFO L175 Difference]: Start difference. First operand has 56 places, 53 transitions, 310 flow. Second operand 7 states and 168 transitions. [2024-06-14 15:27:01,916 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 112 transitions, 792 flow [2024-06-14 15:27:01,923 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 112 transitions, 743 flow, removed 7 selfloop flow, removed 4 redundant places. [2024-06-14 15:27:01,925 INFO L231 Difference]: Finished difference. Result has 62 places, 68 transitions, 505 flow [2024-06-14 15:27:01,925 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=251, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=505, PETRI_PLACES=62, PETRI_TRANSITIONS=68} [2024-06-14 15:27:01,926 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 20 predicate places. [2024-06-14 15:27:01,927 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 68 transitions, 505 flow [2024-06-14 15:27:01,928 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.428571428571429) internal successors, (80), 7 states have internal predecessors, (80), 0 states have call successors, (0), 0 states 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:01,928 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:27:01,928 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:27:01,928 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-06-14 15:27:01,928 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:01,928 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:27:01,929 INFO L85 PathProgramCache]: Analyzing trace with hash -1106848670, now seen corresponding path program 1 times [2024-06-14 15:27:01,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:27:01,929 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [139824783] [2024-06-14 15:27:01,929 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:27:01,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:27:01,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:27:11,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:27:11,905 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:27:11,905 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [139824783] [2024-06-14 15:27:11,906 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [139824783] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:27:11,906 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:27:11,906 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-14 15:27:11,906 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2013509211] [2024-06-14 15:27:11,906 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:27:11,907 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-14 15:27:11,907 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:27:11,907 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-14 15:27:11,908 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-06-14 15:27:12,056 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 41 [2024-06-14 15:27:12,056 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 68 transitions, 505 flow. Second operand has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:27:12,056 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:27:12,056 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 41 [2024-06-14 15:27:12,056 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:27:13,205 INFO L124 PetriNetUnfolderBase]: 1491/2280 cut-off events. [2024-06-14 15:27:13,205 INFO L125 PetriNetUnfolderBase]: For 8259/8259 co-relation queries the response was YES. [2024-06-14 15:27:13,211 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9242 conditions, 2280 events. 1491/2280 cut-off events. For 8259/8259 co-relation queries the response was YES. Maximal size of possible extension queue 111. Compared 10985 event pairs, 517 based on Foata normal form. 4/2283 useless extension candidates. Maximal degree in co-relation 9214. Up to 2219 conditions per place. [2024-06-14 15:27:13,222 INFO L140 encePairwiseOnDemand]: 33/41 looper letters, 65 selfloop transitions, 10 changer transitions 0/79 dead transitions. [2024-06-14 15:27:13,222 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 79 transitions, 683 flow [2024-06-14 15:27:13,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-14 15:27:13,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-14 15:27:13,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 92 transitions. [2024-06-14 15:27:13,223 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44878048780487806 [2024-06-14 15:27:13,223 INFO L175 Difference]: Start difference. First operand has 62 places, 68 transitions, 505 flow. Second operand 5 states and 92 transitions. [2024-06-14 15:27:13,224 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 79 transitions, 683 flow [2024-06-14 15:27:13,230 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 79 transitions, 643 flow, removed 20 selfloop flow, removed 0 redundant places. [2024-06-14 15:27:13,231 INFO L231 Difference]: Finished difference. Result has 67 places, 68 transitions, 495 flow [2024-06-14 15:27:13,232 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=465, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=495, PETRI_PLACES=67, PETRI_TRANSITIONS=68} [2024-06-14 15:27:13,232 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 25 predicate places. [2024-06-14 15:27:13,232 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 68 transitions, 495 flow [2024-06-14 15:27:13,233 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:27:13,233 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:27:13,233 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:27:13,233 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-06-14 15:27:13,233 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:13,234 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:27:13,234 INFO L85 PathProgramCache]: Analyzing trace with hash 1177730783, now seen corresponding path program 1 times [2024-06-14 15:27:13,234 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:27:13,234 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1231700118] [2024-06-14 15:27:13,234 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:27:13,234 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:27:13,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:27:21,757 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,758 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:27:21,758 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1231700118] [2024-06-14 15:27:21,758 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1231700118] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:27:21,759 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:27:21,759 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-14 15:27:21,759 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1411905819] [2024-06-14 15:27:21,759 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:27:21,759 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-14 15:27:21,760 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:27:21,760 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-14 15:27:21,760 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-06-14 15:27:21,901 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 41 [2024-06-14 15:27:21,902 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 68 transitions, 495 flow. Second operand has 7 states, 7 states have (on average 10.571428571428571) internal successors, (74), 7 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:27:21,902 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:27:21,902 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 41 [2024-06-14 15:27:21,902 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:27:22,771 INFO L124 PetriNetUnfolderBase]: 1503/2295 cut-off events. [2024-06-14 15:27:22,771 INFO L125 PetriNetUnfolderBase]: For 9407/9407 co-relation queries the response was YES. [2024-06-14 15:27:22,777 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9281 conditions, 2295 events. 1503/2295 cut-off events. For 9407/9407 co-relation queries the response was YES. Maximal size of possible extension queue 111. Compared 11079 event pairs, 455 based on Foata normal form. 8/2301 useless extension candidates. Maximal degree in co-relation 9249. Up to 2117 conditions per place. [2024-06-14 15:27:22,786 INFO L140 encePairwiseOnDemand]: 30/41 looper letters, 70 selfloop transitions, 19 changer transitions 0/93 dead transitions. [2024-06-14 15:27:22,786 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 93 transitions, 791 flow [2024-06-14 15:27:22,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-14 15:27:22,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-14 15:27:22,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 118 transitions. [2024-06-14 15:27:22,787 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4796747967479675 [2024-06-14 15:27:22,788 INFO L175 Difference]: Start difference. First operand has 67 places, 68 transitions, 495 flow. Second operand 6 states and 118 transitions. [2024-06-14 15:27:22,788 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 93 transitions, 791 flow [2024-06-14 15:27:22,794 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 93 transitions, 761 flow, removed 4 selfloop flow, removed 4 redundant places. [2024-06-14 15:27:22,796 INFO L231 Difference]: Finished difference. Result has 69 places, 71 transitions, 547 flow [2024-06-14 15:27:22,796 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=465, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=547, PETRI_PLACES=69, PETRI_TRANSITIONS=71} [2024-06-14 15:27:22,797 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 27 predicate places. [2024-06-14 15:27:22,797 INFO L495 AbstractCegarLoop]: Abstraction has has 69 places, 71 transitions, 547 flow [2024-06-14 15:27:22,797 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.571428571428571) internal successors, (74), 7 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:27:22,797 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:27:22,797 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:27:22,798 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-06-14 15:27:22,798 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:22,798 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:27:22,798 INFO L85 PathProgramCache]: Analyzing trace with hash 1856763941, now seen corresponding path program 2 times [2024-06-14 15:27:22,798 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:27:22,798 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [984686037] [2024-06-14 15:27:22,799 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:27:22,799 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:27:22,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:27:29,696 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:29,697 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:27:29,697 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [984686037] [2024-06-14 15:27:29,697 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [984686037] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:27:29,697 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:27:29,697 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-14 15:27:29,697 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [820384426] [2024-06-14 15:27:29,698 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:27:29,698 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-14 15:27:29,698 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:27:29,698 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-14 15:27:29,699 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-06-14 15:27:29,828 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 41 [2024-06-14 15:27:29,829 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 71 transitions, 547 flow. Second operand has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 6 states have internal predecessors, (71), 0 states have call successors, (0), 0 states 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:29,829 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:27:29,829 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 41 [2024-06-14 15:27:29,829 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:27:30,622 INFO L124 PetriNetUnfolderBase]: 1477/2256 cut-off events. [2024-06-14 15:27:30,622 INFO L125 PetriNetUnfolderBase]: For 10570/10570 co-relation queries the response was YES. [2024-06-14 15:27:30,627 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9363 conditions, 2256 events. 1477/2256 cut-off events. For 10570/10570 co-relation queries the response was YES. Maximal size of possible extension queue 108. Compared 10801 event pairs, 497 based on Foata normal form. 4/2259 useless extension candidates. Maximal degree in co-relation 9331. Up to 2186 conditions per place. [2024-06-14 15:27:30,634 INFO L140 encePairwiseOnDemand]: 31/41 looper letters, 72 selfloop transitions, 11 changer transitions 0/87 dead transitions. [2024-06-14 15:27:30,635 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 87 transitions, 755 flow [2024-06-14 15:27:30,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-14 15:27:30,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-14 15:27:30,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 114 transitions. [2024-06-14 15:27:30,636 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4634146341463415 [2024-06-14 15:27:30,636 INFO L175 Difference]: Start difference. First operand has 69 places, 71 transitions, 547 flow. Second operand 6 states and 114 transitions. [2024-06-14 15:27:30,636 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 87 transitions, 755 flow [2024-06-14 15:27:30,644 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 87 transitions, 726 flow, removed 4 selfloop flow, removed 3 redundant places. [2024-06-14 15:27:30,645 INFO L231 Difference]: Finished difference. Result has 72 places, 71 transitions, 548 flow [2024-06-14 15:27:30,646 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=518, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=71, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=548, PETRI_PLACES=72, PETRI_TRANSITIONS=71} [2024-06-14 15:27:30,646 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 30 predicate places. [2024-06-14 15:27:30,646 INFO L495 AbstractCegarLoop]: Abstraction has has 72 places, 71 transitions, 548 flow [2024-06-14 15:27:30,646 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 6 states have internal predecessors, (71), 0 states have call successors, (0), 0 states 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:30,647 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:27:30,647 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:27:30,647 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-06-14 15:27:30,647 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 15:27:30,647 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:27:30,647 INFO L85 PathProgramCache]: Analyzing trace with hash -1967673093, now seen corresponding path program 1 times [2024-06-14 15:27:30,647 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:27:30,648 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1574522545] [2024-06-14 15:27:30,648 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:27:30,648 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:27:30,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:27:42,967 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:42,968 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:27:42,968 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1574522545] [2024-06-14 15:27:42,968 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1574522545] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:27:42,968 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:27:42,968 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 15:27:42,969 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1979107799] [2024-06-14 15:27:42,969 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:27:42,969 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 15:27:42,969 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:27:42,969 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 15:27:42,970 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-06-14 15:27:43,190 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41 [2024-06-14 15:27:43,190 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 71 transitions, 548 flow. Second operand has 9 states, 9 states have (on average 9.444444444444445) internal successors, (85), 9 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:27:43,190 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:27:43,190 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41 [2024-06-14 15:27:43,190 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:27:44,386 INFO L124 PetriNetUnfolderBase]: 1800/2696 cut-off events. [2024-06-14 15:27:44,386 INFO L125 PetriNetUnfolderBase]: For 14453/14453 co-relation queries the response was YES. [2024-06-14 15:27:44,415 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11142 conditions, 2696 events. 1800/2696 cut-off events. For 14453/14453 co-relation queries the response was YES. Maximal size of possible extension queue 118. Compared 12427 event pairs, 628 based on Foata normal form. 4/2699 useless extension candidates. Maximal degree in co-relation 11109. Up to 2638 conditions per place. [2024-06-14 15:27:44,441 INFO L140 encePairwiseOnDemand]: 32/41 looper letters, 78 selfloop transitions, 15 changer transitions 0/96 dead transitions. [2024-06-14 15:27:44,442 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 96 transitions, 832 flow [2024-06-14 15:27:44,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-14 15:27:44,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-14 15:27:44,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 118 transitions. [2024-06-14 15:27:44,445 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41114982578397213 [2024-06-14 15:27:44,445 INFO L175 Difference]: Start difference. First operand has 72 places, 71 transitions, 548 flow. Second operand 7 states and 118 transitions. [2024-06-14 15:27:44,445 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 96 transitions, 832 flow [2024-06-14 15:27:44,458 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 96 transitions, 778 flow, removed 3 selfloop flow, removed 6 redundant places. [2024-06-14 15:27:44,463 INFO L231 Difference]: Finished difference. Result has 74 places, 76 transitions, 589 flow [2024-06-14 15:27:44,463 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=499, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=71, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=589, PETRI_PLACES=74, PETRI_TRANSITIONS=76} [2024-06-14 15:27:44,464 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 32 predicate places. [2024-06-14 15:27:44,464 INFO L495 AbstractCegarLoop]: Abstraction has has 74 places, 76 transitions, 589 flow [2024-06-14 15:27:44,464 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.444444444444445) internal successors, (85), 9 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:27:44,464 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:27:44,465 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:27:44,465 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-06-14 15:27:44,465 INFO L420 AbstractCegarLoop]: === Iteration 10 === 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:44,465 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:27:44,465 INFO L85 PathProgramCache]: Analyzing trace with hash 2113124872, now seen corresponding path program 1 times [2024-06-14 15:27:44,468 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:27:44,470 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1626925995] [2024-06-14 15:27:44,470 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:27:44,470 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:27:44,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:27:56,582 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:56,583 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:27:56,583 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1626925995] [2024-06-14 15:27:56,583 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1626925995] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:27:56,583 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:27:56,583 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-14 15:27:56,584 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [551642046] [2024-06-14 15:27:56,584 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:27:56,584 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-14 15:27:56,585 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:27:56,585 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-14 15:27:56,585 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-06-14 15:27:56,692 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41 [2024-06-14 15:27:56,692 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 76 transitions, 589 flow. Second operand has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 6 states have internal predecessors, (61), 0 states have call successors, (0), 0 states 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:56,692 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:27:56,692 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41 [2024-06-14 15:27:56,692 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:27:57,656 INFO L124 PetriNetUnfolderBase]: 1791/2684 cut-off events. [2024-06-14 15:27:57,656 INFO L125 PetriNetUnfolderBase]: For 16154/16154 co-relation queries the response was YES. [2024-06-14 15:27:57,663 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11526 conditions, 2684 events. 1791/2684 cut-off events. For 16154/16154 co-relation queries the response was YES. Maximal size of possible extension queue 118. Compared 12250 event pairs, 640 based on Foata normal form. 3/2686 useless extension candidates. Maximal degree in co-relation 11492. Up to 2662 conditions per place. [2024-06-14 15:27:57,672 INFO L140 encePairwiseOnDemand]: 34/41 looper letters, 78 selfloop transitions, 8 changer transitions 0/89 dead transitions. [2024-06-14 15:27:57,672 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 89 transitions, 809 flow [2024-06-14 15:27:57,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-14 15:27:57,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-14 15:27:57,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 85 transitions. [2024-06-14 15:27:57,673 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4146341463414634 [2024-06-14 15:27:57,673 INFO L175 Difference]: Start difference. First operand has 74 places, 76 transitions, 589 flow. Second operand 5 states and 85 transitions. [2024-06-14 15:27:57,673 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 89 transitions, 809 flow [2024-06-14 15:27:57,687 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 89 transitions, 768 flow, removed 8 selfloop flow, removed 4 redundant places. [2024-06-14 15:27:57,688 INFO L231 Difference]: Finished difference. Result has 75 places, 79 transitions, 600 flow [2024-06-14 15:27:57,688 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=548, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=76, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=68, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=600, PETRI_PLACES=75, PETRI_TRANSITIONS=79} [2024-06-14 15:27:57,689 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 33 predicate places. [2024-06-14 15:27:57,689 INFO L495 AbstractCegarLoop]: Abstraction has has 75 places, 79 transitions, 600 flow [2024-06-14 15:27:57,689 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 6 states have internal predecessors, (61), 0 states have call successors, (0), 0 states 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:57,689 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:27:57,690 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:27:57,690 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-06-14 15:27:57,690 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:27:57,690 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:27:57,690 INFO L85 PathProgramCache]: Analyzing trace with hash 1487463492, now seen corresponding path program 1 times [2024-06-14 15:27:57,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:27:57,691 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1460361501] [2024-06-14 15:27:57,691 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:27:57,691 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:27:57,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:28:07,058 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:07,058 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:28:07,059 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1460361501] [2024-06-14 15:28:07,059 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1460361501] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:28:07,059 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:28:07,059 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-14 15:28:07,059 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [820591858] [2024-06-14 15:28:07,059 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:28:07,059 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-14 15:28:07,059 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:28:07,060 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-14 15:28:07,060 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-06-14 15:28:07,311 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 41 [2024-06-14 15:28:07,311 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 79 transitions, 600 flow. Second operand has 8 states, 8 states have (on average 10.625) internal successors, (85), 8 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:28:07,311 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:28:07,312 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 41 [2024-06-14 15:28:07,312 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:28:08,407 INFO L124 PetriNetUnfolderBase]: 1651/2511 cut-off events. [2024-06-14 15:28:08,407 INFO L125 PetriNetUnfolderBase]: For 17329/17329 co-relation queries the response was YES. [2024-06-14 15:28:08,413 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11118 conditions, 2511 events. 1651/2511 cut-off events. For 17329/17329 co-relation queries the response was YES. Maximal size of possible extension queue 117. Compared 12148 event pairs, 497 based on Foata normal form. 4/2512 useless extension candidates. Maximal degree in co-relation 11083. Up to 2267 conditions per place. [2024-06-14 15:28:08,421 INFO L140 encePairwiseOnDemand]: 29/41 looper letters, 82 selfloop transitions, 28 changer transitions 0/115 dead transitions. [2024-06-14 15:28:08,422 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 115 transitions, 938 flow [2024-06-14 15:28:08,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 15:28:08,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 15:28:08,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 154 transitions. [2024-06-14 15:28:08,425 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4695121951219512 [2024-06-14 15:28:08,425 INFO L175 Difference]: Start difference. First operand has 75 places, 79 transitions, 600 flow. Second operand 8 states and 154 transitions. [2024-06-14 15:28:08,425 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 115 transitions, 938 flow [2024-06-14 15:28:08,437 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 115 transitions, 908 flow, removed 9 selfloop flow, removed 3 redundant places. [2024-06-14 15:28:08,438 INFO L231 Difference]: Finished difference. Result has 80 places, 82 transitions, 669 flow [2024-06-14 15:28:08,439 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=570, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=79, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=669, PETRI_PLACES=80, PETRI_TRANSITIONS=82} [2024-06-14 15:28:08,439 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 38 predicate places. [2024-06-14 15:28:08,439 INFO L495 AbstractCegarLoop]: Abstraction has has 80 places, 82 transitions, 669 flow [2024-06-14 15:28:08,439 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.625) internal successors, (85), 8 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:28:08,440 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:28:08,440 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:28:08,440 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-06-14 15:28:08,440 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 15:28:08,440 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:28:08,440 INFO L85 PathProgramCache]: Analyzing trace with hash -47515680, now seen corresponding path program 1 times [2024-06-14 15:28:08,441 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:28:08,441 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1487763825] [2024-06-14 15:28:08,441 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:28:08,441 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:28:08,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:28:17,046 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:17,046 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:28:17,046 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1487763825] [2024-06-14 15:28:17,046 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1487763825] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:28:17,046 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:28:17,046 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 15:28:17,047 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1854919175] [2024-06-14 15:28:17,047 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:28:17,047 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 15:28:17,047 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:28:17,048 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 15:28:17,048 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-06-14 15:28:17,255 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41 [2024-06-14 15:28:17,255 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 82 transitions, 669 flow. Second operand has 9 states, 9 states have (on average 9.444444444444445) internal successors, (85), 9 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:28:17,255 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:28:17,255 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41 [2024-06-14 15:28:17,255 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:28:18,373 INFO L124 PetriNetUnfolderBase]: 1793/2688 cut-off events. [2024-06-14 15:28:18,373 INFO L125 PetriNetUnfolderBase]: For 20909/20909 co-relation queries the response was YES. [2024-06-14 15:28:18,381 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12530 conditions, 2688 events. 1793/2688 cut-off events. For 20909/20909 co-relation queries the response was YES. Maximal size of possible extension queue 117. Compared 12345 event pairs, 614 based on Foata normal form. 2/2689 useless extension candidates. Maximal degree in co-relation 12494. Up to 2621 conditions per place. [2024-06-14 15:28:18,391 INFO L140 encePairwiseOnDemand]: 31/41 looper letters, 83 selfloop transitions, 19 changer transitions 0/105 dead transitions. [2024-06-14 15:28:18,391 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 105 transitions, 958 flow [2024-06-14 15:28:18,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-14 15:28:18,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-14 15:28:18,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 119 transitions. [2024-06-14 15:28:18,392 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4146341463414634 [2024-06-14 15:28:18,393 INFO L175 Difference]: Start difference. First operand has 80 places, 82 transitions, 669 flow. Second operand 7 states and 119 transitions. [2024-06-14 15:28:18,393 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 105 transitions, 958 flow [2024-06-14 15:28:18,409 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 105 transitions, 875 flow, removed 14 selfloop flow, removed 6 redundant places. [2024-06-14 15:28:18,410 INFO L231 Difference]: Finished difference. Result has 81 places, 85 transitions, 675 flow [2024-06-14 15:28:18,411 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=590, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=82, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=675, PETRI_PLACES=81, PETRI_TRANSITIONS=85} [2024-06-14 15:28:18,411 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 39 predicate places. [2024-06-14 15:28:18,411 INFO L495 AbstractCegarLoop]: Abstraction has has 81 places, 85 transitions, 675 flow [2024-06-14 15:28:18,411 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.444444444444445) internal successors, (85), 9 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:28:18,411 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:28:18,412 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:18,412 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-06-14 15:28:18,412 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:18,412 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:28:18,412 INFO L85 PathProgramCache]: Analyzing trace with hash 72278624, now seen corresponding path program 1 times [2024-06-14 15:28:18,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:28:18,413 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1654603373] [2024-06-14 15:28:18,413 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:28:18,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:28:18,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:28:28,232 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:28:28,232 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:28:28,232 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1654603373] [2024-06-14 15:28:28,232 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1654603373] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:28:28,232 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:28:28,232 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 15:28:28,233 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1368108860] [2024-06-14 15:28:28,233 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:28:28,233 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 15:28:28,233 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:28:28,235 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 15:28:28,236 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-06-14 15:28:28,519 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 41 [2024-06-14 15:28:28,519 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 85 transitions, 675 flow. Second operand has 9 states, 9 states have (on average 10.555555555555555) internal successors, (95), 9 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:28:28,519 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:28:28,519 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 41 [2024-06-14 15:28:28,520 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:28:29,792 INFO L124 PetriNetUnfolderBase]: 1860/2850 cut-off events. [2024-06-14 15:28:29,792 INFO L125 PetriNetUnfolderBase]: For 25656/25656 co-relation queries the response was YES. [2024-06-14 15:28:29,800 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13193 conditions, 2850 events. 1860/2850 cut-off events. For 25656/25656 co-relation queries the response was YES. Maximal size of possible extension queue 138. Compared 14176 event pairs, 303 based on Foata normal form. 16/2863 useless extension candidates. Maximal degree in co-relation 13156. Up to 2160 conditions per place. [2024-06-14 15:28:29,809 INFO L140 encePairwiseOnDemand]: 30/41 looper letters, 97 selfloop transitions, 30 changer transitions 0/132 dead transitions. [2024-06-14 15:28:29,809 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 132 transitions, 1156 flow [2024-06-14 15:28:29,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 15:28:29,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 15:28:29,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 159 transitions. [2024-06-14 15:28:29,812 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4847560975609756 [2024-06-14 15:28:29,812 INFO L175 Difference]: Start difference. First operand has 81 places, 85 transitions, 675 flow. Second operand 8 states and 159 transitions. [2024-06-14 15:28:29,812 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 132 transitions, 1156 flow [2024-06-14 15:28:29,829 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 132 transitions, 1102 flow, removed 2 selfloop flow, removed 6 redundant places. [2024-06-14 15:28:29,831 INFO L231 Difference]: Finished difference. Result has 84 places, 88 transitions, 735 flow [2024-06-14 15:28:29,831 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=621, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=85, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=735, PETRI_PLACES=84, PETRI_TRANSITIONS=88} [2024-06-14 15:28:29,832 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 42 predicate places. [2024-06-14 15:28:29,832 INFO L495 AbstractCegarLoop]: Abstraction has has 84 places, 88 transitions, 735 flow [2024-06-14 15:28:29,832 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.555555555555555) internal successors, (95), 9 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:28:29,832 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:28:29,832 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:29,832 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-06-14 15:28:29,832 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:29,833 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:28:29,833 INFO L85 PathProgramCache]: Analyzing trace with hash 75020264, now seen corresponding path program 2 times [2024-06-14 15:28:29,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:28:29,833 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [730875026] [2024-06-14 15:28:29,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:28:29,833 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:28:29,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:28:40,558 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:40,558 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:28:40,558 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [730875026] [2024-06-14 15:28:40,558 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [730875026] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:28:40,558 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:28:40,558 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 15:28:40,559 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1820085699] [2024-06-14 15:28:40,559 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:28:40,559 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 15:28:40,559 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:28:40,559 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 15:28:40,559 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-06-14 15:28:40,745 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 41 [2024-06-14 15:28:40,745 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 88 transitions, 735 flow. Second operand has 9 states, 9 states have (on average 10.555555555555555) internal successors, (95), 9 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:28:40,745 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:28:40,745 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 41 [2024-06-14 15:28:40,745 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:28:42,172 INFO L124 PetriNetUnfolderBase]: 1935/2983 cut-off events. [2024-06-14 15:28:42,172 INFO L125 PetriNetUnfolderBase]: For 31072/31072 co-relation queries the response was YES. [2024-06-14 15:28:42,179 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14026 conditions, 2983 events. 1935/2983 cut-off events. For 31072/31072 co-relation queries the response was YES. Maximal size of possible extension queue 147. Compared 15162 event pairs, 479 based on Foata normal form. 40/3020 useless extension candidates. Maximal degree in co-relation 13987. Up to 2468 conditions per place. [2024-06-14 15:28:42,187 INFO L140 encePairwiseOnDemand]: 29/41 looper letters, 96 selfloop transitions, 33 changer transitions 0/134 dead transitions. [2024-06-14 15:28:42,187 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 134 transitions, 1168 flow [2024-06-14 15:28:42,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 15:28:42,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 15:28:42,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 175 transitions. [2024-06-14 15:28:42,190 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4742547425474255 [2024-06-14 15:28:42,190 INFO L175 Difference]: Start difference. First operand has 84 places, 88 transitions, 735 flow. Second operand 9 states and 175 transitions. [2024-06-14 15:28:42,190 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 134 transitions, 1168 flow [2024-06-14 15:28:42,207 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 88 places, 134 transitions, 1130 flow, removed 3 selfloop flow, removed 4 redundant places. [2024-06-14 15:28:42,209 INFO L231 Difference]: Finished difference. Result has 89 places, 91 transitions, 822 flow [2024-06-14 15:28:42,209 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=697, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=88, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=822, PETRI_PLACES=89, PETRI_TRANSITIONS=91} [2024-06-14 15:28:42,210 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 47 predicate places. [2024-06-14 15:28:42,210 INFO L495 AbstractCegarLoop]: Abstraction has has 89 places, 91 transitions, 822 flow [2024-06-14 15:28:42,210 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.555555555555555) internal successors, (95), 9 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:28:42,210 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:28:42,211 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:42,211 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-06-14 15:28:42,211 INFO L420 AbstractCegarLoop]: === Iteration 15 === 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:42,211 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:28:42,211 INFO L85 PathProgramCache]: Analyzing trace with hash -1815342161, now seen corresponding path program 1 times [2024-06-14 15:28:42,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:28:42,211 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1880543257] [2024-06-14 15:28:42,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:28:42,212 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:28:42,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:28:52,871 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:52,871 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:28:52,871 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1880543257] [2024-06-14 15:28:52,871 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1880543257] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:28:52,871 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:28:52,871 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-14 15:28:52,871 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1670053825] [2024-06-14 15:28:52,872 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:28:52,872 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-14 15:28:52,872 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:28:52,872 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-14 15:28:52,872 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-06-14 15:28:52,973 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41 [2024-06-14 15:28:52,973 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 89 places, 91 transitions, 822 flow. Second operand has 7 states, 7 states have (on average 10.0) internal successors, (70), 7 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:28:52,973 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:28:52,974 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41 [2024-06-14 15:28:52,974 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:28:54,032 INFO L124 PetriNetUnfolderBase]: 2061/3134 cut-off events. [2024-06-14 15:28:54,033 INFO L125 PetriNetUnfolderBase]: For 32178/32178 co-relation queries the response was YES. [2024-06-14 15:28:54,041 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15331 conditions, 3134 events. 2061/3134 cut-off events. For 32178/32178 co-relation queries the response was YES. Maximal size of possible extension queue 144. Compared 15138 event pairs, 674 based on Foata normal form. 3/3136 useless extension candidates. Maximal degree in co-relation 15290. Up to 3080 conditions per place. [2024-06-14 15:28:54,051 INFO L140 encePairwiseOnDemand]: 32/41 looper letters, 101 selfloop transitions, 16 changer transitions 0/120 dead transitions. [2024-06-14 15:28:54,051 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 120 transitions, 1196 flow [2024-06-14 15:28:54,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-14 15:28:54,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-14 15:28:54,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 108 transitions. [2024-06-14 15:28:54,052 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43902439024390244 [2024-06-14 15:28:54,052 INFO L175 Difference]: Start difference. First operand has 89 places, 91 transitions, 822 flow. Second operand 6 states and 108 transitions. [2024-06-14 15:28:54,053 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 120 transitions, 1196 flow [2024-06-14 15:28:54,073 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 120 transitions, 1120 flow, removed 8 selfloop flow, removed 7 redundant places. [2024-06-14 15:28:54,075 INFO L231 Difference]: Finished difference. Result has 89 places, 100 transitions, 864 flow [2024-06-14 15:28:54,075 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=746, PETRI_DIFFERENCE_MINUEND_PLACES=82, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=78, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=864, PETRI_PLACES=89, PETRI_TRANSITIONS=100} [2024-06-14 15:28:54,075 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 47 predicate places. [2024-06-14 15:28:54,076 INFO L495 AbstractCegarLoop]: Abstraction has has 89 places, 100 transitions, 864 flow [2024-06-14 15:28:54,076 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.0) internal successors, (70), 7 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:28:54,076 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:28:54,076 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:54,076 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-06-14 15:28:54,076 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 15:28:54,077 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:28:54,077 INFO L85 PathProgramCache]: Analyzing trace with hash -1148217638, now seen corresponding path program 1 times [2024-06-14 15:28:54,077 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:28:54,077 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1724257696] [2024-06-14 15:28:54,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:28:54,077 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:28:54,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:29:03,099 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:03,101 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:29:03,101 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1724257696] [2024-06-14 15:29:03,103 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1724257696] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:29:03,103 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:29:03,103 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 15:29:03,103 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1359979346] [2024-06-14 15:29:03,103 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:29:03,104 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 15:29:03,106 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:29:03,106 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 15:29:03,106 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2024-06-14 15:29:03,274 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41 [2024-06-14 15:29:03,274 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 89 places, 100 transitions, 864 flow. Second operand has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 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:03,275 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:29:03,275 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41 [2024-06-14 15:29:03,275 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:29:04,565 INFO L124 PetriNetUnfolderBase]: 2078/3161 cut-off events. [2024-06-14 15:29:04,566 INFO L125 PetriNetUnfolderBase]: For 35276/35276 co-relation queries the response was YES. [2024-06-14 15:29:04,574 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15770 conditions, 3161 events. 2078/3161 cut-off events. For 35276/35276 co-relation queries the response was YES. Maximal size of possible extension queue 145. Compared 15357 event pairs, 653 based on Foata normal form. 4/3164 useless extension candidates. Maximal degree in co-relation 15727. Up to 3080 conditions per place. [2024-06-14 15:29:04,582 INFO L140 encePairwiseOnDemand]: 31/41 looper letters, 107 selfloop transitions, 17 changer transitions 0/127 dead transitions. [2024-06-14 15:29:04,583 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 127 transitions, 1204 flow [2024-06-14 15:29:04,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 15:29:04,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 15:29:04,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 133 transitions. [2024-06-14 15:29:04,587 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4054878048780488 [2024-06-14 15:29:04,587 INFO L175 Difference]: Start difference. First operand has 89 places, 100 transitions, 864 flow. Second operand 8 states and 133 transitions. [2024-06-14 15:29:04,588 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 96 places, 127 transitions, 1204 flow [2024-06-14 15:29:04,614 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 95 places, 127 transitions, 1182 flow, removed 10 selfloop flow, removed 1 redundant places. [2024-06-14 15:29:04,616 INFO L231 Difference]: Finished difference. Result has 96 places, 102 transitions, 917 flow [2024-06-14 15:29:04,617 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=842, PETRI_DIFFERENCE_MINUEND_PLACES=88, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=100, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=83, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=917, PETRI_PLACES=96, PETRI_TRANSITIONS=102} [2024-06-14 15:29:04,617 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 54 predicate places. [2024-06-14 15:29:04,618 INFO L495 AbstractCegarLoop]: Abstraction has has 96 places, 102 transitions, 917 flow [2024-06-14 15:29:04,618 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 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:04,618 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:29:04,618 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:04,618 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-06-14 15:29:04,620 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 15:29:04,620 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:29:04,620 INFO L85 PathProgramCache]: Analyzing trace with hash -1378433558, now seen corresponding path program 2 times [2024-06-14 15:29:04,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:29:04,621 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1686068867] [2024-06-14 15:29:04,621 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:29:04,621 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:29:04,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:29:14,256 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:29:14,257 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:29:14,257 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1686068867] [2024-06-14 15:29:14,257 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1686068867] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:29:14,257 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:29:14,273 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 15:29:14,273 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1156093565] [2024-06-14 15:29:14,273 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:29:14,274 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 15:29:14,274 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:29:14,274 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 15:29:14,275 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-06-14 15:29:14,404 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41 [2024-06-14 15:29:14,405 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 102 transitions, 917 flow. Second operand has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 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:14,405 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:29:14,405 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41 [2024-06-14 15:29:14,405 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:29:15,710 INFO L124 PetriNetUnfolderBase]: 2095/3188 cut-off events. [2024-06-14 15:29:15,710 INFO L125 PetriNetUnfolderBase]: For 39719/39719 co-relation queries the response was YES. [2024-06-14 15:29:15,719 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16293 conditions, 3188 events. 2095/3188 cut-off events. For 39719/39719 co-relation queries the response was YES. Maximal size of possible extension queue 146. Compared 15502 event pairs, 673 based on Foata normal form. 4/3191 useless extension candidates. Maximal degree in co-relation 16247. Up to 3121 conditions per place. [2024-06-14 15:29:15,727 INFO L140 encePairwiseOnDemand]: 30/41 looper letters, 110 selfloop transitions, 16 changer transitions 0/129 dead transitions. [2024-06-14 15:29:15,727 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 103 places, 129 transitions, 1267 flow [2024-06-14 15:29:15,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 15:29:15,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 15:29:15,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 133 transitions. [2024-06-14 15:29:15,732 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4054878048780488 [2024-06-14 15:29:15,732 INFO L175 Difference]: Start difference. First operand has 96 places, 102 transitions, 917 flow. Second operand 8 states and 133 transitions. [2024-06-14 15:29:15,732 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 103 places, 129 transitions, 1267 flow [2024-06-14 15:29:15,754 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 129 transitions, 1210 flow, removed 13 selfloop flow, removed 6 redundant places. [2024-06-14 15:29:15,763 INFO L231 Difference]: Finished difference. Result has 98 places, 104 transitions, 937 flow [2024-06-14 15:29:15,764 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=860, PETRI_DIFFERENCE_MINUEND_PLACES=90, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=102, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=86, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=937, PETRI_PLACES=98, PETRI_TRANSITIONS=104} [2024-06-14 15:29:15,764 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 56 predicate places. [2024-06-14 15:29:15,764 INFO L495 AbstractCegarLoop]: Abstraction has has 98 places, 104 transitions, 937 flow [2024-06-14 15:29:15,764 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 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:15,765 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:29:15,765 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:15,765 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-06-14 15:29:15,765 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 15:29:15,765 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:29:15,765 INFO L85 PathProgramCache]: Analyzing trace with hash -1148514308, now seen corresponding path program 3 times [2024-06-14 15:29:15,765 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:29:15,766 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [707800599] [2024-06-14 15:29:15,766 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:29:15,766 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:29:15,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:29:24,367 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:24,368 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:29:24,368 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [707800599] [2024-06-14 15:29:24,368 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [707800599] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:29:24,368 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:29:24,368 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 15:29:24,368 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [898351231] [2024-06-14 15:29:24,368 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:29:24,369 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 15:29:24,369 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:29:24,369 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 15:29:24,369 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2024-06-14 15:29:24,556 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41 [2024-06-14 15:29:24,556 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 104 transitions, 937 flow. Second operand has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 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:24,556 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:29:24,556 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41 [2024-06-14 15:29:24,556 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:29:25,872 INFO L124 PetriNetUnfolderBase]: 2112/3215 cut-off events. [2024-06-14 15:29:25,872 INFO L125 PetriNetUnfolderBase]: For 44216/44216 co-relation queries the response was YES. [2024-06-14 15:29:25,883 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16742 conditions, 3215 events. 2112/3215 cut-off events. For 44216/44216 co-relation queries the response was YES. Maximal size of possible extension queue 147. Compared 15663 event pairs, 673 based on Foata normal form. 4/3218 useless extension candidates. Maximal degree in co-relation 16695. Up to 3112 conditions per place. [2024-06-14 15:29:25,893 INFO L140 encePairwiseOnDemand]: 31/41 looper letters, 105 selfloop transitions, 23 changer transitions 0/131 dead transitions. [2024-06-14 15:29:25,894 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 105 places, 131 transitions, 1295 flow [2024-06-14 15:29:25,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 15:29:25,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 15:29:25,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 134 transitions. [2024-06-14 15:29:25,897 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.40853658536585363 [2024-06-14 15:29:25,897 INFO L175 Difference]: Start difference. First operand has 98 places, 104 transitions, 937 flow. Second operand 8 states and 134 transitions. [2024-06-14 15:29:25,897 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 105 places, 131 transitions, 1295 flow [2024-06-14 15:29:25,929 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 100 places, 131 transitions, 1238 flow, removed 15 selfloop flow, removed 5 redundant places. [2024-06-14 15:29:25,930 INFO L231 Difference]: Finished difference. Result has 101 places, 106 transitions, 978 flow [2024-06-14 15:29:25,931 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=880, PETRI_DIFFERENCE_MINUEND_PLACES=93, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=104, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=81, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=978, PETRI_PLACES=101, PETRI_TRANSITIONS=106} [2024-06-14 15:29:25,931 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 59 predicate places. [2024-06-14 15:29:25,931 INFO L495 AbstractCegarLoop]: Abstraction has has 101 places, 106 transitions, 978 flow [2024-06-14 15:29:25,931 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 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:25,932 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:29:25,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:29:25,932 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-06-14 15:29:25,932 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 15:29:25,932 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:29:25,932 INFO L85 PathProgramCache]: Analyzing trace with hash -1148514556, now seen corresponding path program 1 times [2024-06-14 15:29:25,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:29:25,933 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1599731931] [2024-06-14 15:29:25,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:29:25,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:29:25,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:29:34,493 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:34,493 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:29:34,493 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1599731931] [2024-06-14 15:29:34,493 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1599731931] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:29:34,493 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:29:34,494 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 15:29:34,494 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [121554374] [2024-06-14 15:29:34,494 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:29:34,494 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 15:29:34,494 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:29:34,494 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 15:29:34,494 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-06-14 15:29:34,671 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41 [2024-06-14 15:29:34,672 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 101 places, 106 transitions, 978 flow. Second operand has 9 states, 9 states have (on average 9.555555555555555) internal successors, (86), 9 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:29:34,672 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:29:34,672 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41 [2024-06-14 15:29:34,672 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:29:35,838 INFO L124 PetriNetUnfolderBase]: 2096/3188 cut-off events. [2024-06-14 15:29:35,838 INFO L125 PetriNetUnfolderBase]: For 47998/48000 co-relation queries the response was YES. [2024-06-14 15:29:35,848 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16910 conditions, 3188 events. 2096/3188 cut-off events. For 47998/48000 co-relation queries the response was YES. Maximal size of possible extension queue 144. Compared 15518 event pairs, 585 based on Foata normal form. 2/3189 useless extension candidates. Maximal degree in co-relation 16862. Up to 2938 conditions per place. [2024-06-14 15:29:35,857 INFO L140 encePairwiseOnDemand]: 31/41 looper letters, 95 selfloop transitions, 33 changer transitions 0/131 dead transitions. [2024-06-14 15:29:35,858 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 106 places, 131 transitions, 1304 flow [2024-06-14 15:29:35,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-14 15:29:35,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-14 15:29:35,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 118 transitions. [2024-06-14 15:29:35,861 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4796747967479675 [2024-06-14 15:29:35,861 INFO L175 Difference]: Start difference. First operand has 101 places, 106 transitions, 978 flow. Second operand 6 states and 118 transitions. [2024-06-14 15:29:35,862 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 106 places, 131 transitions, 1304 flow [2024-06-14 15:29:35,895 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 100 places, 131 transitions, 1218 flow, removed 23 selfloop flow, removed 6 redundant places. [2024-06-14 15:29:35,896 INFO L231 Difference]: Finished difference. Result has 101 places, 106 transitions, 974 flow [2024-06-14 15:29:35,897 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=892, PETRI_DIFFERENCE_MINUEND_PLACES=95, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=106, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=73, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=974, PETRI_PLACES=101, PETRI_TRANSITIONS=106} [2024-06-14 15:29:35,897 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 59 predicate places. [2024-06-14 15:29:35,897 INFO L495 AbstractCegarLoop]: Abstraction has has 101 places, 106 transitions, 974 flow [2024-06-14 15:29:35,898 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.555555555555555) internal successors, (86), 9 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:29:35,898 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:29:35,898 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:35,898 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-06-14 15:29:35,898 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 15:29:35,898 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:29:35,899 INFO L85 PathProgramCache]: Analyzing trace with hash 1726337442, now seen corresponding path program 4 times [2024-06-14 15:29:35,899 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:29:35,899 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1170698011] [2024-06-14 15:29:35,899 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:29:35,899 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:29:35,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:29:44,699 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:44,700 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:29:44,700 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1170698011] [2024-06-14 15:29:44,700 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1170698011] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:29:44,700 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:29:44,700 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 15:29:44,701 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1330054] [2024-06-14 15:29:44,701 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:29:44,701 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 15:29:44,701 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:29:44,702 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 15:29:44,702 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-06-14 15:29:44,915 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41 [2024-06-14 15:29:44,915 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 101 places, 106 transitions, 974 flow. Second operand has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 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:44,915 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:29:44,916 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41 [2024-06-14 15:29:44,916 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:29:46,241 INFO L124 PetriNetUnfolderBase]: 2088/3175 cut-off events. [2024-06-14 15:29:46,241 INFO L125 PetriNetUnfolderBase]: For 46885/46885 co-relation queries the response was YES. [2024-06-14 15:29:46,251 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16702 conditions, 3175 events. 2088/3175 cut-off events. For 46885/46885 co-relation queries the response was YES. Maximal size of possible extension queue 143. Compared 15370 event pairs, 671 based on Foata normal form. 4/3178 useless extension candidates. Maximal degree in co-relation 16653. Up to 3081 conditions per place. [2024-06-14 15:29:46,261 INFO L140 encePairwiseOnDemand]: 30/41 looper letters, 113 selfloop transitions, 21 changer transitions 0/137 dead transitions. [2024-06-14 15:29:46,262 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 108 places, 137 transitions, 1380 flow [2024-06-14 15:29:46,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 15:29:46,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 15:29:46,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 136 transitions. [2024-06-14 15:29:46,264 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4146341463414634 [2024-06-14 15:29:46,264 INFO L175 Difference]: Start difference. First operand has 101 places, 106 transitions, 974 flow. Second operand 8 states and 136 transitions. [2024-06-14 15:29:46,265 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 108 places, 137 transitions, 1380 flow [2024-06-14 15:29:46,300 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 103 places, 137 transitions, 1310 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-06-14 15:29:46,302 INFO L231 Difference]: Finished difference. Result has 105 places, 111 transitions, 1037 flow [2024-06-14 15:29:46,302 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=908, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=106, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=87, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1037, PETRI_PLACES=105, PETRI_TRANSITIONS=111} [2024-06-14 15:29:46,303 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 63 predicate places. [2024-06-14 15:29:46,303 INFO L495 AbstractCegarLoop]: Abstraction has has 105 places, 111 transitions, 1037 flow [2024-06-14 15:29:46,303 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 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:46,303 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:29:46,303 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:46,303 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-06-14 15:29:46,304 INFO L420 AbstractCegarLoop]: === Iteration 21 === 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:46,304 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:29:46,304 INFO L85 PathProgramCache]: Analyzing trace with hash -1803914321, now seen corresponding path program 2 times [2024-06-14 15:29:46,304 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:29:46,304 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1864240584] [2024-06-14 15:29:46,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:29:46,305 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:29:46,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:29:56,963 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:56,963 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:29:56,963 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1864240584] [2024-06-14 15:29:56,963 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1864240584] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:29:56,963 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:29:56,963 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-14 15:29:56,964 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [921275197] [2024-06-14 15:29:56,964 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:29:56,964 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-14 15:29:56,964 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:29:56,964 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-14 15:29:56,964 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-06-14 15:29:57,072 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41 [2024-06-14 15:29:57,072 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 105 places, 111 transitions, 1037 flow. Second operand has 7 states, 7 states have (on average 10.0) internal successors, (70), 7 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:29:57,072 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:29:57,072 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41 [2024-06-14 15:29:57,072 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:29:58,226 INFO L124 PetriNetUnfolderBase]: 2079/3163 cut-off events. [2024-06-14 15:29:58,227 INFO L125 PetriNetUnfolderBase]: For 50976/50976 co-relation queries the response was YES. [2024-06-14 15:29:58,238 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16978 conditions, 3163 events. 2079/3163 cut-off events. For 50976/50976 co-relation queries the response was YES. Maximal size of possible extension queue 143. Compared 15302 event pairs, 669 based on Foata normal form. 3/3165 useless extension candidates. Maximal degree in co-relation 16927. Up to 3138 conditions per place. [2024-06-14 15:29:58,248 INFO L140 encePairwiseOnDemand]: 32/41 looper letters, 108 selfloop transitions, 11 changer transitions 0/122 dead transitions. [2024-06-14 15:29:58,248 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 110 places, 122 transitions, 1303 flow [2024-06-14 15:29:58,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-14 15:29:58,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-14 15:29:58,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 97 transitions. [2024-06-14 15:29:58,249 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3943089430894309 [2024-06-14 15:29:58,249 INFO L175 Difference]: Start difference. First operand has 105 places, 111 transitions, 1037 flow. Second operand 6 states and 97 transitions. [2024-06-14 15:29:58,250 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 110 places, 122 transitions, 1303 flow [2024-06-14 15:29:58,298 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 105 places, 122 transitions, 1210 flow, removed 28 selfloop flow, removed 5 redundant places. [2024-06-14 15:29:58,317 INFO L231 Difference]: Finished difference. Result has 106 places, 111 transitions, 972 flow [2024-06-14 15:29:58,317 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=944, PETRI_DIFFERENCE_MINUEND_PLACES=100, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=111, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=100, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=972, PETRI_PLACES=106, PETRI_TRANSITIONS=111} [2024-06-14 15:29:58,318 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 64 predicate places. [2024-06-14 15:29:58,318 INFO L495 AbstractCegarLoop]: Abstraction has has 106 places, 111 transitions, 972 flow [2024-06-14 15:29:58,318 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.0) internal successors, (70), 7 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:29:58,318 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:29:58,318 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:58,319 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-06-14 15:29:58,319 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:29:58,319 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:29:58,319 INFO L85 PathProgramCache]: Analyzing trace with hash -1804115759, now seen corresponding path program 1 times [2024-06-14 15:29:58,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:29:58,319 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1662738062] [2024-06-14 15:29:58,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:29:58,320 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:29:58,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:30:12,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:30:12,703 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:30:12,703 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1662738062] [2024-06-14 15:30:12,703 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1662738062] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:30:12,703 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:30:12,703 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-14 15:30:12,703 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [592616181] [2024-06-14 15:30:12,703 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:30:12,704 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-14 15:30:12,704 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:30:12,704 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-14 15:30:12,704 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-06-14 15:30:12,839 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41 [2024-06-14 15:30:12,839 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 106 places, 111 transitions, 972 flow. Second operand has 7 states, 7 states have (on average 10.0) internal successors, (70), 7 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:30:12,839 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:30:12,839 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41 [2024-06-14 15:30:12,839 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:30:14,145 INFO L124 PetriNetUnfolderBase]: 2094/3184 cut-off events. [2024-06-14 15:30:14,146 INFO L125 PetriNetUnfolderBase]: For 53822/53822 co-relation queries the response was YES. [2024-06-14 15:30:14,157 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17052 conditions, 3184 events. 2094/3184 cut-off events. For 53822/53822 co-relation queries the response was YES. Maximal size of possible extension queue 143. Compared 15459 event pairs, 668 based on Foata normal form. 3/3186 useless extension candidates. Maximal degree in co-relation 17000. Up to 3126 conditions per place. [2024-06-14 15:30:14,166 INFO L140 encePairwiseOnDemand]: 33/41 looper letters, 114 selfloop transitions, 18 changer transitions 0/135 dead transitions. [2024-06-14 15:30:14,167 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 111 places, 135 transitions, 1372 flow [2024-06-14 15:30:14,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-14 15:30:14,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-14 15:30:14,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 107 transitions. [2024-06-14 15:30:14,168 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4349593495934959 [2024-06-14 15:30:14,168 INFO L175 Difference]: Start difference. First operand has 106 places, 111 transitions, 972 flow. Second operand 6 states and 107 transitions. [2024-06-14 15:30:14,168 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 111 places, 135 transitions, 1372 flow [2024-06-14 15:30:14,200 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 106 places, 135 transitions, 1338 flow, removed 3 selfloop flow, removed 5 redundant places. [2024-06-14 15:30:14,202 INFO L231 Difference]: Finished difference. Result has 107 places, 117 transitions, 1034 flow [2024-06-14 15:30:14,202 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=938, PETRI_DIFFERENCE_MINUEND_PLACES=101, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=111, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=96, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1034, PETRI_PLACES=107, PETRI_TRANSITIONS=117} [2024-06-14 15:30:14,203 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 65 predicate places. [2024-06-14 15:30:14,203 INFO L495 AbstractCegarLoop]: Abstraction has has 107 places, 117 transitions, 1034 flow [2024-06-14 15:30:14,203 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.0) internal successors, (70), 7 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:30:14,203 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:30:14,203 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:30:14,203 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-06-14 15:30:14,204 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:14,204 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:30:14,204 INFO L85 PathProgramCache]: Analyzing trace with hash -773437679, now seen corresponding path program 2 times [2024-06-14 15:30:14,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:30:14,204 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [232532253] [2024-06-14 15:30:14,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:30:14,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:30:14,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:30:28,206 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:28,207 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:30:28,207 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [232532253] [2024-06-14 15:30:28,207 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [232532253] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:30:28,207 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:30:28,207 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-14 15:30:28,208 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1189068803] [2024-06-14 15:30:28,208 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:30:28,210 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-14 15:30:28,210 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:30:28,210 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-14 15:30:28,210 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-06-14 15:30:28,288 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41 [2024-06-14 15:30:28,289 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 107 places, 117 transitions, 1034 flow. Second operand has 7 states, 7 states have (on average 10.0) internal successors, (70), 7 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:30:28,289 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:30:28,289 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41 [2024-06-14 15:30:28,289 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:30:29,457 INFO L124 PetriNetUnfolderBase]: 2085/3173 cut-off events. [2024-06-14 15:30:29,457 INFO L125 PetriNetUnfolderBase]: For 57947/57949 co-relation queries the response was YES. [2024-06-14 15:30:29,469 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17459 conditions, 3173 events. 2085/3173 cut-off events. For 57947/57949 co-relation queries the response was YES. Maximal size of possible extension queue 143. Compared 15418 event pairs, 667 based on Foata normal form. 5/3177 useless extension candidates. Maximal degree in co-relation 17407. Up to 3119 conditions per place. [2024-06-14 15:30:29,479 INFO L140 encePairwiseOnDemand]: 33/41 looper letters, 109 selfloop transitions, 18 changer transitions 0/130 dead transitions. [2024-06-14 15:30:29,480 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 112 places, 130 transitions, 1322 flow [2024-06-14 15:30:29,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-14 15:30:29,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-14 15:30:29,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 101 transitions. [2024-06-14 15:30:29,481 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4105691056910569 [2024-06-14 15:30:29,481 INFO L175 Difference]: Start difference. First operand has 107 places, 117 transitions, 1034 flow. Second operand 6 states and 101 transitions. [2024-06-14 15:30:29,481 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 112 places, 130 transitions, 1322 flow [2024-06-14 15:30:29,535 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 110 places, 130 transitions, 1280 flow, removed 16 selfloop flow, removed 2 redundant places. [2024-06-14 15:30:29,536 INFO L231 Difference]: Finished difference. Result has 111 places, 117 transitions, 1035 flow [2024-06-14 15:30:29,537 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=992, PETRI_DIFFERENCE_MINUEND_PLACES=105, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=117, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=99, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1035, PETRI_PLACES=111, PETRI_TRANSITIONS=117} [2024-06-14 15:30:29,537 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 69 predicate places. [2024-06-14 15:30:29,537 INFO L495 AbstractCegarLoop]: Abstraction has has 111 places, 117 transitions, 1035 flow [2024-06-14 15:30:29,538 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.0) internal successors, (70), 7 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:30:29,538 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:30:29,538 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:29,538 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-06-14 15:30:29,538 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 15:30:29,538 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:30:29,539 INFO L85 PathProgramCache]: Analyzing trace with hash -441330069, now seen corresponding path program 1 times [2024-06-14 15:30:29,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:30:29,539 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [533630471] [2024-06-14 15:30:29,539 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:30:29,539 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:30:29,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:30:40,753 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:40,754 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:30:40,754 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [533630471] [2024-06-14 15:30:40,754 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [533630471] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:30:40,754 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:30:40,754 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-14 15:30:40,754 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [224086278] [2024-06-14 15:30:40,754 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:30:40,755 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-14 15:30:40,755 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:30:40,755 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-14 15:30:40,755 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-06-14 15:30:40,880 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41 [2024-06-14 15:30:40,881 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 111 places, 117 transitions, 1035 flow. Second operand has 8 states, 8 states have (on average 9.875) internal successors, (79), 8 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:30:40,881 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:30:40,881 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41 [2024-06-14 15:30:40,881 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:30:42,054 INFO L124 PetriNetUnfolderBase]: 2187/3314 cut-off events. [2024-06-14 15:30:42,054 INFO L125 PetriNetUnfolderBase]: For 64736/64738 co-relation queries the response was YES. [2024-06-14 15:30:42,067 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18304 conditions, 3314 events. 2187/3314 cut-off events. For 64736/64738 co-relation queries the response was YES. Maximal size of possible extension queue 155. Compared 16166 event pairs, 621 based on Foata normal form. 8/3321 useless extension candidates. Maximal degree in co-relation 18250. Up to 3069 conditions per place. [2024-06-14 15:30:42,078 INFO L140 encePairwiseOnDemand]: 30/41 looper letters, 130 selfloop transitions, 36 changer transitions 0/169 dead transitions. [2024-06-14 15:30:42,078 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 117 places, 169 transitions, 1735 flow [2024-06-14 15:30:42,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-14 15:30:42,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-14 15:30:42,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 135 transitions. [2024-06-14 15:30:42,080 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47038327526132406 [2024-06-14 15:30:42,080 INFO L175 Difference]: Start difference. First operand has 111 places, 117 transitions, 1035 flow. Second operand 7 states and 135 transitions. [2024-06-14 15:30:42,080 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 117 places, 169 transitions, 1735 flow [2024-06-14 15:30:42,121 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 111 places, 169 transitions, 1671 flow, removed 6 selfloop flow, removed 6 redundant places. [2024-06-14 15:30:42,123 INFO L231 Difference]: Finished difference. Result has 115 places, 138 transitions, 1312 flow [2024-06-14 15:30:42,124 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=985, PETRI_DIFFERENCE_MINUEND_PLACES=105, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=117, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=88, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1312, PETRI_PLACES=115, PETRI_TRANSITIONS=138} [2024-06-14 15:30:42,124 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 73 predicate places. [2024-06-14 15:30:42,124 INFO L495 AbstractCegarLoop]: Abstraction has has 115 places, 138 transitions, 1312 flow [2024-06-14 15:30:42,124 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.875) internal successors, (79), 8 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:30:42,124 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:30:42,125 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:42,125 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-06-14 15:30:42,125 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:42,125 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:30:42,125 INFO L85 PathProgramCache]: Analyzing trace with hash -1405770594, now seen corresponding path program 1 times [2024-06-14 15:30:42,125 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:30:42,126 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1538598199] [2024-06-14 15:30:42,126 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:30:42,126 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:30:42,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:30:50,861 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:50,862 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:30:50,862 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1538598199] [2024-06-14 15:30:50,862 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1538598199] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:30:50,862 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:30:50,862 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 15:30:50,862 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2110630789] [2024-06-14 15:30:50,863 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:30:50,863 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 15:30:50,863 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:30:50,863 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 15:30:50,864 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-14 15:30:51,027 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41 [2024-06-14 15:30:51,028 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 115 places, 138 transitions, 1312 flow. Second operand has 9 states, 9 states have (on average 9.666666666666666) internal successors, (87), 9 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:30:51,028 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:30:51,028 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41 [2024-06-14 15:30:51,028 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:30:52,353 INFO L124 PetriNetUnfolderBase]: 2226/3373 cut-off events. [2024-06-14 15:30:52,354 INFO L125 PetriNetUnfolderBase]: For 71398/71400 co-relation queries the response was YES. [2024-06-14 15:30:52,365 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19837 conditions, 3373 events. 2226/3373 cut-off events. For 71398/71400 co-relation queries the response was YES. Maximal size of possible extension queue 157. Compared 16489 event pairs, 619 based on Foata normal form. 4/3376 useless extension candidates. Maximal degree in co-relation 19780. Up to 3119 conditions per place. [2024-06-14 15:30:52,375 INFO L140 encePairwiseOnDemand]: 29/41 looper letters, 138 selfloop transitions, 37 changer transitions 0/178 dead transitions. [2024-06-14 15:30:52,375 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 122 places, 178 transitions, 1838 flow [2024-06-14 15:30:52,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 15:30:52,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 15:30:52,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 148 transitions. [2024-06-14 15:30:52,378 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45121951219512196 [2024-06-14 15:30:52,378 INFO L175 Difference]: Start difference. First operand has 115 places, 138 transitions, 1312 flow. Second operand 8 states and 148 transitions. [2024-06-14 15:30:52,378 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 122 places, 178 transitions, 1838 flow [2024-06-14 15:30:52,426 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 121 places, 178 transitions, 1786 flow, removed 25 selfloop flow, removed 1 redundant places. [2024-06-14 15:30:52,430 INFO L231 Difference]: Finished difference. Result has 123 places, 144 transitions, 1441 flow [2024-06-14 15:30:52,430 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=1266, PETRI_DIFFERENCE_MINUEND_PLACES=114, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=138, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=104, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1441, PETRI_PLACES=123, PETRI_TRANSITIONS=144} [2024-06-14 15:30:52,431 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 81 predicate places. [2024-06-14 15:30:52,432 INFO L495 AbstractCegarLoop]: Abstraction has has 123 places, 144 transitions, 1441 flow [2024-06-14 15:30:52,432 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.666666666666666) internal successors, (87), 9 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:30:52,432 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:30:52,432 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:52,432 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-06-14 15:30:52,432 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 15:30:52,434 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:30:52,434 INFO L85 PathProgramCache]: Analyzing trace with hash 1613980790, now seen corresponding path program 2 times [2024-06-14 15:30:52,434 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:30:52,434 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1165686800] [2024-06-14 15:30:52,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:30:52,434 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:30:52,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:31:02,687 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:31:02,688 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:31:02,688 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1165686800] [2024-06-14 15:31:02,689 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1165686800] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:31:02,689 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:31:02,689 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 15:31:02,689 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [573986263] [2024-06-14 15:31:02,689 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:31:02,690 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 15:31:02,690 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:31:02,690 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 15:31:02,690 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-14 15:31:02,853 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41 [2024-06-14 15:31:02,853 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 123 places, 144 transitions, 1441 flow. Second operand has 10 states, 10 states have (on average 9.5) internal successors, (95), 10 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:31:02,853 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:31:02,853 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41 [2024-06-14 15:31:02,853 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:31:04,300 INFO L124 PetriNetUnfolderBase]: 2265/3432 cut-off events. [2024-06-14 15:31:04,301 INFO L125 PetriNetUnfolderBase]: For 77504/77506 co-relation queries the response was YES. [2024-06-14 15:31:04,315 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20670 conditions, 3432 events. 2265/3432 cut-off events. For 77504/77506 co-relation queries the response was YES. Maximal size of possible extension queue 159. Compared 16869 event pairs, 625 based on Foata normal form. 4/3435 useless extension candidates. Maximal degree in co-relation 20609. Up to 3165 conditions per place. [2024-06-14 15:31:04,327 INFO L140 encePairwiseOnDemand]: 30/41 looper letters, 140 selfloop transitions, 38 changer transitions 0/181 dead transitions. [2024-06-14 15:31:04,327 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 130 places, 181 transitions, 1978 flow [2024-06-14 15:31:04,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 15:31:04,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 15:31:04,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 144 transitions. [2024-06-14 15:31:04,330 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43902439024390244 [2024-06-14 15:31:04,330 INFO L175 Difference]: Start difference. First operand has 123 places, 144 transitions, 1441 flow. Second operand 8 states and 144 transitions. [2024-06-14 15:31:04,330 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 130 places, 181 transitions, 1978 flow [2024-06-14 15:31:04,471 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 125 places, 181 transitions, 1867 flow, removed 17 selfloop flow, removed 5 redundant places. [2024-06-14 15:31:04,474 INFO L231 Difference]: Finished difference. Result has 127 places, 151 transitions, 1537 flow [2024-06-14 15:31:04,474 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=1338, PETRI_DIFFERENCE_MINUEND_PLACES=118, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=144, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=110, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1537, PETRI_PLACES=127, PETRI_TRANSITIONS=151} [2024-06-14 15:31:04,474 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 85 predicate places. [2024-06-14 15:31:04,474 INFO L495 AbstractCegarLoop]: Abstraction has has 127 places, 151 transitions, 1537 flow [2024-06-14 15:31:04,475 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.5) internal successors, (95), 10 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:31:04,475 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:31:04,475 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:04,475 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-06-14 15:31:04,475 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 15:31:04,476 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:31:04,476 INFO L85 PathProgramCache]: Analyzing trace with hash 1613988230, now seen corresponding path program 3 times [2024-06-14 15:31:04,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:31:04,476 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [686200858] [2024-06-14 15:31:04,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:31:04,476 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:31:04,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:31:13,981 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:31:13,981 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:31:13,982 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [686200858] [2024-06-14 15:31:13,982 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [686200858] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:31:13,982 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:31:13,982 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 15:31:13,982 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1699750164] [2024-06-14 15:31:13,982 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:31:13,982 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 15:31:13,983 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:31:13,983 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 15:31:13,983 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-14 15:31:14,279 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41 [2024-06-14 15:31:14,280 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 127 places, 151 transitions, 1537 flow. Second operand has 10 states, 10 states have (on average 9.5) internal successors, (95), 10 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:31:14,280 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:31:14,280 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41 [2024-06-14 15:31:14,280 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:31:15,621 INFO L124 PetriNetUnfolderBase]: 2282/3459 cut-off events. [2024-06-14 15:31:15,622 INFO L125 PetriNetUnfolderBase]: For 83916/83918 co-relation queries the response was YES. [2024-06-14 15:31:15,634 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21184 conditions, 3459 events. 2282/3459 cut-off events. For 83916/83918 co-relation queries the response was YES. Maximal size of possible extension queue 161. Compared 17041 event pairs, 611 based on Foata normal form. 4/3462 useless extension candidates. Maximal degree in co-relation 21121. Up to 3087 conditions per place. [2024-06-14 15:31:15,643 INFO L140 encePairwiseOnDemand]: 30/41 looper letters, 137 selfloop transitions, 45 changer transitions 0/185 dead transitions. [2024-06-14 15:31:15,644 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 134 places, 185 transitions, 2047 flow [2024-06-14 15:31:15,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 15:31:15,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 15:31:15,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 144 transitions. [2024-06-14 15:31:15,645 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43902439024390244 [2024-06-14 15:31:15,646 INFO L175 Difference]: Start difference. First operand has 127 places, 151 transitions, 1537 flow. Second operand 8 states and 144 transitions. [2024-06-14 15:31:15,646 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 134 places, 185 transitions, 2047 flow [2024-06-14 15:31:15,708 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 131 places, 185 transitions, 1967 flow, removed 21 selfloop flow, removed 3 redundant places. [2024-06-14 15:31:15,711 INFO L231 Difference]: Finished difference. Result has 133 places, 155 transitions, 1642 flow [2024-06-14 15:31:15,711 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=1457, PETRI_DIFFERENCE_MINUEND_PLACES=124, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=151, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=42, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=107, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1642, PETRI_PLACES=133, PETRI_TRANSITIONS=155} [2024-06-14 15:31:15,711 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 91 predicate places. [2024-06-14 15:31:15,711 INFO L495 AbstractCegarLoop]: Abstraction has has 133 places, 155 transitions, 1642 flow [2024-06-14 15:31:15,712 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.5) internal successors, (95), 10 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:31:15,712 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:31:15,712 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:15,712 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-06-14 15:31:15,712 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:15,712 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:31:15,712 INFO L85 PathProgramCache]: Analyzing trace with hash -441031539, now seen corresponding path program 2 times [2024-06-14 15:31:15,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:31:15,713 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [127075958] [2024-06-14 15:31:15,713 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:31:15,713 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:31:15,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:31:26,595 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:31:26,596 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:31:26,596 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [127075958] [2024-06-14 15:31:26,596 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [127075958] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:31:26,596 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:31:26,596 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-14 15:31:26,597 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1862110840] [2024-06-14 15:31:26,597 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:31:26,597 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-14 15:31:26,597 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:31:26,597 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-14 15:31:26,598 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-06-14 15:31:26,750 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41 [2024-06-14 15:31:26,751 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 133 places, 155 transitions, 1642 flow. Second operand has 8 states, 8 states have (on average 9.875) internal successors, (79), 8 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:31:26,751 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:31:26,751 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41 [2024-06-14 15:31:26,751 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:31:28,036 INFO L124 PetriNetUnfolderBase]: 2366/3576 cut-off events. [2024-06-14 15:31:28,036 INFO L125 PetriNetUnfolderBase]: For 92954/92956 co-relation queries the response was YES. [2024-06-14 15:31:28,052 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22369 conditions, 3576 events. 2366/3576 cut-off events. For 92954/92956 co-relation queries the response was YES. Maximal size of possible extension queue 173. Compared 17663 event pairs, 668 based on Foata normal form. 8/3583 useless extension candidates. Maximal degree in co-relation 22304. Up to 3276 conditions per place. [2024-06-14 15:31:28,065 INFO L140 encePairwiseOnDemand]: 30/41 looper letters, 143 selfloop transitions, 41 changer transitions 0/187 dead transitions. [2024-06-14 15:31:28,065 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 139 places, 187 transitions, 2272 flow [2024-06-14 15:31:28,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-14 15:31:28,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-14 15:31:28,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 129 transitions. [2024-06-14 15:31:28,066 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44947735191637633 [2024-06-14 15:31:28,066 INFO L175 Difference]: Start difference. First operand has 133 places, 155 transitions, 1642 flow. Second operand 7 states and 129 transitions. [2024-06-14 15:31:28,067 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 139 places, 187 transitions, 2272 flow [2024-06-14 15:31:28,155 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 135 places, 187 transitions, 2177 flow, removed 27 selfloop flow, removed 4 redundant places. [2024-06-14 15:31:28,158 INFO L231 Difference]: Finished difference. Result has 137 places, 163 transitions, 1741 flow [2024-06-14 15:31:28,159 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=1547, PETRI_DIFFERENCE_MINUEND_PLACES=129, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=155, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=120, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1741, PETRI_PLACES=137, PETRI_TRANSITIONS=163} [2024-06-14 15:31:28,163 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 95 predicate places. [2024-06-14 15:31:28,164 INFO L495 AbstractCegarLoop]: Abstraction has has 137 places, 163 transitions, 1741 flow [2024-06-14 15:31:28,164 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.875) internal successors, (79), 8 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:31:28,164 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:31:28,164 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:28,164 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-06-14 15:31:28,164 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 15:31:28,165 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:31:28,165 INFO L85 PathProgramCache]: Analyzing trace with hash -690892146, now seen corresponding path program 4 times [2024-06-14 15:31:28,165 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:31:28,165 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1363875992] [2024-06-14 15:31:28,165 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:31:28,165 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:31:28,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:31:36,767 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:31:36,767 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:31:36,767 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1363875992] [2024-06-14 15:31:36,767 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1363875992] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:31:36,767 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:31:36,767 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 15:31:36,780 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [865493544] [2024-06-14 15:31:36,794 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:31:36,795 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 15:31:36,795 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:31:36,795 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 15:31:36,795 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-06-14 15:31:36,968 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41 [2024-06-14 15:31:36,969 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 137 places, 163 transitions, 1741 flow. Second operand has 10 states, 10 states have (on average 9.5) internal successors, (95), 10 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:31:36,969 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:31:36,969 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41 [2024-06-14 15:31:36,969 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:31:38,443 INFO L124 PetriNetUnfolderBase]: 2383/3603 cut-off events. [2024-06-14 15:31:38,443 INFO L125 PetriNetUnfolderBase]: For 98045/98047 co-relation queries the response was YES. [2024-06-14 15:31:38,460 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22920 conditions, 3603 events. 2383/3603 cut-off events. For 98045/98047 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 17827 event pairs, 643 based on Foata normal form. 4/3606 useless extension candidates. Maximal degree in co-relation 22852. Up to 3300 conditions per place. [2024-06-14 15:31:38,472 INFO L140 encePairwiseOnDemand]: 30/41 looper letters, 146 selfloop transitions, 44 changer transitions 0/193 dead transitions. [2024-06-14 15:31:38,472 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 143 places, 193 transitions, 2241 flow [2024-06-14 15:31:38,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-14 15:31:38,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-14 15:31:38,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 132 transitions. [2024-06-14 15:31:38,475 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45993031358885017 [2024-06-14 15:31:38,475 INFO L175 Difference]: Start difference. First operand has 137 places, 163 transitions, 1741 flow. Second operand 7 states and 132 transitions. [2024-06-14 15:31:38,475 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 143 places, 193 transitions, 2241 flow [2024-06-14 15:31:38,581 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 140 places, 193 transitions, 2172 flow, removed 14 selfloop flow, removed 3 redundant places. [2024-06-14 15:31:38,583 INFO L231 Difference]: Finished difference. Result has 141 places, 165 transitions, 1823 flow [2024-06-14 15:31:38,583 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=1672, PETRI_DIFFERENCE_MINUEND_PLACES=134, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=163, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=42, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=119, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1823, PETRI_PLACES=141, PETRI_TRANSITIONS=165} [2024-06-14 15:31:38,584 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 99 predicate places. [2024-06-14 15:31:38,584 INFO L495 AbstractCegarLoop]: Abstraction has has 141 places, 165 transitions, 1823 flow [2024-06-14 15:31:38,584 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.5) internal successors, (95), 10 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:31:38,584 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:31:38,585 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:38,585 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-06-14 15:31:38,585 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 15:31:38,585 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:31:38,585 INFO L85 PathProgramCache]: Analyzing trace with hash 1325595402, now seen corresponding path program 5 times [2024-06-14 15:31:38,585 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:31:38,586 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [456419482] [2024-06-14 15:31:38,586 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:31:38,586 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:31:38,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:31:48,380 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:48,381 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:31:48,381 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [456419482] [2024-06-14 15:31:48,381 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [456419482] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:31:48,381 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:31:48,381 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 15:31:48,381 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1921072394] [2024-06-14 15:31:48,381 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:31:48,382 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 15:31:48,382 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:31:48,382 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 15:31:48,382 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-06-14 15:31:48,566 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41 [2024-06-14 15:31:48,567 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 141 places, 165 transitions, 1823 flow. Second operand has 10 states, 10 states have (on average 9.5) internal successors, (95), 10 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:31:48,567 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:31:48,567 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41 [2024-06-14 15:31:48,567 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:31:49,885 INFO L124 PetriNetUnfolderBase]: 2400/3630 cut-off events. [2024-06-14 15:31:49,885 INFO L125 PetriNetUnfolderBase]: For 105986/105988 co-relation queries the response was YES. [2024-06-14 15:31:49,903 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23405 conditions, 3630 events. 2400/3630 cut-off events. For 105986/105988 co-relation queries the response was YES. Maximal size of possible extension queue 177. Compared 18028 event pairs, 637 based on Foata normal form. 4/3633 useless extension candidates. Maximal degree in co-relation 23336. Up to 3199 conditions per place. [2024-06-14 15:31:49,916 INFO L140 encePairwiseOnDemand]: 31/41 looper letters, 141 selfloop transitions, 48 changer transitions 0/192 dead transitions. [2024-06-14 15:31:49,917 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 147 places, 192 transitions, 2315 flow [2024-06-14 15:31:49,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-14 15:31:49,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-14 15:31:49,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 127 transitions. [2024-06-14 15:31:49,919 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4425087108013937 [2024-06-14 15:31:49,919 INFO L175 Difference]: Start difference. First operand has 141 places, 165 transitions, 1823 flow. Second operand 7 states and 127 transitions. [2024-06-14 15:31:49,919 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 147 places, 192 transitions, 2315 flow [2024-06-14 15:31:50,017 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 142 places, 192 transitions, 2204 flow, removed 16 selfloop flow, removed 5 redundant places. [2024-06-14 15:31:50,020 INFO L231 Difference]: Finished difference. Result has 143 places, 167 transitions, 1873 flow [2024-06-14 15:31:50,020 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=1712, PETRI_DIFFERENCE_MINUEND_PLACES=136, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=165, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=46, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=117, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1873, PETRI_PLACES=143, PETRI_TRANSITIONS=167} [2024-06-14 15:31:50,021 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 101 predicate places. [2024-06-14 15:31:50,021 INFO L495 AbstractCegarLoop]: Abstraction has has 143 places, 167 transitions, 1873 flow [2024-06-14 15:31:50,021 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.5) internal successors, (95), 10 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:31:50,021 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:31:50,021 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:50,021 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-06-14 15:31:50,022 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 15:31:50,022 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:31:50,022 INFO L85 PathProgramCache]: Analyzing trace with hash 1591292682, now seen corresponding path program 6 times [2024-06-14 15:31:50,022 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:31:50,022 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1301866250] [2024-06-14 15:31:50,022 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:31:50,022 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:31:50,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:31:59,064 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:59,065 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:31:59,065 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1301866250] [2024-06-14 15:31:59,065 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1301866250] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:31:59,065 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:31:59,065 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 15:31:59,065 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2134281990] [2024-06-14 15:31:59,065 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:31:59,066 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 15:31:59,066 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:31:59,066 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 15:31:59,066 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-06-14 15:31:59,241 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41 [2024-06-14 15:31:59,242 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 143 places, 167 transitions, 1873 flow. Second operand has 10 states, 10 states have (on average 9.5) internal successors, (95), 10 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:31:59,242 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:31:59,242 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41 [2024-06-14 15:31:59,242 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:32:00,722 INFO L124 PetriNetUnfolderBase]: 2417/3657 cut-off events. [2024-06-14 15:32:00,722 INFO L125 PetriNetUnfolderBase]: For 113252/113254 co-relation queries the response was YES. [2024-06-14 15:32:00,737 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23938 conditions, 3657 events. 2417/3657 cut-off events. For 113252/113254 co-relation queries the response was YES. Maximal size of possible extension queue 179. Compared 18202 event pairs, 675 based on Foata normal form. 4/3660 useless extension candidates. Maximal degree in co-relation 23868. Up to 3552 conditions per place. [2024-06-14 15:32:00,749 INFO L140 encePairwiseOnDemand]: 32/41 looper letters, 171 selfloop transitions, 17 changer transitions 0/191 dead transitions. [2024-06-14 15:32:00,749 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 149 places, 191 transitions, 2357 flow [2024-06-14 15:32:00,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-14 15:32:00,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-14 15:32:00,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 120 transitions. [2024-06-14 15:32:00,752 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4181184668989547 [2024-06-14 15:32:00,752 INFO L175 Difference]: Start difference. First operand has 143 places, 167 transitions, 1873 flow. Second operand 7 states and 120 transitions. [2024-06-14 15:32:00,752 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 149 places, 191 transitions, 2357 flow [2024-06-14 15:32:00,866 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 144 places, 191 transitions, 2218 flow, removed 25 selfloop flow, removed 5 redundant places. [2024-06-14 15:32:00,869 INFO L231 Difference]: Finished difference. Result has 145 places, 169 transitions, 1833 flow [2024-06-14 15:32:00,869 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=1736, PETRI_DIFFERENCE_MINUEND_PLACES=138, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=167, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=150, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1833, PETRI_PLACES=145, PETRI_TRANSITIONS=169} [2024-06-14 15:32:00,870 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 103 predicate places. [2024-06-14 15:32:00,870 INFO L495 AbstractCegarLoop]: Abstraction has has 145 places, 169 transitions, 1833 flow [2024-06-14 15:32:00,870 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.5) internal successors, (95), 10 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:32:00,870 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:32:00,870 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:32:00,870 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-06-14 15:32:00,871 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 15:32:00,871 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:32:00,871 INFO L85 PathProgramCache]: Analyzing trace with hash 1582095912, now seen corresponding path program 7 times [2024-06-14 15:32:00,871 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:32:00,871 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [129221915] [2024-06-14 15:32:00,871 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:32:00,871 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:32:00,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:32:09,961 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:09,962 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:32:09,962 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [129221915] [2024-06-14 15:32:09,962 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [129221915] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:32:09,962 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:32:09,963 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 15:32:09,963 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1561257549] [2024-06-14 15:32:09,963 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:32:09,964 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 15:32:09,967 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:32:09,967 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 15:32:09,967 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-06-14 15:32:10,211 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41 [2024-06-14 15:32:10,212 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 145 places, 169 transitions, 1833 flow. Second operand has 10 states, 10 states have (on average 9.5) internal successors, (95), 10 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:32:10,212 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:32:10,212 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41 [2024-06-14 15:32:10,212 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:32:11,710 INFO L124 PetriNetUnfolderBase]: 2434/3684 cut-off events. [2024-06-14 15:32:11,710 INFO L125 PetriNetUnfolderBase]: For 113767/113769 co-relation queries the response was YES. [2024-06-14 15:32:11,725 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23963 conditions, 3684 events. 2434/3684 cut-off events. For 113767/113769 co-relation queries the response was YES. Maximal size of possible extension queue 181. Compared 18367 event pairs, 641 based on Foata normal form. 4/3687 useless extension candidates. Maximal degree in co-relation 23892. Up to 3161 conditions per place. [2024-06-14 15:32:11,736 INFO L140 encePairwiseOnDemand]: 32/41 looper letters, 136 selfloop transitions, 61 changer transitions 0/200 dead transitions. [2024-06-14 15:32:11,736 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 151 places, 200 transitions, 2513 flow [2024-06-14 15:32:11,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-14 15:32:11,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-14 15:32:11,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 130 transitions. [2024-06-14 15:32:11,739 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4529616724738676 [2024-06-14 15:32:11,739 INFO L175 Difference]: Start difference. First operand has 145 places, 169 transitions, 1833 flow. Second operand 7 states and 130 transitions. [2024-06-14 15:32:11,739 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 151 places, 200 transitions, 2513 flow [2024-06-14 15:32:11,847 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 146 places, 200 transitions, 2434 flow, removed 24 selfloop flow, removed 5 redundant places. [2024-06-14 15:32:11,849 INFO L231 Difference]: Finished difference. Result has 147 places, 173 transitions, 2006 flow [2024-06-14 15:32:11,849 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=1754, PETRI_DIFFERENCE_MINUEND_PLACES=140, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=169, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=59, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=110, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2006, PETRI_PLACES=147, PETRI_TRANSITIONS=173} [2024-06-14 15:32:11,850 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 105 predicate places. [2024-06-14 15:32:11,850 INFO L495 AbstractCegarLoop]: Abstraction has has 147 places, 173 transitions, 2006 flow [2024-06-14 15:32:11,850 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.5) internal successors, (95), 10 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:32:11,850 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:32:11,850 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:32:11,850 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2024-06-14 15:32:11,851 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 15:32:11,851 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:32:11,851 INFO L85 PathProgramCache]: Analyzing trace with hash 1332737802, now seen corresponding path program 8 times [2024-06-14 15:32:11,851 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:32:11,851 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1437738767] [2024-06-14 15:32:11,851 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:32:11,851 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:32:11,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:32:20,944 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:20,944 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:32:20,944 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1437738767] [2024-06-14 15:32:20,944 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1437738767] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:32:20,944 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:32:20,944 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 15:32:20,945 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1880560616] [2024-06-14 15:32:20,945 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:32:20,945 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 15:32:20,945 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:32:20,945 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 15:32:20,945 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-06-14 15:32:21,086 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41 [2024-06-14 15:32:21,086 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 147 places, 173 transitions, 2006 flow. Second operand has 10 states, 10 states have (on average 9.5) internal successors, (95), 10 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:32:21,086 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:32:21,086 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41 [2024-06-14 15:32:21,087 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:32:22,503 INFO L124 PetriNetUnfolderBase]: 2426/3672 cut-off events. [2024-06-14 15:32:22,503 INFO L125 PetriNetUnfolderBase]: For 119416/119418 co-relation queries the response was YES. [2024-06-14 15:32:22,520 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24260 conditions, 3672 events. 2426/3672 cut-off events. For 119416/119418 co-relation queries the response was YES. Maximal size of possible extension queue 180. Compared 18290 event pairs, 653 based on Foata normal form. 4/3675 useless extension candidates. Maximal degree in co-relation 24188. Up to 3324 conditions per place. [2024-06-14 15:32:22,532 INFO L140 encePairwiseOnDemand]: 31/41 looper letters, 144 selfloop transitions, 54 changer transitions 0/201 dead transitions. [2024-06-14 15:32:22,533 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 153 places, 201 transitions, 2476 flow [2024-06-14 15:32:22,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-14 15:32:22,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-14 15:32:22,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 133 transitions. [2024-06-14 15:32:22,535 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4634146341463415 [2024-06-14 15:32:22,535 INFO L175 Difference]: Start difference. First operand has 147 places, 173 transitions, 2006 flow. Second operand 7 states and 133 transitions. [2024-06-14 15:32:22,535 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 153 places, 201 transitions, 2476 flow [2024-06-14 15:32:22,657 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 150 places, 201 transitions, 2353 flow, removed 40 selfloop flow, removed 3 redundant places. [2024-06-14 15:32:22,659 INFO L231 Difference]: Finished difference. Result has 151 places, 173 transitions, 2007 flow [2024-06-14 15:32:22,659 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=1883, PETRI_DIFFERENCE_MINUEND_PLACES=144, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=173, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=54, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=119, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2007, PETRI_PLACES=151, PETRI_TRANSITIONS=173} [2024-06-14 15:32:22,660 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 109 predicate places. [2024-06-14 15:32:22,660 INFO L495 AbstractCegarLoop]: Abstraction has has 151 places, 173 transitions, 2007 flow [2024-06-14 15:32:22,660 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.5) internal successors, (95), 10 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:32:22,660 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:32:22,660 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:32:22,661 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2024-06-14 15:32:22,661 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:22,661 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:32:22,661 INFO L85 PathProgramCache]: Analyzing trace with hash 767943509, now seen corresponding path program 3 times [2024-06-14 15:32:22,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:32:22,661 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1207306768] [2024-06-14 15:32:22,661 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:32:22,662 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:32:22,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:32:33,315 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:33,315 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:32:33,315 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1207306768] [2024-06-14 15:32:33,316 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1207306768] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:32:33,316 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:32:33,316 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-14 15:32:33,316 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1202457296] [2024-06-14 15:32:33,316 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:32:33,317 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-14 15:32:33,317 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:32:33,317 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-14 15:32:33,317 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-06-14 15:32:33,457 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41 [2024-06-14 15:32:33,458 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 151 places, 173 transitions, 2007 flow. Second operand has 8 states, 8 states have (on average 9.875) internal successors, (79), 8 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:32:33,458 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:32:33,458 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41 [2024-06-14 15:32:33,458 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:32:34,770 INFO L124 PetriNetUnfolderBase]: 2414/3657 cut-off events. [2024-06-14 15:32:34,771 INFO L125 PetriNetUnfolderBase]: For 122181/122183 co-relation queries the response was YES. [2024-06-14 15:32:34,788 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24227 conditions, 3657 events. 2414/3657 cut-off events. For 122181/122183 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 18208 event pairs, 672 based on Foata normal form. 8/3664 useless extension candidates. Maximal degree in co-relation 24153. Up to 3545 conditions per place. [2024-06-14 15:32:34,799 INFO L140 encePairwiseOnDemand]: 30/41 looper letters, 161 selfloop transitions, 24 changer transitions 0/188 dead transitions. [2024-06-14 15:32:34,800 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 157 places, 188 transitions, 2483 flow [2024-06-14 15:32:34,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-14 15:32:34,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-14 15:32:34,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 117 transitions. [2024-06-14 15:32:34,801 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4076655052264808 [2024-06-14 15:32:34,801 INFO L175 Difference]: Start difference. First operand has 151 places, 173 transitions, 2007 flow. Second operand 7 states and 117 transitions. [2024-06-14 15:32:34,801 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 157 places, 188 transitions, 2483 flow [2024-06-14 15:32:34,906 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 151 places, 188 transitions, 2344 flow, removed 9 selfloop flow, removed 6 redundant places. [2024-06-14 15:32:34,909 INFO L231 Difference]: Finished difference. Result has 152 places, 173 transitions, 1924 flow [2024-06-14 15:32:34,909 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=1868, PETRI_DIFFERENCE_MINUEND_PLACES=145, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=173, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=149, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1924, PETRI_PLACES=152, PETRI_TRANSITIONS=173} [2024-06-14 15:32:34,909 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 110 predicate places. [2024-06-14 15:32:34,909 INFO L495 AbstractCegarLoop]: Abstraction has has 152 places, 173 transitions, 1924 flow [2024-06-14 15:32:34,909 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.875) internal successors, (79), 8 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:32:34,910 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:32:34,910 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:32:34,910 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2024-06-14 15:32:34,910 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:34,910 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:32:34,910 INFO L85 PathProgramCache]: Analyzing trace with hash -86352417, now seen corresponding path program 1 times [2024-06-14 15:32:34,910 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:32:34,911 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [551287327] [2024-06-14 15:32:34,911 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:32:34,911 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:32:34,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:32:45,463 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,463 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:32:45,463 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [551287327] [2024-06-14 15:32:45,463 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [551287327] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:32:45,463 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:32:45,463 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-14 15:32:45,464 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1195306071] [2024-06-14 15:32:45,464 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:32:45,464 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-14 15:32:45,464 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:32:45,464 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-14 15:32:45,465 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-06-14 15:32:45,613 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41 [2024-06-14 15:32:45,613 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 152 places, 173 transitions, 1924 flow. Second operand has 8 states, 8 states have (on average 9.875) internal successors, (79), 8 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:32:45,613 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:32:45,613 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41 [2024-06-14 15:32:45,614 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:32:46,919 INFO L124 PetriNetUnfolderBase]: 2408/3648 cut-off events. [2024-06-14 15:32:46,919 INFO L125 PetriNetUnfolderBase]: For 124959/124959 co-relation queries the response was YES. [2024-06-14 15:32:46,936 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24085 conditions, 3648 events. 2408/3648 cut-off events. For 124959/124959 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 18100 event pairs, 670 based on Foata normal form. 2/3649 useless extension candidates. Maximal degree in co-relation 24010. Up to 3618 conditions per place. [2024-06-14 15:32:46,947 INFO L140 encePairwiseOnDemand]: 32/41 looper letters, 171 selfloop transitions, 14 changer transitions 0/188 dead transitions. [2024-06-14 15:32:46,947 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 158 places, 188 transitions, 2368 flow [2024-06-14 15:32:46,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-14 15:32:46,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-14 15:32:46,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 109 transitions. [2024-06-14 15:32:46,949 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3797909407665505 [2024-06-14 15:32:46,949 INFO L175 Difference]: Start difference. First operand has 152 places, 173 transitions, 1924 flow. Second operand 7 states and 109 transitions. [2024-06-14 15:32:46,949 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 158 places, 188 transitions, 2368 flow [2024-06-14 15:32:47,060 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 151 places, 188 transitions, 2267 flow, removed 10 selfloop flow, removed 7 redundant places. [2024-06-14 15:32:47,063 INFO L231 Difference]: Finished difference. Result has 152 places, 176 transitions, 1909 flow [2024-06-14 15:32:47,063 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=1823, PETRI_DIFFERENCE_MINUEND_PLACES=145, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=173, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=159, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1909, PETRI_PLACES=152, PETRI_TRANSITIONS=176} [2024-06-14 15:32:47,064 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 110 predicate places. [2024-06-14 15:32:47,064 INFO L495 AbstractCegarLoop]: Abstraction has has 152 places, 176 transitions, 1909 flow [2024-06-14 15:32:47,064 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.875) internal successors, (79), 8 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:32:47,064 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:32:47,064 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:32:47,064 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2024-06-14 15:32:47,064 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:47,065 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:32:47,065 INFO L85 PathProgramCache]: Analyzing trace with hash 761694467, now seen corresponding path program 1 times [2024-06-14 15:32:47,065 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:32:47,065 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1732378230] [2024-06-14 15:32:47,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:32:47,065 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:32:47,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:33:01,978 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:01,978 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:33:01,978 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1732378230] [2024-06-14 15:33:01,978 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1732378230] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:33:01,978 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:33:01,978 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-14 15:33:01,978 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1182903756] [2024-06-14 15:33:01,978 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:33:01,979 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-14 15:33:01,979 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:33:01,979 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-14 15:33:01,979 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-06-14 15:33:02,118 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41 [2024-06-14 15:33:02,118 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 152 places, 176 transitions, 1909 flow. Second operand has 8 states, 8 states have (on average 9.875) internal successors, (79), 8 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:33:02,118 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:33:02,118 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41 [2024-06-14 15:33:02,118 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:33:03,503 INFO L124 PetriNetUnfolderBase]: 2438/3690 cut-off events. [2024-06-14 15:33:03,504 INFO L125 PetriNetUnfolderBase]: For 133231/133231 co-relation queries the response was YES. [2024-06-14 15:33:03,523 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24362 conditions, 3690 events. 2438/3690 cut-off events. For 133231/133231 co-relation queries the response was YES. Maximal size of possible extension queue 179. Compared 18349 event pairs, 682 based on Foata normal form. 6/3695 useless extension candidates. Maximal degree in co-relation 24290. Up to 3626 conditions per place. [2024-06-14 15:33:03,538 INFO L140 encePairwiseOnDemand]: 32/41 looper letters, 179 selfloop transitions, 16 changer transitions 0/198 dead transitions. [2024-06-14 15:33:03,538 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 158 places, 198 transitions, 2387 flow [2024-06-14 15:33:03,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-14 15:33:03,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-14 15:33:03,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 117 transitions. [2024-06-14 15:33:03,564 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4076655052264808 [2024-06-14 15:33:03,564 INFO L175 Difference]: Start difference. First operand has 152 places, 176 transitions, 1909 flow. Second operand 7 states and 117 transitions. [2024-06-14 15:33:03,564 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 158 places, 198 transitions, 2387 flow [2024-06-14 15:33:03,707 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 152 places, 198 transitions, 2293 flow, removed 23 selfloop flow, removed 6 redundant places. [2024-06-14 15:33:03,710 INFO L231 Difference]: Finished difference. Result has 153 places, 179 transitions, 1896 flow [2024-06-14 15:33:03,710 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=1815, PETRI_DIFFERENCE_MINUEND_PLACES=146, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=176, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=160, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1896, PETRI_PLACES=153, PETRI_TRANSITIONS=179} [2024-06-14 15:33:03,711 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 111 predicate places. [2024-06-14 15:33:03,711 INFO L495 AbstractCegarLoop]: Abstraction has has 153 places, 179 transitions, 1896 flow [2024-06-14 15:33:03,711 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.875) internal successors, (79), 8 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:33:03,711 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:33:03,711 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:33:03,711 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2024-06-14 15:33:03,712 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:33:03,712 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:33:03,712 INFO L85 PathProgramCache]: Analyzing trace with hash -263715321, now seen corresponding path program 2 times [2024-06-14 15:33:03,712 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:33:03,712 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [588108171] [2024-06-14 15:33:03,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:33:03,713 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:33:03,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:33:19,472 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:19,472 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:33:19,472 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [588108171] [2024-06-14 15:33:19,472 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [588108171] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:33:19,472 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:33:19,472 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-14 15:33:19,473 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1277605985] [2024-06-14 15:33:19,473 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:33:19,473 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-14 15:33:19,473 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:33:19,473 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-14 15:33:19,474 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2024-06-14 15:33:19,607 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41 [2024-06-14 15:33:19,607 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 153 places, 179 transitions, 1896 flow. Second operand has 8 states, 8 states have (on average 9.875) internal successors, (79), 8 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:33:19,607 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:33:19,607 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41 [2024-06-14 15:33:19,607 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:33:21,076 INFO L124 PetriNetUnfolderBase]: 2468/3732 cut-off events. [2024-06-14 15:33:21,077 INFO L125 PetriNetUnfolderBase]: For 139542/139542 co-relation queries the response was YES. [2024-06-14 15:33:21,097 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24867 conditions, 3732 events. 2468/3732 cut-off events. For 139542/139542 co-relation queries the response was YES. Maximal size of possible extension queue 182. Compared 18544 event pairs, 668 based on Foata normal form. 6/3737 useless extension candidates. Maximal degree in co-relation 24795. Up to 3572 conditions per place. [2024-06-14 15:33:21,112 INFO L140 encePairwiseOnDemand]: 32/41 looper letters, 174 selfloop transitions, 33 changer transitions 0/210 dead transitions. [2024-06-14 15:33:21,112 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 159 places, 210 transitions, 2543 flow [2024-06-14 15:33:21,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-14 15:33:21,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-14 15:33:21,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 126 transitions. [2024-06-14 15:33:21,114 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43902439024390244 [2024-06-14 15:33:21,114 INFO L175 Difference]: Start difference. First operand has 153 places, 179 transitions, 1896 flow. Second operand 7 states and 126 transitions. [2024-06-14 15:33:21,114 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 159 places, 210 transitions, 2543 flow [2024-06-14 15:33:21,255 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 154 places, 210 transitions, 2480 flow, removed 18 selfloop flow, removed 5 redundant places. [2024-06-14 15:33:21,258 INFO L231 Difference]: Finished difference. Result has 155 places, 185 transitions, 2002 flow [2024-06-14 15:33:21,258 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=1839, PETRI_DIFFERENCE_MINUEND_PLACES=148, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=179, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=149, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2002, PETRI_PLACES=155, PETRI_TRANSITIONS=185} [2024-06-14 15:33:21,258 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 113 predicate places. [2024-06-14 15:33:21,258 INFO L495 AbstractCegarLoop]: Abstraction has has 155 places, 185 transitions, 2002 flow [2024-06-14 15:33:21,259 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.875) internal successors, (79), 8 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:33:21,259 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:33:21,259 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:33:21,259 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2024-06-14 15:33:21,259 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:33:21,260 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:33:21,260 INFO L85 PathProgramCache]: Analyzing trace with hash 1793236517, now seen corresponding path program 3 times [2024-06-14 15:33:21,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:33:21,260 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2058386964] [2024-06-14 15:33:21,260 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:33:21,260 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:33:21,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:33:36,352 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:36,352 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:33:36,353 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2058386964] [2024-06-14 15:33:36,353 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2058386964] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:33:36,353 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:33:36,353 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-14 15:33:36,353 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2013933581] [2024-06-14 15:33:36,353 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:33:36,353 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-14 15:33:36,353 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:33:36,353 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-14 15:33:36,354 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2024-06-14 15:33:36,462 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41 [2024-06-14 15:33:36,462 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 155 places, 185 transitions, 2002 flow. Second operand has 8 states, 8 states have (on average 9.875) internal successors, (79), 8 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:33:36,462 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:33:36,462 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41 [2024-06-14 15:33:36,463 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:33:37,937 INFO L124 PetriNetUnfolderBase]: 2450/3709 cut-off events. [2024-06-14 15:33:37,938 INFO L125 PetriNetUnfolderBase]: For 143636/143638 co-relation queries the response was YES. [2024-06-14 15:33:37,955 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24836 conditions, 3709 events. 2450/3709 cut-off events. For 143636/143638 co-relation queries the response was YES. Maximal size of possible extension queue 179. Compared 18440 event pairs, 674 based on Foata normal form. 6/3714 useless extension candidates. Maximal degree in co-relation 24763. Up to 3561 conditions per place. [2024-06-14 15:33:37,967 INFO L140 encePairwiseOnDemand]: 32/41 looper letters, 167 selfloop transitions, 33 changer transitions 0/203 dead transitions. [2024-06-14 15:33:37,968 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 161 places, 203 transitions, 2455 flow [2024-06-14 15:33:37,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-14 15:33:37,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-14 15:33:37,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 120 transitions. [2024-06-14 15:33:37,969 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4181184668989547 [2024-06-14 15:33:37,969 INFO L175 Difference]: Start difference. First operand has 155 places, 185 transitions, 2002 flow. Second operand 7 states and 120 transitions. [2024-06-14 15:33:37,969 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 161 places, 203 transitions, 2455 flow [2024-06-14 15:33:38,107 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 158 places, 203 transitions, 2376 flow, removed 29 selfloop flow, removed 3 redundant places. [2024-06-14 15:33:38,110 INFO L231 Difference]: Finished difference. Result has 159 places, 185 transitions, 1996 flow [2024-06-14 15:33:38,110 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=1923, PETRI_DIFFERENCE_MINUEND_PLACES=152, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=185, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=152, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1996, PETRI_PLACES=159, PETRI_TRANSITIONS=185} [2024-06-14 15:33:38,110 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 117 predicate places. [2024-06-14 15:33:38,110 INFO L495 AbstractCegarLoop]: Abstraction has has 159 places, 185 transitions, 1996 flow [2024-06-14 15:33:38,110 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.875) internal successors, (79), 8 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:33:38,111 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:33:38,111 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:33:38,111 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2024-06-14 15:33:38,111 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:38,111 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:33:38,111 INFO L85 PathProgramCache]: Analyzing trace with hash 768374471, now seen corresponding path program 1 times [2024-06-14 15:33:38,111 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:33:38,112 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1517799655] [2024-06-14 15:33:38,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:33:38,112 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:33:38,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:33:53,863 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:53,863 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:33:53,863 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1517799655] [2024-06-14 15:33:53,863 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1517799655] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:33:53,863 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:33:53,863 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-14 15:33:53,864 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [680101300] [2024-06-14 15:33:53,864 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:33:53,864 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-14 15:33:53,864 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:33:53,865 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-14 15:33:53,865 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-06-14 15:33:54,021 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41 [2024-06-14 15:33:54,021 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 159 places, 185 transitions, 1996 flow. Second operand has 8 states, 8 states have (on average 10.0) internal successors, (80), 8 states have internal predecessors, (80), 0 states have call successors, (0), 0 states 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:54,021 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:33:54,022 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41 [2024-06-14 15:33:54,022 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:33:55,381 INFO L124 PetriNetUnfolderBase]: 2445/3701 cut-off events. [2024-06-14 15:33:55,381 INFO L125 PetriNetUnfolderBase]: For 145508/145508 co-relation queries the response was YES. [2024-06-14 15:33:55,402 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24793 conditions, 3701 events. 2445/3701 cut-off events. For 145508/145508 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 18294 event pairs, 667 based on Foata normal form. 2/3702 useless extension candidates. Maximal degree in co-relation 24718. Up to 3673 conditions per place. [2024-06-14 15:33:55,416 INFO L140 encePairwiseOnDemand]: 33/41 looper letters, 183 selfloop transitions, 13 changer transitions 0/199 dead transitions. [2024-06-14 15:33:55,416 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 165 places, 199 transitions, 2452 flow [2024-06-14 15:33:55,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-14 15:33:55,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-14 15:33:55,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 108 transitions. [2024-06-14 15:33:55,417 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.37630662020905925 [2024-06-14 15:33:55,417 INFO L175 Difference]: Start difference. First operand has 159 places, 185 transitions, 1996 flow. Second operand 7 states and 108 transitions. [2024-06-14 15:33:55,417 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 165 places, 199 transitions, 2452 flow [2024-06-14 15:33:55,549 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 158 places, 199 transitions, 2353 flow, removed 6 selfloop flow, removed 7 redundant places. [2024-06-14 15:33:55,551 INFO L231 Difference]: Finished difference. Result has 159 places, 187 transitions, 1968 flow [2024-06-14 15:33:55,552 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=1897, PETRI_DIFFERENCE_MINUEND_PLACES=152, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=185, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=172, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1968, PETRI_PLACES=159, PETRI_TRANSITIONS=187} [2024-06-14 15:33:55,552 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 117 predicate places. [2024-06-14 15:33:55,552 INFO L495 AbstractCegarLoop]: Abstraction has has 159 places, 187 transitions, 1968 flow [2024-06-14 15:33:55,552 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.0) internal successors, (80), 8 states have internal predecessors, (80), 0 states have call successors, (0), 0 states 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,552 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:33:55,552 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:55,553 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2024-06-14 15:33:55,553 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:55,553 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:33:55,553 INFO L85 PathProgramCache]: Analyzing trace with hash -796598386, now seen corresponding path program 1 times [2024-06-14 15:33:55,553 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:33:55,553 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [896516314] [2024-06-14 15:33:55,554 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:33:55,554 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:33:55,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:34:08,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:34:08,042 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:34:08,042 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [896516314] [2024-06-14 15:34:08,042 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [896516314] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:34:08,042 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:34:08,042 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 15:34:08,042 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1398762461] [2024-06-14 15:34:08,043 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:34:08,043 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 15:34:08,043 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:34:08,043 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 15:34:08,043 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-06-14 15:34:08,135 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41 [2024-06-14 15:34:08,136 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 159 places, 187 transitions, 1968 flow. Second operand has 9 states, 9 states have (on average 9.777777777777779) internal successors, (88), 9 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:34:08,136 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:34:08,136 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41 [2024-06-14 15:34:08,136 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:34:09,718 INFO L124 PetriNetUnfolderBase]: 2463/3727 cut-off events. [2024-06-14 15:34:09,718 INFO L125 PetriNetUnfolderBase]: For 153426/153428 co-relation queries the response was YES. [2024-06-14 15:34:09,735 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25062 conditions, 3727 events. 2463/3727 cut-off events. For 153426/153428 co-relation queries the response was YES. Maximal size of possible extension queue 179. Compared 18586 event pairs, 648 based on Foata normal form. 4/3730 useless extension candidates. Maximal degree in co-relation 24987. Up to 3522 conditions per place. [2024-06-14 15:34:09,747 INFO L140 encePairwiseOnDemand]: 30/41 looper letters, 195 selfloop transitions, 51 changer transitions 0/249 dead transitions. [2024-06-14 15:34:09,747 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 166 places, 249 transitions, 2968 flow [2024-06-14 15:34:09,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 15:34:09,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 15:34:09,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 149 transitions. [2024-06-14 15:34:09,749 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45426829268292684 [2024-06-14 15:34:09,749 INFO L175 Difference]: Start difference. First operand has 159 places, 187 transitions, 1968 flow. Second operand 8 states and 149 transitions. [2024-06-14 15:34:09,749 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 166 places, 249 transitions, 2968 flow [2024-06-14 15:34:09,892 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 161 places, 249 transitions, 2913 flow, removed 16 selfloop flow, removed 5 redundant places. [2024-06-14 15:34:09,895 INFO L231 Difference]: Finished difference. Result has 165 places, 216 transitions, 2391 flow [2024-06-14 15:34:09,895 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=1913, PETRI_DIFFERENCE_MINUEND_PLACES=154, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=187, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=142, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2391, PETRI_PLACES=165, PETRI_TRANSITIONS=216} [2024-06-14 15:34:09,895 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 123 predicate places. [2024-06-14 15:34:09,895 INFO L495 AbstractCegarLoop]: Abstraction has has 165 places, 216 transitions, 2391 flow [2024-06-14 15:34:09,896 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.777777777777779) internal successors, (88), 9 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:34:09,896 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:34:09,896 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:09,896 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2024-06-14 15:34:09,896 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:34:09,896 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:34:09,897 INFO L85 PathProgramCache]: Analyzing trace with hash -796329616, now seen corresponding path program 2 times [2024-06-14 15:34:09,897 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:34:09,897 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [563475072] [2024-06-14 15:34:09,897 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:34:09,897 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:34:09,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:34:23,288 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:23,289 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:34:23,289 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [563475072] [2024-06-14 15:34:23,289 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [563475072] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:34:23,289 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:34:23,289 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 15:34:23,289 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1125948498] [2024-06-14 15:34:23,289 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:34:23,290 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 15:34:23,290 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:34:23,290 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 15:34:23,290 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-14 15:34:23,459 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41 [2024-06-14 15:34:23,460 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 165 places, 216 transitions, 2391 flow. Second operand has 9 states, 9 states have (on average 9.777777777777779) internal successors, (88), 9 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:34:23,460 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:34:23,460 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41 [2024-06-14 15:34:23,460 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:34:24,790 INFO L124 PetriNetUnfolderBase]: 2493/3769 cut-off events. [2024-06-14 15:34:24,791 INFO L125 PetriNetUnfolderBase]: For 165541/165543 co-relation queries the response was YES. [2024-06-14 15:34:24,811 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26370 conditions, 3769 events. 2493/3769 cut-off events. For 165541/165543 co-relation queries the response was YES. Maximal size of possible extension queue 181. Compared 18780 event pairs, 646 based on Foata normal form. 8/3776 useless extension candidates. Maximal degree in co-relation 26291. Up to 3458 conditions per place. [2024-06-14 15:34:24,825 INFO L140 encePairwiseOnDemand]: 29/41 looper letters, 179 selfloop transitions, 71 changer transitions 0/253 dead transitions. [2024-06-14 15:34:24,825 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 172 places, 253 transitions, 3158 flow [2024-06-14 15:34:24,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 15:34:24,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 15:34:24,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 149 transitions. [2024-06-14 15:34:24,827 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45426829268292684 [2024-06-14 15:34:24,827 INFO L175 Difference]: Start difference. First operand has 165 places, 216 transitions, 2391 flow. Second operand 8 states and 149 transitions. [2024-06-14 15:34:24,827 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 172 places, 253 transitions, 3158 flow [2024-06-14 15:34:24,989 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 170 places, 253 transitions, 3081 flow, removed 32 selfloop flow, removed 2 redundant places. [2024-06-14 15:34:24,992 INFO L231 Difference]: Finished difference. Result has 171 places, 224 transitions, 2600 flow [2024-06-14 15:34:24,992 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=2328, PETRI_DIFFERENCE_MINUEND_PLACES=163, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=216, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=63, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=145, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2600, PETRI_PLACES=171, PETRI_TRANSITIONS=224} [2024-06-14 15:34:24,993 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 129 predicate places. [2024-06-14 15:34:24,993 INFO L495 AbstractCegarLoop]: Abstraction has has 171 places, 224 transitions, 2600 flow [2024-06-14 15:34:24,993 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.777777777777779) internal successors, (88), 9 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:34:24,993 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:34:24,993 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:24,993 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2024-06-14 15:34:24,994 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:34:24,994 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:34:24,994 INFO L85 PathProgramCache]: Analyzing trace with hash 1960311562, now seen corresponding path program 1 times [2024-06-14 15:34:24,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:34:24,994 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2070774031] [2024-06-14 15:34:24,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:34:24,994 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:34:25,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:34:36,586 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:34:36,587 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:34:36,587 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2070774031] [2024-06-14 15:34:36,587 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2070774031] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:34:36,587 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:34:36,587 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-14 15:34:36,587 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [723304495] [2024-06-14 15:34:36,587 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:34:36,587 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-14 15:34:36,587 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:34:36,587 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-14 15:34:36,588 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-06-14 15:34:36,726 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41 [2024-06-14 15:34:36,726 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 171 places, 224 transitions, 2600 flow. Second operand has 8 states, 8 states have (on average 9.875) internal successors, (79), 8 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:34:36,726 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:34:36,726 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41 [2024-06-14 15:34:36,727 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:34:38,213 INFO L124 PetriNetUnfolderBase]: 2571/3877 cut-off events. [2024-06-14 15:34:38,213 INFO L125 PetriNetUnfolderBase]: For 180488/180490 co-relation queries the response was YES. [2024-06-14 15:34:38,231 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28155 conditions, 3877 events. 2571/3877 cut-off events. For 180488/180490 co-relation queries the response was YES. Maximal size of possible extension queue 191. Compared 19332 event pairs, 652 based on Foata normal form. 8/3884 useless extension candidates. Maximal degree in co-relation 28074. Up to 3526 conditions per place. [2024-06-14 15:34:38,245 INFO L140 encePairwiseOnDemand]: 30/41 looper letters, 191 selfloop transitions, 73 changer transitions 0/267 dead transitions. [2024-06-14 15:34:38,245 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 177 places, 267 transitions, 3635 flow [2024-06-14 15:34:38,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-14 15:34:38,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-14 15:34:38,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 132 transitions. [2024-06-14 15:34:38,247 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45993031358885017 [2024-06-14 15:34:38,247 INFO L175 Difference]: Start difference. First operand has 171 places, 224 transitions, 2600 flow. Second operand 7 states and 132 transitions. [2024-06-14 15:34:38,247 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 177 places, 267 transitions, 3635 flow [2024-06-14 15:34:38,423 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 171 places, 267 transitions, 3401 flow, removed 34 selfloop flow, removed 6 redundant places. [2024-06-14 15:34:38,426 INFO L231 Difference]: Finished difference. Result has 173 places, 241 transitions, 2837 flow [2024-06-14 15:34:38,427 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=2400, PETRI_DIFFERENCE_MINUEND_PLACES=165, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=224, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=58, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=164, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2837, PETRI_PLACES=173, PETRI_TRANSITIONS=241} [2024-06-14 15:34:38,427 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 131 predicate places. [2024-06-14 15:34:38,427 INFO L495 AbstractCegarLoop]: Abstraction has has 173 places, 241 transitions, 2837 flow [2024-06-14 15:34:38,432 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.875) internal successors, (79), 8 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:34:38,433 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:34:38,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:34:38,433 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2024-06-14 15:34:38,433 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:34:38,433 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:34:38,433 INFO L85 PathProgramCache]: Analyzing trace with hash -1706444154, now seen corresponding path program 2 times [2024-06-14 15:34:38,434 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:34:38,434 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1648817394] [2024-06-14 15:34:38,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:34:38,434 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:34:38,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:34:50,141 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:50,141 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:34:50,142 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1648817394] [2024-06-14 15:34:50,142 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1648817394] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:34:50,142 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:34:50,142 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-14 15:34:50,142 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1075309951] [2024-06-14 15:34:50,142 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:34:50,142 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-14 15:34:50,142 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:34:50,142 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-14 15:34:50,143 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-06-14 15:34:50,236 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41 [2024-06-14 15:34:50,236 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 173 places, 241 transitions, 2837 flow. Second operand has 8 states, 8 states have (on average 9.875) internal successors, (79), 8 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:34:50,236 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:34:50,236 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41 [2024-06-14 15:34:50,236 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:34:51,817 INFO L124 PetriNetUnfolderBase]: 2553/3853 cut-off events. [2024-06-14 15:34:51,818 INFO L125 PetriNetUnfolderBase]: For 182586/182588 co-relation queries the response was YES. [2024-06-14 15:34:51,846 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27927 conditions, 3853 events. 2553/3853 cut-off events. For 182586/182588 co-relation queries the response was YES. Maximal size of possible extension queue 190. Compared 19239 event pairs, 660 based on Foata normal form. 8/3860 useless extension candidates. Maximal degree in co-relation 27844. Up to 3515 conditions per place. [2024-06-14 15:34:51,864 INFO L140 encePairwiseOnDemand]: 30/41 looper letters, 196 selfloop transitions, 66 changer transitions 0/265 dead transitions. [2024-06-14 15:34:51,865 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 179 places, 265 transitions, 3590 flow [2024-06-14 15:34:51,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-14 15:34:51,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-14 15:34:51,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 129 transitions. [2024-06-14 15:34:51,866 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44947735191637633 [2024-06-14 15:34:51,866 INFO L175 Difference]: Start difference. First operand has 173 places, 241 transitions, 2837 flow. Second operand 7 states and 129 transitions. [2024-06-14 15:34:51,866 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 179 places, 265 transitions, 3590 flow [2024-06-14 15:34:52,155 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 176 places, 265 transitions, 3486 flow, removed 21 selfloop flow, removed 3 redundant places. [2024-06-14 15:34:52,160 INFO L231 Difference]: Finished difference. Result has 177 places, 241 transitions, 2879 flow [2024-06-14 15:34:52,161 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=2733, PETRI_DIFFERENCE_MINUEND_PLACES=170, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=241, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=66, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=175, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2879, PETRI_PLACES=177, PETRI_TRANSITIONS=241} [2024-06-14 15:34:52,162 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 135 predicate places. [2024-06-14 15:34:52,162 INFO L495 AbstractCegarLoop]: Abstraction has has 177 places, 241 transitions, 2879 flow [2024-06-14 15:34:52,162 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.875) internal successors, (79), 8 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:34:52,162 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:34:52,162 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:52,162 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2024-06-14 15:34:52,163 INFO L420 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 15:34:52,163 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:34:52,163 INFO L85 PathProgramCache]: Analyzing trace with hash -1512458627, now seen corresponding path program 1 times [2024-06-14 15:34:52,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:34:52,163 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [342534277] [2024-06-14 15:34:52,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:34:52,164 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:34:52,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:35:02,773 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:02,774 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:35:02,774 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [342534277] [2024-06-14 15:35:02,774 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [342534277] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:35:02,774 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:35:02,774 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 15:35:02,774 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1069236030] [2024-06-14 15:35:02,775 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:35:02,775 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 15:35:02,775 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:35:02,775 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 15:35:02,775 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-06-14 15:35:03,091 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41 [2024-06-14 15:35:03,091 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 177 places, 241 transitions, 2879 flow. Second operand has 11 states, 11 states have (on average 9.454545454545455) internal successors, (104), 11 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:35:03,091 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:35:03,092 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41 [2024-06-14 15:35:03,092 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:35:04,619 INFO L124 PetriNetUnfolderBase]: 2594/3924 cut-off events. [2024-06-14 15:35:04,619 INFO L125 PetriNetUnfolderBase]: For 194116/194118 co-relation queries the response was YES. [2024-06-14 15:35:04,641 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28535 conditions, 3924 events. 2594/3924 cut-off events. For 194116/194118 co-relation queries the response was YES. Maximal size of possible extension queue 195. Compared 19742 event pairs, 638 based on Foata normal form. 12/3935 useless extension candidates. Maximal degree in co-relation 28451. Up to 3561 conditions per place. [2024-06-14 15:35:04,657 INFO L140 encePairwiseOnDemand]: 31/41 looper letters, 230 selfloop transitions, 46 changer transitions 0/279 dead transitions. [2024-06-14 15:35:04,657 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 185 places, 279 transitions, 3575 flow [2024-06-14 15:35:04,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 15:35:04,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 15:35:04,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 161 transitions. [2024-06-14 15:35:04,660 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4363143631436314 [2024-06-14 15:35:04,660 INFO L175 Difference]: Start difference. First operand has 177 places, 241 transitions, 2879 flow. Second operand 9 states and 161 transitions. [2024-06-14 15:35:04,660 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 185 places, 279 transitions, 3575 flow [2024-06-14 15:35:04,916 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 181 places, 279 transitions, 3463 flow, removed 11 selfloop flow, removed 4 redundant places. [2024-06-14 15:35:04,941 INFO L231 Difference]: Finished difference. Result has 182 places, 242 transitions, 2905 flow [2024-06-14 15:35:04,941 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=2767, PETRI_DIFFERENCE_MINUEND_PLACES=173, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=241, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=45, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=195, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2905, PETRI_PLACES=182, PETRI_TRANSITIONS=242} [2024-06-14 15:35:04,942 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 140 predicate places. [2024-06-14 15:35:04,942 INFO L495 AbstractCegarLoop]: Abstraction has has 182 places, 242 transitions, 2905 flow [2024-06-14 15:35:04,942 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 9.454545454545455) internal successors, (104), 11 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:35:04,943 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:35:04,943 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:35:04,943 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2024-06-14 15:35:04,943 INFO L420 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 15:35:04,944 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:35:04,944 INFO L85 PathProgramCache]: Analyzing trace with hash -456494379, now seen corresponding path program 2 times [2024-06-14 15:35:04,947 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:35:04,947 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [500896202] [2024-06-14 15:35:04,947 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:35:04,947 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:35:05,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:35:15,408 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:15,408 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:35:15,408 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [500896202] [2024-06-14 15:35:15,408 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [500896202] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:35:15,409 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:35:15,409 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 15:35:15,409 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [807635001] [2024-06-14 15:35:15,409 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:35:15,409 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 15:35:15,409 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:35:15,410 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 15:35:15,410 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-06-14 15:35:15,679 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41 [2024-06-14 15:35:15,680 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 182 places, 242 transitions, 2905 flow. Second operand has 10 states, 10 states have (on average 9.6) internal successors, (96), 10 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:35:15,680 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:35:15,680 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41 [2024-06-14 15:35:15,680 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:35:17,284 INFO L124 PetriNetUnfolderBase]: 2635/3995 cut-off events. [2024-06-14 15:35:17,285 INFO L125 PetriNetUnfolderBase]: For 205498/205500 co-relation queries the response was YES. [2024-06-14 15:35:17,307 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29154 conditions, 3995 events. 2635/3995 cut-off events. For 205498/205500 co-relation queries the response was YES. Maximal size of possible extension queue 200. Compared 20401 event pairs, 634 based on Foata normal form. 12/4006 useless extension candidates. Maximal degree in co-relation 29069. Up to 3527 conditions per place. [2024-06-14 15:35:17,321 INFO L140 encePairwiseOnDemand]: 31/41 looper letters, 224 selfloop transitions, 53 changer transitions 0/280 dead transitions. [2024-06-14 15:35:17,322 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 190 places, 280 transitions, 3603 flow [2024-06-14 15:35:17,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 15:35:17,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 15:35:17,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 161 transitions. [2024-06-14 15:35:17,328 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4363143631436314 [2024-06-14 15:35:17,328 INFO L175 Difference]: Start difference. First operand has 182 places, 242 transitions, 2905 flow. Second operand 9 states and 161 transitions. [2024-06-14 15:35:17,328 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 190 places, 280 transitions, 3603 flow [2024-06-14 15:35:17,526 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 184 places, 280 transitions, 3506 flow, removed 15 selfloop flow, removed 6 redundant places. [2024-06-14 15:35:17,530 INFO L231 Difference]: Finished difference. Result has 185 places, 243 transitions, 2962 flow [2024-06-14 15:35:17,531 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=2808, PETRI_DIFFERENCE_MINUEND_PLACES=176, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=242, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=52, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=189, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2962, PETRI_PLACES=185, PETRI_TRANSITIONS=243} [2024-06-14 15:35:17,531 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 143 predicate places. [2024-06-14 15:35:17,531 INFO L495 AbstractCegarLoop]: Abstraction has has 185 places, 243 transitions, 2962 flow [2024-06-14 15:35:17,531 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.6) internal successors, (96), 10 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:35:17,531 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:35:17,531 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:17,532 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2024-06-14 15:35:17,532 INFO L420 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 15:35:17,532 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:35:17,532 INFO L85 PathProgramCache]: Analyzing trace with hash -629214909, now seen corresponding path program 3 times [2024-06-14 15:35:17,532 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:35:17,532 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1394398095] [2024-06-14 15:35:17,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:35:17,533 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:35:17,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:35:27,442 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:35:27,443 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:35:27,443 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1394398095] [2024-06-14 15:35:27,443 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1394398095] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:35:27,443 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:35:27,443 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 15:35:27,443 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [376402550] [2024-06-14 15:35:27,444 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:35:27,444 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 15:35:27,449 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:35:27,449 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 15:35:27,450 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-06-14 15:35:27,666 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41 [2024-06-14 15:35:27,666 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 185 places, 243 transitions, 2962 flow. Second operand has 11 states, 11 states have (on average 9.454545454545455) internal successors, (104), 11 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:35:27,666 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:35:27,666 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41 [2024-06-14 15:35:27,667 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:35:29,321 INFO L124 PetriNetUnfolderBase]: 2676/4066 cut-off events. [2024-06-14 15:35:29,322 INFO L125 PetriNetUnfolderBase]: For 214617/214619 co-relation queries the response was YES. [2024-06-14 15:35:29,345 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29725 conditions, 4066 events. 2676/4066 cut-off events. For 214617/214619 co-relation queries the response was YES. Maximal size of possible extension queue 204. Compared 20831 event pairs, 663 based on Foata normal form. 12/4077 useless extension candidates. Maximal degree in co-relation 29639. Up to 3703 conditions per place. [2024-06-14 15:35:29,360 INFO L140 encePairwiseOnDemand]: 30/41 looper letters, 231 selfloop transitions, 50 changer transitions 0/284 dead transitions. [2024-06-14 15:35:29,360 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 193 places, 284 transitions, 3680 flow [2024-06-14 15:35:29,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 15:35:29,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 15:35:29,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 165 transitions. [2024-06-14 15:35:29,363 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44715447154471544 [2024-06-14 15:35:29,363 INFO L175 Difference]: Start difference. First operand has 185 places, 243 transitions, 2962 flow. Second operand 9 states and 165 transitions. [2024-06-14 15:35:29,363 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 193 places, 284 transitions, 3680 flow [2024-06-14 15:35:29,591 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 186 places, 284 transitions, 3544 flow, removed 16 selfloop flow, removed 7 redundant places. [2024-06-14 15:35:29,594 INFO L231 Difference]: Finished difference. Result has 187 places, 244 transitions, 2976 flow [2024-06-14 15:35:29,595 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=2826, PETRI_DIFFERENCE_MINUEND_PLACES=178, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=243, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=49, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=193, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2976, PETRI_PLACES=187, PETRI_TRANSITIONS=244} [2024-06-14 15:35:29,595 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 145 predicate places. [2024-06-14 15:35:29,595 INFO L495 AbstractCegarLoop]: Abstraction has has 187 places, 244 transitions, 2976 flow [2024-06-14 15:35:29,595 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 9.454545454545455) internal successors, (104), 11 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:35:29,595 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:35:29,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:35:29,596 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2024-06-14 15:35:29,596 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:35:29,596 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:35:29,596 INFO L85 PathProgramCache]: Analyzing trace with hash -1706448122, now seen corresponding path program 3 times [2024-06-14 15:35:29,596 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:35:29,596 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [918924324] [2024-06-14 15:35:29,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:35:29,597 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:35:29,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:35:41,756 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:35:41,756 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:35:41,756 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [918924324] [2024-06-14 15:35:41,756 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [918924324] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:35:41,756 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:35:41,756 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 15:35:41,756 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [805178019] [2024-06-14 15:35:41,756 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:35:41,756 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 15:35:41,757 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:35:41,757 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 15:35:41,757 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-14 15:35:41,980 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41 [2024-06-14 15:35:41,981 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 187 places, 244 transitions, 2976 flow. Second operand has 9 states, 9 states have (on average 9.777777777777779) internal successors, (88), 9 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:35:41,981 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:35:41,981 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41 [2024-06-14 15:35:41,981 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:35:43,404 INFO L124 PetriNetUnfolderBase]: 2712/4117 cut-off events. [2024-06-14 15:35:43,404 INFO L125 PetriNetUnfolderBase]: For 220583/220585 co-relation queries the response was YES. [2024-06-14 15:35:43,429 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30086 conditions, 4117 events. 2712/4117 cut-off events. For 220583/220585 co-relation queries the response was YES. Maximal size of possible extension queue 208. Compared 21160 event pairs, 706 based on Foata normal form. 8/4124 useless extension candidates. Maximal degree in co-relation 29999. Up to 3753 conditions per place. [2024-06-14 15:35:43,445 INFO L140 encePairwiseOnDemand]: 29/41 looper letters, 198 selfloop transitions, 77 changer transitions 0/278 dead transitions. [2024-06-14 15:35:43,445 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 194 places, 278 transitions, 3893 flow [2024-06-14 15:35:43,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 15:35:43,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 15:35:43,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 144 transitions. [2024-06-14 15:35:43,446 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43902439024390244 [2024-06-14 15:35:43,447 INFO L175 Difference]: Start difference. First operand has 187 places, 244 transitions, 2976 flow. Second operand 8 states and 144 transitions. [2024-06-14 15:35:43,447 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 194 places, 278 transitions, 3893 flow [2024-06-14 15:35:43,734 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 187 places, 278 transitions, 3759 flow, removed 17 selfloop flow, removed 7 redundant places. [2024-06-14 15:35:43,737 INFO L231 Difference]: Finished difference. Result has 188 places, 252 transitions, 3142 flow [2024-06-14 15:35:43,738 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=2842, PETRI_DIFFERENCE_MINUEND_PLACES=180, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=244, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=69, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=167, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=3142, PETRI_PLACES=188, PETRI_TRANSITIONS=252} [2024-06-14 15:35:43,738 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 146 predicate places. [2024-06-14 15:35:43,738 INFO L495 AbstractCegarLoop]: Abstraction has has 188 places, 252 transitions, 3142 flow [2024-06-14 15:35:43,738 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.777777777777779) internal successors, (88), 9 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:35:43,738 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:35:43,738 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:35:43,739 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2024-06-14 15:35:43,739 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:35:43,739 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:35:43,739 INFO L85 PathProgramCache]: Analyzing trace with hash -1110886188, now seen corresponding path program 3 times [2024-06-14 15:35:43,739 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:35:43,739 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [682763207] [2024-06-14 15:35:43,739 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:35:43,740 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:35:43,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:35:55,452 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:35:55,452 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:35:55,452 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [682763207] [2024-06-14 15:35:55,452 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [682763207] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:35:55,453 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:35:55,453 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 15:35:55,453 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1824956297] [2024-06-14 15:35:55,453 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:35:55,453 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 15:35:55,453 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:35:55,454 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 15:35:55,454 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-06-14 15:35:55,552 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41 [2024-06-14 15:35:55,553 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 188 places, 252 transitions, 3142 flow. Second operand has 9 states, 9 states have (on average 9.666666666666666) internal successors, (87), 9 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:35:55,553 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:35:55,553 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41 [2024-06-14 15:35:55,553 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:35:56,994 INFO L124 PetriNetUnfolderBase]: 2691/4103 cut-off events. [2024-06-14 15:35:56,994 INFO L125 PetriNetUnfolderBase]: For 223907/223907 co-relation queries the response was YES. [2024-06-14 15:35:57,017 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30285 conditions, 4103 events. 2691/4103 cut-off events. For 223907/223907 co-relation queries the response was YES. Maximal size of possible extension queue 208. Compared 21250 event pairs, 1247 based on Foata normal form. 3/4105 useless extension candidates. Maximal degree in co-relation 30197. Up to 4021 conditions per place. [2024-06-14 15:35:57,031 INFO L140 encePairwiseOnDemand]: 30/41 looper letters, 242 selfloop transitions, 29 changer transitions 0/274 dead transitions. [2024-06-14 15:35:57,031 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 195 places, 274 transitions, 3855 flow [2024-06-14 15:35:57,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 15:35:57,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 15:35:57,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 130 transitions. [2024-06-14 15:35:57,032 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39634146341463417 [2024-06-14 15:35:57,032 INFO L175 Difference]: Start difference. First operand has 188 places, 252 transitions, 3142 flow. Second operand 8 states and 130 transitions. [2024-06-14 15:35:57,033 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 195 places, 274 transitions, 3855 flow [2024-06-14 15:35:57,257 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 189 places, 274 transitions, 3603 flow, removed 53 selfloop flow, removed 6 redundant places. [2024-06-14 15:35:57,261 INFO L231 Difference]: Finished difference. Result has 191 places, 254 transitions, 2986 flow [2024-06-14 15:35:57,261 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=2892, PETRI_DIFFERENCE_MINUEND_PLACES=182, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=252, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=224, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2986, PETRI_PLACES=191, PETRI_TRANSITIONS=254} [2024-06-14 15:35:57,261 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 149 predicate places. [2024-06-14 15:35:57,261 INFO L495 AbstractCegarLoop]: Abstraction has has 191 places, 254 transitions, 2986 flow [2024-06-14 15:35:57,262 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.666666666666666) internal successors, (87), 9 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:35:57,262 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:35:57,262 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:57,262 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2024-06-14 15:35:57,262 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:57,262 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:35:57,262 INFO L85 PathProgramCache]: Analyzing trace with hash 414752526, now seen corresponding path program 4 times [2024-06-14 15:35:57,263 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:35:57,263 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [248075485] [2024-06-14 15:35:57,263 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:35:57,263 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:35:57,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:36:08,752 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:08,752 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:36:08,752 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [248075485] [2024-06-14 15:36:08,752 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [248075485] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:36:08,752 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:36:08,752 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-14 15:36:08,753 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1691039930] [2024-06-14 15:36:08,753 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:36:08,753 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-14 15:36:08,753 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:36:08,753 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-14 15:36:08,754 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-06-14 15:36:08,907 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41 [2024-06-14 15:36:08,907 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 191 places, 254 transitions, 2986 flow. Second operand has 8 states, 8 states have (on average 9.875) internal successors, (79), 8 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:36:08,907 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:36:08,907 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41 [2024-06-14 15:36:08,907 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:36:10,327 INFO L124 PetriNetUnfolderBase]: 2706/4124 cut-off events. [2024-06-14 15:36:10,327 INFO L125 PetriNetUnfolderBase]: For 230758/230758 co-relation queries the response was YES. [2024-06-14 15:36:10,349 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30230 conditions, 4124 events. 2706/4124 cut-off events. For 230758/230758 co-relation queries the response was YES. Maximal size of possible extension queue 210. Compared 21377 event pairs, 1248 based on Foata normal form. 3/4126 useless extension candidates. Maximal degree in co-relation 30140. Up to 4067 conditions per place. [2024-06-14 15:36:10,364 INFO L140 encePairwiseOnDemand]: 31/41 looper letters, 249 selfloop transitions, 22 changer transitions 0/274 dead transitions. [2024-06-14 15:36:10,364 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 197 places, 274 transitions, 3670 flow [2024-06-14 15:36:10,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-14 15:36:10,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-14 15:36:10,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 114 transitions. [2024-06-14 15:36:10,365 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.397212543554007 [2024-06-14 15:36:10,365 INFO L175 Difference]: Start difference. First operand has 191 places, 254 transitions, 2986 flow. Second operand 7 states and 114 transitions. [2024-06-14 15:36:10,365 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 197 places, 274 transitions, 3670 flow [2024-06-14 15:36:10,623 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 189 places, 274 transitions, 3396 flow, removed 17 selfloop flow, removed 8 redundant places. [2024-06-14 15:36:10,627 INFO L231 Difference]: Finished difference. Result has 190 places, 260 transitions, 2879 flow [2024-06-14 15:36:10,627 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=2738, PETRI_DIFFERENCE_MINUEND_PLACES=183, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=254, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=233, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2879, PETRI_PLACES=190, PETRI_TRANSITIONS=260} [2024-06-14 15:36:10,627 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 148 predicate places. [2024-06-14 15:36:10,627 INFO L495 AbstractCegarLoop]: Abstraction has has 190 places, 260 transitions, 2879 flow [2024-06-14 15:36:10,628 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.875) internal successors, (79), 8 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:36:10,628 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:36:10,628 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:36:10,628 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2024-06-14 15:36:10,628 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:36:10,628 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:36:10,628 INFO L85 PathProgramCache]: Analyzing trace with hash 414971264, now seen corresponding path program 5 times [2024-06-14 15:36:10,629 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:36:10,629 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [150853001] [2024-06-14 15:36:10,629 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:36:10,629 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:36:10,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:36:21,461 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:21,462 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:36:21,462 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [150853001] [2024-06-14 15:36:21,462 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [150853001] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:36:21,462 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:36:21,462 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-14 15:36:21,462 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2090005894] [2024-06-14 15:36:21,463 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:36:21,463 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-14 15:36:21,463 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:36:21,463 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-14 15:36:21,463 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-06-14 15:36:21,616 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41 [2024-06-14 15:36:21,617 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 190 places, 260 transitions, 2879 flow. Second operand has 8 states, 8 states have (on average 9.875) internal successors, (79), 8 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:36:21,617 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:36:21,617 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41 [2024-06-14 15:36:21,617 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:36:23,011 INFO L124 PetriNetUnfolderBase]: 2688/4101 cut-off events. [2024-06-14 15:36:23,012 INFO L125 PetriNetUnfolderBase]: For 233078/233080 co-relation queries the response was YES. [2024-06-14 15:36:23,034 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29726 conditions, 4101 events. 2688/4101 cut-off events. For 233078/233080 co-relation queries the response was YES. Maximal size of possible extension queue 209. Compared 21259 event pairs, 1247 based on Foata normal form. 8/4108 useless extension candidates. Maximal degree in co-relation 29636. Up to 3951 conditions per place. [2024-06-14 15:36:23,050 INFO L140 encePairwiseOnDemand]: 30/41 looper letters, 234 selfloop transitions, 38 changer transitions 0/275 dead transitions. [2024-06-14 15:36:23,050 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 196 places, 275 transitions, 3562 flow [2024-06-14 15:36:23,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-14 15:36:23,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-14 15:36:23,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 117 transitions. [2024-06-14 15:36:23,051 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4076655052264808 [2024-06-14 15:36:23,051 INFO L175 Difference]: Start difference. First operand has 190 places, 260 transitions, 2879 flow. Second operand 7 states and 117 transitions. [2024-06-14 15:36:23,051 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 196 places, 275 transitions, 3562 flow [2024-06-14 15:36:23,383 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 192 places, 275 transitions, 3482 flow, removed 22 selfloop flow, removed 4 redundant places. [2024-06-14 15:36:23,386 INFO L231 Difference]: Finished difference. Result has 193 places, 260 transitions, 2887 flow [2024-06-14 15:36:23,387 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=2799, PETRI_DIFFERENCE_MINUEND_PLACES=186, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=260, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=38, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=222, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2887, PETRI_PLACES=193, PETRI_TRANSITIONS=260} [2024-06-14 15:36:23,387 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 151 predicate places. [2024-06-14 15:36:23,387 INFO L495 AbstractCegarLoop]: Abstraction has has 193 places, 260 transitions, 2887 flow [2024-06-14 15:36:23,387 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.875) internal successors, (79), 8 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:36:23,387 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:36:23,387 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:36:23,388 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2024-06-14 15:36:23,388 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:36:23,388 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:36:23,388 INFO L85 PathProgramCache]: Analyzing trace with hash -1957836474, now seen corresponding path program 6 times [2024-06-14 15:36:23,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:36:23,388 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [591933969] [2024-06-14 15:36:23,388 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:36:23,389 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:36:23,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:36:33,977 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:36:33,978 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:36:33,978 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [591933969] [2024-06-14 15:36:33,978 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [591933969] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:36:33,978 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:36:33,978 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-14 15:36:33,978 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1490469687] [2024-06-14 15:36:33,978 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:36:33,979 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-14 15:36:33,979 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:36:33,979 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-14 15:36:33,979 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-06-14 15:36:34,112 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41 [2024-06-14 15:36:34,113 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 193 places, 260 transitions, 2887 flow. Second operand has 8 states, 8 states have (on average 9.875) internal successors, (79), 8 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:36:34,113 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:36:34,113 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41 [2024-06-14 15:36:34,113 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:36:35,504 INFO L124 PetriNetUnfolderBase]: 2673/4080 cut-off events. [2024-06-14 15:36:35,505 INFO L125 PetriNetUnfolderBase]: For 234332/234334 co-relation queries the response was YES. [2024-06-14 15:36:35,528 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29658 conditions, 4080 events. 2673/4080 cut-off events. For 234332/234334 co-relation queries the response was YES. Maximal size of possible extension queue 208. Compared 21159 event pairs, 1248 based on Foata normal form. 5/4084 useless extension candidates. Maximal degree in co-relation 29567. Up to 4022 conditions per place. [2024-06-14 15:36:35,543 INFO L140 encePairwiseOnDemand]: 31/41 looper letters, 246 selfloop transitions, 22 changer transitions 0/271 dead transitions. [2024-06-14 15:36:35,543 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 199 places, 271 transitions, 3452 flow [2024-06-14 15:36:35,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-14 15:36:35,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-14 15:36:35,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 111 transitions. [2024-06-14 15:36:35,545 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3867595818815331 [2024-06-14 15:36:35,545 INFO L175 Difference]: Start difference. First operand has 193 places, 260 transitions, 2887 flow. Second operand 7 states and 111 transitions. [2024-06-14 15:36:35,545 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 199 places, 271 transitions, 3452 flow [2024-06-14 15:36:35,855 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 195 places, 271 transitions, 3380 flow, removed 13 selfloop flow, removed 4 redundant places. [2024-06-14 15:36:35,858 INFO L231 Difference]: Finished difference. Result has 196 places, 260 transitions, 2867 flow [2024-06-14 15:36:35,859 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=2815, PETRI_DIFFERENCE_MINUEND_PLACES=189, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=260, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=238, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2867, PETRI_PLACES=196, PETRI_TRANSITIONS=260} [2024-06-14 15:36:35,859 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 154 predicate places. [2024-06-14 15:36:35,859 INFO L495 AbstractCegarLoop]: Abstraction has has 196 places, 260 transitions, 2867 flow [2024-06-14 15:36:35,859 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.875) internal successors, (79), 8 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:36:35,859 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:36:35,860 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:36:35,860 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2024-06-14 15:36:35,860 INFO L420 AbstractCegarLoop]: === Iteration 52 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 15:36:35,860 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:36:35,860 INFO L85 PathProgramCache]: Analyzing trace with hash 2085433431, now seen corresponding path program 4 times [2024-06-14 15:36:35,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:36:35,860 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [87164225] [2024-06-14 15:36:35,861 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:36:35,861 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:36:35,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:36:45,729 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:45,729 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:36:45,729 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [87164225] [2024-06-14 15:36:45,730 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [87164225] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:36:45,730 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:36:45,730 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 15:36:45,730 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1333370026] [2024-06-14 15:36:45,730 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:36:45,730 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 15:36:45,730 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:36:45,731 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 15:36:45,731 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-14 15:36:46,002 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41 [2024-06-14 15:36:46,003 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 196 places, 260 transitions, 2867 flow. Second operand has 10 states, 10 states have (on average 9.6) internal successors, (96), 10 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:36:46,003 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:36:46,003 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41 [2024-06-14 15:36:46,003 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:36:47,572 INFO L124 PetriNetUnfolderBase]: 2714/4151 cut-off events. [2024-06-14 15:36:47,572 INFO L125 PetriNetUnfolderBase]: For 250212/250214 co-relation queries the response was YES. [2024-06-14 15:36:47,598 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30231 conditions, 4151 events. 2714/4151 cut-off events. For 250212/250214 co-relation queries the response was YES. Maximal size of possible extension queue 213. Compared 21676 event pairs, 1229 based on Foata normal form. 12/4162 useless extension candidates. Maximal degree in co-relation 30139. Up to 3960 conditions per place. [2024-06-14 15:36:47,614 INFO L140 encePairwiseOnDemand]: 32/41 looper letters, 267 selfloop transitions, 19 changer transitions 0/289 dead transitions. [2024-06-14 15:36:47,615 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 203 places, 289 transitions, 3563 flow [2024-06-14 15:36:47,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 15:36:47,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 15:36:47,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 136 transitions. [2024-06-14 15:36:47,617 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4146341463414634 [2024-06-14 15:36:47,617 INFO L175 Difference]: Start difference. First operand has 196 places, 260 transitions, 2867 flow. Second operand 8 states and 136 transitions. [2024-06-14 15:36:47,618 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 203 places, 289 transitions, 3563 flow [2024-06-14 15:36:47,931 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 195 places, 289 transitions, 3456 flow, removed 5 selfloop flow, removed 8 redundant places. [2024-06-14 15:36:47,935 INFO L231 Difference]: Finished difference. Result has 196 places, 261 transitions, 2850 flow [2024-06-14 15:36:47,935 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=2760, PETRI_DIFFERENCE_MINUEND_PLACES=188, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=260, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=241, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2850, PETRI_PLACES=196, PETRI_TRANSITIONS=261} [2024-06-14 15:36:47,935 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 154 predicate places. [2024-06-14 15:36:47,935 INFO L495 AbstractCegarLoop]: Abstraction has has 196 places, 261 transitions, 2850 flow [2024-06-14 15:36:47,936 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.6) internal successors, (96), 10 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:36:47,936 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:36:47,936 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:36:47,936 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51 [2024-06-14 15:36:47,936 INFO L420 AbstractCegarLoop]: === Iteration 53 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 15:36:47,937 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:36:47,937 INFO L85 PathProgramCache]: Analyzing trace with hash 1800102921, now seen corresponding path program 5 times [2024-06-14 15:36:47,937 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:36:47,937 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [156430649] [2024-06-14 15:36:47,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:36:47,937 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:36:47,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:36:59,448 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:59,448 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:36:59,448 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [156430649] [2024-06-14 15:36:59,448 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [156430649] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:36:59,448 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:36:59,448 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 15:36:59,449 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [13452060] [2024-06-14 15:36:59,449 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:36:59,449 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 15:36:59,449 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:36:59,449 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 15:36:59,450 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-06-14 15:36:59,694 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41 [2024-06-14 15:36:59,695 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 196 places, 261 transitions, 2850 flow. Second operand has 11 states, 11 states have (on average 9.454545454545455) internal successors, (104), 11 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:36:59,695 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:36:59,695 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41 [2024-06-14 15:36:59,695 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:37:01,435 INFO L124 PetriNetUnfolderBase]: 2755/4211 cut-off events. [2024-06-14 15:37:01,436 INFO L125 PetriNetUnfolderBase]: For 261297/261305 co-relation queries the response was YES. [2024-06-14 15:37:01,459 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30901 conditions, 4211 events. 2755/4211 cut-off events. For 261297/261305 co-relation queries the response was YES. Maximal size of possible extension queue 217. Compared 22044 event pairs, 677 based on Foata normal form. 18/4228 useless extension candidates. Maximal degree in co-relation 30808. Up to 3640 conditions per place. [2024-06-14 15:37:01,473 INFO L140 encePairwiseOnDemand]: 31/41 looper letters, 235 selfloop transitions, 58 changer transitions 0/296 dead transitions. [2024-06-14 15:37:01,473 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 203 places, 296 transitions, 3586 flow [2024-06-14 15:37:01,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 15:37:01,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 15:37:01,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 149 transitions. [2024-06-14 15:37:01,476 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45426829268292684 [2024-06-14 15:37:01,476 INFO L175 Difference]: Start difference. First operand has 196 places, 261 transitions, 2850 flow. Second operand 8 states and 149 transitions. [2024-06-14 15:37:01,476 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 203 places, 296 transitions, 3586 flow [2024-06-14 15:37:01,787 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 197 places, 296 transitions, 3514 flow, removed 18 selfloop flow, removed 6 redundant places. [2024-06-14 15:37:01,791 INFO L231 Difference]: Finished difference. Result has 198 places, 262 transitions, 2953 flow [2024-06-14 15:37:01,791 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=2778, PETRI_DIFFERENCE_MINUEND_PLACES=190, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=261, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=57, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=203, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2953, PETRI_PLACES=198, PETRI_TRANSITIONS=262} [2024-06-14 15:37:01,791 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 156 predicate places. [2024-06-14 15:37:01,791 INFO L495 AbstractCegarLoop]: Abstraction has has 198 places, 262 transitions, 2953 flow [2024-06-14 15:37:01,792 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 9.454545454545455) internal successors, (104), 11 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:37:01,792 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:37:01,792 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:37:01,792 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52 [2024-06-14 15:37:01,792 INFO L420 AbstractCegarLoop]: === Iteration 54 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 15:37:01,792 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:37:01,792 INFO L85 PathProgramCache]: Analyzing trace with hash 1800333561, now seen corresponding path program 6 times [2024-06-14 15:37:01,793 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:37:01,793 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [702846134] [2024-06-14 15:37:01,793 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:37:01,793 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:37:01,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:37:13,510 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:13,511 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:37:13,511 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [702846134] [2024-06-14 15:37:13,511 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [702846134] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:37:13,511 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:37:13,511 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 15:37:13,511 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1160899900] [2024-06-14 15:37:13,511 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:37:13,511 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 15:37:13,512 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:37:13,512 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 15:37:13,512 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-06-14 15:37:13,758 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41 [2024-06-14 15:37:13,759 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 198 places, 262 transitions, 2953 flow. Second operand has 11 states, 11 states have (on average 9.454545454545455) internal successors, (104), 11 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:37:13,759 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:37:13,759 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41 [2024-06-14 15:37:13,759 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:37:15,356 INFO L124 PetriNetUnfolderBase]: 2771/4246 cut-off events. [2024-06-14 15:37:15,357 INFO L125 PetriNetUnfolderBase]: For 270034/270060 co-relation queries the response was YES. [2024-06-14 15:37:15,382 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31204 conditions, 4246 events. 2771/4246 cut-off events. For 270034/270060 co-relation queries the response was YES. Maximal size of possible extension queue 219. Compared 22375 event pairs, 697 based on Foata normal form. 36/4281 useless extension candidates. Maximal degree in co-relation 31110. Up to 3572 conditions per place. [2024-06-14 15:37:15,396 INFO L140 encePairwiseOnDemand]: 32/41 looper letters, 227 selfloop transitions, 64 changer transitions 0/294 dead transitions. [2024-06-14 15:37:15,397 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 205 places, 294 transitions, 3675 flow [2024-06-14 15:37:15,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 15:37:15,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 15:37:15,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 144 transitions. [2024-06-14 15:37:15,404 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43902439024390244 [2024-06-14 15:37:15,405 INFO L175 Difference]: Start difference. First operand has 198 places, 262 transitions, 2953 flow. Second operand 8 states and 144 transitions. [2024-06-14 15:37:15,405 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 205 places, 294 transitions, 3675 flow [2024-06-14 15:37:15,721 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 199 places, 294 transitions, 3516 flow, removed 25 selfloop flow, removed 6 redundant places. [2024-06-14 15:37:15,725 INFO L231 Difference]: Finished difference. Result has 200 places, 263 transitions, 2981 flow [2024-06-14 15:37:15,725 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=2798, PETRI_DIFFERENCE_MINUEND_PLACES=192, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=262, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=63, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=198, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2981, PETRI_PLACES=200, PETRI_TRANSITIONS=263} [2024-06-14 15:37:15,726 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 158 predicate places. [2024-06-14 15:37:15,726 INFO L495 AbstractCegarLoop]: Abstraction has has 200 places, 263 transitions, 2981 flow [2024-06-14 15:37:15,726 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 9.454545454545455) internal successors, (104), 11 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:37:15,726 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:37:15,726 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:37:15,727 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53 [2024-06-14 15:37:15,727 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:37:15,727 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:37:15,727 INFO L85 PathProgramCache]: Analyzing trace with hash 1605144462, now seen corresponding path program 4 times [2024-06-14 15:37:15,727 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:37:15,727 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [365425534] [2024-06-14 15:37:15,727 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:37:15,728 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:37:15,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:37:27,806 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:27,806 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:37:27,806 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [365425534] [2024-06-14 15:37:27,806 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [365425534] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:37:27,806 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:37:27,807 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 15:37:27,807 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [788760032] [2024-06-14 15:37:27,807 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:37:27,808 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 15:37:27,808 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:37:27,808 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 15:37:27,808 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-14 15:37:27,949 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41 [2024-06-14 15:37:27,949 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 200 places, 263 transitions, 2981 flow. Second operand has 9 states, 9 states have (on average 9.777777777777779) internal successors, (88), 9 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:37:27,949 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:37:27,949 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41 [2024-06-14 15:37:27,950 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:37:29,479 INFO L124 PetriNetUnfolderBase]: 2785/4274 cut-off events. [2024-06-14 15:37:29,479 INFO L125 PetriNetUnfolderBase]: For 253899/253901 co-relation queries the response was YES. [2024-06-14 15:37:29,504 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30962 conditions, 4274 events. 2785/4274 cut-off events. For 253899/253901 co-relation queries the response was YES. Maximal size of possible extension queue 221. Compared 22652 event pairs, 1276 based on Foata normal form. 8/4281 useless extension candidates. Maximal degree in co-relation 30867. Up to 4112 conditions per place. [2024-06-14 15:37:29,520 INFO L140 encePairwiseOnDemand]: 29/41 looper letters, 229 selfloop transitions, 51 changer transitions 0/283 dead transitions. [2024-06-14 15:37:29,520 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 207 places, 283 transitions, 3666 flow [2024-06-14 15:37:29,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 15:37:29,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 15:37:29,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 131 transitions. [2024-06-14 15:37:29,526 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39939024390243905 [2024-06-14 15:37:29,526 INFO L175 Difference]: Start difference. First operand has 200 places, 263 transitions, 2981 flow. Second operand 8 states and 131 transitions. [2024-06-14 15:37:29,526 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 207 places, 283 transitions, 3666 flow [2024-06-14 15:37:29,895 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 201 places, 283 transitions, 3487 flow, removed 28 selfloop flow, removed 6 redundant places. [2024-06-14 15:37:29,899 INFO L231 Difference]: Finished difference. Result has 202 places, 268 transitions, 3011 flow [2024-06-14 15:37:29,899 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=2802, PETRI_DIFFERENCE_MINUEND_PLACES=194, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=263, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=46, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=212, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=3011, PETRI_PLACES=202, PETRI_TRANSITIONS=268} [2024-06-14 15:37:29,900 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 160 predicate places. [2024-06-14 15:37:29,900 INFO L495 AbstractCegarLoop]: Abstraction has has 202 places, 268 transitions, 3011 flow [2024-06-14 15:37:29,900 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.777777777777779) internal successors, (88), 9 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:37:29,900 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:37:29,900 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:37:29,900 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54 [2024-06-14 15:37:29,901 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:37:29,901 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:37:29,901 INFO L85 PathProgramCache]: Analyzing trace with hash -1950655851, now seen corresponding path program 1 times [2024-06-14 15:37:29,901 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:37:29,901 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1408379085] [2024-06-14 15:37:29,901 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:37:29,902 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:37:29,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:37:41,674 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:41,675 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:37:41,675 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1408379085] [2024-06-14 15:37:41,675 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1408379085] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:37:41,675 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:37:41,675 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 15:37:41,675 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [804932396] [2024-06-14 15:37:41,675 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:37:41,675 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 15:37:41,675 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:37:41,676 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 15:37:41,676 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-06-14 15:37:41,788 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41 [2024-06-14 15:37:41,789 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 202 places, 268 transitions, 3011 flow. Second operand has 9 states, 9 states have (on average 9.777777777777779) internal successors, (88), 9 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:37:41,789 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:37:41,789 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41 [2024-06-14 15:37:41,789 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:37:43,421 INFO L124 PetriNetUnfolderBase]: 2793/4286 cut-off events. [2024-06-14 15:37:43,422 INFO L125 PetriNetUnfolderBase]: For 245272/245274 co-relation queries the response was YES. [2024-06-14 15:37:43,445 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30988 conditions, 4286 events. 2793/4286 cut-off events. For 245272/245274 co-relation queries the response was YES. Maximal size of possible extension queue 221. Compared 22713 event pairs, 1265 based on Foata normal form. 6/4291 useless extension candidates. Maximal degree in co-relation 30892. Up to 4158 conditions per place. [2024-06-14 15:37:43,461 INFO L140 encePairwiseOnDemand]: 30/41 looper letters, 253 selfloop transitions, 34 changer transitions 0/290 dead transitions. [2024-06-14 15:37:43,461 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 209 places, 290 transitions, 3881 flow [2024-06-14 15:37:43,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 15:37:43,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 15:37:43,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 129 transitions. [2024-06-14 15:37:43,462 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3932926829268293 [2024-06-14 15:37:43,462 INFO L175 Difference]: Start difference. First operand has 202 places, 268 transitions, 3011 flow. Second operand 8 states and 129 transitions. [2024-06-14 15:37:43,462 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 209 places, 290 transitions, 3881 flow [2024-06-14 15:37:43,800 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 203 places, 290 transitions, 3705 flow, removed 42 selfloop flow, removed 6 redundant places. [2024-06-14 15:37:43,803 INFO L231 Difference]: Finished difference. Result has 205 places, 276 transitions, 3093 flow [2024-06-14 15:37:43,804 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=2835, PETRI_DIFFERENCE_MINUEND_PLACES=196, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=268, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=237, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=3093, PETRI_PLACES=205, PETRI_TRANSITIONS=276} [2024-06-14 15:37:43,804 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 163 predicate places. [2024-06-14 15:37:43,804 INFO L495 AbstractCegarLoop]: Abstraction has has 205 places, 276 transitions, 3093 flow [2024-06-14 15:37:43,804 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.777777777777779) internal successors, (88), 9 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:37:43,805 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:37:43,805 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:43,805 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55 [2024-06-14 15:37:43,805 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:37:43,805 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:37:43,805 INFO L85 PathProgramCache]: Analyzing trace with hash -755123468, now seen corresponding path program 1 times [2024-06-14 15:37:43,805 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:37:43,806 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1543937664] [2024-06-14 15:37:43,806 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:37:43,806 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:37:43,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:38:02,256 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:38:02,256 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:38:02,256 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1543937664] [2024-06-14 15:38:02,256 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1543937664] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:38:02,256 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:38:02,256 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 15:38:02,257 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1437558578] [2024-06-14 15:38:02,257 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:38:02,257 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 15:38:02,257 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:38:02,257 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 15:38:02,257 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-06-14 15:38:02,427 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41 [2024-06-14 15:38:02,428 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 205 places, 276 transitions, 3093 flow. Second operand has 10 states, 10 states have (on average 9.7) internal successors, (97), 10 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:38:02,428 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:38:02,428 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41 [2024-06-14 15:38:02,428 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:38:04,351 INFO L124 PetriNetUnfolderBase]: 2935/4494 cut-off events. [2024-06-14 15:38:04,352 INFO L125 PetriNetUnfolderBase]: For 260621/260645 co-relation queries the response was YES. [2024-06-14 15:38:04,377 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32856 conditions, 4494 events. 2935/4494 cut-off events. For 260621/260645 co-relation queries the response was YES. Maximal size of possible extension queue 231. Compared 23957 event pairs, 741 based on Foata normal form. 26/4519 useless extension candidates. Maximal degree in co-relation 32758. Up to 4103 conditions per place. [2024-06-14 15:38:04,392 INFO L140 encePairwiseOnDemand]: 29/41 looper letters, 254 selfloop transitions, 93 changer transitions 0/350 dead transitions. [2024-06-14 15:38:04,392 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 214 places, 350 transitions, 4500 flow [2024-06-14 15:38:04,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 15:38:04,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 15:38:04,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 180 transitions. [2024-06-14 15:38:04,413 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43902439024390244 [2024-06-14 15:38:04,413 INFO L175 Difference]: Start difference. First operand has 205 places, 276 transitions, 3093 flow. Second operand 10 states and 180 transitions. [2024-06-14 15:38:04,413 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 214 places, 350 transitions, 4500 flow [2024-06-14 15:38:04,731 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 211 places, 350 transitions, 4367 flow, removed 57 selfloop flow, removed 3 redundant places. [2024-06-14 15:38:04,735 INFO L231 Difference]: Finished difference. Result has 216 places, 307 transitions, 3585 flow [2024-06-14 15:38:04,735 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=2960, PETRI_DIFFERENCE_MINUEND_PLACES=202, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=276, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=66, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=205, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=3585, PETRI_PLACES=216, PETRI_TRANSITIONS=307} [2024-06-14 15:38:04,735 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 174 predicate places. [2024-06-14 15:38:04,735 INFO L495 AbstractCegarLoop]: Abstraction has has 216 places, 307 transitions, 3585 flow [2024-06-14 15:38:04,736 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.7) internal successors, (97), 10 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:38:04,736 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:38:04,736 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:04,736 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable56 [2024-06-14 15:38:04,736 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:38:04,736 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:38:04,736 INFO L85 PathProgramCache]: Analyzing trace with hash -1262008918, now seen corresponding path program 2 times [2024-06-14 15:38:04,737 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:38:04,737 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1741178981] [2024-06-14 15:38:04,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:38:04,737 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:38:04,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:38:24,288 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:24,289 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:38:24,289 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1741178981] [2024-06-14 15:38:24,289 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1741178981] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:38:24,289 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:38:24,289 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 15:38:24,289 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2081967629] [2024-06-14 15:38:24,290 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:38:24,290 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 15:38:24,290 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:38:24,290 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 15:38:24,290 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-06-14 15:38:24,444 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41 [2024-06-14 15:38:24,444 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 216 places, 307 transitions, 3585 flow. Second operand has 10 states, 10 states have (on average 9.7) internal successors, (97), 10 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:38:24,444 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:38:24,444 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41 [2024-06-14 15:38:24,444 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:38:26,601 INFO L124 PetriNetUnfolderBase]: 3605/5486 cut-off events. [2024-06-14 15:38:26,602 INFO L125 PetriNetUnfolderBase]: For 338688/338714 co-relation queries the response was YES. [2024-06-14 15:38:26,642 INFO L83 FinitePrefix]: Finished finitePrefix Result has 42309 conditions, 5486 events. 3605/5486 cut-off events. For 338688/338714 co-relation queries the response was YES. Maximal size of possible extension queue 287. Compared 29956 event pairs, 1002 based on Foata normal form. 34/5519 useless extension candidates. Maximal degree in co-relation 42205. Up to 4659 conditions per place. [2024-06-14 15:38:26,665 INFO L140 encePairwiseOnDemand]: 27/41 looper letters, 323 selfloop transitions, 145 changer transitions 0/471 dead transitions. [2024-06-14 15:38:26,665 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 225 places, 471 transitions, 6297 flow [2024-06-14 15:38:26,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 15:38:26,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 15:38:26,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 192 transitions. [2024-06-14 15:38:26,667 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4682926829268293 [2024-06-14 15:38:26,667 INFO L175 Difference]: Start difference. First operand has 216 places, 307 transitions, 3585 flow. Second operand 10 states and 192 transitions. [2024-06-14 15:38:26,667 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 225 places, 471 transitions, 6297 flow [2024-06-14 15:38:27,264 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 222 places, 471 transitions, 6151 flow, removed 59 selfloop flow, removed 3 redundant places. [2024-06-14 15:38:27,270 INFO L231 Difference]: Finished difference. Result has 228 places, 416 transitions, 5411 flow [2024-06-14 15:38:27,270 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=3489, PETRI_DIFFERENCE_MINUEND_PLACES=213, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=307, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=45, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=189, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=5411, PETRI_PLACES=228, PETRI_TRANSITIONS=416} [2024-06-14 15:38:27,270 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 186 predicate places. [2024-06-14 15:38:27,271 INFO L495 AbstractCegarLoop]: Abstraction has has 228 places, 416 transitions, 5411 flow [2024-06-14 15:38:27,271 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.7) internal successors, (97), 10 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:38:27,271 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:38:27,271 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:27,271 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable57 [2024-06-14 15:38:27,271 INFO L420 AbstractCegarLoop]: === Iteration 59 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 15:38:27,272 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:38:27,272 INFO L85 PathProgramCache]: Analyzing trace with hash -1462207788, now seen corresponding path program 3 times [2024-06-14 15:38:27,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:38:27,272 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [596152213] [2024-06-14 15:38:27,272 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:38:27,272 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:38:27,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:38:42,117 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:42,117 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:38:42,117 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [596152213] [2024-06-14 15:38:42,117 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [596152213] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:38:42,118 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:38:42,118 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 15:38:42,118 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [108345780] [2024-06-14 15:38:42,118 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:38:42,118 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 15:38:42,118 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:38:42,119 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 15:38:42,119 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-06-14 15:38:42,311 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41 [2024-06-14 15:38:42,311 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 228 places, 416 transitions, 5411 flow. Second operand has 10 states, 10 states have (on average 9.7) internal successors, (97), 10 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:38:42,311 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:38:42,312 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41 [2024-06-14 15:38:42,312 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:38:44,645 INFO L124 PetriNetUnfolderBase]: 3701/5634 cut-off events. [2024-06-14 15:38:44,646 INFO L125 PetriNetUnfolderBase]: For 353088/353130 co-relation queries the response was YES. [2024-06-14 15:38:44,681 INFO L83 FinitePrefix]: Finished finitePrefix Result has 45339 conditions, 5634 events. 3701/5634 cut-off events. For 353088/353130 co-relation queries the response was YES. Maximal size of possible extension queue 300. Compared 30867 event pairs, 833 based on Foata normal form. 46/5679 useless extension candidates. Maximal degree in co-relation 45229. Up to 4815 conditions per place. [2024-06-14 15:38:44,703 INFO L140 encePairwiseOnDemand]: 28/41 looper letters, 287 selfloop transitions, 185 changer transitions 0/475 dead transitions. [2024-06-14 15:38:44,703 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 237 places, 475 transitions, 6991 flow [2024-06-14 15:38:44,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 15:38:44,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 15:38:44,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 182 transitions. [2024-06-14 15:38:44,712 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44390243902439025 [2024-06-14 15:38:44,713 INFO L175 Difference]: Start difference. First operand has 228 places, 416 transitions, 5411 flow. Second operand 10 states and 182 transitions. [2024-06-14 15:38:44,713 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 237 places, 475 transitions, 6991 flow [2024-06-14 15:38:45,271 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 235 places, 475 transitions, 6834 flow, removed 71 selfloop flow, removed 2 redundant places. [2024-06-14 15:38:45,277 INFO L231 Difference]: Finished difference. Result has 238 places, 434 transitions, 6071 flow [2024-06-14 15:38:45,277 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=5308, PETRI_DIFFERENCE_MINUEND_PLACES=226, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=416, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=171, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=241, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=6071, PETRI_PLACES=238, PETRI_TRANSITIONS=434} [2024-06-14 15:38:45,278 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 196 predicate places. [2024-06-14 15:38:45,278 INFO L495 AbstractCegarLoop]: Abstraction has has 238 places, 434 transitions, 6071 flow [2024-06-14 15:38:45,278 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.7) internal successors, (97), 10 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:38:45,278 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:38:45,278 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:45,278 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable58 [2024-06-14 15:38:45,278 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:38:45,279 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:38:45,279 INFO L85 PathProgramCache]: Analyzing trace with hash -721852438, now seen corresponding path program 4 times [2024-06-14 15:38:45,279 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:38:45,280 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [486365444] [2024-06-14 15:38:45,280 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:38:45,280 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:38:45,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:39:01,897 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:01,897 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:39:01,897 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [486365444] [2024-06-14 15:39:01,897 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [486365444] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:39:01,898 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:39:01,898 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 15:39:01,898 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [750622139] [2024-06-14 15:39:01,898 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:39:01,898 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 15:39:01,898 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:39:01,899 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 15:39:01,899 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-06-14 15:39:02,071 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41 [2024-06-14 15:39:02,071 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 238 places, 434 transitions, 6071 flow. Second operand has 9 states, 9 states have (on average 9.88888888888889) internal successors, (89), 9 states have internal predecessors, (89), 0 states have call successors, (0), 0 states 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:02,071 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:39:02,072 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41 [2024-06-14 15:39:02,072 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:39:04,227 INFO L124 PetriNetUnfolderBase]: 3717/5660 cut-off events. [2024-06-14 15:39:04,227 INFO L125 PetriNetUnfolderBase]: For 369059/369081 co-relation queries the response was YES. [2024-06-14 15:39:04,270 INFO L83 FinitePrefix]: Finished finitePrefix Result has 47023 conditions, 5660 events. 3717/5660 cut-off events. For 369059/369081 co-relation queries the response was YES. Maximal size of possible extension queue 300. Compared 31228 event pairs, 922 based on Foata normal form. 26/5685 useless extension candidates. Maximal degree in co-relation 46909. Up to 5000 conditions per place. [2024-06-14 15:39:04,294 INFO L140 encePairwiseOnDemand]: 29/41 looper letters, 318 selfloop transitions, 156 changer transitions 0/477 dead transitions. [2024-06-14 15:39:04,294 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 246 places, 477 transitions, 7530 flow [2024-06-14 15:39:04,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 15:39:04,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 15:39:04,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 168 transitions. [2024-06-14 15:39:04,295 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45528455284552843 [2024-06-14 15:39:04,295 INFO L175 Difference]: Start difference. First operand has 238 places, 434 transitions, 6071 flow. Second operand 9 states and 168 transitions. [2024-06-14 15:39:04,295 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 246 places, 477 transitions, 7530 flow [2024-06-14 15:39:05,000 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 239 places, 477 transitions, 7191 flow, removed 70 selfloop flow, removed 7 redundant places. [2024-06-14 15:39:05,006 INFO L231 Difference]: Finished difference. Result has 241 places, 439 transitions, 6181 flow [2024-06-14 15:39:05,006 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=5748, PETRI_DIFFERENCE_MINUEND_PLACES=231, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=434, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=151, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=281, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=6181, PETRI_PLACES=241, PETRI_TRANSITIONS=439} [2024-06-14 15:39:05,008 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 199 predicate places. [2024-06-14 15:39:05,008 INFO L495 AbstractCegarLoop]: Abstraction has has 241 places, 439 transitions, 6181 flow [2024-06-14 15:39:05,008 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.88888888888889) internal successors, (89), 9 states have internal predecessors, (89), 0 states have call successors, (0), 0 states 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,008 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:39:05,009 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:05,009 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable59 [2024-06-14 15:39:05,009 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:39:05,009 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:39:05,009 INFO L85 PathProgramCache]: Analyzing trace with hash -688372438, now seen corresponding path program 5 times [2024-06-14 15:39:05,009 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:39:05,009 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [292211300] [2024-06-14 15:39:05,010 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:39:05,010 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:39:05,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:39:20,960 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:20,961 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:39:20,961 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [292211300] [2024-06-14 15:39:20,961 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [292211300] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:39:20,961 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:39:20,961 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 15:39:20,961 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [698485482] [2024-06-14 15:39:20,961 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:39:20,962 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 15:39:20,962 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:39:20,962 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 15:39:20,962 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-06-14 15:39:21,133 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41 [2024-06-14 15:39:21,134 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 241 places, 439 transitions, 6181 flow. Second operand has 9 states, 9 states have (on average 9.88888888888889) internal successors, (89), 9 states have internal predecessors, (89), 0 states have call successors, (0), 0 states 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:21,134 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:39:21,134 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41 [2024-06-14 15:39:21,134 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:39:23,354 INFO L124 PetriNetUnfolderBase]: 3697/5632 cut-off events. [2024-06-14 15:39:23,354 INFO L125 PetriNetUnfolderBase]: For 360171/360197 co-relation queries the response was YES. [2024-06-14 15:39:23,391 INFO L83 FinitePrefix]: Finished finitePrefix Result has 46390 conditions, 5632 events. 3697/5632 cut-off events. For 360171/360197 co-relation queries the response was YES. Maximal size of possible extension queue 299. Compared 31019 event pairs, 920 based on Foata normal form. 34/5665 useless extension candidates. Maximal degree in co-relation 46275. Up to 5083 conditions per place. [2024-06-14 15:39:23,412 INFO L140 encePairwiseOnDemand]: 29/41 looper letters, 327 selfloop transitions, 144 changer transitions 0/474 dead transitions. [2024-06-14 15:39:23,412 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 249 places, 474 transitions, 7451 flow [2024-06-14 15:39:23,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 15:39:23,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 15:39:23,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 162 transitions. [2024-06-14 15:39:23,414 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43902439024390244 [2024-06-14 15:39:23,414 INFO L175 Difference]: Start difference. First operand has 241 places, 439 transitions, 6181 flow. Second operand 9 states and 162 transitions. [2024-06-14 15:39:23,414 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 249 places, 474 transitions, 7451 flow [2024-06-14 15:39:24,036 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 243 places, 474 transitions, 7068 flow, removed 49 selfloop flow, removed 6 redundant places. [2024-06-14 15:39:24,042 INFO L231 Difference]: Finished difference. Result has 245 places, 443 transitions, 6191 flow [2024-06-14 15:39:24,043 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=5812, PETRI_DIFFERENCE_MINUEND_PLACES=235, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=439, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=140, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=295, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=6191, PETRI_PLACES=245, PETRI_TRANSITIONS=443} [2024-06-14 15:39:24,043 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 203 predicate places. [2024-06-14 15:39:24,043 INFO L495 AbstractCegarLoop]: Abstraction has has 245 places, 443 transitions, 6191 flow [2024-06-14 15:39:24,044 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.88888888888889) internal successors, (89), 9 states have internal predecessors, (89), 0 states have call successors, (0), 0 states 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:24,044 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:39:24,044 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:24,044 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable60 [2024-06-14 15:39:24,044 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:39:24,044 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:39:24,044 INFO L85 PathProgramCache]: Analyzing trace with hash -721613118, now seen corresponding path program 1 times [2024-06-14 15:39:24,045 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:39:24,045 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1353232036] [2024-06-14 15:39:24,045 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:39:24,045 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:39:24,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:39:37,600 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:39:37,601 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:39:37,601 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1353232036] [2024-06-14 15:39:37,601 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1353232036] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:39:37,601 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:39:37,601 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 15:39:37,601 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1263715023] [2024-06-14 15:39:37,601 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:39:37,602 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 15:39:37,602 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:39:37,602 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 15:39:37,602 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-14 15:39:37,761 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41 [2024-06-14 15:39:37,762 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 245 places, 443 transitions, 6191 flow. Second operand has 10 states, 10 states have (on average 9.7) internal successors, (97), 10 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:39:37,762 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:39:37,762 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41 [2024-06-14 15:39:37,762 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:39:40,064 INFO L124 PetriNetUnfolderBase]: 3786/5762 cut-off events. [2024-06-14 15:39:40,064 INFO L125 PetriNetUnfolderBase]: For 370243/370289 co-relation queries the response was YES. [2024-06-14 15:39:40,113 INFO L83 FinitePrefix]: Finished finitePrefix Result has 47779 conditions, 5762 events. 3786/5762 cut-off events. For 370243/370289 co-relation queries the response was YES. Maximal size of possible extension queue 305. Compared 31820 event pairs, 997 based on Foata normal form. 50/5811 useless extension candidates. Maximal degree in co-relation 47662. Up to 4773 conditions per place. [2024-06-14 15:39:40,142 INFO L140 encePairwiseOnDemand]: 27/41 looper letters, 252 selfloop transitions, 250 changer transitions 0/505 dead transitions. [2024-06-14 15:39:40,143 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 254 places, 505 transitions, 8017 flow [2024-06-14 15:39:40,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 15:39:40,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 15:39:40,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 188 transitions. [2024-06-14 15:39:40,146 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4585365853658537 [2024-06-14 15:39:40,147 INFO L175 Difference]: Start difference. First operand has 245 places, 443 transitions, 6191 flow. Second operand 10 states and 188 transitions. [2024-06-14 15:39:40,147 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 254 places, 505 transitions, 8017 flow [2024-06-14 15:39:40,864 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 248 places, 505 transitions, 7703 flow, removed 6 selfloop flow, removed 6 redundant places. [2024-06-14 15:39:40,871 INFO L231 Difference]: Finished difference. Result has 252 places, 468 transitions, 6990 flow [2024-06-14 15:39:40,871 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=5909, PETRI_DIFFERENCE_MINUEND_PLACES=239, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=443, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=229, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=209, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=6990, PETRI_PLACES=252, PETRI_TRANSITIONS=468} [2024-06-14 15:39:40,872 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 210 predicate places. [2024-06-14 15:39:40,872 INFO L495 AbstractCegarLoop]: Abstraction has has 252 places, 468 transitions, 6990 flow [2024-06-14 15:39:40,872 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.7) internal successors, (97), 10 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:39:40,872 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:39:40,872 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:40,872 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable61 [2024-06-14 15:39:40,872 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:39:40,873 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:39:40,873 INFO L85 PathProgramCache]: Analyzing trace with hash -1005092086, now seen corresponding path program 2 times [2024-06-14 15:39:40,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:39:40,873 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [218461030] [2024-06-14 15:39:40,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:39:40,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:39:40,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:39:54,188 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:39:54,189 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:39:54,189 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [218461030] [2024-06-14 15:39:54,189 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [218461030] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:39:54,189 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:39:54,189 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 15:39:54,189 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1470591957] [2024-06-14 15:39:54,189 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:39:54,189 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 15:39:54,189 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:39:54,190 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 15:39:54,190 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-06-14 15:39:54,457 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41 [2024-06-14 15:39:54,472 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 252 places, 468 transitions, 6990 flow. Second operand has 10 states, 10 states have (on average 9.7) internal successors, (97), 10 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:39:54,472 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:39:54,472 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41 [2024-06-14 15:39:54,472 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:39:56,806 INFO L124 PetriNetUnfolderBase]: 3920/5952 cut-off events. [2024-06-14 15:39:56,807 INFO L125 PetriNetUnfolderBase]: For 398111/398137 co-relation queries the response was YES. [2024-06-14 15:39:56,852 INFO L83 FinitePrefix]: Finished finitePrefix Result has 51247 conditions, 5952 events. 3920/5952 cut-off events. For 398111/398137 co-relation queries the response was YES. Maximal size of possible extension queue 318. Compared 32961 event pairs, 1064 based on Foata normal form. 30/5981 useless extension candidates. Maximal degree in co-relation 51126. Up to 5227 conditions per place. [2024-06-14 15:39:56,876 INFO L140 encePairwiseOnDemand]: 27/41 looper letters, 331 selfloop transitions, 200 changer transitions 0/534 dead transitions. [2024-06-14 15:39:56,876 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 261 places, 534 transitions, 8920 flow [2024-06-14 15:39:56,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 15:39:56,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 15:39:56,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 186 transitions. [2024-06-14 15:39:56,877 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45365853658536587 [2024-06-14 15:39:56,878 INFO L175 Difference]: Start difference. First operand has 252 places, 468 transitions, 6990 flow. Second operand 10 states and 186 transitions. [2024-06-14 15:39:56,878 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 261 places, 534 transitions, 8920 flow [2024-06-14 15:39:57,501 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 257 places, 534 transitions, 8443 flow, removed 125 selfloop flow, removed 4 redundant places. [2024-06-14 15:39:57,509 INFO L231 Difference]: Finished difference. Result has 260 places, 500 transitions, 7656 flow [2024-06-14 15:39:57,509 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=6644, PETRI_DIFFERENCE_MINUEND_PLACES=248, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=468, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=172, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=279, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=7656, PETRI_PLACES=260, PETRI_TRANSITIONS=500} [2024-06-14 15:39:57,509 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 218 predicate places. [2024-06-14 15:39:57,509 INFO L495 AbstractCegarLoop]: Abstraction has has 260 places, 500 transitions, 7656 flow [2024-06-14 15:39:57,510 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.7) internal successors, (97), 10 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:39:57,510 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:39:57,510 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:57,510 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable62 [2024-06-14 15:39:57,510 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:39:57,510 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:39:57,510 INFO L85 PathProgramCache]: Analyzing trace with hash 28734922, now seen corresponding path program 3 times [2024-06-14 15:39:57,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:39:57,511 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [747493729] [2024-06-14 15:39:57,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:39:57,511 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:39:57,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:40:10,926 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:10,927 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:40:10,927 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [747493729] [2024-06-14 15:40:10,928 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [747493729] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:40:10,928 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:40:10,928 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 15:40:10,928 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1589271058] [2024-06-14 15:40:10,928 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:40:10,929 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 15:40:10,929 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:40:10,933 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 15:40:10,933 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-14 15:40:11,153 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41 [2024-06-14 15:40:11,153 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 260 places, 500 transitions, 7656 flow. Second operand has 10 states, 10 states have (on average 9.7) internal successors, (97), 10 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:40:11,153 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:40:11,153 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41 [2024-06-14 15:40:11,154 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:40:13,504 INFO L124 PetriNetUnfolderBase]: 3908/5936 cut-off events. [2024-06-14 15:40:13,504 INFO L125 PetriNetUnfolderBase]: For 400771/400797 co-relation queries the response was YES. [2024-06-14 15:40:13,560 INFO L83 FinitePrefix]: Finished finitePrefix Result has 51386 conditions, 5936 events. 3908/5936 cut-off events. For 400771/400797 co-relation queries the response was YES. Maximal size of possible extension queue 317. Compared 32853 event pairs, 1055 based on Foata normal form. 30/5965 useless extension candidates. Maximal degree in co-relation 51261. Up to 5282 conditions per place. [2024-06-14 15:40:13,589 INFO L140 encePairwiseOnDemand]: 27/41 looper letters, 352 selfloop transitions, 176 changer transitions 0/531 dead transitions. [2024-06-14 15:40:13,589 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 270 places, 531 transitions, 8814 flow [2024-06-14 15:40:13,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-14 15:40:13,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-14 15:40:13,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 191 transitions. [2024-06-14 15:40:13,597 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42350332594235035 [2024-06-14 15:40:13,597 INFO L175 Difference]: Start difference. First operand has 260 places, 500 transitions, 7656 flow. Second operand 11 states and 191 transitions. [2024-06-14 15:40:13,597 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 270 places, 531 transitions, 8814 flow [2024-06-14 15:40:14,406 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 267 places, 531 transitions, 8585 flow, removed 57 selfloop flow, removed 3 redundant places. [2024-06-14 15:40:14,413 INFO L231 Difference]: Finished difference. Result has 268 places, 500 transitions, 7787 flow [2024-06-14 15:40:14,413 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=7427, PETRI_DIFFERENCE_MINUEND_PLACES=257, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=500, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=176, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=324, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=7787, PETRI_PLACES=268, PETRI_TRANSITIONS=500} [2024-06-14 15:40:14,414 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 226 predicate places. [2024-06-14 15:40:14,414 INFO L495 AbstractCegarLoop]: Abstraction has has 268 places, 500 transitions, 7787 flow [2024-06-14 15:40:14,414 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.7) internal successors, (97), 10 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:40:14,414 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:40:14,414 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,415 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable63 [2024-06-14 15:40:14,415 INFO L420 AbstractCegarLoop]: === Iteration 65 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 15:40:14,415 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:40:14,415 INFO L85 PathProgramCache]: Analyzing trace with hash -495675651, now seen corresponding path program 1 times [2024-06-14 15:40:14,415 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:40:14,415 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1408429033] [2024-06-14 15:40:14,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:40:14,416 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:40:14,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat Killed by 15