Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r125-tall-174876435700045.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2025-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5832
Executing tool gold2024
Input is IBMB2S565S3960-PT-none, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r125-tall-174876435700045
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 744K
-rw-r--r-- 1 mcc users 9.8K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 64K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 11K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 65K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 29 14:32 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 31K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 4.3K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 21K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 31K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 191K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 22K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 106K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.2K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.2K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 5 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 127K May 29 14:32 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 IBMB2S565S3960-PT-none-UpperBounds-00
FORMULA_NAME IBMB2S565S3960-PT-none-UpperBounds-01
FORMULA_NAME IBMB2S565S3960-PT-none-UpperBounds-02
FORMULA_NAME IBMB2S565S3960-PT-none-UpperBounds-03
FORMULA_NAME IBMB2S565S3960-PT-none-UpperBounds-04
FORMULA_NAME IBMB2S565S3960-PT-none-UpperBounds-05
FORMULA_NAME IBMB2S565S3960-PT-none-UpperBounds-06
FORMULA_NAME IBMB2S565S3960-PT-none-UpperBounds-07
FORMULA_NAME IBMB2S565S3960-PT-none-UpperBounds-08
FORMULA_NAME IBMB2S565S3960-PT-none-UpperBounds-09
FORMULA_NAME IBMB2S565S3960-PT-none-UpperBounds-10
FORMULA_NAME IBMB2S565S3960-PT-none-UpperBounds-11
FORMULA_NAME IBMB2S565S3960-PT-none-UpperBounds-12
FORMULA_NAME IBMB2S565S3960-PT-none-UpperBounds-13
FORMULA_NAME IBMB2S565S3960-PT-none-UpperBounds-14
FORMULA_NAME IBMB2S565S3960-PT-none-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1748774244187

Invoking MCC driver with
BK_TOOL=gold2024
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=IBMB2S565S3960-PT-none
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202405141337
[2025-06-01 10:37: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]
[2025-06-01 10:37:25] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-01 10:37:25] [INFO ] Load time of PNML (sax parser for PT used): 66 ms
[2025-06-01 10:37:25] [INFO ] Transformed 273 places.
[2025-06-01 10:37:25] [INFO ] Transformed 179 transitions.
[2025-06-01 10:37:25] [INFO ] Parsed PT model containing 273 places and 179 transitions and 572 arcs in 191 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 8 ms.
Current structural bounds on expressions (Initially) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
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:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
// Phase 1: matrix 179 rows 273 cols
[2025-06-01 10:37:25] [INFO ] Computed 101 invariants in 26 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:[250, 100, 100, 100, 100, 100, 100, 100, 100, 7, 50, 7, 100, 100, 7, 50]
RANDOM walk for 10000 steps (36 resets) in 21 ms. (454 steps per ms)
FORMULA IBMB2S565S3960-PT-none-UpperBounds-11 7 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA IBMB2S565S3960-PT-none-UpperBounds-14 7 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 150012 steps (101 resets) in 151 ms. (986 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 1, 1, 7, 4, 1, 7, 4, 2, 2, 0, 1, 4, 0] Max Struct:[250, 100, 100, 100, 100, 100, 100, 100, 100, 7, 50, 100, 100, 50]
[2025-06-01 10:37:25] [INFO ] Invariant cache hit.
[2025-06-01 10:37:26] [INFO ] [Real]Absence check using 2 positive place invariants in 8 ms returned sat
[2025-06-01 10:37:26] [INFO ] [Real]Absence check using 2 positive and 99 generalized place invariants in 26 ms returned sat
[2025-06-01 10:37:26] [INFO ] [Real]Absence check using state equation in 74 ms returned sat
[2025-06-01 10:37:26] [INFO ] Computed and/alt/rep : 178/299/178 causal constraints (skipped 0 transitions) in 20 ms.
[2025-06-01 10:37:26] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 10:37:26] [INFO ] [Nat]Absence check using 2 positive place invariants in 4 ms returned sat
[2025-06-01 10:37:26] [INFO ] [Nat]Absence check using 2 positive and 99 generalized place invariants in 34 ms returned sat
[2025-06-01 10:37:26] [INFO ] [Nat]Absence check using state equation in 126 ms returned sat
[2025-06-01 10:37:26] [INFO ] Computed and/alt/rep : 178/299/178 causal constraints (skipped 0 transitions) in 13 ms.
[2025-06-01 10:37:27] [INFO ] Added : 156 causal constraints over 32 iterations in 570 ms. Result :sat
Minimization took 147 ms.
[2025-06-01 10:37:27] [INFO ] [Real]Absence check using 2 positive place invariants in 7 ms returned sat
[2025-06-01 10:37:27] [INFO ] [Real]Absence check using 2 positive and 99 generalized place invariants in 14 ms returned sat
[2025-06-01 10:37:27] [INFO ] [Real]Absence check using state equation in 57 ms returned unsat
[2025-06-01 10:37:27] [INFO ] [Real]Absence check using 2 positive place invariants in 3 ms returned sat
[2025-06-01 10:37:27] [INFO ] [Real]Absence check using 2 positive and 99 generalized place invariants in 13 ms returned sat
[2025-06-01 10:37:27] [INFO ] [Real]Absence check using state equation in 63 ms returned sat
[2025-06-01 10:37:27] [INFO ] Computed and/alt/rep : 178/299/178 causal constraints (skipped 0 transitions) in 13 ms.
[2025-06-01 10:37:27] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 10:37:28] [INFO ] [Nat]Absence check using 2 positive place invariants in 4 ms returned sat
[2025-06-01 10:37:28] [INFO ] [Nat]Absence check using 2 positive and 99 generalized place invariants in 28 ms returned sat
[2025-06-01 10:37:28] [INFO ] [Nat]Absence check using state equation in 60 ms returned sat
[2025-06-01 10:37:28] [INFO ] Computed and/alt/rep : 178/299/178 causal constraints (skipped 0 transitions) in 12 ms.
[2025-06-01 10:37:28] [INFO ] Added : 119 causal constraints over 24 iterations in 339 ms. Result :sat
Minimization took 109 ms.
[2025-06-01 10:37:28] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2025-06-01 10:37:28] [INFO ] [Real]Absence check using 2 positive and 99 generalized place invariants in 14 ms returned sat
[2025-06-01 10:37:28] [INFO ] [Real]Absence check using state equation in 55 ms returned unsat
[2025-06-01 10:37:28] [INFO ] [Real]Absence check using 2 positive place invariants in 3 ms returned sat
[2025-06-01 10:37:28] [INFO ] [Real]Absence check using 2 positive and 99 generalized place invariants in 15 ms returned sat
[2025-06-01 10:37:28] [INFO ] [Real]Absence check using state equation in 56 ms returned sat
[2025-06-01 10:37:28] [INFO ] Computed and/alt/rep : 178/299/178 causal constraints (skipped 0 transitions) in 10 ms.
[2025-06-01 10:37:29] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 10:37:29] [INFO ] [Nat]Absence check using 2 positive place invariants in 3 ms returned sat
[2025-06-01 10:37:29] [INFO ] [Nat]Absence check using 2 positive and 99 generalized place invariants in 15 ms returned sat
[2025-06-01 10:37:29] [INFO ] [Nat]Absence check using state equation in 63 ms returned sat
[2025-06-01 10:37:29] [INFO ] Computed and/alt/rep : 178/299/178 causal constraints (skipped 0 transitions) in 18 ms.
[2025-06-01 10:37:29] [INFO ] Added : 114 causal constraints over 24 iterations in 336 ms. Result :sat
Minimization took 99 ms.
[2025-06-01 10:37:29] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2025-06-01 10:37:29] [INFO ] [Real]Absence check using 2 positive and 99 generalized place invariants in 14 ms returned sat
[2025-06-01 10:37:29] [INFO ] [Real]Absence check using state equation in 59 ms returned sat
[2025-06-01 10:37:29] [INFO ] Computed and/alt/rep : 178/299/178 causal constraints (skipped 0 transitions) in 15 ms.
[2025-06-01 10:37:30] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 10:37:30] [INFO ] [Nat]Absence check using 2 positive place invariants in 3 ms returned sat
[2025-06-01 10:37:30] [INFO ] [Nat]Absence check using 2 positive and 99 generalized place invariants in 13 ms returned sat
[2025-06-01 10:37:30] [INFO ] [Nat]Absence check using state equation in 67 ms returned sat
[2025-06-01 10:37:30] [INFO ] Computed and/alt/rep : 178/299/178 causal constraints (skipped 0 transitions) in 11 ms.
[2025-06-01 10:37:30] [INFO ] Added : 136 causal constraints over 28 iterations in 379 ms. Result :sat
Minimization took 102 ms.
[2025-06-01 10:37:30] [INFO ] [Real]Absence check using 2 positive place invariants in 3 ms returned sat
[2025-06-01 10:37:30] [INFO ] [Real]Absence check using 2 positive and 99 generalized place invariants in 15 ms returned sat
[2025-06-01 10:37:30] [INFO ] [Real]Absence check using state equation in 53 ms returned unsat
[2025-06-01 10:37:30] [INFO ] [Real]Absence check using 2 positive place invariants in 3 ms returned sat
[2025-06-01 10:37:30] [INFO ] [Real]Absence check using 2 positive and 99 generalized place invariants in 15 ms returned sat
[2025-06-01 10:37:30] [INFO ] [Real]Absence check using state equation in 62 ms returned sat
[2025-06-01 10:37:30] [INFO ] Computed and/alt/rep : 178/299/178 causal constraints (skipped 0 transitions) in 11 ms.
[2025-06-01 10:37:31] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 10:37:31] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2025-06-01 10:37:31] [INFO ] [Nat]Absence check using 2 positive and 99 generalized place invariants in 16 ms returned sat
[2025-06-01 10:37:31] [INFO ] [Nat]Absence check using state equation in 60 ms returned sat
[2025-06-01 10:37:31] [INFO ] Computed and/alt/rep : 178/299/178 causal constraints (skipped 0 transitions) in 12 ms.
[2025-06-01 10:37:31] [INFO ] Added : 119 causal constraints over 24 iterations in 322 ms. Result :sat
Minimization took 116 ms.
[2025-06-01 10:37:31] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2025-06-01 10:37:31] [INFO ] [Real]Absence check using 2 positive and 99 generalized place invariants in 14 ms returned sat
[2025-06-01 10:37:31] [INFO ] [Real]Absence check using state equation in 58 ms returned sat
[2025-06-01 10:37:31] [INFO ] Computed and/alt/rep : 178/299/178 causal constraints (skipped 0 transitions) in 10 ms.
[2025-06-01 10:37:32] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 10:37:32] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2025-06-01 10:37:32] [INFO ] [Nat]Absence check using 2 positive and 99 generalized place invariants in 12 ms returned sat
[2025-06-01 10:37:32] [INFO ] [Nat]Absence check using state equation in 53 ms returned sat
[2025-06-01 10:37:32] [INFO ] Computed and/alt/rep : 178/299/178 causal constraints (skipped 0 transitions) in 10 ms.
[2025-06-01 10:37:32] [INFO ] Added : 140 causal constraints over 29 iterations in 399 ms. Result :sat
Minimization took 145 ms.
[2025-06-01 10:37:32] [INFO ] [Real]Absence check using 2 positive place invariants in 10 ms returned sat
[2025-06-01 10:37:32] [INFO ] [Real]Absence check using 2 positive and 99 generalized place invariants in 15 ms returned sat
[2025-06-01 10:37:32] [INFO ] [Real]Absence check using state equation in 55 ms returned unsat
[2025-06-01 10:37:33] [INFO ] [Real]Absence check using 2 positive place invariants in 3 ms returned sat
[2025-06-01 10:37:33] [INFO ] [Real]Absence check using 2 positive and 99 generalized place invariants in 13 ms returned sat
[2025-06-01 10:37:33] [INFO ] [Real]Absence check using state equation in 61 ms returned sat
[2025-06-01 10:37:33] [INFO ] Computed and/alt/rep : 178/299/178 causal constraints (skipped 0 transitions) in 12 ms.
[2025-06-01 10:37:33] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 10:37:33] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2025-06-01 10:37:33] [INFO ] [Nat]Absence check using 2 positive and 99 generalized place invariants in 13 ms returned sat
[2025-06-01 10:37:33] [INFO ] [Nat]Absence check using state equation in 59 ms returned sat
[2025-06-01 10:37:33] [INFO ] Computed and/alt/rep : 178/299/178 causal constraints (skipped 0 transitions) in 13 ms.
[2025-06-01 10:37:33] [INFO ] Added : 155 causal constraints over 31 iterations in 426 ms. Result :sat
Minimization took 125 ms.
[2025-06-01 10:37:34] [INFO ] [Real]Absence check using 2 positive place invariants in 3 ms returned sat
[2025-06-01 10:37:34] [INFO ] [Real]Absence check using 2 positive and 99 generalized place invariants in 14 ms returned sat
[2025-06-01 10:37:34] [INFO ] [Real]Absence check using state equation in 58 ms returned sat
[2025-06-01 10:37:34] [INFO ] Computed and/alt/rep : 178/299/178 causal constraints (skipped 0 transitions) in 18 ms.
[2025-06-01 10:37:34] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 10:37:34] [INFO ] [Nat]Absence check using 2 positive place invariants in 3 ms returned sat
[2025-06-01 10:37:34] [INFO ] [Nat]Absence check using 2 positive and 99 generalized place invariants in 27 ms returned sat
[2025-06-01 10:37:34] [INFO ] [Nat]Absence check using state equation in 58 ms returned sat
[2025-06-01 10:37:34] [INFO ] Computed and/alt/rep : 178/299/178 causal constraints (skipped 0 transitions) in 11 ms.
[2025-06-01 10:37:34] [INFO ] Added : 115 causal constraints over 24 iterations in 302 ms. Result :sat
Minimization took 86 ms.
[2025-06-01 10:37:34] [INFO ] [Real]Absence check using 2 positive place invariants in 3 ms returned sat
[2025-06-01 10:37:34] [INFO ] [Real]Absence check using 2 positive and 99 generalized place invariants in 14 ms returned sat
[2025-06-01 10:37:35] [INFO ] [Real]Absence check using state equation in 57 ms returned sat
[2025-06-01 10:37:35] [INFO ] Computed and/alt/rep : 178/299/178 causal constraints (skipped 0 transitions) in 9 ms.
[2025-06-01 10:37:35] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 10:37:35] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2025-06-01 10:37:35] [INFO ] [Nat]Absence check using 2 positive and 99 generalized place invariants in 16 ms returned sat
[2025-06-01 10:37:35] [INFO ] [Nat]Absence check using state equation in 57 ms returned sat
[2025-06-01 10:37:35] [INFO ] Computed and/alt/rep : 178/299/178 causal constraints (skipped 0 transitions) in 11 ms.
[2025-06-01 10:37:35] [INFO ] Added : 119 causal constraints over 24 iterations in 329 ms. Result :sat
Minimization took 118 ms.
[2025-06-01 10:37:35] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2025-06-01 10:37:35] [INFO ] [Real]Absence check using 2 positive and 99 generalized place invariants in 14 ms returned sat
[2025-06-01 10:37:35] [INFO ] [Real]Absence check using state equation in 60 ms returned sat
[2025-06-01 10:37:35] [INFO ] Computed and/alt/rep : 178/299/178 causal constraints (skipped 0 transitions) in 11 ms.
[2025-06-01 10:37:36] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 10:37:36] [INFO ] [Nat]Absence check using 2 positive place invariants in 11 ms returned sat
[2025-06-01 10:37:36] [INFO ] [Nat]Absence check using 2 positive and 99 generalized place invariants in 14 ms returned sat
[2025-06-01 10:37:36] [INFO ] [Nat]Absence check using state equation in 55 ms returned sat
[2025-06-01 10:37:36] [INFO ] Computed and/alt/rep : 178/299/178 causal constraints (skipped 0 transitions) in 10 ms.
[2025-06-01 10:37:36] [INFO ] Added : 151 causal constraints over 31 iterations in 426 ms. Result :sat
Minimization took 118 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 1, 1, 7, 4, 1, 7, 4, 2, 2, 0, 1, 4, 0] Max Struct:[250, 1, 100, 7, 100, 100, 7, 100, 100, 2, 50, 100, 100, 50]
FORMULA IBMB2S565S3960-PT-none-UpperBounds-09 2 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA IBMB2S565S3960-PT-none-UpperBounds-06 7 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA IBMB2S565S3960-PT-none-UpperBounds-03 7 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA IBMB2S565S3960-PT-none-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[3, 3, 7, 3, 7, 5, 3, 3, 7, 3] Max Struct:[250, 100, 100, 100, 100, 100, 50, 100, 100, 50]
Support contains 10 out of 273 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 273/273 places, 179/179 transitions.
Graph (complete) has 415 edges and 273 vertex of which 238 are kept as prefixes of interest. Removing 35 places using SCC suffix rule.2 ms
Discarding 35 places :
Also discarding 19 output transitions
Drop transitions (Output transitions of discarded places.) removed 19 transitions
Ensure Unique test removed 86 places
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 76 transitions
Trivial Post-agglo rules discarded 76 transitions
Performed 76 trivial Post agglomeration. Transition count delta: 76
Iterating post reduction 0 with 171 rules applied. Total rules applied 172 place count 152 transition count 75
Reduce places removed 76 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 80 rules applied. Total rules applied 252 place count 76 transition count 71
Reduce places removed 2 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 2 with 5 rules applied. Total rules applied 257 place count 74 transition count 68
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 260 place count 71 transition count 68
Performed 23 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 23 Pre rules applied. Total rules applied 260 place count 71 transition count 45
Deduced a syphon composed of 23 places in 0 ms
Ensure Unique test removed 4 places
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 4 with 50 rules applied. Total rules applied 310 place count 44 transition count 45
Discarding 1 places :
Implicit places reduction removed 1 places
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 4 with 2 rules applied. Total rules applied 312 place count 43 transition count 44
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 313 place count 42 transition count 44
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 313 place count 42 transition count 43
Renaming transitions due to excessive name length > 1024 char.
Deduced a syphon composed of 1 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 3 rules applied. Total rules applied 316 place count 40 transition count 43
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 316 place count 40 transition count 42
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 318 place count 39 transition count 42
Discarding 5 places :
Symmetric choice reduction at 6 with 5 rule applications. Total rules 323 place count 34 transition count 37
Iterating global reduction 6 with 5 rules applied. Total rules applied 328 place count 34 transition count 37
Performed 7 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 7 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 6 with 16 rules applied. Total rules applied 344 place count 25 transition count 29
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 345 place count 25 transition count 28
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 346 place count 24 transition count 27
Iterating global reduction 7 with 1 rules applied. Total rules applied 347 place count 24 transition count 27
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 7 with 2 rules applied. Total rules applied 349 place count 23 transition count 26
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 350 place count 23 transition count 26
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 7 with 1 rules applied. Total rules applied 351 place count 22 transition count 25
Applied a total of 351 rules in 45 ms. Remains 22 /273 variables (removed 251) and now considering 25/179 (removed 154) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 55 ms. Remains : 22/273 places, 25/179 transitions.
// Phase 1: matrix 25 rows 22 cols
[2025-06-01 10:37:37] [INFO ] Computed 0 invariants in 2 ms
Current structural bounds on expressions (after invariants) : Max Seen:[3, 3, 7, 3, 7, 5, 3, 3, 7, 3] Max Struct:[250, 100, 100, 100, 100, 100, 50, 100, 100, 50]
RANDOM walk for 1000001 steps (19066 resets) in 227 ms. (4385 steps per ms)
BEST_FIRST walk for 10000009 steps (29255 resets) in 2692 ms. (3713 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[3, 3, 7, 3, 7, 5, 3, 3, 7, 3] Max Struct:[250, 100, 100, 100, 100, 100, 50, 100, 100, 50]
[2025-06-01 10:37:40] [INFO ] Invariant cache hit.
[2025-06-01 10:37:40] [INFO ] [Real]Absence check using state equation in 7 ms returned unsat
[2025-06-01 10:37:40] [INFO ] [Real]Absence check using state equation in 5 ms returned unsat
[2025-06-01 10:37:40] [INFO ] [Real]Absence check using state equation in 8 ms returned unsat
[2025-06-01 10:37:40] [INFO ] [Real]Absence check using state equation in 7 ms returned unsat
[2025-06-01 10:37:40] [INFO ] [Real]Absence check using state equation in 8 ms returned unsat
[2025-06-01 10:37:40] [INFO ] [Real]Absence check using state equation in 7 ms returned unsat
[2025-06-01 10:37:40] [INFO ] [Real]Absence check using state equation in 6 ms returned unsat
[2025-06-01 10:37:40] [INFO ] [Real]Absence check using state equation in 6 ms returned unsat
[2025-06-01 10:37:40] [INFO ] [Real]Absence check using state equation in 9 ms returned unsat
[2025-06-01 10:37:40] [INFO ] [Real]Absence check using state equation in 7 ms returned unsat
Current structural bounds on expressions (after SMT) : Max Seen:[3, 3, 7, 3, 7, 5, 3, 3, 7, 3] Max Struct:[3, 3, 7, 3, 7, 5, 3, 3, 7, 3]
FORMULA IBMB2S565S3960-PT-none-UpperBounds-15 3 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA IBMB2S565S3960-PT-none-UpperBounds-13 7 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA IBMB2S565S3960-PT-none-UpperBounds-12 3 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA IBMB2S565S3960-PT-none-UpperBounds-10 3 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA IBMB2S565S3960-PT-none-UpperBounds-08 5 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA IBMB2S565S3960-PT-none-UpperBounds-07 7 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA IBMB2S565S3960-PT-none-UpperBounds-05 3 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA IBMB2S565S3960-PT-none-UpperBounds-04 7 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA IBMB2S565S3960-PT-none-UpperBounds-02 3 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA IBMB2S565S3960-PT-none-UpperBounds-00 3 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided 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 )
[2025-06-01 10:37:40] [INFO ] Flatten gal took : 18 ms
[2025-06-01 10:37:40] [INFO ] Flatten gal took : 3 ms
[2025-06-01 10:37:41] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality15951019995181742161.gal : 3 ms
[2025-06-01 10:37:41] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality17264029861836543806.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.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality15951019995181742161.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality17264029861836543806.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 15690 ms.

BK_STOP 1748774261175

--------------------
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
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ 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.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /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="IBMB2S565S3960-PT-none"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="gold2024"
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-5832"
echo " Executing tool gold2024"
echo " Input is IBMB2S565S3960-PT-none, 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 r125-tall-174876435700045"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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