About the Execution of 2025-gold for MedleyA-PT-22
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 465.955 | 41890.00 | 60156.00 | 86.20 | 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-177969025600034.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-22, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r191-oct2-177969025600034
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 588K
-rw-r--r-- 1 mcc users 4.8K Mar 7 18:21 CTLCardinality.txt
-rw-r--r-- 1 mcc users 46K Mar 7 18:21 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K Mar 7 18:21 CTLFireability.txt
-rw-r--r-- 1 mcc users 50K Mar 7 18:21 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K Mar 15 11:31 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Mar 15 11:31 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Mar 15 11:31 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Mar 15 11:31 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.2K Mar 7 18:21 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 83K Mar 7 18:21 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.4K Mar 7 18:21 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 51K Mar 7 18:21 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 15 11:31 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Mar 15 11:31 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 238K 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-22-UpperBounds-00
FORMULA_NAME MedleyA-PT-22-UpperBounds-01
FORMULA_NAME MedleyA-PT-22-UpperBounds-02
FORMULA_NAME MedleyA-PT-22-UpperBounds-03
FORMULA_NAME MedleyA-PT-22-UpperBounds-04
FORMULA_NAME MedleyA-PT-22-UpperBounds-05
FORMULA_NAME MedleyA-PT-22-UpperBounds-06
FORMULA_NAME MedleyA-PT-22-UpperBounds-07
FORMULA_NAME MedleyA-PT-22-UpperBounds-08
FORMULA_NAME MedleyA-PT-22-UpperBounds-09
FORMULA_NAME MedleyA-PT-22-UpperBounds-10
FORMULA_NAME MedleyA-PT-22-UpperBounds-11
FORMULA_NAME MedleyA-PT-22-UpperBounds-12
FORMULA_NAME MedleyA-PT-22-UpperBounds-13
FORMULA_NAME MedleyA-PT-22-UpperBounds-14
FORMULA_NAME MedleyA-PT-22-UpperBounds-15
=== Now, execution of the tool begins
BK_START 1779942894560
Invoking MCC driver with
GOLD_TOOL=
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=MedleyA-PT-22
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202505121319
[2026-05-28 04:34:56] [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:56] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-28 04:34:56] [INFO ] Load time of PNML (sax parser for PT used): 188 ms
[2026-05-28 04:34:56] [INFO ] Transformed 307 places.
[2026-05-28 04:34:56] [INFO ] Transformed 740 transitions.
[2026-05-28 04:34:56] [INFO ] Found NUPN structural information;
[2026-05-28 04:34:56] [INFO ] Parsed PT model containing 307 places and 740 transitions and 3829 arcs in 316 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 9 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 740 rows 307 cols
[2026-05-28 04:34:56] [INFO ] Computed 24 invariants in 22 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 (289 resets) in 112 ms. (88 steps per ms)
FORMULA MedleyA-PT-22-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyA-PT-22-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyA-PT-22-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyA-PT-22-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyA-PT-22-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyA-PT-22-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyA-PT-22-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyA-PT-22-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 80007 steps (474 resets) in 181 ms. (439 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1]
[2026-05-28 04:34:56] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-28 04:34:57] [INFO ] [Real]Absence check using 10 positive place invariants in 13 ms returned sat
[2026-05-28 04:34:57] [INFO ] [Real]Absence check using 10 positive and 14 generalized place invariants in 6 ms returned sat
[2026-05-28 04:34:57] [INFO ] [Real]Absence check using state equation in 179 ms returned sat
[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 10 positive place invariants in 8 ms returned sat
[2026-05-28 04:34:57] [INFO ] [Nat]Absence check using 10 positive and 14 generalized place invariants in 5 ms returned sat
[2026-05-28 04:34:57] [INFO ] [Nat]Absence check using state equation in 178 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 20 places in 271 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:58] [INFO ] Deduced a trap composed of 21 places in 175 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:58] [INFO ] Deduced a trap composed of 34 places in 154 ms of which 10 ms to minimize.
[2026-05-28 04:34:58] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 693 ms
[2026-05-28 04:34:58] [INFO ] Computed and/alt/rep : 188/493/188 causal constraints (skipped 551 transitions) in 79 ms.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-28 04:34:59] [INFO ] Deduced a trap composed of 32 places in 213 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:59] [INFO ] Deduced a trap composed of 33 places in 171 ms of which 18 ms to minimize.
[2026-05-28 04:34:59] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 514 ms
[2026-05-28 04:34:59] [INFO ] Added : 86 causal constraints over 18 iterations in 1403 ms. Result :sat
Minimization took 399 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-28 04:35:00] [INFO ] [Real]Absence check using 10 positive place invariants in 6 ms returned sat
[2026-05-28 04:35:00] [INFO ] [Real]Absence check using 10 positive and 14 generalized place invariants in 5 ms returned sat
[2026-05-28 04:35:00] [INFO ] [Real]Absence check using state equation in 148 ms returned sat
[2026-05-28 04:35:00] [INFO ] Computed and/alt/rep : 188/493/188 causal constraints (skipped 551 transitions) in 53 ms.
[2026-05-28 04:35:00] [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:00] [INFO ] [Nat]Absence check using 10 positive place invariants in 7 ms returned sat
[2026-05-28 04:35:00] [INFO ] [Nat]Absence check using 10 positive and 14 generalized place invariants in 22 ms returned sat
[2026-05-28 04:35:00] [INFO ] [Nat]Absence check using state equation in 163 ms returned sat
[2026-05-28 04:35:00] [INFO ] Computed and/alt/rep : 188/493/188 causal constraints (skipped 551 transitions) in 43 ms.
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 33 places in 203 ms of which 19 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 33 places in 289 ms of which 15 ms to minimize.
[2026-05-28 04:35:02] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 596 ms
[2026-05-28 04:35:02] [INFO ] Added : 97 causal constraints over 21 iterations in 1830 ms. Result :sat
Minimization took 377 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-28 04:35:03] [INFO ] [Real]Absence check using 10 positive place invariants in 8 ms returned sat
[2026-05-28 04:35:03] [INFO ] [Real]Absence check using 10 positive and 14 generalized place invariants in 6 ms returned sat
[2026-05-28 04:35:03] [INFO ] [Real]Absence check using state equation in 211 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-28 04:35:03] [INFO ] Deduced a trap composed of 33 places in 153 ms of which 17 ms to minimize.
[2026-05-28 04:35:03] [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:03] [INFO ] [Nat]Absence check using 10 positive place invariants in 21 ms returned sat
[2026-05-28 04:35:03] [INFO ] [Nat]Absence check using 10 positive and 14 generalized place invariants in 13 ms returned sat
[2026-05-28 04:35:04] [INFO ] [Nat]Absence check using state equation in 269 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-28 04:35:04] [INFO ] Deduced a trap composed of 19 places in 296 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:04] [INFO ] Deduced a trap composed of 33 places in 230 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-28 04:35:04] [INFO ] Deduced a trap composed of 33 places in 212 ms of which 27 ms to minimize.
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 36 places in 192 ms of which 18 ms to minimize.
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 42 places in 216 ms of which 21 ms to minimize.
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 48 places in 140 ms of which 7 ms to minimize.
[2026-05-28 04:35:05] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1501 ms
[2026-05-28 04:35:05] [INFO ] Computed and/alt/rep : 188/493/188 causal constraints (skipped 551 transitions) in 75 ms.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-28 04:35:07] [INFO ] Deduced a trap composed of 28 places in 276 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:07] [INFO ] Deduced a trap composed of 32 places in 272 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:07] [INFO ] Deduced a trap composed of 27 places in 191 ms of which 19 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 33 places in 161 ms of which 13 ms to minimize.
[2026-05-28 04:35:08] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1164 ms
[2026-05-28 04:35:08] [INFO ] Added : 92 causal constraints over 20 iterations in 2609 ms. Result :sat
Minimization took 429 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-28 04:35:08] [INFO ] [Real]Absence check using 10 positive place invariants in 7 ms returned sat
[2026-05-28 04:35:08] [INFO ] [Real]Absence check using 10 positive and 14 generalized place invariants in 6 ms returned sat
[2026-05-28 04:35:09] [INFO ] [Real]Absence check using state equation in 233 ms returned sat
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 21 places in 232 ms of which 13 ms to minimize.
[2026-05-28 04:35: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:35:09] [INFO ] [Nat]Absence check using 10 positive place invariants in 16 ms returned sat
[2026-05-28 04:35:09] [INFO ] [Nat]Absence check using 10 positive and 14 generalized place invariants in 15 ms returned sat
[2026-05-28 04:35:09] [INFO ] [Nat]Absence check using state equation in 217 ms returned sat
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 160 ms of which 14 ms to minimize.
[2026-05-28 04:35:09] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 219 ms
[2026-05-28 04:35:10] [INFO ] Computed and/alt/rep : 188/493/188 causal constraints (skipped 551 transitions) in 73 ms.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-28 04:35:11] [INFO ] Deduced a trap composed of 21 places in 281 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-28 04:35:11] [INFO ] Deduced a trap composed of 21 places in 183 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-28 04:35:12] [INFO ] Deduced a trap composed of 29 places in 155 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-28 04:35:12] [INFO ] Deduced a trap composed of 30 places in 129 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-28 04:35:12] [INFO ] Deduced a trap composed of 33 places in 169 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-28 04:35:12] [INFO ] Deduced a trap composed of 33 places in 117 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-28 04:35:12] [INFO ] Deduced a trap composed of 40 places in 90 ms of which 5 ms to minimize.
[2026-05-28 04:35:12] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 1428 ms
[2026-05-28 04:35:12] [INFO ] Added : 91 causal constraints over 19 iterations in 2950 ms. Result :sat
Minimization took 428 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-28 04:35:13] [INFO ] [Real]Absence check using 10 positive place invariants in 18 ms returned sat
[2026-05-28 04:35:13] [INFO ] [Real]Absence check using 10 positive and 14 generalized place invariants in 12 ms returned sat
[2026-05-28 04:35:13] [INFO ] [Real]Absence check using state equation in 220 ms returned sat
[2026-05-28 04:35:13] [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:13] [INFO ] [Nat]Absence check using 10 positive place invariants in 20 ms returned sat
[2026-05-28 04:35:13] [INFO ] [Nat]Absence check using 10 positive and 14 generalized place invariants in 24 ms returned sat
[2026-05-28 04:35:14] [INFO ] [Nat]Absence check using state equation in 166 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-28 04:35:14] [INFO ] Deduced a trap composed of 26 places in 288 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-28 04:35:14] [INFO ] Deduced a trap composed of 48 places in 193 ms of which 39 ms to minimize.
[2026-05-28 04:35:14] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 545 ms
[2026-05-28 04:35:14] [INFO ] Computed and/alt/rep : 188/493/188 causal constraints (skipped 551 transitions) in 41 ms.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-28 04:35:15] [INFO ] Deduced a trap composed of 21 places in 241 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-28 04:35:16] [INFO ] Deduced a trap composed of 33 places in 179 ms of which 21 ms to minimize.
[2026-05-28 04:35:16] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 520 ms
[2026-05-28 04:35:16] [INFO ] Added : 84 causal constraints over 18 iterations in 1593 ms. Result :sat
Minimization took 351 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-28 04:35:16] [INFO ] [Real]Absence check using 10 positive place invariants in 10 ms returned sat
[2026-05-28 04:35:16] [INFO ] [Real]Absence check using 10 positive and 14 generalized place invariants in 9 ms returned sat
[2026-05-28 04:35:16] [INFO ] [Real]Absence check using state equation in 194 ms returned sat
[2026-05-28 04:35:16] [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:17] [INFO ] [Nat]Absence check using 10 positive place invariants in 22 ms returned sat
[2026-05-28 04:35:17] [INFO ] [Nat]Absence check using 10 positive and 14 generalized place invariants in 6 ms returned sat
[2026-05-28 04:35:17] [INFO ] [Nat]Absence check using state equation in 146 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-28 04:35:17] [INFO ] Deduced a trap composed of 33 places in 255 ms of which 53 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-28 04:35:17] [INFO ] Deduced a trap composed of 34 places in 123 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-28 04:35:17] [INFO ] Deduced a trap composed of 34 places in 113 ms of which 10 ms to minimize.
[2026-05-28 04:35:17] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 556 ms
[2026-05-28 04:35:17] [INFO ] Computed and/alt/rep : 188/493/188 causal constraints (skipped 551 transitions) in 57 ms.
[2026-05-28 04:35:18] [INFO ] Added : 71 causal constraints over 15 iterations in 650 ms. Result :sat
Minimization took 328 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-28 04:35:18] [INFO ] [Real]Absence check using 10 positive place invariants in 6 ms returned sat
[2026-05-28 04:35:18] [INFO ] [Real]Absence check using 10 positive and 14 generalized place invariants in 5 ms returned sat
[2026-05-28 04:35:19] [INFO ] [Real]Absence check using state equation in 151 ms returned sat
[2026-05-28 04:35:19] [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:19] [INFO ] [Nat]Absence check using 10 positive place invariants in 7 ms returned sat
[2026-05-28 04:35:19] [INFO ] [Nat]Absence check using 10 positive and 14 generalized place invariants in 19 ms returned sat
[2026-05-28 04:35:19] [INFO ] [Nat]Absence check using state equation in 203 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-28 04:35:19] [INFO ] Deduced a trap composed of 34 places in 249 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-28 04:35:19] [INFO ] Deduced a trap composed of 34 places in 253 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-28 04:35:20] [INFO ] Deduced a trap composed of 50 places in 204 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-28 04:35:20] [INFO ] Deduced a trap composed of 43 places in 214 ms of which 27 ms to minimize.
[2026-05-28 04:35:20] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1040 ms
[2026-05-28 04:35:20] [INFO ] Computed and/alt/rep : 188/493/188 causal constraints (skipped 551 transitions) in 63 ms.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-28 04:35:21] [INFO ] Deduced a trap composed of 33 places in 171 ms of which 15 ms to minimize.
[2026-05-28 04:35:21] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 276 ms
[2026-05-28 04:35:21] [INFO ] Added : 68 causal constraints over 15 iterations in 1336 ms. Result :sat
Minimization took 309 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-28 04:35:22] [INFO ] [Real]Absence check using 10 positive place invariants in 10 ms returned sat
[2026-05-28 04:35:22] [INFO ] [Real]Absence check using 10 positive and 14 generalized place invariants in 17 ms returned sat
[2026-05-28 04:35:22] [INFO ] [Real]Absence check using state equation in 148 ms returned sat
[2026-05-28 04:35:22] [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:22] [INFO ] [Nat]Absence check using 10 positive place invariants in 8 ms returned sat
[2026-05-28 04:35:22] [INFO ] [Nat]Absence check using 10 positive and 14 generalized place invariants in 6 ms returned sat
[2026-05-28 04:35:22] [INFO ] [Nat]Absence check using state equation in 180 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-28 04:35:23] [INFO ] Deduced a trap composed of 33 places in 176 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-28 04:35:23] [INFO ] Deduced a trap composed of 33 places in 122 ms of which 13 ms to minimize.
[2026-05-28 04:35:23] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 361 ms
[2026-05-28 04:35:23] [INFO ] Computed and/alt/rep : 188/493/188 causal constraints (skipped 551 transitions) in 65 ms.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-28 04:35:25] [INFO ] Deduced a trap composed of 32 places in 851 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-28 04:35:25] [INFO ] Deduced a trap composed of 33 places in 201 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-28 04:35:25] [INFO ] Deduced a trap composed of 33 places in 151 ms of which 17 ms to minimize.
[2026-05-28 04:35:25] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1363 ms
[2026-05-28 04:35:25] [INFO ] Added : 85 causal constraints over 17 iterations in 2807 ms. Result :sat
Minimization took 329 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1]
FORMULA MedleyA-PT-22-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA MedleyA-PT-22-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA MedleyA-PT-22-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA MedleyA-PT-22-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA MedleyA-PT-22-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA MedleyA-PT-22-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0] Max Struct:[1, 1]
Support contains 2 out of 307 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 307/307 places, 740/740 transitions.
Graph (complete) has 1184 edges and 307 vertex of which 300 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.3 ms
Discarding 7 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 54 transitions
Trivial Post-agglo rules discarded 54 transitions
Performed 54 trivial Post agglomeration. Transition count delta: 54
Iterating post reduction 0 with 55 rules applied. Total rules applied 56 place count 300 transition count 682
Reduce places removed 54 places and 0 transitions.
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 63 rules applied. Total rules applied 119 place count 246 transition count 673
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 119 place count 246 transition count 669
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 127 place count 242 transition count 669
Discarding 69 places :
Symmetric choice reduction at 2 with 69 rule applications. Total rules 196 place count 173 transition count 583
Iterating global reduction 2 with 69 rules applied. Total rules applied 265 place count 173 transition count 583
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 265 place count 173 transition count 580
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 271 place count 170 transition count 580
Discarding 26 places :
Symmetric choice reduction at 2 with 26 rule applications. Total rules 297 place count 144 transition count 515
Iterating global reduction 2 with 26 rules applied. Total rules applied 323 place count 144 transition count 515
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 334 place count 133 transition count 488
Iterating global reduction 2 with 11 rules applied. Total rules applied 345 place count 133 transition count 488
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 351 place count 127 transition count 470
Iterating global reduction 2 with 6 rules applied. Total rules applied 357 place count 127 transition count 470
Performed 22 Post agglomeration using F-continuation condition.Transition count delta: 22
Deduced a syphon composed of 22 places in 1 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 2 with 44 rules applied. Total rules applied 401 place count 105 transition count 448
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 404 place count 102 transition count 445
Iterating global reduction 2 with 3 rules applied. Total rules applied 407 place count 102 transition count 445
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -31
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 417 place count 97 transition count 476
Drop transitions (Redundant composition of simpler transitions.) removed 22 transitions
Redundant transition composition rules discarded 22 transitions
Iterating global reduction 2 with 22 rules applied. Total rules applied 439 place count 97 transition count 454
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 2 with 2 rules applied. Total rules applied 441 place count 96 transition count 464
Free-agglomeration rule applied 7 times.
Iterating global reduction 2 with 7 rules applied. Total rules applied 448 place count 96 transition count 457
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 455 place count 89 transition count 457
Free-agglomeration rule (complex) applied 18 times.
Iterating global reduction 3 with 18 rules applied. Total rules applied 473 place count 89 transition count 653
Reduce places removed 18 places and 0 transitions.
Ensure Unique test removed 29 transitions
Reduce isomorphic transitions removed 29 transitions.
Iterating post reduction 3 with 47 rules applied. Total rules applied 520 place count 71 transition count 624
Applied a total of 520 rules in 305 ms. Remains 71 /307 variables (removed 236) and now considering 624/740 (removed 116) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 315 ms. Remains : 71/307 places, 624/740 transitions.
[2026-05-28 04:35:27] [INFO ] Flow matrix only has 516 transitions (discarded 108 similar events)
// Phase 1: matrix 516 rows 71 cols
[2026-05-28 04:35:27] [INFO ] Computed 23 invariants in 3 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0] Max Struct:[1, 1]
RANDOM walk for 1000000 steps (195563 resets) in 7268 ms. (137 steps per ms)
FORMULA MedleyA-PT-22-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyA-PT-22-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 1000001 steps (27772 resets) in 1307 ms. (764 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[] Max Struct:[]
RANDOM walk for 0 steps (0 resets) in 7 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:36] [INFO ] Flatten gal took : 117 ms
[2026-05-28 04:35:36] [INFO ] Flatten gal took : 57 ms
[2026-05-28 04:35:36] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality14582609396300598873.gal : 39 ms
[2026-05-28 04:35:36] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality548409541752501633.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/ReachabilityCardinality14582609396300598873.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality548409541752501633.prop' '--nowitness' '--gen-order' 'FOLLOW'
ITS runner timed out or was interrupted.
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...328
ITS tools runner thread asked to quit. Dying gracefully.
java.io.IOException: Stream closed
at java.base/java.io.BufferedInputStream.ensureOpen(BufferedInputStream.java:206)
at java.base/java.io.BufferedInputStream.implRead(BufferedInputStream.java:411)
at java.base/java.io.BufferedInputStream.read(BufferedInputStream.java:405)
at java.base/sun.nio.cs.StreamDecoder.readBytes(StreamDecoder.java:350)
at java.base/sun.nio.cs.StreamDecoder.implRead(StreamDecoder.java:393)
at java.base/sun.nio.cs.StreamDecoder.lockedRead(StreamDecoder.java:217)
at java.base/sun.nio.cs.StreamDecoder.read(StreamDecoder.java:171)
at java.base/java.io.InputStreamReader.read(InputStreamReader.java:188)
at java.base/java.io.BufferedReader.fill(BufferedReader.java:160)
at java.base/java.io.BufferedReader.implReadLine(BufferedReader.java:370)
at java.base/java.io.BufferedReader.readLine(BufferedReader.java:347)
at java.base/java.io.BufferedReader.readLine(BufferedReader.java:436)
at fr.lip6.move.gal.application.runner.its.ITSRunner$ITSInterpreter.run(ITSRunner.java:211)
at java.base/java.lang.Thread.run(Thread.java:1583)
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[] Max Struct:[]
All properties solved without resorting to model-checking.
Total runtime 40271 ms.
BK_STOP 1779942936450
--------------------
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="MedleyA-PT-22"
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-22, 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-177969025600034"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/MedleyA-PT-22.tgz
mv MedleyA-PT-22 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 '
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 ;
