Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r179-tall-171640602300789.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-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-5568
Executing tool greatspnxred
Input is HealthRecord-PT-12, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r179-tall-171640602300789
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 520K
-rw-r--r-- 1 mcc users 7.8K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 90K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 55K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K Apr 22 14:48 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Apr 22 14:48 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 19 07:18 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 19 18:26 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Apr 12 20:05 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 135K Apr 12 20:05 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.1K Apr 12 20:03 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 48K Apr 12 20:03 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 22 14:48 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:48 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 3 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 71K May 18 16:42 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

here is the order used to build the result vector(from text file)
FORMULA_NAME HealthRecord-PT-12-UpperBounds-00
FORMULA_NAME HealthRecord-PT-12-UpperBounds-01
FORMULA_NAME HealthRecord-PT-12-UpperBounds-02
FORMULA_NAME HealthRecord-PT-12-UpperBounds-03
FORMULA_NAME HealthRecord-PT-12-UpperBounds-04
FORMULA_NAME HealthRecord-PT-12-UpperBounds-05
FORMULA_NAME HealthRecord-PT-12-UpperBounds-06
FORMULA_NAME HealthRecord-PT-12-UpperBounds-07
FORMULA_NAME HealthRecord-PT-12-UpperBounds-08
FORMULA_NAME HealthRecord-PT-12-UpperBounds-09
FORMULA_NAME HealthRecord-PT-12-UpperBounds-10
FORMULA_NAME HealthRecord-PT-12-UpperBounds-11
FORMULA_NAME HealthRecord-PT-12-UpperBounds-12
FORMULA_NAME HealthRecord-PT-12-UpperBounds-13
FORMULA_NAME HealthRecord-PT-12-UpperBounds-14
FORMULA_NAME HealthRecord-PT-12-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1716491100162

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=HealthRecord-PT-12
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-23 19:05:01] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2024-05-23 19:05:01] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-23 19:05:01] [INFO ] Load time of PNML (sax parser for PT used): 75 ms
[2024-05-23 19:05:01] [INFO ] Transformed 160 places.
[2024-05-23 19:05:01] [INFO ] Transformed 340 transitions.
[2024-05-23 19:05:01] [INFO ] Found NUPN structural information;
[2024-05-23 19:05:01] [INFO ] Parsed PT model containing 160 places and 340 transitions and 895 arcs in 174 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 7 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]
[2024-05-23 19:05:01] [INFO ] Flow matrix only has 300 transitions (discarded 12 similar events)
// Phase 1: matrix 300 rows 160 cols
[2024-05-23 19:05:01] [INFO ] Computed 18 invariants in 25 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 (712 resets) in 39 ms. (250 steps per ms)
FORMULA HealthRecord-PT-12-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA HealthRecord-PT-12-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA HealthRecord-PT-12-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA HealthRecord-PT-12-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA HealthRecord-PT-12-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA HealthRecord-PT-12-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA HealthRecord-PT-12-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA HealthRecord-PT-12-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA HealthRecord-PT-12-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA HealthRecord-PT-12-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 60006 steps (534 resets) in 56 ms. (1052 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1]
[2024-05-23 19:05:01] [INFO ] Flow matrix only has 300 transitions (discarded 12 similar events)
[2024-05-23 19:05:01] [INFO ] Invariant cache hit.
[2024-05-23 19:05:01] [INFO ] [Real]Absence check using 10 positive place invariants in 10 ms returned sat
[2024-05-23 19:05:02] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 10 ms returned sat
[2024-05-23 19:05:02] [INFO ] [Real]Absence check using state equation in 83 ms returned sat
[2024-05-23 19:05:02] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-23 19:05:02] [INFO ] [Real]Added 1 Read/Feed constraints in 2 ms returned sat
[2024-05-23 19:05:02] [INFO ] Deduced a trap composed of 30 places in 55 ms of which 8 ms to minimize.
[2024-05-23 19:05:02] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 19:05:02] [INFO ] [Nat]Absence check using 10 positive place invariants in 7 ms returned sat
[2024-05-23 19:05:02] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 5 ms returned sat
[2024-05-23 19:05:02] [INFO ] [Nat]Absence check using state equation in 65 ms returned sat
[2024-05-23 19:05:02] [INFO ] [Nat]Added 1 Read/Feed constraints in 2 ms returned sat
[2024-05-23 19:05:02] [INFO ] Deduced a trap composed of 31 places in 65 ms of which 2 ms to minimize.
[2024-05-23 19:05:02] [INFO ] Deduced a trap composed of 30 places in 55 ms of which 1 ms to minimize.
[2024-05-23 19:05:02] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 177 ms
[2024-05-23 19:05:02] [INFO ] Computed and/alt/rep : 233/269/233 causal constraints (skipped 66 transitions) in 29 ms.
[2024-05-23 19:05:02] [INFO ] Added : 15 causal constraints over 3 iterations in 143 ms. Result :sat
Minimization took 164 ms.
[2024-05-23 19:05:02] [INFO ] [Real]Absence check using 10 positive place invariants in 6 ms returned sat
[2024-05-23 19:05:02] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 3 ms returned sat
[2024-05-23 19:05:02] [INFO ] [Real]Absence check using state equation in 61 ms returned sat
[2024-05-23 19:05:02] [INFO ] [Real]Added 1 Read/Feed constraints in 2 ms returned sat
[2024-05-23 19:05:03] [INFO ] Deduced a trap composed of 39 places in 52 ms of which 1 ms to minimize.
[2024-05-23 19:05:03] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 19:05:03] [INFO ] [Nat]Absence check using 10 positive place invariants in 6 ms returned sat
[2024-05-23 19:05:03] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 3 ms returned sat
[2024-05-23 19:05:03] [INFO ] [Nat]Absence check using state equation in 58 ms returned sat
[2024-05-23 19:05:03] [INFO ] [Nat]Added 1 Read/Feed constraints in 2 ms returned sat
[2024-05-23 19:05:03] [INFO ] Computed and/alt/rep : 233/269/233 causal constraints (skipped 66 transitions) in 19 ms.
[2024-05-23 19:05:03] [INFO ] Added : 22 causal constraints over 5 iterations in 114 ms. Result :sat
Minimization took 147 ms.
[2024-05-23 19:05:03] [INFO ] [Real]Absence check using 10 positive place invariants in 5 ms returned sat
[2024-05-23 19:05:03] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 3 ms returned sat
[2024-05-23 19:05:03] [INFO ] [Real]Absence check using state equation in 59 ms returned sat
[2024-05-23 19:05:03] [INFO ] [Real]Added 1 Read/Feed constraints in 2 ms returned sat
[2024-05-23 19:05:03] [INFO ] Deduced a trap composed of 30 places in 46 ms of which 1 ms to minimize.
[2024-05-23 19:05:03] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 19:05:03] [INFO ] [Nat]Absence check using 10 positive place invariants in 6 ms returned sat
[2024-05-23 19:05:03] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 3 ms returned sat
[2024-05-23 19:05:03] [INFO ] [Nat]Absence check using state equation in 67 ms returned sat
[2024-05-23 19:05:03] [INFO ] [Nat]Added 1 Read/Feed constraints in 3 ms returned sat
[2024-05-23 19:05:03] [INFO ] Deduced a trap composed of 29 places in 34 ms of which 1 ms to minimize.
[2024-05-23 19:05:03] [INFO ] Deduced a trap composed of 30 places in 46 ms of which 1 ms to minimize.
[2024-05-23 19:05:03] [INFO ] Deduced a trap composed of 30 places in 35 ms of which 1 ms to minimize.
[2024-05-23 19:05:03] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 151 ms
[2024-05-23 19:05:03] [INFO ] Computed and/alt/rep : 233/269/233 causal constraints (skipped 66 transitions) in 25 ms.
[2024-05-23 19:05:04] [INFO ] Added : 16 causal constraints over 4 iterations in 97 ms. Result :sat
Minimization took 145 ms.
[2024-05-23 19:05:04] [INFO ] [Real]Absence check using 10 positive place invariants in 5 ms returned sat
[2024-05-23 19:05:04] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 3 ms returned sat
[2024-05-23 19:05:04] [INFO ] [Real]Absence check using state equation in 56 ms returned sat
[2024-05-23 19:05:04] [INFO ] [Real]Added 1 Read/Feed constraints in 1 ms returned sat
[2024-05-23 19:05:04] [INFO ] Computed and/alt/rep : 233/269/233 causal constraints (skipped 66 transitions) in 21 ms.
[2024-05-23 19:05:04] [INFO ] Added : 14 causal constraints over 3 iterations in 87 ms. Result :sat
Minimization took 151 ms.
[2024-05-23 19:05:04] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 19:05:04] [INFO ] [Nat]Absence check using 10 positive place invariants in 6 ms returned sat
[2024-05-23 19:05:04] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 3 ms returned sat
[2024-05-23 19:05:04] [INFO ] [Nat]Absence check using state equation in 62 ms returned sat
[2024-05-23 19:05:04] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2024-05-23 19:05:04] [INFO ] Computed and/alt/rep : 233/269/233 causal constraints (skipped 66 transitions) in 21 ms.
[2024-05-23 19:05:04] [INFO ] Added : 14 causal constraints over 3 iterations in 88 ms. Result :sat
Minimization took 161 ms.
[2024-05-23 19:05:05] [INFO ] [Real]Absence check using 10 positive place invariants in 6 ms returned sat
[2024-05-23 19:05:05] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 3 ms returned sat
[2024-05-23 19:05:05] [INFO ] [Real]Absence check using state equation in 64 ms returned sat
[2024-05-23 19:05:05] [INFO ] [Real]Added 1 Read/Feed constraints in 2 ms returned sat
[2024-05-23 19:05:05] [INFO ] Deduced a trap composed of 38 places in 53 ms of which 1 ms to minimize.
[2024-05-23 19:05:05] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 19:05:05] [INFO ] [Nat]Absence check using 10 positive place invariants in 6 ms returned sat
[2024-05-23 19:05:05] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 16 ms returned sat
[2024-05-23 19:05:05] [INFO ] [Nat]Absence check using state equation in 61 ms returned sat
[2024-05-23 19:05:05] [INFO ] [Nat]Added 1 Read/Feed constraints in 3 ms returned sat
[2024-05-23 19:05:05] [INFO ] Deduced a trap composed of 38 places in 56 ms of which 1 ms to minimize.
[2024-05-23 19:05:05] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 73 ms
[2024-05-23 19:05:05] [INFO ] Computed and/alt/rep : 233/269/233 causal constraints (skipped 66 transitions) in 26 ms.
[2024-05-23 19:05:05] [INFO ] Added : 15 causal constraints over 3 iterations in 89 ms. Result :sat
Minimization took 149 ms.
[2024-05-23 19:05:05] [INFO ] [Real]Absence check using 10 positive place invariants in 5 ms returned sat
[2024-05-23 19:05:05] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 3 ms returned sat
[2024-05-23 19:05:05] [INFO ] [Real]Absence check using state equation in 56 ms returned sat
[2024-05-23 19:05:05] [INFO ] [Real]Added 1 Read/Feed constraints in 8 ms returned sat
[2024-05-23 19:05:05] [INFO ] Deduced a trap composed of 45 places in 67 ms of which 1 ms to minimize.
[2024-05-23 19:05:05] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 19:05:05] [INFO ] [Nat]Absence check using 10 positive place invariants in 6 ms returned sat
[2024-05-23 19:05:05] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 4 ms returned sat
[2024-05-23 19:05:06] [INFO ] [Nat]Absence check using state equation in 62 ms returned sat
[2024-05-23 19:05:06] [INFO ] [Nat]Added 1 Read/Feed constraints in 3 ms returned sat
[2024-05-23 19:05:06] [INFO ] Deduced a trap composed of 41 places in 64 ms of which 2 ms to minimize.
[2024-05-23 19:05:06] [INFO ] Deduced a trap composed of 38 places in 57 ms of which 1 ms to minimize.
[2024-05-23 19:05:06] [INFO ] Deduced a trap composed of 40 places in 54 ms of which 4 ms to minimize.
[2024-05-23 19:05:06] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 209 ms
[2024-05-23 19:05:06] [INFO ] Computed and/alt/rep : 233/269/233 causal constraints (skipped 66 transitions) in 19 ms.
[2024-05-23 19:05:06] [INFO ] Added : 16 causal constraints over 4 iterations in 93 ms. Result :sat
Minimization took 146 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1]
FORMULA HealthRecord-PT-12-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA HealthRecord-PT-12-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA HealthRecord-PT-12-UpperBounds-04 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 160 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 160/160 places, 312/312 transitions.
Graph (trivial) has 240 edges and 160 vertex of which 8 / 160 are part of one of the 4 SCC in 3 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 678 edges and 156 vertex of which 128 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 116 transitions
Reduce isomorphic transitions removed 116 transitions.
Iterating post reduction 0 with 116 rules applied. Total rules applied 118 place count 128 transition count 163
Discarding 81 places :
Symmetric choice reduction at 1 with 81 rule applications. Total rules 199 place count 47 transition count 82
Iterating global reduction 1 with 81 rules applied. Total rules applied 280 place count 47 transition count 82
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 7 Pre rules applied. Total rules applied 280 place count 47 transition count 75
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 1 with 14 rules applied. Total rules applied 294 place count 40 transition count 75
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 307 place count 27 transition count 56
Iterating global reduction 1 with 13 rules applied. Total rules applied 320 place count 27 transition count 56
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 329 place count 27 transition count 47
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 331 place count 25 transition count 44
Iterating global reduction 2 with 2 rules applied. Total rules applied 333 place count 25 transition count 44
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 334 place count 25 transition count 43
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 335 place count 24 transition count 42
Iterating global reduction 3 with 1 rules applied. Total rules applied 336 place count 24 transition count 42
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 339 place count 24 transition count 39
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 343 place count 22 transition count 37
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 344 place count 22 transition count 36
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 345 place count 21 transition count 35
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (trivial) has 13 edges and 18 vertex of which 8 / 18 are part of one of the 1 SCC in 0 ms
Free SCC test removed 7 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 4 with 6 rules applied. Total rules applied 351 place count 11 transition count 33
Reduce places removed 1 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 5 with 21 rules applied. Total rules applied 372 place count 10 transition count 13
Free-agglomeration rule applied 1 times.
Iterating global reduction 6 with 1 rules applied. Total rules applied 373 place count 10 transition count 12
Reduce places removed 1 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 375 place count 9 transition count 11
Applied a total of 375 rules in 56 ms. Remains 9 /160 variables (removed 151) and now considering 11/312 (removed 301) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 64 ms. Remains : 9/160 places, 11/312 transitions.
// Phase 1: matrix 11 rows 9 cols
[2024-05-23 19:05:06] [INFO ] Computed 1 invariants in 2 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0] Max Struct:[1, 1, 1]
RANDOM walk for 1000000 steps (128240 resets) in 427 ms. (2336 steps per ms)
FORMULA HealthRecord-PT-12-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA HealthRecord-PT-12-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA HealthRecord-PT-12-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 1000001 steps (40142 resets) in 214 ms. (4651 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 )
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[] Max Struct:[]
All properties solved without resorting to model-checking.
Total runtime 5995 ms.
ITS solved all properties within timeout

BK_STOP 1716491107433

--------------------
content from stderr:

+ 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//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -timeout 360 -rebuildPNML

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-12"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="greatspnxred"
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-5568"
echo " Executing tool greatspnxred"
echo " Input is HealthRecord-PT-12, 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 r179-tall-171640602300789"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/HealthRecord-PT-12.tgz
mv HealthRecord-PT-12 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.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property UpperBounds.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -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 ;