./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/weaver/popl20-proofs-counter-add-4-semi-Q67.wvr.c --full-output --witness-type correctness_witness --witnessparser.only.consider.loop.invariants false --validate ./goblint.2024-06-19_11-23-25.files/protection/popl20-proofs-counter-add-4-semi-Q67.wvr.yml/witness.yml --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 7724a2de 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/weaver/popl20-proofs-counter-add-4-semi-Q67.wvr.c ./goblint.2024-06-19_11-23-25.files/protection/popl20-proofs-counter-add-4-semi-Q67.wvr.yml/witness.yml -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --traceabstraction.compute.hoare.annotation.of.negated.interpolant.automaton,.abstraction.and.cfg false --witnessparser.only.consider.loop.invariants false --- Real Ultimate output --- This is Ultimate 0.2.4-tmp.fs.goblint-validation-7724a2d-m [2024-06-27 18:03:33,911 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-06-27 18:03:34,009 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-06-27 18:03:34,014 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-06-27 18:03:34,014 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-06-27 18:03:34,042 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-06-27 18:03:34,043 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-06-27 18:03:34,044 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-06-27 18:03:34,045 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-06-27 18:03:34,048 INFO L153 SettingsManager]: * Use memory slicer=true [2024-06-27 18:03:34,049 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-06-27 18:03:34,049 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-06-27 18:03:34,049 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-06-27 18:03:34,051 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-06-27 18:03:34,051 INFO L153 SettingsManager]: * Use SBE=true [2024-06-27 18:03:34,051 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-06-27 18:03:34,052 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-06-27 18:03:34,052 INFO L153 SettingsManager]: * sizeof long=4 [2024-06-27 18:03:34,052 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-06-27 18:03:34,052 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-06-27 18:03:34,053 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-06-27 18:03:34,053 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-06-27 18:03:34,053 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-06-27 18:03:34,054 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-06-27 18:03:34,054 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-06-27 18:03:34,054 INFO L153 SettingsManager]: * sizeof long double=12 [2024-06-27 18:03:34,054 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-06-27 18:03:34,055 INFO L153 SettingsManager]: * Use constant arrays=true [2024-06-27 18:03:34,055 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-06-27 18:03:34,056 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-06-27 18:03:34,057 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-06-27 18:03:34,057 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-06-27 18:03:34,057 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-27 18:03:34,057 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-06-27 18:03:34,058 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-06-27 18:03:34,058 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-06-27 18:03:34,058 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-06-27 18:03:34,058 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-06-27 18:03:34,058 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-06-27 18:03:34,059 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-06-27 18:03:34,059 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-06-27 18:03:34,059 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-06-27 18:03:34,059 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-06-27 18:03:34,060 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessparser: Only consider loop invariants -> false [2024-06-27 18:03:34,330 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-06-27 18:03:34,359 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-06-27 18:03:34,361 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-06-27 18:03:34,362 INFO L270 PluginConnector]: Initializing CDTParser... [2024-06-27 18:03:34,363 INFO L274 PluginConnector]: CDTParser initialized [2024-06-27 18:03:34,364 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-proofs-counter-add-4-semi-Q67.wvr.c [2024-06-27 18:03:35,581 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-06-27 18:03:35,787 INFO L384 CDTParser]: Found 1 translation units. [2024-06-27 18:03:35,789 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-proofs-counter-add-4-semi-Q67.wvr.c [2024-06-27 18:03:35,800 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/15d2f3cd3/2ecd358038f44a2b960dc9b34d5fa91f/FLAG55aff6e47 [2024-06-27 18:03:36,145 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/15d2f3cd3/2ecd358038f44a2b960dc9b34d5fa91f [2024-06-27 18:03:36,148 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-06-27 18:03:36,148 INFO L274 PluginConnector]: Witness Parser initialized [2024-06-27 18:03:36,150 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/./goblint.2024-06-19_11-23-25.files/protection/popl20-proofs-counter-add-4-semi-Q67.wvr.yml/witness.yml [2024-06-27 18:03:36,265 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-06-27 18:03:36,267 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-06-27 18:03:36,268 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-06-27 18:03:36,268 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-06-27 18:03:36,273 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-06-27 18:03:36,274 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.06 06:03:36" (1/2) ... [2024-06-27 18:03:36,275 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@8bb87b5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 06:03:36, skipping insertion in model container [2024-06-27 18:03:36,275 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.06 06:03:36" (1/2) ... [2024-06-27 18:03:36,277 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@49d6fcd1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 06:03:36, skipping insertion in model container [2024-06-27 18:03:36,278 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 27.06 06:03:36" (2/2) ... [2024-06-27 18:03:36,278 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@8bb87b5 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.06 06:03:36, skipping insertion in model container [2024-06-27 18:03:36,278 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 27.06 06:03:36" (2/2) ... [2024-06-27 18:03:36,279 INFO L83 nessWitnessExtractor]: Extracting all invariants from correctness witness [2024-06-27 18:03:36,298 INFO L95 edCorrectnessWitness]: Found the following entries in the witness: [2024-06-27 18:03:36,300 INFO L97 edCorrectnessWitness]: Location invariant before [L97-L97] (((! multithreaded || 0 <= i2) && (! multithreaded || 0 <= j2)) && (! multithreaded || 0 <= j1)) && (! multithreaded || 0 <= i1) [2024-06-27 18:03:36,303 INFO L97 edCorrectnessWitness]: Location invariant before [L98-L98] (((! multithreaded || 0 <= i2) && (! multithreaded || 0 <= j2)) && (! multithreaded || 0 <= j1)) && (! multithreaded || 0 <= i1) [2024-06-27 18:03:36,304 INFO L97 edCorrectnessWitness]: Location invariant before [L99-L99] (((! multithreaded || 0 <= i2) && (! multithreaded || 0 <= j2)) && (! multithreaded || 0 <= j1)) && (! multithreaded || 0 <= i1) [2024-06-27 18:03:36,304 INFO L97 edCorrectnessWitness]: Location invariant before [L96-L96] (((! multithreaded || 0 <= i2) && (! multithreaded || 0 <= j2)) && (! multithreaded || 0 <= j1)) && (! multithreaded || 0 <= i1) [2024-06-27 18:03:36,304 INFO L103 edCorrectnessWitness]: ghost_variable multithreaded = 0 [2024-06-27 18:03:36,304 INFO L106 edCorrectnessWitness]: ghost_update [L95-L95] multithreaded = 1; [2024-06-27 18:03:36,335 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-06-27 18:03:36,548 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-proofs-counter-add-4-semi-Q67.wvr.c[2663,2676] [2024-06-27 18:03:36,558 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-27 18:03:36,567 INFO L202 MainTranslator]: Completed pre-run Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local [2024-06-27 18:03:36,643 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-proofs-counter-add-4-semi-Q67.wvr.c[2663,2676] [2024-06-27 18:03:36,644 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-27 18:03:36,660 INFO L206 MainTranslator]: Completed translation [2024-06-27 18:03:36,661 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.06 06:03:36 WrapperNode [2024-06-27 18:03:36,661 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-06-27 18:03:36,662 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-06-27 18:03:36,662 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-06-27 18:03:36,662 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-06-27 18:03:36,669 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 27.06 06:03:36" (1/1) ... [2024-06-27 18:03:36,687 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 27.06 06:03:36" (1/1) ... [2024-06-27 18:03:36,721 INFO L138 Inliner]: procedures = 21, calls = 22, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 121 [2024-06-27 18:03:36,722 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-06-27 18:03:36,723 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-06-27 18:03:36,723 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-06-27 18:03:36,723 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-06-27 18:03:36,733 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.06 06:03:36" (1/1) ... [2024-06-27 18:03:36,733 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.06 06:03:36" (1/1) ... [2024-06-27 18:03:36,736 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.06 06:03:36" (1/1) ... [2024-06-27 18:03:36,754 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-27 18:03:36,755 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.06 06:03:36" (1/1) ... [2024-06-27 18:03:36,755 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.06 06:03:36" (1/1) ... [2024-06-27 18:03:36,762 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.06 06:03:36" (1/1) ... [2024-06-27 18:03:36,765 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.06 06:03:36" (1/1) ... [2024-06-27 18:03:36,767 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.06 06:03:36" (1/1) ... [2024-06-27 18:03:36,768 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.06 06:03:36" (1/1) ... [2024-06-27 18:03:36,774 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-06-27 18:03:36,775 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-06-27 18:03:36,775 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-06-27 18:03:36,775 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-06-27 18:03:36,776 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.06 06:03:36" (1/1) ... [2024-06-27 18:03:36,781 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-27 18:03:36,791 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-27 18:03:36,809 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-27 18:03:36,815 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-27 18:03:36,842 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-06-27 18:03:36,843 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-06-27 18:03:36,843 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-06-27 18:03:36,843 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-06-27 18:03:36,843 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-06-27 18:03:36,843 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2024-06-27 18:03:36,843 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2024-06-27 18:03:36,844 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2024-06-27 18:03:36,844 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2024-06-27 18:03:36,845 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-06-27 18:03:36,845 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-06-27 18:03:36,846 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-06-27 18:03:36,846 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-06-27 18:03:36,849 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-06-27 18:03:36,851 WARN L214 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-06-27 18:03:36,959 INFO L244 CfgBuilder]: Building ICFG [2024-06-27 18:03:36,962 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-06-27 18:03:37,231 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-06-27 18:03:37,231 INFO L293 CfgBuilder]: Performing block encoding [2024-06-27 18:03:37,374 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-06-27 18:03:37,375 INFO L320 CfgBuilder]: Removed 4 assume(true) statements. [2024-06-27 18:03:37,375 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.06 06:03:37 BoogieIcfgContainer [2024-06-27 18:03:37,375 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-06-27 18:03:37,377 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-06-27 18:03:37,377 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-06-27 18:03:37,380 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-06-27 18:03:37,380 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.06 06:03:36" (1/4) ... [2024-06-27 18:03:37,381 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7f74549c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.06 06:03:37, skipping insertion in model container [2024-06-27 18:03:37,381 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 27.06 06:03:36" (2/4) ... [2024-06-27 18:03:37,381 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7f74549c and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 27.06 06:03:37, skipping insertion in model container [2024-06-27 18:03:37,381 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.06 06:03:36" (3/4) ... [2024-06-27 18:03:37,382 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7f74549c and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 27.06 06:03:37, skipping insertion in model container [2024-06-27 18:03:37,382 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.06 06:03:37" (4/4) ... [2024-06-27 18:03:37,383 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-proofs-counter-add-4-semi-Q67.wvr.c [2024-06-27 18:03:37,400 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-06-27 18:03:37,400 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 5 error locations. [2024-06-27 18:03:37,400 INFO L522 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-06-27 18:03:37,445 INFO L144 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2024-06-27 18:03:37,475 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 54 places, 45 transitions, 118 flow [2024-06-27 18:03:37,500 INFO L124 PetriNetUnfolderBase]: 4/41 cut-off events. [2024-06-27 18:03:37,500 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2024-06-27 18:03:37,503 INFO L83 FinitePrefix]: Finished finitePrefix Result has 58 conditions, 41 events. 4/41 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 50 event pairs, 0 based on Foata normal form. 0/32 useless extension candidates. Maximal degree in co-relation 37. Up to 2 conditions per place. [2024-06-27 18:03:37,504 INFO L82 GeneralOperation]: Start removeDead. Operand has 54 places, 45 transitions, 118 flow [2024-06-27 18:03:37,506 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 49 places, 40 transitions, 104 flow [2024-06-27 18:03:37,515 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-06-27 18:03:37,522 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;@5f1edd5f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-06-27 18:03:37,522 INFO L358 AbstractCegarLoop]: Starting to check reachability of 9 error locations. [2024-06-27 18:03:37,532 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-06-27 18:03:37,532 INFO L124 PetriNetUnfolderBase]: 0/5 cut-off events. [2024-06-27 18:03:37,532 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-27 18:03:37,533 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:03:37,533 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2024-06-27 18:03:37,534 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 18:03:37,542 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:03:37,543 INFO L85 PathProgramCache]: Analyzing trace with hash 381206755, now seen corresponding path program 1 times [2024-06-27 18:03:37,551 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:03:37,552 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [424888094] [2024-06-27 18:03:37,553 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:03:37,553 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:03:37,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:03:37,887 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 18:03:37,887 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:03:37,888 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [424888094] [2024-06-27 18:03:37,889 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [424888094] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:03:37,889 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:03:37,889 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-06-27 18:03:37,891 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1415855619] [2024-06-27 18:03:37,891 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:03:37,899 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-06-27 18:03:37,904 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:03:37,929 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-06-27 18:03:37,929 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-06-27 18:03:37,954 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 45 [2024-06-27 18:03:37,958 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 40 transitions, 104 flow. Second operand has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:03:37,958 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:03:37,958 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 45 [2024-06-27 18:03:37,959 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:03:38,435 INFO L124 PetriNetUnfolderBase]: 2119/2916 cut-off events. [2024-06-27 18:03:38,435 INFO L125 PetriNetUnfolderBase]: For 158/158 co-relation queries the response was YES. [2024-06-27 18:03:38,445 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5740 conditions, 2916 events. 2119/2916 cut-off events. For 158/158 co-relation queries the response was YES. Maximal size of possible extension queue 169. Compared 12642 event pairs, 248 based on Foata normal form. 24/2858 useless extension candidates. Maximal degree in co-relation 5135. Up to 2291 conditions per place. [2024-06-27 18:03:38,466 INFO L140 encePairwiseOnDemand]: 37/45 looper letters, 48 selfloop transitions, 4 changer transitions 0/63 dead transitions. [2024-06-27 18:03:38,466 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 63 transitions, 275 flow [2024-06-27 18:03:38,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-06-27 18:03:38,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-06-27 18:03:38,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 101 transitions. [2024-06-27 18:03:38,477 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7481481481481481 [2024-06-27 18:03:38,479 INFO L175 Difference]: Start difference. First operand has 49 places, 40 transitions, 104 flow. Second operand 3 states and 101 transitions. [2024-06-27 18:03:38,480 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 63 transitions, 275 flow [2024-06-27 18:03:38,485 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 63 transitions, 245 flow, removed 0 selfloop flow, removed 8 redundant places. [2024-06-27 18:03:38,487 INFO L231 Difference]: Finished difference. Result has 44 places, 43 transitions, 120 flow [2024-06-27 18:03:38,489 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=88, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=120, PETRI_PLACES=44, PETRI_TRANSITIONS=43} [2024-06-27 18:03:38,492 INFO L281 CegarLoopForPetriNet]: 49 programPoint places, -5 predicate places. [2024-06-27 18:03:38,492 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 43 transitions, 120 flow [2024-06-27 18:03:38,493 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:03:38,493 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:03:38,493 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 18:03:38,493 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-06-27 18:03:38,494 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 18:03:38,494 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:03:38,494 INFO L85 PathProgramCache]: Analyzing trace with hash 676089073, now seen corresponding path program 1 times [2024-06-27 18:03:38,495 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:03:38,495 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [759326229] [2024-06-27 18:03:38,495 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:03:38,495 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:03:38,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:03:38,672 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 18:03:38,672 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:03:38,673 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [759326229] [2024-06-27 18:03:38,674 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [759326229] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:03:38,674 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:03:38,674 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-06-27 18:03:38,674 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2093141126] [2024-06-27 18:03:38,674 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:03:38,676 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-06-27 18:03:38,676 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:03:38,677 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-06-27 18:03:38,677 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-06-27 18:03:38,710 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 45 [2024-06-27 18:03:38,711 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 43 transitions, 120 flow. Second operand has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:03:38,711 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:03:38,711 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 45 [2024-06-27 18:03:38,711 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:03:39,069 INFO L124 PetriNetUnfolderBase]: 2249/3110 cut-off events. [2024-06-27 18:03:39,070 INFO L125 PetriNetUnfolderBase]: For 591/591 co-relation queries the response was YES. [2024-06-27 18:03:39,076 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7089 conditions, 3110 events. 2249/3110 cut-off events. For 591/591 co-relation queries the response was YES. Maximal size of possible extension queue 186. Compared 14090 event pairs, 228 based on Foata normal form. 42/3103 useless extension candidates. Maximal degree in co-relation 1457. Up to 2009 conditions per place. [2024-06-27 18:03:39,098 INFO L140 encePairwiseOnDemand]: 37/45 looper letters, 65 selfloop transitions, 6 changer transitions 0/82 dead transitions. [2024-06-27 18:03:39,098 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 82 transitions, 357 flow [2024-06-27 18:03:39,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-06-27 18:03:39,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-06-27 18:03:39,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 135 transitions. [2024-06-27 18:03:39,103 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.75 [2024-06-27 18:03:39,103 INFO L175 Difference]: Start difference. First operand has 44 places, 43 transitions, 120 flow. Second operand 4 states and 135 transitions. [2024-06-27 18:03:39,103 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 82 transitions, 357 flow [2024-06-27 18:03:39,106 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 82 transitions, 353 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-06-27 18:03:39,108 INFO L231 Difference]: Finished difference. Result has 46 places, 44 transitions, 145 flow [2024-06-27 18:03:39,108 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=112, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=145, PETRI_PLACES=46, PETRI_TRANSITIONS=44} [2024-06-27 18:03:39,109 INFO L281 CegarLoopForPetriNet]: 49 programPoint places, -3 predicate places. [2024-06-27 18:03:39,111 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 44 transitions, 145 flow [2024-06-27 18:03:39,112 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:03:39,112 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:03:39,113 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 18:03:39,118 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-06-27 18:03:39,119 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 18:03:39,123 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:03:39,129 INFO L85 PathProgramCache]: Analyzing trace with hash -1320767074, now seen corresponding path program 1 times [2024-06-27 18:03:39,129 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:03:39,130 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1762240019] [2024-06-27 18:03:39,130 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:03:39,130 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:03:39,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:03:39,176 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 18:03:39,177 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:03:39,177 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1762240019] [2024-06-27 18:03:39,177 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1762240019] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:03:39,177 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:03:39,177 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-06-27 18:03:39,178 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1341015131] [2024-06-27 18:03:39,178 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:03:39,178 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-06-27 18:03:39,178 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:03:39,179 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-06-27 18:03:39,179 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-06-27 18:03:39,179 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 45 [2024-06-27 18:03:39,180 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 44 transitions, 145 flow. Second operand has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 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-27 18:03:39,180 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:03:39,180 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 45 [2024-06-27 18:03:39,180 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:03:39,436 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([383] L52-->L56: Formula: (and (= v_~i2~0_96 (+ v_~i2~0_97 1)) (= (+ v_~counter~0_141 1) v_~counter~0_142) (not (= (ite (< 0 v_~counter~0_142) 1 0) 0))) InVars {~counter~0=v_~counter~0_142, ~i2~0=v_~i2~0_97} OutVars{~counter~0=v_~counter~0_141, thread2Thread1of1ForFork2_#t~post4#1=|v_thread2Thread1of1ForFork2_#t~post4#1_1|, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|, thread2Thread1of1ForFork2_#t~post3#1=|v_thread2Thread1of1ForFork2_#t~post3#1_1|, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1|, ~i2~0=v_~i2~0_96} AuxVars[] AssignedVars[~counter~0, thread2Thread1of1ForFork2_#t~post4#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork2_#t~post3#1, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~i2~0][41], [Black: 64#(and (<= 0 ~j1~0) (= ~j2~0 0) (= ~i2~0 0) (<= 1 ~i1~0)), 27#L67true, 8#L56true, 4#thread4EXITtrue, 42#ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANTtrue, 61#true, 29#L44true, 66#true, Black: 59#(and (= ~i1~0 0) (<= 0 ~j1~0) (= ~j2~0 0) (= ~i2~0 0))]) [2024-06-27 18:03:39,437 INFO L294 olderBase$Statistics]: this new event has 27 ancestors and is cut-off event [2024-06-27 18:03:39,437 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2024-06-27 18:03:39,437 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2024-06-27 18:03:39,437 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2024-06-27 18:03:39,454 INFO L124 PetriNetUnfolderBase]: 1899/2764 cut-off events. [2024-06-27 18:03:39,454 INFO L125 PetriNetUnfolderBase]: For 1854/1895 co-relation queries the response was YES. [2024-06-27 18:03:39,460 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6773 conditions, 2764 events. 1899/2764 cut-off events. For 1854/1895 co-relation queries the response was YES. Maximal size of possible extension queue 159. Compared 12992 event pairs, 261 based on Foata normal form. 52/2740 useless extension candidates. Maximal degree in co-relation 1897. Up to 2234 conditions per place. [2024-06-27 18:03:39,478 INFO L140 encePairwiseOnDemand]: 39/45 looper letters, 45 selfloop transitions, 3 changer transitions 2/64 dead transitions. [2024-06-27 18:03:39,478 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 64 transitions, 297 flow [2024-06-27 18:03:39,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-06-27 18:03:39,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-06-27 18:03:39,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 105 transitions. [2024-06-27 18:03:39,480 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7777777777777778 [2024-06-27 18:03:39,480 INFO L175 Difference]: Start difference. First operand has 46 places, 44 transitions, 145 flow. Second operand 3 states and 105 transitions. [2024-06-27 18:03:39,480 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 64 transitions, 297 flow [2024-06-27 18:03:39,481 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 64 transitions, 287 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-06-27 18:03:39,482 INFO L231 Difference]: Finished difference. Result has 47 places, 46 transitions, 163 flow [2024-06-27 18:03:39,483 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=136, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=163, PETRI_PLACES=47, PETRI_TRANSITIONS=46} [2024-06-27 18:03:39,483 INFO L281 CegarLoopForPetriNet]: 49 programPoint places, -2 predicate places. [2024-06-27 18:03:39,484 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 46 transitions, 163 flow [2024-06-27 18:03:39,484 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 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-27 18:03:39,484 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:03:39,484 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 18:03:39,484 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-06-27 18:03:39,485 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 18:03:39,485 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:03:39,485 INFO L85 PathProgramCache]: Analyzing trace with hash 1092652132, now seen corresponding path program 1 times [2024-06-27 18:03:39,485 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:03:39,486 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1040096532] [2024-06-27 18:03:39,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:03:39,486 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:03:39,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:03:39,609 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 18:03:39,609 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:03:39,609 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1040096532] [2024-06-27 18:03:39,609 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1040096532] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:03:39,610 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:03:39,610 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-27 18:03:39,610 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [265511596] [2024-06-27 18:03:39,610 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:03:39,611 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-27 18:03:39,611 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:03:39,611 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-27 18:03:39,611 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-06-27 18:03:39,634 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 45 [2024-06-27 18:03:39,634 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 46 transitions, 163 flow. Second operand has 5 states, 5 states have (on average 16.8) internal successors, (84), 5 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:03:39,634 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:03:39,635 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 45 [2024-06-27 18:03:39,635 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:03:40,017 INFO L124 PetriNetUnfolderBase]: 2274/3260 cut-off events. [2024-06-27 18:03:40,018 INFO L125 PetriNetUnfolderBase]: For 2060/2060 co-relation queries the response was YES. [2024-06-27 18:03:40,025 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8314 conditions, 3260 events. 2274/3260 cut-off events. For 2060/2060 co-relation queries the response was YES. Maximal size of possible extension queue 195. Compared 15592 event pairs, 325 based on Foata normal form. 40/3255 useless extension candidates. Maximal degree in co-relation 2397. Up to 1481 conditions per place. [2024-06-27 18:03:40,118 INFO L140 encePairwiseOnDemand]: 38/45 looper letters, 81 selfloop transitions, 8 changer transitions 0/100 dead transitions. [2024-06-27 18:03:40,118 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 100 transitions, 487 flow [2024-06-27 18:03:40,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-27 18:03:40,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-27 18:03:40,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 165 transitions. [2024-06-27 18:03:40,122 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7333333333333333 [2024-06-27 18:03:40,122 INFO L175 Difference]: Start difference. First operand has 47 places, 46 transitions, 163 flow. Second operand 5 states and 165 transitions. [2024-06-27 18:03:40,122 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 100 transitions, 487 flow [2024-06-27 18:03:40,125 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 100 transitions, 484 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-06-27 18:03:40,127 INFO L231 Difference]: Finished difference. Result has 50 places, 46 transitions, 184 flow [2024-06-27 18:03:40,128 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=184, PETRI_PLACES=50, PETRI_TRANSITIONS=46} [2024-06-27 18:03:40,130 INFO L281 CegarLoopForPetriNet]: 49 programPoint places, 1 predicate places. [2024-06-27 18:03:40,130 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 46 transitions, 184 flow [2024-06-27 18:03:40,131 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.8) internal successors, (84), 5 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:03:40,131 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:03:40,131 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 18:03:40,131 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-06-27 18:03:40,131 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 18:03:40,132 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:03:40,132 INFO L85 PathProgramCache]: Analyzing trace with hash -1041824233, now seen corresponding path program 1 times [2024-06-27 18:03:40,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:03:40,133 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1779417061] [2024-06-27 18:03:40,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:03:40,133 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:03:40,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:03:40,336 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 18:03:40,337 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:03:40,337 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1779417061] [2024-06-27 18:03:40,337 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1779417061] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:03:40,338 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:03:40,338 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-27 18:03:40,338 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [869888814] [2024-06-27 18:03:40,338 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:03:40,339 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-27 18:03:40,339 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:03:40,339 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-27 18:03:40,340 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-06-27 18:03:40,361 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 45 [2024-06-27 18:03:40,362 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 46 transitions, 184 flow. Second operand has 5 states, 5 states have (on average 17.4) internal successors, (87), 5 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-27 18:03:40,362 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:03:40,362 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 45 [2024-06-27 18:03:40,362 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:03:40,778 INFO L124 PetriNetUnfolderBase]: 2360/3362 cut-off events. [2024-06-27 18:03:40,779 INFO L125 PetriNetUnfolderBase]: For 3536/3536 co-relation queries the response was YES. [2024-06-27 18:03:40,785 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9023 conditions, 3362 events. 2360/3362 cut-off events. For 3536/3536 co-relation queries the response was YES. Maximal size of possible extension queue 200. Compared 15878 event pairs, 389 based on Foata normal form. 24/3350 useless extension candidates. Maximal degree in co-relation 5130. Up to 2353 conditions per place. [2024-06-27 18:03:40,802 INFO L140 encePairwiseOnDemand]: 38/45 looper letters, 74 selfloop transitions, 8 changer transitions 2/95 dead transitions. [2024-06-27 18:03:40,803 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 95 transitions, 487 flow [2024-06-27 18:03:40,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-27 18:03:40,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-27 18:03:40,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 158 transitions. [2024-06-27 18:03:40,804 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7022222222222222 [2024-06-27 18:03:40,804 INFO L175 Difference]: Start difference. First operand has 50 places, 46 transitions, 184 flow. Second operand 5 states and 158 transitions. [2024-06-27 18:03:40,805 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 95 transitions, 487 flow [2024-06-27 18:03:40,810 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 95 transitions, 473 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-06-27 18:03:40,812 INFO L231 Difference]: Finished difference. Result has 52 places, 48 transitions, 209 flow [2024-06-27 18:03:40,812 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=170, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=209, PETRI_PLACES=52, PETRI_TRANSITIONS=48} [2024-06-27 18:03:40,813 INFO L281 CegarLoopForPetriNet]: 49 programPoint places, 3 predicate places. [2024-06-27 18:03:40,813 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 48 transitions, 209 flow [2024-06-27 18:03:40,813 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.4) internal successors, (87), 5 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-27 18:03:40,813 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:03:40,813 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 18:03:40,814 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-06-27 18:03:40,814 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 18:03:40,814 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:03:40,814 INFO L85 PathProgramCache]: Analyzing trace with hash -122883996, now seen corresponding path program 1 times [2024-06-27 18:03:40,814 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:03:40,815 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1075431400] [2024-06-27 18:03:40,815 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:03:40,815 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:03:40,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:03:40,923 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 18:03:40,924 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:03:40,924 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1075431400] [2024-06-27 18:03:40,924 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1075431400] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:03:40,924 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:03:40,925 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-27 18:03:40,925 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [854063449] [2024-06-27 18:03:40,925 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:03:40,925 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-27 18:03:40,926 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:03:40,926 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-27 18:03:40,926 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-06-27 18:03:40,952 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 45 [2024-06-27 18:03:40,952 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 48 transitions, 209 flow. Second operand has 5 states, 5 states have (on average 18.0) internal successors, (90), 5 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:03:40,952 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:03:40,952 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 45 [2024-06-27 18:03:40,953 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:03:41,427 INFO L124 PetriNetUnfolderBase]: 2522/3640 cut-off events. [2024-06-27 18:03:41,428 INFO L125 PetriNetUnfolderBase]: For 4726/4726 co-relation queries the response was YES. [2024-06-27 18:03:41,435 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10176 conditions, 3640 events. 2522/3640 cut-off events. For 4726/4726 co-relation queries the response was YES. Maximal size of possible extension queue 217. Compared 17866 event pairs, 364 based on Foata normal form. 24/3619 useless extension candidates. Maximal degree in co-relation 5760. Up to 2037 conditions per place. [2024-06-27 18:03:41,455 INFO L140 encePairwiseOnDemand]: 40/45 looper letters, 81 selfloop transitions, 8 changer transitions 0/100 dead transitions. [2024-06-27 18:03:41,455 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 100 transitions, 540 flow [2024-06-27 18:03:41,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-27 18:03:41,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-27 18:03:41,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 160 transitions. [2024-06-27 18:03:41,457 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7111111111111111 [2024-06-27 18:03:41,457 INFO L175 Difference]: Start difference. First operand has 52 places, 48 transitions, 209 flow. Second operand 5 states and 160 transitions. [2024-06-27 18:03:41,457 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 100 transitions, 540 flow [2024-06-27 18:03:41,470 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 100 transitions, 524 flow, removed 1 selfloop flow, removed 3 redundant places. [2024-06-27 18:03:41,471 INFO L231 Difference]: Finished difference. Result has 54 places, 49 transitions, 221 flow [2024-06-27 18:03:41,472 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=193, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=221, PETRI_PLACES=54, PETRI_TRANSITIONS=49} [2024-06-27 18:03:41,472 INFO L281 CegarLoopForPetriNet]: 49 programPoint places, 5 predicate places. [2024-06-27 18:03:41,473 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 49 transitions, 221 flow [2024-06-27 18:03:41,473 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.0) internal successors, (90), 5 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:03:41,473 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:03:41,473 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 18:03:41,473 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-06-27 18:03:41,474 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 18:03:41,474 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:03:41,474 INFO L85 PathProgramCache]: Analyzing trace with hash -1550478385, now seen corresponding path program 1 times [2024-06-27 18:03:41,474 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:03:41,474 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [593990314] [2024-06-27 18:03:41,475 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:03:41,475 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:03:41,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:03:41,627 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 18:03:41,627 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:03:41,627 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [593990314] [2024-06-27 18:03:41,628 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [593990314] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:03:41,628 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:03:41,628 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-27 18:03:41,628 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1177553112] [2024-06-27 18:03:41,628 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:03:41,629 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-27 18:03:41,629 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:03:41,629 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-27 18:03:41,630 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-06-27 18:03:41,660 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 45 [2024-06-27 18:03:41,661 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 49 transitions, 221 flow. Second operand has 6 states, 6 states have (on average 17.166666666666668) internal successors, (103), 6 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:03:41,661 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:03:41,661 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 45 [2024-06-27 18:03:41,661 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:03:42,088 INFO L124 PetriNetUnfolderBase]: 2508/3613 cut-off events. [2024-06-27 18:03:42,088 INFO L125 PetriNetUnfolderBase]: For 5469/5469 co-relation queries the response was YES. [2024-06-27 18:03:42,099 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10418 conditions, 3613 events. 2508/3613 cut-off events. For 5469/5469 co-relation queries the response was YES. Maximal size of possible extension queue 212. Compared 17599 event pairs, 413 based on Foata normal form. 24/3594 useless extension candidates. Maximal degree in co-relation 7351. Up to 2271 conditions per place. [2024-06-27 18:03:42,119 INFO L140 encePairwiseOnDemand]: 38/45 looper letters, 90 selfloop transitions, 9 changer transitions 2/112 dead transitions. [2024-06-27 18:03:42,120 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 112 transitions, 599 flow [2024-06-27 18:03:42,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-27 18:03:42,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-27 18:03:42,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 189 transitions. [2024-06-27 18:03:42,121 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7 [2024-06-27 18:03:42,121 INFO L175 Difference]: Start difference. First operand has 54 places, 49 transitions, 221 flow. Second operand 6 states and 189 transitions. [2024-06-27 18:03:42,122 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 112 transitions, 599 flow [2024-06-27 18:03:42,145 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 112 transitions, 585 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-06-27 18:03:42,148 INFO L231 Difference]: Finished difference. Result has 56 places, 49 transitions, 231 flow [2024-06-27 18:03:42,148 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=197, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=231, PETRI_PLACES=56, PETRI_TRANSITIONS=49} [2024-06-27 18:03:42,149 INFO L281 CegarLoopForPetriNet]: 49 programPoint places, 7 predicate places. [2024-06-27 18:03:42,150 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 49 transitions, 231 flow [2024-06-27 18:03:42,150 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 17.166666666666668) internal successors, (103), 6 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:03:42,150 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:03:42,150 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 18:03:42,150 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-06-27 18:03:42,151 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 18:03:42,151 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:03:42,151 INFO L85 PathProgramCache]: Analyzing trace with hash -1193336532, now seen corresponding path program 1 times [2024-06-27 18:03:42,152 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:03:42,152 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1160178134] [2024-06-27 18:03:42,152 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:03:42,152 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:03:42,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:03:42,270 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 18:03:42,271 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:03:42,271 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1160178134] [2024-06-27 18:03:42,271 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1160178134] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:03:42,271 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:03:42,271 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-27 18:03:42,272 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [667319788] [2024-06-27 18:03:42,272 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:03:42,272 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-27 18:03:42,272 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:03:42,273 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-27 18:03:42,274 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-06-27 18:03:42,292 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 45 [2024-06-27 18:03:42,293 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 49 transitions, 231 flow. Second operand has 5 states, 5 states have (on average 18.0) internal successors, (90), 5 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:03:42,293 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:03:42,293 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 45 [2024-06-27 18:03:42,293 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:03:42,734 INFO L124 PetriNetUnfolderBase]: 2586/3733 cut-off events. [2024-06-27 18:03:42,735 INFO L125 PetriNetUnfolderBase]: For 6534/6534 co-relation queries the response was YES. [2024-06-27 18:03:42,747 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10966 conditions, 3733 events. 2586/3733 cut-off events. For 6534/6534 co-relation queries the response was YES. Maximal size of possible extension queue 205. Compared 18356 event pairs, 525 based on Foata normal form. 16/3719 useless extension candidates. Maximal degree in co-relation 8179. Up to 2770 conditions per place. [2024-06-27 18:03:42,771 INFO L140 encePairwiseOnDemand]: 39/45 looper letters, 74 selfloop transitions, 8 changer transitions 2/95 dead transitions. [2024-06-27 18:03:42,771 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 95 transitions, 535 flow [2024-06-27 18:03:42,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-27 18:03:42,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-27 18:03:42,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 153 transitions. [2024-06-27 18:03:42,773 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.68 [2024-06-27 18:03:42,773 INFO L175 Difference]: Start difference. First operand has 56 places, 49 transitions, 231 flow. Second operand 5 states and 153 transitions. [2024-06-27 18:03:42,773 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 95 transitions, 535 flow [2024-06-27 18:03:42,798 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 95 transitions, 517 flow, removed 1 selfloop flow, removed 4 redundant places. [2024-06-27 18:03:42,800 INFO L231 Difference]: Finished difference. Result has 57 places, 51 transitions, 252 flow [2024-06-27 18:03:42,800 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=213, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=252, PETRI_PLACES=57, PETRI_TRANSITIONS=51} [2024-06-27 18:03:42,800 INFO L281 CegarLoopForPetriNet]: 49 programPoint places, 8 predicate places. [2024-06-27 18:03:42,801 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 51 transitions, 252 flow [2024-06-27 18:03:42,801 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.0) internal successors, (90), 5 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:03:42,801 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:03:42,801 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 18:03:42,802 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-06-27 18:03:42,802 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 18:03:42,802 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:03:42,802 INFO L85 PathProgramCache]: Analyzing trace with hash -269748198, now seen corresponding path program 1 times [2024-06-27 18:03:42,802 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:03:42,803 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1783947266] [2024-06-27 18:03:42,803 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:03:42,803 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:03:42,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:03:42,852 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 18:03:42,853 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:03:42,853 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1783947266] [2024-06-27 18:03:42,853 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1783947266] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:03:42,853 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:03:42,854 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-27 18:03:42,854 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1182448498] [2024-06-27 18:03:42,854 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:03:42,855 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-27 18:03:42,855 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:03:42,855 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-27 18:03:42,856 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-06-27 18:03:42,856 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 45 [2024-06-27 18:03:42,856 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 51 transitions, 252 flow. Second operand has 5 states, 5 states have (on average 22.0) internal successors, (110), 5 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:03:42,857 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:03:42,857 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 45 [2024-06-27 18:03:42,857 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:03:43,604 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([383] L52-->L56: Formula: (and (= v_~i2~0_96 (+ v_~i2~0_97 1)) (= (+ v_~counter~0_141 1) v_~counter~0_142) (not (= (ite (< 0 v_~counter~0_142) 1 0) 0))) InVars {~counter~0=v_~counter~0_142, ~i2~0=v_~i2~0_97} OutVars{~counter~0=v_~counter~0_141, thread2Thread1of1ForFork2_#t~post4#1=|v_thread2Thread1of1ForFork2_#t~post4#1_1|, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|, thread2Thread1of1ForFork2_#t~post3#1=|v_thread2Thread1of1ForFork2_#t~post3#1_1|, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1|, ~i2~0=v_~i2~0_96} AuxVars[] AssignedVars[~counter~0, thread2Thread1of1ForFork2_#t~post4#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork2_#t~post3#1, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~i2~0][55], [Black: 64#(and (<= 0 ~j1~0) (= ~j2~0 0) (= ~i2~0 0) (<= 1 ~i1~0)), 42#ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANTtrue, 8#L56true, Black: 99#(and (<= 1 ~j1~0) (= ~i1~0 0) (<= 1 ~j2~0) (= ~i2~0 0)), Black: 68#(= ~counter~0 0), Black: 74#(and (<= 0 ~j1~0) (= ~j2~0 0) (<= 1 ~i1~0) (<= 1 ~i2~0)), 95#true, Black: 80#(and (<= 1 ~j1~0) (= ~i1~0 0) (= ~j2~0 0) (<= 1 ~i2~0)), 27#L67true, 25#L79true, Black: 86#(and (<= 0 ~j1~0) (<= 1 ~j2~0) (= ~i2~0 0) (<= 1 ~i1~0)), 12#thread1EXITtrue, 103#(= ~counter~0 0), Black: 59#(and (= ~i1~0 0) (<= 0 ~j1~0) (= ~j2~0 0) (= ~i2~0 0)), Black: 93#(and (<= 1 ~j1~0) (= ~j2~0 0) (<= 1 ~i1~0) (<= 1 ~i2~0))]) [2024-06-27 18:03:43,604 INFO L294 olderBase$Statistics]: this new event has 31 ancestors and is cut-off event [2024-06-27 18:03:43,604 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2024-06-27 18:03:43,604 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2024-06-27 18:03:43,605 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2024-06-27 18:03:43,628 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([379] L41-->L44: Formula: (and (= v_~i1~0_24 (+ v_~i1~0_25 1)) (= (+ v_~counter~0_22 1) v_~counter~0_21)) InVars {~counter~0=v_~counter~0_22, ~i1~0=v_~i1~0_25} OutVars{~counter~0=v_~counter~0_21, ~i1~0=v_~i1~0_24, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_1|, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_1|} AuxVars[] AssignedVars[~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_#t~post2, ~i1~0][29], [Black: 64#(and (<= 0 ~j1~0) (= ~j2~0 0) (= ~i2~0 0) (<= 1 ~i1~0)), 42#ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANTtrue, 8#L56true, Black: 99#(and (<= 1 ~j1~0) (= ~i1~0 0) (<= 1 ~j2~0) (= ~i2~0 0)), Black: 68#(= ~counter~0 0), 29#L44true, Black: 74#(and (<= 0 ~j1~0) (= ~j2~0 0) (<= 1 ~i1~0) (<= 1 ~i2~0)), 95#true, Black: 80#(and (<= 1 ~j1~0) (= ~i1~0 0) (= ~j2~0 0) (<= 1 ~i2~0)), 27#L67true, 4#thread4EXITtrue, 101#true, Black: 86#(and (<= 0 ~j1~0) (<= 1 ~j2~0) (= ~i2~0 0) (<= 1 ~i1~0)), Black: 59#(and (= ~i1~0 0) (<= 0 ~j1~0) (= ~j2~0 0) (= ~i2~0 0)), Black: 93#(and (<= 1 ~j1~0) (= ~j2~0 0) (<= 1 ~i1~0) (<= 1 ~i2~0))]) [2024-06-27 18:03:43,629 INFO L294 olderBase$Statistics]: this new event has 31 ancestors and is cut-off event [2024-06-27 18:03:43,629 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2024-06-27 18:03:43,629 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2024-06-27 18:03:43,629 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2024-06-27 18:03:43,632 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([383] L52-->L56: Formula: (and (= v_~i2~0_96 (+ v_~i2~0_97 1)) (= (+ v_~counter~0_141 1) v_~counter~0_142) (not (= (ite (< 0 v_~counter~0_142) 1 0) 0))) InVars {~counter~0=v_~counter~0_142, ~i2~0=v_~i2~0_97} OutVars{~counter~0=v_~counter~0_141, thread2Thread1of1ForFork2_#t~post4#1=|v_thread2Thread1of1ForFork2_#t~post4#1_1|, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|, thread2Thread1of1ForFork2_#t~post3#1=|v_thread2Thread1of1ForFork2_#t~post3#1_1|, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1|, ~i2~0=v_~i2~0_96} AuxVars[] AssignedVars[~counter~0, thread2Thread1of1ForFork2_#t~post4#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork2_#t~post3#1, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~i2~0][55], [Black: 64#(and (<= 0 ~j1~0) (= ~j2~0 0) (= ~i2~0 0) (<= 1 ~i1~0)), 8#L56true, 42#ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANTtrue, Black: 99#(and (<= 1 ~j1~0) (= ~i1~0 0) (<= 1 ~j2~0) (= ~i2~0 0)), Black: 68#(= ~counter~0 0), Black: 74#(and (<= 0 ~j1~0) (= ~j2~0 0) (<= 1 ~i1~0) (<= 1 ~i2~0)), 36#thread3EXITtrue, 95#true, Black: 80#(and (<= 1 ~j1~0) (= ~i1~0 0) (= ~j2~0 0) (<= 1 ~i2~0)), 25#L79true, Black: 86#(and (<= 0 ~j1~0) (<= 1 ~j2~0) (= ~i2~0 0) (<= 1 ~i1~0)), 12#thread1EXITtrue, 103#(= ~counter~0 0), Black: 59#(and (= ~i1~0 0) (<= 0 ~j1~0) (= ~j2~0 0) (= ~i2~0 0)), Black: 93#(and (<= 1 ~j1~0) (= ~j2~0 0) (<= 1 ~i1~0) (<= 1 ~i2~0))]) [2024-06-27 18:03:43,632 INFO L294 olderBase$Statistics]: this new event has 32 ancestors and is cut-off event [2024-06-27 18:03:43,632 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2024-06-27 18:03:43,632 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2024-06-27 18:03:43,632 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2024-06-27 18:03:43,633 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([383] L52-->L56: Formula: (and (= v_~i2~0_96 (+ v_~i2~0_97 1)) (= (+ v_~counter~0_141 1) v_~counter~0_142) (not (= (ite (< 0 v_~counter~0_142) 1 0) 0))) InVars {~counter~0=v_~counter~0_142, ~i2~0=v_~i2~0_97} OutVars{~counter~0=v_~counter~0_141, thread2Thread1of1ForFork2_#t~post4#1=|v_thread2Thread1of1ForFork2_#t~post4#1_1|, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|, thread2Thread1of1ForFork2_#t~post3#1=|v_thread2Thread1of1ForFork2_#t~post3#1_1|, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1|, ~i2~0=v_~i2~0_96} AuxVars[] AssignedVars[~counter~0, thread2Thread1of1ForFork2_#t~post4#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork2_#t~post3#1, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~i2~0][55], [Black: 64#(and (<= 0 ~j1~0) (= ~j2~0 0) (= ~i2~0 0) (<= 1 ~i1~0)), 42#ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANTtrue, 8#L56true, Black: 99#(and (<= 1 ~j1~0) (= ~i1~0 0) (<= 1 ~j2~0) (= ~i2~0 0)), Black: 68#(= ~counter~0 0), Black: 74#(and (<= 0 ~j1~0) (= ~j2~0 0) (<= 1 ~i1~0) (<= 1 ~i2~0)), 95#true, Black: 80#(and (<= 1 ~j1~0) (= ~i1~0 0) (= ~j2~0 0) (<= 1 ~i2~0)), 4#thread4EXITtrue, 27#L67true, Black: 86#(and (<= 0 ~j1~0) (<= 1 ~j2~0) (= ~i2~0 0) (<= 1 ~i1~0)), 12#thread1EXITtrue, 103#(= ~counter~0 0), Black: 59#(and (= ~i1~0 0) (<= 0 ~j1~0) (= ~j2~0 0) (= ~i2~0 0)), Black: 93#(and (<= 1 ~j1~0) (= ~j2~0 0) (<= 1 ~i1~0) (<= 1 ~i2~0))]) [2024-06-27 18:03:43,633 INFO L294 olderBase$Statistics]: this new event has 32 ancestors and is cut-off event [2024-06-27 18:03:43,633 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2024-06-27 18:03:43,633 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2024-06-27 18:03:43,633 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2024-06-27 18:03:43,635 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([383] L52-->L56: Formula: (and (= v_~i2~0_96 (+ v_~i2~0_97 1)) (= (+ v_~counter~0_141 1) v_~counter~0_142) (not (= (ite (< 0 v_~counter~0_142) 1 0) 0))) InVars {~counter~0=v_~counter~0_142, ~i2~0=v_~i2~0_97} OutVars{~counter~0=v_~counter~0_141, thread2Thread1of1ForFork2_#t~post4#1=|v_thread2Thread1of1ForFork2_#t~post4#1_1|, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|, thread2Thread1of1ForFork2_#t~post3#1=|v_thread2Thread1of1ForFork2_#t~post3#1_1|, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1|, ~i2~0=v_~i2~0_96} AuxVars[] AssignedVars[~counter~0, thread2Thread1of1ForFork2_#t~post4#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork2_#t~post3#1, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~i2~0][62], [Black: 64#(and (<= 0 ~j1~0) (= ~j2~0 0) (= ~i2~0 0) (<= 1 ~i1~0)), 42#ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANTtrue, 8#L56true, Black: 99#(and (<= 1 ~j1~0) (= ~i1~0 0) (<= 1 ~j2~0) (= ~i2~0 0)), Black: 68#(= ~counter~0 0), Black: 74#(and (<= 0 ~j1~0) (= ~j2~0 0) (<= 1 ~i1~0) (<= 1 ~i2~0)), 95#true, Black: 80#(and (<= 1 ~j1~0) (= ~i1~0 0) (= ~j2~0 0) (<= 1 ~i2~0)), 4#thread4EXITtrue, 27#L67true, 101#true, Black: 86#(and (<= 0 ~j1~0) (<= 1 ~j2~0) (= ~i2~0 0) (<= 1 ~i1~0)), 12#thread1EXITtrue, Black: 59#(and (= ~i1~0 0) (<= 0 ~j1~0) (= ~j2~0 0) (= ~i2~0 0)), Black: 93#(and (<= 1 ~j1~0) (= ~j2~0 0) (<= 1 ~i1~0) (<= 1 ~i2~0))]) [2024-06-27 18:03:43,635 INFO L294 olderBase$Statistics]: this new event has 32 ancestors and is cut-off event [2024-06-27 18:03:43,635 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2024-06-27 18:03:43,636 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2024-06-27 18:03:43,636 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2024-06-27 18:03:43,646 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([379] L41-->L44: Formula: (and (= v_~i1~0_24 (+ v_~i1~0_25 1)) (= (+ v_~counter~0_22 1) v_~counter~0_21)) InVars {~counter~0=v_~counter~0_22, ~i1~0=v_~i1~0_25} OutVars{~counter~0=v_~counter~0_21, ~i1~0=v_~i1~0_24, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_1|, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_1|} AuxVars[] AssignedVars[~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_#t~post2, ~i1~0][42], [Black: 64#(and (<= 0 ~j1~0) (= ~j2~0 0) (= ~i2~0 0) (<= 1 ~i1~0)), 42#ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANTtrue, 8#L56true, Black: 99#(and (<= 1 ~j1~0) (= ~i1~0 0) (<= 1 ~j2~0) (= ~i2~0 0)), Black: 68#(= ~counter~0 0), 29#L44true, 104#(<= ~counter~0 1), Black: 74#(and (<= 0 ~j1~0) (= ~j2~0 0) (<= 1 ~i1~0) (<= 1 ~i2~0)), 95#true, Black: 80#(and (<= 1 ~j1~0) (= ~i1~0 0) (= ~j2~0 0) (<= 1 ~i2~0)), 4#thread4EXITtrue, 27#L67true, Black: 86#(and (<= 0 ~j1~0) (<= 1 ~j2~0) (= ~i2~0 0) (<= 1 ~i1~0)), Black: 59#(and (= ~i1~0 0) (<= 0 ~j1~0) (= ~j2~0 0) (= ~i2~0 0)), Black: 93#(and (<= 1 ~j1~0) (= ~j2~0 0) (<= 1 ~i1~0) (<= 1 ~i2~0))]) [2024-06-27 18:03:43,647 INFO L294 olderBase$Statistics]: this new event has 33 ancestors and is cut-off event [2024-06-27 18:03:43,647 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2024-06-27 18:03:43,647 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2024-06-27 18:03:43,647 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2024-06-27 18:03:43,648 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([379] L41-->L44: Formula: (and (= v_~i1~0_24 (+ v_~i1~0_25 1)) (= (+ v_~counter~0_22 1) v_~counter~0_21)) InVars {~counter~0=v_~counter~0_22, ~i1~0=v_~i1~0_25} OutVars{~counter~0=v_~counter~0_21, ~i1~0=v_~i1~0_24, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_1|, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_1|} AuxVars[] AssignedVars[~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_#t~post2, ~i1~0][29], [Black: 64#(and (<= 0 ~j1~0) (= ~j2~0 0) (= ~i2~0 0) (<= 1 ~i1~0)), 42#ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANTtrue, Black: 99#(and (<= 1 ~j1~0) (= ~i1~0 0) (<= 1 ~j2~0) (= ~i2~0 0)), Black: 68#(= ~counter~0 0), 29#L44true, Black: 74#(and (<= 0 ~j1~0) (= ~j2~0 0) (<= 1 ~i1~0) (<= 1 ~i2~0)), 36#thread3EXITtrue, 95#true, Black: 80#(and (<= 1 ~j1~0) (= ~i1~0 0) (= ~j2~0 0) (<= 1 ~i2~0)), 4#thread4EXITtrue, 101#true, Black: 86#(and (<= 0 ~j1~0) (<= 1 ~j2~0) (= ~i2~0 0) (<= 1 ~i1~0)), 13#thread2EXITtrue, Black: 59#(and (= ~i1~0 0) (<= 0 ~j1~0) (= ~j2~0 0) (= ~i2~0 0)), Black: 93#(and (<= 1 ~j1~0) (= ~j2~0 0) (<= 1 ~i1~0) (<= 1 ~i2~0))]) [2024-06-27 18:03:43,648 INFO L294 olderBase$Statistics]: this new event has 33 ancestors and is cut-off event [2024-06-27 18:03:43,648 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2024-06-27 18:03:43,648 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2024-06-27 18:03:43,648 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2024-06-27 18:03:43,649 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([379] L41-->L44: Formula: (and (= v_~i1~0_24 (+ v_~i1~0_25 1)) (= (+ v_~counter~0_22 1) v_~counter~0_21)) InVars {~counter~0=v_~counter~0_22, ~i1~0=v_~i1~0_25} OutVars{~counter~0=v_~counter~0_21, ~i1~0=v_~i1~0_24, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_1|, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_1|} AuxVars[] AssignedVars[~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_#t~post2, ~i1~0][29], [Black: 64#(and (<= 0 ~j1~0) (= ~j2~0 0) (= ~i2~0 0) (<= 1 ~i1~0)), 42#ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANTtrue, 8#L56true, Black: 99#(and (<= 1 ~j1~0) (= ~i1~0 0) (<= 1 ~j2~0) (= ~i2~0 0)), Black: 68#(= ~counter~0 0), 29#L44true, Black: 74#(and (<= 0 ~j1~0) (= ~j2~0 0) (<= 1 ~i1~0) (<= 1 ~i2~0)), 36#thread3EXITtrue, 95#true, Black: 80#(and (<= 1 ~j1~0) (= ~i1~0 0) (= ~j2~0 0) (<= 1 ~i2~0)), 4#thread4EXITtrue, 101#true, Black: 86#(and (<= 0 ~j1~0) (<= 1 ~j2~0) (= ~i2~0 0) (<= 1 ~i1~0)), Black: 59#(and (= ~i1~0 0) (<= 0 ~j1~0) (= ~j2~0 0) (= ~i2~0 0)), Black: 93#(and (<= 1 ~j1~0) (= ~j2~0 0) (<= 1 ~i1~0) (<= 1 ~i2~0))]) [2024-06-27 18:03:43,649 INFO L294 olderBase$Statistics]: this new event has 32 ancestors and is cut-off event [2024-06-27 18:03:43,649 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2024-06-27 18:03:43,649 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2024-06-27 18:03:43,649 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2024-06-27 18:03:43,651 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([383] L52-->L56: Formula: (and (= v_~i2~0_96 (+ v_~i2~0_97 1)) (= (+ v_~counter~0_141 1) v_~counter~0_142) (not (= (ite (< 0 v_~counter~0_142) 1 0) 0))) InVars {~counter~0=v_~counter~0_142, ~i2~0=v_~i2~0_97} OutVars{~counter~0=v_~counter~0_141, thread2Thread1of1ForFork2_#t~post4#1=|v_thread2Thread1of1ForFork2_#t~post4#1_1|, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|, thread2Thread1of1ForFork2_#t~post3#1=|v_thread2Thread1of1ForFork2_#t~post3#1_1|, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1|, ~i2~0=v_~i2~0_96} AuxVars[] AssignedVars[~counter~0, thread2Thread1of1ForFork2_#t~post4#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork2_#t~post3#1, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~i2~0][62], [Black: 64#(and (<= 0 ~j1~0) (= ~j2~0 0) (= ~i2~0 0) (<= 1 ~i1~0)), 42#ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANTtrue, 8#L56true, Black: 99#(and (<= 1 ~j1~0) (= ~i1~0 0) (<= 1 ~j2~0) (= ~i2~0 0)), Black: 68#(= ~counter~0 0), 36#thread3EXITtrue, Black: 74#(and (<= 0 ~j1~0) (= ~j2~0 0) (<= 1 ~i1~0) (<= 1 ~i2~0)), 95#true, Black: 80#(and (<= 1 ~j1~0) (= ~i1~0 0) (= ~j2~0 0) (<= 1 ~i2~0)), 4#thread4EXITtrue, 101#true, Black: 86#(and (<= 0 ~j1~0) (<= 1 ~j2~0) (= ~i2~0 0) (<= 1 ~i1~0)), 12#thread1EXITtrue, Black: 59#(and (= ~i1~0 0) (<= 0 ~j1~0) (= ~j2~0 0) (= ~i2~0 0)), Black: 93#(and (<= 1 ~j1~0) (= ~j2~0 0) (<= 1 ~i1~0) (<= 1 ~i2~0))]) [2024-06-27 18:03:43,651 INFO L294 olderBase$Statistics]: this new event has 33 ancestors and is cut-off event [2024-06-27 18:03:43,652 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2024-06-27 18:03:43,652 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2024-06-27 18:03:43,652 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2024-06-27 18:03:43,654 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([383] L52-->L56: Formula: (and (= v_~i2~0_96 (+ v_~i2~0_97 1)) (= (+ v_~counter~0_141 1) v_~counter~0_142) (not (= (ite (< 0 v_~counter~0_142) 1 0) 0))) InVars {~counter~0=v_~counter~0_142, ~i2~0=v_~i2~0_97} OutVars{~counter~0=v_~counter~0_141, thread2Thread1of1ForFork2_#t~post4#1=|v_thread2Thread1of1ForFork2_#t~post4#1_1|, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|, thread2Thread1of1ForFork2_#t~post3#1=|v_thread2Thread1of1ForFork2_#t~post3#1_1|, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1|, ~i2~0=v_~i2~0_96} AuxVars[] AssignedVars[~counter~0, thread2Thread1of1ForFork2_#t~post4#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork2_#t~post3#1, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~i2~0][55], [Black: 64#(and (<= 0 ~j1~0) (= ~j2~0 0) (= ~i2~0 0) (<= 1 ~i1~0)), 42#ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANTtrue, 8#L56true, Black: 99#(and (<= 1 ~j1~0) (= ~i1~0 0) (<= 1 ~j2~0) (= ~i2~0 0)), Black: 68#(= ~counter~0 0), Black: 74#(and (<= 0 ~j1~0) (= ~j2~0 0) (<= 1 ~i1~0) (<= 1 ~i2~0)), 36#thread3EXITtrue, 95#true, Black: 80#(and (<= 1 ~j1~0) (= ~i1~0 0) (= ~j2~0 0) (<= 1 ~i2~0)), 4#thread4EXITtrue, Black: 86#(and (<= 0 ~j1~0) (<= 1 ~j2~0) (= ~i2~0 0) (<= 1 ~i1~0)), 12#thread1EXITtrue, 103#(= ~counter~0 0), Black: 59#(and (= ~i1~0 0) (<= 0 ~j1~0) (= ~j2~0 0) (= ~i2~0 0)), Black: 93#(and (<= 1 ~j1~0) (= ~j2~0 0) (<= 1 ~i1~0) (<= 1 ~i2~0))]) [2024-06-27 18:03:43,654 INFO L294 olderBase$Statistics]: this new event has 33 ancestors and is cut-off event [2024-06-27 18:03:43,654 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2024-06-27 18:03:43,654 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2024-06-27 18:03:43,654 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2024-06-27 18:03:43,660 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([379] L41-->L44: Formula: (and (= v_~i1~0_24 (+ v_~i1~0_25 1)) (= (+ v_~counter~0_22 1) v_~counter~0_21)) InVars {~counter~0=v_~counter~0_22, ~i1~0=v_~i1~0_25} OutVars{~counter~0=v_~counter~0_21, ~i1~0=v_~i1~0_24, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_1|, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_1|} AuxVars[] AssignedVars[~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_#t~post2, ~i1~0][42], [Black: 64#(and (<= 0 ~j1~0) (= ~j2~0 0) (= ~i2~0 0) (<= 1 ~i1~0)), 42#ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANTtrue, Black: 99#(and (<= 1 ~j1~0) (= ~i1~0 0) (<= 1 ~j2~0) (= ~i2~0 0)), Black: 68#(= ~counter~0 0), 29#L44true, 104#(<= ~counter~0 1), Black: 74#(and (<= 0 ~j1~0) (= ~j2~0 0) (<= 1 ~i1~0) (<= 1 ~i2~0)), 95#true, Black: 80#(and (<= 1 ~j1~0) (= ~i1~0 0) (= ~j2~0 0) (<= 1 ~i2~0)), 4#thread4EXITtrue, 27#L67true, Black: 86#(and (<= 0 ~j1~0) (<= 1 ~j2~0) (= ~i2~0 0) (<= 1 ~i1~0)), 13#thread2EXITtrue, Black: 59#(and (= ~i1~0 0) (<= 0 ~j1~0) (= ~j2~0 0) (= ~i2~0 0)), Black: 93#(and (<= 1 ~j1~0) (= ~j2~0 0) (<= 1 ~i1~0) (<= 1 ~i2~0))]) [2024-06-27 18:03:43,660 INFO L294 olderBase$Statistics]: this new event has 34 ancestors and is cut-off event [2024-06-27 18:03:43,660 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2024-06-27 18:03:43,661 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2024-06-27 18:03:43,661 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2024-06-27 18:03:43,661 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([379] L41-->L44: Formula: (and (= v_~i1~0_24 (+ v_~i1~0_25 1)) (= (+ v_~counter~0_22 1) v_~counter~0_21)) InVars {~counter~0=v_~counter~0_22, ~i1~0=v_~i1~0_25} OutVars{~counter~0=v_~counter~0_21, ~i1~0=v_~i1~0_24, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_1|, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_1|} AuxVars[] AssignedVars[~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_#t~post2, ~i1~0][42], [Black: 64#(and (<= 0 ~j1~0) (= ~j2~0 0) (= ~i2~0 0) (<= 1 ~i1~0)), 42#ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANTtrue, 8#L56true, Black: 99#(and (<= 1 ~j1~0) (= ~i1~0 0) (<= 1 ~j2~0) (= ~i2~0 0)), Black: 68#(= ~counter~0 0), 29#L44true, 104#(<= ~counter~0 1), Black: 74#(and (<= 0 ~j1~0) (= ~j2~0 0) (<= 1 ~i1~0) (<= 1 ~i2~0)), 36#thread3EXITtrue, 95#true, Black: 80#(and (<= 1 ~j1~0) (= ~i1~0 0) (= ~j2~0 0) (<= 1 ~i2~0)), 4#thread4EXITtrue, Black: 86#(and (<= 0 ~j1~0) (<= 1 ~j2~0) (= ~i2~0 0) (<= 1 ~i1~0)), Black: 59#(and (= ~i1~0 0) (<= 0 ~j1~0) (= ~j2~0 0) (= ~i2~0 0)), Black: 93#(and (<= 1 ~j1~0) (= ~j2~0 0) (<= 1 ~i1~0) (<= 1 ~i2~0))]) [2024-06-27 18:03:43,661 INFO L294 olderBase$Statistics]: this new event has 34 ancestors and is cut-off event [2024-06-27 18:03:43,661 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2024-06-27 18:03:43,662 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2024-06-27 18:03:43,662 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2024-06-27 18:03:43,665 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([379] L41-->L44: Formula: (and (= v_~i1~0_24 (+ v_~i1~0_25 1)) (= (+ v_~counter~0_22 1) v_~counter~0_21)) InVars {~counter~0=v_~counter~0_22, ~i1~0=v_~i1~0_25} OutVars{~counter~0=v_~counter~0_21, ~i1~0=v_~i1~0_24, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_1|, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_1|} AuxVars[] AssignedVars[~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_#t~post2, ~i1~0][42], [Black: 64#(and (<= 0 ~j1~0) (= ~j2~0 0) (= ~i2~0 0) (<= 1 ~i1~0)), 42#ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANTtrue, Black: 99#(and (<= 1 ~j1~0) (= ~i1~0 0) (<= 1 ~j2~0) (= ~i2~0 0)), Black: 68#(= ~counter~0 0), 29#L44true, 104#(<= ~counter~0 1), Black: 74#(and (<= 0 ~j1~0) (= ~j2~0 0) (<= 1 ~i1~0) (<= 1 ~i2~0)), 36#thread3EXITtrue, 95#true, Black: 80#(and (<= 1 ~j1~0) (= ~i1~0 0) (= ~j2~0 0) (<= 1 ~i2~0)), 4#thread4EXITtrue, Black: 86#(and (<= 0 ~j1~0) (<= 1 ~j2~0) (= ~i2~0 0) (<= 1 ~i1~0)), 13#thread2EXITtrue, Black: 59#(and (= ~i1~0 0) (<= 0 ~j1~0) (= ~j2~0 0) (= ~i2~0 0)), Black: 93#(and (<= 1 ~j1~0) (= ~j2~0 0) (<= 1 ~i1~0) (<= 1 ~i2~0))]) [2024-06-27 18:03:43,666 INFO L294 olderBase$Statistics]: this new event has 35 ancestors and is cut-off event [2024-06-27 18:03:43,666 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2024-06-27 18:03:43,666 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2024-06-27 18:03:43,666 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2024-06-27 18:03:43,667 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([379] L41-->L44: Formula: (and (= v_~i1~0_24 (+ v_~i1~0_25 1)) (= (+ v_~counter~0_22 1) v_~counter~0_21)) InVars {~counter~0=v_~counter~0_22, ~i1~0=v_~i1~0_25} OutVars{~counter~0=v_~counter~0_21, ~i1~0=v_~i1~0_24, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_1|, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_1|} AuxVars[] AssignedVars[~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_#t~post2, ~i1~0][18], [Black: 64#(and (<= 0 ~j1~0) (= ~j2~0 0) (= ~i2~0 0) (<= 1 ~i1~0)), 42#ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANTtrue, 8#L56true, Black: 99#(and (<= 1 ~j1~0) (= ~i1~0 0) (<= 1 ~j2~0) (= ~i2~0 0)), Black: 68#(= ~counter~0 0), 29#L44true, Black: 74#(and (<= 0 ~j1~0) (= ~j2~0 0) (<= 1 ~i1~0) (<= 1 ~i2~0)), 95#true, Black: 80#(and (<= 1 ~j1~0) (= ~i1~0 0) (= ~j2~0 0) (<= 1 ~i2~0)), 4#thread4EXITtrue, 27#L67true, 101#true, Black: 86#(and (<= 0 ~j1~0) (<= 1 ~j2~0) (= ~i2~0 0) (<= 1 ~i1~0)), Black: 59#(and (= ~i1~0 0) (<= 0 ~j1~0) (= ~j2~0 0) (= ~i2~0 0)), Black: 93#(and (<= 1 ~j1~0) (= ~j2~0 0) (<= 1 ~i1~0) (<= 1 ~i2~0))]) [2024-06-27 18:03:43,667 INFO L294 olderBase$Statistics]: this new event has 35 ancestors and is cut-off event [2024-06-27 18:03:43,667 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2024-06-27 18:03:43,667 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2024-06-27 18:03:43,667 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2024-06-27 18:03:43,671 INFO L124 PetriNetUnfolderBase]: 5958/8837 cut-off events. [2024-06-27 18:03:43,671 INFO L125 PetriNetUnfolderBase]: For 20023/20249 co-relation queries the response was YES. [2024-06-27 18:03:43,700 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25869 conditions, 8837 events. 5958/8837 cut-off events. For 20023/20249 co-relation queries the response was YES. Maximal size of possible extension queue 489. Compared 53047 event pairs, 1085 based on Foata normal form. 390/9095 useless extension candidates. Maximal degree in co-relation 18926. Up to 3666 conditions per place. [2024-06-27 18:03:43,756 INFO L140 encePairwiseOnDemand]: 39/45 looper letters, 71 selfloop transitions, 23 changer transitions 2/108 dead transitions. [2024-06-27 18:03:43,756 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 108 transitions, 704 flow [2024-06-27 18:03:43,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-06-27 18:03:43,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-06-27 18:03:43,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 147 transitions. [2024-06-27 18:03:43,758 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8166666666666667 [2024-06-27 18:03:43,758 INFO L175 Difference]: Start difference. First operand has 57 places, 51 transitions, 252 flow. Second operand 4 states and 147 transitions. [2024-06-27 18:03:43,758 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 108 transitions, 704 flow [2024-06-27 18:03:43,800 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 108 transitions, 679 flow, removed 2 selfloop flow, removed 3 redundant places. [2024-06-27 18:03:43,802 INFO L231 Difference]: Finished difference. Result has 59 places, 71 transitions, 531 flow [2024-06-27 18:03:43,802 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=237, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=531, PETRI_PLACES=59, PETRI_TRANSITIONS=71} [2024-06-27 18:03:43,803 INFO L281 CegarLoopForPetriNet]: 49 programPoint places, 10 predicate places. [2024-06-27 18:03:43,803 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 71 transitions, 531 flow [2024-06-27 18:03:43,803 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 22.0) internal successors, (110), 5 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:03:43,803 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:03:43,803 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 18:03:43,804 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-06-27 18:03:43,804 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 18:03:43,804 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:03:43,804 INFO L85 PathProgramCache]: Analyzing trace with hash 1101355712, now seen corresponding path program 1 times [2024-06-27 18:03:43,805 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:03:43,805 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1201453389] [2024-06-27 18:03:43,805 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:03:43,805 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:03:43,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:03:43,943 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 18:03:43,943 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:03:43,943 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1201453389] [2024-06-27 18:03:43,943 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1201453389] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:03:43,944 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:03:43,944 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-27 18:03:43,944 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [427732879] [2024-06-27 18:03:43,946 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:03:43,946 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-27 18:03:43,949 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:03:43,950 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-27 18:03:43,951 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-06-27 18:03:43,983 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 45 [2024-06-27 18:03:43,983 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 71 transitions, 531 flow. Second operand has 6 states, 6 states have (on average 17.666666666666668) internal successors, (106), 6 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:03:43,983 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:03:43,983 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 45 [2024-06-27 18:03:43,983 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:03:44,965 INFO L124 PetriNetUnfolderBase]: 6226/9119 cut-off events. [2024-06-27 18:03:44,966 INFO L125 PetriNetUnfolderBase]: For 29847/29847 co-relation queries the response was YES. [2024-06-27 18:03:44,987 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31858 conditions, 9119 events. 6226/9119 cut-off events. For 29847/29847 co-relation queries the response was YES. Maximal size of possible extension queue 474. Compared 53582 event pairs, 1244 based on Foata normal form. 48/9142 useless extension candidates. Maximal degree in co-relation 22735. Up to 6609 conditions per place. [2024-06-27 18:03:45,043 INFO L140 encePairwiseOnDemand]: 39/45 looper letters, 110 selfloop transitions, 16 changer transitions 2/139 dead transitions. [2024-06-27 18:03:45,043 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 139 transitions, 1101 flow [2024-06-27 18:03:45,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-27 18:03:45,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-27 18:03:45,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 182 transitions. [2024-06-27 18:03:45,045 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.674074074074074 [2024-06-27 18:03:45,045 INFO L175 Difference]: Start difference. First operand has 59 places, 71 transitions, 531 flow. Second operand 6 states and 182 transitions. [2024-06-27 18:03:45,045 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 139 transitions, 1101 flow [2024-06-27 18:03:45,088 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 139 transitions, 1101 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-06-27 18:03:45,092 INFO L231 Difference]: Finished difference. Result has 65 places, 73 transitions, 602 flow [2024-06-27 18:03:45,093 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=531, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=71, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=602, PETRI_PLACES=65, PETRI_TRANSITIONS=73} [2024-06-27 18:03:45,094 INFO L281 CegarLoopForPetriNet]: 49 programPoint places, 16 predicate places. [2024-06-27 18:03:45,094 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 73 transitions, 602 flow [2024-06-27 18:03:45,095 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 17.666666666666668) internal successors, (106), 6 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:03:45,095 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:03:45,095 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 18:03:45,095 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-06-27 18:03:45,095 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 18:03:45,096 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:03:45,096 INFO L85 PathProgramCache]: Analyzing trace with hash -1649471048, now seen corresponding path program 2 times [2024-06-27 18:03:45,096 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:03:45,096 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1318850194] [2024-06-27 18:03:45,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:03:45,097 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:03:45,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:03:45,266 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 18:03:45,266 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:03:45,267 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1318850194] [2024-06-27 18:03:45,267 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1318850194] provided 0 perfect and 1 imperfect interpolant sequences [2024-06-27 18:03:45,268 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [259924216] [2024-06-27 18:03:45,268 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-06-27 18:03:45,268 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-06-27 18:03:45,268 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-27 18:03:45,270 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-06-27 18:03:45,289 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-06-27 18:03:45,397 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-06-27 18:03:45,397 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-06-27 18:03:45,400 INFO L262 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 9 conjunts are in the unsatisfiable core [2024-06-27 18:03:45,404 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-06-27 18:03:45,653 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 18:03:45,654 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-06-27 18:03:45,654 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [259924216] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:03:45,654 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-06-27 18:03:45,654 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 9 [2024-06-27 18:03:45,655 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1806869491] [2024-06-27 18:03:45,655 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:03:45,655 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-27 18:03:45,655 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:03:45,656 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-27 18:03:45,656 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2024-06-27 18:03:45,692 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 45 [2024-06-27 18:03:45,693 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 73 transitions, 602 flow. Second operand has 7 states, 7 states have (on average 17.428571428571427) internal successors, (122), 7 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:03:45,693 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:03:45,693 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 45 [2024-06-27 18:03:45,694 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:03:47,486 INFO L124 PetriNetUnfolderBase]: 11344/16924 cut-off events. [2024-06-27 18:03:47,486 INFO L125 PetriNetUnfolderBase]: For 69672/69672 co-relation queries the response was YES. [2024-06-27 18:03:47,561 INFO L83 FinitePrefix]: Finished finitePrefix Result has 58999 conditions, 16924 events. 11344/16924 cut-off events. For 69672/69672 co-relation queries the response was YES. Maximal size of possible extension queue 872. Compared 111121 event pairs, 2443 based on Foata normal form. 312/17159 useless extension candidates. Maximal degree in co-relation 41768. Up to 4385 conditions per place. [2024-06-27 18:03:47,671 INFO L140 encePairwiseOnDemand]: 40/45 looper letters, 150 selfloop transitions, 29 changer transitions 0/190 dead transitions. [2024-06-27 18:03:47,671 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 190 transitions, 1764 flow [2024-06-27 18:03:47,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-27 18:03:47,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-27 18:03:47,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 215 transitions. [2024-06-27 18:03:47,673 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6825396825396826 [2024-06-27 18:03:47,673 INFO L175 Difference]: Start difference. First operand has 65 places, 73 transitions, 602 flow. Second operand 7 states and 215 transitions. [2024-06-27 18:03:47,674 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 190 transitions, 1764 flow [2024-06-27 18:03:47,787 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 190 transitions, 1727 flow, removed 4 selfloop flow, removed 4 redundant places. [2024-06-27 18:03:47,790 INFO L231 Difference]: Finished difference. Result has 70 places, 91 transitions, 944 flow [2024-06-27 18:03:47,790 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=553, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=72, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=944, PETRI_PLACES=70, PETRI_TRANSITIONS=91} [2024-06-27 18:03:47,791 INFO L281 CegarLoopForPetriNet]: 49 programPoint places, 21 predicate places. [2024-06-27 18:03:47,791 INFO L495 AbstractCegarLoop]: Abstraction has has 70 places, 91 transitions, 944 flow [2024-06-27 18:03:47,791 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 17.428571428571427) internal successors, (122), 7 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:03:47,791 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:03:47,792 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 18:03:47,817 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-06-27 18:03:48,013 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2024-06-27 18:03:48,013 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 18:03:48,014 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:03:48,014 INFO L85 PathProgramCache]: Analyzing trace with hash -1290852357, now seen corresponding path program 1 times [2024-06-27 18:03:48,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:03:48,014 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1446733439] [2024-06-27 18:03:48,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:03:48,015 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:03:48,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:03:48,153 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 18:03:48,155 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:03:48,155 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1446733439] [2024-06-27 18:03:48,156 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1446733439] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:03:48,156 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:03:48,156 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-27 18:03:48,156 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [879986614] [2024-06-27 18:03:48,158 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:03:48,159 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-06-27 18:03:48,159 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:03:48,159 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-06-27 18:03:48,160 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-06-27 18:03:48,173 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 45 [2024-06-27 18:03:48,173 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 91 transitions, 944 flow. Second operand has 4 states, 4 states have (on average 22.75) internal successors, (91), 4 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:03:48,173 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:03:48,174 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 45 [2024-06-27 18:03:48,174 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:03:50,891 INFO L124 PetriNetUnfolderBase]: 23908/33315 cut-off events. [2024-06-27 18:03:50,891 INFO L125 PetriNetUnfolderBase]: For 147568/148912 co-relation queries the response was YES. [2024-06-27 18:03:51,130 INFO L83 FinitePrefix]: Finished finitePrefix Result has 118480 conditions, 33315 events. 23908/33315 cut-off events. For 147568/148912 co-relation queries the response was YES. Maximal size of possible extension queue 1639. Compared 214319 event pairs, 6710 based on Foata normal form. 138/28831 useless extension candidates. Maximal degree in co-relation 82749. Up to 29156 conditions per place. [2024-06-27 18:03:51,311 INFO L140 encePairwiseOnDemand]: 39/45 looper letters, 118 selfloop transitions, 23 changer transitions 0/150 dead transitions. [2024-06-27 18:03:51,311 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 150 transitions, 1598 flow [2024-06-27 18:03:51,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-06-27 18:03:51,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-06-27 18:03:51,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 140 transitions. [2024-06-27 18:03:51,313 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7777777777777778 [2024-06-27 18:03:51,313 INFO L175 Difference]: Start difference. First operand has 70 places, 91 transitions, 944 flow. Second operand 4 states and 140 transitions. [2024-06-27 18:03:51,313 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 150 transitions, 1598 flow [2024-06-27 18:03:51,594 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 150 transitions, 1597 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-06-27 18:03:51,597 INFO L231 Difference]: Finished difference. Result has 74 places, 103 transitions, 1165 flow [2024-06-27 18:03:51,597 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=943, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=78, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1165, PETRI_PLACES=74, PETRI_TRANSITIONS=103} [2024-06-27 18:03:51,599 INFO L281 CegarLoopForPetriNet]: 49 programPoint places, 25 predicate places. [2024-06-27 18:03:51,599 INFO L495 AbstractCegarLoop]: Abstraction has has 74 places, 103 transitions, 1165 flow [2024-06-27 18:03:51,600 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.75) internal successors, (91), 4 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:03:51,600 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:03:51,600 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 18:03:51,601 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-06-27 18:03:51,601 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 18:03:51,601 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:03:51,601 INFO L85 PathProgramCache]: Analyzing trace with hash -1213704645, now seen corresponding path program 2 times [2024-06-27 18:03:51,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:03:51,602 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1471294666] [2024-06-27 18:03:51,602 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:03:51,602 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:03:51,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:03:51,698 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 18:03:51,698 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:03:51,698 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1471294666] [2024-06-27 18:03:51,699 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1471294666] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:03:51,699 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:03:51,699 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-27 18:03:51,699 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1362125678] [2024-06-27 18:03:51,699 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:03:51,700 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-06-27 18:03:51,700 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:03:51,700 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-06-27 18:03:51,701 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-06-27 18:03:51,723 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 45 [2024-06-27 18:03:51,723 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 103 transitions, 1165 flow. Second operand has 4 states, 4 states have (on average 22.75) internal successors, (91), 4 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:03:51,723 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:03:51,723 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 45 [2024-06-27 18:03:51,724 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:03:54,261 INFO L124 PetriNetUnfolderBase]: 22182/31221 cut-off events. [2024-06-27 18:03:54,262 INFO L125 PetriNetUnfolderBase]: For 162290/162482 co-relation queries the response was YES. [2024-06-27 18:03:54,354 INFO L83 FinitePrefix]: Finished finitePrefix Result has 121458 conditions, 31221 events. 22182/31221 cut-off events. For 162290/162482 co-relation queries the response was YES. Maximal size of possible extension queue 1475. Compared 202797 event pairs, 7233 based on Foata normal form. 24/28419 useless extension candidates. Maximal degree in co-relation 84609. Up to 29179 conditions per place. [2024-06-27 18:03:54,493 INFO L140 encePairwiseOnDemand]: 39/45 looper letters, 127 selfloop transitions, 6 changer transitions 2/144 dead transitions. [2024-06-27 18:03:54,493 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 144 transitions, 1557 flow [2024-06-27 18:03:54,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-06-27 18:03:54,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-06-27 18:03:54,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 135 transitions. [2024-06-27 18:03:54,494 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.75 [2024-06-27 18:03:54,495 INFO L175 Difference]: Start difference. First operand has 74 places, 103 transitions, 1165 flow. Second operand 4 states and 135 transitions. [2024-06-27 18:03:54,495 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 144 transitions, 1557 flow [2024-06-27 18:03:54,909 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 144 transitions, 1536 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-06-27 18:03:54,912 INFO L231 Difference]: Finished difference. Result has 78 places, 105 transitions, 1176 flow [2024-06-27 18:03:54,912 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=1144, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=103, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=97, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1176, PETRI_PLACES=78, PETRI_TRANSITIONS=105} [2024-06-27 18:03:54,912 INFO L281 CegarLoopForPetriNet]: 49 programPoint places, 29 predicate places. [2024-06-27 18:03:54,913 INFO L495 AbstractCegarLoop]: Abstraction has has 78 places, 105 transitions, 1176 flow [2024-06-27 18:03:54,913 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.75) internal successors, (91), 4 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:03:54,913 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:03:54,913 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 18:03:54,913 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-06-27 18:03:54,913 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 18:03:54,914 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:03:54,914 INFO L85 PathProgramCache]: Analyzing trace with hash -971161541, now seen corresponding path program 1 times [2024-06-27 18:03:54,914 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:03:54,914 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [569984207] [2024-06-27 18:03:54,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:03:54,914 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:03:54,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:03:55,002 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 18:03:55,002 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:03:55,002 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [569984207] [2024-06-27 18:03:55,002 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [569984207] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:03:55,002 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:03:55,003 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-27 18:03:55,003 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1266057735] [2024-06-27 18:03:55,003 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:03:55,004 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-27 18:03:55,005 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:03:55,005 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-27 18:03:55,006 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-06-27 18:03:55,026 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 45 [2024-06-27 18:03:55,026 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 105 transitions, 1176 flow. Second operand has 5 states, 5 states have (on average 21.8) internal successors, (109), 5 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:03:55,027 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:03:55,027 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 45 [2024-06-27 18:03:55,027 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:03:57,777 INFO L124 PetriNetUnfolderBase]: 21978/30607 cut-off events. [2024-06-27 18:03:57,777 INFO L125 PetriNetUnfolderBase]: For 180378/180876 co-relation queries the response was YES. [2024-06-27 18:03:57,881 INFO L83 FinitePrefix]: Finished finitePrefix Result has 127813 conditions, 30607 events. 21978/30607 cut-off events. For 180378/180876 co-relation queries the response was YES. Maximal size of possible extension queue 1428. Compared 192178 event pairs, 4817 based on Foata normal form. 261/30831 useless extension candidates. Maximal degree in co-relation 89414. Up to 16755 conditions per place. [2024-06-27 18:03:58,028 INFO L140 encePairwiseOnDemand]: 40/45 looper letters, 174 selfloop transitions, 41 changer transitions 6/230 dead transitions. [2024-06-27 18:03:58,029 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 230 transitions, 2937 flow [2024-06-27 18:03:58,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-27 18:03:58,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-27 18:03:58,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 170 transitions. [2024-06-27 18:03:58,031 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7555555555555555 [2024-06-27 18:03:58,031 INFO L175 Difference]: Start difference. First operand has 78 places, 105 transitions, 1176 flow. Second operand 5 states and 170 transitions. [2024-06-27 18:03:58,031 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 230 transitions, 2937 flow [2024-06-27 18:03:58,329 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 230 transitions, 2923 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-06-27 18:03:58,332 INFO L231 Difference]: Finished difference. Result has 82 places, 127 transitions, 1627 flow [2024-06-27 18:03:58,332 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=1168, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=105, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=83, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1627, PETRI_PLACES=82, PETRI_TRANSITIONS=127} [2024-06-27 18:03:58,333 INFO L281 CegarLoopForPetriNet]: 49 programPoint places, 33 predicate places. [2024-06-27 18:03:58,333 INFO L495 AbstractCegarLoop]: Abstraction has has 82 places, 127 transitions, 1627 flow [2024-06-27 18:03:58,477 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 21.8) internal successors, (109), 5 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:03:58,477 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:03:58,477 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 18:03:58,477 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-06-27 18:03:58,477 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 18:03:58,478 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:03:58,478 INFO L85 PathProgramCache]: Analyzing trace with hash -1253767607, now seen corresponding path program 2 times [2024-06-27 18:03:58,478 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:03:58,478 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1486462113] [2024-06-27 18:03:58,478 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:03:58,478 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:03:58,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:03:58,575 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 18:03:58,575 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:03:58,575 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1486462113] [2024-06-27 18:03:58,575 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1486462113] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:03:58,575 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:03:58,576 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-27 18:03:58,576 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2001351591] [2024-06-27 18:03:58,576 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:03:58,576 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-06-27 18:03:58,577 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:03:58,577 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-06-27 18:03:58,577 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-06-27 18:03:58,593 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 45 [2024-06-27 18:03:58,594 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 127 transitions, 1627 flow. Second operand has 4 states, 4 states have (on average 22.75) internal successors, (91), 4 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:03:58,594 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:03:58,594 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 45 [2024-06-27 18:03:58,594 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:04:01,996 INFO L124 PetriNetUnfolderBase]: 26786/37673 cut-off events. [2024-06-27 18:04:01,997 INFO L125 PetriNetUnfolderBase]: For 237908/237927 co-relation queries the response was YES. [2024-06-27 18:04:02,148 INFO L83 FinitePrefix]: Finished finitePrefix Result has 169360 conditions, 37673 events. 26786/37673 cut-off events. For 237908/237927 co-relation queries the response was YES. Maximal size of possible extension queue 1806. Compared 245900 event pairs, 5687 based on Foata normal form. 0/35255 useless extension candidates. Maximal degree in co-relation 123828. Up to 18614 conditions per place. [2024-06-27 18:04:02,298 INFO L140 encePairwiseOnDemand]: 40/45 looper letters, 162 selfloop transitions, 18 changer transitions 4/194 dead transitions. [2024-06-27 18:04:02,298 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 194 transitions, 2641 flow [2024-06-27 18:04:02,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-06-27 18:04:02,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-06-27 18:04:02,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 128 transitions. [2024-06-27 18:04:02,299 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7111111111111111 [2024-06-27 18:04:02,299 INFO L175 Difference]: Start difference. First operand has 82 places, 127 transitions, 1627 flow. Second operand 4 states and 128 transitions. [2024-06-27 18:04:02,299 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 194 transitions, 2641 flow [2024-06-27 18:04:02,937 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 194 transitions, 2594 flow, removed 3 selfloop flow, removed 1 redundant places. [2024-06-27 18:04:02,939 INFO L231 Difference]: Finished difference. Result has 86 places, 130 transitions, 1669 flow [2024-06-27 18:04:02,939 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=1588, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=127, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=109, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1669, PETRI_PLACES=86, PETRI_TRANSITIONS=130} [2024-06-27 18:04:02,940 INFO L281 CegarLoopForPetriNet]: 49 programPoint places, 37 predicate places. [2024-06-27 18:04:02,940 INFO L495 AbstractCegarLoop]: Abstraction has has 86 places, 130 transitions, 1669 flow [2024-06-27 18:04:02,940 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.75) internal successors, (91), 4 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:04:02,941 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:04:02,941 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 18:04:02,941 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-06-27 18:04:02,941 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 18:04:02,941 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:04:02,942 INFO L85 PathProgramCache]: Analyzing trace with hash 139226839, now seen corresponding path program 3 times [2024-06-27 18:04:02,942 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:04:02,942 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [487296956] [2024-06-27 18:04:02,942 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:04:02,942 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:04:02,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:04:03,033 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 18:04:03,033 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:04:03,033 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [487296956] [2024-06-27 18:04:03,034 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [487296956] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:04:03,034 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:04:03,034 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-27 18:04:03,034 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [988118997] [2024-06-27 18:04:03,034 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:04:03,035 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-27 18:04:03,035 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:04:03,035 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-27 18:04:03,035 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-06-27 18:04:03,068 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 45 [2024-06-27 18:04:03,068 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 130 transitions, 1669 flow. Second operand has 5 states, 5 states have (on average 21.6) internal successors, (108), 5 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:04:03,068 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:04:03,069 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 45 [2024-06-27 18:04:03,069 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:04:06,935 INFO L124 PetriNetUnfolderBase]: 30449/42863 cut-off events. [2024-06-27 18:04:06,935 INFO L125 PetriNetUnfolderBase]: For 268604/278721 co-relation queries the response was YES. [2024-06-27 18:04:07,154 INFO L83 FinitePrefix]: Finished finitePrefix Result has 194569 conditions, 42863 events. 30449/42863 cut-off events. For 268604/278721 co-relation queries the response was YES. Maximal size of possible extension queue 1924. Compared 283774 event pairs, 7589 based on Foata normal form. 1231/42677 useless extension candidates. Maximal degree in co-relation 131744. Up to 30542 conditions per place. [2024-06-27 18:04:07,633 INFO L140 encePairwiseOnDemand]: 39/45 looper letters, 149 selfloop transitions, 35 changer transitions 0/197 dead transitions. [2024-06-27 18:04:07,634 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 197 transitions, 2300 flow [2024-06-27 18:04:07,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-27 18:04:07,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-27 18:04:07,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 174 transitions. [2024-06-27 18:04:07,635 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7733333333333333 [2024-06-27 18:04:07,635 INFO L175 Difference]: Start difference. First operand has 86 places, 130 transitions, 1669 flow. Second operand 5 states and 174 transitions. [2024-06-27 18:04:07,635 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 90 places, 197 transitions, 2300 flow [2024-06-27 18:04:08,047 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 89 places, 197 transitions, 2283 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-06-27 18:04:08,049 INFO L231 Difference]: Finished difference. Result has 92 places, 121 transitions, 1560 flow [2024-06-27 18:04:08,049 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=1414, PETRI_DIFFERENCE_MINUEND_PLACES=85, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=118, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=83, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1560, PETRI_PLACES=92, PETRI_TRANSITIONS=121} [2024-06-27 18:04:08,050 INFO L281 CegarLoopForPetriNet]: 49 programPoint places, 43 predicate places. [2024-06-27 18:04:08,050 INFO L495 AbstractCegarLoop]: Abstraction has has 92 places, 121 transitions, 1560 flow [2024-06-27 18:04:08,050 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 21.6) internal successors, (108), 5 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:04:08,050 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:04:08,050 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 18:04:08,050 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-06-27 18:04:08,050 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 18:04:08,051 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:04:08,051 INFO L85 PathProgramCache]: Analyzing trace with hash -309664739, now seen corresponding path program 3 times [2024-06-27 18:04:08,051 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:04:08,051 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2036881094] [2024-06-27 18:04:08,052 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:04:08,052 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:04:08,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:04:08,134 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 18:04:08,135 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:04:08,135 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2036881094] [2024-06-27 18:04:08,135 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2036881094] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:04:08,135 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:04:08,135 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-27 18:04:08,135 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1477028221] [2024-06-27 18:04:08,136 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:04:08,136 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-06-27 18:04:08,137 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:04:08,137 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-06-27 18:04:08,137 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-06-27 18:04:08,147 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 45 [2024-06-27 18:04:08,148 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 121 transitions, 1560 flow. Second operand has 4 states, 4 states have (on average 22.75) internal successors, (91), 4 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:04:08,148 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:04:08,148 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 45 [2024-06-27 18:04:08,148 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:04:10,007 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([385] L67-->L64: Formula: (< v_~j1~0_4 v_~M1~0_2) InVars {~j1~0=v_~j1~0_4, ~M1~0=v_~M1~0_2} OutVars{~j1~0=v_~j1~0_4, ~M1~0=v_~M1~0_2} AuxVars[] AssignedVars[][41], [Black: 64#(and (<= 0 ~j1~0) (= ~j2~0 0) (= ~i2~0 0) (<= 1 ~i1~0)), 33#L64true, 247#(and (= ~j2~0 0) (<= ~M1~0 (+ ~M2~0 ~j1~0))), Black: 68#(= ~counter~0 0), Black: 171#(and (<= 0 ~j1~0) (<= 0 ~j2~0) (<= 0 ~i2~0) (<= 1 ~i1~0)), Black: 184#(and (<= 2 ~i1~0) (<= 0 ~j1~0) (<= 0 ~j2~0) (<= 0 ~i2~0)), Black: 125#(and (<= 0 ~i1~0) (<= 0 ~j1~0) (<= 0 ~j2~0) (<= 0 ~i2~0)), 218#true, Black: 207#(and (<= ~N1~0 0) (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 80#(and (<= 1 ~j1~0) (= ~i1~0 0) (= ~j2~0 0) (<= 1 ~i2~0)), Black: 204#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), 101#true, Black: 86#(and (<= 0 ~j1~0) (<= 1 ~j2~0) (= ~i2~0 0) (<= 1 ~i1~0)), Black: 215#(and (= ~i1~0 0) (<= (+ ~N1~0 ~j1~0) ~M1~0) (<= (+ ~j1~0 1) ~M1~0)), Black: 212#(and (= ~i1~0 0) (<= (+ ~N1~0 ~j1~0) ~M1~0)), Black: 93#(and (<= 1 ~j1~0) (= ~j2~0 0) (<= 1 ~i1~0) (<= 1 ~i2~0)), 188#(and (<= 2 ~i1~0) (<= 0 ~j1~0) (<= 0 ~j2~0) (<= 1 ~i2~0)), 232#(and (<= 1 ~M2~0) (= ~j2~0 0) (<= ~M1~0 (+ ~M2~0 ~j1~0))), Black: 220#(and (<= ~M1~0 (+ ~N1~0 ~j1~0)) (= ~i1~0 0)), Black: 224#(and (<= ~M1~0 (+ ~N1~0 ~j1~0)) (= ~i1~0 0) (<= ~M1~0 ~j1~0)), 8#L56true, 235#true, Black: 99#(and (<= 1 ~j1~0) (= ~i1~0 0) (<= 1 ~j2~0) (= ~i2~0 0)), 16#L41true, Black: 229#(and (= ~j2~0 0) (<= ~M1~0 (+ ~M2~0 ~j1~0))), Black: 104#(<= ~counter~0 1), Black: 103#(= ~counter~0 0), 40#L98-5true, 17#L75true, Black: 113#(and (<= 1 ~j1~0) (<= 1 ~j2~0) (= ~i2~0 0) (<= 1 ~i1~0)), Black: 241#(and (= ~i1~0 0) (<= 1 ~N2~0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 239#(and (<= 1 ~N2~0) (= ~i2~0 0)), 74#(and (<= 0 ~j1~0) (= ~j2~0 0) (<= 1 ~i1~0) (<= 1 ~i2~0)), Black: 237#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 59#(and (= ~i1~0 0) (<= 0 ~j1~0) (= ~j2~0 0) (= ~i2~0 0))]) [2024-06-27 18:04:10,007 INFO L294 olderBase$Statistics]: this new event has 29 ancestors and is cut-off event [2024-06-27 18:04:10,007 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2024-06-27 18:04:10,007 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2024-06-27 18:04:10,008 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2024-06-27 18:04:10,609 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([385] L67-->L64: Formula: (< v_~j1~0_4 v_~M1~0_2) InVars {~j1~0=v_~j1~0_4, ~M1~0=v_~M1~0_2} OutVars{~j1~0=v_~j1~0_4, ~M1~0=v_~M1~0_2} AuxVars[] AssignedVars[][41], [Black: 64#(and (<= 0 ~j1~0) (= ~j2~0 0) (= ~i2~0 0) (<= 1 ~i1~0)), 247#(and (= ~j2~0 0) (<= ~M1~0 (+ ~M2~0 ~j1~0))), 33#L64true, Black: 68#(= ~counter~0 0), Black: 171#(and (<= 0 ~j1~0) (<= 0 ~j2~0) (<= 0 ~i2~0) (<= 1 ~i1~0)), Black: 184#(and (<= 2 ~i1~0) (<= 0 ~j1~0) (<= 0 ~j2~0) (<= 0 ~i2~0)), Black: 125#(and (<= 0 ~i1~0) (<= 0 ~j1~0) (<= 0 ~j2~0) (<= 0 ~i2~0)), 218#true, Black: 207#(and (<= ~N1~0 0) (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 204#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 80#(and (<= 1 ~j1~0) (= ~i1~0 0) (= ~j2~0 0) (<= 1 ~i2~0)), 101#true, Black: 86#(and (<= 0 ~j1~0) (<= 1 ~j2~0) (= ~i2~0 0) (<= 1 ~i1~0)), Black: 215#(and (= ~i1~0 0) (<= (+ ~N1~0 ~j1~0) ~M1~0) (<= (+ ~j1~0 1) ~M1~0)), Black: 212#(and (= ~i1~0 0) (<= (+ ~N1~0 ~j1~0) ~M1~0)), Black: 93#(and (<= 1 ~j1~0) (= ~j2~0 0) (<= 1 ~i1~0) (<= 1 ~i2~0)), 188#(and (<= 2 ~i1~0) (<= 0 ~j1~0) (<= 0 ~j2~0) (<= 1 ~i2~0)), 232#(and (<= 1 ~M2~0) (= ~j2~0 0) (<= ~M1~0 (+ ~M2~0 ~j1~0))), Black: 220#(and (<= ~M1~0 (+ ~N1~0 ~j1~0)) (= ~i1~0 0)), Black: 224#(and (<= ~M1~0 (+ ~N1~0 ~j1~0)) (= ~i1~0 0) (<= ~M1~0 ~j1~0)), 235#true, Black: 99#(and (<= 1 ~j1~0) (= ~i1~0 0) (<= 1 ~j2~0) (= ~i2~0 0)), 16#L41true, Black: 229#(and (= ~j2~0 0) (<= ~M1~0 (+ ~M2~0 ~j1~0))), Black: 104#(<= ~counter~0 1), Black: 103#(= ~counter~0 0), 40#L98-5true, 17#L75true, Black: 113#(and (<= 1 ~j1~0) (<= 1 ~j2~0) (= ~i2~0 0) (<= 1 ~i1~0)), Black: 241#(and (= ~i1~0 0) (<= 1 ~N2~0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 239#(and (<= 1 ~N2~0) (= ~i2~0 0)), 74#(and (<= 0 ~j1~0) (= ~j2~0 0) (<= 1 ~i1~0) (<= 1 ~i2~0)), Black: 237#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), 13#thread2EXITtrue, Black: 59#(and (= ~i1~0 0) (<= 0 ~j1~0) (= ~j2~0 0) (= ~i2~0 0))]) [2024-06-27 18:04:10,609 INFO L294 olderBase$Statistics]: this new event has 30 ancestors and is cut-off event [2024-06-27 18:04:10,609 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2024-06-27 18:04:10,609 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2024-06-27 18:04:10,609 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2024-06-27 18:04:10,611 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([385] L67-->L64: Formula: (< v_~j1~0_4 v_~M1~0_2) InVars {~j1~0=v_~j1~0_4, ~M1~0=v_~M1~0_2} OutVars{~j1~0=v_~j1~0_4, ~M1~0=v_~M1~0_2} AuxVars[] AssignedVars[][41], [Black: 64#(and (<= 0 ~j1~0) (= ~j2~0 0) (= ~i2~0 0) (<= 1 ~i1~0)), 33#L64true, 247#(and (= ~j2~0 0) (<= ~M1~0 (+ ~M2~0 ~j1~0))), Black: 68#(= ~counter~0 0), Black: 171#(and (<= 0 ~j1~0) (<= 0 ~j2~0) (<= 0 ~i2~0) (<= 1 ~i1~0)), Black: 184#(and (<= 2 ~i1~0) (<= 0 ~j1~0) (<= 0 ~j2~0) (<= 0 ~i2~0)), Black: 125#(and (<= 0 ~i1~0) (<= 0 ~j1~0) (<= 0 ~j2~0) (<= 0 ~i2~0)), 218#true, Black: 207#(and (<= ~N1~0 0) (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 80#(and (<= 1 ~j1~0) (= ~i1~0 0) (= ~j2~0 0) (<= 1 ~i2~0)), Black: 204#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), 101#true, Black: 86#(and (<= 0 ~j1~0) (<= 1 ~j2~0) (= ~i2~0 0) (<= 1 ~i1~0)), Black: 215#(and (= ~i1~0 0) (<= (+ ~N1~0 ~j1~0) ~M1~0) (<= (+ ~j1~0 1) ~M1~0)), Black: 212#(and (= ~i1~0 0) (<= (+ ~N1~0 ~j1~0) ~M1~0)), Black: 93#(and (<= 1 ~j1~0) (= ~j2~0 0) (<= 1 ~i1~0) (<= 1 ~i2~0)), 188#(and (<= 2 ~i1~0) (<= 0 ~j1~0) (<= 0 ~j2~0) (<= 1 ~i2~0)), 232#(and (<= 1 ~M2~0) (= ~j2~0 0) (<= ~M1~0 (+ ~M2~0 ~j1~0))), Black: 220#(and (<= ~M1~0 (+ ~N1~0 ~j1~0)) (= ~i1~0 0)), 8#L56true, Black: 224#(and (<= ~M1~0 (+ ~N1~0 ~j1~0)) (= ~i1~0 0) (<= ~M1~0 ~j1~0)), 235#true, Black: 99#(and (<= 1 ~j1~0) (= ~i1~0 0) (<= 1 ~j2~0) (= ~i2~0 0)), 14#L99true, 16#L41true, Black: 229#(and (= ~j2~0 0) (<= ~M1~0 (+ ~M2~0 ~j1~0))), Black: 104#(<= ~counter~0 1), Black: 103#(= ~counter~0 0), 17#L75true, Black: 113#(and (<= 1 ~j1~0) (<= 1 ~j2~0) (= ~i2~0 0) (<= 1 ~i1~0)), Black: 241#(and (= ~i1~0 0) (<= 1 ~N2~0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 239#(and (<= 1 ~N2~0) (= ~i2~0 0)), 74#(and (<= 0 ~j1~0) (= ~j2~0 0) (<= 1 ~i1~0) (<= 1 ~i2~0)), Black: 237#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 59#(and (= ~i1~0 0) (<= 0 ~j1~0) (= ~j2~0 0) (= ~i2~0 0))]) [2024-06-27 18:04:10,611 INFO L294 olderBase$Statistics]: this new event has 30 ancestors and is cut-off event [2024-06-27 18:04:10,611 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2024-06-27 18:04:10,611 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2024-06-27 18:04:10,611 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2024-06-27 18:04:10,613 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([385] L67-->L64: Formula: (< v_~j1~0_4 v_~M1~0_2) InVars {~j1~0=v_~j1~0_4, ~M1~0=v_~M1~0_2} OutVars{~j1~0=v_~j1~0_4, ~M1~0=v_~M1~0_2} AuxVars[] AssignedVars[][107], [Black: 64#(and (<= 0 ~j1~0) (= ~j2~0 0) (= ~i2~0 0) (<= 1 ~i1~0)), 33#L64true, Black: 68#(= ~counter~0 0), Black: 171#(and (<= 0 ~j1~0) (<= 0 ~j2~0) (<= 0 ~i2~0) (<= 1 ~i1~0)), Black: 184#(and (<= 2 ~i1~0) (<= 0 ~j1~0) (<= 0 ~j2~0) (<= 0 ~i2~0)), Black: 125#(and (<= 0 ~i1~0) (<= 0 ~j1~0) (<= 0 ~j2~0) (<= 0 ~i2~0)), Black: 188#(and (<= 2 ~i1~0) (<= 0 ~j1~0) (<= 0 ~j2~0) (<= 1 ~i2~0)), Black: 74#(and (<= 0 ~j1~0) (= ~j2~0 0) (<= 1 ~i1~0) (<= 1 ~i2~0)), 218#true, Black: 207#(and (<= ~N1~0 0) (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 80#(and (<= 1 ~j1~0) (= ~i1~0 0) (= ~j2~0 0) (<= 1 ~i2~0)), Black: 204#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), 101#true, Black: 86#(and (<= 0 ~j1~0) (<= 1 ~j2~0) (= ~i2~0 0) (<= 1 ~i1~0)), Black: 215#(and (= ~i1~0 0) (<= (+ ~N1~0 ~j1~0) ~M1~0) (<= (+ ~j1~0 1) ~M1~0)), Black: 212#(and (= ~i1~0 0) (<= (+ ~N1~0 ~j1~0) ~M1~0)), 245#true, Black: 93#(and (<= 1 ~j1~0) (= ~j2~0 0) (<= 1 ~i1~0) (<= 1 ~i2~0)), 121#(and (<= 2 ~i1~0) (<= 0 ~j1~0) (<= 1 ~j2~0) (<= 1 ~i2~0)), Black: 220#(and (<= ~M1~0 (+ ~N1~0 ~j1~0)) (= ~i1~0 0)), Black: 224#(and (<= ~M1~0 (+ ~N1~0 ~j1~0)) (= ~i1~0 0) (<= ~M1~0 ~j1~0)), 8#L56true, 235#true, Black: 99#(and (<= 1 ~j1~0) (= ~i1~0 0) (<= 1 ~j2~0) (= ~i2~0 0)), 16#L41true, Black: 229#(and (= ~j2~0 0) (<= ~M1~0 (+ ~M2~0 ~j1~0))), Black: 104#(<= ~counter~0 1), Black: 232#(and (<= 1 ~M2~0) (= ~j2~0 0) (<= ~M1~0 (+ ~M2~0 ~j1~0))), Black: 103#(= ~counter~0 0), 40#L98-5true, 25#L79true, Black: 113#(and (<= 1 ~j1~0) (<= 1 ~j2~0) (= ~i2~0 0) (<= 1 ~i1~0)), Black: 241#(and (= ~i1~0 0) (<= 1 ~N2~0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 239#(and (<= 1 ~N2~0) (= ~i2~0 0)), Black: 237#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 59#(and (= ~i1~0 0) (<= 0 ~j1~0) (= ~j2~0 0) (= ~i2~0 0))]) [2024-06-27 18:04:10,613 INFO L294 olderBase$Statistics]: this new event has 30 ancestors and is cut-off event [2024-06-27 18:04:10,613 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2024-06-27 18:04:10,613 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2024-06-27 18:04:10,613 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2024-06-27 18:04:10,614 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([385] L67-->L64: Formula: (< v_~j1~0_4 v_~M1~0_2) InVars {~j1~0=v_~j1~0_4, ~M1~0=v_~M1~0_2} OutVars{~j1~0=v_~j1~0_4, ~M1~0=v_~M1~0_2} AuxVars[] AssignedVars[][107], [Black: 64#(and (<= 0 ~j1~0) (= ~j2~0 0) (= ~i2~0 0) (<= 1 ~i1~0)), 33#L64true, Black: 68#(= ~counter~0 0), Black: 171#(and (<= 0 ~j1~0) (<= 0 ~j2~0) (<= 0 ~i2~0) (<= 1 ~i1~0)), Black: 184#(and (<= 2 ~i1~0) (<= 0 ~j1~0) (<= 0 ~j2~0) (<= 0 ~i2~0)), Black: 125#(and (<= 0 ~i1~0) (<= 0 ~j1~0) (<= 0 ~j2~0) (<= 0 ~i2~0)), Black: 74#(and (<= 0 ~j1~0) (= ~j2~0 0) (<= 1 ~i1~0) (<= 1 ~i2~0)), 218#true, Black: 207#(and (<= ~N1~0 0) (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 80#(and (<= 1 ~j1~0) (= ~i1~0 0) (= ~j2~0 0) (<= 1 ~i2~0)), Black: 204#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), 101#true, Black: 86#(and (<= 0 ~j1~0) (<= 1 ~j2~0) (= ~i2~0 0) (<= 1 ~i1~0)), Black: 215#(and (= ~i1~0 0) (<= (+ ~N1~0 ~j1~0) ~M1~0) (<= (+ ~j1~0 1) ~M1~0)), Black: 212#(and (= ~i1~0 0) (<= (+ ~N1~0 ~j1~0) ~M1~0)), 245#true, Black: 93#(and (<= 1 ~j1~0) (= ~j2~0 0) (<= 1 ~i1~0) (<= 1 ~i2~0)), 188#(and (<= 2 ~i1~0) (<= 0 ~j1~0) (<= 0 ~j2~0) (<= 1 ~i2~0)), Black: 220#(and (<= ~M1~0 (+ ~N1~0 ~j1~0)) (= ~i1~0 0)), 8#L56true, Black: 224#(and (<= ~M1~0 (+ ~N1~0 ~j1~0)) (= ~i1~0 0) (<= ~M1~0 ~j1~0)), 235#true, Black: 99#(and (<= 1 ~j1~0) (= ~i1~0 0) (<= 1 ~j2~0) (= ~i2~0 0)), 16#L41true, Black: 229#(and (= ~j2~0 0) (<= ~M1~0 (+ ~M2~0 ~j1~0))), Black: 104#(<= ~counter~0 1), Black: 232#(and (<= 1 ~M2~0) (= ~j2~0 0) (<= ~M1~0 (+ ~M2~0 ~j1~0))), Black: 103#(= ~counter~0 0), 40#L98-5true, Black: 113#(and (<= 1 ~j1~0) (<= 1 ~j2~0) (= ~i2~0 0) (<= 1 ~i1~0)), Black: 241#(and (= ~i1~0 0) (<= 1 ~N2~0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), 25#L79true, Black: 239#(and (<= 1 ~N2~0) (= ~i2~0 0)), Black: 237#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 59#(and (= ~i1~0 0) (<= 0 ~j1~0) (= ~j2~0 0) (= ~i2~0 0))]) [2024-06-27 18:04:10,614 INFO L294 olderBase$Statistics]: this new event has 30 ancestors and is cut-off event [2024-06-27 18:04:10,614 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2024-06-27 18:04:10,614 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2024-06-27 18:04:10,614 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2024-06-27 18:04:10,628 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([385] L67-->L64: Formula: (< v_~j1~0_4 v_~M1~0_2) InVars {~j1~0=v_~j1~0_4, ~M1~0=v_~M1~0_2} OutVars{~j1~0=v_~j1~0_4, ~M1~0=v_~M1~0_2} AuxVars[] AssignedVars[][107], [Black: 64#(and (<= 0 ~j1~0) (= ~j2~0 0) (= ~i2~0 0) (<= 1 ~i1~0)), 33#L64true, Black: 68#(= ~counter~0 0), Black: 171#(and (<= 0 ~j1~0) (<= 0 ~j2~0) (<= 0 ~i2~0) (<= 1 ~i1~0)), Black: 184#(and (<= 2 ~i1~0) (<= 0 ~j1~0) (<= 0 ~j2~0) (<= 0 ~i2~0)), Black: 125#(and (<= 0 ~i1~0) (<= 0 ~j1~0) (<= 0 ~j2~0) (<= 0 ~i2~0)), Black: 188#(and (<= 2 ~i1~0) (<= 0 ~j1~0) (<= 0 ~j2~0) (<= 1 ~i2~0)), Black: 74#(and (<= 0 ~j1~0) (= ~j2~0 0) (<= 1 ~i1~0) (<= 1 ~i2~0)), 218#true, Black: 207#(and (<= ~N1~0 0) (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 204#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 80#(and (<= 1 ~j1~0) (= ~i1~0 0) (= ~j2~0 0) (<= 1 ~i2~0)), 101#true, Black: 86#(and (<= 0 ~j1~0) (<= 1 ~j2~0) (= ~i2~0 0) (<= 1 ~i1~0)), Black: 215#(and (= ~i1~0 0) (<= (+ ~N1~0 ~j1~0) ~M1~0) (<= (+ ~j1~0 1) ~M1~0)), Black: 212#(and (= ~i1~0 0) (<= (+ ~N1~0 ~j1~0) ~M1~0)), 245#true, Black: 93#(and (<= 1 ~j1~0) (= ~j2~0 0) (<= 1 ~i1~0) (<= 1 ~i2~0)), 121#(and (<= 2 ~i1~0) (<= 0 ~j1~0) (<= 1 ~j2~0) (<= 1 ~i2~0)), Black: 220#(and (<= ~M1~0 (+ ~N1~0 ~j1~0)) (= ~i1~0 0)), Black: 224#(and (<= ~M1~0 (+ ~N1~0 ~j1~0)) (= ~i1~0 0) (<= ~M1~0 ~j1~0)), 9#L52true, 235#true, Black: 99#(and (<= 1 ~j1~0) (= ~i1~0 0) (<= 1 ~j2~0) (= ~i2~0 0)), 16#L41true, Black: 229#(and (= ~j2~0 0) (<= ~M1~0 (+ ~M2~0 ~j1~0))), Black: 232#(and (<= 1 ~M2~0) (= ~j2~0 0) (<= ~M1~0 (+ ~M2~0 ~j1~0))), Black: 104#(<= ~counter~0 1), Black: 103#(= ~counter~0 0), 40#L98-5true, Black: 241#(and (= ~i1~0 0) (<= 1 ~N2~0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 113#(and (<= 1 ~j1~0) (<= 1 ~j2~0) (= ~i2~0 0) (<= 1 ~i1~0)), 25#L79true, Black: 239#(and (<= 1 ~N2~0) (= ~i2~0 0)), Black: 237#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 59#(and (= ~i1~0 0) (<= 0 ~j1~0) (= ~j2~0 0) (= ~i2~0 0))]) [2024-06-27 18:04:10,628 INFO L294 olderBase$Statistics]: this new event has 29 ancestors and is cut-off event [2024-06-27 18:04:10,628 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2024-06-27 18:04:10,629 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2024-06-27 18:04:10,629 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2024-06-27 18:04:10,920 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([385] L67-->L64: Formula: (< v_~j1~0_4 v_~M1~0_2) InVars {~j1~0=v_~j1~0_4, ~M1~0=v_~M1~0_2} OutVars{~j1~0=v_~j1~0_4, ~M1~0=v_~M1~0_2} AuxVars[] AssignedVars[][41], [Black: 64#(and (<= 0 ~j1~0) (= ~j2~0 0) (= ~i2~0 0) (<= 1 ~i1~0)), 33#L64true, 247#(and (= ~j2~0 0) (<= ~M1~0 (+ ~M2~0 ~j1~0))), Black: 68#(= ~counter~0 0), Black: 171#(and (<= 0 ~j1~0) (<= 0 ~j2~0) (<= 0 ~i2~0) (<= 1 ~i1~0)), Black: 184#(and (<= 2 ~i1~0) (<= 0 ~j1~0) (<= 0 ~j2~0) (<= 0 ~i2~0)), Black: 125#(and (<= 0 ~i1~0) (<= 0 ~j1~0) (<= 0 ~j2~0) (<= 0 ~i2~0)), 218#true, Black: 207#(and (<= ~N1~0 0) (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 204#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 80#(and (<= 1 ~j1~0) (= ~i1~0 0) (= ~j2~0 0) (<= 1 ~i2~0)), 101#true, Black: 86#(and (<= 0 ~j1~0) (<= 1 ~j2~0) (= ~i2~0 0) (<= 1 ~i1~0)), Black: 215#(and (= ~i1~0 0) (<= (+ ~N1~0 ~j1~0) ~M1~0) (<= (+ ~j1~0 1) ~M1~0)), Black: 212#(and (= ~i1~0 0) (<= (+ ~N1~0 ~j1~0) ~M1~0)), Black: 93#(and (<= 1 ~j1~0) (= ~j2~0 0) (<= 1 ~i1~0) (<= 1 ~i2~0)), 188#(and (<= 2 ~i1~0) (<= 0 ~j1~0) (<= 0 ~j2~0) (<= 1 ~i2~0)), 232#(and (<= 1 ~M2~0) (= ~j2~0 0) (<= ~M1~0 (+ ~M2~0 ~j1~0))), Black: 220#(and (<= ~M1~0 (+ ~N1~0 ~j1~0)) (= ~i1~0 0)), Black: 224#(and (<= ~M1~0 (+ ~N1~0 ~j1~0)) (= ~i1~0 0) (<= ~M1~0 ~j1~0)), 235#true, Black: 99#(and (<= 1 ~j1~0) (= ~i1~0 0) (<= 1 ~j2~0) (= ~i2~0 0)), 14#L99true, 16#L41true, Black: 229#(and (= ~j2~0 0) (<= ~M1~0 (+ ~M2~0 ~j1~0))), Black: 104#(<= ~counter~0 1), Black: 103#(= ~counter~0 0), 17#L75true, Black: 113#(and (<= 1 ~j1~0) (<= 1 ~j2~0) (= ~i2~0 0) (<= 1 ~i1~0)), Black: 241#(and (= ~i1~0 0) (<= 1 ~N2~0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 239#(and (<= 1 ~N2~0) (= ~i2~0 0)), 74#(and (<= 0 ~j1~0) (= ~j2~0 0) (<= 1 ~i1~0) (<= 1 ~i2~0)), Black: 237#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), 13#thread2EXITtrue, Black: 59#(and (= ~i1~0 0) (<= 0 ~j1~0) (= ~j2~0 0) (= ~i2~0 0))]) [2024-06-27 18:04:10,920 INFO L294 olderBase$Statistics]: this new event has 31 ancestors and is cut-off event [2024-06-27 18:04:10,921 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2024-06-27 18:04:10,921 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2024-06-27 18:04:10,921 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2024-06-27 18:04:10,922 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([385] L67-->L64: Formula: (< v_~j1~0_4 v_~M1~0_2) InVars {~j1~0=v_~j1~0_4, ~M1~0=v_~M1~0_2} OutVars{~j1~0=v_~j1~0_4, ~M1~0=v_~M1~0_2} AuxVars[] AssignedVars[][107], [Black: 64#(and (<= 0 ~j1~0) (= ~j2~0 0) (= ~i2~0 0) (<= 1 ~i1~0)), 33#L64true, Black: 68#(= ~counter~0 0), Black: 171#(and (<= 0 ~j1~0) (<= 0 ~j2~0) (<= 0 ~i2~0) (<= 1 ~i1~0)), Black: 184#(and (<= 2 ~i1~0) (<= 0 ~j1~0) (<= 0 ~j2~0) (<= 0 ~i2~0)), Black: 125#(and (<= 0 ~i1~0) (<= 0 ~j1~0) (<= 0 ~j2~0) (<= 0 ~i2~0)), Black: 188#(and (<= 2 ~i1~0) (<= 0 ~j1~0) (<= 0 ~j2~0) (<= 1 ~i2~0)), Black: 74#(and (<= 0 ~j1~0) (= ~j2~0 0) (<= 1 ~i1~0) (<= 1 ~i2~0)), 218#true, Black: 207#(and (<= ~N1~0 0) (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 204#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 80#(and (<= 1 ~j1~0) (= ~i1~0 0) (= ~j2~0 0) (<= 1 ~i2~0)), 101#true, Black: 86#(and (<= 0 ~j1~0) (<= 1 ~j2~0) (= ~i2~0 0) (<= 1 ~i1~0)), Black: 215#(and (= ~i1~0 0) (<= (+ ~N1~0 ~j1~0) ~M1~0) (<= (+ ~j1~0 1) ~M1~0)), Black: 212#(and (= ~i1~0 0) (<= (+ ~N1~0 ~j1~0) ~M1~0)), 245#true, Black: 93#(and (<= 1 ~j1~0) (= ~j2~0 0) (<= 1 ~i1~0) (<= 1 ~i2~0)), 121#(and (<= 2 ~i1~0) (<= 0 ~j1~0) (<= 1 ~j2~0) (<= 1 ~i2~0)), Black: 220#(and (<= ~M1~0 (+ ~N1~0 ~j1~0)) (= ~i1~0 0)), Black: 224#(and (<= ~M1~0 (+ ~N1~0 ~j1~0)) (= ~i1~0 0) (<= ~M1~0 ~j1~0)), 235#true, Black: 99#(and (<= 1 ~j1~0) (= ~i1~0 0) (<= 1 ~j2~0) (= ~i2~0 0)), 16#L41true, Black: 229#(and (= ~j2~0 0) (<= ~M1~0 (+ ~M2~0 ~j1~0))), Black: 232#(and (<= 1 ~M2~0) (= ~j2~0 0) (<= ~M1~0 (+ ~M2~0 ~j1~0))), Black: 104#(<= ~counter~0 1), Black: 103#(= ~counter~0 0), 40#L98-5true, Black: 113#(and (<= 1 ~j1~0) (<= 1 ~j2~0) (= ~i2~0 0) (<= 1 ~i1~0)), Black: 241#(and (= ~i1~0 0) (<= 1 ~N2~0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), 25#L79true, Black: 239#(and (<= 1 ~N2~0) (= ~i2~0 0)), Black: 237#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), 13#thread2EXITtrue, Black: 59#(and (= ~i1~0 0) (<= 0 ~j1~0) (= ~j2~0 0) (= ~i2~0 0))]) [2024-06-27 18:04:10,922 INFO L294 olderBase$Statistics]: this new event has 31 ancestors and is cut-off event [2024-06-27 18:04:10,922 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2024-06-27 18:04:10,922 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2024-06-27 18:04:10,922 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2024-06-27 18:04:10,924 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([385] L67-->L64: Formula: (< v_~j1~0_4 v_~M1~0_2) InVars {~j1~0=v_~j1~0_4, ~M1~0=v_~M1~0_2} OutVars{~j1~0=v_~j1~0_4, ~M1~0=v_~M1~0_2} AuxVars[] AssignedVars[][107], [Black: 64#(and (<= 0 ~j1~0) (= ~j2~0 0) (= ~i2~0 0) (<= 1 ~i1~0)), 33#L64true, Black: 68#(= ~counter~0 0), Black: 171#(and (<= 0 ~j1~0) (<= 0 ~j2~0) (<= 0 ~i2~0) (<= 1 ~i1~0)), Black: 184#(and (<= 2 ~i1~0) (<= 0 ~j1~0) (<= 0 ~j2~0) (<= 0 ~i2~0)), Black: 125#(and (<= 0 ~i1~0) (<= 0 ~j1~0) (<= 0 ~j2~0) (<= 0 ~i2~0)), Black: 188#(and (<= 2 ~i1~0) (<= 0 ~j1~0) (<= 0 ~j2~0) (<= 1 ~i2~0)), Black: 74#(and (<= 0 ~j1~0) (= ~j2~0 0) (<= 1 ~i1~0) (<= 1 ~i2~0)), 218#true, Black: 207#(and (<= ~N1~0 0) (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 80#(and (<= 1 ~j1~0) (= ~i1~0 0) (= ~j2~0 0) (<= 1 ~i2~0)), Black: 204#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), 101#true, Black: 86#(and (<= 0 ~j1~0) (<= 1 ~j2~0) (= ~i2~0 0) (<= 1 ~i1~0)), Black: 215#(and (= ~i1~0 0) (<= (+ ~N1~0 ~j1~0) ~M1~0) (<= (+ ~j1~0 1) ~M1~0)), Black: 212#(and (= ~i1~0 0) (<= (+ ~N1~0 ~j1~0) ~M1~0)), 245#true, Black: 93#(and (<= 1 ~j1~0) (= ~j2~0 0) (<= 1 ~i1~0) (<= 1 ~i2~0)), 121#(and (<= 2 ~i1~0) (<= 0 ~j1~0) (<= 1 ~j2~0) (<= 1 ~i2~0)), Black: 220#(and (<= ~M1~0 (+ ~N1~0 ~j1~0)) (= ~i1~0 0)), 8#L56true, Black: 224#(and (<= ~M1~0 (+ ~N1~0 ~j1~0)) (= ~i1~0 0) (<= ~M1~0 ~j1~0)), 235#true, Black: 99#(and (<= 1 ~j1~0) (= ~i1~0 0) (<= 1 ~j2~0) (= ~i2~0 0)), 14#L99true, 16#L41true, Black: 229#(and (= ~j2~0 0) (<= ~M1~0 (+ ~M2~0 ~j1~0))), Black: 104#(<= ~counter~0 1), Black: 232#(and (<= 1 ~M2~0) (= ~j2~0 0) (<= ~M1~0 (+ ~M2~0 ~j1~0))), Black: 103#(= ~counter~0 0), Black: 113#(and (<= 1 ~j1~0) (<= 1 ~j2~0) (= ~i2~0 0) (<= 1 ~i1~0)), 25#L79true, Black: 241#(and (= ~i1~0 0) (<= 1 ~N2~0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 239#(and (<= 1 ~N2~0) (= ~i2~0 0)), Black: 237#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 59#(and (= ~i1~0 0) (<= 0 ~j1~0) (= ~j2~0 0) (= ~i2~0 0))]) [2024-06-27 18:04:10,924 INFO L294 olderBase$Statistics]: this new event has 31 ancestors and is cut-off event [2024-06-27 18:04:10,924 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2024-06-27 18:04:10,924 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2024-06-27 18:04:10,924 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2024-06-27 18:04:10,925 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([385] L67-->L64: Formula: (< v_~j1~0_4 v_~M1~0_2) InVars {~j1~0=v_~j1~0_4, ~M1~0=v_~M1~0_2} OutVars{~j1~0=v_~j1~0_4, ~M1~0=v_~M1~0_2} AuxVars[] AssignedVars[][107], [Black: 64#(and (<= 0 ~j1~0) (= ~j2~0 0) (= ~i2~0 0) (<= 1 ~i1~0)), 33#L64true, Black: 68#(= ~counter~0 0), Black: 171#(and (<= 0 ~j1~0) (<= 0 ~j2~0) (<= 0 ~i2~0) (<= 1 ~i1~0)), Black: 184#(and (<= 2 ~i1~0) (<= 0 ~j1~0) (<= 0 ~j2~0) (<= 0 ~i2~0)), Black: 125#(and (<= 0 ~i1~0) (<= 0 ~j1~0) (<= 0 ~j2~0) (<= 0 ~i2~0)), Black: 74#(and (<= 0 ~j1~0) (= ~j2~0 0) (<= 1 ~i1~0) (<= 1 ~i2~0)), 218#true, Black: 207#(and (<= ~N1~0 0) (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 80#(and (<= 1 ~j1~0) (= ~i1~0 0) (= ~j2~0 0) (<= 1 ~i2~0)), Black: 204#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), 101#true, Black: 86#(and (<= 0 ~j1~0) (<= 1 ~j2~0) (= ~i2~0 0) (<= 1 ~i1~0)), Black: 215#(and (= ~i1~0 0) (<= (+ ~N1~0 ~j1~0) ~M1~0) (<= (+ ~j1~0 1) ~M1~0)), Black: 212#(and (= ~i1~0 0) (<= (+ ~N1~0 ~j1~0) ~M1~0)), 245#true, Black: 93#(and (<= 1 ~j1~0) (= ~j2~0 0) (<= 1 ~i1~0) (<= 1 ~i2~0)), 188#(and (<= 2 ~i1~0) (<= 0 ~j1~0) (<= 0 ~j2~0) (<= 1 ~i2~0)), Black: 220#(and (<= ~M1~0 (+ ~N1~0 ~j1~0)) (= ~i1~0 0)), Black: 224#(and (<= ~M1~0 (+ ~N1~0 ~j1~0)) (= ~i1~0 0) (<= ~M1~0 ~j1~0)), 8#L56true, 235#true, Black: 99#(and (<= 1 ~j1~0) (= ~i1~0 0) (<= 1 ~j2~0) (= ~i2~0 0)), 14#L99true, 16#L41true, Black: 229#(and (= ~j2~0 0) (<= ~M1~0 (+ ~M2~0 ~j1~0))), Black: 104#(<= ~counter~0 1), Black: 232#(and (<= 1 ~M2~0) (= ~j2~0 0) (<= ~M1~0 (+ ~M2~0 ~j1~0))), Black: 103#(= ~counter~0 0), Black: 113#(and (<= 1 ~j1~0) (<= 1 ~j2~0) (= ~i2~0 0) (<= 1 ~i1~0)), 25#L79true, Black: 241#(and (= ~i1~0 0) (<= 1 ~N2~0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 239#(and (<= 1 ~N2~0) (= ~i2~0 0)), Black: 237#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 59#(and (= ~i1~0 0) (<= 0 ~j1~0) (= ~j2~0 0) (= ~i2~0 0))]) [2024-06-27 18:04:10,925 INFO L294 olderBase$Statistics]: this new event has 31 ancestors and is cut-off event [2024-06-27 18:04:10,925 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2024-06-27 18:04:10,925 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2024-06-27 18:04:10,925 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2024-06-27 18:04:10,927 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([385] L67-->L64: Formula: (< v_~j1~0_4 v_~M1~0_2) InVars {~j1~0=v_~j1~0_4, ~M1~0=v_~M1~0_2} OutVars{~j1~0=v_~j1~0_4, ~M1~0=v_~M1~0_2} AuxVars[] AssignedVars[][107], [Black: 64#(and (<= 0 ~j1~0) (= ~j2~0 0) (= ~i2~0 0) (<= 1 ~i1~0)), 33#L64true, Black: 68#(= ~counter~0 0), Black: 171#(and (<= 0 ~j1~0) (<= 0 ~j2~0) (<= 0 ~i2~0) (<= 1 ~i1~0)), Black: 184#(and (<= 2 ~i1~0) (<= 0 ~j1~0) (<= 0 ~j2~0) (<= 0 ~i2~0)), Black: 125#(and (<= 0 ~i1~0) (<= 0 ~j1~0) (<= 0 ~j2~0) (<= 0 ~i2~0)), Black: 188#(and (<= 2 ~i1~0) (<= 0 ~j1~0) (<= 0 ~j2~0) (<= 1 ~i2~0)), Black: 74#(and (<= 0 ~j1~0) (= ~j2~0 0) (<= 1 ~i1~0) (<= 1 ~i2~0)), 218#true, Black: 207#(and (<= ~N1~0 0) (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 80#(and (<= 1 ~j1~0) (= ~i1~0 0) (= ~j2~0 0) (<= 1 ~i2~0)), Black: 204#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), 101#true, Black: 86#(and (<= 0 ~j1~0) (<= 1 ~j2~0) (= ~i2~0 0) (<= 1 ~i1~0)), Black: 215#(and (= ~i1~0 0) (<= (+ ~N1~0 ~j1~0) ~M1~0) (<= (+ ~j1~0 1) ~M1~0)), Black: 212#(and (= ~i1~0 0) (<= (+ ~N1~0 ~j1~0) ~M1~0)), 245#true, Black: 93#(and (<= 1 ~j1~0) (= ~j2~0 0) (<= 1 ~i1~0) (<= 1 ~i2~0)), 121#(and (<= 2 ~i1~0) (<= 0 ~j1~0) (<= 1 ~j2~0) (<= 1 ~i2~0)), Black: 220#(and (<= ~M1~0 (+ ~N1~0 ~j1~0)) (= ~i1~0 0)), Black: 224#(and (<= ~M1~0 (+ ~N1~0 ~j1~0)) (= ~i1~0 0) (<= ~M1~0 ~j1~0)), 8#L56true, 235#true, Black: 99#(and (<= 1 ~j1~0) (= ~i1~0 0) (<= 1 ~j2~0) (= ~i2~0 0)), 16#L41true, Black: 229#(and (= ~j2~0 0) (<= ~M1~0 (+ ~M2~0 ~j1~0))), Black: 104#(<= ~counter~0 1), Black: 232#(and (<= 1 ~M2~0) (= ~j2~0 0) (<= ~M1~0 (+ ~M2~0 ~j1~0))), Black: 103#(= ~counter~0 0), 40#L98-5true, 4#thread4EXITtrue, Black: 113#(and (<= 1 ~j1~0) (<= 1 ~j2~0) (= ~i2~0 0) (<= 1 ~i1~0)), Black: 241#(and (= ~i1~0 0) (<= 1 ~N2~0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 239#(and (<= 1 ~N2~0) (= ~i2~0 0)), Black: 237#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 59#(and (= ~i1~0 0) (<= 0 ~j1~0) (= ~j2~0 0) (= ~i2~0 0))]) [2024-06-27 18:04:10,927 INFO L294 olderBase$Statistics]: this new event has 31 ancestors and is cut-off event [2024-06-27 18:04:10,927 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2024-06-27 18:04:10,927 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2024-06-27 18:04:10,927 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2024-06-27 18:04:10,928 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([385] L67-->L64: Formula: (< v_~j1~0_4 v_~M1~0_2) InVars {~j1~0=v_~j1~0_4, ~M1~0=v_~M1~0_2} OutVars{~j1~0=v_~j1~0_4, ~M1~0=v_~M1~0_2} AuxVars[] AssignedVars[][107], [Black: 64#(and (<= 0 ~j1~0) (= ~j2~0 0) (= ~i2~0 0) (<= 1 ~i1~0)), 33#L64true, Black: 68#(= ~counter~0 0), Black: 171#(and (<= 0 ~j1~0) (<= 0 ~j2~0) (<= 0 ~i2~0) (<= 1 ~i1~0)), Black: 184#(and (<= 2 ~i1~0) (<= 0 ~j1~0) (<= 0 ~j2~0) (<= 0 ~i2~0)), Black: 125#(and (<= 0 ~i1~0) (<= 0 ~j1~0) (<= 0 ~j2~0) (<= 0 ~i2~0)), Black: 188#(and (<= 2 ~i1~0) (<= 0 ~j1~0) (<= 0 ~j2~0) (<= 1 ~i2~0)), Black: 74#(and (<= 0 ~j1~0) (= ~j2~0 0) (<= 1 ~i1~0) (<= 1 ~i2~0)), 218#true, Black: 207#(and (<= ~N1~0 0) (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 80#(and (<= 1 ~j1~0) (= ~i1~0 0) (= ~j2~0 0) (<= 1 ~i2~0)), Black: 204#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), 101#true, Black: 86#(and (<= 0 ~j1~0) (<= 1 ~j2~0) (= ~i2~0 0) (<= 1 ~i1~0)), Black: 215#(and (= ~i1~0 0) (<= (+ ~N1~0 ~j1~0) ~M1~0) (<= (+ ~j1~0 1) ~M1~0)), Black: 212#(and (= ~i1~0 0) (<= (+ ~N1~0 ~j1~0) ~M1~0)), 245#true, Black: 93#(and (<= 1 ~j1~0) (= ~j2~0 0) (<= 1 ~i1~0) (<= 1 ~i2~0)), 121#(and (<= 2 ~i1~0) (<= 0 ~j1~0) (<= 1 ~j2~0) (<= 1 ~i2~0)), Black: 220#(and (<= ~M1~0 (+ ~N1~0 ~j1~0)) (= ~i1~0 0)), 8#L56true, Black: 224#(and (<= ~M1~0 (+ ~N1~0 ~j1~0)) (= ~i1~0 0) (<= ~M1~0 ~j1~0)), 235#true, Black: 99#(and (<= 1 ~j1~0) (= ~i1~0 0) (<= 1 ~j2~0) (= ~i2~0 0)), 16#L41true, Black: 229#(and (= ~j2~0 0) (<= ~M1~0 (+ ~M2~0 ~j1~0))), Black: 104#(<= ~counter~0 1), Black: 232#(and (<= 1 ~M2~0) (= ~j2~0 0) (<= ~M1~0 (+ ~M2~0 ~j1~0))), Black: 103#(= ~counter~0 0), 40#L98-5true, 17#L75true, Black: 113#(and (<= 1 ~j1~0) (<= 1 ~j2~0) (= ~i2~0 0) (<= 1 ~i1~0)), Black: 241#(and (= ~i1~0 0) (<= 1 ~N2~0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 239#(and (<= 1 ~N2~0) (= ~i2~0 0)), Black: 237#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 59#(and (= ~i1~0 0) (<= 0 ~j1~0) (= ~j2~0 0) (= ~i2~0 0))]) [2024-06-27 18:04:10,928 INFO L294 olderBase$Statistics]: this new event has 31 ancestors and is cut-off event [2024-06-27 18:04:10,928 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2024-06-27 18:04:10,928 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2024-06-27 18:04:10,928 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2024-06-27 18:04:10,928 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([385] L67-->L64: Formula: (< v_~j1~0_4 v_~M1~0_2) InVars {~j1~0=v_~j1~0_4, ~M1~0=v_~M1~0_2} OutVars{~j1~0=v_~j1~0_4, ~M1~0=v_~M1~0_2} AuxVars[] AssignedVars[][107], [Black: 64#(and (<= 0 ~j1~0) (= ~j2~0 0) (= ~i2~0 0) (<= 1 ~i1~0)), 33#L64true, Black: 68#(= ~counter~0 0), Black: 171#(and (<= 0 ~j1~0) (<= 0 ~j2~0) (<= 0 ~i2~0) (<= 1 ~i1~0)), Black: 184#(and (<= 2 ~i1~0) (<= 0 ~j1~0) (<= 0 ~j2~0) (<= 0 ~i2~0)), Black: 125#(and (<= 0 ~i1~0) (<= 0 ~j1~0) (<= 0 ~j2~0) (<= 0 ~i2~0)), Black: 74#(and (<= 0 ~j1~0) (= ~j2~0 0) (<= 1 ~i1~0) (<= 1 ~i2~0)), 218#true, Black: 207#(and (<= ~N1~0 0) (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 80#(and (<= 1 ~j1~0) (= ~i1~0 0) (= ~j2~0 0) (<= 1 ~i2~0)), Black: 204#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), 101#true, Black: 86#(and (<= 0 ~j1~0) (<= 1 ~j2~0) (= ~i2~0 0) (<= 1 ~i1~0)), Black: 215#(and (= ~i1~0 0) (<= (+ ~N1~0 ~j1~0) ~M1~0) (<= (+ ~j1~0 1) ~M1~0)), Black: 212#(and (= ~i1~0 0) (<= (+ ~N1~0 ~j1~0) ~M1~0)), 245#true, Black: 93#(and (<= 1 ~j1~0) (= ~j2~0 0) (<= 1 ~i1~0) (<= 1 ~i2~0)), 188#(and (<= 2 ~i1~0) (<= 0 ~j1~0) (<= 0 ~j2~0) (<= 1 ~i2~0)), Black: 220#(and (<= ~M1~0 (+ ~N1~0 ~j1~0)) (= ~i1~0 0)), 8#L56true, Black: 224#(and (<= ~M1~0 (+ ~N1~0 ~j1~0)) (= ~i1~0 0) (<= ~M1~0 ~j1~0)), 235#true, Black: 99#(and (<= 1 ~j1~0) (= ~i1~0 0) (<= 1 ~j2~0) (= ~i2~0 0)), 16#L41true, Black: 229#(and (= ~j2~0 0) (<= ~M1~0 (+ ~M2~0 ~j1~0))), Black: 232#(and (<= 1 ~M2~0) (= ~j2~0 0) (<= ~M1~0 (+ ~M2~0 ~j1~0))), Black: 104#(<= ~counter~0 1), Black: 103#(= ~counter~0 0), 40#L98-5true, 4#thread4EXITtrue, Black: 113#(and (<= 1 ~j1~0) (<= 1 ~j2~0) (= ~i2~0 0) (<= 1 ~i1~0)), Black: 241#(and (= ~i1~0 0) (<= 1 ~N2~0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 239#(and (<= 1 ~N2~0) (= ~i2~0 0)), Black: 237#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 59#(and (= ~i1~0 0) (<= 0 ~j1~0) (= ~j2~0 0) (= ~i2~0 0))]) [2024-06-27 18:04:10,929 INFO L294 olderBase$Statistics]: this new event has 31 ancestors and is cut-off event [2024-06-27 18:04:10,929 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2024-06-27 18:04:10,929 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2024-06-27 18:04:10,929 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2024-06-27 18:04:10,929 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([385] L67-->L64: Formula: (< v_~j1~0_4 v_~M1~0_2) InVars {~j1~0=v_~j1~0_4, ~M1~0=v_~M1~0_2} OutVars{~j1~0=v_~j1~0_4, ~M1~0=v_~M1~0_2} AuxVars[] AssignedVars[][107], [Black: 64#(and (<= 0 ~j1~0) (= ~j2~0 0) (= ~i2~0 0) (<= 1 ~i1~0)), 33#L64true, Black: 68#(= ~counter~0 0), Black: 171#(and (<= 0 ~j1~0) (<= 0 ~j2~0) (<= 0 ~i2~0) (<= 1 ~i1~0)), Black: 184#(and (<= 2 ~i1~0) (<= 0 ~j1~0) (<= 0 ~j2~0) (<= 0 ~i2~0)), Black: 125#(and (<= 0 ~i1~0) (<= 0 ~j1~0) (<= 0 ~j2~0) (<= 0 ~i2~0)), Black: 74#(and (<= 0 ~j1~0) (= ~j2~0 0) (<= 1 ~i1~0) (<= 1 ~i2~0)), 218#true, Black: 207#(and (<= ~N1~0 0) (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 80#(and (<= 1 ~j1~0) (= ~i1~0 0) (= ~j2~0 0) (<= 1 ~i2~0)), Black: 204#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), 101#true, Black: 86#(and (<= 0 ~j1~0) (<= 1 ~j2~0) (= ~i2~0 0) (<= 1 ~i1~0)), Black: 215#(and (= ~i1~0 0) (<= (+ ~N1~0 ~j1~0) ~M1~0) (<= (+ ~j1~0 1) ~M1~0)), Black: 212#(and (= ~i1~0 0) (<= (+ ~N1~0 ~j1~0) ~M1~0)), 245#true, Black: 93#(and (<= 1 ~j1~0) (= ~j2~0 0) (<= 1 ~i1~0) (<= 1 ~i2~0)), 188#(and (<= 2 ~i1~0) (<= 0 ~j1~0) (<= 0 ~j2~0) (<= 1 ~i2~0)), Black: 220#(and (<= ~M1~0 (+ ~N1~0 ~j1~0)) (= ~i1~0 0)), Black: 224#(and (<= ~M1~0 (+ ~N1~0 ~j1~0)) (= ~i1~0 0) (<= ~M1~0 ~j1~0)), 8#L56true, 235#true, Black: 99#(and (<= 1 ~j1~0) (= ~i1~0 0) (<= 1 ~j2~0) (= ~i2~0 0)), 16#L41true, Black: 229#(and (= ~j2~0 0) (<= ~M1~0 (+ ~M2~0 ~j1~0))), Black: 104#(<= ~counter~0 1), Black: 232#(and (<= 1 ~M2~0) (= ~j2~0 0) (<= ~M1~0 (+ ~M2~0 ~j1~0))), Black: 103#(= ~counter~0 0), 40#L98-5true, 17#L75true, Black: 113#(and (<= 1 ~j1~0) (<= 1 ~j2~0) (= ~i2~0 0) (<= 1 ~i1~0)), Black: 241#(and (= ~i1~0 0) (<= 1 ~N2~0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 239#(and (<= 1 ~N2~0) (= ~i2~0 0)), Black: 237#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 59#(and (= ~i1~0 0) (<= 0 ~j1~0) (= ~j2~0 0) (= ~i2~0 0))]) [2024-06-27 18:04:10,929 INFO L294 olderBase$Statistics]: this new event has 31 ancestors and is cut-off event [2024-06-27 18:04:10,929 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2024-06-27 18:04:10,929 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2024-06-27 18:04:10,929 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2024-06-27 18:04:10,930 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([385] L67-->L64: Formula: (< v_~j1~0_4 v_~M1~0_2) InVars {~j1~0=v_~j1~0_4, ~M1~0=v_~M1~0_2} OutVars{~j1~0=v_~j1~0_4, ~M1~0=v_~M1~0_2} AuxVars[] AssignedVars[][107], [Black: 64#(and (<= 0 ~j1~0) (= ~j2~0 0) (= ~i2~0 0) (<= 1 ~i1~0)), 33#L64true, Black: 68#(= ~counter~0 0), Black: 171#(and (<= 0 ~j1~0) (<= 0 ~j2~0) (<= 0 ~i2~0) (<= 1 ~i1~0)), Black: 184#(and (<= 2 ~i1~0) (<= 0 ~j1~0) (<= 0 ~j2~0) (<= 0 ~i2~0)), Black: 125#(and (<= 0 ~i1~0) (<= 0 ~j1~0) (<= 0 ~j2~0) (<= 0 ~i2~0)), Black: 74#(and (<= 0 ~j1~0) (= ~j2~0 0) (<= 1 ~i1~0) (<= 1 ~i2~0)), 218#true, Black: 207#(and (<= ~N1~0 0) (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 80#(and (<= 1 ~j1~0) (= ~i1~0 0) (= ~j2~0 0) (<= 1 ~i2~0)), Black: 204#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), 101#true, Black: 86#(and (<= 0 ~j1~0) (<= 1 ~j2~0) (= ~i2~0 0) (<= 1 ~i1~0)), Black: 215#(and (= ~i1~0 0) (<= (+ ~N1~0 ~j1~0) ~M1~0) (<= (+ ~j1~0 1) ~M1~0)), Black: 212#(and (= ~i1~0 0) (<= (+ ~N1~0 ~j1~0) ~M1~0)), 245#true, Black: 93#(and (<= 1 ~j1~0) (= ~j2~0 0) (<= 1 ~i1~0) (<= 1 ~i2~0)), 188#(and (<= 2 ~i1~0) (<= 0 ~j1~0) (<= 0 ~j2~0) (<= 1 ~i2~0)), Black: 220#(and (<= ~M1~0 (+ ~N1~0 ~j1~0)) (= ~i1~0 0)), Black: 224#(and (<= ~M1~0 (+ ~N1~0 ~j1~0)) (= ~i1~0 0) (<= ~M1~0 ~j1~0)), 235#true, Black: 99#(and (<= 1 ~j1~0) (= ~i1~0 0) (<= 1 ~j2~0) (= ~i2~0 0)), 16#L41true, Black: 229#(and (= ~j2~0 0) (<= ~M1~0 (+ ~M2~0 ~j1~0))), Black: 104#(<= ~counter~0 1), Black: 232#(and (<= 1 ~M2~0) (= ~j2~0 0) (<= ~M1~0 (+ ~M2~0 ~j1~0))), Black: 103#(= ~counter~0 0), 40#L98-5true, Black: 113#(and (<= 1 ~j1~0) (<= 1 ~j2~0) (= ~i2~0 0) (<= 1 ~i1~0)), Black: 241#(and (= ~i1~0 0) (<= 1 ~N2~0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), 25#L79true, Black: 239#(and (<= 1 ~N2~0) (= ~i2~0 0)), Black: 237#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), 13#thread2EXITtrue, Black: 59#(and (= ~i1~0 0) (<= 0 ~j1~0) (= ~j2~0 0) (= ~i2~0 0))]) [2024-06-27 18:04:10,930 INFO L294 olderBase$Statistics]: this new event has 31 ancestors and is cut-off event [2024-06-27 18:04:10,930 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2024-06-27 18:04:10,930 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2024-06-27 18:04:10,930 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2024-06-27 18:04:10,941 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([385] L67-->L64: Formula: (< v_~j1~0_4 v_~M1~0_2) InVars {~j1~0=v_~j1~0_4, ~M1~0=v_~M1~0_2} OutVars{~j1~0=v_~j1~0_4, ~M1~0=v_~M1~0_2} AuxVars[] AssignedVars[][107], [Black: 64#(and (<= 0 ~j1~0) (= ~j2~0 0) (= ~i2~0 0) (<= 1 ~i1~0)), 33#L64true, Black: 68#(= ~counter~0 0), Black: 171#(and (<= 0 ~j1~0) (<= 0 ~j2~0) (<= 0 ~i2~0) (<= 1 ~i1~0)), Black: 184#(and (<= 2 ~i1~0) (<= 0 ~j1~0) (<= 0 ~j2~0) (<= 0 ~i2~0)), Black: 125#(and (<= 0 ~i1~0) (<= 0 ~j1~0) (<= 0 ~j2~0) (<= 0 ~i2~0)), Black: 188#(and (<= 2 ~i1~0) (<= 0 ~j1~0) (<= 0 ~j2~0) (<= 1 ~i2~0)), Black: 74#(and (<= 0 ~j1~0) (= ~j2~0 0) (<= 1 ~i1~0) (<= 1 ~i2~0)), 218#true, Black: 207#(and (<= ~N1~0 0) (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 80#(and (<= 1 ~j1~0) (= ~i1~0 0) (= ~j2~0 0) (<= 1 ~i2~0)), Black: 204#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), 101#true, Black: 86#(and (<= 0 ~j1~0) (<= 1 ~j2~0) (= ~i2~0 0) (<= 1 ~i1~0)), Black: 215#(and (= ~i1~0 0) (<= (+ ~N1~0 ~j1~0) ~M1~0) (<= (+ ~j1~0 1) ~M1~0)), Black: 212#(and (= ~i1~0 0) (<= (+ ~N1~0 ~j1~0) ~M1~0)), 245#true, Black: 93#(and (<= 1 ~j1~0) (= ~j2~0 0) (<= 1 ~i1~0) (<= 1 ~i2~0)), 121#(and (<= 2 ~i1~0) (<= 0 ~j1~0) (<= 1 ~j2~0) (<= 1 ~i2~0)), Black: 220#(and (<= ~M1~0 (+ ~N1~0 ~j1~0)) (= ~i1~0 0)), Black: 224#(and (<= ~M1~0 (+ ~N1~0 ~j1~0)) (= ~i1~0 0) (<= ~M1~0 ~j1~0)), 9#L52true, 235#true, Black: 99#(and (<= 1 ~j1~0) (= ~i1~0 0) (<= 1 ~j2~0) (= ~i2~0 0)), 16#L41true, Black: 229#(and (= ~j2~0 0) (<= ~M1~0 (+ ~M2~0 ~j1~0))), Black: 232#(and (<= 1 ~M2~0) (= ~j2~0 0) (<= ~M1~0 (+ ~M2~0 ~j1~0))), Black: 104#(<= ~counter~0 1), Black: 103#(= ~counter~0 0), 40#L98-5true, Black: 113#(and (<= 1 ~j1~0) (<= 1 ~j2~0) (= ~i2~0 0) (<= 1 ~i1~0)), Black: 241#(and (= ~i1~0 0) (<= 1 ~N2~0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), 25#L79true, Black: 239#(and (<= 1 ~N2~0) (= ~i2~0 0)), Black: 237#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 59#(and (= ~i1~0 0) (<= 0 ~j1~0) (= ~j2~0 0) (= ~i2~0 0))]) [2024-06-27 18:04:10,942 INFO L294 olderBase$Statistics]: this new event has 31 ancestors and is cut-off event [2024-06-27 18:04:10,942 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2024-06-27 18:04:10,942 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2024-06-27 18:04:10,942 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2024-06-27 18:04:10,942 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2024-06-27 18:04:10,946 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([385] L67-->L64: Formula: (< v_~j1~0_4 v_~M1~0_2) InVars {~j1~0=v_~j1~0_4, ~M1~0=v_~M1~0_2} OutVars{~j1~0=v_~j1~0_4, ~M1~0=v_~M1~0_2} AuxVars[] AssignedVars[][107], [Black: 64#(and (<= 0 ~j1~0) (= ~j2~0 0) (= ~i2~0 0) (<= 1 ~i1~0)), 33#L64true, Black: 68#(= ~counter~0 0), Black: 171#(and (<= 0 ~j1~0) (<= 0 ~j2~0) (<= 0 ~i2~0) (<= 1 ~i1~0)), Black: 184#(and (<= 2 ~i1~0) (<= 0 ~j1~0) (<= 0 ~j2~0) (<= 0 ~i2~0)), Black: 125#(and (<= 0 ~i1~0) (<= 0 ~j1~0) (<= 0 ~j2~0) (<= 0 ~i2~0)), Black: 188#(and (<= 2 ~i1~0) (<= 0 ~j1~0) (<= 0 ~j2~0) (<= 1 ~i2~0)), Black: 74#(and (<= 0 ~j1~0) (= ~j2~0 0) (<= 1 ~i1~0) (<= 1 ~i2~0)), 218#true, Black: 207#(and (<= ~N1~0 0) (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 204#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 80#(and (<= 1 ~j1~0) (= ~i1~0 0) (= ~j2~0 0) (<= 1 ~i2~0)), 101#true, Black: 86#(and (<= 0 ~j1~0) (<= 1 ~j2~0) (= ~i2~0 0) (<= 1 ~i1~0)), Black: 215#(and (= ~i1~0 0) (<= (+ ~N1~0 ~j1~0) ~M1~0) (<= (+ ~j1~0 1) ~M1~0)), Black: 212#(and (= ~i1~0 0) (<= (+ ~N1~0 ~j1~0) ~M1~0)), 245#true, Black: 93#(and (<= 1 ~j1~0) (= ~j2~0 0) (<= 1 ~i1~0) (<= 1 ~i2~0)), 121#(and (<= 2 ~i1~0) (<= 0 ~j1~0) (<= 1 ~j2~0) (<= 1 ~i2~0)), Black: 220#(and (<= ~M1~0 (+ ~N1~0 ~j1~0)) (= ~i1~0 0)), 9#L52true, Black: 224#(and (<= ~M1~0 (+ ~N1~0 ~j1~0)) (= ~i1~0 0) (<= ~M1~0 ~j1~0)), 235#true, Black: 99#(and (<= 1 ~j1~0) (= ~i1~0 0) (<= 1 ~j2~0) (= ~i2~0 0)), 14#L99true, 16#L41true, Black: 229#(and (= ~j2~0 0) (<= ~M1~0 (+ ~M2~0 ~j1~0))), Black: 232#(and (<= 1 ~M2~0) (= ~j2~0 0) (<= ~M1~0 (+ ~M2~0 ~j1~0))), Black: 104#(<= ~counter~0 1), Black: 103#(= ~counter~0 0), Black: 241#(and (= ~i1~0 0) (<= 1 ~N2~0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 113#(and (<= 1 ~j1~0) (<= 1 ~j2~0) (= ~i2~0 0) (<= 1 ~i1~0)), 25#L79true, Black: 239#(and (<= 1 ~N2~0) (= ~i2~0 0)), Black: 237#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 59#(and (= ~i1~0 0) (<= 0 ~j1~0) (= ~j2~0 0) (= ~i2~0 0))]) [2024-06-27 18:04:10,946 INFO L294 olderBase$Statistics]: this new event has 30 ancestors and is cut-off event [2024-06-27 18:04:10,946 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2024-06-27 18:04:10,946 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2024-06-27 18:04:10,946 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2024-06-27 18:04:10,949 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([385] L67-->L64: Formula: (< v_~j1~0_4 v_~M1~0_2) InVars {~j1~0=v_~j1~0_4, ~M1~0=v_~M1~0_2} OutVars{~j1~0=v_~j1~0_4, ~M1~0=v_~M1~0_2} AuxVars[] AssignedVars[][107], [Black: 64#(and (<= 0 ~j1~0) (= ~j2~0 0) (= ~i2~0 0) (<= 1 ~i1~0)), 33#L64true, Black: 68#(= ~counter~0 0), Black: 171#(and (<= 0 ~j1~0) (<= 0 ~j2~0) (<= 0 ~i2~0) (<= 1 ~i1~0)), Black: 184#(and (<= 2 ~i1~0) (<= 0 ~j1~0) (<= 0 ~j2~0) (<= 0 ~i2~0)), Black: 125#(and (<= 0 ~i1~0) (<= 0 ~j1~0) (<= 0 ~j2~0) (<= 0 ~i2~0)), Black: 188#(and (<= 2 ~i1~0) (<= 0 ~j1~0) (<= 0 ~j2~0) (<= 1 ~i2~0)), Black: 74#(and (<= 0 ~j1~0) (= ~j2~0 0) (<= 1 ~i1~0) (<= 1 ~i2~0)), 218#true, Black: 207#(and (<= ~N1~0 0) (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 204#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 80#(and (<= 1 ~j1~0) (= ~i1~0 0) (= ~j2~0 0) (<= 1 ~i2~0)), 101#true, Black: 86#(and (<= 0 ~j1~0) (<= 1 ~j2~0) (= ~i2~0 0) (<= 1 ~i1~0)), Black: 215#(and (= ~i1~0 0) (<= (+ ~N1~0 ~j1~0) ~M1~0) (<= (+ ~j1~0 1) ~M1~0)), Black: 212#(and (= ~i1~0 0) (<= (+ ~N1~0 ~j1~0) ~M1~0)), 245#true, Black: 93#(and (<= 1 ~j1~0) (= ~j2~0 0) (<= 1 ~i1~0) (<= 1 ~i2~0)), 121#(and (<= 2 ~i1~0) (<= 0 ~j1~0) (<= 1 ~j2~0) (<= 1 ~i2~0)), Black: 220#(and (<= ~M1~0 (+ ~N1~0 ~j1~0)) (= ~i1~0 0)), 9#L52true, Black: 224#(and (<= ~M1~0 (+ ~N1~0 ~j1~0)) (= ~i1~0 0) (<= ~M1~0 ~j1~0)), 235#true, Black: 99#(and (<= 1 ~j1~0) (= ~i1~0 0) (<= 1 ~j2~0) (= ~i2~0 0)), 16#L41true, Black: 229#(and (= ~j2~0 0) (<= ~M1~0 (+ ~M2~0 ~j1~0))), Black: 104#(<= ~counter~0 1), Black: 232#(and (<= 1 ~M2~0) (= ~j2~0 0) (<= ~M1~0 (+ ~M2~0 ~j1~0))), Black: 103#(= ~counter~0 0), 40#L98-5true, Black: 241#(and (= ~i1~0 0) (<= 1 ~N2~0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 113#(and (<= 1 ~j1~0) (<= 1 ~j2~0) (= ~i2~0 0) (<= 1 ~i1~0)), 4#thread4EXITtrue, Black: 239#(and (<= 1 ~N2~0) (= ~i2~0 0)), Black: 237#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 59#(and (= ~i1~0 0) (<= 0 ~j1~0) (= ~j2~0 0) (= ~i2~0 0))]) [2024-06-27 18:04:10,949 INFO L294 olderBase$Statistics]: this new event has 30 ancestors and is cut-off event [2024-06-27 18:04:10,949 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2024-06-27 18:04:10,949 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2024-06-27 18:04:10,949 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2024-06-27 18:04:10,949 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([385] L67-->L64: Formula: (< v_~j1~0_4 v_~M1~0_2) InVars {~j1~0=v_~j1~0_4, ~M1~0=v_~M1~0_2} OutVars{~j1~0=v_~j1~0_4, ~M1~0=v_~M1~0_2} AuxVars[] AssignedVars[][107], [Black: 64#(and (<= 0 ~j1~0) (= ~j2~0 0) (= ~i2~0 0) (<= 1 ~i1~0)), 33#L64true, Black: 68#(= ~counter~0 0), Black: 171#(and (<= 0 ~j1~0) (<= 0 ~j2~0) (<= 0 ~i2~0) (<= 1 ~i1~0)), Black: 184#(and (<= 2 ~i1~0) (<= 0 ~j1~0) (<= 0 ~j2~0) (<= 0 ~i2~0)), Black: 125#(and (<= 0 ~i1~0) (<= 0 ~j1~0) (<= 0 ~j2~0) (<= 0 ~i2~0)), Black: 188#(and (<= 2 ~i1~0) (<= 0 ~j1~0) (<= 0 ~j2~0) (<= 1 ~i2~0)), Black: 74#(and (<= 0 ~j1~0) (= ~j2~0 0) (<= 1 ~i1~0) (<= 1 ~i2~0)), 218#true, Black: 207#(and (<= ~N1~0 0) (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 204#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 80#(and (<= 1 ~j1~0) (= ~i1~0 0) (= ~j2~0 0) (<= 1 ~i2~0)), 101#true, Black: 86#(and (<= 0 ~j1~0) (<= 1 ~j2~0) (= ~i2~0 0) (<= 1 ~i1~0)), Black: 215#(and (= ~i1~0 0) (<= (+ ~N1~0 ~j1~0) ~M1~0) (<= (+ ~j1~0 1) ~M1~0)), Black: 212#(and (= ~i1~0 0) (<= (+ ~N1~0 ~j1~0) ~M1~0)), 245#true, Black: 93#(and (<= 1 ~j1~0) (= ~j2~0 0) (<= 1 ~i1~0) (<= 1 ~i2~0)), 121#(and (<= 2 ~i1~0) (<= 0 ~j1~0) (<= 1 ~j2~0) (<= 1 ~i2~0)), Black: 220#(and (<= ~M1~0 (+ ~N1~0 ~j1~0)) (= ~i1~0 0)), 9#L52true, Black: 224#(and (<= ~M1~0 (+ ~N1~0 ~j1~0)) (= ~i1~0 0) (<= ~M1~0 ~j1~0)), 235#true, Black: 99#(and (<= 1 ~j1~0) (= ~i1~0 0) (<= 1 ~j2~0) (= ~i2~0 0)), 16#L41true, Black: 229#(and (= ~j2~0 0) (<= ~M1~0 (+ ~M2~0 ~j1~0))), Black: 232#(and (<= 1 ~M2~0) (= ~j2~0 0) (<= ~M1~0 (+ ~M2~0 ~j1~0))), Black: 104#(<= ~counter~0 1), Black: 103#(= ~counter~0 0), 40#L98-5true, 17#L75true, Black: 241#(and (= ~i1~0 0) (<= 1 ~N2~0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 113#(and (<= 1 ~j1~0) (<= 1 ~j2~0) (= ~i2~0 0) (<= 1 ~i1~0)), Black: 239#(and (<= 1 ~N2~0) (= ~i2~0 0)), Black: 237#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 59#(and (= ~i1~0 0) (<= 0 ~j1~0) (= ~j2~0 0) (= ~i2~0 0))]) [2024-06-27 18:04:10,949 INFO L294 olderBase$Statistics]: this new event has 30 ancestors and is cut-off event [2024-06-27 18:04:10,949 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2024-06-27 18:04:10,949 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2024-06-27 18:04:10,950 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2024-06-27 18:04:11,149 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([385] L67-->L64: Formula: (< v_~j1~0_4 v_~M1~0_2) InVars {~j1~0=v_~j1~0_4, ~M1~0=v_~M1~0_2} OutVars{~j1~0=v_~j1~0_4, ~M1~0=v_~M1~0_2} AuxVars[] AssignedVars[][107], [Black: 64#(and (<= 0 ~j1~0) (= ~j2~0 0) (= ~i2~0 0) (<= 1 ~i1~0)), 33#L64true, Black: 68#(= ~counter~0 0), Black: 171#(and (<= 0 ~j1~0) (<= 0 ~j2~0) (<= 0 ~i2~0) (<= 1 ~i1~0)), Black: 184#(and (<= 2 ~i1~0) (<= 0 ~j1~0) (<= 0 ~j2~0) (<= 0 ~i2~0)), Black: 125#(and (<= 0 ~i1~0) (<= 0 ~j1~0) (<= 0 ~j2~0) (<= 0 ~i2~0)), Black: 188#(and (<= 2 ~i1~0) (<= 0 ~j1~0) (<= 0 ~j2~0) (<= 1 ~i2~0)), Black: 74#(and (<= 0 ~j1~0) (= ~j2~0 0) (<= 1 ~i1~0) (<= 1 ~i2~0)), 218#true, Black: 207#(and (<= ~N1~0 0) (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 204#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 80#(and (<= 1 ~j1~0) (= ~i1~0 0) (= ~j2~0 0) (<= 1 ~i2~0)), 101#true, Black: 86#(and (<= 0 ~j1~0) (<= 1 ~j2~0) (= ~i2~0 0) (<= 1 ~i1~0)), Black: 215#(and (= ~i1~0 0) (<= (+ ~N1~0 ~j1~0) ~M1~0) (<= (+ ~j1~0 1) ~M1~0)), Black: 212#(and (= ~i1~0 0) (<= (+ ~N1~0 ~j1~0) ~M1~0)), 245#true, Black: 93#(and (<= 1 ~j1~0) (= ~j2~0 0) (<= 1 ~i1~0) (<= 1 ~i2~0)), 121#(and (<= 2 ~i1~0) (<= 0 ~j1~0) (<= 1 ~j2~0) (<= 1 ~i2~0)), Black: 220#(and (<= ~M1~0 (+ ~N1~0 ~j1~0)) (= ~i1~0 0)), Black: 224#(and (<= ~M1~0 (+ ~N1~0 ~j1~0)) (= ~i1~0 0) (<= ~M1~0 ~j1~0)), 235#true, Black: 99#(and (<= 1 ~j1~0) (= ~i1~0 0) (<= 1 ~j2~0) (= ~i2~0 0)), 14#L99true, 16#L41true, Black: 229#(and (= ~j2~0 0) (<= ~M1~0 (+ ~M2~0 ~j1~0))), Black: 232#(and (<= 1 ~M2~0) (= ~j2~0 0) (<= ~M1~0 (+ ~M2~0 ~j1~0))), Black: 104#(<= ~counter~0 1), Black: 103#(= ~counter~0 0), 25#L79true, Black: 113#(and (<= 1 ~j1~0) (<= 1 ~j2~0) (= ~i2~0 0) (<= 1 ~i1~0)), Black: 241#(and (= ~i1~0 0) (<= 1 ~N2~0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 239#(and (<= 1 ~N2~0) (= ~i2~0 0)), Black: 237#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), 13#thread2EXITtrue, Black: 59#(and (= ~i1~0 0) (<= 0 ~j1~0) (= ~j2~0 0) (= ~i2~0 0))]) [2024-06-27 18:04:11,149 INFO L294 olderBase$Statistics]: this new event has 32 ancestors and is cut-off event [2024-06-27 18:04:11,149 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2024-06-27 18:04:11,149 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2024-06-27 18:04:11,149 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2024-06-27 18:04:11,150 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([385] L67-->L64: Formula: (< v_~j1~0_4 v_~M1~0_2) InVars {~j1~0=v_~j1~0_4, ~M1~0=v_~M1~0_2} OutVars{~j1~0=v_~j1~0_4, ~M1~0=v_~M1~0_2} AuxVars[] AssignedVars[][107], [Black: 64#(and (<= 0 ~j1~0) (= ~j2~0 0) (= ~i2~0 0) (<= 1 ~i1~0)), 33#L64true, Black: 68#(= ~counter~0 0), Black: 171#(and (<= 0 ~j1~0) (<= 0 ~j2~0) (<= 0 ~i2~0) (<= 1 ~i1~0)), Black: 184#(and (<= 2 ~i1~0) (<= 0 ~j1~0) (<= 0 ~j2~0) (<= 0 ~i2~0)), Black: 125#(and (<= 0 ~i1~0) (<= 0 ~j1~0) (<= 0 ~j2~0) (<= 0 ~i2~0)), Black: 188#(and (<= 2 ~i1~0) (<= 0 ~j1~0) (<= 0 ~j2~0) (<= 1 ~i2~0)), Black: 74#(and (<= 0 ~j1~0) (= ~j2~0 0) (<= 1 ~i1~0) (<= 1 ~i2~0)), 218#true, Black: 207#(and (<= ~N1~0 0) (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 204#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 80#(and (<= 1 ~j1~0) (= ~i1~0 0) (= ~j2~0 0) (<= 1 ~i2~0)), 101#true, Black: 86#(and (<= 0 ~j1~0) (<= 1 ~j2~0) (= ~i2~0 0) (<= 1 ~i1~0)), Black: 215#(and (= ~i1~0 0) (<= (+ ~N1~0 ~j1~0) ~M1~0) (<= (+ ~j1~0 1) ~M1~0)), Black: 212#(and (= ~i1~0 0) (<= (+ ~N1~0 ~j1~0) ~M1~0)), 245#true, Black: 93#(and (<= 1 ~j1~0) (= ~j2~0 0) (<= 1 ~i1~0) (<= 1 ~i2~0)), 121#(and (<= 2 ~i1~0) (<= 0 ~j1~0) (<= 1 ~j2~0) (<= 1 ~i2~0)), Black: 220#(and (<= ~M1~0 (+ ~N1~0 ~j1~0)) (= ~i1~0 0)), Black: 224#(and (<= ~M1~0 (+ ~N1~0 ~j1~0)) (= ~i1~0 0) (<= ~M1~0 ~j1~0)), 235#true, Black: 99#(and (<= 1 ~j1~0) (= ~i1~0 0) (<= 1 ~j2~0) (= ~i2~0 0)), 16#L41true, Black: 229#(and (= ~j2~0 0) (<= ~M1~0 (+ ~M2~0 ~j1~0))), Black: 232#(and (<= 1 ~M2~0) (= ~j2~0 0) (<= ~M1~0 (+ ~M2~0 ~j1~0))), Black: 104#(<= ~counter~0 1), Black: 103#(= ~counter~0 0), 40#L98-5true, Black: 113#(and (<= 1 ~j1~0) (<= 1 ~j2~0) (= ~i2~0 0) (<= 1 ~i1~0)), 4#thread4EXITtrue, Black: 241#(and (= ~i1~0 0) (<= 1 ~N2~0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 239#(and (<= 1 ~N2~0) (= ~i2~0 0)), Black: 237#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), 13#thread2EXITtrue, Black: 59#(and (= ~i1~0 0) (<= 0 ~j1~0) (= ~j2~0 0) (= ~i2~0 0))]) [2024-06-27 18:04:11,150 INFO L294 olderBase$Statistics]: this new event has 32 ancestors and is cut-off event [2024-06-27 18:04:11,150 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2024-06-27 18:04:11,150 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2024-06-27 18:04:11,150 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2024-06-27 18:04:11,150 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([385] L67-->L64: Formula: (< v_~j1~0_4 v_~M1~0_2) InVars {~j1~0=v_~j1~0_4, ~M1~0=v_~M1~0_2} OutVars{~j1~0=v_~j1~0_4, ~M1~0=v_~M1~0_2} AuxVars[] AssignedVars[][107], [Black: 64#(and (<= 0 ~j1~0) (= ~j2~0 0) (= ~i2~0 0) (<= 1 ~i1~0)), 33#L64true, Black: 68#(= ~counter~0 0), Black: 171#(and (<= 0 ~j1~0) (<= 0 ~j2~0) (<= 0 ~i2~0) (<= 1 ~i1~0)), Black: 184#(and (<= 2 ~i1~0) (<= 0 ~j1~0) (<= 0 ~j2~0) (<= 0 ~i2~0)), Black: 125#(and (<= 0 ~i1~0) (<= 0 ~j1~0) (<= 0 ~j2~0) (<= 0 ~i2~0)), Black: 188#(and (<= 2 ~i1~0) (<= 0 ~j1~0) (<= 0 ~j2~0) (<= 1 ~i2~0)), Black: 74#(and (<= 0 ~j1~0) (= ~j2~0 0) (<= 1 ~i1~0) (<= 1 ~i2~0)), 218#true, Black: 207#(and (<= ~N1~0 0) (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 204#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 80#(and (<= 1 ~j1~0) (= ~i1~0 0) (= ~j2~0 0) (<= 1 ~i2~0)), 101#true, Black: 86#(and (<= 0 ~j1~0) (<= 1 ~j2~0) (= ~i2~0 0) (<= 1 ~i1~0)), Black: 215#(and (= ~i1~0 0) (<= (+ ~N1~0 ~j1~0) ~M1~0) (<= (+ ~j1~0 1) ~M1~0)), Black: 212#(and (= ~i1~0 0) (<= (+ ~N1~0 ~j1~0) ~M1~0)), 245#true, Black: 93#(and (<= 1 ~j1~0) (= ~j2~0 0) (<= 1 ~i1~0) (<= 1 ~i2~0)), 121#(and (<= 2 ~i1~0) (<= 0 ~j1~0) (<= 1 ~j2~0) (<= 1 ~i2~0)), Black: 220#(and (<= ~M1~0 (+ ~N1~0 ~j1~0)) (= ~i1~0 0)), Black: 224#(and (<= ~M1~0 (+ ~N1~0 ~j1~0)) (= ~i1~0 0) (<= ~M1~0 ~j1~0)), 235#true, Black: 99#(and (<= 1 ~j1~0) (= ~i1~0 0) (<= 1 ~j2~0) (= ~i2~0 0)), 16#L41true, Black: 229#(and (= ~j2~0 0) (<= ~M1~0 (+ ~M2~0 ~j1~0))), Black: 232#(and (<= 1 ~M2~0) (= ~j2~0 0) (<= ~M1~0 (+ ~M2~0 ~j1~0))), Black: 104#(<= ~counter~0 1), Black: 103#(= ~counter~0 0), 40#L98-5true, 17#L75true, Black: 113#(and (<= 1 ~j1~0) (<= 1 ~j2~0) (= ~i2~0 0) (<= 1 ~i1~0)), Black: 241#(and (= ~i1~0 0) (<= 1 ~N2~0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 239#(and (<= 1 ~N2~0) (= ~i2~0 0)), Black: 237#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), 13#thread2EXITtrue, Black: 59#(and (= ~i1~0 0) (<= 0 ~j1~0) (= ~j2~0 0) (= ~i2~0 0))]) [2024-06-27 18:04:11,150 INFO L294 olderBase$Statistics]: this new event has 32 ancestors and is cut-off event [2024-06-27 18:04:11,150 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2024-06-27 18:04:11,150 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2024-06-27 18:04:11,150 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2024-06-27 18:04:11,155 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([385] L67-->L64: Formula: (< v_~j1~0_4 v_~M1~0_2) InVars {~j1~0=v_~j1~0_4, ~M1~0=v_~M1~0_2} OutVars{~j1~0=v_~j1~0_4, ~M1~0=v_~M1~0_2} AuxVars[] AssignedVars[][107], [Black: 64#(and (<= 0 ~j1~0) (= ~j2~0 0) (= ~i2~0 0) (<= 1 ~i1~0)), 33#L64true, Black: 68#(= ~counter~0 0), Black: 171#(and (<= 0 ~j1~0) (<= 0 ~j2~0) (<= 0 ~i2~0) (<= 1 ~i1~0)), Black: 184#(and (<= 2 ~i1~0) (<= 0 ~j1~0) (<= 0 ~j2~0) (<= 0 ~i2~0)), Black: 125#(and (<= 0 ~i1~0) (<= 0 ~j1~0) (<= 0 ~j2~0) (<= 0 ~i2~0)), Black: 188#(and (<= 2 ~i1~0) (<= 0 ~j1~0) (<= 0 ~j2~0) (<= 1 ~i2~0)), Black: 74#(and (<= 0 ~j1~0) (= ~j2~0 0) (<= 1 ~i1~0) (<= 1 ~i2~0)), 218#true, Black: 207#(and (<= ~N1~0 0) (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 80#(and (<= 1 ~j1~0) (= ~i1~0 0) (= ~j2~0 0) (<= 1 ~i2~0)), Black: 204#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), 101#true, Black: 86#(and (<= 0 ~j1~0) (<= 1 ~j2~0) (= ~i2~0 0) (<= 1 ~i1~0)), Black: 215#(and (= ~i1~0 0) (<= (+ ~N1~0 ~j1~0) ~M1~0) (<= (+ ~j1~0 1) ~M1~0)), Black: 212#(and (= ~i1~0 0) (<= (+ ~N1~0 ~j1~0) ~M1~0)), 245#true, Black: 93#(and (<= 1 ~j1~0) (= ~j2~0 0) (<= 1 ~i1~0) (<= 1 ~i2~0)), 121#(and (<= 2 ~i1~0) (<= 0 ~j1~0) (<= 1 ~j2~0) (<= 1 ~i2~0)), Black: 220#(and (<= ~M1~0 (+ ~N1~0 ~j1~0)) (= ~i1~0 0)), Black: 224#(and (<= ~M1~0 (+ ~N1~0 ~j1~0)) (= ~i1~0 0) (<= ~M1~0 ~j1~0)), 8#L56true, 235#true, Black: 99#(and (<= 1 ~j1~0) (= ~i1~0 0) (<= 1 ~j2~0) (= ~i2~0 0)), 14#L99true, 16#L41true, Black: 229#(and (= ~j2~0 0) (<= ~M1~0 (+ ~M2~0 ~j1~0))), Black: 104#(<= ~counter~0 1), Black: 232#(and (<= 1 ~M2~0) (= ~j2~0 0) (<= ~M1~0 (+ ~M2~0 ~j1~0))), Black: 103#(= ~counter~0 0), Black: 113#(and (<= 1 ~j1~0) (<= 1 ~j2~0) (= ~i2~0 0) (<= 1 ~i1~0)), Black: 241#(and (= ~i1~0 0) (<= 1 ~N2~0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), 4#thread4EXITtrue, Black: 239#(and (<= 1 ~N2~0) (= ~i2~0 0)), Black: 237#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 59#(and (= ~i1~0 0) (<= 0 ~j1~0) (= ~j2~0 0) (= ~i2~0 0))]) [2024-06-27 18:04:11,155 INFO L294 olderBase$Statistics]: this new event has 32 ancestors and is cut-off event [2024-06-27 18:04:11,155 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2024-06-27 18:04:11,155 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2024-06-27 18:04:11,155 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2024-06-27 18:04:11,156 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([385] L67-->L64: Formula: (< v_~j1~0_4 v_~M1~0_2) InVars {~j1~0=v_~j1~0_4, ~M1~0=v_~M1~0_2} OutVars{~j1~0=v_~j1~0_4, ~M1~0=v_~M1~0_2} AuxVars[] AssignedVars[][107], [Black: 64#(and (<= 0 ~j1~0) (= ~j2~0 0) (= ~i2~0 0) (<= 1 ~i1~0)), 33#L64true, Black: 68#(= ~counter~0 0), Black: 171#(and (<= 0 ~j1~0) (<= 0 ~j2~0) (<= 0 ~i2~0) (<= 1 ~i1~0)), Black: 184#(and (<= 2 ~i1~0) (<= 0 ~j1~0) (<= 0 ~j2~0) (<= 0 ~i2~0)), Black: 125#(and (<= 0 ~i1~0) (<= 0 ~j1~0) (<= 0 ~j2~0) (<= 0 ~i2~0)), Black: 188#(and (<= 2 ~i1~0) (<= 0 ~j1~0) (<= 0 ~j2~0) (<= 1 ~i2~0)), Black: 74#(and (<= 0 ~j1~0) (= ~j2~0 0) (<= 1 ~i1~0) (<= 1 ~i2~0)), 218#true, Black: 207#(and (<= ~N1~0 0) (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 80#(and (<= 1 ~j1~0) (= ~i1~0 0) (= ~j2~0 0) (<= 1 ~i2~0)), Black: 204#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), 101#true, Black: 86#(and (<= 0 ~j1~0) (<= 1 ~j2~0) (= ~i2~0 0) (<= 1 ~i1~0)), Black: 215#(and (= ~i1~0 0) (<= (+ ~N1~0 ~j1~0) ~M1~0) (<= (+ ~j1~0 1) ~M1~0)), Black: 212#(and (= ~i1~0 0) (<= (+ ~N1~0 ~j1~0) ~M1~0)), 245#true, Black: 93#(and (<= 1 ~j1~0) (= ~j2~0 0) (<= 1 ~i1~0) (<= 1 ~i2~0)), 121#(and (<= 2 ~i1~0) (<= 0 ~j1~0) (<= 1 ~j2~0) (<= 1 ~i2~0)), Black: 220#(and (<= ~M1~0 (+ ~N1~0 ~j1~0)) (= ~i1~0 0)), Black: 224#(and (<= ~M1~0 (+ ~N1~0 ~j1~0)) (= ~i1~0 0) (<= ~M1~0 ~j1~0)), 8#L56true, 235#true, Black: 99#(and (<= 1 ~j1~0) (= ~i1~0 0) (<= 1 ~j2~0) (= ~i2~0 0)), 14#L99true, 16#L41true, Black: 229#(and (= ~j2~0 0) (<= ~M1~0 (+ ~M2~0 ~j1~0))), Black: 104#(<= ~counter~0 1), Black: 232#(and (<= 1 ~M2~0) (= ~j2~0 0) (<= ~M1~0 (+ ~M2~0 ~j1~0))), Black: 103#(= ~counter~0 0), 17#L75true, Black: 113#(and (<= 1 ~j1~0) (<= 1 ~j2~0) (= ~i2~0 0) (<= 1 ~i1~0)), Black: 241#(and (= ~i1~0 0) (<= 1 ~N2~0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 239#(and (<= 1 ~N2~0) (= ~i2~0 0)), Black: 237#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 59#(and (= ~i1~0 0) (<= 0 ~j1~0) (= ~j2~0 0) (= ~i2~0 0))]) [2024-06-27 18:04:11,156 INFO L294 olderBase$Statistics]: this new event has 32 ancestors and is cut-off event [2024-06-27 18:04:11,156 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2024-06-27 18:04:11,156 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2024-06-27 18:04:11,156 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2024-06-27 18:04:11,156 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([385] L67-->L64: Formula: (< v_~j1~0_4 v_~M1~0_2) InVars {~j1~0=v_~j1~0_4, ~M1~0=v_~M1~0_2} OutVars{~j1~0=v_~j1~0_4, ~M1~0=v_~M1~0_2} AuxVars[] AssignedVars[][107], [Black: 64#(and (<= 0 ~j1~0) (= ~j2~0 0) (= ~i2~0 0) (<= 1 ~i1~0)), 33#L64true, Black: 68#(= ~counter~0 0), Black: 171#(and (<= 0 ~j1~0) (<= 0 ~j2~0) (<= 0 ~i2~0) (<= 1 ~i1~0)), Black: 184#(and (<= 2 ~i1~0) (<= 0 ~j1~0) (<= 0 ~j2~0) (<= 0 ~i2~0)), Black: 125#(and (<= 0 ~i1~0) (<= 0 ~j1~0) (<= 0 ~j2~0) (<= 0 ~i2~0)), Black: 74#(and (<= 0 ~j1~0) (= ~j2~0 0) (<= 1 ~i1~0) (<= 1 ~i2~0)), 218#true, Black: 207#(and (<= ~N1~0 0) (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 80#(and (<= 1 ~j1~0) (= ~i1~0 0) (= ~j2~0 0) (<= 1 ~i2~0)), Black: 204#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), 101#true, Black: 86#(and (<= 0 ~j1~0) (<= 1 ~j2~0) (= ~i2~0 0) (<= 1 ~i1~0)), Black: 215#(and (= ~i1~0 0) (<= (+ ~N1~0 ~j1~0) ~M1~0) (<= (+ ~j1~0 1) ~M1~0)), Black: 212#(and (= ~i1~0 0) (<= (+ ~N1~0 ~j1~0) ~M1~0)), 245#true, Black: 93#(and (<= 1 ~j1~0) (= ~j2~0 0) (<= 1 ~i1~0) (<= 1 ~i2~0)), 188#(and (<= 2 ~i1~0) (<= 0 ~j1~0) (<= 0 ~j2~0) (<= 1 ~i2~0)), Black: 220#(and (<= ~M1~0 (+ ~N1~0 ~j1~0)) (= ~i1~0 0)), Black: 224#(and (<= ~M1~0 (+ ~N1~0 ~j1~0)) (= ~i1~0 0) (<= ~M1~0 ~j1~0)), 8#L56true, 235#true, Black: 99#(and (<= 1 ~j1~0) (= ~i1~0 0) (<= 1 ~j2~0) (= ~i2~0 0)), 14#L99true, 16#L41true, Black: 229#(and (= ~j2~0 0) (<= ~M1~0 (+ ~M2~0 ~j1~0))), Black: 232#(and (<= 1 ~M2~0) (= ~j2~0 0) (<= ~M1~0 (+ ~M2~0 ~j1~0))), Black: 104#(<= ~counter~0 1), Black: 103#(= ~counter~0 0), 4#thread4EXITtrue, Black: 241#(and (= ~i1~0 0) (<= 1 ~N2~0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 113#(and (<= 1 ~j1~0) (<= 1 ~j2~0) (= ~i2~0 0) (<= 1 ~i1~0)), Black: 239#(and (<= 1 ~N2~0) (= ~i2~0 0)), Black: 237#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 59#(and (= ~i1~0 0) (<= 0 ~j1~0) (= ~j2~0 0) (= ~i2~0 0))]) [2024-06-27 18:04:11,156 INFO L294 olderBase$Statistics]: this new event has 32 ancestors and is cut-off event [2024-06-27 18:04:11,157 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2024-06-27 18:04:11,157 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2024-06-27 18:04:11,157 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2024-06-27 18:04:11,157 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([385] L67-->L64: Formula: (< v_~j1~0_4 v_~M1~0_2) InVars {~j1~0=v_~j1~0_4, ~M1~0=v_~M1~0_2} OutVars{~j1~0=v_~j1~0_4, ~M1~0=v_~M1~0_2} AuxVars[] AssignedVars[][107], [Black: 64#(and (<= 0 ~j1~0) (= ~j2~0 0) (= ~i2~0 0) (<= 1 ~i1~0)), 33#L64true, Black: 68#(= ~counter~0 0), Black: 171#(and (<= 0 ~j1~0) (<= 0 ~j2~0) (<= 0 ~i2~0) (<= 1 ~i1~0)), Black: 184#(and (<= 2 ~i1~0) (<= 0 ~j1~0) (<= 0 ~j2~0) (<= 0 ~i2~0)), Black: 125#(and (<= 0 ~i1~0) (<= 0 ~j1~0) (<= 0 ~j2~0) (<= 0 ~i2~0)), Black: 74#(and (<= 0 ~j1~0) (= ~j2~0 0) (<= 1 ~i1~0) (<= 1 ~i2~0)), 218#true, Black: 207#(and (<= ~N1~0 0) (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 204#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 80#(and (<= 1 ~j1~0) (= ~i1~0 0) (= ~j2~0 0) (<= 1 ~i2~0)), 101#true, Black: 86#(and (<= 0 ~j1~0) (<= 1 ~j2~0) (= ~i2~0 0) (<= 1 ~i1~0)), Black: 215#(and (= ~i1~0 0) (<= (+ ~N1~0 ~j1~0) ~M1~0) (<= (+ ~j1~0 1) ~M1~0)), Black: 212#(and (= ~i1~0 0) (<= (+ ~N1~0 ~j1~0) ~M1~0)), 245#true, Black: 93#(and (<= 1 ~j1~0) (= ~j2~0 0) (<= 1 ~i1~0) (<= 1 ~i2~0)), 188#(and (<= 2 ~i1~0) (<= 0 ~j1~0) (<= 0 ~j2~0) (<= 1 ~i2~0)), Black: 220#(and (<= ~M1~0 (+ ~N1~0 ~j1~0)) (= ~i1~0 0)), 8#L56true, Black: 224#(and (<= ~M1~0 (+ ~N1~0 ~j1~0)) (= ~i1~0 0) (<= ~M1~0 ~j1~0)), 235#true, Black: 99#(and (<= 1 ~j1~0) (= ~i1~0 0) (<= 1 ~j2~0) (= ~i2~0 0)), 14#L99true, 16#L41true, Black: 229#(and (= ~j2~0 0) (<= ~M1~0 (+ ~M2~0 ~j1~0))), Black: 232#(and (<= 1 ~M2~0) (= ~j2~0 0) (<= ~M1~0 (+ ~M2~0 ~j1~0))), Black: 104#(<= ~counter~0 1), Black: 103#(= ~counter~0 0), 17#L75true, Black: 241#(and (= ~i1~0 0) (<= 1 ~N2~0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 113#(and (<= 1 ~j1~0) (<= 1 ~j2~0) (= ~i2~0 0) (<= 1 ~i1~0)), Black: 239#(and (<= 1 ~N2~0) (= ~i2~0 0)), Black: 237#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 59#(and (= ~i1~0 0) (<= 0 ~j1~0) (= ~j2~0 0) (= ~i2~0 0))]) [2024-06-27 18:04:11,157 INFO L294 olderBase$Statistics]: this new event has 32 ancestors and is cut-off event [2024-06-27 18:04:11,157 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2024-06-27 18:04:11,157 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2024-06-27 18:04:11,157 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2024-06-27 18:04:11,158 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([385] L67-->L64: Formula: (< v_~j1~0_4 v_~M1~0_2) InVars {~j1~0=v_~j1~0_4, ~M1~0=v_~M1~0_2} OutVars{~j1~0=v_~j1~0_4, ~M1~0=v_~M1~0_2} AuxVars[] AssignedVars[][107], [Black: 64#(and (<= 0 ~j1~0) (= ~j2~0 0) (= ~i2~0 0) (<= 1 ~i1~0)), 33#L64true, Black: 68#(= ~counter~0 0), Black: 171#(and (<= 0 ~j1~0) (<= 0 ~j2~0) (<= 0 ~i2~0) (<= 1 ~i1~0)), Black: 184#(and (<= 2 ~i1~0) (<= 0 ~j1~0) (<= 0 ~j2~0) (<= 0 ~i2~0)), Black: 125#(and (<= 0 ~i1~0) (<= 0 ~j1~0) (<= 0 ~j2~0) (<= 0 ~i2~0)), Black: 74#(and (<= 0 ~j1~0) (= ~j2~0 0) (<= 1 ~i1~0) (<= 1 ~i2~0)), 218#true, Black: 207#(and (<= ~N1~0 0) (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 80#(and (<= 1 ~j1~0) (= ~i1~0 0) (= ~j2~0 0) (<= 1 ~i2~0)), Black: 204#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), 101#true, Black: 86#(and (<= 0 ~j1~0) (<= 1 ~j2~0) (= ~i2~0 0) (<= 1 ~i1~0)), Black: 215#(and (= ~i1~0 0) (<= (+ ~N1~0 ~j1~0) ~M1~0) (<= (+ ~j1~0 1) ~M1~0)), Black: 212#(and (= ~i1~0 0) (<= (+ ~N1~0 ~j1~0) ~M1~0)), 245#true, Black: 93#(and (<= 1 ~j1~0) (= ~j2~0 0) (<= 1 ~i1~0) (<= 1 ~i2~0)), 188#(and (<= 2 ~i1~0) (<= 0 ~j1~0) (<= 0 ~j2~0) (<= 1 ~i2~0)), Black: 220#(and (<= ~M1~0 (+ ~N1~0 ~j1~0)) (= ~i1~0 0)), Black: 224#(and (<= ~M1~0 (+ ~N1~0 ~j1~0)) (= ~i1~0 0) (<= ~M1~0 ~j1~0)), 235#true, Black: 99#(and (<= 1 ~j1~0) (= ~i1~0 0) (<= 1 ~j2~0) (= ~i2~0 0)), 14#L99true, 16#L41true, Black: 229#(and (= ~j2~0 0) (<= ~M1~0 (+ ~M2~0 ~j1~0))), Black: 104#(<= ~counter~0 1), Black: 232#(and (<= 1 ~M2~0) (= ~j2~0 0) (<= ~M1~0 (+ ~M2~0 ~j1~0))), Black: 103#(= ~counter~0 0), Black: 113#(and (<= 1 ~j1~0) (<= 1 ~j2~0) (= ~i2~0 0) (<= 1 ~i1~0)), 25#L79true, Black: 241#(and (= ~i1~0 0) (<= 1 ~N2~0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 239#(and (<= 1 ~N2~0) (= ~i2~0 0)), Black: 237#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), 13#thread2EXITtrue, Black: 59#(and (= ~i1~0 0) (<= 0 ~j1~0) (= ~j2~0 0) (= ~i2~0 0))]) [2024-06-27 18:04:11,158 INFO L294 olderBase$Statistics]: this new event has 32 ancestors and is cut-off event [2024-06-27 18:04:11,158 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2024-06-27 18:04:11,158 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2024-06-27 18:04:11,158 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2024-06-27 18:04:11,159 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([385] L67-->L64: Formula: (< v_~j1~0_4 v_~M1~0_2) InVars {~j1~0=v_~j1~0_4, ~M1~0=v_~M1~0_2} OutVars{~j1~0=v_~j1~0_4, ~M1~0=v_~M1~0_2} AuxVars[] AssignedVars[][107], [Black: 64#(and (<= 0 ~j1~0) (= ~j2~0 0) (= ~i2~0 0) (<= 1 ~i1~0)), 33#L64true, Black: 68#(= ~counter~0 0), Black: 171#(and (<= 0 ~j1~0) (<= 0 ~j2~0) (<= 0 ~i2~0) (<= 1 ~i1~0)), Black: 184#(and (<= 2 ~i1~0) (<= 0 ~j1~0) (<= 0 ~j2~0) (<= 0 ~i2~0)), Black: 125#(and (<= 0 ~i1~0) (<= 0 ~j1~0) (<= 0 ~j2~0) (<= 0 ~i2~0)), Black: 74#(and (<= 0 ~j1~0) (= ~j2~0 0) (<= 1 ~i1~0) (<= 1 ~i2~0)), 218#true, Black: 207#(and (<= ~N1~0 0) (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 80#(and (<= 1 ~j1~0) (= ~i1~0 0) (= ~j2~0 0) (<= 1 ~i2~0)), Black: 204#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), 101#true, Black: 86#(and (<= 0 ~j1~0) (<= 1 ~j2~0) (= ~i2~0 0) (<= 1 ~i1~0)), Black: 215#(and (= ~i1~0 0) (<= (+ ~N1~0 ~j1~0) ~M1~0) (<= (+ ~j1~0 1) ~M1~0)), Black: 212#(and (= ~i1~0 0) (<= (+ ~N1~0 ~j1~0) ~M1~0)), 245#true, Black: 93#(and (<= 1 ~j1~0) (= ~j2~0 0) (<= 1 ~i1~0) (<= 1 ~i2~0)), 188#(and (<= 2 ~i1~0) (<= 0 ~j1~0) (<= 0 ~j2~0) (<= 1 ~i2~0)), Black: 220#(and (<= ~M1~0 (+ ~N1~0 ~j1~0)) (= ~i1~0 0)), Black: 224#(and (<= ~M1~0 (+ ~N1~0 ~j1~0)) (= ~i1~0 0) (<= ~M1~0 ~j1~0)), 235#true, Black: 99#(and (<= 1 ~j1~0) (= ~i1~0 0) (<= 1 ~j2~0) (= ~i2~0 0)), 16#L41true, Black: 229#(and (= ~j2~0 0) (<= ~M1~0 (+ ~M2~0 ~j1~0))), Black: 232#(and (<= 1 ~M2~0) (= ~j2~0 0) (<= ~M1~0 (+ ~M2~0 ~j1~0))), Black: 104#(<= ~counter~0 1), Black: 103#(= ~counter~0 0), 40#L98-5true, 4#thread4EXITtrue, Black: 113#(and (<= 1 ~j1~0) (<= 1 ~j2~0) (= ~i2~0 0) (<= 1 ~i1~0)), Black: 241#(and (= ~i1~0 0) (<= 1 ~N2~0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 239#(and (<= 1 ~N2~0) (= ~i2~0 0)), Black: 237#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), 13#thread2EXITtrue, Black: 59#(and (= ~i1~0 0) (<= 0 ~j1~0) (= ~j2~0 0) (= ~i2~0 0))]) [2024-06-27 18:04:11,159 INFO L294 olderBase$Statistics]: this new event has 32 ancestors and is cut-off event [2024-06-27 18:04:11,159 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2024-06-27 18:04:11,159 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2024-06-27 18:04:11,159 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2024-06-27 18:04:11,159 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([385] L67-->L64: Formula: (< v_~j1~0_4 v_~M1~0_2) InVars {~j1~0=v_~j1~0_4, ~M1~0=v_~M1~0_2} OutVars{~j1~0=v_~j1~0_4, ~M1~0=v_~M1~0_2} AuxVars[] AssignedVars[][107], [Black: 64#(and (<= 0 ~j1~0) (= ~j2~0 0) (= ~i2~0 0) (<= 1 ~i1~0)), 33#L64true, Black: 68#(= ~counter~0 0), Black: 171#(and (<= 0 ~j1~0) (<= 0 ~j2~0) (<= 0 ~i2~0) (<= 1 ~i1~0)), Black: 184#(and (<= 2 ~i1~0) (<= 0 ~j1~0) (<= 0 ~j2~0) (<= 0 ~i2~0)), Black: 125#(and (<= 0 ~i1~0) (<= 0 ~j1~0) (<= 0 ~j2~0) (<= 0 ~i2~0)), Black: 74#(and (<= 0 ~j1~0) (= ~j2~0 0) (<= 1 ~i1~0) (<= 1 ~i2~0)), 218#true, Black: 207#(and (<= ~N1~0 0) (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 204#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 80#(and (<= 1 ~j1~0) (= ~i1~0 0) (= ~j2~0 0) (<= 1 ~i2~0)), 101#true, Black: 86#(and (<= 0 ~j1~0) (<= 1 ~j2~0) (= ~i2~0 0) (<= 1 ~i1~0)), Black: 215#(and (= ~i1~0 0) (<= (+ ~N1~0 ~j1~0) ~M1~0) (<= (+ ~j1~0 1) ~M1~0)), Black: 212#(and (= ~i1~0 0) (<= (+ ~N1~0 ~j1~0) ~M1~0)), 245#true, Black: 93#(and (<= 1 ~j1~0) (= ~j2~0 0) (<= 1 ~i1~0) (<= 1 ~i2~0)), 188#(and (<= 2 ~i1~0) (<= 0 ~j1~0) (<= 0 ~j2~0) (<= 1 ~i2~0)), Black: 220#(and (<= ~M1~0 (+ ~N1~0 ~j1~0)) (= ~i1~0 0)), Black: 224#(and (<= ~M1~0 (+ ~N1~0 ~j1~0)) (= ~i1~0 0) (<= ~M1~0 ~j1~0)), 235#true, Black: 99#(and (<= 1 ~j1~0) (= ~i1~0 0) (<= 1 ~j2~0) (= ~i2~0 0)), 16#L41true, Black: 229#(and (= ~j2~0 0) (<= ~M1~0 (+ ~M2~0 ~j1~0))), Black: 104#(<= ~counter~0 1), Black: 232#(and (<= 1 ~M2~0) (= ~j2~0 0) (<= ~M1~0 (+ ~M2~0 ~j1~0))), Black: 103#(= ~counter~0 0), 40#L98-5true, 17#L75true, Black: 113#(and (<= 1 ~j1~0) (<= 1 ~j2~0) (= ~i2~0 0) (<= 1 ~i1~0)), Black: 241#(and (= ~i1~0 0) (<= 1 ~N2~0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 239#(and (<= 1 ~N2~0) (= ~i2~0 0)), Black: 237#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), 13#thread2EXITtrue, Black: 59#(and (= ~i1~0 0) (<= 0 ~j1~0) (= ~j2~0 0) (= ~i2~0 0))]) [2024-06-27 18:04:11,160 INFO L294 olderBase$Statistics]: this new event has 32 ancestors and is cut-off event [2024-06-27 18:04:11,160 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2024-06-27 18:04:11,160 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2024-06-27 18:04:11,160 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2024-06-27 18:04:11,169 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([385] L67-->L64: Formula: (< v_~j1~0_4 v_~M1~0_2) InVars {~j1~0=v_~j1~0_4, ~M1~0=v_~M1~0_2} OutVars{~j1~0=v_~j1~0_4, ~M1~0=v_~M1~0_2} AuxVars[] AssignedVars[][41], [Black: 64#(and (<= 0 ~j1~0) (= ~j2~0 0) (= ~i2~0 0) (<= 1 ~i1~0)), 247#(and (= ~j2~0 0) (<= ~M1~0 (+ ~M2~0 ~j1~0))), 33#L64true, Black: 68#(= ~counter~0 0), Black: 171#(and (<= 0 ~j1~0) (<= 0 ~j2~0) (<= 0 ~i2~0) (<= 1 ~i1~0)), Black: 184#(and (<= 2 ~i1~0) (<= 0 ~j1~0) (<= 0 ~j2~0) (<= 0 ~i2~0)), Black: 125#(and (<= 0 ~i1~0) (<= 0 ~j1~0) (<= 0 ~j2~0) (<= 0 ~i2~0)), 218#true, Black: 207#(and (<= ~N1~0 0) (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 80#(and (<= 1 ~j1~0) (= ~i1~0 0) (= ~j2~0 0) (<= 1 ~i2~0)), Black: 204#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 86#(and (<= 0 ~j1~0) (<= 1 ~j2~0) (= ~i2~0 0) (<= 1 ~i1~0)), Black: 215#(and (= ~i1~0 0) (<= (+ ~N1~0 ~j1~0) ~M1~0) (<= (+ ~j1~0 1) ~M1~0)), Black: 212#(and (= ~i1~0 0) (<= (+ ~N1~0 ~j1~0) ~M1~0)), 103#(= ~counter~0 0), Black: 93#(and (<= 1 ~j1~0) (= ~j2~0 0) (<= 1 ~i1~0) (<= 1 ~i2~0)), 188#(and (<= 2 ~i1~0) (<= 0 ~j1~0) (<= 0 ~j2~0) (<= 1 ~i2~0)), 232#(and (<= 1 ~M2~0) (= ~j2~0 0) (<= ~M1~0 (+ ~M2~0 ~j1~0))), Black: 220#(and (<= ~M1~0 (+ ~N1~0 ~j1~0)) (= ~i1~0 0)), Black: 224#(and (<= ~M1~0 (+ ~N1~0 ~j1~0)) (= ~i1~0 0) (<= ~M1~0 ~j1~0)), 8#L56true, 235#true, Black: 99#(and (<= 1 ~j1~0) (= ~i1~0 0) (<= 1 ~j2~0) (= ~i2~0 0)), 16#L41true, Black: 229#(and (= ~j2~0 0) (<= ~M1~0 (+ ~M2~0 ~j1~0))), Black: 104#(<= ~counter~0 1), 17#L75true, 40#L98-5true, Black: 241#(and (= ~i1~0 0) (<= 1 ~N2~0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 113#(and (<= 1 ~j1~0) (<= 1 ~j2~0) (= ~i2~0 0) (<= 1 ~i1~0)), Black: 239#(and (<= 1 ~N2~0) (= ~i2~0 0)), 74#(and (<= 0 ~j1~0) (= ~j2~0 0) (<= 1 ~i1~0) (<= 1 ~i2~0)), Black: 237#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 59#(and (= ~i1~0 0) (<= 0 ~j1~0) (= ~j2~0 0) (= ~i2~0 0))]) [2024-06-27 18:04:11,169 INFO L294 olderBase$Statistics]: this new event has 31 ancestors and is cut-off event [2024-06-27 18:04:11,169 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2024-06-27 18:04:11,169 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2024-06-27 18:04:11,169 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2024-06-27 18:04:11,172 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([385] L67-->L64: Formula: (< v_~j1~0_4 v_~M1~0_2) InVars {~j1~0=v_~j1~0_4, ~M1~0=v_~M1~0_2} OutVars{~j1~0=v_~j1~0_4, ~M1~0=v_~M1~0_2} AuxVars[] AssignedVars[][107], [Black: 64#(and (<= 0 ~j1~0) (= ~j2~0 0) (= ~i2~0 0) (<= 1 ~i1~0)), 33#L64true, Black: 68#(= ~counter~0 0), Black: 171#(and (<= 0 ~j1~0) (<= 0 ~j2~0) (<= 0 ~i2~0) (<= 1 ~i1~0)), Black: 184#(and (<= 2 ~i1~0) (<= 0 ~j1~0) (<= 0 ~j2~0) (<= 0 ~i2~0)), Black: 125#(and (<= 0 ~i1~0) (<= 0 ~j1~0) (<= 0 ~j2~0) (<= 0 ~i2~0)), Black: 188#(and (<= 2 ~i1~0) (<= 0 ~j1~0) (<= 0 ~j2~0) (<= 1 ~i2~0)), Black: 74#(and (<= 0 ~j1~0) (= ~j2~0 0) (<= 1 ~i1~0) (<= 1 ~i2~0)), 218#true, Black: 207#(and (<= ~N1~0 0) (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 204#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 80#(and (<= 1 ~j1~0) (= ~i1~0 0) (= ~j2~0 0) (<= 1 ~i2~0)), 101#true, Black: 86#(and (<= 0 ~j1~0) (<= 1 ~j2~0) (= ~i2~0 0) (<= 1 ~i1~0)), Black: 215#(and (= ~i1~0 0) (<= (+ ~N1~0 ~j1~0) ~M1~0) (<= (+ ~j1~0 1) ~M1~0)), Black: 212#(and (= ~i1~0 0) (<= (+ ~N1~0 ~j1~0) ~M1~0)), 245#true, Black: 93#(and (<= 1 ~j1~0) (= ~j2~0 0) (<= 1 ~i1~0) (<= 1 ~i2~0)), 121#(and (<= 2 ~i1~0) (<= 0 ~j1~0) (<= 1 ~j2~0) (<= 1 ~i2~0)), Black: 220#(and (<= ~M1~0 (+ ~N1~0 ~j1~0)) (= ~i1~0 0)), Black: 224#(and (<= ~M1~0 (+ ~N1~0 ~j1~0)) (= ~i1~0 0) (<= ~M1~0 ~j1~0)), 9#L52true, 235#true, Black: 99#(and (<= 1 ~j1~0) (= ~i1~0 0) (<= 1 ~j2~0) (= ~i2~0 0)), 14#L99true, 16#L41true, Black: 229#(and (= ~j2~0 0) (<= ~M1~0 (+ ~M2~0 ~j1~0))), Black: 104#(<= ~counter~0 1), Black: 232#(and (<= 1 ~M2~0) (= ~j2~0 0) (<= ~M1~0 (+ ~M2~0 ~j1~0))), Black: 103#(= ~counter~0 0), Black: 113#(and (<= 1 ~j1~0) (<= 1 ~j2~0) (= ~i2~0 0) (<= 1 ~i1~0)), 25#L79true, Black: 241#(and (= ~i1~0 0) (<= 1 ~N2~0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 239#(and (<= 1 ~N2~0) (= ~i2~0 0)), Black: 237#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 59#(and (= ~i1~0 0) (<= 0 ~j1~0) (= ~j2~0 0) (= ~i2~0 0))]) [2024-06-27 18:04:11,172 INFO L294 olderBase$Statistics]: this new event has 32 ancestors and is cut-off event [2024-06-27 18:04:11,172 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2024-06-27 18:04:11,172 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2024-06-27 18:04:11,172 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2024-06-27 18:04:11,172 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2024-06-27 18:04:11,172 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([385] L67-->L64: Formula: (< v_~j1~0_4 v_~M1~0_2) InVars {~j1~0=v_~j1~0_4, ~M1~0=v_~M1~0_2} OutVars{~j1~0=v_~j1~0_4, ~M1~0=v_~M1~0_2} AuxVars[] AssignedVars[][107], [Black: 64#(and (<= 0 ~j1~0) (= ~j2~0 0) (= ~i2~0 0) (<= 1 ~i1~0)), 33#L64true, Black: 68#(= ~counter~0 0), Black: 171#(and (<= 0 ~j1~0) (<= 0 ~j2~0) (<= 0 ~i2~0) (<= 1 ~i1~0)), Black: 184#(and (<= 2 ~i1~0) (<= 0 ~j1~0) (<= 0 ~j2~0) (<= 0 ~i2~0)), Black: 125#(and (<= 0 ~i1~0) (<= 0 ~j1~0) (<= 0 ~j2~0) (<= 0 ~i2~0)), Black: 188#(and (<= 2 ~i1~0) (<= 0 ~j1~0) (<= 0 ~j2~0) (<= 1 ~i2~0)), Black: 74#(and (<= 0 ~j1~0) (= ~j2~0 0) (<= 1 ~i1~0) (<= 1 ~i2~0)), 218#true, Black: 207#(and (<= ~N1~0 0) (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 80#(and (<= 1 ~j1~0) (= ~i1~0 0) (= ~j2~0 0) (<= 1 ~i2~0)), Black: 204#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), 101#true, Black: 86#(and (<= 0 ~j1~0) (<= 1 ~j2~0) (= ~i2~0 0) (<= 1 ~i1~0)), Black: 215#(and (= ~i1~0 0) (<= (+ ~N1~0 ~j1~0) ~M1~0) (<= (+ ~j1~0 1) ~M1~0)), Black: 212#(and (= ~i1~0 0) (<= (+ ~N1~0 ~j1~0) ~M1~0)), 245#true, Black: 93#(and (<= 1 ~j1~0) (= ~j2~0 0) (<= 1 ~i1~0) (<= 1 ~i2~0)), 121#(and (<= 2 ~i1~0) (<= 0 ~j1~0) (<= 1 ~j2~0) (<= 1 ~i2~0)), Black: 220#(and (<= ~M1~0 (+ ~N1~0 ~j1~0)) (= ~i1~0 0)), Black: 224#(and (<= ~M1~0 (+ ~N1~0 ~j1~0)) (= ~i1~0 0) (<= ~M1~0 ~j1~0)), 9#L52true, 235#true, Black: 99#(and (<= 1 ~j1~0) (= ~i1~0 0) (<= 1 ~j2~0) (= ~i2~0 0)), 16#L41true, Black: 229#(and (= ~j2~0 0) (<= ~M1~0 (+ ~M2~0 ~j1~0))), Black: 232#(and (<= 1 ~M2~0) (= ~j2~0 0) (<= ~M1~0 (+ ~M2~0 ~j1~0))), Black: 104#(<= ~counter~0 1), Black: 103#(= ~counter~0 0), 40#L98-5true, Black: 113#(and (<= 1 ~j1~0) (<= 1 ~j2~0) (= ~i2~0 0) (<= 1 ~i1~0)), 4#thread4EXITtrue, Black: 241#(and (= ~i1~0 0) (<= 1 ~N2~0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 239#(and (<= 1 ~N2~0) (= ~i2~0 0)), Black: 237#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 59#(and (= ~i1~0 0) (<= 0 ~j1~0) (= ~j2~0 0) (= ~i2~0 0))]) [2024-06-27 18:04:11,173 INFO L294 olderBase$Statistics]: this new event has 32 ancestors and is cut-off event [2024-06-27 18:04:11,173 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2024-06-27 18:04:11,173 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2024-06-27 18:04:11,173 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2024-06-27 18:04:11,173 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2024-06-27 18:04:11,173 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([385] L67-->L64: Formula: (< v_~j1~0_4 v_~M1~0_2) InVars {~j1~0=v_~j1~0_4, ~M1~0=v_~M1~0_2} OutVars{~j1~0=v_~j1~0_4, ~M1~0=v_~M1~0_2} AuxVars[] AssignedVars[][107], [Black: 64#(and (<= 0 ~j1~0) (= ~j2~0 0) (= ~i2~0 0) (<= 1 ~i1~0)), 33#L64true, Black: 68#(= ~counter~0 0), Black: 171#(and (<= 0 ~j1~0) (<= 0 ~j2~0) (<= 0 ~i2~0) (<= 1 ~i1~0)), Black: 184#(and (<= 2 ~i1~0) (<= 0 ~j1~0) (<= 0 ~j2~0) (<= 0 ~i2~0)), Black: 125#(and (<= 0 ~i1~0) (<= 0 ~j1~0) (<= 0 ~j2~0) (<= 0 ~i2~0)), Black: 188#(and (<= 2 ~i1~0) (<= 0 ~j1~0) (<= 0 ~j2~0) (<= 1 ~i2~0)), Black: 74#(and (<= 0 ~j1~0) (= ~j2~0 0) (<= 1 ~i1~0) (<= 1 ~i2~0)), 218#true, Black: 207#(and (<= ~N1~0 0) (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 80#(and (<= 1 ~j1~0) (= ~i1~0 0) (= ~j2~0 0) (<= 1 ~i2~0)), Black: 204#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), 101#true, Black: 86#(and (<= 0 ~j1~0) (<= 1 ~j2~0) (= ~i2~0 0) (<= 1 ~i1~0)), Black: 215#(and (= ~i1~0 0) (<= (+ ~N1~0 ~j1~0) ~M1~0) (<= (+ ~j1~0 1) ~M1~0)), Black: 212#(and (= ~i1~0 0) (<= (+ ~N1~0 ~j1~0) ~M1~0)), 245#true, Black: 93#(and (<= 1 ~j1~0) (= ~j2~0 0) (<= 1 ~i1~0) (<= 1 ~i2~0)), 121#(and (<= 2 ~i1~0) (<= 0 ~j1~0) (<= 1 ~j2~0) (<= 1 ~i2~0)), Black: 220#(and (<= ~M1~0 (+ ~N1~0 ~j1~0)) (= ~i1~0 0)), Black: 224#(and (<= ~M1~0 (+ ~N1~0 ~j1~0)) (= ~i1~0 0) (<= ~M1~0 ~j1~0)), 9#L52true, 235#true, Black: 99#(and (<= 1 ~j1~0) (= ~i1~0 0) (<= 1 ~j2~0) (= ~i2~0 0)), 16#L41true, Black: 229#(and (= ~j2~0 0) (<= ~M1~0 (+ ~M2~0 ~j1~0))), Black: 232#(and (<= 1 ~M2~0) (= ~j2~0 0) (<= ~M1~0 (+ ~M2~0 ~j1~0))), Black: 104#(<= ~counter~0 1), Black: 103#(= ~counter~0 0), 17#L75true, 40#L98-5true, Black: 113#(and (<= 1 ~j1~0) (<= 1 ~j2~0) (= ~i2~0 0) (<= 1 ~i1~0)), Black: 241#(and (= ~i1~0 0) (<= 1 ~N2~0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 239#(and (<= 1 ~N2~0) (= ~i2~0 0)), Black: 237#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 59#(and (= ~i1~0 0) (<= 0 ~j1~0) (= ~j2~0 0) (= ~i2~0 0))]) [2024-06-27 18:04:11,173 INFO L294 olderBase$Statistics]: this new event has 32 ancestors and is cut-off event [2024-06-27 18:04:11,173 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2024-06-27 18:04:11,174 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2024-06-27 18:04:11,174 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2024-06-27 18:04:11,174 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2024-06-27 18:04:11,177 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([385] L67-->L64: Formula: (< v_~j1~0_4 v_~M1~0_2) InVars {~j1~0=v_~j1~0_4, ~M1~0=v_~M1~0_2} OutVars{~j1~0=v_~j1~0_4, ~M1~0=v_~M1~0_2} AuxVars[] AssignedVars[][107], [Black: 64#(and (<= 0 ~j1~0) (= ~j2~0 0) (= ~i2~0 0) (<= 1 ~i1~0)), 33#L64true, Black: 68#(= ~counter~0 0), Black: 171#(and (<= 0 ~j1~0) (<= 0 ~j2~0) (<= 0 ~i2~0) (<= 1 ~i1~0)), Black: 184#(and (<= 2 ~i1~0) (<= 0 ~j1~0) (<= 0 ~j2~0) (<= 0 ~i2~0)), Black: 125#(and (<= 0 ~i1~0) (<= 0 ~j1~0) (<= 0 ~j2~0) (<= 0 ~i2~0)), Black: 188#(and (<= 2 ~i1~0) (<= 0 ~j1~0) (<= 0 ~j2~0) (<= 1 ~i2~0)), Black: 74#(and (<= 0 ~j1~0) (= ~j2~0 0) (<= 1 ~i1~0) (<= 1 ~i2~0)), 218#true, Black: 207#(and (<= ~N1~0 0) (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 204#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 80#(and (<= 1 ~j1~0) (= ~i1~0 0) (= ~j2~0 0) (<= 1 ~i2~0)), 101#true, Black: 86#(and (<= 0 ~j1~0) (<= 1 ~j2~0) (= ~i2~0 0) (<= 1 ~i1~0)), Black: 215#(and (= ~i1~0 0) (<= (+ ~N1~0 ~j1~0) ~M1~0) (<= (+ ~j1~0 1) ~M1~0)), Black: 212#(and (= ~i1~0 0) (<= (+ ~N1~0 ~j1~0) ~M1~0)), 245#true, Black: 93#(and (<= 1 ~j1~0) (= ~j2~0 0) (<= 1 ~i1~0) (<= 1 ~i2~0)), 121#(and (<= 2 ~i1~0) (<= 0 ~j1~0) (<= 1 ~j2~0) (<= 1 ~i2~0)), Black: 220#(and (<= ~M1~0 (+ ~N1~0 ~j1~0)) (= ~i1~0 0)), 9#L52true, Black: 224#(and (<= ~M1~0 (+ ~N1~0 ~j1~0)) (= ~i1~0 0) (<= ~M1~0 ~j1~0)), 235#true, Black: 99#(and (<= 1 ~j1~0) (= ~i1~0 0) (<= 1 ~j2~0) (= ~i2~0 0)), 14#L99true, 16#L41true, Black: 229#(and (= ~j2~0 0) (<= ~M1~0 (+ ~M2~0 ~j1~0))), Black: 232#(and (<= 1 ~M2~0) (= ~j2~0 0) (<= ~M1~0 (+ ~M2~0 ~j1~0))), Black: 104#(<= ~counter~0 1), Black: 103#(= ~counter~0 0), 4#thread4EXITtrue, Black: 241#(and (= ~i1~0 0) (<= 1 ~N2~0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 113#(and (<= 1 ~j1~0) (<= 1 ~j2~0) (= ~i2~0 0) (<= 1 ~i1~0)), Black: 239#(and (<= 1 ~N2~0) (= ~i2~0 0)), Black: 237#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 59#(and (= ~i1~0 0) (<= 0 ~j1~0) (= ~j2~0 0) (= ~i2~0 0))]) [2024-06-27 18:04:11,177 INFO L294 olderBase$Statistics]: this new event has 31 ancestors and is cut-off event [2024-06-27 18:04:11,177 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2024-06-27 18:04:11,177 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2024-06-27 18:04:11,178 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2024-06-27 18:04:11,178 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([385] L67-->L64: Formula: (< v_~j1~0_4 v_~M1~0_2) InVars {~j1~0=v_~j1~0_4, ~M1~0=v_~M1~0_2} OutVars{~j1~0=v_~j1~0_4, ~M1~0=v_~M1~0_2} AuxVars[] AssignedVars[][107], [Black: 64#(and (<= 0 ~j1~0) (= ~j2~0 0) (= ~i2~0 0) (<= 1 ~i1~0)), 33#L64true, Black: 68#(= ~counter~0 0), Black: 171#(and (<= 0 ~j1~0) (<= 0 ~j2~0) (<= 0 ~i2~0) (<= 1 ~i1~0)), Black: 184#(and (<= 2 ~i1~0) (<= 0 ~j1~0) (<= 0 ~j2~0) (<= 0 ~i2~0)), Black: 125#(and (<= 0 ~i1~0) (<= 0 ~j1~0) (<= 0 ~j2~0) (<= 0 ~i2~0)), Black: 188#(and (<= 2 ~i1~0) (<= 0 ~j1~0) (<= 0 ~j2~0) (<= 1 ~i2~0)), Black: 74#(and (<= 0 ~j1~0) (= ~j2~0 0) (<= 1 ~i1~0) (<= 1 ~i2~0)), 218#true, Black: 207#(and (<= ~N1~0 0) (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 204#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 80#(and (<= 1 ~j1~0) (= ~i1~0 0) (= ~j2~0 0) (<= 1 ~i2~0)), 101#true, Black: 86#(and (<= 0 ~j1~0) (<= 1 ~j2~0) (= ~i2~0 0) (<= 1 ~i1~0)), Black: 215#(and (= ~i1~0 0) (<= (+ ~N1~0 ~j1~0) ~M1~0) (<= (+ ~j1~0 1) ~M1~0)), Black: 212#(and (= ~i1~0 0) (<= (+ ~N1~0 ~j1~0) ~M1~0)), 245#true, Black: 93#(and (<= 1 ~j1~0) (= ~j2~0 0) (<= 1 ~i1~0) (<= 1 ~i2~0)), 121#(and (<= 2 ~i1~0) (<= 0 ~j1~0) (<= 1 ~j2~0) (<= 1 ~i2~0)), Black: 220#(and (<= ~M1~0 (+ ~N1~0 ~j1~0)) (= ~i1~0 0)), Black: 224#(and (<= ~M1~0 (+ ~N1~0 ~j1~0)) (= ~i1~0 0) (<= ~M1~0 ~j1~0)), 9#L52true, 235#true, Black: 99#(and (<= 1 ~j1~0) (= ~i1~0 0) (<= 1 ~j2~0) (= ~i2~0 0)), 14#L99true, 16#L41true, Black: 229#(and (= ~j2~0 0) (<= ~M1~0 (+ ~M2~0 ~j1~0))), Black: 232#(and (<= 1 ~M2~0) (= ~j2~0 0) (<= ~M1~0 (+ ~M2~0 ~j1~0))), Black: 104#(<= ~counter~0 1), Black: 103#(= ~counter~0 0), 17#L75true, Black: 241#(and (= ~i1~0 0) (<= 1 ~N2~0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 113#(and (<= 1 ~j1~0) (<= 1 ~j2~0) (= ~i2~0 0) (<= 1 ~i1~0)), Black: 239#(and (<= 1 ~N2~0) (= ~i2~0 0)), Black: 237#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 59#(and (= ~i1~0 0) (<= 0 ~j1~0) (= ~j2~0 0) (= ~i2~0 0))]) [2024-06-27 18:04:11,178 INFO L294 olderBase$Statistics]: this new event has 31 ancestors and is cut-off event [2024-06-27 18:04:11,178 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2024-06-27 18:04:11,178 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2024-06-27 18:04:11,178 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2024-06-27 18:04:11,681 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([385] L67-->L64: Formula: (< v_~j1~0_4 v_~M1~0_2) InVars {~j1~0=v_~j1~0_4, ~M1~0=v_~M1~0_2} OutVars{~j1~0=v_~j1~0_4, ~M1~0=v_~M1~0_2} AuxVars[] AssignedVars[][107], [Black: 64#(and (<= 0 ~j1~0) (= ~j2~0 0) (= ~i2~0 0) (<= 1 ~i1~0)), 33#L64true, Black: 68#(= ~counter~0 0), Black: 171#(and (<= 0 ~j1~0) (<= 0 ~j2~0) (<= 0 ~i2~0) (<= 1 ~i1~0)), Black: 184#(and (<= 2 ~i1~0) (<= 0 ~j1~0) (<= 0 ~j2~0) (<= 0 ~i2~0)), Black: 125#(and (<= 0 ~i1~0) (<= 0 ~j1~0) (<= 0 ~j2~0) (<= 0 ~i2~0)), Black: 188#(and (<= 2 ~i1~0) (<= 0 ~j1~0) (<= 0 ~j2~0) (<= 1 ~i2~0)), Black: 74#(and (<= 0 ~j1~0) (= ~j2~0 0) (<= 1 ~i1~0) (<= 1 ~i2~0)), 218#true, Black: 207#(and (<= ~N1~0 0) (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 204#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 80#(and (<= 1 ~j1~0) (= ~i1~0 0) (= ~j2~0 0) (<= 1 ~i2~0)), 101#true, Black: 86#(and (<= 0 ~j1~0) (<= 1 ~j2~0) (= ~i2~0 0) (<= 1 ~i1~0)), Black: 215#(and (= ~i1~0 0) (<= (+ ~N1~0 ~j1~0) ~M1~0) (<= (+ ~j1~0 1) ~M1~0)), Black: 212#(and (= ~i1~0 0) (<= (+ ~N1~0 ~j1~0) ~M1~0)), 245#true, Black: 93#(and (<= 1 ~j1~0) (= ~j2~0 0) (<= 1 ~i1~0) (<= 1 ~i2~0)), 121#(and (<= 2 ~i1~0) (<= 0 ~j1~0) (<= 1 ~j2~0) (<= 1 ~i2~0)), Black: 220#(and (<= ~M1~0 (+ ~N1~0 ~j1~0)) (= ~i1~0 0)), Black: 224#(and (<= ~M1~0 (+ ~N1~0 ~j1~0)) (= ~i1~0 0) (<= ~M1~0 ~j1~0)), 235#true, Black: 99#(and (<= 1 ~j1~0) (= ~i1~0 0) (<= 1 ~j2~0) (= ~i2~0 0)), 14#L99true, 16#L41true, Black: 229#(and (= ~j2~0 0) (<= ~M1~0 (+ ~M2~0 ~j1~0))), Black: 232#(and (<= 1 ~M2~0) (= ~j2~0 0) (<= ~M1~0 (+ ~M2~0 ~j1~0))), Black: 104#(<= ~counter~0 1), Black: 103#(= ~counter~0 0), 4#thread4EXITtrue, Black: 113#(and (<= 1 ~j1~0) (<= 1 ~j2~0) (= ~i2~0 0) (<= 1 ~i1~0)), Black: 241#(and (= ~i1~0 0) (<= 1 ~N2~0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 239#(and (<= 1 ~N2~0) (= ~i2~0 0)), Black: 237#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), 13#thread2EXITtrue, Black: 59#(and (= ~i1~0 0) (<= 0 ~j1~0) (= ~j2~0 0) (= ~i2~0 0))]) [2024-06-27 18:04:11,681 INFO L294 olderBase$Statistics]: this new event has 33 ancestors and is cut-off event [2024-06-27 18:04:11,681 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2024-06-27 18:04:11,682 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2024-06-27 18:04:11,682 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2024-06-27 18:04:11,682 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([385] L67-->L64: Formula: (< v_~j1~0_4 v_~M1~0_2) InVars {~j1~0=v_~j1~0_4, ~M1~0=v_~M1~0_2} OutVars{~j1~0=v_~j1~0_4, ~M1~0=v_~M1~0_2} AuxVars[] AssignedVars[][107], [Black: 64#(and (<= 0 ~j1~0) (= ~j2~0 0) (= ~i2~0 0) (<= 1 ~i1~0)), 33#L64true, Black: 68#(= ~counter~0 0), Black: 171#(and (<= 0 ~j1~0) (<= 0 ~j2~0) (<= 0 ~i2~0) (<= 1 ~i1~0)), Black: 184#(and (<= 2 ~i1~0) (<= 0 ~j1~0) (<= 0 ~j2~0) (<= 0 ~i2~0)), Black: 125#(and (<= 0 ~i1~0) (<= 0 ~j1~0) (<= 0 ~j2~0) (<= 0 ~i2~0)), Black: 188#(and (<= 2 ~i1~0) (<= 0 ~j1~0) (<= 0 ~j2~0) (<= 1 ~i2~0)), Black: 74#(and (<= 0 ~j1~0) (= ~j2~0 0) (<= 1 ~i1~0) (<= 1 ~i2~0)), 218#true, Black: 207#(and (<= ~N1~0 0) (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 204#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 80#(and (<= 1 ~j1~0) (= ~i1~0 0) (= ~j2~0 0) (<= 1 ~i2~0)), 101#true, Black: 86#(and (<= 0 ~j1~0) (<= 1 ~j2~0) (= ~i2~0 0) (<= 1 ~i1~0)), Black: 215#(and (= ~i1~0 0) (<= (+ ~N1~0 ~j1~0) ~M1~0) (<= (+ ~j1~0 1) ~M1~0)), Black: 212#(and (= ~i1~0 0) (<= (+ ~N1~0 ~j1~0) ~M1~0)), 245#true, Black: 93#(and (<= 1 ~j1~0) (= ~j2~0 0) (<= 1 ~i1~0) (<= 1 ~i2~0)), 121#(and (<= 2 ~i1~0) (<= 0 ~j1~0) (<= 1 ~j2~0) (<= 1 ~i2~0)), Black: 220#(and (<= ~M1~0 (+ ~N1~0 ~j1~0)) (= ~i1~0 0)), Black: 224#(and (<= ~M1~0 (+ ~N1~0 ~j1~0)) (= ~i1~0 0) (<= ~M1~0 ~j1~0)), 235#true, Black: 99#(and (<= 1 ~j1~0) (= ~i1~0 0) (<= 1 ~j2~0) (= ~i2~0 0)), 14#L99true, 16#L41true, Black: 229#(and (= ~j2~0 0) (<= ~M1~0 (+ ~M2~0 ~j1~0))), Black: 232#(and (<= 1 ~M2~0) (= ~j2~0 0) (<= ~M1~0 (+ ~M2~0 ~j1~0))), Black: 104#(<= ~counter~0 1), Black: 103#(= ~counter~0 0), 17#L75true, Black: 113#(and (<= 1 ~j1~0) (<= 1 ~j2~0) (= ~i2~0 0) (<= 1 ~i1~0)), Black: 241#(and (= ~i1~0 0) (<= 1 ~N2~0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 239#(and (<= 1 ~N2~0) (= ~i2~0 0)), Black: 237#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), 13#thread2EXITtrue, Black: 59#(and (= ~i1~0 0) (<= 0 ~j1~0) (= ~j2~0 0) (= ~i2~0 0))]) [2024-06-27 18:04:11,682 INFO L294 olderBase$Statistics]: this new event has 33 ancestors and is cut-off event [2024-06-27 18:04:11,682 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2024-06-27 18:04:11,682 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2024-06-27 18:04:11,682 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2024-06-27 18:04:11,689 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([385] L67-->L64: Formula: (< v_~j1~0_4 v_~M1~0_2) InVars {~j1~0=v_~j1~0_4, ~M1~0=v_~M1~0_2} OutVars{~j1~0=v_~j1~0_4, ~M1~0=v_~M1~0_2} AuxVars[] AssignedVars[][107], [Black: 64#(and (<= 0 ~j1~0) (= ~j2~0 0) (= ~i2~0 0) (<= 1 ~i1~0)), 33#L64true, Black: 68#(= ~counter~0 0), Black: 171#(and (<= 0 ~j1~0) (<= 0 ~j2~0) (<= 0 ~i2~0) (<= 1 ~i1~0)), Black: 184#(and (<= 2 ~i1~0) (<= 0 ~j1~0) (<= 0 ~j2~0) (<= 0 ~i2~0)), Black: 125#(and (<= 0 ~i1~0) (<= 0 ~j1~0) (<= 0 ~j2~0) (<= 0 ~i2~0)), Black: 74#(and (<= 0 ~j1~0) (= ~j2~0 0) (<= 1 ~i1~0) (<= 1 ~i2~0)), 218#true, Black: 207#(and (<= ~N1~0 0) (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 80#(and (<= 1 ~j1~0) (= ~i1~0 0) (= ~j2~0 0) (<= 1 ~i2~0)), Black: 204#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), 101#true, Black: 86#(and (<= 0 ~j1~0) (<= 1 ~j2~0) (= ~i2~0 0) (<= 1 ~i1~0)), Black: 215#(and (= ~i1~0 0) (<= (+ ~N1~0 ~j1~0) ~M1~0) (<= (+ ~j1~0 1) ~M1~0)), Black: 212#(and (= ~i1~0 0) (<= (+ ~N1~0 ~j1~0) ~M1~0)), 245#true, Black: 93#(and (<= 1 ~j1~0) (= ~j2~0 0) (<= 1 ~i1~0) (<= 1 ~i2~0)), 188#(and (<= 2 ~i1~0) (<= 0 ~j1~0) (<= 0 ~j2~0) (<= 1 ~i2~0)), Black: 220#(and (<= ~M1~0 (+ ~N1~0 ~j1~0)) (= ~i1~0 0)), Black: 224#(and (<= ~M1~0 (+ ~N1~0 ~j1~0)) (= ~i1~0 0) (<= ~M1~0 ~j1~0)), 235#true, Black: 99#(and (<= 1 ~j1~0) (= ~i1~0 0) (<= 1 ~j2~0) (= ~i2~0 0)), 14#L99true, 16#L41true, Black: 229#(and (= ~j2~0 0) (<= ~M1~0 (+ ~M2~0 ~j1~0))), Black: 232#(and (<= 1 ~M2~0) (= ~j2~0 0) (<= ~M1~0 (+ ~M2~0 ~j1~0))), Black: 104#(<= ~counter~0 1), Black: 103#(= ~counter~0 0), 4#thread4EXITtrue, Black: 241#(and (= ~i1~0 0) (<= 1 ~N2~0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 113#(and (<= 1 ~j1~0) (<= 1 ~j2~0) (= ~i2~0 0) (<= 1 ~i1~0)), Black: 239#(and (<= 1 ~N2~0) (= ~i2~0 0)), Black: 237#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), 13#thread2EXITtrue, Black: 59#(and (= ~i1~0 0) (<= 0 ~j1~0) (= ~j2~0 0) (= ~i2~0 0))]) [2024-06-27 18:04:11,689 INFO L294 olderBase$Statistics]: this new event has 33 ancestors and is cut-off event [2024-06-27 18:04:11,689 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2024-06-27 18:04:11,689 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2024-06-27 18:04:11,690 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2024-06-27 18:04:11,690 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([385] L67-->L64: Formula: (< v_~j1~0_4 v_~M1~0_2) InVars {~j1~0=v_~j1~0_4, ~M1~0=v_~M1~0_2} OutVars{~j1~0=v_~j1~0_4, ~M1~0=v_~M1~0_2} AuxVars[] AssignedVars[][107], [Black: 64#(and (<= 0 ~j1~0) (= ~j2~0 0) (= ~i2~0 0) (<= 1 ~i1~0)), 33#L64true, Black: 68#(= ~counter~0 0), Black: 171#(and (<= 0 ~j1~0) (<= 0 ~j2~0) (<= 0 ~i2~0) (<= 1 ~i1~0)), Black: 184#(and (<= 2 ~i1~0) (<= 0 ~j1~0) (<= 0 ~j2~0) (<= 0 ~i2~0)), Black: 125#(and (<= 0 ~i1~0) (<= 0 ~j1~0) (<= 0 ~j2~0) (<= 0 ~i2~0)), Black: 74#(and (<= 0 ~j1~0) (= ~j2~0 0) (<= 1 ~i1~0) (<= 1 ~i2~0)), 218#true, Black: 207#(and (<= ~N1~0 0) (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 80#(and (<= 1 ~j1~0) (= ~i1~0 0) (= ~j2~0 0) (<= 1 ~i2~0)), Black: 204#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), 101#true, Black: 86#(and (<= 0 ~j1~0) (<= 1 ~j2~0) (= ~i2~0 0) (<= 1 ~i1~0)), Black: 215#(and (= ~i1~0 0) (<= (+ ~N1~0 ~j1~0) ~M1~0) (<= (+ ~j1~0 1) ~M1~0)), Black: 212#(and (= ~i1~0 0) (<= (+ ~N1~0 ~j1~0) ~M1~0)), 245#true, Black: 93#(and (<= 1 ~j1~0) (= ~j2~0 0) (<= 1 ~i1~0) (<= 1 ~i2~0)), 188#(and (<= 2 ~i1~0) (<= 0 ~j1~0) (<= 0 ~j2~0) (<= 1 ~i2~0)), Black: 220#(and (<= ~M1~0 (+ ~N1~0 ~j1~0)) (= ~i1~0 0)), Black: 224#(and (<= ~M1~0 (+ ~N1~0 ~j1~0)) (= ~i1~0 0) (<= ~M1~0 ~j1~0)), 235#true, Black: 99#(and (<= 1 ~j1~0) (= ~i1~0 0) (<= 1 ~j2~0) (= ~i2~0 0)), 14#L99true, 16#L41true, Black: 229#(and (= ~j2~0 0) (<= ~M1~0 (+ ~M2~0 ~j1~0))), Black: 232#(and (<= 1 ~M2~0) (= ~j2~0 0) (<= ~M1~0 (+ ~M2~0 ~j1~0))), Black: 104#(<= ~counter~0 1), Black: 103#(= ~counter~0 0), 17#L75true, Black: 241#(and (= ~i1~0 0) (<= 1 ~N2~0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 113#(and (<= 1 ~j1~0) (<= 1 ~j2~0) (= ~i2~0 0) (<= 1 ~i1~0)), Black: 239#(and (<= 1 ~N2~0) (= ~i2~0 0)), Black: 237#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), 13#thread2EXITtrue, Black: 59#(and (= ~i1~0 0) (<= 0 ~j1~0) (= ~j2~0 0) (= ~i2~0 0))]) [2024-06-27 18:04:11,690 INFO L294 olderBase$Statistics]: this new event has 33 ancestors and is cut-off event [2024-06-27 18:04:11,690 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2024-06-27 18:04:11,690 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2024-06-27 18:04:11,690 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2024-06-27 18:04:11,697 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([385] L67-->L64: Formula: (< v_~j1~0_4 v_~M1~0_2) InVars {~j1~0=v_~j1~0_4, ~M1~0=v_~M1~0_2} OutVars{~j1~0=v_~j1~0_4, ~M1~0=v_~M1~0_2} AuxVars[] AssignedVars[][41], [Black: 64#(and (<= 0 ~j1~0) (= ~j2~0 0) (= ~i2~0 0) (<= 1 ~i1~0)), 33#L64true, 247#(and (= ~j2~0 0) (<= ~M1~0 (+ ~M2~0 ~j1~0))), Black: 68#(= ~counter~0 0), Black: 171#(and (<= 0 ~j1~0) (<= 0 ~j2~0) (<= 0 ~i2~0) (<= 1 ~i1~0)), Black: 184#(and (<= 2 ~i1~0) (<= 0 ~j1~0) (<= 0 ~j2~0) (<= 0 ~i2~0)), Black: 125#(and (<= 0 ~i1~0) (<= 0 ~j1~0) (<= 0 ~j2~0) (<= 0 ~i2~0)), 218#true, Black: 207#(and (<= ~N1~0 0) (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 80#(and (<= 1 ~j1~0) (= ~i1~0 0) (= ~j2~0 0) (<= 1 ~i2~0)), Black: 204#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 86#(and (<= 0 ~j1~0) (<= 1 ~j2~0) (= ~i2~0 0) (<= 1 ~i1~0)), Black: 215#(and (= ~i1~0 0) (<= (+ ~N1~0 ~j1~0) ~M1~0) (<= (+ ~j1~0 1) ~M1~0)), Black: 212#(and (= ~i1~0 0) (<= (+ ~N1~0 ~j1~0) ~M1~0)), 103#(= ~counter~0 0), Black: 93#(and (<= 1 ~j1~0) (= ~j2~0 0) (<= 1 ~i1~0) (<= 1 ~i2~0)), 188#(and (<= 2 ~i1~0) (<= 0 ~j1~0) (<= 0 ~j2~0) (<= 1 ~i2~0)), 232#(and (<= 1 ~M2~0) (= ~j2~0 0) (<= ~M1~0 (+ ~M2~0 ~j1~0))), Black: 220#(and (<= ~M1~0 (+ ~N1~0 ~j1~0)) (= ~i1~0 0)), Black: 224#(and (<= ~M1~0 (+ ~N1~0 ~j1~0)) (= ~i1~0 0) (<= ~M1~0 ~j1~0)), 235#true, Black: 99#(and (<= 1 ~j1~0) (= ~i1~0 0) (<= 1 ~j2~0) (= ~i2~0 0)), 16#L41true, Black: 229#(and (= ~j2~0 0) (<= ~M1~0 (+ ~M2~0 ~j1~0))), Black: 104#(<= ~counter~0 1), 17#L75true, 40#L98-5true, Black: 241#(and (= ~i1~0 0) (<= 1 ~N2~0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 113#(and (<= 1 ~j1~0) (<= 1 ~j2~0) (= ~i2~0 0) (<= 1 ~i1~0)), Black: 239#(and (<= 1 ~N2~0) (= ~i2~0 0)), 74#(and (<= 0 ~j1~0) (= ~j2~0 0) (<= 1 ~i1~0) (<= 1 ~i2~0)), Black: 237#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), 13#thread2EXITtrue, Black: 59#(and (= ~i1~0 0) (<= 0 ~j1~0) (= ~j2~0 0) (= ~i2~0 0))]) [2024-06-27 18:04:11,697 INFO L294 olderBase$Statistics]: this new event has 32 ancestors and is cut-off event [2024-06-27 18:04:11,697 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2024-06-27 18:04:11,697 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2024-06-27 18:04:11,697 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2024-06-27 18:04:11,698 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([385] L67-->L64: Formula: (< v_~j1~0_4 v_~M1~0_2) InVars {~j1~0=v_~j1~0_4, ~M1~0=v_~M1~0_2} OutVars{~j1~0=v_~j1~0_4, ~M1~0=v_~M1~0_2} AuxVars[] AssignedVars[][41], [Black: 64#(and (<= 0 ~j1~0) (= ~j2~0 0) (= ~i2~0 0) (<= 1 ~i1~0)), 247#(and (= ~j2~0 0) (<= ~M1~0 (+ ~M2~0 ~j1~0))), 33#L64true, Black: 68#(= ~counter~0 0), Black: 171#(and (<= 0 ~j1~0) (<= 0 ~j2~0) (<= 0 ~i2~0) (<= 1 ~i1~0)), Black: 184#(and (<= 2 ~i1~0) (<= 0 ~j1~0) (<= 0 ~j2~0) (<= 0 ~i2~0)), Black: 125#(and (<= 0 ~i1~0) (<= 0 ~j1~0) (<= 0 ~j2~0) (<= 0 ~i2~0)), 218#true, Black: 207#(and (<= ~N1~0 0) (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 80#(and (<= 1 ~j1~0) (= ~i1~0 0) (= ~j2~0 0) (<= 1 ~i2~0)), Black: 204#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 86#(and (<= 0 ~j1~0) (<= 1 ~j2~0) (= ~i2~0 0) (<= 1 ~i1~0)), Black: 215#(and (= ~i1~0 0) (<= (+ ~N1~0 ~j1~0) ~M1~0) (<= (+ ~j1~0 1) ~M1~0)), Black: 212#(and (= ~i1~0 0) (<= (+ ~N1~0 ~j1~0) ~M1~0)), 103#(= ~counter~0 0), Black: 93#(and (<= 1 ~j1~0) (= ~j2~0 0) (<= 1 ~i1~0) (<= 1 ~i2~0)), 188#(and (<= 2 ~i1~0) (<= 0 ~j1~0) (<= 0 ~j2~0) (<= 1 ~i2~0)), 232#(and (<= 1 ~M2~0) (= ~j2~0 0) (<= ~M1~0 (+ ~M2~0 ~j1~0))), Black: 220#(and (<= ~M1~0 (+ ~N1~0 ~j1~0)) (= ~i1~0 0)), Black: 224#(and (<= ~M1~0 (+ ~N1~0 ~j1~0)) (= ~i1~0 0) (<= ~M1~0 ~j1~0)), 8#L56true, 235#true, Black: 99#(and (<= 1 ~j1~0) (= ~i1~0 0) (<= 1 ~j2~0) (= ~i2~0 0)), 14#L99true, 16#L41true, Black: 229#(and (= ~j2~0 0) (<= ~M1~0 (+ ~M2~0 ~j1~0))), Black: 104#(<= ~counter~0 1), 17#L75true, Black: 241#(and (= ~i1~0 0) (<= 1 ~N2~0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 113#(and (<= 1 ~j1~0) (<= 1 ~j2~0) (= ~i2~0 0) (<= 1 ~i1~0)), Black: 239#(and (<= 1 ~N2~0) (= ~i2~0 0)), 74#(and (<= 0 ~j1~0) (= ~j2~0 0) (<= 1 ~i1~0) (<= 1 ~i2~0)), Black: 237#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 59#(and (= ~i1~0 0) (<= 0 ~j1~0) (= ~j2~0 0) (= ~i2~0 0))]) [2024-06-27 18:04:11,698 INFO L294 olderBase$Statistics]: this new event has 32 ancestors and is cut-off event [2024-06-27 18:04:11,698 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2024-06-27 18:04:11,698 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2024-06-27 18:04:11,698 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2024-06-27 18:04:11,701 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([385] L67-->L64: Formula: (< v_~j1~0_4 v_~M1~0_2) InVars {~j1~0=v_~j1~0_4, ~M1~0=v_~M1~0_2} OutVars{~j1~0=v_~j1~0_4, ~M1~0=v_~M1~0_2} AuxVars[] AssignedVars[][107], [Black: 64#(and (<= 0 ~j1~0) (= ~j2~0 0) (= ~i2~0 0) (<= 1 ~i1~0)), 33#L64true, Black: 68#(= ~counter~0 0), Black: 171#(and (<= 0 ~j1~0) (<= 0 ~j2~0) (<= 0 ~i2~0) (<= 1 ~i1~0)), Black: 184#(and (<= 2 ~i1~0) (<= 0 ~j1~0) (<= 0 ~j2~0) (<= 0 ~i2~0)), Black: 125#(and (<= 0 ~i1~0) (<= 0 ~j1~0) (<= 0 ~j2~0) (<= 0 ~i2~0)), Black: 188#(and (<= 2 ~i1~0) (<= 0 ~j1~0) (<= 0 ~j2~0) (<= 1 ~i2~0)), Black: 74#(and (<= 0 ~j1~0) (= ~j2~0 0) (<= 1 ~i1~0) (<= 1 ~i2~0)), 218#true, Black: 207#(and (<= ~N1~0 0) (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 204#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 80#(and (<= 1 ~j1~0) (= ~i1~0 0) (= ~j2~0 0) (<= 1 ~i2~0)), 101#true, Black: 86#(and (<= 0 ~j1~0) (<= 1 ~j2~0) (= ~i2~0 0) (<= 1 ~i1~0)), Black: 215#(and (= ~i1~0 0) (<= (+ ~N1~0 ~j1~0) ~M1~0) (<= (+ ~j1~0 1) ~M1~0)), Black: 212#(and (= ~i1~0 0) (<= (+ ~N1~0 ~j1~0) ~M1~0)), 245#true, Black: 93#(and (<= 1 ~j1~0) (= ~j2~0 0) (<= 1 ~i1~0) (<= 1 ~i2~0)), 121#(and (<= 2 ~i1~0) (<= 0 ~j1~0) (<= 1 ~j2~0) (<= 1 ~i2~0)), Black: 220#(and (<= ~M1~0 (+ ~N1~0 ~j1~0)) (= ~i1~0 0)), Black: 224#(and (<= ~M1~0 (+ ~N1~0 ~j1~0)) (= ~i1~0 0) (<= ~M1~0 ~j1~0)), 9#L52true, 235#true, Black: 99#(and (<= 1 ~j1~0) (= ~i1~0 0) (<= 1 ~j2~0) (= ~i2~0 0)), 14#L99true, 16#L41true, Black: 229#(and (= ~j2~0 0) (<= ~M1~0 (+ ~M2~0 ~j1~0))), Black: 232#(and (<= 1 ~M2~0) (= ~j2~0 0) (<= ~M1~0 (+ ~M2~0 ~j1~0))), Black: 104#(<= ~counter~0 1), Black: 103#(= ~counter~0 0), 4#thread4EXITtrue, Black: 113#(and (<= 1 ~j1~0) (<= 1 ~j2~0) (= ~i2~0 0) (<= 1 ~i1~0)), Black: 241#(and (= ~i1~0 0) (<= 1 ~N2~0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 239#(and (<= 1 ~N2~0) (= ~i2~0 0)), Black: 237#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 59#(and (= ~i1~0 0) (<= 0 ~j1~0) (= ~j2~0 0) (= ~i2~0 0))]) [2024-06-27 18:04:11,701 INFO L294 olderBase$Statistics]: this new event has 33 ancestors and is cut-off event [2024-06-27 18:04:11,701 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2024-06-27 18:04:11,701 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2024-06-27 18:04:11,701 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2024-06-27 18:04:11,701 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2024-06-27 18:04:11,701 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([385] L67-->L64: Formula: (< v_~j1~0_4 v_~M1~0_2) InVars {~j1~0=v_~j1~0_4, ~M1~0=v_~M1~0_2} OutVars{~j1~0=v_~j1~0_4, ~M1~0=v_~M1~0_2} AuxVars[] AssignedVars[][107], [Black: 64#(and (<= 0 ~j1~0) (= ~j2~0 0) (= ~i2~0 0) (<= 1 ~i1~0)), 33#L64true, Black: 68#(= ~counter~0 0), Black: 171#(and (<= 0 ~j1~0) (<= 0 ~j2~0) (<= 0 ~i2~0) (<= 1 ~i1~0)), Black: 184#(and (<= 2 ~i1~0) (<= 0 ~j1~0) (<= 0 ~j2~0) (<= 0 ~i2~0)), Black: 125#(and (<= 0 ~i1~0) (<= 0 ~j1~0) (<= 0 ~j2~0) (<= 0 ~i2~0)), Black: 188#(and (<= 2 ~i1~0) (<= 0 ~j1~0) (<= 0 ~j2~0) (<= 1 ~i2~0)), Black: 74#(and (<= 0 ~j1~0) (= ~j2~0 0) (<= 1 ~i1~0) (<= 1 ~i2~0)), 218#true, Black: 207#(and (<= ~N1~0 0) (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 204#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 80#(and (<= 1 ~j1~0) (= ~i1~0 0) (= ~j2~0 0) (<= 1 ~i2~0)), 101#true, Black: 86#(and (<= 0 ~j1~0) (<= 1 ~j2~0) (= ~i2~0 0) (<= 1 ~i1~0)), Black: 215#(and (= ~i1~0 0) (<= (+ ~N1~0 ~j1~0) ~M1~0) (<= (+ ~j1~0 1) ~M1~0)), Black: 212#(and (= ~i1~0 0) (<= (+ ~N1~0 ~j1~0) ~M1~0)), 245#true, Black: 93#(and (<= 1 ~j1~0) (= ~j2~0 0) (<= 1 ~i1~0) (<= 1 ~i2~0)), 121#(and (<= 2 ~i1~0) (<= 0 ~j1~0) (<= 1 ~j2~0) (<= 1 ~i2~0)), Black: 220#(and (<= ~M1~0 (+ ~N1~0 ~j1~0)) (= ~i1~0 0)), Black: 224#(and (<= ~M1~0 (+ ~N1~0 ~j1~0)) (= ~i1~0 0) (<= ~M1~0 ~j1~0)), 9#L52true, 235#true, Black: 99#(and (<= 1 ~j1~0) (= ~i1~0 0) (<= 1 ~j2~0) (= ~i2~0 0)), 14#L99true, 16#L41true, Black: 229#(and (= ~j2~0 0) (<= ~M1~0 (+ ~M2~0 ~j1~0))), Black: 104#(<= ~counter~0 1), Black: 232#(and (<= 1 ~M2~0) (= ~j2~0 0) (<= ~M1~0 (+ ~M2~0 ~j1~0))), Black: 103#(= ~counter~0 0), 17#L75true, Black: 113#(and (<= 1 ~j1~0) (<= 1 ~j2~0) (= ~i2~0 0) (<= 1 ~i1~0)), Black: 241#(and (= ~i1~0 0) (<= 1 ~N2~0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 239#(and (<= 1 ~N2~0) (= ~i2~0 0)), Black: 237#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 59#(and (= ~i1~0 0) (<= 0 ~j1~0) (= ~j2~0 0) (= ~i2~0 0))]) [2024-06-27 18:04:11,701 INFO L294 olderBase$Statistics]: this new event has 33 ancestors and is cut-off event [2024-06-27 18:04:11,702 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2024-06-27 18:04:11,702 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2024-06-27 18:04:11,702 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2024-06-27 18:04:11,702 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2024-06-27 18:04:11,814 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([385] L67-->L64: Formula: (< v_~j1~0_4 v_~M1~0_2) InVars {~j1~0=v_~j1~0_4, ~M1~0=v_~M1~0_2} OutVars{~j1~0=v_~j1~0_4, ~M1~0=v_~M1~0_2} AuxVars[] AssignedVars[][41], [Black: 64#(and (<= 0 ~j1~0) (= ~j2~0 0) (= ~i2~0 0) (<= 1 ~i1~0)), 33#L64true, 247#(and (= ~j2~0 0) (<= ~M1~0 (+ ~M2~0 ~j1~0))), Black: 68#(= ~counter~0 0), Black: 171#(and (<= 0 ~j1~0) (<= 0 ~j2~0) (<= 0 ~i2~0) (<= 1 ~i1~0)), Black: 184#(and (<= 2 ~i1~0) (<= 0 ~j1~0) (<= 0 ~j2~0) (<= 0 ~i2~0)), Black: 125#(and (<= 0 ~i1~0) (<= 0 ~j1~0) (<= 0 ~j2~0) (<= 0 ~i2~0)), 218#true, Black: 207#(and (<= ~N1~0 0) (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 204#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 80#(and (<= 1 ~j1~0) (= ~i1~0 0) (= ~j2~0 0) (<= 1 ~i2~0)), Black: 86#(and (<= 0 ~j1~0) (<= 1 ~j2~0) (= ~i2~0 0) (<= 1 ~i1~0)), Black: 215#(and (= ~i1~0 0) (<= (+ ~N1~0 ~j1~0) ~M1~0) (<= (+ ~j1~0 1) ~M1~0)), Black: 212#(and (= ~i1~0 0) (<= (+ ~N1~0 ~j1~0) ~M1~0)), 103#(= ~counter~0 0), Black: 93#(and (<= 1 ~j1~0) (= ~j2~0 0) (<= 1 ~i1~0) (<= 1 ~i2~0)), 188#(and (<= 2 ~i1~0) (<= 0 ~j1~0) (<= 0 ~j2~0) (<= 1 ~i2~0)), 232#(and (<= 1 ~M2~0) (= ~j2~0 0) (<= ~M1~0 (+ ~M2~0 ~j1~0))), Black: 220#(and (<= ~M1~0 (+ ~N1~0 ~j1~0)) (= ~i1~0 0)), Black: 224#(and (<= ~M1~0 (+ ~N1~0 ~j1~0)) (= ~i1~0 0) (<= ~M1~0 ~j1~0)), 235#true, Black: 99#(and (<= 1 ~j1~0) (= ~i1~0 0) (<= 1 ~j2~0) (= ~i2~0 0)), 14#L99true, 16#L41true, Black: 229#(and (= ~j2~0 0) (<= ~M1~0 (+ ~M2~0 ~j1~0))), Black: 104#(<= ~counter~0 1), 17#L75true, Black: 241#(and (= ~i1~0 0) (<= 1 ~N2~0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 113#(and (<= 1 ~j1~0) (<= 1 ~j2~0) (= ~i2~0 0) (<= 1 ~i1~0)), Black: 239#(and (<= 1 ~N2~0) (= ~i2~0 0)), 74#(and (<= 0 ~j1~0) (= ~j2~0 0) (<= 1 ~i1~0) (<= 1 ~i2~0)), Black: 237#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), 13#thread2EXITtrue, Black: 59#(and (= ~i1~0 0) (<= 0 ~j1~0) (= ~j2~0 0) (= ~i2~0 0))]) [2024-06-27 18:04:11,815 INFO L294 olderBase$Statistics]: this new event has 33 ancestors and is cut-off event [2024-06-27 18:04:11,815 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2024-06-27 18:04:11,815 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2024-06-27 18:04:11,815 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2024-06-27 18:04:11,986 INFO L124 PetriNetUnfolderBase]: 27902/38705 cut-off events. [2024-06-27 18:04:11,986 INFO L125 PetriNetUnfolderBase]: For 317288/321929 co-relation queries the response was YES. [2024-06-27 18:04:12,198 INFO L83 FinitePrefix]: Finished finitePrefix Result has 196811 conditions, 38705 events. 27902/38705 cut-off events. For 317288/321929 co-relation queries the response was YES. Maximal size of possible extension queue 1757. Compared 248808 event pairs, 7107 based on Foata normal form. 351/37761 useless extension candidates. Maximal degree in co-relation 149257. Up to 20065 conditions per place. [2024-06-27 18:04:12,371 INFO L140 encePairwiseOnDemand]: 40/45 looper letters, 150 selfloop transitions, 33 changer transitions 5/201 dead transitions. [2024-06-27 18:04:12,372 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 201 transitions, 2829 flow [2024-06-27 18:04:12,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-06-27 18:04:12,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-06-27 18:04:12,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 126 transitions. [2024-06-27 18:04:12,373 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7 [2024-06-27 18:04:12,373 INFO L175 Difference]: Start difference. First operand has 92 places, 121 transitions, 1560 flow. Second operand 4 states and 126 transitions. [2024-06-27 18:04:12,373 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 95 places, 201 transitions, 2829 flow [2024-06-27 18:04:12,792 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 93 places, 201 transitions, 2775 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-06-27 18:04:12,794 INFO L231 Difference]: Finished difference. Result has 95 places, 138 transitions, 1858 flow [2024-06-27 18:04:12,794 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=1517, PETRI_DIFFERENCE_MINUEND_PLACES=90, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=121, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=102, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1858, PETRI_PLACES=95, PETRI_TRANSITIONS=138} [2024-06-27 18:04:12,795 INFO L281 CegarLoopForPetriNet]: 49 programPoint places, 46 predicate places. [2024-06-27 18:04:12,795 INFO L495 AbstractCegarLoop]: Abstraction has has 95 places, 138 transitions, 1858 flow [2024-06-27 18:04:12,795 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.75) internal successors, (91), 4 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:04:12,795 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:04:12,795 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 18:04:12,796 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-06-27 18:04:12,796 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 18:04:12,796 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:04:12,796 INFO L85 PathProgramCache]: Analyzing trace with hash -1526405031, now seen corresponding path program 1 times [2024-06-27 18:04:12,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:04:12,797 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1443882569] [2024-06-27 18:04:12,797 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:04:12,797 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:04:12,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:04:12,870 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 18:04:12,871 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:04:12,871 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1443882569] [2024-06-27 18:04:12,872 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1443882569] provided 0 perfect and 1 imperfect interpolant sequences [2024-06-27 18:04:12,872 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1905494570] [2024-06-27 18:04:12,872 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:04:12,872 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-06-27 18:04:12,872 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-27 18:04:12,877 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-06-27 18:04:12,881 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-06-27 18:04:12,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:04:12,972 INFO L262 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 6 conjunts are in the unsatisfiable core [2024-06-27 18:04:12,975 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-06-27 18:04:13,093 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 18:04:13,093 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-06-27 18:04:13,093 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1905494570] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:04:13,094 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-06-27 18:04:13,094 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [3] total 6 [2024-06-27 18:04:13,094 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [41710867] [2024-06-27 18:04:13,094 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:04:13,095 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-27 18:04:13,096 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:04:13,096 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-27 18:04:13,096 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-06-27 18:04:13,121 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 45 [2024-06-27 18:04:13,121 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 138 transitions, 1858 flow. Second operand has 5 states, 5 states have (on average 23.2) internal successors, (116), 5 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:04:13,121 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:04:13,121 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 45 [2024-06-27 18:04:13,121 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:04:14,131 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([385] L67-->L64: Formula: (< v_~j1~0_4 v_~M1~0_2) InVars {~j1~0=v_~j1~0_4, ~M1~0=v_~M1~0_2} OutVars{~j1~0=v_~j1~0_4, ~M1~0=v_~M1~0_2} AuxVars[] AssignedVars[][52], [Black: 64#(and (<= 0 ~j1~0) (= ~j2~0 0) (= ~i2~0 0) (<= 1 ~i1~0)), 220#(and (<= ~M1~0 (+ ~N1~0 ~j1~0)) (= ~i1~0 0)), 247#(and (= ~j2~0 0) (<= ~M1~0 (+ ~M2~0 ~j1~0))), 33#L64true, Black: 68#(= ~counter~0 0), Black: 171#(and (<= 0 ~j1~0) (<= 0 ~j2~0) (<= 0 ~i2~0) (<= 1 ~i1~0)), Black: 184#(and (<= 2 ~i1~0) (<= 0 ~j1~0) (<= 0 ~j2~0) (<= 0 ~i2~0)), Black: 188#(and (<= 2 ~i1~0) (<= 0 ~j1~0) (<= 0 ~j2~0) (<= 1 ~i2~0)), Black: 74#(and (<= 0 ~j1~0) (= ~j2~0 0) (<= 1 ~i1~0) (<= 1 ~i2~0)), Black: 207#(and (<= ~N1~0 0) (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 204#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 86#(and (<= 0 ~j1~0) (<= 1 ~j2~0) (= ~i2~0 0) (<= 1 ~i1~0)), Black: 215#(and (= ~i1~0 0) (<= (+ ~N1~0 ~j1~0) ~M1~0) (<= (+ ~j1~0 1) ~M1~0)), Black: 212#(and (= ~i1~0 0) (<= (+ ~N1~0 ~j1~0) ~M1~0)), 103#(= ~counter~0 0), Black: 93#(and (<= 1 ~j1~0) (= ~j2~0 0) (<= 1 ~i1~0) (<= 1 ~i2~0)), 92#(and (<= 1 ~j1~0) (= ~i1~0 0) (= ~j2~0 0) (<= 1 ~i2~0)), 232#(and (<= 1 ~M2~0) (= ~j2~0 0) (<= ~M1~0 (+ ~M2~0 ~j1~0))), Black: 224#(and (<= ~M1~0 (+ ~N1~0 ~j1~0)) (= ~i1~0 0) (<= ~M1~0 ~j1~0)), 8#L56true, Black: 99#(and (<= 1 ~j1~0) (= ~i1~0 0) (<= 1 ~j2~0) (= ~i2~0 0)), 16#L41true, 14#L99true, Black: 229#(and (= ~j2~0 0) (<= ~M1~0 (+ ~M2~0 ~j1~0))), Black: 104#(<= ~counter~0 1), 17#L75true, Black: 113#(and (<= 1 ~j1~0) (<= 1 ~j2~0) (= ~i2~0 0) (<= 1 ~i1~0)), Black: 241#(and (= ~i1~0 0) (<= 1 ~N2~0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 239#(and (<= 1 ~N2~0) (= ~i2~0 0)), Black: 237#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), 360#(and (<= 1 ~j1~0) (= ~M1~0 ~N1~0) (<= 2 ~N1~0) (<= ~i1~0 0)), Black: 250#(and (= ~j2~0 0) (<= ~M1~0 ~j1~0) (<= ~M1~0 (+ ~M2~0 ~j1~0))), Black: 59#(and (= ~i1~0 0) (<= 0 ~j1~0) (= ~j2~0 0) (= ~i2~0 0))]) [2024-06-27 18:04:14,132 INFO L294 olderBase$Statistics]: this new event has 24 ancestors and is cut-off event [2024-06-27 18:04:14,132 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2024-06-27 18:04:14,132 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2024-06-27 18:04:14,132 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2024-06-27 18:04:14,317 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([385] L67-->L64: Formula: (< v_~j1~0_4 v_~M1~0_2) InVars {~j1~0=v_~j1~0_4, ~M1~0=v_~M1~0_2} OutVars{~j1~0=v_~j1~0_4, ~M1~0=v_~M1~0_2} AuxVars[] AssignedVars[][52], [Black: 64#(and (<= 0 ~j1~0) (= ~j2~0 0) (= ~i2~0 0) (<= 1 ~i1~0)), 220#(and (<= ~M1~0 (+ ~N1~0 ~j1~0)) (= ~i1~0 0)), 247#(and (= ~j2~0 0) (<= ~M1~0 (+ ~M2~0 ~j1~0))), 33#L64true, Black: 68#(= ~counter~0 0), Black: 171#(and (<= 0 ~j1~0) (<= 0 ~j2~0) (<= 0 ~i2~0) (<= 1 ~i1~0)), Black: 184#(and (<= 2 ~i1~0) (<= 0 ~j1~0) (<= 0 ~j2~0) (<= 0 ~i2~0)), Black: 188#(and (<= 2 ~i1~0) (<= 0 ~j1~0) (<= 0 ~j2~0) (<= 1 ~i2~0)), Black: 74#(and (<= 0 ~j1~0) (= ~j2~0 0) (<= 1 ~i1~0) (<= 1 ~i2~0)), Black: 207#(and (<= ~N1~0 0) (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 204#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 86#(and (<= 0 ~j1~0) (<= 1 ~j2~0) (= ~i2~0 0) (<= 1 ~i1~0)), Black: 215#(and (= ~i1~0 0) (<= (+ ~N1~0 ~j1~0) ~M1~0) (<= (+ ~j1~0 1) ~M1~0)), Black: 212#(and (= ~i1~0 0) (<= (+ ~N1~0 ~j1~0) ~M1~0)), 103#(= ~counter~0 0), Black: 93#(and (<= 1 ~j1~0) (= ~j2~0 0) (<= 1 ~i1~0) (<= 1 ~i2~0)), 92#(and (<= 1 ~j1~0) (= ~i1~0 0) (= ~j2~0 0) (<= 1 ~i2~0)), 232#(and (<= 1 ~M2~0) (= ~j2~0 0) (<= ~M1~0 (+ ~M2~0 ~j1~0))), Black: 224#(and (<= ~M1~0 (+ ~N1~0 ~j1~0)) (= ~i1~0 0) (<= ~M1~0 ~j1~0)), Black: 99#(and (<= 1 ~j1~0) (= ~i1~0 0) (<= 1 ~j2~0) (= ~i2~0 0)), 16#L41true, 14#L99true, Black: 229#(and (= ~j2~0 0) (<= ~M1~0 (+ ~M2~0 ~j1~0))), Black: 104#(<= ~counter~0 1), 17#L75true, Black: 113#(and (<= 1 ~j1~0) (<= 1 ~j2~0) (= ~i2~0 0) (<= 1 ~i1~0)), Black: 241#(and (= ~i1~0 0) (<= 1 ~N2~0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 239#(and (<= 1 ~N2~0) (= ~i2~0 0)), Black: 237#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), 360#(and (<= 1 ~j1~0) (= ~M1~0 ~N1~0) (<= 2 ~N1~0) (<= ~i1~0 0)), 13#thread2EXITtrue, Black: 250#(and (= ~j2~0 0) (<= ~M1~0 ~j1~0) (<= ~M1~0 (+ ~M2~0 ~j1~0))), Black: 59#(and (= ~i1~0 0) (<= 0 ~j1~0) (= ~j2~0 0) (= ~i2~0 0))]) [2024-06-27 18:04:14,317 INFO L294 olderBase$Statistics]: this new event has 25 ancestors and is cut-off event [2024-06-27 18:04:14,317 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2024-06-27 18:04:14,317 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2024-06-27 18:04:14,317 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2024-06-27 18:04:15,455 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([385] L67-->L64: Formula: (< v_~j1~0_4 v_~M1~0_2) InVars {~j1~0=v_~j1~0_4, ~M1~0=v_~M1~0_2} OutVars{~j1~0=v_~j1~0_4, ~M1~0=v_~M1~0_2} AuxVars[] AssignedVars[][87], [Black: 64#(and (<= 0 ~j1~0) (= ~j2~0 0) (= ~i2~0 0) (<= 1 ~i1~0)), 33#L64true, Black: 68#(= ~counter~0 0), Black: 171#(and (<= 0 ~j1~0) (<= 0 ~j2~0) (<= 0 ~i2~0) (<= 1 ~i1~0)), 104#(<= ~counter~0 1), Black: 184#(and (<= 2 ~i1~0) (<= 0 ~j1~0) (<= 0 ~j2~0) (<= 0 ~i2~0)), Black: 125#(and (<= 0 ~i1~0) (<= 0 ~j1~0) (<= 0 ~j2~0) (<= 0 ~i2~0)), Black: 74#(and (<= 0 ~j1~0) (= ~j2~0 0) (<= 1 ~i1~0) (<= 1 ~i2~0)), 218#true, Black: 207#(and (<= ~N1~0 0) (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 80#(and (<= 1 ~j1~0) (= ~i1~0 0) (= ~j2~0 0) (<= 1 ~i2~0)), Black: 204#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 86#(and (<= 0 ~j1~0) (<= 1 ~j2~0) (= ~i2~0 0) (<= 1 ~i1~0)), Black: 215#(and (= ~i1~0 0) (<= (+ ~N1~0 ~j1~0) ~M1~0) (<= (+ ~j1~0 1) ~M1~0)), Black: 212#(and (= ~i1~0 0) (<= (+ ~N1~0 ~j1~0) ~M1~0)), 245#true, Black: 93#(and (<= 1 ~j1~0) (= ~j2~0 0) (<= 1 ~i1~0) (<= 1 ~i2~0)), 188#(and (<= 2 ~i1~0) (<= 0 ~j1~0) (<= 0 ~j2~0) (<= 1 ~i2~0)), Black: 220#(and (<= ~M1~0 (+ ~N1~0 ~j1~0)) (= ~i1~0 0)), Black: 224#(and (<= ~M1~0 (+ ~N1~0 ~j1~0)) (= ~i1~0 0) (<= ~M1~0 ~j1~0)), 8#L56true, Black: 99#(and (<= 1 ~j1~0) (= ~i1~0 0) (<= 1 ~j2~0) (= ~i2~0 0)), 16#L41true, Black: 229#(and (= ~j2~0 0) (<= ~M1~0 (+ ~M2~0 ~j1~0))), Black: 232#(and (<= 1 ~M2~0) (= ~j2~0 0) (<= ~M1~0 (+ ~M2~0 ~j1~0))), Black: 103#(= ~counter~0 0), 253#true, 40#L98-5true, 17#L75true, Black: 113#(and (<= 1 ~j1~0) (<= 1 ~j2~0) (= ~i2~0 0) (<= 1 ~i1~0)), Black: 241#(and (= ~i1~0 0) (<= 1 ~N2~0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 239#(and (<= 1 ~N2~0) (= ~i2~0 0)), Black: 237#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 247#(and (= ~j2~0 0) (<= ~M1~0 (+ ~M2~0 ~j1~0))), Black: 250#(and (= ~j2~0 0) (<= ~M1~0 ~j1~0) (<= ~M1~0 (+ ~M2~0 ~j1~0))), Black: 59#(and (= ~i1~0 0) (<= 0 ~j1~0) (= ~j2~0 0) (= ~i2~0 0))]) [2024-06-27 18:04:15,455 INFO L294 olderBase$Statistics]: this new event has 29 ancestors and is cut-off event [2024-06-27 18:04:15,455 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2024-06-27 18:04:15,455 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2024-06-27 18:04:15,455 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2024-06-27 18:04:15,665 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([385] L67-->L64: Formula: (< v_~j1~0_4 v_~M1~0_2) InVars {~j1~0=v_~j1~0_4, ~M1~0=v_~M1~0_2} OutVars{~j1~0=v_~j1~0_4, ~M1~0=v_~M1~0_2} AuxVars[] AssignedVars[][87], [Black: 64#(and (<= 0 ~j1~0) (= ~j2~0 0) (= ~i2~0 0) (<= 1 ~i1~0)), 33#L64true, Black: 68#(= ~counter~0 0), Black: 171#(and (<= 0 ~j1~0) (<= 0 ~j2~0) (<= 0 ~i2~0) (<= 1 ~i1~0)), 104#(<= ~counter~0 1), Black: 184#(and (<= 2 ~i1~0) (<= 0 ~j1~0) (<= 0 ~j2~0) (<= 0 ~i2~0)), Black: 125#(and (<= 0 ~i1~0) (<= 0 ~j1~0) (<= 0 ~j2~0) (<= 0 ~i2~0)), Black: 74#(and (<= 0 ~j1~0) (= ~j2~0 0) (<= 1 ~i1~0) (<= 1 ~i2~0)), 218#true, Black: 207#(and (<= ~N1~0 0) (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 204#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 80#(and (<= 1 ~j1~0) (= ~i1~0 0) (= ~j2~0 0) (<= 1 ~i2~0)), Black: 86#(and (<= 0 ~j1~0) (<= 1 ~j2~0) (= ~i2~0 0) (<= 1 ~i1~0)), Black: 215#(and (= ~i1~0 0) (<= (+ ~N1~0 ~j1~0) ~M1~0) (<= (+ ~j1~0 1) ~M1~0)), Black: 212#(and (= ~i1~0 0) (<= (+ ~N1~0 ~j1~0) ~M1~0)), 245#true, Black: 93#(and (<= 1 ~j1~0) (= ~j2~0 0) (<= 1 ~i1~0) (<= 1 ~i2~0)), 188#(and (<= 2 ~i1~0) (<= 0 ~j1~0) (<= 0 ~j2~0) (<= 1 ~i2~0)), Black: 220#(and (<= ~M1~0 (+ ~N1~0 ~j1~0)) (= ~i1~0 0)), Black: 224#(and (<= ~M1~0 (+ ~N1~0 ~j1~0)) (= ~i1~0 0) (<= ~M1~0 ~j1~0)), Black: 99#(and (<= 1 ~j1~0) (= ~i1~0 0) (<= 1 ~j2~0) (= ~i2~0 0)), 16#L41true, Black: 229#(and (= ~j2~0 0) (<= ~M1~0 (+ ~M2~0 ~j1~0))), Black: 232#(and (<= 1 ~M2~0) (= ~j2~0 0) (<= ~M1~0 (+ ~M2~0 ~j1~0))), Black: 103#(= ~counter~0 0), 253#true, 40#L98-5true, 17#L75true, Black: 113#(and (<= 1 ~j1~0) (<= 1 ~j2~0) (= ~i2~0 0) (<= 1 ~i1~0)), Black: 241#(and (= ~i1~0 0) (<= 1 ~N2~0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 239#(and (<= 1 ~N2~0) (= ~i2~0 0)), Black: 237#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), 13#thread2EXITtrue, Black: 247#(and (= ~j2~0 0) (<= ~M1~0 (+ ~M2~0 ~j1~0))), Black: 250#(and (= ~j2~0 0) (<= ~M1~0 ~j1~0) (<= ~M1~0 (+ ~M2~0 ~j1~0))), Black: 59#(and (= ~i1~0 0) (<= 0 ~j1~0) (= ~j2~0 0) (= ~i2~0 0))]) [2024-06-27 18:04:15,666 INFO L294 olderBase$Statistics]: this new event has 30 ancestors and is cut-off event [2024-06-27 18:04:15,666 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2024-06-27 18:04:15,666 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2024-06-27 18:04:15,666 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2024-06-27 18:04:15,667 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([385] L67-->L64: Formula: (< v_~j1~0_4 v_~M1~0_2) InVars {~j1~0=v_~j1~0_4, ~M1~0=v_~M1~0_2} OutVars{~j1~0=v_~j1~0_4, ~M1~0=v_~M1~0_2} AuxVars[] AssignedVars[][87], [Black: 64#(and (<= 0 ~j1~0) (= ~j2~0 0) (= ~i2~0 0) (<= 1 ~i1~0)), 33#L64true, Black: 68#(= ~counter~0 0), Black: 171#(and (<= 0 ~j1~0) (<= 0 ~j2~0) (<= 0 ~i2~0) (<= 1 ~i1~0)), 104#(<= ~counter~0 1), Black: 184#(and (<= 2 ~i1~0) (<= 0 ~j1~0) (<= 0 ~j2~0) (<= 0 ~i2~0)), Black: 125#(and (<= 0 ~i1~0) (<= 0 ~j1~0) (<= 0 ~j2~0) (<= 0 ~i2~0)), Black: 74#(and (<= 0 ~j1~0) (= ~j2~0 0) (<= 1 ~i1~0) (<= 1 ~i2~0)), 218#true, Black: 207#(and (<= ~N1~0 0) (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 80#(and (<= 1 ~j1~0) (= ~i1~0 0) (= ~j2~0 0) (<= 1 ~i2~0)), Black: 204#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 86#(and (<= 0 ~j1~0) (<= 1 ~j2~0) (= ~i2~0 0) (<= 1 ~i1~0)), Black: 215#(and (= ~i1~0 0) (<= (+ ~N1~0 ~j1~0) ~M1~0) (<= (+ ~j1~0 1) ~M1~0)), Black: 212#(and (= ~i1~0 0) (<= (+ ~N1~0 ~j1~0) ~M1~0)), 245#true, Black: 93#(and (<= 1 ~j1~0) (= ~j2~0 0) (<= 1 ~i1~0) (<= 1 ~i2~0)), 188#(and (<= 2 ~i1~0) (<= 0 ~j1~0) (<= 0 ~j2~0) (<= 1 ~i2~0)), Black: 220#(and (<= ~M1~0 (+ ~N1~0 ~j1~0)) (= ~i1~0 0)), Black: 224#(and (<= ~M1~0 (+ ~N1~0 ~j1~0)) (= ~i1~0 0) (<= ~M1~0 ~j1~0)), 8#L56true, Black: 99#(and (<= 1 ~j1~0) (= ~i1~0 0) (<= 1 ~j2~0) (= ~i2~0 0)), 16#L41true, 14#L99true, Black: 229#(and (= ~j2~0 0) (<= ~M1~0 (+ ~M2~0 ~j1~0))), Black: 232#(and (<= 1 ~M2~0) (= ~j2~0 0) (<= ~M1~0 (+ ~M2~0 ~j1~0))), Black: 103#(= ~counter~0 0), 253#true, 17#L75true, Black: 113#(and (<= 1 ~j1~0) (<= 1 ~j2~0) (= ~i2~0 0) (<= 1 ~i1~0)), Black: 241#(and (= ~i1~0 0) (<= 1 ~N2~0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 239#(and (<= 1 ~N2~0) (= ~i2~0 0)), Black: 237#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 247#(and (= ~j2~0 0) (<= ~M1~0 (+ ~M2~0 ~j1~0))), Black: 59#(and (= ~i1~0 0) (<= 0 ~j1~0) (= ~j2~0 0) (= ~i2~0 0)), Black: 250#(and (= ~j2~0 0) (<= ~M1~0 ~j1~0) (<= ~M1~0 (+ ~M2~0 ~j1~0)))]) [2024-06-27 18:04:15,668 INFO L294 olderBase$Statistics]: this new event has 30 ancestors and is cut-off event [2024-06-27 18:04:15,668 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2024-06-27 18:04:15,668 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2024-06-27 18:04:15,668 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2024-06-27 18:04:15,729 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([385] L67-->L64: Formula: (< v_~j1~0_4 v_~M1~0_2) InVars {~j1~0=v_~j1~0_4, ~M1~0=v_~M1~0_2} OutVars{~j1~0=v_~j1~0_4, ~M1~0=v_~M1~0_2} AuxVars[] AssignedVars[][87], [Black: 64#(and (<= 0 ~j1~0) (= ~j2~0 0) (= ~i2~0 0) (<= 1 ~i1~0)), 33#L64true, 247#(and (= ~j2~0 0) (<= ~M1~0 (+ ~M2~0 ~j1~0))), Black: 68#(= ~counter~0 0), 104#(<= ~counter~0 1), Black: 184#(and (<= 2 ~i1~0) (<= 0 ~j1~0) (<= 0 ~j2~0) (<= 0 ~i2~0)), Black: 125#(and (<= 0 ~i1~0) (<= 0 ~j1~0) (<= 0 ~j2~0) (<= 0 ~i2~0)), Black: 188#(and (<= 2 ~i1~0) (<= 0 ~j1~0) (<= 0 ~j2~0) (<= 1 ~i2~0)), Black: 74#(and (<= 0 ~j1~0) (= ~j2~0 0) (<= 1 ~i1~0) (<= 1 ~i2~0)), 218#true, Black: 207#(and (<= ~N1~0 0) (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 80#(and (<= 1 ~j1~0) (= ~i1~0 0) (= ~j2~0 0) (<= 1 ~i2~0)), Black: 204#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 86#(and (<= 0 ~j1~0) (<= 1 ~j2~0) (= ~i2~0 0) (<= 1 ~i1~0)), Black: 215#(and (= ~i1~0 0) (<= (+ ~N1~0 ~j1~0) ~M1~0) (<= (+ ~j1~0 1) ~M1~0)), Black: 212#(and (= ~i1~0 0) (<= (+ ~N1~0 ~j1~0) ~M1~0)), 232#(and (<= 1 ~M2~0) (= ~j2~0 0) (<= ~M1~0 (+ ~M2~0 ~j1~0))), Black: 220#(and (<= ~M1~0 (+ ~N1~0 ~j1~0)) (= ~i1~0 0)), Black: 224#(and (<= ~M1~0 (+ ~N1~0 ~j1~0)) (= ~i1~0 0) (<= ~M1~0 ~j1~0)), Black: 99#(and (<= 1 ~j1~0) (= ~i1~0 0) (<= 1 ~j2~0) (= ~i2~0 0)), 16#L41true, Black: 229#(and (= ~j2~0 0) (<= ~M1~0 (+ ~M2~0 ~j1~0))), Black: 103#(= ~counter~0 0), 253#true, 17#L75true, 40#L98-5true, 171#(and (<= 0 ~j1~0) (<= 0 ~j2~0) (<= 0 ~i2~0) (<= 1 ~i1~0)), Black: 241#(and (= ~i1~0 0) (<= 1 ~N2~0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 113#(and (<= 1 ~j1~0) (<= 1 ~j2~0) (= ~i2~0 0) (<= 1 ~i1~0)), Black: 239#(and (<= 1 ~N2~0) (= ~i2~0 0)), Black: 237#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), 13#thread2EXITtrue, 93#(and (<= 1 ~j1~0) (= ~j2~0 0) (<= 1 ~i1~0) (<= 1 ~i2~0)), Black: 250#(and (= ~j2~0 0) (<= ~M1~0 ~j1~0) (<= ~M1~0 (+ ~M2~0 ~j1~0))), Black: 59#(and (= ~i1~0 0) (<= 0 ~j1~0) (= ~j2~0 0) (= ~i2~0 0))]) [2024-06-27 18:04:15,729 INFO L294 olderBase$Statistics]: this new event has 30 ancestors and is cut-off event [2024-06-27 18:04:15,729 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2024-06-27 18:04:15,729 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2024-06-27 18:04:15,729 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2024-06-27 18:04:15,841 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([385] L67-->L64: Formula: (< v_~j1~0_4 v_~M1~0_2) InVars {~j1~0=v_~j1~0_4, ~M1~0=v_~M1~0_2} OutVars{~j1~0=v_~j1~0_4, ~M1~0=v_~M1~0_2} AuxVars[] AssignedVars[][87], [Black: 64#(and (<= 0 ~j1~0) (= ~j2~0 0) (= ~i2~0 0) (<= 1 ~i1~0)), 33#L64true, Black: 68#(= ~counter~0 0), Black: 171#(and (<= 0 ~j1~0) (<= 0 ~j2~0) (<= 0 ~i2~0) (<= 1 ~i1~0)), Black: 125#(and (<= 0 ~i1~0) (<= 0 ~j1~0) (<= 0 ~j2~0) (<= 0 ~i2~0)), Black: 188#(and (<= 2 ~i1~0) (<= 0 ~j1~0) (<= 0 ~j2~0) (<= 1 ~i2~0)), Black: 74#(and (<= 0 ~j1~0) (= ~j2~0 0) (<= 1 ~i1~0) (<= 1 ~i2~0)), 218#true, Black: 207#(and (<= ~N1~0 0) (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 204#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 80#(and (<= 1 ~j1~0) (= ~i1~0 0) (= ~j2~0 0) (<= 1 ~i2~0)), 101#true, Black: 86#(and (<= 0 ~j1~0) (<= 1 ~j2~0) (= ~i2~0 0) (<= 1 ~i1~0)), Black: 215#(and (= ~i1~0 0) (<= (+ ~N1~0 ~j1~0) ~M1~0) (<= (+ ~j1~0 1) ~M1~0)), Black: 212#(and (= ~i1~0 0) (<= (+ ~N1~0 ~j1~0) ~M1~0)), 245#true, Black: 93#(and (<= 1 ~j1~0) (= ~j2~0 0) (<= 1 ~i1~0) (<= 1 ~i2~0)), Black: 220#(and (<= ~M1~0 (+ ~N1~0 ~j1~0)) (= ~i1~0 0)), Black: 224#(and (<= ~M1~0 (+ ~N1~0 ~j1~0)) (= ~i1~0 0) (<= ~M1~0 ~j1~0)), 8#L56true, Black: 99#(and (<= 1 ~j1~0) (= ~i1~0 0) (<= 1 ~j2~0) (= ~i2~0 0)), 16#L41true, Black: 229#(and (= ~j2~0 0) (<= ~M1~0 (+ ~M2~0 ~j1~0))), Black: 232#(and (<= 1 ~M2~0) (= ~j2~0 0) (<= ~M1~0 (+ ~M2~0 ~j1~0))), Black: 104#(<= ~counter~0 1), Black: 103#(= ~counter~0 0), 253#true, 40#L98-5true, 17#L75true, Black: 241#(and (= ~i1~0 0) (<= 1 ~N2~0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 113#(and (<= 1 ~j1~0) (<= 1 ~j2~0) (= ~i2~0 0) (<= 1 ~i1~0)), Black: 239#(and (<= 1 ~N2~0) (= ~i2~0 0)), Black: 237#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 247#(and (= ~j2~0 0) (<= ~M1~0 (+ ~M2~0 ~j1~0))), Black: 250#(and (= ~j2~0 0) (<= ~M1~0 ~j1~0) (<= ~M1~0 (+ ~M2~0 ~j1~0))), 184#(and (<= 2 ~i1~0) (<= 0 ~j1~0) (<= 0 ~j2~0) (<= 0 ~i2~0)), Black: 59#(and (= ~i1~0 0) (<= 0 ~j1~0) (= ~j2~0 0) (= ~i2~0 0))]) [2024-06-27 18:04:15,842 INFO L294 olderBase$Statistics]: this new event has 31 ancestors and is cut-off event [2024-06-27 18:04:15,842 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2024-06-27 18:04:15,842 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2024-06-27 18:04:15,842 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2024-06-27 18:04:15,856 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([385] L67-->L64: Formula: (< v_~j1~0_4 v_~M1~0_2) InVars {~j1~0=v_~j1~0_4, ~M1~0=v_~M1~0_2} OutVars{~j1~0=v_~j1~0_4, ~M1~0=v_~M1~0_2} AuxVars[] AssignedVars[][87], [Black: 64#(and (<= 0 ~j1~0) (= ~j2~0 0) (= ~i2~0 0) (<= 1 ~i1~0)), 33#L64true, Black: 68#(= ~counter~0 0), Black: 171#(and (<= 0 ~j1~0) (<= 0 ~j2~0) (<= 0 ~i2~0) (<= 1 ~i1~0)), Black: 184#(and (<= 2 ~i1~0) (<= 0 ~j1~0) (<= 0 ~j2~0) (<= 0 ~i2~0)), Black: 125#(and (<= 0 ~i1~0) (<= 0 ~j1~0) (<= 0 ~j2~0) (<= 0 ~i2~0)), Black: 74#(and (<= 0 ~j1~0) (= ~j2~0 0) (<= 1 ~i1~0) (<= 1 ~i2~0)), 218#true, Black: 207#(and (<= ~N1~0 0) (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 204#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 80#(and (<= 1 ~j1~0) (= ~i1~0 0) (= ~j2~0 0) (<= 1 ~i2~0)), Black: 86#(and (<= 0 ~j1~0) (<= 1 ~j2~0) (= ~i2~0 0) (<= 1 ~i1~0)), Black: 215#(and (= ~i1~0 0) (<= (+ ~N1~0 ~j1~0) ~M1~0) (<= (+ ~j1~0 1) ~M1~0)), Black: 212#(and (= ~i1~0 0) (<= (+ ~N1~0 ~j1~0) ~M1~0)), 103#(= ~counter~0 0), 245#true, Black: 93#(and (<= 1 ~j1~0) (= ~j2~0 0) (<= 1 ~i1~0) (<= 1 ~i2~0)), 188#(and (<= 2 ~i1~0) (<= 0 ~j1~0) (<= 0 ~j2~0) (<= 1 ~i2~0)), Black: 220#(and (<= ~M1~0 (+ ~N1~0 ~j1~0)) (= ~i1~0 0)), 8#L56true, Black: 224#(and (<= ~M1~0 (+ ~N1~0 ~j1~0)) (= ~i1~0 0) (<= ~M1~0 ~j1~0)), Black: 99#(and (<= 1 ~j1~0) (= ~i1~0 0) (<= 1 ~j2~0) (= ~i2~0 0)), 16#L41true, Black: 229#(and (= ~j2~0 0) (<= ~M1~0 (+ ~M2~0 ~j1~0))), Black: 104#(<= ~counter~0 1), Black: 232#(and (<= 1 ~M2~0) (= ~j2~0 0) (<= ~M1~0 (+ ~M2~0 ~j1~0))), 253#true, 40#L98-5true, 17#L75true, Black: 113#(and (<= 1 ~j1~0) (<= 1 ~j2~0) (= ~i2~0 0) (<= 1 ~i1~0)), Black: 241#(and (= ~i1~0 0) (<= 1 ~N2~0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 239#(and (<= 1 ~N2~0) (= ~i2~0 0)), Black: 237#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 247#(and (= ~j2~0 0) (<= ~M1~0 (+ ~M2~0 ~j1~0))), Black: 250#(and (= ~j2~0 0) (<= ~M1~0 ~j1~0) (<= ~M1~0 (+ ~M2~0 ~j1~0))), Black: 59#(and (= ~i1~0 0) (<= 0 ~j1~0) (= ~j2~0 0) (= ~i2~0 0))]) [2024-06-27 18:04:15,856 INFO L294 olderBase$Statistics]: this new event has 31 ancestors and is cut-off event [2024-06-27 18:04:15,857 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2024-06-27 18:04:15,857 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2024-06-27 18:04:15,857 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2024-06-27 18:04:15,865 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([385] L67-->L64: Formula: (< v_~j1~0_4 v_~M1~0_2) InVars {~j1~0=v_~j1~0_4, ~M1~0=v_~M1~0_2} OutVars{~j1~0=v_~j1~0_4, ~M1~0=v_~M1~0_2} AuxVars[] AssignedVars[][87], [Black: 64#(and (<= 0 ~j1~0) (= ~j2~0 0) (= ~i2~0 0) (<= 1 ~i1~0)), 33#L64true, Black: 68#(= ~counter~0 0), Black: 171#(and (<= 0 ~j1~0) (<= 0 ~j2~0) (<= 0 ~i2~0) (<= 1 ~i1~0)), Black: 184#(and (<= 2 ~i1~0) (<= 0 ~j1~0) (<= 0 ~j2~0) (<= 0 ~i2~0)), 104#(<= ~counter~0 1), Black: 125#(and (<= 0 ~i1~0) (<= 0 ~j1~0) (<= 0 ~j2~0) (<= 0 ~i2~0)), Black: 74#(and (<= 0 ~j1~0) (= ~j2~0 0) (<= 1 ~i1~0) (<= 1 ~i2~0)), 218#true, Black: 207#(and (<= ~N1~0 0) (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 204#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 80#(and (<= 1 ~j1~0) (= ~i1~0 0) (= ~j2~0 0) (<= 1 ~i2~0)), Black: 86#(and (<= 0 ~j1~0) (<= 1 ~j2~0) (= ~i2~0 0) (<= 1 ~i1~0)), Black: 215#(and (= ~i1~0 0) (<= (+ ~N1~0 ~j1~0) ~M1~0) (<= (+ ~j1~0 1) ~M1~0)), Black: 212#(and (= ~i1~0 0) (<= (+ ~N1~0 ~j1~0) ~M1~0)), 245#true, Black: 93#(and (<= 1 ~j1~0) (= ~j2~0 0) (<= 1 ~i1~0) (<= 1 ~i2~0)), 188#(and (<= 2 ~i1~0) (<= 0 ~j1~0) (<= 0 ~j2~0) (<= 1 ~i2~0)), Black: 220#(and (<= ~M1~0 (+ ~N1~0 ~j1~0)) (= ~i1~0 0)), Black: 224#(and (<= ~M1~0 (+ ~N1~0 ~j1~0)) (= ~i1~0 0) (<= ~M1~0 ~j1~0)), Black: 99#(and (<= 1 ~j1~0) (= ~i1~0 0) (<= 1 ~j2~0) (= ~i2~0 0)), 16#L41true, 14#L99true, Black: 229#(and (= ~j2~0 0) (<= ~M1~0 (+ ~M2~0 ~j1~0))), Black: 232#(and (<= 1 ~M2~0) (= ~j2~0 0) (<= ~M1~0 (+ ~M2~0 ~j1~0))), Black: 103#(= ~counter~0 0), 253#true, 17#L75true, Black: 113#(and (<= 1 ~j1~0) (<= 1 ~j2~0) (= ~i2~0 0) (<= 1 ~i1~0)), Black: 241#(and (= ~i1~0 0) (<= 1 ~N2~0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 239#(and (<= 1 ~N2~0) (= ~i2~0 0)), Black: 237#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), 13#thread2EXITtrue, Black: 247#(and (= ~j2~0 0) (<= ~M1~0 (+ ~M2~0 ~j1~0))), Black: 250#(and (= ~j2~0 0) (<= ~M1~0 ~j1~0) (<= ~M1~0 (+ ~M2~0 ~j1~0))), Black: 59#(and (= ~i1~0 0) (<= 0 ~j1~0) (= ~j2~0 0) (= ~i2~0 0))]) [2024-06-27 18:04:15,865 INFO L294 olderBase$Statistics]: this new event has 31 ancestors and is cut-off event [2024-06-27 18:04:15,865 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2024-06-27 18:04:15,865 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2024-06-27 18:04:15,865 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2024-06-27 18:04:15,909 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([385] L67-->L64: Formula: (< v_~j1~0_4 v_~M1~0_2) InVars {~j1~0=v_~j1~0_4, ~M1~0=v_~M1~0_2} OutVars{~j1~0=v_~j1~0_4, ~M1~0=v_~M1~0_2} AuxVars[] AssignedVars[][87], [Black: 64#(and (<= 0 ~j1~0) (= ~j2~0 0) (= ~i2~0 0) (<= 1 ~i1~0)), 247#(and (= ~j2~0 0) (<= ~M1~0 (+ ~M2~0 ~j1~0))), 33#L64true, Black: 68#(= ~counter~0 0), Black: 171#(and (<= 0 ~j1~0) (<= 0 ~j2~0) (<= 0 ~i2~0) (<= 1 ~i1~0)), Black: 125#(and (<= 0 ~i1~0) (<= 0 ~j1~0) (<= 0 ~j2~0) (<= 0 ~i2~0)), Black: 188#(and (<= 2 ~i1~0) (<= 0 ~j1~0) (<= 0 ~j2~0) (<= 1 ~i2~0)), Black: 74#(and (<= 0 ~j1~0) (= ~j2~0 0) (<= 1 ~i1~0) (<= 1 ~i2~0)), 218#true, Black: 207#(and (<= ~N1~0 0) (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 204#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 80#(and (<= 1 ~j1~0) (= ~i1~0 0) (= ~j2~0 0) (<= 1 ~i2~0)), 101#true, Black: 86#(and (<= 0 ~j1~0) (<= 1 ~j2~0) (= ~i2~0 0) (<= 1 ~i1~0)), Black: 215#(and (= ~i1~0 0) (<= (+ ~N1~0 ~j1~0) ~M1~0) (<= (+ ~j1~0 1) ~M1~0)), Black: 212#(and (= ~i1~0 0) (<= (+ ~N1~0 ~j1~0) ~M1~0)), 232#(and (<= 1 ~M2~0) (= ~j2~0 0) (<= ~M1~0 (+ ~M2~0 ~j1~0))), Black: 220#(and (<= ~M1~0 (+ ~N1~0 ~j1~0)) (= ~i1~0 0)), Black: 224#(and (<= ~M1~0 (+ ~N1~0 ~j1~0)) (= ~i1~0 0) (<= ~M1~0 ~j1~0)), Black: 99#(and (<= 1 ~j1~0) (= ~i1~0 0) (<= 1 ~j2~0) (= ~i2~0 0)), 14#L99true, 16#L41true, Black: 229#(and (= ~j2~0 0) (<= ~M1~0 (+ ~M2~0 ~j1~0))), Black: 104#(<= ~counter~0 1), Black: 103#(= ~counter~0 0), 253#true, 17#L75true, Black: 113#(and (<= 1 ~j1~0) (<= 1 ~j2~0) (= ~i2~0 0) (<= 1 ~i1~0)), Black: 241#(and (= ~i1~0 0) (<= 1 ~N2~0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 239#(and (<= 1 ~N2~0) (= ~i2~0 0)), Black: 237#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), 13#thread2EXITtrue, 93#(and (<= 1 ~j1~0) (= ~j2~0 0) (<= 1 ~i1~0) (<= 1 ~i2~0)), 184#(and (<= 2 ~i1~0) (<= 0 ~j1~0) (<= 0 ~j2~0) (<= 0 ~i2~0)), Black: 59#(and (= ~i1~0 0) (<= 0 ~j1~0) (= ~j2~0 0) (= ~i2~0 0)), Black: 250#(and (= ~j2~0 0) (<= ~M1~0 ~j1~0) (<= ~M1~0 (+ ~M2~0 ~j1~0)))]) [2024-06-27 18:04:15,910 INFO L294 olderBase$Statistics]: this new event has 31 ancestors and is cut-off event [2024-06-27 18:04:15,910 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2024-06-27 18:04:15,910 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2024-06-27 18:04:15,910 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2024-06-27 18:04:15,917 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([385] L67-->L64: Formula: (< v_~j1~0_4 v_~M1~0_2) InVars {~j1~0=v_~j1~0_4, ~M1~0=v_~M1~0_2} OutVars{~j1~0=v_~j1~0_4, ~M1~0=v_~M1~0_2} AuxVars[] AssignedVars[][87], [Black: 64#(and (<= 0 ~j1~0) (= ~j2~0 0) (= ~i2~0 0) (<= 1 ~i1~0)), 33#L64true, 247#(and (= ~j2~0 0) (<= ~M1~0 (+ ~M2~0 ~j1~0))), Black: 68#(= ~counter~0 0), Black: 184#(and (<= 2 ~i1~0) (<= 0 ~j1~0) (<= 0 ~j2~0) (<= 0 ~i2~0)), 104#(<= ~counter~0 1), Black: 125#(and (<= 0 ~i1~0) (<= 0 ~j1~0) (<= 0 ~j2~0) (<= 0 ~i2~0)), Black: 188#(and (<= 2 ~i1~0) (<= 0 ~j1~0) (<= 0 ~j2~0) (<= 1 ~i2~0)), Black: 74#(and (<= 0 ~j1~0) (= ~j2~0 0) (<= 1 ~i1~0) (<= 1 ~i2~0)), 218#true, Black: 207#(and (<= ~N1~0 0) (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 80#(and (<= 1 ~j1~0) (= ~i1~0 0) (= ~j2~0 0) (<= 1 ~i2~0)), Black: 204#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 86#(and (<= 0 ~j1~0) (<= 1 ~j2~0) (= ~i2~0 0) (<= 1 ~i1~0)), Black: 215#(and (= ~i1~0 0) (<= (+ ~N1~0 ~j1~0) ~M1~0) (<= (+ ~j1~0 1) ~M1~0)), Black: 212#(and (= ~i1~0 0) (<= (+ ~N1~0 ~j1~0) ~M1~0)), 232#(and (<= 1 ~M2~0) (= ~j2~0 0) (<= ~M1~0 (+ ~M2~0 ~j1~0))), Black: 220#(and (<= ~M1~0 (+ ~N1~0 ~j1~0)) (= ~i1~0 0)), Black: 224#(and (<= ~M1~0 (+ ~N1~0 ~j1~0)) (= ~i1~0 0) (<= ~M1~0 ~j1~0)), Black: 99#(and (<= 1 ~j1~0) (= ~i1~0 0) (<= 1 ~j2~0) (= ~i2~0 0)), 14#L99true, 16#L41true, Black: 229#(and (= ~j2~0 0) (<= ~M1~0 (+ ~M2~0 ~j1~0))), Black: 103#(= ~counter~0 0), 253#true, 17#L75true, 171#(and (<= 0 ~j1~0) (<= 0 ~j2~0) (<= 0 ~i2~0) (<= 1 ~i1~0)), Black: 241#(and (= ~i1~0 0) (<= 1 ~N2~0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 113#(and (<= 1 ~j1~0) (<= 1 ~j2~0) (= ~i2~0 0) (<= 1 ~i1~0)), Black: 239#(and (<= 1 ~N2~0) (= ~i2~0 0)), Black: 237#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), 13#thread2EXITtrue, 93#(and (<= 1 ~j1~0) (= ~j2~0 0) (<= 1 ~i1~0) (<= 1 ~i2~0)), Black: 59#(and (= ~i1~0 0) (<= 0 ~j1~0) (= ~j2~0 0) (= ~i2~0 0)), Black: 250#(and (= ~j2~0 0) (<= ~M1~0 ~j1~0) (<= ~M1~0 (+ ~M2~0 ~j1~0)))]) [2024-06-27 18:04:15,918 INFO L294 olderBase$Statistics]: this new event has 31 ancestors and is cut-off event [2024-06-27 18:04:15,918 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2024-06-27 18:04:15,918 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2024-06-27 18:04:15,918 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2024-06-27 18:04:16,341 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([385] L67-->L64: Formula: (< v_~j1~0_4 v_~M1~0_2) InVars {~j1~0=v_~j1~0_4, ~M1~0=v_~M1~0_2} OutVars{~j1~0=v_~j1~0_4, ~M1~0=v_~M1~0_2} AuxVars[] AssignedVars[][87], [Black: 64#(and (<= 0 ~j1~0) (= ~j2~0 0) (= ~i2~0 0) (<= 1 ~i1~0)), 33#L64true, Black: 68#(= ~counter~0 0), Black: 171#(and (<= 0 ~j1~0) (<= 0 ~j2~0) (<= 0 ~i2~0) (<= 1 ~i1~0)), Black: 125#(and (<= 0 ~i1~0) (<= 0 ~j1~0) (<= 0 ~j2~0) (<= 0 ~i2~0)), Black: 188#(and (<= 2 ~i1~0) (<= 0 ~j1~0) (<= 0 ~j2~0) (<= 1 ~i2~0)), Black: 74#(and (<= 0 ~j1~0) (= ~j2~0 0) (<= 1 ~i1~0) (<= 1 ~i2~0)), 218#true, Black: 207#(and (<= ~N1~0 0) (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 204#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 80#(and (<= 1 ~j1~0) (= ~i1~0 0) (= ~j2~0 0) (<= 1 ~i2~0)), 101#true, Black: 86#(and (<= 0 ~j1~0) (<= 1 ~j2~0) (= ~i2~0 0) (<= 1 ~i1~0)), Black: 215#(and (= ~i1~0 0) (<= (+ ~N1~0 ~j1~0) ~M1~0) (<= (+ ~j1~0 1) ~M1~0)), Black: 212#(and (= ~i1~0 0) (<= (+ ~N1~0 ~j1~0) ~M1~0)), 245#true, Black: 93#(and (<= 1 ~j1~0) (= ~j2~0 0) (<= 1 ~i1~0) (<= 1 ~i2~0)), Black: 220#(and (<= ~M1~0 (+ ~N1~0 ~j1~0)) (= ~i1~0 0)), Black: 224#(and (<= ~M1~0 (+ ~N1~0 ~j1~0)) (= ~i1~0 0) (<= ~M1~0 ~j1~0)), Black: 99#(and (<= 1 ~j1~0) (= ~i1~0 0) (<= 1 ~j2~0) (= ~i2~0 0)), 16#L41true, Black: 229#(and (= ~j2~0 0) (<= ~M1~0 (+ ~M2~0 ~j1~0))), Black: 232#(and (<= 1 ~M2~0) (= ~j2~0 0) (<= ~M1~0 (+ ~M2~0 ~j1~0))), Black: 104#(<= ~counter~0 1), Black: 103#(= ~counter~0 0), 253#true, 40#L98-5true, 17#L75true, Black: 241#(and (= ~i1~0 0) (<= 1 ~N2~0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 113#(and (<= 1 ~j1~0) (<= 1 ~j2~0) (= ~i2~0 0) (<= 1 ~i1~0)), Black: 239#(and (<= 1 ~N2~0) (= ~i2~0 0)), Black: 237#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), 13#thread2EXITtrue, Black: 247#(and (= ~j2~0 0) (<= ~M1~0 (+ ~M2~0 ~j1~0))), Black: 250#(and (= ~j2~0 0) (<= ~M1~0 ~j1~0) (<= ~M1~0 (+ ~M2~0 ~j1~0))), 184#(and (<= 2 ~i1~0) (<= 0 ~j1~0) (<= 0 ~j2~0) (<= 0 ~i2~0)), Black: 59#(and (= ~i1~0 0) (<= 0 ~j1~0) (= ~j2~0 0) (= ~i2~0 0))]) [2024-06-27 18:04:16,347 INFO L294 olderBase$Statistics]: this new event has 32 ancestors and is cut-off event [2024-06-27 18:04:16,347 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2024-06-27 18:04:16,347 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2024-06-27 18:04:16,347 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2024-06-27 18:04:16,349 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([385] L67-->L64: Formula: (< v_~j1~0_4 v_~M1~0_2) InVars {~j1~0=v_~j1~0_4, ~M1~0=v_~M1~0_2} OutVars{~j1~0=v_~j1~0_4, ~M1~0=v_~M1~0_2} AuxVars[] AssignedVars[][87], [Black: 64#(and (<= 0 ~j1~0) (= ~j2~0 0) (= ~i2~0 0) (<= 1 ~i1~0)), 33#L64true, Black: 68#(= ~counter~0 0), Black: 171#(and (<= 0 ~j1~0) (<= 0 ~j2~0) (<= 0 ~i2~0) (<= 1 ~i1~0)), Black: 125#(and (<= 0 ~i1~0) (<= 0 ~j1~0) (<= 0 ~j2~0) (<= 0 ~i2~0)), Black: 188#(and (<= 2 ~i1~0) (<= 0 ~j1~0) (<= 0 ~j2~0) (<= 1 ~i2~0)), Black: 74#(and (<= 0 ~j1~0) (= ~j2~0 0) (<= 1 ~i1~0) (<= 1 ~i2~0)), 218#true, Black: 207#(and (<= ~N1~0 0) (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 80#(and (<= 1 ~j1~0) (= ~i1~0 0) (= ~j2~0 0) (<= 1 ~i2~0)), Black: 204#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), 101#true, Black: 86#(and (<= 0 ~j1~0) (<= 1 ~j2~0) (= ~i2~0 0) (<= 1 ~i1~0)), Black: 215#(and (= ~i1~0 0) (<= (+ ~N1~0 ~j1~0) ~M1~0) (<= (+ ~j1~0 1) ~M1~0)), Black: 212#(and (= ~i1~0 0) (<= (+ ~N1~0 ~j1~0) ~M1~0)), 245#true, Black: 93#(and (<= 1 ~j1~0) (= ~j2~0 0) (<= 1 ~i1~0) (<= 1 ~i2~0)), Black: 220#(and (<= ~M1~0 (+ ~N1~0 ~j1~0)) (= ~i1~0 0)), Black: 224#(and (<= ~M1~0 (+ ~N1~0 ~j1~0)) (= ~i1~0 0) (<= ~M1~0 ~j1~0)), 8#L56true, Black: 99#(and (<= 1 ~j1~0) (= ~i1~0 0) (<= 1 ~j2~0) (= ~i2~0 0)), 16#L41true, 14#L99true, Black: 229#(and (= ~j2~0 0) (<= ~M1~0 (+ ~M2~0 ~j1~0))), Black: 232#(and (<= 1 ~M2~0) (= ~j2~0 0) (<= ~M1~0 (+ ~M2~0 ~j1~0))), Black: 104#(<= ~counter~0 1), Black: 103#(= ~counter~0 0), 253#true, 17#L75true, Black: 113#(and (<= 1 ~j1~0) (<= 1 ~j2~0) (= ~i2~0 0) (<= 1 ~i1~0)), Black: 241#(and (= ~i1~0 0) (<= 1 ~N2~0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 239#(and (<= 1 ~N2~0) (= ~i2~0 0)), Black: 237#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 247#(and (= ~j2~0 0) (<= ~M1~0 (+ ~M2~0 ~j1~0))), 184#(and (<= 2 ~i1~0) (<= 0 ~j1~0) (<= 0 ~j2~0) (<= 0 ~i2~0)), Black: 59#(and (= ~i1~0 0) (<= 0 ~j1~0) (= ~j2~0 0) (= ~i2~0 0)), Black: 250#(and (= ~j2~0 0) (<= ~M1~0 ~j1~0) (<= ~M1~0 (+ ~M2~0 ~j1~0)))]) [2024-06-27 18:04:16,350 INFO L294 olderBase$Statistics]: this new event has 32 ancestors and is cut-off event [2024-06-27 18:04:16,350 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2024-06-27 18:04:16,350 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2024-06-27 18:04:16,350 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2024-06-27 18:04:16,366 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([385] L67-->L64: Formula: (< v_~j1~0_4 v_~M1~0_2) InVars {~j1~0=v_~j1~0_4, ~M1~0=v_~M1~0_2} OutVars{~j1~0=v_~j1~0_4, ~M1~0=v_~M1~0_2} AuxVars[] AssignedVars[][87], [Black: 64#(and (<= 0 ~j1~0) (= ~j2~0 0) (= ~i2~0 0) (<= 1 ~i1~0)), 33#L64true, Black: 68#(= ~counter~0 0), Black: 171#(and (<= 0 ~j1~0) (<= 0 ~j2~0) (<= 0 ~i2~0) (<= 1 ~i1~0)), Black: 184#(and (<= 2 ~i1~0) (<= 0 ~j1~0) (<= 0 ~j2~0) (<= 0 ~i2~0)), Black: 125#(and (<= 0 ~i1~0) (<= 0 ~j1~0) (<= 0 ~j2~0) (<= 0 ~i2~0)), Black: 74#(and (<= 0 ~j1~0) (= ~j2~0 0) (<= 1 ~i1~0) (<= 1 ~i2~0)), 218#true, Black: 207#(and (<= ~N1~0 0) (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 80#(and (<= 1 ~j1~0) (= ~i1~0 0) (= ~j2~0 0) (<= 1 ~i2~0)), Black: 204#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 86#(and (<= 0 ~j1~0) (<= 1 ~j2~0) (= ~i2~0 0) (<= 1 ~i1~0)), Black: 215#(and (= ~i1~0 0) (<= (+ ~N1~0 ~j1~0) ~M1~0) (<= (+ ~j1~0 1) ~M1~0)), Black: 212#(and (= ~i1~0 0) (<= (+ ~N1~0 ~j1~0) ~M1~0)), 103#(= ~counter~0 0), 245#true, Black: 93#(and (<= 1 ~j1~0) (= ~j2~0 0) (<= 1 ~i1~0) (<= 1 ~i2~0)), 188#(and (<= 2 ~i1~0) (<= 0 ~j1~0) (<= 0 ~j2~0) (<= 1 ~i2~0)), Black: 220#(and (<= ~M1~0 (+ ~N1~0 ~j1~0)) (= ~i1~0 0)), Black: 224#(and (<= ~M1~0 (+ ~N1~0 ~j1~0)) (= ~i1~0 0) (<= ~M1~0 ~j1~0)), Black: 99#(and (<= 1 ~j1~0) (= ~i1~0 0) (<= 1 ~j2~0) (= ~i2~0 0)), 16#L41true, Black: 229#(and (= ~j2~0 0) (<= ~M1~0 (+ ~M2~0 ~j1~0))), Black: 104#(<= ~counter~0 1), Black: 232#(and (<= 1 ~M2~0) (= ~j2~0 0) (<= ~M1~0 (+ ~M2~0 ~j1~0))), 253#true, 40#L98-5true, 17#L75true, Black: 113#(and (<= 1 ~j1~0) (<= 1 ~j2~0) (= ~i2~0 0) (<= 1 ~i1~0)), Black: 241#(and (= ~i1~0 0) (<= 1 ~N2~0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 239#(and (<= 1 ~N2~0) (= ~i2~0 0)), Black: 237#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), 13#thread2EXITtrue, Black: 247#(and (= ~j2~0 0) (<= ~M1~0 (+ ~M2~0 ~j1~0))), Black: 250#(and (= ~j2~0 0) (<= ~M1~0 ~j1~0) (<= ~M1~0 (+ ~M2~0 ~j1~0))), Black: 59#(and (= ~i1~0 0) (<= 0 ~j1~0) (= ~j2~0 0) (= ~i2~0 0))]) [2024-06-27 18:04:16,367 INFO L294 olderBase$Statistics]: this new event has 32 ancestors and is cut-off event [2024-06-27 18:04:16,367 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2024-06-27 18:04:16,367 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2024-06-27 18:04:16,367 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2024-06-27 18:04:16,368 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([385] L67-->L64: Formula: (< v_~j1~0_4 v_~M1~0_2) InVars {~j1~0=v_~j1~0_4, ~M1~0=v_~M1~0_2} OutVars{~j1~0=v_~j1~0_4, ~M1~0=v_~M1~0_2} AuxVars[] AssignedVars[][87], [Black: 64#(and (<= 0 ~j1~0) (= ~j2~0 0) (= ~i2~0 0) (<= 1 ~i1~0)), 33#L64true, Black: 68#(= ~counter~0 0), Black: 171#(and (<= 0 ~j1~0) (<= 0 ~j2~0) (<= 0 ~i2~0) (<= 1 ~i1~0)), Black: 184#(and (<= 2 ~i1~0) (<= 0 ~j1~0) (<= 0 ~j2~0) (<= 0 ~i2~0)), Black: 125#(and (<= 0 ~i1~0) (<= 0 ~j1~0) (<= 0 ~j2~0) (<= 0 ~i2~0)), Black: 74#(and (<= 0 ~j1~0) (= ~j2~0 0) (<= 1 ~i1~0) (<= 1 ~i2~0)), 218#true, Black: 207#(and (<= ~N1~0 0) (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 204#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 80#(and (<= 1 ~j1~0) (= ~i1~0 0) (= ~j2~0 0) (<= 1 ~i2~0)), Black: 86#(and (<= 0 ~j1~0) (<= 1 ~j2~0) (= ~i2~0 0) (<= 1 ~i1~0)), Black: 215#(and (= ~i1~0 0) (<= (+ ~N1~0 ~j1~0) ~M1~0) (<= (+ ~j1~0 1) ~M1~0)), Black: 212#(and (= ~i1~0 0) (<= (+ ~N1~0 ~j1~0) ~M1~0)), 103#(= ~counter~0 0), 245#true, Black: 93#(and (<= 1 ~j1~0) (= ~j2~0 0) (<= 1 ~i1~0) (<= 1 ~i2~0)), 188#(and (<= 2 ~i1~0) (<= 0 ~j1~0) (<= 0 ~j2~0) (<= 1 ~i2~0)), Black: 220#(and (<= ~M1~0 (+ ~N1~0 ~j1~0)) (= ~i1~0 0)), Black: 224#(and (<= ~M1~0 (+ ~N1~0 ~j1~0)) (= ~i1~0 0) (<= ~M1~0 ~j1~0)), 8#L56true, Black: 99#(and (<= 1 ~j1~0) (= ~i1~0 0) (<= 1 ~j2~0) (= ~i2~0 0)), 16#L41true, 14#L99true, Black: 229#(and (= ~j2~0 0) (<= ~M1~0 (+ ~M2~0 ~j1~0))), Black: 104#(<= ~counter~0 1), Black: 232#(and (<= 1 ~M2~0) (= ~j2~0 0) (<= ~M1~0 (+ ~M2~0 ~j1~0))), 253#true, 17#L75true, Black: 113#(and (<= 1 ~j1~0) (<= 1 ~j2~0) (= ~i2~0 0) (<= 1 ~i1~0)), Black: 241#(and (= ~i1~0 0) (<= 1 ~N2~0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 239#(and (<= 1 ~N2~0) (= ~i2~0 0)), Black: 237#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 247#(and (= ~j2~0 0) (<= ~M1~0 (+ ~M2~0 ~j1~0))), Black: 250#(and (= ~j2~0 0) (<= ~M1~0 ~j1~0) (<= ~M1~0 (+ ~M2~0 ~j1~0))), Black: 59#(and (= ~i1~0 0) (<= 0 ~j1~0) (= ~j2~0 0) (= ~i2~0 0))]) [2024-06-27 18:04:16,368 INFO L294 olderBase$Statistics]: this new event has 32 ancestors and is cut-off event [2024-06-27 18:04:16,368 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2024-06-27 18:04:16,368 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2024-06-27 18:04:16,368 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2024-06-27 18:04:16,487 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([385] L67-->L64: Formula: (< v_~j1~0_4 v_~M1~0_2) InVars {~j1~0=v_~j1~0_4, ~M1~0=v_~M1~0_2} OutVars{~j1~0=v_~j1~0_4, ~M1~0=v_~M1~0_2} AuxVars[] AssignedVars[][87], [Black: 64#(and (<= 0 ~j1~0) (= ~j2~0 0) (= ~i2~0 0) (<= 1 ~i1~0)), 33#L64true, Black: 68#(= ~counter~0 0), Black: 171#(and (<= 0 ~j1~0) (<= 0 ~j2~0) (<= 0 ~i2~0) (<= 1 ~i1~0)), Black: 125#(and (<= 0 ~i1~0) (<= 0 ~j1~0) (<= 0 ~j2~0) (<= 0 ~i2~0)), Black: 188#(and (<= 2 ~i1~0) (<= 0 ~j1~0) (<= 0 ~j2~0) (<= 1 ~i2~0)), Black: 74#(and (<= 0 ~j1~0) (= ~j2~0 0) (<= 1 ~i1~0) (<= 1 ~i2~0)), 218#true, Black: 207#(and (<= ~N1~0 0) (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 204#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 80#(and (<= 1 ~j1~0) (= ~i1~0 0) (= ~j2~0 0) (<= 1 ~i2~0)), 101#true, Black: 86#(and (<= 0 ~j1~0) (<= 1 ~j2~0) (= ~i2~0 0) (<= 1 ~i1~0)), Black: 215#(and (= ~i1~0 0) (<= (+ ~N1~0 ~j1~0) ~M1~0) (<= (+ ~j1~0 1) ~M1~0)), Black: 212#(and (= ~i1~0 0) (<= (+ ~N1~0 ~j1~0) ~M1~0)), 245#true, Black: 93#(and (<= 1 ~j1~0) (= ~j2~0 0) (<= 1 ~i1~0) (<= 1 ~i2~0)), Black: 220#(and (<= ~M1~0 (+ ~N1~0 ~j1~0)) (= ~i1~0 0)), Black: 224#(and (<= ~M1~0 (+ ~N1~0 ~j1~0)) (= ~i1~0 0) (<= ~M1~0 ~j1~0)), Black: 99#(and (<= 1 ~j1~0) (= ~i1~0 0) (<= 1 ~j2~0) (= ~i2~0 0)), 16#L41true, 14#L99true, Black: 229#(and (= ~j2~0 0) (<= ~M1~0 (+ ~M2~0 ~j1~0))), Black: 232#(and (<= 1 ~M2~0) (= ~j2~0 0) (<= ~M1~0 (+ ~M2~0 ~j1~0))), Black: 104#(<= ~counter~0 1), Black: 103#(= ~counter~0 0), 253#true, 17#L75true, Black: 113#(and (<= 1 ~j1~0) (<= 1 ~j2~0) (= ~i2~0 0) (<= 1 ~i1~0)), Black: 241#(and (= ~i1~0 0) (<= 1 ~N2~0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 239#(and (<= 1 ~N2~0) (= ~i2~0 0)), Black: 237#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), 13#thread2EXITtrue, Black: 247#(and (= ~j2~0 0) (<= ~M1~0 (+ ~M2~0 ~j1~0))), Black: 250#(and (= ~j2~0 0) (<= ~M1~0 ~j1~0) (<= ~M1~0 (+ ~M2~0 ~j1~0))), Black: 59#(and (= ~i1~0 0) (<= 0 ~j1~0) (= ~j2~0 0) (= ~i2~0 0)), 184#(and (<= 2 ~i1~0) (<= 0 ~j1~0) (<= 0 ~j2~0) (<= 0 ~i2~0))]) [2024-06-27 18:04:16,487 INFO L294 olderBase$Statistics]: this new event has 33 ancestors and is cut-off event [2024-06-27 18:04:16,487 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2024-06-27 18:04:16,487 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2024-06-27 18:04:16,487 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2024-06-27 18:04:16,496 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([385] L67-->L64: Formula: (< v_~j1~0_4 v_~M1~0_2) InVars {~j1~0=v_~j1~0_4, ~M1~0=v_~M1~0_2} OutVars{~j1~0=v_~j1~0_4, ~M1~0=v_~M1~0_2} AuxVars[] AssignedVars[][87], [Black: 64#(and (<= 0 ~j1~0) (= ~j2~0 0) (= ~i2~0 0) (<= 1 ~i1~0)), 33#L64true, Black: 68#(= ~counter~0 0), Black: 171#(and (<= 0 ~j1~0) (<= 0 ~j2~0) (<= 0 ~i2~0) (<= 1 ~i1~0)), Black: 184#(and (<= 2 ~i1~0) (<= 0 ~j1~0) (<= 0 ~j2~0) (<= 0 ~i2~0)), Black: 125#(and (<= 0 ~i1~0) (<= 0 ~j1~0) (<= 0 ~j2~0) (<= 0 ~i2~0)), Black: 74#(and (<= 0 ~j1~0) (= ~j2~0 0) (<= 1 ~i1~0) (<= 1 ~i2~0)), 218#true, Black: 207#(and (<= ~N1~0 0) (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 204#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 80#(and (<= 1 ~j1~0) (= ~i1~0 0) (= ~j2~0 0) (<= 1 ~i2~0)), Black: 86#(and (<= 0 ~j1~0) (<= 1 ~j2~0) (= ~i2~0 0) (<= 1 ~i1~0)), Black: 215#(and (= ~i1~0 0) (<= (+ ~N1~0 ~j1~0) ~M1~0) (<= (+ ~j1~0 1) ~M1~0)), Black: 212#(and (= ~i1~0 0) (<= (+ ~N1~0 ~j1~0) ~M1~0)), 103#(= ~counter~0 0), 245#true, Black: 93#(and (<= 1 ~j1~0) (= ~j2~0 0) (<= 1 ~i1~0) (<= 1 ~i2~0)), 188#(and (<= 2 ~i1~0) (<= 0 ~j1~0) (<= 0 ~j2~0) (<= 1 ~i2~0)), Black: 220#(and (<= ~M1~0 (+ ~N1~0 ~j1~0)) (= ~i1~0 0)), Black: 224#(and (<= ~M1~0 (+ ~N1~0 ~j1~0)) (= ~i1~0 0) (<= ~M1~0 ~j1~0)), Black: 99#(and (<= 1 ~j1~0) (= ~i1~0 0) (<= 1 ~j2~0) (= ~i2~0 0)), 16#L41true, 14#L99true, Black: 229#(and (= ~j2~0 0) (<= ~M1~0 (+ ~M2~0 ~j1~0))), Black: 104#(<= ~counter~0 1), Black: 232#(and (<= 1 ~M2~0) (= ~j2~0 0) (<= ~M1~0 (+ ~M2~0 ~j1~0))), 253#true, 17#L75true, Black: 113#(and (<= 1 ~j1~0) (<= 1 ~j2~0) (= ~i2~0 0) (<= 1 ~i1~0)), Black: 241#(and (= ~i1~0 0) (<= 1 ~N2~0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 239#(and (<= 1 ~N2~0) (= ~i2~0 0)), Black: 237#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), 13#thread2EXITtrue, Black: 247#(and (= ~j2~0 0) (<= ~M1~0 (+ ~M2~0 ~j1~0))), Black: 250#(and (= ~j2~0 0) (<= ~M1~0 ~j1~0) (<= ~M1~0 (+ ~M2~0 ~j1~0))), Black: 59#(and (= ~i1~0 0) (<= 0 ~j1~0) (= ~j2~0 0) (= ~i2~0 0))]) [2024-06-27 18:04:16,496 INFO L294 olderBase$Statistics]: this new event has 33 ancestors and is cut-off event [2024-06-27 18:04:16,496 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2024-06-27 18:04:16,496 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2024-06-27 18:04:16,496 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2024-06-27 18:04:16,678 INFO L124 PetriNetUnfolderBase]: 21156/30254 cut-off events. [2024-06-27 18:04:16,678 INFO L125 PetriNetUnfolderBase]: For 294119/296449 co-relation queries the response was YES. [2024-06-27 18:04:16,823 INFO L83 FinitePrefix]: Finished finitePrefix Result has 168275 conditions, 30254 events. 21156/30254 cut-off events. For 294119/296449 co-relation queries the response was YES. Maximal size of possible extension queue 1441. Compared 198259 event pairs, 6033 based on Foata normal form. 442/29234 useless extension candidates. Maximal degree in co-relation 113451. Up to 24393 conditions per place. [2024-06-27 18:04:16,967 INFO L140 encePairwiseOnDemand]: 40/45 looper letters, 128 selfloop transitions, 32 changer transitions 24/199 dead transitions. [2024-06-27 18:04:16,967 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 199 transitions, 2675 flow [2024-06-27 18:04:16,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-27 18:04:16,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-27 18:04:16,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 166 transitions. [2024-06-27 18:04:16,969 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7377777777777778 [2024-06-27 18:04:16,969 INFO L175 Difference]: Start difference. First operand has 95 places, 138 transitions, 1858 flow. Second operand 5 states and 166 transitions. [2024-06-27 18:04:16,969 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 199 transitions, 2675 flow [2024-06-27 18:04:17,212 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 98 places, 199 transitions, 2645 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-06-27 18:04:17,215 INFO L231 Difference]: Finished difference. Result has 100 places, 135 transitions, 1945 flow [2024-06-27 18:04:17,215 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=1783, PETRI_DIFFERENCE_MINUEND_PLACES=94, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=135, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=108, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1945, PETRI_PLACES=100, PETRI_TRANSITIONS=135} [2024-06-27 18:04:17,216 INFO L281 CegarLoopForPetriNet]: 49 programPoint places, 51 predicate places. [2024-06-27 18:04:17,216 INFO L495 AbstractCegarLoop]: Abstraction has has 100 places, 135 transitions, 1945 flow [2024-06-27 18:04:17,216 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 23.2) internal successors, (116), 5 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:04:17,216 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:04:17,216 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 18:04:17,228 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-06-27 18:04:17,416 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2024-06-27 18:04:17,417 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 18:04:17,417 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:04:17,418 INFO L85 PathProgramCache]: Analyzing trace with hash 1188094007, now seen corresponding path program 1 times [2024-06-27 18:04:17,418 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:04:17,418 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1346155160] [2024-06-27 18:04:17,418 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:04:17,418 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:04:17,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:04:17,519 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-06-27 18:04:17,519 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:04:17,519 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1346155160] [2024-06-27 18:04:17,519 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1346155160] provided 0 perfect and 1 imperfect interpolant sequences [2024-06-27 18:04:17,520 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2014085274] [2024-06-27 18:04:17,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:04:17,520 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-06-27 18:04:17,520 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-27 18:04:17,521 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-06-27 18:04:17,542 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-06-27 18:04:17,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:04:17,596 INFO L262 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 6 conjunts are in the unsatisfiable core [2024-06-27 18:04:17,599 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-06-27 18:04:17,714 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-06-27 18:04:17,715 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-06-27 18:04:17,820 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-06-27 18:04:17,821 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2014085274] provided 1 perfect and 1 imperfect interpolant sequences [2024-06-27 18:04:17,821 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-06-27 18:04:17,821 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4, 4] total 9 [2024-06-27 18:04:17,821 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2128317670] [2024-06-27 18:04:17,821 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:04:17,822 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-27 18:04:17,822 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:04:17,823 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-27 18:04:17,823 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2024-06-27 18:04:17,838 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 45 [2024-06-27 18:04:17,838 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 100 places, 135 transitions, 1945 flow. Second operand has 5 states, 5 states have (on average 22.2) internal successors, (111), 5 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:04:17,838 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:04:17,839 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 45 [2024-06-27 18:04:17,839 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:04:22,085 INFO L124 PetriNetUnfolderBase]: 28989/41125 cut-off events. [2024-06-27 18:04:22,085 INFO L125 PetriNetUnfolderBase]: For 422372/424315 co-relation queries the response was YES. [2024-06-27 18:04:22,300 INFO L83 FinitePrefix]: Finished finitePrefix Result has 233082 conditions, 41125 events. 28989/41125 cut-off events. For 422372/424315 co-relation queries the response was YES. Maximal size of possible extension queue 1829. Compared 273365 event pairs, 5415 based on Foata normal form. 1063/40356 useless extension candidates. Maximal degree in co-relation 154439. Up to 17233 conditions per place. [2024-06-27 18:04:22,842 INFO L140 encePairwiseOnDemand]: 39/45 looper letters, 236 selfloop transitions, 13 changer transitions 5/265 dead transitions. [2024-06-27 18:04:22,842 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 265 transitions, 4300 flow [2024-06-27 18:04:22,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-06-27 18:04:22,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-06-27 18:04:22,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 135 transitions. [2024-06-27 18:04:22,843 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.75 [2024-06-27 18:04:22,843 INFO L175 Difference]: Start difference. First operand has 100 places, 135 transitions, 1945 flow. Second operand 4 states and 135 transitions. [2024-06-27 18:04:22,844 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 265 transitions, 4300 flow [2024-06-27 18:04:23,203 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 96 places, 265 transitions, 4147 flow, removed 16 selfloop flow, removed 6 redundant places. [2024-06-27 18:04:23,206 INFO L231 Difference]: Finished difference. Result has 98 places, 138 transitions, 1910 flow [2024-06-27 18:04:23,206 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=1833, PETRI_DIFFERENCE_MINUEND_PLACES=93, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=135, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=123, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1910, PETRI_PLACES=98, PETRI_TRANSITIONS=138} [2024-06-27 18:04:23,206 INFO L281 CegarLoopForPetriNet]: 49 programPoint places, 49 predicate places. [2024-06-27 18:04:23,206 INFO L495 AbstractCegarLoop]: Abstraction has has 98 places, 138 transitions, 1910 flow [2024-06-27 18:04:23,206 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 22.2) internal successors, (111), 5 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:04:23,206 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:04:23,206 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 18:04:23,217 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-06-27 18:04:23,407 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-06-27 18:04:23,407 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 18:04:23,407 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:04:23,408 INFO L85 PathProgramCache]: Analyzing trace with hash -2138157693, now seen corresponding path program 2 times [2024-06-27 18:04:23,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:04:23,408 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1130989767] [2024-06-27 18:04:23,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:04:23,408 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:04:23,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:04:23,483 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-06-27 18:04:23,484 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:04:23,484 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1130989767] [2024-06-27 18:04:23,484 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1130989767] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:04:23,484 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:04:23,484 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-27 18:04:23,484 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [352108699] [2024-06-27 18:04:23,484 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:04:23,485 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-06-27 18:04:23,485 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:04:23,485 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-06-27 18:04:23,485 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-06-27 18:04:23,501 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 45 [2024-06-27 18:04:23,501 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 138 transitions, 1910 flow. Second operand has 4 states, 4 states have (on average 23.25) internal successors, (93), 4 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:04:23,502 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:04:23,502 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 45 [2024-06-27 18:04:23,502 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:04:27,651 INFO L124 PetriNetUnfolderBase]: 27646/38848 cut-off events. [2024-06-27 18:04:27,651 INFO L125 PetriNetUnfolderBase]: For 420233/422295 co-relation queries the response was YES. [2024-06-27 18:04:27,860 INFO L83 FinitePrefix]: Finished finitePrefix Result has 230180 conditions, 38848 events. 27646/38848 cut-off events. For 420233/422295 co-relation queries the response was YES. Maximal size of possible extension queue 1720. Compared 250485 event pairs, 8285 based on Foata normal form. 190/37396 useless extension candidates. Maximal degree in co-relation 150468. Up to 36684 conditions per place. [2024-06-27 18:04:28,037 INFO L140 encePairwiseOnDemand]: 40/45 looper letters, 135 selfloop transitions, 3 changer transitions 9/158 dead transitions. [2024-06-27 18:04:28,037 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 101 places, 158 transitions, 2267 flow [2024-06-27 18:04:28,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-06-27 18:04:28,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-06-27 18:04:28,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 117 transitions. [2024-06-27 18:04:28,038 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.65 [2024-06-27 18:04:28,039 INFO L175 Difference]: Start difference. First operand has 98 places, 138 transitions, 1910 flow. Second operand 4 states and 117 transitions. [2024-06-27 18:04:28,039 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 101 places, 158 transitions, 2267 flow [2024-06-27 18:04:28,455 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 101 places, 158 transitions, 2249 flow, removed 9 selfloop flow, removed 0 redundant places. [2024-06-27 18:04:28,457 INFO L231 Difference]: Finished difference. Result has 103 places, 135 transitions, 1867 flow [2024-06-27 18:04:28,457 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=1858, PETRI_DIFFERENCE_MINUEND_PLACES=98, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=136, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=133, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1867, PETRI_PLACES=103, PETRI_TRANSITIONS=135} [2024-06-27 18:04:28,457 INFO L281 CegarLoopForPetriNet]: 49 programPoint places, 54 predicate places. [2024-06-27 18:04:28,457 INFO L495 AbstractCegarLoop]: Abstraction has has 103 places, 135 transitions, 1867 flow [2024-06-27 18:04:28,457 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 23.25) internal successors, (93), 4 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:04:28,458 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:04:28,458 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 18:04:28,458 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-06-27 18:04:28,458 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 18:04:28,458 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:04:28,459 INFO L85 PathProgramCache]: Analyzing trace with hash 1730718715, now seen corresponding path program 1 times [2024-06-27 18:04:28,459 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:04:28,459 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1680985617] [2024-06-27 18:04:28,459 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:04:28,459 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:04:28,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:04:28,569 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 18:04:28,570 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:04:28,570 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1680985617] [2024-06-27 18:04:28,570 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1680985617] provided 0 perfect and 1 imperfect interpolant sequences [2024-06-27 18:04:28,570 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1724855453] [2024-06-27 18:04:28,570 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:04:28,571 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-06-27 18:04:28,571 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-27 18:04:28,572 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-06-27 18:04:28,574 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-06-27 18:04:28,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:04:28,645 INFO L262 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 8 conjunts are in the unsatisfiable core [2024-06-27 18:04:28,649 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-06-27 18:04:28,700 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 18:04:28,700 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-06-27 18:04:28,766 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 18:04:28,766 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1724855453] provided 0 perfect and 2 imperfect interpolant sequences [2024-06-27 18:04:28,766 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-06-27 18:04:28,766 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 7 [2024-06-27 18:04:28,767 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1554731698] [2024-06-27 18:04:28,767 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-06-27 18:04:28,768 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 18:04:28,768 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:04:28,768 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 18:04:28,768 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-06-27 18:04:28,769 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 45 [2024-06-27 18:04:28,769 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 103 places, 135 transitions, 1867 flow. Second operand has 8 states, 8 states have (on average 24.625) internal successors, (197), 8 states have internal predecessors, (197), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:04:28,769 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:04:28,769 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 45 [2024-06-27 18:04:28,769 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:04:29,668 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([377] L44-->L41: Formula: (< v_~i1~0_2 v_~N1~0_2) InVars {~i1~0=v_~i1~0_2, ~N1~0=v_~N1~0_2} OutVars{~i1~0=v_~i1~0_2, ~N1~0=v_~N1~0_2} AuxVars[] AssignedVars[][12], [Black: 64#(and (<= 0 ~j1~0) (= ~j2~0 0) (= ~i2~0 0) (<= 1 ~i1~0)), Black: 575#(and (= ~i1~0 0) (<= (+ ~N1~0 ~j1~0) ~M1~0)), 247#(and (= ~j2~0 0) (<= ~M1~0 (+ ~M2~0 ~j1~0))), 33#L64true, Black: 578#(and (<= ~N1~0 0) (= ~i1~0 0) (<= (+ ~N1~0 ~j1~0) ~M1~0)), Black: 68#(= ~counter~0 0), Black: 171#(and (<= 0 ~j1~0) (<= 0 ~j2~0) (<= 0 ~i2~0) (<= 1 ~i1~0)), 573#true, Black: 125#(and (<= 0 ~i1~0) (<= 0 ~j1~0) (<= 0 ~j2~0) (<= 0 ~i2~0)), Black: 188#(and (<= 2 ~i1~0) (<= 0 ~j1~0) (<= 0 ~j2~0) (<= 1 ~i2~0)), 218#true, Black: 80#(and (<= 1 ~j1~0) (= ~i1~0 0) (= ~j2~0 0) (<= 1 ~i2~0)), Black: 204#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), 101#true, 585#(= ~counter~0 2), Black: 86#(and (<= 0 ~j1~0) (<= 1 ~j2~0) (= ~i2~0 0) (<= 1 ~i1~0)), Black: 215#(and (= ~i1~0 0) (<= (+ ~N1~0 ~j1~0) ~M1~0) (<= (+ ~j1~0 1) ~M1~0)), Black: 212#(and (= ~i1~0 0) (<= (+ ~N1~0 ~j1~0) ~M1~0)), Black: 93#(and (<= 1 ~j1~0) (= ~j2~0 0) (<= 1 ~i1~0) (<= 1 ~i2~0)), 232#(and (<= 1 ~M2~0) (= ~j2~0 0) (<= ~M1~0 (+ ~M2~0 ~j1~0))), Black: 220#(and (<= ~M1~0 (+ ~N1~0 ~j1~0)) (= ~i1~0 0)), 9#L52true, Black: 99#(and (<= 1 ~j1~0) (= ~i1~0 0) (<= 1 ~j2~0) (= ~i2~0 0)), 16#L41true, Black: 360#(and (<= 1 ~j1~0) (= ~M1~0 ~N1~0) (<= 2 ~N1~0) (<= ~i1~0 0)), Black: 229#(and (= ~j2~0 0) (<= ~M1~0 (+ ~M2~0 ~j1~0))), Black: 300#(and (<= 1 ~j1~0) (= ~M1~0 ~N1~0) (<= ~i1~0 0)), Black: 104#(<= ~counter~0 1), Black: 103#(= ~counter~0 0), Black: 113#(and (<= 1 ~j1~0) (<= 1 ~j2~0) (= ~i2~0 0) (<= 1 ~i1~0)), Black: 239#(and (<= 1 ~N2~0) (= ~i2~0 0)), Black: 237#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), 74#(and (<= 0 ~j1~0) (= ~j2~0 0) (<= 1 ~i1~0) (<= 1 ~i2~0)), 35#L97-5true, 367#(<= (+ ~j1~0 1) ~M1~0), 184#(and (<= 2 ~i1~0) (<= 0 ~j1~0) (<= 0 ~j2~0) (<= 0 ~i2~0)), Black: 363#true, Black: 59#(and (= ~i1~0 0) (<= 0 ~j1~0) (= ~j2~0 0) (= ~i2~0 0)), Black: 250#(and (= ~j2~0 0) (<= ~M1~0 ~j1~0) (<= ~M1~0 (+ ~M2~0 ~j1~0)))]) [2024-06-27 18:04:29,668 INFO L294 olderBase$Statistics]: this new event has 23 ancestors and is not cut-off event [2024-06-27 18:04:29,669 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is not cut-off event [2024-06-27 18:04:29,669 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is not cut-off event [2024-06-27 18:04:29,669 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is not cut-off event [2024-06-27 18:04:29,861 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([377] L44-->L41: Formula: (< v_~i1~0_2 v_~N1~0_2) InVars {~i1~0=v_~i1~0_2, ~N1~0=v_~N1~0_2} OutVars{~i1~0=v_~i1~0_2, ~N1~0=v_~N1~0_2} AuxVars[] AssignedVars[][12], [Black: 64#(and (<= 0 ~j1~0) (= ~j2~0 0) (= ~i2~0 0) (<= 1 ~i1~0)), Black: 575#(and (= ~i1~0 0) (<= (+ ~N1~0 ~j1~0) ~M1~0)), 33#L64true, 247#(and (= ~j2~0 0) (<= ~M1~0 (+ ~M2~0 ~j1~0))), Black: 578#(and (<= ~N1~0 0) (= ~i1~0 0) (<= (+ ~N1~0 ~j1~0) ~M1~0)), Black: 68#(= ~counter~0 0), Black: 171#(and (<= 0 ~j1~0) (<= 0 ~j2~0) (<= 0 ~i2~0) (<= 1 ~i1~0)), 573#true, Black: 125#(and (<= 0 ~i1~0) (<= 0 ~j1~0) (<= 0 ~j2~0) (<= 0 ~i2~0)), Black: 188#(and (<= 2 ~i1~0) (<= 0 ~j1~0) (<= 0 ~j2~0) (<= 1 ~i2~0)), 218#true, Black: 80#(and (<= 1 ~j1~0) (= ~i1~0 0) (= ~j2~0 0) (<= 1 ~i2~0)), Black: 204#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), 101#true, 585#(= ~counter~0 2), Black: 86#(and (<= 0 ~j1~0) (<= 1 ~j2~0) (= ~i2~0 0) (<= 1 ~i1~0)), Black: 215#(and (= ~i1~0 0) (<= (+ ~N1~0 ~j1~0) ~M1~0) (<= (+ ~j1~0 1) ~M1~0)), Black: 212#(and (= ~i1~0 0) (<= (+ ~N1~0 ~j1~0) ~M1~0)), Black: 93#(and (<= 1 ~j1~0) (= ~j2~0 0) (<= 1 ~i1~0) (<= 1 ~i2~0)), 232#(and (<= 1 ~M2~0) (= ~j2~0 0) (<= ~M1~0 (+ ~M2~0 ~j1~0))), Black: 220#(and (<= ~M1~0 (+ ~N1~0 ~j1~0)) (= ~i1~0 0)), 9#L52true, Black: 99#(and (<= 1 ~j1~0) (= ~i1~0 0) (<= 1 ~j2~0) (= ~i2~0 0)), 16#L41true, Black: 360#(and (<= 1 ~j1~0) (= ~M1~0 ~N1~0) (<= 2 ~N1~0) (<= ~i1~0 0)), Black: 229#(and (= ~j2~0 0) (<= ~M1~0 (+ ~M2~0 ~j1~0))), Black: 300#(and (<= 1 ~j1~0) (= ~M1~0 ~N1~0) (<= ~i1~0 0)), Black: 104#(<= ~counter~0 1), Black: 103#(= ~counter~0 0), 5#L98true, Black: 113#(and (<= 1 ~j1~0) (<= 1 ~j2~0) (= ~i2~0 0) (<= 1 ~i1~0)), Black: 239#(and (<= 1 ~N2~0) (= ~i2~0 0)), 74#(and (<= 0 ~j1~0) (= ~j2~0 0) (<= 1 ~i1~0) (<= 1 ~i2~0)), Black: 237#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), 367#(<= (+ ~j1~0 1) ~M1~0), 184#(and (<= 2 ~i1~0) (<= 0 ~j1~0) (<= 0 ~j2~0) (<= 0 ~i2~0)), Black: 59#(and (= ~i1~0 0) (<= 0 ~j1~0) (= ~j2~0 0) (= ~i2~0 0)), Black: 250#(and (= ~j2~0 0) (<= ~M1~0 ~j1~0) (<= ~M1~0 (+ ~M2~0 ~j1~0))), Black: 363#true]) [2024-06-27 18:04:29,861 INFO L294 olderBase$Statistics]: this new event has 24 ancestors and is not cut-off event [2024-06-27 18:04:29,861 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is not cut-off event [2024-06-27 18:04:29,861 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is not cut-off event [2024-06-27 18:04:29,861 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is not cut-off event [2024-06-27 18:04:30,103 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([377] L44-->L41: Formula: (< v_~i1~0_2 v_~N1~0_2) InVars {~i1~0=v_~i1~0_2, ~N1~0=v_~N1~0_2} OutVars{~i1~0=v_~i1~0_2, ~N1~0=v_~N1~0_2} AuxVars[] AssignedVars[][12], [Black: 64#(and (<= 0 ~j1~0) (= ~j2~0 0) (= ~i2~0 0) (<= 1 ~i1~0)), Black: 575#(and (= ~i1~0 0) (<= (+ ~N1~0 ~j1~0) ~M1~0)), 247#(and (= ~j2~0 0) (<= ~M1~0 (+ ~M2~0 ~j1~0))), Black: 578#(and (<= ~N1~0 0) (= ~i1~0 0) (<= (+ ~N1~0 ~j1~0) ~M1~0)), 33#L64true, Black: 68#(= ~counter~0 0), Black: 171#(and (<= 0 ~j1~0) (<= 0 ~j2~0) (<= 0 ~i2~0) (<= 1 ~i1~0)), 573#true, Black: 125#(and (<= 0 ~i1~0) (<= 0 ~j1~0) (<= 0 ~j2~0) (<= 0 ~i2~0)), Black: 188#(and (<= 2 ~i1~0) (<= 0 ~j1~0) (<= 0 ~j2~0) (<= 1 ~i2~0)), 218#true, Black: 80#(and (<= 1 ~j1~0) (= ~i1~0 0) (= ~j2~0 0) (<= 1 ~i2~0)), Black: 204#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), 101#true, 585#(= ~counter~0 2), Black: 86#(and (<= 0 ~j1~0) (<= 1 ~j2~0) (= ~i2~0 0) (<= 1 ~i1~0)), Black: 215#(and (= ~i1~0 0) (<= (+ ~N1~0 ~j1~0) ~M1~0) (<= (+ ~j1~0 1) ~M1~0)), Black: 212#(and (= ~i1~0 0) (<= (+ ~N1~0 ~j1~0) ~M1~0)), 19#L98-4true, Black: 93#(and (<= 1 ~j1~0) (= ~j2~0 0) (<= 1 ~i1~0) (<= 1 ~i2~0)), 232#(and (<= 1 ~M2~0) (= ~j2~0 0) (<= ~M1~0 (+ ~M2~0 ~j1~0))), Black: 220#(and (<= ~M1~0 (+ ~N1~0 ~j1~0)) (= ~i1~0 0)), 9#L52true, Black: 99#(and (<= 1 ~j1~0) (= ~i1~0 0) (<= 1 ~j2~0) (= ~i2~0 0)), 16#L41true, Black: 360#(and (<= 1 ~j1~0) (= ~M1~0 ~N1~0) (<= 2 ~N1~0) (<= ~i1~0 0)), Black: 229#(and (= ~j2~0 0) (<= ~M1~0 (+ ~M2~0 ~j1~0))), Black: 300#(and (<= 1 ~j1~0) (= ~M1~0 ~N1~0) (<= ~i1~0 0)), Black: 104#(<= ~counter~0 1), Black: 103#(= ~counter~0 0), Black: 113#(and (<= 1 ~j1~0) (<= 1 ~j2~0) (= ~i2~0 0) (<= 1 ~i1~0)), Black: 239#(and (<= 1 ~N2~0) (= ~i2~0 0)), Black: 237#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), 74#(and (<= 0 ~j1~0) (= ~j2~0 0) (<= 1 ~i1~0) (<= 1 ~i2~0)), 367#(<= (+ ~j1~0 1) ~M1~0), 184#(and (<= 2 ~i1~0) (<= 0 ~j1~0) (<= 0 ~j2~0) (<= 0 ~i2~0)), Black: 363#true, Black: 59#(and (= ~i1~0 0) (<= 0 ~j1~0) (= ~j2~0 0) (= ~i2~0 0)), Black: 250#(and (= ~j2~0 0) (<= ~M1~0 ~j1~0) (<= ~M1~0 (+ ~M2~0 ~j1~0)))]) [2024-06-27 18:04:30,103 INFO L294 olderBase$Statistics]: this new event has 25 ancestors and is not cut-off event [2024-06-27 18:04:30,103 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is not cut-off event [2024-06-27 18:04:30,103 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is not cut-off event [2024-06-27 18:04:30,103 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is not cut-off event [2024-06-27 18:04:30,452 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([377] L44-->L41: Formula: (< v_~i1~0_2 v_~N1~0_2) InVars {~i1~0=v_~i1~0_2, ~N1~0=v_~N1~0_2} OutVars{~i1~0=v_~i1~0_2, ~N1~0=v_~N1~0_2} AuxVars[] AssignedVars[][12], [Black: 64#(and (<= 0 ~j1~0) (= ~j2~0 0) (= ~i2~0 0) (<= 1 ~i1~0)), Black: 575#(and (= ~i1~0 0) (<= (+ ~N1~0 ~j1~0) ~M1~0)), 247#(and (= ~j2~0 0) (<= ~M1~0 (+ ~M2~0 ~j1~0))), Black: 578#(and (<= ~N1~0 0) (= ~i1~0 0) (<= (+ ~N1~0 ~j1~0) ~M1~0)), 33#L64true, Black: 68#(= ~counter~0 0), Black: 171#(and (<= 0 ~j1~0) (<= 0 ~j2~0) (<= 0 ~i2~0) (<= 1 ~i1~0)), 573#true, Black: 125#(and (<= 0 ~i1~0) (<= 0 ~j1~0) (<= 0 ~j2~0) (<= 0 ~i2~0)), Black: 188#(and (<= 2 ~i1~0) (<= 0 ~j1~0) (<= 0 ~j2~0) (<= 1 ~i2~0)), 218#true, Black: 80#(and (<= 1 ~j1~0) (= ~i1~0 0) (= ~j2~0 0) (<= 1 ~i2~0)), Black: 204#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), 101#true, 585#(= ~counter~0 2), Black: 86#(and (<= 0 ~j1~0) (<= 1 ~j2~0) (= ~i2~0 0) (<= 1 ~i1~0)), Black: 215#(and (= ~i1~0 0) (<= (+ ~N1~0 ~j1~0) ~M1~0) (<= (+ ~j1~0 1) ~M1~0)), Black: 212#(and (= ~i1~0 0) (<= (+ ~N1~0 ~j1~0) ~M1~0)), Black: 93#(and (<= 1 ~j1~0) (= ~j2~0 0) (<= 1 ~i1~0) (<= 1 ~i2~0)), 232#(and (<= 1 ~M2~0) (= ~j2~0 0) (<= ~M1~0 (+ ~M2~0 ~j1~0))), Black: 220#(and (<= ~M1~0 (+ ~N1~0 ~j1~0)) (= ~i1~0 0)), 9#L52true, Black: 99#(and (<= 1 ~j1~0) (= ~i1~0 0) (<= 1 ~j2~0) (= ~i2~0 0)), 16#L41true, Black: 360#(and (<= 1 ~j1~0) (= ~M1~0 ~N1~0) (<= 2 ~N1~0) (<= ~i1~0 0)), Black: 229#(and (= ~j2~0 0) (<= ~M1~0 (+ ~M2~0 ~j1~0))), Black: 300#(and (<= 1 ~j1~0) (= ~M1~0 ~N1~0) (<= ~i1~0 0)), Black: 104#(<= ~counter~0 1), Black: 103#(= ~counter~0 0), 40#L98-5true, Black: 113#(and (<= 1 ~j1~0) (<= 1 ~j2~0) (= ~i2~0 0) (<= 1 ~i1~0)), Black: 239#(and (<= 1 ~N2~0) (= ~i2~0 0)), Black: 237#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), 74#(and (<= 0 ~j1~0) (= ~j2~0 0) (<= 1 ~i1~0) (<= 1 ~i2~0)), 28#$Ultimate##0true, 367#(<= (+ ~j1~0 1) ~M1~0), Black: 363#true, 184#(and (<= 2 ~i1~0) (<= 0 ~j1~0) (<= 0 ~j2~0) (<= 0 ~i2~0)), Black: 59#(and (= ~i1~0 0) (<= 0 ~j1~0) (= ~j2~0 0) (= ~i2~0 0)), Black: 250#(and (= ~j2~0 0) (<= ~M1~0 ~j1~0) (<= ~M1~0 (+ ~M2~0 ~j1~0)))]) [2024-06-27 18:04:30,452 INFO L294 olderBase$Statistics]: this new event has 26 ancestors and is not cut-off event [2024-06-27 18:04:30,452 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is not cut-off event [2024-06-27 18:04:30,452 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is not cut-off event [2024-06-27 18:04:30,452 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is not cut-off event [2024-06-27 18:04:31,149 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([377] L44-->L41: Formula: (< v_~i1~0_2 v_~N1~0_2) InVars {~i1~0=v_~i1~0_2, ~N1~0=v_~N1~0_2} OutVars{~i1~0=v_~i1~0_2, ~N1~0=v_~N1~0_2} AuxVars[] AssignedVars[][12], [Black: 64#(and (<= 0 ~j1~0) (= ~j2~0 0) (= ~i2~0 0) (<= 1 ~i1~0)), Black: 575#(and (= ~i1~0 0) (<= (+ ~N1~0 ~j1~0) ~M1~0)), 33#L64true, 247#(and (= ~j2~0 0) (<= ~M1~0 (+ ~M2~0 ~j1~0))), Black: 578#(and (<= ~N1~0 0) (= ~i1~0 0) (<= (+ ~N1~0 ~j1~0) ~M1~0)), Black: 68#(= ~counter~0 0), Black: 171#(and (<= 0 ~j1~0) (<= 0 ~j2~0) (<= 0 ~i2~0) (<= 1 ~i1~0)), 573#true, Black: 125#(and (<= 0 ~i1~0) (<= 0 ~j1~0) (<= 0 ~j2~0) (<= 0 ~i2~0)), Black: 188#(and (<= 2 ~i1~0) (<= 0 ~j1~0) (<= 0 ~j2~0) (<= 1 ~i2~0)), 218#true, Black: 80#(and (<= 1 ~j1~0) (= ~i1~0 0) (= ~j2~0 0) (<= 1 ~i2~0)), Black: 204#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), 101#true, 585#(= ~counter~0 2), Black: 86#(and (<= 0 ~j1~0) (<= 1 ~j2~0) (= ~i2~0 0) (<= 1 ~i1~0)), Black: 215#(and (= ~i1~0 0) (<= (+ ~N1~0 ~j1~0) ~M1~0) (<= (+ ~j1~0 1) ~M1~0)), Black: 212#(and (= ~i1~0 0) (<= (+ ~N1~0 ~j1~0) ~M1~0)), Black: 93#(and (<= 1 ~j1~0) (= ~j2~0 0) (<= 1 ~i1~0) (<= 1 ~i2~0)), 232#(and (<= 1 ~M2~0) (= ~j2~0 0) (<= ~M1~0 (+ ~M2~0 ~j1~0))), Black: 220#(and (<= ~M1~0 (+ ~N1~0 ~j1~0)) (= ~i1~0 0)), 9#L52true, Black: 99#(and (<= 1 ~j1~0) (= ~i1~0 0) (<= 1 ~j2~0) (= ~i2~0 0)), 14#L99true, 16#L41true, Black: 229#(and (= ~j2~0 0) (<= ~M1~0 (+ ~M2~0 ~j1~0))), Black: 360#(and (<= 1 ~j1~0) (= ~M1~0 ~N1~0) (<= 2 ~N1~0) (<= ~i1~0 0)), Black: 300#(and (<= 1 ~j1~0) (= ~M1~0 ~N1~0) (<= ~i1~0 0)), Black: 104#(<= ~counter~0 1), Black: 103#(= ~counter~0 0), Black: 113#(and (<= 1 ~j1~0) (<= 1 ~j2~0) (= ~i2~0 0) (<= 1 ~i1~0)), Black: 239#(and (<= 1 ~N2~0) (= ~i2~0 0)), 74#(and (<= 0 ~j1~0) (= ~j2~0 0) (<= 1 ~i1~0) (<= 1 ~i2~0)), Black: 237#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), 28#$Ultimate##0true, 367#(<= (+ ~j1~0 1) ~M1~0), Black: 250#(and (= ~j2~0 0) (<= ~M1~0 ~j1~0) (<= ~M1~0 (+ ~M2~0 ~j1~0))), Black: 363#true, 184#(and (<= 2 ~i1~0) (<= 0 ~j1~0) (<= 0 ~j2~0) (<= 0 ~i2~0)), Black: 59#(and (= ~i1~0 0) (<= 0 ~j1~0) (= ~j2~0 0) (= ~i2~0 0))]) [2024-06-27 18:04:31,150 INFO L294 olderBase$Statistics]: this new event has 27 ancestors and is not cut-off event [2024-06-27 18:04:31,150 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is not cut-off event [2024-06-27 18:04:31,150 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is not cut-off event [2024-06-27 18:04:31,150 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is not cut-off event