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.r111-smll-174867015900080.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 HealthRecord-PT-13, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r111-smll-174867015900080
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 520K
-rw-r--r-- 1 mcc users 7.5K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 84K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 54K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 127K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.8K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 66K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K 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 3 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 71K 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 HealthRecord-PT-13-UpperBounds-00
FORMULA_NAME HealthRecord-PT-13-UpperBounds-01
FORMULA_NAME HealthRecord-PT-13-UpperBounds-02
FORMULA_NAME HealthRecord-PT-13-UpperBounds-03
FORMULA_NAME HealthRecord-PT-13-UpperBounds-04
FORMULA_NAME HealthRecord-PT-13-UpperBounds-05
FORMULA_NAME HealthRecord-PT-13-UpperBounds-06
FORMULA_NAME HealthRecord-PT-13-UpperBounds-07
FORMULA_NAME HealthRecord-PT-13-UpperBounds-08
FORMULA_NAME HealthRecord-PT-13-UpperBounds-09
FORMULA_NAME HealthRecord-PT-13-UpperBounds-10
FORMULA_NAME HealthRecord-PT-13-UpperBounds-11
FORMULA_NAME HealthRecord-PT-13-UpperBounds-12
FORMULA_NAME HealthRecord-PT-13-UpperBounds-13
FORMULA_NAME HealthRecord-PT-13-UpperBounds-14
FORMULA_NAME HealthRecord-PT-13-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1748785750563

Invoking MCC driver with
BK_TOOL=gold2024
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=HealthRecord-PT-13
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202405141337
[2025-06-01 13:49:12] [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 13:49:12] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-01 13:49:12] [INFO ] Load time of PNML (sax parser for PT used): 163 ms
[2025-06-01 13:49:12] [INFO ] Transformed 161 places.
[2025-06-01 13:49:12] [INFO ] Transformed 341 transitions.
[2025-06-01 13:49:12] [INFO ] Found NUPN structural information;
[2025-06-01 13:49:12] [INFO ] Parsed PT model containing 161 places and 341 transitions and 899 arcs in 416 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 18 ms.
Ensure Unique test removed 28 transitions
Reduce redundant transitions removed 28 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]
[2025-06-01 13:49:13] [INFO ] Flow matrix only has 301 transitions (discarded 12 similar events)
// Phase 1: matrix 301 rows 161 cols
[2025-06-01 13:49:13] [INFO ] Computed 18 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 (779 resets) in 80 ms. (123 steps per ms)
FORMULA HealthRecord-PT-13-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA HealthRecord-PT-13-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA HealthRecord-PT-13-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA HealthRecord-PT-13-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA HealthRecord-PT-13-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA HealthRecord-PT-13-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA HealthRecord-PT-13-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA HealthRecord-PT-13-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 80005 steps (764 resets) in 180 ms. (442 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]
[2025-06-01 13:49:13] [INFO ] Flow matrix only has 301 transitions (discarded 12 similar events)
[2025-06-01 13:49:13] [INFO ] Invariant cache hit.
[2025-06-01 13:49:13] [INFO ] [Real]Absence check using 10 positive place invariants in 30 ms returned sat
[2025-06-01 13:49:13] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 25 ms returned sat
[2025-06-01 13:49:14] [INFO ] [Real]Absence check using state equation in 355 ms returned sat
[2025-06-01 13:49:14] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-01 13:49:14] [INFO ] [Real]Added 1 Read/Feed constraints in 5 ms returned sat
[2025-06-01 13:49:14] [INFO ] Computed and/alt/rep : 233/270/233 causal constraints (skipped 67 transitions) in 181 ms.
[2025-06-01 13:49:14] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 13:49:15] [INFO ] [Nat]Absence check using 10 positive place invariants in 10 ms returned sat
[2025-06-01 13:49:15] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 6 ms returned sat
[2025-06-01 13:49:15] [INFO ] [Nat]Absence check using state equation in 154 ms returned sat
[2025-06-01 13:49:15] [INFO ] [Nat]Added 1 Read/Feed constraints in 3 ms returned sat
[2025-06-01 13:49:15] [INFO ] Deduced a trap composed of 31 places in 267 ms of which 45 ms to minimize.
[2025-06-01 13:49:15] [INFO ] Deduced a trap composed of 31 places in 87 ms of which 1 ms to minimize.
[2025-06-01 13:49:15] [INFO ] Deduced a trap composed of 30 places in 124 ms of which 33 ms to minimize.
[2025-06-01 13:49:15] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 619 ms
[2025-06-01 13:49:15] [INFO ] Computed and/alt/rep : 233/270/233 causal constraints (skipped 67 transitions) in 94 ms.
[2025-06-01 13:49:16] [INFO ] Added : 19 causal constraints over 5 iterations in 274 ms. Result :sat
Minimization took 172 ms.
[2025-06-01 13:49:16] [INFO ] [Real]Absence check using 10 positive place invariants in 9 ms returned sat
[2025-06-01 13:49:16] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 6 ms returned sat
[2025-06-01 13:49:16] [INFO ] [Real]Absence check using state equation in 138 ms returned sat
[2025-06-01 13:49:16] [INFO ] [Real]Added 1 Read/Feed constraints in 3 ms returned sat
[2025-06-01 13:49:16] [INFO ] Deduced a trap composed of 30 places in 61 ms of which 1 ms to minimize.
[2025-06-01 13:49:16] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 13:49:16] [INFO ] [Nat]Absence check using 10 positive place invariants in 10 ms returned sat
[2025-06-01 13:49:16] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 6 ms returned sat
[2025-06-01 13:49:16] [INFO ] [Nat]Absence check using state equation in 126 ms returned sat
[2025-06-01 13:49:16] [INFO ] [Nat]Added 1 Read/Feed constraints in 3 ms returned sat
[2025-06-01 13:49:17] [INFO ] Computed and/alt/rep : 233/270/233 causal constraints (skipped 67 transitions) in 52 ms.
[2025-06-01 13:49:17] [INFO ] Added : 16 causal constraints over 4 iterations in 170 ms. Result :sat
Minimization took 155 ms.
[2025-06-01 13:49:17] [INFO ] [Real]Absence check using 10 positive place invariants in 8 ms returned sat
[2025-06-01 13:49:17] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 6 ms returned sat
[2025-06-01 13:49:17] [INFO ] [Real]Absence check using state equation in 108 ms returned sat
[2025-06-01 13:49:17] [INFO ] [Real]Added 1 Read/Feed constraints in 3 ms returned sat
[2025-06-01 13:49:17] [INFO ] Deduced a trap composed of 31 places in 74 ms of which 2 ms to minimize.
[2025-06-01 13:49:17] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 13:49:17] [INFO ] [Nat]Absence check using 10 positive place invariants in 12 ms returned sat
[2025-06-01 13:49:17] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 7 ms returned sat
[2025-06-01 13:49:17] [INFO ] [Nat]Absence check using state equation in 141 ms returned sat
[2025-06-01 13:49:17] [INFO ] [Nat]Added 1 Read/Feed constraints in 3 ms returned sat
[2025-06-01 13:49:17] [INFO ] Deduced a trap composed of 30 places in 59 ms of which 1 ms to minimize.
[2025-06-01 13:49:17] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 84 ms
[2025-06-01 13:49:17] [INFO ] Computed and/alt/rep : 233/270/233 causal constraints (skipped 67 transitions) in 41 ms.
[2025-06-01 13:49:18] [INFO ] Added : 18 causal constraints over 4 iterations in 156 ms. Result :sat
Minimization took 147 ms.
[2025-06-01 13:49:18] [INFO ] [Real]Absence check using 10 positive place invariants in 9 ms returned sat
[2025-06-01 13:49:18] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 5 ms returned sat
[2025-06-01 13:49:18] [INFO ] [Real]Absence check using state equation in 108 ms returned sat
[2025-06-01 13:49:18] [INFO ] [Real]Added 1 Read/Feed constraints in 1 ms returned sat
[2025-06-01 13:49:18] [INFO ] Deduced a trap composed of 30 places in 78 ms of which 2 ms to minimize.
[2025-06-01 13:49:18] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 13:49:18] [INFO ] [Nat]Absence check using 10 positive place invariants in 11 ms returned sat
[2025-06-01 13:49:18] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 7 ms returned sat
[2025-06-01 13:49:18] [INFO ] [Nat]Absence check using state equation in 130 ms returned sat
[2025-06-01 13:49:18] [INFO ] [Nat]Added 1 Read/Feed constraints in 3 ms returned sat
[2025-06-01 13:49:18] [INFO ] Deduced a trap composed of 30 places in 70 ms of which 2 ms to minimize.
[2025-06-01 13:49:18] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 102 ms
[2025-06-01 13:49:19] [INFO ] Computed and/alt/rep : 233/270/233 causal constraints (skipped 67 transitions) in 58 ms.
[2025-06-01 13:49:19] [INFO ] Added : 25 causal constraints over 5 iterations in 233 ms. Result :sat
Minimization took 243 ms.
[2025-06-01 13:49:19] [INFO ] [Real]Absence check using 10 positive place invariants in 14 ms returned sat
[2025-06-01 13:49:19] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 8 ms returned sat
[2025-06-01 13:49:19] [INFO ] [Real]Absence check using state equation in 157 ms returned sat
[2025-06-01 13:49:19] [INFO ] [Real]Added 1 Read/Feed constraints in 4 ms returned sat
[2025-06-01 13:49:19] [INFO ] Computed and/alt/rep : 233/270/233 causal constraints (skipped 67 transitions) in 47 ms.
[2025-06-01 13:49:19] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 13:49:19] [INFO ] [Nat]Absence check using 10 positive place invariants in 15 ms returned sat
[2025-06-01 13:49:19] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 5 ms returned sat
[2025-06-01 13:49:20] [INFO ] [Nat]Absence check using state equation in 100 ms returned sat
[2025-06-01 13:49:20] [INFO ] [Nat]Added 1 Read/Feed constraints in 3 ms returned sat
[2025-06-01 13:49:20] [INFO ] Deduced a trap composed of 30 places in 50 ms of which 1 ms to minimize.
[2025-06-01 13:49:20] [INFO ] Deduced a trap composed of 30 places in 42 ms of which 1 ms to minimize.
[2025-06-01 13:49:20] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 124 ms
[2025-06-01 13:49:20] [INFO ] Computed and/alt/rep : 233/270/233 causal constraints (skipped 67 transitions) in 31 ms.
[2025-06-01 13:49:20] [INFO ] Added : 23 causal constraints over 6 iterations in 197 ms. Result :sat
Minimization took 238 ms.
[2025-06-01 13:49:20] [INFO ] [Real]Absence check using 10 positive place invariants in 9 ms returned sat
[2025-06-01 13:49:20] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 5 ms returned sat
[2025-06-01 13:49:20] [INFO ] [Real]Absence check using state equation in 103 ms returned sat
[2025-06-01 13:49:20] [INFO ] [Real]Added 1 Read/Feed constraints in 3 ms returned sat
[2025-06-01 13:49:20] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 13:49:20] [INFO ] [Nat]Absence check using 10 positive place invariants in 9 ms returned sat
[2025-06-01 13:49:20] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 7 ms returned sat
[2025-06-01 13:49:21] [INFO ] [Nat]Absence check using state equation in 134 ms returned sat
[2025-06-01 13:49:21] [INFO ] [Nat]Added 1 Read/Feed constraints in 6 ms returned sat
[2025-06-01 13:49:21] [INFO ] Computed and/alt/rep : 233/270/233 causal constraints (skipped 67 transitions) in 34 ms.
[2025-06-01 13:49:21] [INFO ] Added : 10 causal constraints over 2 iterations in 113 ms. Result :sat
Minimization took 198 ms.
[2025-06-01 13:49:21] [INFO ] [Real]Absence check using 10 positive place invariants in 8 ms returned sat
[2025-06-01 13:49:21] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 4 ms returned sat
[2025-06-01 13:49:21] [INFO ] [Real]Absence check using state equation in 95 ms returned sat
[2025-06-01 13:49:21] [INFO ] [Real]Added 1 Read/Feed constraints in 2 ms returned sat
[2025-06-01 13:49:21] [INFO ] Deduced a trap composed of 31 places in 55 ms of which 2 ms to minimize.
[2025-06-01 13:49:21] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 13:49:21] [INFO ] [Nat]Absence check using 10 positive place invariants in 9 ms returned sat
[2025-06-01 13:49:21] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 4 ms returned sat
[2025-06-01 13:49:21] [INFO ] [Nat]Absence check using state equation in 103 ms returned sat
[2025-06-01 13:49:21] [INFO ] [Nat]Added 1 Read/Feed constraints in 2 ms returned sat
[2025-06-01 13:49:21] [INFO ] Computed and/alt/rep : 233/270/233 causal constraints (skipped 67 transitions) in 33 ms.
[2025-06-01 13:49:22] [INFO ] Deduced a trap composed of 30 places in 44 ms of which 2 ms to minimize.
[2025-06-01 13:49:22] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 73 ms
[2025-06-01 13:49:22] [INFO ] Added : 15 causal constraints over 4 iterations in 210 ms. Result :sat
Minimization took 152 ms.
[2025-06-01 13:49:22] [INFO ] [Real]Absence check using 10 positive place invariants in 9 ms returned sat
[2025-06-01 13:49:22] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 6 ms returned sat
[2025-06-01 13:49:22] [INFO ] [Real]Absence check using state equation in 102 ms returned sat
[2025-06-01 13:49:22] [INFO ] [Real]Added 1 Read/Feed constraints in 2 ms returned sat
[2025-06-01 13:49:22] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 13:49:22] [INFO ] [Nat]Absence check using 10 positive place invariants in 9 ms returned sat
[2025-06-01 13:49:22] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 6 ms returned sat
[2025-06-01 13:49:22] [INFO ] [Nat]Absence check using state equation in 101 ms returned sat
[2025-06-01 13:49:22] [INFO ] [Nat]Added 1 Read/Feed constraints in 3 ms returned sat
[2025-06-01 13:49:22] [INFO ] Deduced a trap composed of 24 places in 90 ms of which 4 ms to minimize.
[2025-06-01 13:49:22] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 113 ms
[2025-06-01 13:49:22] [INFO ] Computed and/alt/rep : 233/270/233 causal constraints (skipped 67 transitions) in 23 ms.
[2025-06-01 13:49:22] [INFO ] Added : 11 causal constraints over 3 iterations in 95 ms. Result :sat
Minimization took 147 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 HealthRecord-PT-13-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA HealthRecord-PT-13-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1]
Support contains 6 out of 161 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 161/161 places, 313/313 transitions.
Graph (trivial) has 234 edges and 161 vertex of which 8 / 161 are part of one of the 4 SCC in 6 ms
Free SCC test removed 4 places
Drop transitions (Empty/Sink Transition effects.) removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Graph (complete) has 681 edges and 157 vertex of which 129 are kept as prefixes of interest. Removing 28 places using SCC suffix rule.2 ms
Discarding 28 places :
Also discarding 12 output transitions
Drop transitions (Output transitions of discarded places.) removed 12 transitions
Drop transitions (Empty/Sink Transition effects.) removed 113 transitions
Reduce isomorphic transitions removed 113 transitions.
Iterating post reduction 0 with 113 rules applied. Total rules applied 115 place count 129 transition count 167
Discarding 78 places :
Symmetric choice reduction at 1 with 78 rule applications. Total rules 193 place count 51 transition count 89
Iterating global reduction 1 with 78 rules applied. Total rules applied 271 place count 51 transition count 89
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 5 Pre rules applied. Total rules applied 271 place count 51 transition count 84
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 1 with 10 rules applied. Total rules applied 281 place count 46 transition count 84
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 293 place count 34 transition count 66
Iterating global reduction 1 with 12 rules applied. Total rules applied 305 place count 34 transition count 66
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 314 place count 34 transition count 57
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 316 place count 32 transition count 54
Iterating global reduction 2 with 2 rules applied. Total rules applied 318 place count 32 transition count 54
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 319 place count 32 transition count 53
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 320 place count 31 transition count 52
Iterating global reduction 3 with 1 rules applied. Total rules applied 321 place count 31 transition count 52
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 324 place count 31 transition count 49
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 332 place count 27 transition count 45
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 333 place count 26 transition count 44
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 334 place count 25 transition count 44
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 5 with 4 rules applied. Total rules applied 338 place count 25 transition count 40
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 5 with 2 rules applied. Total rules applied 340 place count 24 transition count 39
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 341 place count 23 transition count 38
Iterating global reduction 5 with 1 rules applied. Total rules applied 342 place count 23 transition count 38
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 5 with 3 rules applied. Total rules applied 345 place count 23 transition count 35
Free-agglomeration rule applied 1 times.
Iterating global reduction 5 with 1 rules applied. Total rules applied 346 place count 23 transition count 34
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 347 place count 22 transition count 34
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 348 place count 22 transition count 34
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 349 place count 22 transition count 33
Applied a total of 349 rules in 85 ms. Remains 22 /161 variables (removed 139) and now considering 33/313 (removed 280) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 100 ms. Remains : 22/161 places, 33/313 transitions.
[2025-06-01 13:49:23] [INFO ] Flow matrix only has 29 transitions (discarded 4 similar events)
// Phase 1: matrix 29 rows 22 cols
[2025-06-01 13:49:23] [INFO ] Computed 2 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1]
RANDOM walk for 1000000 steps (90150 resets) in 1004 ms. (995 steps per ms)
FORMULA HealthRecord-PT-13-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA HealthRecord-PT-13-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA HealthRecord-PT-13-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA HealthRecord-PT-13-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA HealthRecord-PT-13-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA HealthRecord-PT-13-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 1000001 steps (28758 resets) in 362 ms. (2754 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[] Max Struct:[]
RANDOM walk for 0 steps (0 resets) in 4 ms. (0 steps per ms) remains 0/0 properties
Finished probabilistic random walk after 0 steps, run visited all 0 properties in 0 ms. (steps per millisecond=0 )
[2025-06-01 13:49:24] [INFO ] Flatten gal took : 33 ms
[2025-06-01 13:49:25] [INFO ] Flatten gal took : 18 ms
[2025-06-01 13:49:25] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality7710512306549832954.gal : 8 ms
[2025-06-01 13:49:25] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality18278421700258460042.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/ReachabilityCardinality7710512306549832954.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality18278421700258460042.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 12586 ms.

BK_STOP 1748785765145

--------------------
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="HealthRecord-PT-13"
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 HealthRecord-PT-13, 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 r111-smll-174867015900080"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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