fond
Model Checking Contest 2026
16th edition, Hamburg, Germany, June 23, 2026
Execution of r191-oct2-177969025600044
Last Updated
Jun 17, 2026

About the Execution of 2025-gold for MedleyB-PT-B09

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
948.896 87322.00 109869.00 128.30 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 normal

Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/sdalzilio/mcc2026-input.r191-oct2-177969025600044.qcow2', fmt=qcow2 cluster_size=65536 extended_l2=off compression_type=zlib size=4294967296 backing_file=/data/sdalzilio/mcc2026-input.qcow2 backing_fmt=qcow2 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5973
Executing tool gold2025
Input is MedleyB-PT-B09, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r191-oct2-177969025600044
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 12M
-rw-r--r-- 1 mcc users 5.8K Mar 7 18:26 CTLCardinality.txt
-rw-r--r-- 1 mcc users 59K Mar 7 18:26 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.9K Mar 7 18:26 CTLFireability.txt
-rw-r--r-- 1 mcc users 41K Mar 7 18:26 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K Mar 15 11:34 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Mar 15 11:34 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Mar 15 11:34 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 15 11:34 LTLFireability.xml
-rw-r--r-- 1 mcc users 16K Mar 7 18:26 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 176K Mar 7 18:26 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.5K Mar 7 18:26 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 59K Mar 7 18:26 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 15 11:34 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Mar 15 11:34 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 3 18:30 instance
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 iscolored
-rw-r--r-- 1 mcc users 12M Mar 3 18:30 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of positive values
NUM_VECTOR

echo here is the order used to build the result vector(from xml file)
FORMULA_NAME MedleyB-PT-B09-UpperBounds-00
FORMULA_NAME MedleyB-PT-B09-UpperBounds-01
FORMULA_NAME MedleyB-PT-B09-UpperBounds-02
FORMULA_NAME MedleyB-PT-B09-UpperBounds-03
FORMULA_NAME MedleyB-PT-B09-UpperBounds-04
FORMULA_NAME MedleyB-PT-B09-UpperBounds-05
FORMULA_NAME MedleyB-PT-B09-UpperBounds-06
FORMULA_NAME MedleyB-PT-B09-UpperBounds-07
FORMULA_NAME MedleyB-PT-B09-UpperBounds-08
FORMULA_NAME MedleyB-PT-B09-UpperBounds-09
FORMULA_NAME MedleyB-PT-B09-UpperBounds-10
FORMULA_NAME MedleyB-PT-B09-UpperBounds-11
FORMULA_NAME MedleyB-PT-B09-UpperBounds-12
FORMULA_NAME MedleyB-PT-B09-UpperBounds-13
FORMULA_NAME MedleyB-PT-B09-UpperBounds-14
FORMULA_NAME MedleyB-PT-B09-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1779942925056

Invoking MCC driver with
GOLD_TOOL=
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=MedleyB-PT-B09
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202505121319
[2026-05-28 04:35:26] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2026-05-28 04:35:26] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-28 04:35:27] [INFO ] Load time of PNML (sax parser for PT used): 717 ms
[2026-05-28 04:35:27] [INFO ] Transformed 2435 places.
[2026-05-28 04:35:27] [INFO ] Transformed 15948 transitions.
[2026-05-28 04:35:27] [INFO ] Found NUPN structural information;
[2026-05-28 04:35:27] [INFO ] Parsed PT model containing 2435 places and 15948 transitions and 219484 arcs in 947 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 7 ms.
Current structural bounds on expressions (Initiallly, because the net is safe) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
// Phase 1: matrix 15948 rows 2435 cols
[2026-05-28 04:35:28] [INFO ] Computed 9 invariants in 451 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
RANDOM walk for 10000 steps (67 resets) in 216 ms. (46 steps per ms)
FORMULA MedleyB-PT-B09-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyB-PT-B09-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyB-PT-B09-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyB-PT-B09-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyB-PT-B09-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 110011 steps (98 resets) in 240 ms. (456 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2026-05-28 04:35:28] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-28 04:35:29] [INFO ] [Real]Absence check using 9 positive place invariants in 49 ms returned sat
[2026-05-28 04:35:33] [INFO ] [Real]Absence check using state equation in 4362 ms returned unknown
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-28 04:35:34] [INFO ] [Real]Absence check using 9 positive place invariants in 41 ms returned sat
[2026-05-28 04:35:38] [INFO ] [Real]Absence check using state equation in 4467 ms returned unknown
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-28 04:35:39] [INFO ] [Real]Absence check using 9 positive place invariants in 43 ms returned sat
[2026-05-28 04:35:43] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ... while checking expression at index 2
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:301)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:854)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2252)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:927)
at fr.lip6.move.gal.application.Application.start(Application.java:193)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:44)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:149)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:115)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:467)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:298)
at java.base/jdk.internal.reflect.DirectMethodHandleAccessor.invoke(DirectMethodHandleAccessor.java:103)
at java.base/java.lang.reflect.Method.invoke(Method.java:580)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:670)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:607)
at org.eclipse.equinox.launcher.Main.run(Main.java:1492)
at org.eclipse.equinox.launcher.Main.main(Main.java:1465)
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-28 04:35:44] [INFO ] [Real]Absence check using 9 positive place invariants in 57 ms returned sat
[2026-05-28 04:35:48] [INFO ] [Real]Absence check using state equation in 4468 ms returned unknown
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-28 04:35:49] [INFO ] [Real]Absence check using 9 positive place invariants in 70 ms returned sat
[2026-05-28 04:35:53] [INFO ] [Real]Absence check using state equation in 4509 ms returned unknown
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-28 04:35:54] [INFO ] [Real]Absence check using 9 positive place invariants in 40 ms returned sat
[2026-05-28 04:35:58] [INFO ] [Real]Absence check using state equation in 4380 ms returned unknown
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-28 04:35:59] [INFO ] [Real]Absence check using 9 positive place invariants in 43 ms returned sat
[2026-05-28 04:36:04] [INFO ] [Real]Absence check using state equation in 4522 ms returned unknown
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-28 04:36:04] [INFO ] [Real]Absence check using 9 positive place invariants in 41 ms returned sat
[2026-05-28 04:36:09] [INFO ] [Real]Absence check using state equation in 4538 ms returned sat
[2026-05-28 04:36:09] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-28 04:36:09] [INFO ] [Nat]Absence check using 9 positive place invariants in 42 ms returned sat
[2026-05-28 04:36:14] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 7
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:301)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:854)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2254)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:927)
at fr.lip6.move.gal.application.Application.start(Application.java:193)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:44)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:149)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:115)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:467)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:298)
at java.base/jdk.internal.reflect.DirectMethodHandleAccessor.invoke(DirectMethodHandleAccessor.java:103)
at java.base/java.lang.reflect.Method.invoke(Method.java:580)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:670)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:607)
at org.eclipse.equinox.launcher.Main.run(Main.java:1492)
at org.eclipse.equinox.launcher.Main.main(Main.java:1465)
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-28 04:36:14] [INFO ] [Real]Absence check using 9 positive place invariants in 41 ms returned sat
[2026-05-28 04:36:19] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 8
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:301)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:854)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2252)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:927)
at fr.lip6.move.gal.application.Application.start(Application.java:193)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:44)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:149)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:115)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:467)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:298)
at java.base/jdk.internal.reflect.DirectMethodHandleAccessor.invoke(DirectMethodHandleAccessor.java:103)
at java.base/java.lang.reflect.Method.invoke(Method.java:580)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:670)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:607)
at org.eclipse.equinox.launcher.Main.run(Main.java:1492)
at org.eclipse.equinox.launcher.Main.main(Main.java:1465)
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-28 04:36:19] [INFO ] [Real]Absence check using 9 positive place invariants in 79 ms returned sat
[2026-05-28 04:36:24] [INFO ] [Real]Absence check using state equation in 4480 ms returned unknown
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-28 04:36:24] [INFO ] [Real]Absence check using 9 positive place invariants in 52 ms returned sat
[2026-05-28 04:36:29] [INFO ] [Real]Absence check using state equation in 4588 ms returned unknown
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
Support contains 11 out of 2435 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2435/2435 places, 15948/15948 transitions.
Graph (trivial) has 2397 edges and 2435 vertex of which 151 / 2435 are part of one of the 23 SCC in 21 ms
Free SCC test removed 128 places
Drop transitions (Empty/Sink Transition effects.) removed 166 transitions
Reduce isomorphic transitions removed 166 transitions.
Graph (complete) has 3983 edges and 2307 vertex of which 2291 are kept as prefixes of interest. Removing 16 places using SCC suffix rule.53 ms
Discarding 16 places :
Also discarding 8 output transitions
Drop transitions (Output transitions of discarded places.) removed 8 transitions
Drop transitions (Empty/Sink Transition effects.) removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1826 transitions
Trivial Post-agglo rules discarded 1826 transitions
Performed 1826 trivial Post agglomeration. Transition count delta: 1826
Iterating post reduction 0 with 1834 rules applied. Total rules applied 1836 place count 2291 transition count 13940
Reduce places removed 1826 places and 0 transitions.
Ensure Unique test removed 38 transitions
Reduce isomorphic transitions removed 38 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 22 transitions
Trivial Post-agglo rules discarded 22 transitions
Performed 22 trivial Post agglomeration. Transition count delta: 22
Iterating post reduction 1 with 1886 rules applied. Total rules applied 3722 place count 465 transition count 13880
Reduce places removed 22 places and 0 transitions.
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Iterating post reduction 2 with 29 rules applied. Total rules applied 3751 place count 443 transition count 13873
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 3 with 7 rules applied. Total rules applied 3758 place count 436 transition count 13873
Performed 83 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 83 Pre rules applied. Total rules applied 3758 place count 436 transition count 13790
Deduced a syphon composed of 83 places in 8 ms
Reduce places removed 83 places and 0 transitions.
Iterating global reduction 4 with 166 rules applied. Total rules applied 3924 place count 353 transition count 13790
Discarding 93 places :
Symmetric choice reduction at 4 with 93 rule applications. Total rules 4017 place count 260 transition count 13697
Iterating global reduction 4 with 93 rules applied. Total rules applied 4110 place count 260 transition count 13697
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 4110 place count 260 transition count 13696
Deduced a syphon composed of 1 places in 8 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 4112 place count 259 transition count 13696
Discarding 49 places :
Symmetric choice reduction at 4 with 49 rule applications. Total rules 4161 place count 210 transition count 1038
Iterating global reduction 4 with 49 rules applied. Total rules applied 4210 place count 210 transition count 1038
Ensure Unique test removed 22 transitions
Reduce isomorphic transitions removed 22 transitions.
Iterating post reduction 4 with 22 rules applied. Total rules applied 4232 place count 210 transition count 1016
Discarding 13 places :
Symmetric choice reduction at 5 with 13 rule applications. Total rules 4245 place count 197 transition count 1003
Iterating global reduction 5 with 13 rules applied. Total rules applied 4258 place count 197 transition count 1003
Discarding 11 places :
Symmetric choice reduction at 5 with 11 rule applications. Total rules 4269 place count 186 transition count 992
Iterating global reduction 5 with 11 rules applied. Total rules applied 4280 place count 186 transition count 992
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 5 with 11 rules applied. Total rules applied 4291 place count 186 transition count 981
Performed 26 Post agglomeration using F-continuation condition.Transition count delta: 26
Deduced a syphon composed of 26 places in 0 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 6 with 52 rules applied. Total rules applied 4343 place count 160 transition count 955
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 4344 place count 160 transition count 954
Discarding 8 places :
Symmetric choice reduction at 7 with 8 rule applications. Total rules 4352 place count 152 transition count 946
Iterating global reduction 7 with 8 rules applied. Total rules applied 4360 place count 152 transition count 946
Discarding 8 places :
Symmetric choice reduction at 7 with 8 rule applications. Total rules 4368 place count 144 transition count 938
Iterating global reduction 7 with 8 rules applied. Total rules applied 4376 place count 144 transition count 938
Discarding 8 places :
Symmetric choice reduction at 7 with 8 rule applications. Total rules 4384 place count 136 transition count 930
Iterating global reduction 7 with 8 rules applied. Total rules applied 4392 place count 136 transition count 930
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -16
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 7 with 8 rules applied. Total rules applied 4400 place count 132 transition count 946
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 4401 place count 132 transition count 945
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 4402 place count 132 transition count 944
Free-agglomeration rule applied 48 times.
Iterating global reduction 8 with 48 rules applied. Total rules applied 4450 place count 132 transition count 896
Reduce places removed 48 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Ensure Unique test removed 63 transitions
Reduce isomorphic transitions removed 65 transitions.
Iterating post reduction 8 with 113 rules applied. Total rules applied 4563 place count 84 transition count 831
Renaming transitions due to excessive name length > 1024 char.
Discarding 8 places :
Symmetric choice reduction at 9 with 8 rule applications. Total rules 4571 place count 76 transition count 823
Iterating global reduction 9 with 8 rules applied. Total rules applied 4579 place count 76 transition count 823
Drop transitions (Redundant composition of simpler transitions.) removed 262 transitions
Redundant transition composition rules discarded 262 transitions
Iterating global reduction 9 with 262 rules applied. Total rules applied 4841 place count 76 transition count 561
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 4843 place count 75 transition count 560
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -18
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 9 with 4 rules applied. Total rules applied 4847 place count 73 transition count 578
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 9 with 2 rules applied. Total rules applied 4849 place count 73 transition count 576
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 9 with 2 rules applied. Total rules applied 4851 place count 71 transition count 576
Partial Free-agglomeration rule applied 10 times.
Drop transitions (Partial Free agglomeration) removed 10 transitions
Iterating global reduction 10 with 10 rules applied. Total rules applied 4861 place count 71 transition count 576
Drop transitions (Redundant composition of simpler transitions.) removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 10 with 5 rules applied. Total rules applied 4866 place count 71 transition count 571
Applied a total of 4866 rules in 2660 ms. Remains 71 /2435 variables (removed 2364) and now considering 571/15948 (removed 15377) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2669 ms. Remains : 71/2435 places, 571/15948 transitions.
// Phase 1: matrix 571 rows 71 cols
[2026-05-28 04:36:31] [INFO ] Computed 9 invariants in 6 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
RANDOM walk for 1000000 steps (2 resets) in 19237 ms. (51 steps per ms)
FORMULA MedleyB-PT-B09-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyB-PT-B09-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyB-PT-B09-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyB-PT-B09-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyB-PT-B09-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyB-PT-B09-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyB-PT-B09-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyB-PT-B09-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyB-PT-B09-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyB-PT-B09-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyB-PT-B09-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 1000001 steps (2 resets) in 613 ms. (1628 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[] Max Struct:[]
RANDOM walk for 0 steps (0 resets) in 4 ms. (0 steps per ms) remains 0/0 properties
Finished probabilistic random walk after 0 steps, run visited all 0 properties in 0 ms. (steps per millisecond=0 )
[2026-05-28 04:36:52] [INFO ] Flatten gal took : 124 ms
[2026-05-28 04:36:52] [INFO ] Flatten gal took : 48 ms
[2026-05-28 04:36:52] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality2519362763164200081.gal : 46 ms
[2026-05-28 04:36:52] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality11382641723342493906.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality2519362763164200081.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality11382641723342493906.prop' '--nowitness' '--gen-order' 'FOLLOW'
ITS runner timed out or was interrupted.

ITS tools runner thread asked to quit. Dying gracefully.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[] Max Struct:[]
All properties solved without resorting to model-checking.
Total runtime 85935 ms.

BK_STOP 1779943012378

--------------------
content from stderr:

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ UpperBounds = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202505121319.jar
+ VERSION=202505121319
+ echo 'Running Version 202505121319'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="MedleyB-PT-B09"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="gold2025"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5973"
echo " Executing tool gold2025"
echo " Input is MedleyB-PT-B09, examination is UpperBounds"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r191-oct2-177969025600044"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/MedleyB-PT-B09.tgz
mv MedleyB-PT-B09 execution
cd execution
if [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "UpperBounds" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] || [ "UpperBounds" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "UpperBounds" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "UpperBounds" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "UpperBounds.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' UpperBounds.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] ; then
echo "FORMULA_NAME UpperBounds"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;