About the Execution of 2024-gold for HealthRecord-PT-11
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
15689.610 | 15072.00 | 28243.00 | 250.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/fkordon/mcc2025-input.r111-smll-174867015900078.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-11, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r111-smll-174867015900078
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 504K
-rw-r--r-- 1 mcc users 8.0K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 92K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.3K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 61K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K 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 2.3K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.4K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 95K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.4K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 61K 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 70K 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-11-UpperBounds-00
FORMULA_NAME HealthRecord-PT-11-UpperBounds-01
FORMULA_NAME HealthRecord-PT-11-UpperBounds-02
FORMULA_NAME HealthRecord-PT-11-UpperBounds-03
FORMULA_NAME HealthRecord-PT-11-UpperBounds-04
FORMULA_NAME HealthRecord-PT-11-UpperBounds-05
FORMULA_NAME HealthRecord-PT-11-UpperBounds-06
FORMULA_NAME HealthRecord-PT-11-UpperBounds-07
FORMULA_NAME HealthRecord-PT-11-UpperBounds-08
FORMULA_NAME HealthRecord-PT-11-UpperBounds-09
FORMULA_NAME HealthRecord-PT-11-UpperBounds-10
FORMULA_NAME HealthRecord-PT-11-UpperBounds-11
FORMULA_NAME HealthRecord-PT-11-UpperBounds-12
FORMULA_NAME HealthRecord-PT-11-UpperBounds-13
FORMULA_NAME HealthRecord-PT-11-UpperBounds-14
FORMULA_NAME HealthRecord-PT-11-UpperBounds-15
=== Now, execution of the tool begins
BK_START 1748785686075
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-11
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202405141337
[2025-06-01 13:48:08] [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:48:08] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-01 13:48:09] [INFO ] Load time of PNML (sax parser for PT used): 182 ms
[2025-06-01 13:48:09] [INFO ] Transformed 159 places.
[2025-06-01 13:48:09] [INFO ] Transformed 334 transitions.
[2025-06-01 13:48:09] [INFO ] Found NUPN structural information;
[2025-06-01 13:48:09] [INFO ] Parsed PT model containing 159 places and 334 transitions and 879 arcs in 433 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 17 ms.
Ensure Unique test removed 27 transitions
Reduce redundant transitions removed 27 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:48:09] [INFO ] Flow matrix only has 295 transitions (discarded 12 similar events)
// Phase 1: matrix 295 rows 159 cols
[2025-06-01 13:48:09] [INFO ] Computed 18 invariants in 55 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 (672 resets) in 130 ms. (76 steps per ms)
FORMULA HealthRecord-PT-11-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA HealthRecord-PT-11-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA HealthRecord-PT-11-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA HealthRecord-PT-11-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA HealthRecord-PT-11-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA HealthRecord-PT-11-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA HealthRecord-PT-11-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA HealthRecord-PT-11-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA HealthRecord-PT-11-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 70006 steps (679 resets) in 130 ms. (534 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1]
[2025-06-01 13:48:09] [INFO ] Flow matrix only has 295 transitions (discarded 12 similar events)
[2025-06-01 13:48:09] [INFO ] Invariant cache hit.
[2025-06-01 13:48:10] [INFO ] [Real]Absence check using 10 positive place invariants in 26 ms returned sat
[2025-06-01 13:48:10] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 11 ms returned sat
[2025-06-01 13:48:10] [INFO ] [Real]Absence check using state equation in 229 ms returned sat
[2025-06-01 13:48:10] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-01 13:48:10] [INFO ] [Real]Added 1 Read/Feed constraints in 3 ms returned sat
[2025-06-01 13:48:10] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 13:48:10] [INFO ] [Nat]Absence check using 10 positive place invariants in 21 ms returned sat
[2025-06-01 13:48:10] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 13 ms returned sat
[2025-06-01 13:48:11] [INFO ] [Nat]Absence check using state equation in 241 ms returned sat
[2025-06-01 13:48:11] [INFO ] [Nat]Added 1 Read/Feed constraints in 4 ms returned sat
[2025-06-01 13:48:11] [INFO ] Computed and/alt/rep : 230/265/230 causal constraints (skipped 64 transitions) in 71 ms.
[2025-06-01 13:48:11] [INFO ] Added : 13 causal constraints over 3 iterations in 227 ms. Result :sat
Minimization took 207 ms.
[2025-06-01 13:48:11] [INFO ] [Real]Absence check using 10 positive place invariants in 10 ms returned sat
[2025-06-01 13:48:11] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 7 ms returned sat
[2025-06-01 13:48:11] [INFO ] [Real]Absence check using state equation in 116 ms returned sat
[2025-06-01 13:48:11] [INFO ] [Real]Added 1 Read/Feed constraints in 3 ms returned sat
[2025-06-01 13:48:11] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 13:48:12] [INFO ] [Nat]Absence check using 10 positive place invariants in 10 ms returned sat
[2025-06-01 13:48:12] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 6 ms returned sat
[2025-06-01 13:48:12] [INFO ] [Nat]Absence check using state equation in 117 ms returned sat
[2025-06-01 13:48:12] [INFO ] [Nat]Added 1 Read/Feed constraints in 2 ms returned sat
[2025-06-01 13:48:12] [INFO ] Computed and/alt/rep : 230/265/230 causal constraints (skipped 64 transitions) in 40 ms.
[2025-06-01 13:48:12] [INFO ] Added : 17 causal constraints over 5 iterations in 164 ms. Result :sat
Minimization took 211 ms.
[2025-06-01 13:48:12] [INFO ] [Real]Absence check using 10 positive place invariants in 15 ms returned sat
[2025-06-01 13:48:12] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 9 ms returned sat
[2025-06-01 13:48:12] [INFO ] [Real]Absence check using state equation in 136 ms returned sat
[2025-06-01 13:48:12] [INFO ] [Real]Added 1 Read/Feed constraints in 2 ms returned sat
[2025-06-01 13:48:12] [INFO ] Deduced a trap composed of 31 places in 112 ms of which 24 ms to minimize.
[2025-06-01 13:48:12] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 13:48:13] [INFO ] [Nat]Absence check using 10 positive place invariants in 11 ms returned sat
[2025-06-01 13:48:13] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 6 ms returned sat
[2025-06-01 13:48:13] [INFO ] [Nat]Absence check using state equation in 162 ms returned sat
[2025-06-01 13:48:13] [INFO ] [Nat]Added 1 Read/Feed constraints in 3 ms returned sat
[2025-06-01 13:48:13] [INFO ] Deduced a trap composed of 31 places in 108 ms of which 5 ms to minimize.
[2025-06-01 13:48:13] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 142 ms
[2025-06-01 13:48:13] [INFO ] Computed and/alt/rep : 230/265/230 causal constraints (skipped 64 transitions) in 63 ms.
[2025-06-01 13:48:13] [INFO ] Added : 16 causal constraints over 4 iterations in 207 ms. Result :sat
Minimization took 221 ms.
[2025-06-01 13:48:13] [INFO ] [Real]Absence check using 10 positive place invariants in 15 ms returned sat
[2025-06-01 13:48:13] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 12 ms returned sat
[2025-06-01 13:48:14] [INFO ] [Real]Absence check using state equation in 183 ms returned sat
[2025-06-01 13:48:14] [INFO ] [Real]Added 1 Read/Feed constraints in 4 ms returned sat
[2025-06-01 13:48:14] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 13:48:14] [INFO ] [Nat]Absence check using 10 positive place invariants in 15 ms returned sat
[2025-06-01 13:48:14] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 8 ms returned sat
[2025-06-01 13:48:14] [INFO ] [Nat]Absence check using state equation in 164 ms returned sat
[2025-06-01 13:48:14] [INFO ] [Nat]Added 1 Read/Feed constraints in 4 ms returned sat
[2025-06-01 13:48:14] [INFO ] Computed and/alt/rep : 230/265/230 causal constraints (skipped 64 transitions) in 51 ms.
[2025-06-01 13:48:14] [INFO ] Added : 15 causal constraints over 3 iterations in 172 ms. Result :sat
Minimization took 227 ms.
[2025-06-01 13:48:15] [INFO ] [Real]Absence check using 10 positive place invariants in 15 ms returned sat
[2025-06-01 13:48:15] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 17 ms returned sat
[2025-06-01 13:48:15] [INFO ] [Real]Absence check using state equation in 154 ms returned sat
[2025-06-01 13:48:15] [INFO ] [Real]Added 1 Read/Feed constraints in 2 ms returned sat
[2025-06-01 13:48:15] [INFO ] Computed and/alt/rep : 230/265/230 causal constraints (skipped 64 transitions) in 47 ms.
[2025-06-01 13:48:15] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 13:48:15] [INFO ] [Nat]Absence check using 10 positive place invariants in 15 ms returned sat
[2025-06-01 13:48:15] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 8 ms returned sat
[2025-06-01 13:48:15] [INFO ] [Nat]Absence check using state equation in 147 ms returned sat
[2025-06-01 13:48:15] [INFO ] [Nat]Added 1 Read/Feed constraints in 2 ms returned sat
[2025-06-01 13:48:15] [INFO ] Computed and/alt/rep : 230/265/230 causal constraints (skipped 64 transitions) in 45 ms.
[2025-06-01 13:48:15] [INFO ] Added : 12 causal constraints over 3 iterations in 174 ms. Result :sat
Minimization took 244 ms.
[2025-06-01 13:48:16] [INFO ] [Real]Absence check using 10 positive place invariants in 15 ms returned sat
[2025-06-01 13:48:16] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 8 ms returned sat
[2025-06-01 13:48:16] [INFO ] [Real]Absence check using state equation in 150 ms returned sat
[2025-06-01 13:48:16] [INFO ] [Real]Added 1 Read/Feed constraints in 3 ms returned sat
[2025-06-01 13:48:16] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 13:48:16] [INFO ] [Nat]Absence check using 10 positive place invariants in 15 ms returned sat
[2025-06-01 13:48:16] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 8 ms returned sat
[2025-06-01 13:48:16] [INFO ] [Nat]Absence check using state equation in 164 ms returned sat
[2025-06-01 13:48:16] [INFO ] [Nat]Added 1 Read/Feed constraints in 3 ms returned sat
[2025-06-01 13:48:16] [INFO ] Computed and/alt/rep : 230/265/230 causal constraints (skipped 64 transitions) in 50 ms.
[2025-06-01 13:48:16] [INFO ] Added : 16 causal constraints over 4 iterations in 208 ms. Result :sat
Minimization took 224 ms.
[2025-06-01 13:48:17] [INFO ] [Real]Absence check using 10 positive place invariants in 14 ms returned sat
[2025-06-01 13:48:17] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 8 ms returned sat
[2025-06-01 13:48:17] [INFO ] [Real]Absence check using state equation in 145 ms returned sat
[2025-06-01 13:48:17] [INFO ] [Real]Added 1 Read/Feed constraints in 3 ms returned sat
[2025-06-01 13:48:17] [INFO ] Computed and/alt/rep : 230/265/230 causal constraints (skipped 64 transitions) in 46 ms.
[2025-06-01 13:48:17] [INFO ] Added : 16 causal constraints over 4 iterations in 205 ms. Result :sat
Minimization took 246 ms.
[2025-06-01 13:48:17] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 13:48:18] [INFO ] [Nat]Absence check using 10 positive place invariants in 15 ms returned sat
[2025-06-01 13:48:18] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 9 ms returned sat
[2025-06-01 13:48:18] [INFO ] [Nat]Absence check using state equation in 152 ms returned sat
[2025-06-01 13:48:18] [INFO ] [Nat]Added 1 Read/Feed constraints in 4 ms returned sat
[2025-06-01 13:48:18] [INFO ] Computed and/alt/rep : 230/265/230 causal constraints (skipped 64 transitions) in 43 ms.
[2025-06-01 13:48:18] [INFO ] Added : 16 causal constraints over 4 iterations in 194 ms. Result :sat
Minimization took 232 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1]
FORMULA HealthRecord-PT-11-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA HealthRecord-PT-11-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA HealthRecord-PT-11-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA HealthRecord-PT-11-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0] Max Struct:[1, 1, 1]
Support contains 3 out of 159 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 159/159 places, 307/307 transitions.
Graph (trivial) has 237 edges and 159 vertex of which 10 / 159 are part of one of the 5 SCC in 7 ms
Free SCC test removed 5 places
Drop transitions (Empty/Sink Transition effects.) removed 23 transitions
Reduce isomorphic transitions removed 23 transitions.
Graph (complete) has 667 edges and 154 vertex of which 124 are kept as prefixes of interest. Removing 30 places using SCC suffix rule.3 ms
Discarding 30 places :
Also discarding 15 output transitions
Drop transitions (Output transitions of discarded places.) removed 15 transitions
Drop transitions (Empty/Sink Transition effects.) removed 112 transitions
Reduce isomorphic transitions removed 112 transitions.
Iterating post reduction 0 with 112 rules applied. Total rules applied 114 place count 124 transition count 157
Discarding 78 places :
Symmetric choice reduction at 1 with 78 rule applications. Total rules 192 place count 46 transition count 79
Iterating global reduction 1 with 78 rules applied. Total rules applied 270 place count 46 transition count 79
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 5 Pre rules applied. Total rules applied 270 place count 46 transition count 74
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 1 with 10 rules applied. Total rules applied 280 place count 41 transition count 74
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 293 place count 28 transition count 57
Iterating global reduction 1 with 13 rules applied. Total rules applied 306 place count 28 transition count 57
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 315 place count 28 transition count 48
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 318 place count 25 transition count 43
Iterating global reduction 2 with 3 rules applied. Total rules applied 321 place count 25 transition count 43
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 322 place count 25 transition count 42
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 323 place count 24 transition count 41
Iterating global reduction 3 with 1 rules applied. Total rules applied 324 place count 24 transition count 41
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 327 place count 24 transition count 38
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 333 place count 21 transition count 35
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 334 place count 21 transition count 34
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 335 place count 20 transition count 33
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 336 place count 19 transition count 33
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 340 place count 19 transition count 29
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 342 place count 18 transition count 28
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 343 place count 17 transition count 27
Iterating global reduction 5 with 1 rules applied. Total rules applied 344 place count 17 transition count 27
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 347 place count 17 transition count 24
Free-agglomeration rule applied 1 times.
Iterating global reduction 5 with 1 rules applied. Total rules applied 348 place count 17 transition count 23
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 349 place count 16 transition count 23
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 350 place count 16 transition count 23
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 351 place count 16 transition count 22
Applied a total of 351 rules in 140 ms. Remains 16 /159 variables (removed 143) and now considering 22/307 (removed 285) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 163 ms. Remains : 16/159 places, 22/307 transitions.
[2025-06-01 13:48:19] [INFO ] Flow matrix only has 18 transitions (discarded 4 similar events)
// Phase 1: matrix 18 rows 16 cols
[2025-06-01 13:48:19] [INFO ] Computed 3 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0] Max Struct:[1, 1, 1]
RANDOM walk for 1000000 steps (109419 resets) in 1096 ms. (911 steps per ms)
FORMULA HealthRecord-PT-11-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA HealthRecord-PT-11-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA HealthRecord-PT-11-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 1000001 steps (34082 resets) in 386 ms. (2583 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:48:20] [INFO ] Flatten gal took : 45 ms
[2025-06-01 13:48:20] [INFO ] Flatten gal took : 11 ms
[2025-06-01 13:48:21] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality13176324092843439100.gal : 9 ms
[2025-06-01 13:48:21] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality13970358563719436138.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/ReachabilityCardinality13176324092843439100.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality13970358563719436138.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 12204 ms.
BK_STOP 1748785701147
--------------------
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-11"
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-11, 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-174867015900078"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/HealthRecord-PT-11.tgz
mv HealthRecord-PT-11 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 ;