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

About the Execution of 2025-gold for MedleyA-PT-15

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
548.775 49471.00 73988.00 139.60 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-177969025600027.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 MedleyA-PT-15, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r191-oct2-177969025600027
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 568K
-rw-r--r-- 1 mcc users 6.7K Mar 7 18:20 CTLCardinality.txt
-rw-r--r-- 1 mcc users 74K Mar 7 18:20 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.8K Mar 7 18:20 CTLFireability.txt
-rw-r--r-- 1 mcc users 83K Mar 7 18:20 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K Mar 15 11:29 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Mar 15 11:29 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Mar 15 11:29 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Mar 15 11:29 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Mar 7 18:20 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 108K Mar 7 18:20 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.6K Mar 7 18:20 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 75K Mar 7 18:20 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 15 11:29 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Mar 15 11:29 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 3 18:30 instance
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 iscolored
-rw-r--r-- 1 mcc users 110K 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 MedleyA-PT-15-UpperBounds-00
FORMULA_NAME MedleyA-PT-15-UpperBounds-01
FORMULA_NAME MedleyA-PT-15-UpperBounds-02
FORMULA_NAME MedleyA-PT-15-UpperBounds-03
FORMULA_NAME MedleyA-PT-15-UpperBounds-04
FORMULA_NAME MedleyA-PT-15-UpperBounds-05
FORMULA_NAME MedleyA-PT-15-UpperBounds-06
FORMULA_NAME MedleyA-PT-15-UpperBounds-07
FORMULA_NAME MedleyA-PT-15-UpperBounds-08
FORMULA_NAME MedleyA-PT-15-UpperBounds-09
FORMULA_NAME MedleyA-PT-15-UpperBounds-10
FORMULA_NAME MedleyA-PT-15-UpperBounds-11
FORMULA_NAME MedleyA-PT-15-UpperBounds-12
FORMULA_NAME MedleyA-PT-15-UpperBounds-13
FORMULA_NAME MedleyA-PT-15-UpperBounds-14
FORMULA_NAME MedleyA-PT-15-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1779942863668

Invoking MCC driver with
GOLD_TOOL=
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=MedleyA-PT-15
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202505121319
[2026-05-28 04:34:25] [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:34:25] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-28 04:34:25] [INFO ] Load time of PNML (sax parser for PT used): 122 ms
[2026-05-28 04:34:25] [INFO ] Transformed 192 places.
[2026-05-28 04:34:25] [INFO ] Transformed 475 transitions.
[2026-05-28 04:34:25] [INFO ] Found NUPN structural information;
[2026-05-28 04:34:25] [INFO ] Parsed PT model containing 192 places and 475 transitions and 1522 arcs in 256 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 10 ms.
Ensure Unique test removed 2 transitions
Reduce redundant transitions removed 2 transitions.
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 473 rows 192 cols
[2026-05-28 04:34:25] [INFO ] Computed 7 invariants in 24 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 (2 resets) in 53 ms. (185 steps per ms)
FORMULA MedleyA-PT-15-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyA-PT-15-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyA-PT-15-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyA-PT-15-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyA-PT-15-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyA-PT-15-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyA-PT-15-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 90008 steps (18 resets) in 174 ms. (514 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1]
[2026-05-28 04:34:26] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-28 04:34:26] [INFO ] [Real]Absence check using 7 positive place invariants in 9 ms returned sat
[2026-05-28 04:34:26] [INFO ] [Real]Absence check using state equation in 177 ms returned sat
[2026-05-28 04:34:26] [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:34:26] [INFO ] [Nat]Absence check using 7 positive place invariants in 9 ms returned sat
[2026-05-28 04:34:26] [INFO ] [Nat]Absence check using state equation in 97 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-28 04:34:27] [INFO ] Deduced a trap composed of 26 places in 120 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-28 04:34:27] [INFO ] Deduced a trap composed of 26 places in 130 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-28 04:34:27] [INFO ] Deduced a trap composed of 21 places in 107 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-28 04:34:27] [INFO ] Deduced a trap composed of 41 places in 129 ms of which 23 ms to minimize.
[2026-05-28 04:34:27] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 592 ms
[2026-05-28 04:34:27] [INFO ] Computed and/alt/rep : 370/1564/370 causal constraints (skipped 102 transitions) in 40 ms.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-28 04:34:30] [INFO ] Deduced a trap composed of 17 places in 165 ms of which 13 ms to minimize.
[2026-05-28 04:34:30] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 246 ms
[2026-05-28 04:34:30] [INFO ] Added : 249 causal constraints over 51 iterations in 2890 ms. Result :sat
Minimization took 222 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-28 04:34:30] [INFO ] [Real]Absence check using 7 positive place invariants in 5 ms returned sat
[2026-05-28 04:34:31] [INFO ] [Real]Absence check using state equation in 157 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-28 04:34:31] [INFO ] Deduced a trap composed of 26 places in 145 ms of which 13 ms to minimize.
[2026-05-28 04:34:31] [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:34:31] [INFO ] [Nat]Absence check using 7 positive place invariants in 7 ms returned sat
[2026-05-28 04:34:31] [INFO ] [Nat]Absence check using state equation in 148 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-28 04:34:31] [INFO ] Deduced a trap composed of 26 places in 160 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-28 04:34:31] [INFO ] Deduced a trap composed of 65 places in 91 ms of which 3 ms to minimize.
[2026-05-28 04:34:31] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 301 ms
[2026-05-28 04:34:31] [INFO ] Computed and/alt/rep : 370/1564/370 causal constraints (skipped 102 transitions) in 55 ms.
[2026-05-28 04:34:34] [INFO ] Added : 265 causal constraints over 53 iterations in 2980 ms. Result :sat
Minimization took 177 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-28 04:34:35] [INFO ] [Real]Absence check using 7 positive place invariants in 5 ms returned sat
[2026-05-28 04:34:35] [INFO ] [Real]Absence check using state equation in 200 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-28 04:34:35] [INFO ] Deduced a trap composed of 26 places in 216 ms of which 10 ms to minimize.
[2026-05-28 04:34:35] [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:34:35] [INFO ] [Nat]Absence check using 7 positive place invariants in 5 ms returned sat
[2026-05-28 04:34:35] [INFO ] [Nat]Absence check using state equation in 114 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-28 04:34:36] [INFO ] Deduced a trap composed of 26 places in 566 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-28 04:34:38] [INFO ] Deduced a trap composed of 41 places in 2417 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-28 04:34:38] [INFO ] Deduced a trap composed of 65 places in 119 ms of which 4 ms to minimize.
[2026-05-28 04:34:38] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 3223 ms
[2026-05-28 04:34:38] [INFO ] Computed and/alt/rep : 370/1564/370 causal constraints (skipped 102 transitions) in 41 ms.
0timeout
^^^^^^^^
(error "Invalid token: 0timeout")
Maximisation of solution failed !
Minimization took 0 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-28 04:34:40] [INFO ] [Real]Absence check using 7 positive place invariants in 4 ms returned sat
[2026-05-28 04:34:40] [INFO ] [Real]Absence check using state equation in 139 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-28 04:34:41] [INFO ] Deduced a trap composed of 26 places in 384 ms of which 28 ms to minimize.
[2026-05-28 04:34:41] [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:34:41] [INFO ] [Nat]Absence check using 7 positive place invariants in 27 ms returned sat
[2026-05-28 04:34:42] [INFO ] [Nat]Absence check using state equation in 1115 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-28 04:34:42] [INFO ] Deduced a trap composed of 24 places in 165 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-28 04:34:42] [INFO ] Deduced a trap composed of 24 places in 218 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-28 04:34:43] [INFO ] Deduced a trap composed of 26 places in 208 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-28 04:34:43] [INFO ] Deduced a trap composed of 19 places in 220 ms of which 25 ms to minimize.
[2026-05-28 04:34:43] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 915 ms
[2026-05-28 04:34:43] [INFO ] Computed and/alt/rep : 370/1564/370 causal constraints (skipped 102 transitions) in 45 ms.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-28 04:34:46] [INFO ] Deduced a trap composed of 17 places in 144 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-28 04:34:46] [INFO ] Deduced a trap composed of 18 places in 153 ms of which 18 ms to minimize.
[2026-05-28 04:34:46] [INFO ] Trap strengthening (SAT) tested/added 2/2 trap constraints in 373 ms
Maximisation of solution failed !
Minimization took 0 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-28 04:34:46] [INFO ] [Real]Absence check using 7 positive place invariants in 17 ms returned sat
[2026-05-28 04:34:47] [INFO ] [Real]Absence check using state equation in 1548 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-28 04:34:48] [INFO ] Deduced a trap composed of 24 places in 166 ms of which 12 ms to minimize.
[2026-05-28 04:34:48] [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:34:48] [INFO ] [Nat]Absence check using 7 positive place invariants in 6 ms returned sat
[2026-05-28 04:34:48] [INFO ] [Nat]Absence check using state equation in 108 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-28 04:34:48] [INFO ] Deduced a trap composed of 26 places in 176 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-28 04:34:48] [INFO ] Deduced a trap composed of 46 places in 174 ms of which 12 ms to minimize.
[2026-05-28 04:34:48] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 389 ms
[2026-05-28 04:34:48] [INFO ] Computed and/alt/rep : 370/1564/370 causal constraints (skipped 102 transitions) in 26 ms.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-28 04:34:51] [INFO ] Deduced a trap composed of 24 places in 107 ms of which 5 ms to minimize.
[2026-05-28 04:34:51] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 242 ms
[2026-05-28 04:34:51] [INFO ] Added : 235 causal constraints over 48 iterations in 2550 ms. Result :sat
Minimization took 128 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-28 04:34:51] [INFO ] [Real]Absence check using 7 positive place invariants in 6 ms returned sat
[2026-05-28 04:34:51] [INFO ] [Real]Absence check using state equation in 145 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-28 04:34:51] [INFO ] Deduced a trap composed of 26 places in 151 ms of which 13 ms to minimize.
[2026-05-28 04:34:51] [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:34:51] [INFO ] [Nat]Absence check using 7 positive place invariants in 6 ms returned sat
[2026-05-28 04:34:52] [INFO ] [Nat]Absence check using state equation in 124 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-28 04:34:52] [INFO ] Deduced a trap composed of 24 places in 129 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-28 04:34:52] [INFO ] Deduced a trap composed of 24 places in 210 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-28 04:34:52] [INFO ] Deduced a trap composed of 97 places in 128 ms of which 19 ms to minimize.
[2026-05-28 04:34:52] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 530 ms
[2026-05-28 04:34:52] [INFO ] Computed and/alt/rep : 370/1564/370 causal constraints (skipped 102 transitions) in 51 ms.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-28 04:34:54] [INFO ] Deduced a trap composed of 17 places in 182 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-28 04:34:55] [INFO ] Deduced a trap composed of 17 places in 146 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-28 04:34:55] [INFO ] Deduced a trap composed of 18 places in 193 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-28 04:34:55] [INFO ] Deduced a trap composed of 46 places in 135 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-28 04:34:56] [INFO ] Deduced a trap composed of 26 places in 160 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-28 04:34:56] [INFO ] Deduced a trap composed of 41 places in 146 ms of which 15 ms to minimize.
[2026-05-28 04:34:56] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1699 ms
[2026-05-28 04:34:56] [INFO ] Added : 251 causal constraints over 52 iterations in 4196 ms. Result :sat
Minimization took 88 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-28 04:34:56] [INFO ] [Real]Absence check using 7 positive place invariants in 7 ms returned sat
[2026-05-28 04:34:57] [INFO ] [Real]Absence check using state equation in 108 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-28 04:34:57] [INFO ] Deduced a trap composed of 26 places in 191 ms of which 12 ms to minimize.
[2026-05-28 04:34:57] [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:34:57] [INFO ] [Nat]Absence check using 7 positive place invariants in 6 ms returned sat
[2026-05-28 04:34:57] [INFO ] [Nat]Absence check using state equation in 136 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-28 04:34:57] [INFO ] Deduced a trap composed of 26 places in 112 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-28 04:34:57] [INFO ] Deduced a trap composed of 29 places in 65 ms of which 9 ms to minimize.
[2026-05-28 04:34:57] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 226 ms
[2026-05-28 04:34:57] [INFO ] Computed and/alt/rep : 370/1564/370 causal constraints (skipped 102 transitions) in 45 ms.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-28 04:35:00] [INFO ] Deduced a trap composed of 17 places in 173 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-28 04:35:00] [INFO ] Deduced a trap composed of 18 places in 192 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-28 04:35:00] [INFO ] Deduced a trap composed of 24 places in 312 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-28 04:35:01] [INFO ] Deduced a trap composed of 26 places in 148 ms of which 13 ms to minimize.
[2026-05-28 04:35:01] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1282 ms
[2026-05-28 04:35:01] [INFO ] Added : 252 causal constraints over 51 iterations in 3408 ms. Result :sat
Minimization took 171 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-28 04:35:01] [INFO ] [Real]Absence check using 7 positive place invariants in 11 ms returned sat
[2026-05-28 04:35:01] [INFO ] [Real]Absence check using state equation in 158 ms returned sat
[2026-05-28 04:35:01] [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:35:01] [INFO ] [Nat]Absence check using 7 positive place invariants in 8 ms returned sat
[2026-05-28 04:35:01] [INFO ] [Nat]Absence check using state equation in 216 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-28 04:35:02] [INFO ] Deduced a trap composed of 26 places in 104 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-28 04:35:02] [INFO ] Deduced a trap composed of 26 places in 93 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-28 04:35:02] [INFO ] Deduced a trap composed of 21 places in 182 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-28 04:35:02] [INFO ] Deduced a trap composed of 41 places in 170 ms of which 14 ms to minimize.
[2026-05-28 04:35:02] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 632 ms
[2026-05-28 04:35:02] [INFO ] Computed and/alt/rep : 370/1564/370 causal constraints (skipped 102 transitions) in 38 ms.
[2026-05-28 04:35:04] [INFO ] Added : 198 causal constraints over 41 iterations in 2316 ms. Result :sat
Minimization took 145 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-28 04:35:05] [INFO ] [Real]Absence check using 7 positive place invariants in 15 ms returned sat
[2026-05-28 04:35:05] [INFO ] [Real]Absence check using state equation in 143 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-28 04:35:05] [INFO ] Deduced a trap composed of 26 places in 144 ms of which 13 ms to minimize.
[2026-05-28 04:35:05] [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:35:05] [INFO ] [Nat]Absence check using 7 positive place invariants in 5 ms returned sat
[2026-05-28 04:35:05] [INFO ] [Nat]Absence check using state equation in 160 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-28 04:35:05] [INFO ] Deduced a trap composed of 24 places in 132 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-28 04:35:06] [INFO ] Deduced a trap composed of 24 places in 166 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-28 04:35:06] [INFO ] Deduced a trap composed of 26 places in 126 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-28 04:35:06] [INFO ] Deduced a trap composed of 19 places in 144 ms of which 29 ms to minimize.
[2026-05-28 04:35:06] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 652 ms
[2026-05-28 04:35:06] [INFO ] Computed and/alt/rep : 370/1564/370 causal constraints (skipped 102 transitions) in 36 ms.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-28 04:35:08] [INFO ] Deduced a trap composed of 18 places in 163 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-28 04:35:08] [INFO ] Deduced a trap composed of 17 places in 125 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-28 04:35:09] [INFO ] Deduced a trap composed of 29 places in 192 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-28 04:35:09] [INFO ] Deduced a trap composed of 30 places in 111 ms of which 15 ms to minimize.
[2026-05-28 04:35:09] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 971 ms
[2026-05-28 04:35:09] [INFO ] Added : 256 causal constraints over 52 iterations in 2970 ms. Result :sat
Minimization took 178 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1]
FORMULA MedleyA-PT-15-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1]
Support contains 8 out of 192 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 192/192 places, 473/473 transitions.
Graph (trivial) has 210 edges and 192 vertex of which 9 / 192 are part of one of the 3 SCC in 2 ms
Free SCC test removed 6 places
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 24 transitions
Trivial Post-agglo rules discarded 24 transitions
Performed 24 trivial Post agglomeration. Transition count delta: 24
Iterating post reduction 0 with 24 rules applied. Total rules applied 25 place count 186 transition count 440
Reduce places removed 24 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 27 rules applied. Total rules applied 52 place count 162 transition count 437
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 53 place count 161 transition count 437
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 53 place count 161 transition count 431
Deduced a syphon composed of 6 places in 2 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 65 place count 155 transition count 431
Discarding 44 places :
Symmetric choice reduction at 3 with 44 rule applications. Total rules 109 place count 111 transition count 355
Iterating global reduction 3 with 44 rules applied. Total rules applied 153 place count 111 transition count 355
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 3 with 17 rules applied. Total rules applied 170 place count 111 transition count 338
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 8 Pre rules applied. Total rules applied 170 place count 111 transition count 330
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 4 with 16 rules applied. Total rules applied 186 place count 103 transition count 330
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 187 place count 103 transition count 329
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 188 place count 102 transition count 325
Iterating global reduction 5 with 1 rules applied. Total rules applied 189 place count 102 transition count 325
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 1 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 5 with 18 rules applied. Total rules applied 207 place count 93 transition count 316
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: -104
Deduced a syphon composed of 15 places in 1 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 5 with 30 rules applied. Total rules applied 237 place count 78 transition count 420
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 240 place count 78 transition count 417
Drop transitions (Redundant composition of simpler transitions.) removed 55 transitions
Redundant transition composition rules discarded 55 transitions
Iterating global reduction 6 with 55 rules applied. Total rules applied 295 place count 78 transition count 362
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -10
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 297 place count 77 transition count 372
Free-agglomeration rule applied 22 times with reduction of 7 identical transitions.
Iterating global reduction 6 with 22 rules applied. Total rules applied 319 place count 77 transition count 343
Reduce places removed 22 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 29 transitions
Reduce isomorphic transitions removed 29 transitions.
Iterating post reduction 6 with 51 rules applied. Total rules applied 370 place count 55 transition count 314
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -13
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 372 place count 54 transition count 327
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 7 with 6 rules applied. Total rules applied 378 place count 54 transition count 321
Drop transitions (Redundant composition of simpler transitions.) removed 34 transitions
Redundant transition composition rules discarded 34 transitions
Iterating global reduction 8 with 34 rules applied. Total rules applied 412 place count 54 transition count 287
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 8 with 1 rules applied. Total rules applied 413 place count 53 transition count 286
Reduce places removed 2 places and 0 transitions.
Graph (trivial) has 35 edges and 51 vertex of which 8 / 51 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 8 with 3 rules applied. Total rules applied 416 place count 47 transition count 286
Drop transitions (Empty/Sink Transition effects.) removed 48 transitions
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 60 transitions.
Iterating post reduction 9 with 60 rules applied. Total rules applied 476 place count 47 transition count 226
Discarding 4 places :
Symmetric choice reduction at 10 with 4 rule applications. Total rules 480 place count 43 transition count 198
Iterating global reduction 10 with 4 rules applied. Total rules applied 484 place count 43 transition count 198
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 10 with 1 rules applied. Total rules applied 485 place count 43 transition count 197
Drop transitions (Redundant composition of simpler transitions.) removed 38 transitions
Redundant transition composition rules discarded 38 transitions
Iterating global reduction 11 with 38 rules applied. Total rules applied 523 place count 43 transition count 159
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 11 with 4 rules applied. Total rules applied 527 place count 41 transition count 157
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -5
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 11 with 2 rules applied. Total rules applied 529 place count 40 transition count 162
Drop transitions (Redundant composition of simpler transitions.) removed 12 transitions
Redundant transition composition rules discarded 12 transitions
Iterating global reduction 11 with 12 rules applied. Total rules applied 541 place count 40 transition count 150
Free-agglomeration rule applied 1 times.
Iterating global reduction 11 with 1 rules applied. Total rules applied 542 place count 40 transition count 149
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 11 with 1 rules applied. Total rules applied 543 place count 39 transition count 149
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 12 with 1 rules applied. Total rules applied 544 place count 39 transition count 149
Applied a total of 544 rules in 132 ms. Remains 39 /192 variables (removed 153) and now considering 149/473 (removed 324) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 140 ms. Remains : 39/192 places, 149/473 transitions.
[2026-05-28 04:35:10] [INFO ] Flow matrix only has 137 transitions (discarded 12 similar events)
// Phase 1: matrix 137 rows 39 cols
[2026-05-28 04:35:10] [INFO ] Computed 5 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1]
RANDOM walk for 1000000 steps (51 resets) in 1189 ms. (840 steps per ms)
FORMULA MedleyA-PT-15-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyA-PT-15-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyA-PT-15-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyA-PT-15-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyA-PT-15-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyA-PT-15-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyA-PT-15-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 1000000 steps (43 resets) in 1304 ms. (766 steps per ms)
FORMULA MedleyA-PT-15-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
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:35:13] [INFO ] Flatten gal took : 55 ms
[2026-05-28 04:35:13] [INFO ] Flatten gal took : 17 ms
[2026-05-28 04:35:13] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality13475052347982809856.gal : 9 ms
[2026-05-28 04:35:13] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality5067954679726467920.prop : 1 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/ReachabilityCardinality13475052347982809856.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality5067954679726467920.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 47613 ms.

BK_STOP 1779942913139

--------------------
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//
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202505121319.jar
++ perl -pe 's/.*\.//g'
+ 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="MedleyA-PT-15"
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 MedleyA-PT-15, 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-177969025600027"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/MedleyA-PT-15.tgz
mv MedleyA-PT-15 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 ;