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.r188-tall-171640616800473.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-08, examination is StableMarking
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r188-tall-171640616800473
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 556K
-rw-r--r-- 1 mcc users 6.9K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 78K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.8K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 42K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K 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.2K Apr 22 14:48 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 22 14:48 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Apr 12 20:18 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 159K Apr 12 20:18 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.0K Apr 12 20:17 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 81K Apr 12 20:17 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 68K 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 booleans
BOOL_VECTOR

FORMULA_NAME StableMarking

=== Now, execution of the tool begins

BK_START 1716475758158

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=StableMarking
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=HealthRecord-PT-08
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-23 14:49:19] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, StableMarking, -timeout, 180, -rebuildPNML]
[2024-05-23 14:49:19] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-23 14:49:19] [INFO ] Load time of PNML (sax parser for PT used): 111 ms
[2024-05-23 14:49:19] [INFO ] Transformed 156 places.
[2024-05-23 14:49:19] [INFO ] Transformed 326 transitions.
[2024-05-23 14:49:19] [INFO ] Found NUPN structural information;
[2024-05-23 14:49:19] [INFO ] Parsed PT model containing 156 places and 326 transitions and 855 arcs in 217 ms.
Graph (trivial) has 266 edges and 156 vertex of which 12 / 156 are part of one of the 6 SCC in 5 ms
Free SCC test removed 6 places
Structural test allowed to assert that 33 places are NOT stable. Took 23 ms.
Ensure Unique test removed 32 transitions
Reduce redundant transitions removed 32 transitions.
RANDOM walk for 40000 steps (2989 resets) in 1976 ms. (20 steps per ms) remains 43/123 properties
BEST_FIRST walk for 4004 steps (35 resets) in 41 ms. (95 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4003 steps (34 resets) in 16 ms. (235 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4004 steps (36 resets) in 23 ms. (166 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4004 steps (34 resets) in 19 ms. (200 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4002 steps (34 resets) in 19 ms. (200 steps per ms) remains 42/43 properties
BEST_FIRST walk for 4004 steps (35 resets) in 38 ms. (102 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4004 steps (31 resets) in 27 ms. (143 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4004 steps (35 resets) in 10 ms. (364 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4003 steps (32 resets) in 11 ms. (333 steps per ms) remains 41/42 properties
BEST_FIRST walk for 4003 steps (34 resets) in 12 ms. (307 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4003 steps (34 resets) in 8 ms. (444 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4004 steps (34 resets) in 12 ms. (308 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4004 steps (34 resets) in 11 ms. (333 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4004 steps (34 resets) in 9 ms. (400 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4004 steps (35 resets) in 30 ms. (129 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4004 steps (35 resets) in 14 ms. (266 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4004 steps (33 resets) in 30 ms. (129 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4004 steps (34 resets) in 11 ms. (333 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4004 steps (35 resets) in 10 ms. (364 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4004 steps (35 resets) in 7 ms. (500 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4004 steps (33 resets) in 19 ms. (200 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4004 steps (34 resets) in 13 ms. (286 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4004 steps (36 resets) in 7 ms. (500 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4002 steps (35 resets) in 7 ms. (500 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4003 steps (34 resets) in 7 ms. (500 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4004 steps (35 resets) in 12 ms. (308 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4003 steps (35 resets) in 9 ms. (400 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4004 steps (34 resets) in 11 ms. (333 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4003 steps (33 resets) in 12 ms. (307 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4004 steps (33 resets) in 11 ms. (333 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4003 steps (33 resets) in 9 ms. (400 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4003 steps (34 resets) in 8 ms. (444 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4004 steps (35 resets) in 9 ms. (400 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4003 steps (35 resets) in 8 ms. (444 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4004 steps (35 resets) in 8 ms. (444 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4004 steps (33 resets) in 8 ms. (444 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4004 steps (34 resets) in 28 ms. (138 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4003 steps (33 resets) in 8 ms. (444 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4004 steps (34 resets) in 11 ms. (333 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4003 steps (36 resets) in 9 ms. (400 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4004 steps (38 resets) in 19 ms. (200 steps per ms) remains 41/41 properties
[2024-05-23 14:49:20] [INFO ] Flow matrix only has 276 transitions (discarded 18 similar events)
// Phase 1: matrix 276 rows 150 cols
[2024-05-23 14:49:20] [INFO ] Computed 18 invariants in 16 ms
[2024-05-23 14:49:20] [INFO ] State equation strengthened by 1 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/41 variables, 41/41 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/41 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 2 (OVERLAPS) 54/95 variables, 10/51 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/95 variables, 54/105 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/95 variables, 0/105 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 5 (OVERLAPS) 55/150 variables, 8/113 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/150 variables, 55/168 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/150 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 8 (OVERLAPS) 275/425 variables, 150/318 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/425 variables, 0/318 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 10 (OVERLAPS) 1/426 variables, 1/319 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/426 variables, 0/319 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 12 (OVERLAPS) 0/426 variables, 0/319 constraints. Problems are: Problem set: 0 solved, 41 unsolved
No progress, stopping.
After SMT solving in domain Real declared 426/426 variables, and 319 constraints, problems are : Problem set: 0 solved, 41 unsolved in 1649 ms.
Refiners :[Domain max(s): 150/150 constraints, Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 150/150 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 41/41 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 41 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/41 variables, 41/41 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/41 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 2 (OVERLAPS) 54/95 variables, 10/51 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/95 variables, 54/105 constraints. Problems are: Problem set: 0 solved, 41 unsolved
[2024-05-23 14:49:22] [INFO ] Deduced a trap composed of 22 places in 93 ms of which 30 ms to minimize.
[2024-05-23 14:49:22] [INFO ] Deduced a trap composed of 41 places in 47 ms of which 2 ms to minimize.
[2024-05-23 14:49:22] [INFO ] Deduced a trap composed of 40 places in 79 ms of which 1 ms to minimize.
[2024-05-23 14:49:22] [INFO ] Deduced a trap composed of 40 places in 55 ms of which 1 ms to minimize.
[2024-05-23 14:49:23] [INFO ] Deduced a trap composed of 25 places in 62 ms of which 1 ms to minimize.
[2024-05-23 14:49:23] [INFO ] Deduced a trap composed of 39 places in 120 ms of which 1 ms to minimize.
[2024-05-23 14:49:23] [INFO ] Deduced a trap composed of 40 places in 90 ms of which 1 ms to minimize.
[2024-05-23 14:49:23] [INFO ] Deduced a trap composed of 38 places in 67 ms of which 1 ms to minimize.
[2024-05-23 14:49:24] [INFO ] Deduced a trap composed of 40 places in 637 ms of which 18 ms to minimize.
[2024-05-23 14:49:24] [INFO ] Deduced a trap composed of 40 places in 87 ms of which 1 ms to minimize.
[2024-05-23 14:49:24] [INFO ] Deduced a trap composed of 40 places in 49 ms of which 1 ms to minimize.
[2024-05-23 14:49:24] [INFO ] Deduced a trap composed of 39 places in 39 ms of which 1 ms to minimize.
[2024-05-23 14:49:24] [INFO ] Deduced a trap composed of 41 places in 85 ms of which 3 ms to minimize.
[2024-05-23 14:49:24] [INFO ] Deduced a trap composed of 40 places in 100 ms of which 1 ms to minimize.
[2024-05-23 14:49:24] [INFO ] Deduced a trap composed of 41 places in 60 ms of which 1 ms to minimize.
[2024-05-23 14:49:24] [INFO ] Deduced a trap composed of 40 places in 44 ms of which 1 ms to minimize.
[2024-05-23 14:49:24] [INFO ] Deduced a trap composed of 40 places in 78 ms of which 10 ms to minimize.
[2024-05-23 14:49:24] [INFO ] Deduced a trap composed of 40 places in 92 ms of which 1 ms to minimize.
[2024-05-23 14:49:24] [INFO ] Deduced a trap composed of 40 places in 72 ms of which 1 ms to minimize.
[2024-05-23 14:49:24] [INFO ] Deduced a trap composed of 41 places in 58 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/95 variables, 20/125 constraints. Problems are: Problem set: 0 solved, 41 unsolved
[2024-05-23 14:49:24] [INFO ] Deduced a trap composed of 38 places in 54 ms of which 0 ms to minimize.
[2024-05-23 14:49:25] [INFO ] Deduced a trap composed of 44 places in 75 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/95 variables, 2/127 constraints. Problems are: Problem set: 0 solved, 41 unsolved
[2024-05-23 14:49:25] [INFO ] Deduced a trap composed of 39 places in 60 ms of which 1 ms to minimize.
[2024-05-23 14:49:25] [INFO ] Deduced a trap composed of 41 places in 44 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/95 variables, 2/129 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/95 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 8 (OVERLAPS) 55/150 variables, 8/137 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/150 variables, 55/192 constraints. Problems are: Problem set: 0 solved, 41 unsolved
[2024-05-23 14:49:25] [INFO ] Deduced a trap composed of 29 places in 75 ms of which 1 ms to minimize.
[2024-05-23 14:49:25] [INFO ] Deduced a trap composed of 39 places in 62 ms of which 1 ms to minimize.
[2024-05-23 14:49:25] [INFO ] Deduced a trap composed of 39 places in 78 ms of which 1 ms to minimize.
[2024-05-23 14:49:25] [INFO ] Deduced a trap composed of 40 places in 58 ms of which 1 ms to minimize.
[2024-05-23 14:49:25] [INFO ] Deduced a trap composed of 40 places in 48 ms of which 1 ms to minimize.
[2024-05-23 14:49:26] [INFO ] Deduced a trap composed of 39 places in 65 ms of which 0 ms to minimize.
[2024-05-23 14:49:26] [INFO ] Deduced a trap composed of 40 places in 60 ms of which 1 ms to minimize.
[2024-05-23 14:49:26] [INFO ] Deduced a trap composed of 39 places in 59 ms of which 1 ms to minimize.
[2024-05-23 14:49:26] [INFO ] Deduced a trap composed of 40 places in 50 ms of which 1 ms to minimize.
[2024-05-23 14:49:26] [INFO ] Deduced a trap composed of 38 places in 47 ms of which 1 ms to minimize.
[2024-05-23 14:49:26] [INFO ] Deduced a trap composed of 39 places in 50 ms of which 4 ms to minimize.
[2024-05-23 14:49:26] [INFO ] Deduced a trap composed of 29 places in 45 ms of which 1 ms to minimize.
[2024-05-23 14:49:26] [INFO ] Deduced a trap composed of 38 places in 43 ms of which 1 ms to minimize.
[2024-05-23 14:49:26] [INFO ] Deduced a trap composed of 39 places in 43 ms of which 1 ms to minimize.
[2024-05-23 14:49:26] [INFO ] Deduced a trap composed of 39 places in 44 ms of which 1 ms to minimize.
[2024-05-23 14:49:26] [INFO ] Deduced a trap composed of 41 places in 48 ms of which 2 ms to minimize.
[2024-05-23 14:49:26] [INFO ] Deduced a trap composed of 41 places in 45 ms of which 1 ms to minimize.
[2024-05-23 14:49:26] [INFO ] Deduced a trap composed of 46 places in 48 ms of which 1 ms to minimize.
[2024-05-23 14:49:26] [INFO ] Deduced a trap composed of 45 places in 58 ms of which 1 ms to minimize.
[2024-05-23 14:49:26] [INFO ] Deduced a trap composed of 32 places in 55 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/150 variables, 20/212 constraints. Problems are: Problem set: 0 solved, 41 unsolved
[2024-05-23 14:49:26] [INFO ] Deduced a trap composed of 29 places in 42 ms of which 1 ms to minimize.
[2024-05-23 14:49:26] [INFO ] Deduced a trap composed of 29 places in 47 ms of which 0 ms to minimize.
[2024-05-23 14:49:27] [INFO ] Deduced a trap composed of 29 places in 49 ms of which 1 ms to minimize.
[2024-05-23 14:49:27] [INFO ] Deduced a trap composed of 29 places in 44 ms of which 1 ms to minimize.
[2024-05-23 14:49:27] [INFO ] Deduced a trap composed of 30 places in 35 ms of which 0 ms to minimize.
[2024-05-23 14:49:27] [INFO ] Deduced a trap composed of 29 places in 37 ms of which 1 ms to minimize.
[2024-05-23 14:49:27] [INFO ] Deduced a trap composed of 29 places in 40 ms of which 1 ms to minimize.
[2024-05-23 14:49:27] [INFO ] Deduced a trap composed of 30 places in 36 ms of which 1 ms to minimize.
[2024-05-23 14:49:27] [INFO ] Deduced a trap composed of 29 places in 38 ms of which 0 ms to minimize.
[2024-05-23 14:49:27] [INFO ] Deduced a trap composed of 29 places in 33 ms of which 0 ms to minimize.
[2024-05-23 14:49:27] [INFO ] Deduced a trap composed of 45 places in 68 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 150/426 variables, and 223 constraints, problems are : Problem set: 0 solved, 41 unsolved in 5029 ms.
Refiners :[Domain max(s): 150/150 constraints, Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 0/150 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/41 constraints, Known Traps: 55/55 constraints]
After SMT, in 6758ms problems are : Problem set: 0 solved, 41 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 41 out of 150 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 150/150 places, 294/294 transitions.
Graph (complete) has 650 edges and 150 vertex of which 141 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.1 ms
Discarding 9 places :
Also discarding 9 output transitions
Drop transitions (Output transitions of discarded places.) removed 9 transitions
Drop transitions (Empty/Sink Transition effects.) removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 13 rules applied. Total rules applied 14 place count 141 transition count 272
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 20 place count 138 transition count 269
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 20 place count 138 transition count 266
Deduced a syphon composed of 3 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 28 place count 133 transition count 266
Discarding 47 places :
Symmetric choice reduction at 2 with 47 rule applications. Total rules 75 place count 86 transition count 172
Iterating global reduction 2 with 47 rules applied. Total rules applied 122 place count 86 transition count 172
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 127 place count 81 transition count 162
Iterating global reduction 2 with 5 rules applied. Total rules applied 132 place count 81 transition count 162
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 140 place count 81 transition count 154
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: -33
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 152 place count 75 transition count 187
Drop transitions (Redundant composition of simpler transitions.) removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 3 with 5 rules applied. Total rules applied 157 place count 75 transition count 182
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 3 with 2 rules applied. Total rules applied 159 place count 75 transition count 180
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 161 place count 73 transition count 180
Applied a total of 161 rules in 53 ms. Remains 73 /150 variables (removed 77) and now considering 180/294 (removed 114) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 63 ms. Remains : 73/150 places, 180/294 transitions.
RANDOM walk for 4000000 steps (922839 resets) in 25309 ms. (158 steps per ms) remains 30/41 properties
BEST_FIRST walk for 400004 steps (12809 resets) in 476 ms. (838 steps per ms) remains 30/30 properties
BEST_FIRST walk for 400004 steps (12758 resets) in 499 ms. (800 steps per ms) remains 30/30 properties
BEST_FIRST walk for 400004 steps (12746 resets) in 528 ms. (756 steps per ms) remains 30/30 properties
BEST_FIRST walk for 400004 steps (12776 resets) in 435 ms. (917 steps per ms) remains 30/30 properties
BEST_FIRST walk for 400002 steps (12678 resets) in 493 ms. (809 steps per ms) remains 30/30 properties
BEST_FIRST walk for 400003 steps (12733 resets) in 498 ms. (801 steps per ms) remains 30/30 properties
BEST_FIRST walk for 400004 steps (12779 resets) in 473 ms. (843 steps per ms) remains 30/30 properties
BEST_FIRST walk for 400004 steps (12762 resets) in 466 ms. (856 steps per ms) remains 30/30 properties
BEST_FIRST walk for 400003 steps (12765 resets) in 493 ms. (809 steps per ms) remains 30/30 properties
BEST_FIRST walk for 400004 steps (12741 resets) in 481 ms. (829 steps per ms) remains 30/30 properties
BEST_FIRST walk for 400003 steps (12718 resets) in 436 ms. (915 steps per ms) remains 30/30 properties
BEST_FIRST walk for 400003 steps (12774 resets) in 483 ms. (826 steps per ms) remains 30/30 properties
BEST_FIRST walk for 400003 steps (12814 resets) in 502 ms. (795 steps per ms) remains 30/30 properties
BEST_FIRST walk for 400002 steps (12784 resets) in 470 ms. (849 steps per ms) remains 30/30 properties
BEST_FIRST walk for 400003 steps (12767 resets) in 492 ms. (811 steps per ms) remains 30/30 properties
BEST_FIRST walk for 400003 steps (12671 resets) in 323 ms. (1234 steps per ms) remains 30/30 properties
BEST_FIRST walk for 400004 steps (12744 resets) in 324 ms. (1230 steps per ms) remains 30/30 properties
BEST_FIRST walk for 400004 steps (12790 resets) in 324 ms. (1230 steps per ms) remains 30/30 properties
BEST_FIRST walk for 400004 steps (12717 resets) in 319 ms. (1250 steps per ms) remains 30/30 properties
BEST_FIRST walk for 400003 steps (12750 resets) in 323 ms. (1234 steps per ms) remains 30/30 properties
BEST_FIRST walk for 400004 steps (12767 resets) in 323 ms. (1234 steps per ms) remains 30/30 properties
BEST_FIRST walk for 400004 steps (12768 resets) in 329 ms. (1212 steps per ms) remains 30/30 properties
BEST_FIRST walk for 400004 steps (12801 resets) in 324 ms. (1230 steps per ms) remains 30/30 properties
BEST_FIRST walk for 400003 steps (12776 resets) in 330 ms. (1208 steps per ms) remains 30/30 properties
BEST_FIRST walk for 400004 steps (12724 resets) in 329 ms. (1212 steps per ms) remains 30/30 properties
BEST_FIRST walk for 400004 steps (12742 resets) in 329 ms. (1212 steps per ms) remains 30/30 properties
BEST_FIRST walk for 400004 steps (12805 resets) in 337 ms. (1183 steps per ms) remains 30/30 properties
BEST_FIRST walk for 400004 steps (12792 resets) in 321 ms. (1242 steps per ms) remains 30/30 properties
BEST_FIRST walk for 400004 steps (12772 resets) in 318 ms. (1253 steps per ms) remains 30/30 properties
BEST_FIRST walk for 400004 steps (12773 resets) in 316 ms. (1261 steps per ms) remains 26/30 properties
[2024-05-23 14:49:39] [INFO ] Flow matrix only has 167 transitions (discarded 13 similar events)
// Phase 1: matrix 167 rows 73 cols
[2024-05-23 14:49:39] [INFO ] Computed 7 invariants in 3 ms
[2024-05-23 14:49:39] [INFO ] State equation strengthened by 14 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/26 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 1 (OVERLAPS) 5/31 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/31 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 3 (OVERLAPS) 42/73 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/73 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 5 (OVERLAPS) 167/240 variables, 73/80 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/240 variables, 14/94 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/240 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 8 (OVERLAPS) 0/240 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 26 unsolved
No progress, stopping.
After SMT solving in domain Real declared 240/240 variables, and 94 constraints, problems are : Problem set: 0 solved, 26 unsolved in 378 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 73/73 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 26/26 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 26 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/26 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 1 (OVERLAPS) 5/31 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/31 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 3 (OVERLAPS) 42/73 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/73 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 5 (OVERLAPS) 167/240 variables, 73/80 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/240 variables, 14/94 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/240 variables, 26/120 constraints. Problems are: Problem set: 0 solved, 26 unsolved
[2024-05-23 14:49:40] [INFO ] Deduced a trap composed of 17 places in 50 ms of which 3 ms to minimize.
[2024-05-23 14:49:40] [INFO ] Deduced a trap composed of 31 places in 41 ms of which 5 ms to minimize.
[2024-05-23 14:49:40] [INFO ] Deduced a trap composed of 31 places in 39 ms of which 1 ms to minimize.
[2024-05-23 14:49:40] [INFO ] Deduced a trap composed of 33 places in 39 ms of which 0 ms to minimize.
[2024-05-23 14:49:40] [INFO ] Deduced a trap composed of 32 places in 40 ms of which 1 ms to minimize.
[2024-05-23 14:49:40] [INFO ] Deduced a trap composed of 22 places in 40 ms of which 0 ms to minimize.
[2024-05-23 14:49:40] [INFO ] Deduced a trap composed of 32 places in 39 ms of which 1 ms to minimize.
[2024-05-23 14:49:40] [INFO ] Deduced a trap composed of 32 places in 41 ms of which 1 ms to minimize.
[2024-05-23 14:49:40] [INFO ] Deduced a trap composed of 32 places in 38 ms of which 1 ms to minimize.
[2024-05-23 14:49:40] [INFO ] Deduced a trap composed of 33 places in 45 ms of which 1 ms to minimize.
[2024-05-23 14:49:40] [INFO ] Deduced a trap composed of 17 places in 42 ms of which 1 ms to minimize.
[2024-05-23 14:49:40] [INFO ] Deduced a trap composed of 15 places in 40 ms of which 0 ms to minimize.
[2024-05-23 14:49:41] [INFO ] Deduced a trap composed of 33 places in 33 ms of which 1 ms to minimize.
[2024-05-23 14:49:41] [INFO ] Deduced a trap composed of 32 places in 40 ms of which 0 ms to minimize.
[2024-05-23 14:49:41] [INFO ] Deduced a trap composed of 31 places in 38 ms of which 1 ms to minimize.
[2024-05-23 14:49:41] [INFO ] Deduced a trap composed of 32 places in 36 ms of which 0 ms to minimize.
[2024-05-23 14:49:41] [INFO ] Deduced a trap composed of 32 places in 40 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/240 variables, 17/137 constraints. Problems are: Problem set: 0 solved, 26 unsolved
[2024-05-23 14:49:41] [INFO ] Deduced a trap composed of 18 places in 41 ms of which 0 ms to minimize.
[2024-05-23 14:49:41] [INFO ] Deduced a trap composed of 31 places in 42 ms of which 2 ms to minimize.
[2024-05-23 14:49:41] [INFO ] Deduced a trap composed of 19 places in 39 ms of which 1 ms to minimize.
[2024-05-23 14:49:41] [INFO ] Deduced a trap composed of 33 places in 32 ms of which 0 ms to minimize.
[2024-05-23 14:49:41] [INFO ] Deduced a trap composed of 31 places in 41 ms of which 1 ms to minimize.
[2024-05-23 14:49:41] [INFO ] Deduced a trap composed of 30 places in 39 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/240 variables, 6/143 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/240 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 11 (OVERLAPS) 0/240 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 26 unsolved
No progress, stopping.
After SMT solving in domain Int declared 240/240 variables, and 143 constraints, problems are : Problem set: 0 solved, 26 unsolved in 2001 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 73/73 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 26/26 constraints, Known Traps: 23/23 constraints]
After SMT, in 2393ms problems are : Problem set: 0 solved, 26 unsolved
Fused 26 Parikh solutions to 20 different solutions.
Parikh walk visited 23 properties in 1446 ms.
Support contains 3 out of 73 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 73/73 places, 180/180 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 73 transition count 178
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 5 place count 71 transition count 177
Discarding 26 places :
Symmetric choice reduction at 2 with 26 rule applications. Total rules 31 place count 45 transition count 125
Iterating global reduction 2 with 26 rules applied. Total rules applied 57 place count 45 transition count 125
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 61 place count 41 transition count 117
Iterating global reduction 2 with 4 rules applied. Total rules applied 65 place count 41 transition count 117
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 68 place count 38 transition count 108
Iterating global reduction 2 with 3 rules applied. Total rules applied 71 place count 38 transition count 108
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 74 place count 35 transition count 99
Iterating global reduction 2 with 3 rules applied. Total rules applied 77 place count 35 transition count 99
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 2 with 18 rules applied. Total rules applied 95 place count 35 transition count 81
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 3 with 2 rules applied. Total rules applied 97 place count 34 transition count 80
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 98 place count 33 transition count 77
Iterating global reduction 3 with 1 rules applied. Total rules applied 99 place count 33 transition count 77
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 103 place count 31 transition count 85
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 104 place count 31 transition count 84
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 105 place count 31 transition count 141
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 109 place count 30 transition count 138
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 110 place count 30 transition count 137
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 111 place count 29 transition count 106
Iterating global reduction 4 with 1 rules applied. Total rules applied 112 place count 29 transition count 106
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 113 place count 28 transition count 103
Iterating global reduction 4 with 1 rules applied. Total rules applied 114 place count 28 transition count 103
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 4 with 8 rules applied. Total rules applied 122 place count 28 transition count 95
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 126 place count 28 transition count 91
Partial Free-agglomeration rule applied 8 times.
Drop transitions (Partial Free agglomeration) removed 8 transitions
Iterating global reduction 5 with 8 rules applied. Total rules applied 134 place count 28 transition count 91
Partial Free-agglomeration rule applied 7 times.
Drop transitions (Partial Free agglomeration) removed 7 transitions
Iterating global reduction 5 with 7 rules applied. Total rules applied 141 place count 28 transition count 91
Applied a total of 141 rules in 42 ms. Remains 28 /73 variables (removed 45) and now considering 91/180 (removed 89) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 42 ms. Remains : 28/73 places, 91/180 transitions.
RANDOM walk for 2432065 steps (560059 resets) in 10667 ms. (227 steps per ms) remains 0/3 properties
Able to resolve query StableMarking after proving 125 properties.
FORMULA StableMarking FALSE TECHNIQUES RANDOM_WALK PARIKH_WALK MARKED_SUFFIX_TEST TRIVIAL_UNMARKED_SCC_TEST BESTFIRST_WALK TOPOLOGICAL
Total runtime 31235 ms.
ITS solved all properties within timeout

BK_STOP 1716475790630

--------------------
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//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination StableMarking -timeout 180 -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-08"
export BK_EXAMINATION="StableMarking"
export BK_TOOL="greatspnxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="1800"
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-08, examination is StableMarking"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r188-tall-171640616800473"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/HealthRecord-PT-08.tgz
mv HealthRecord-PT-08 execution
cd execution
if [ "StableMarking" = "ReachabilityDeadlock" ] || [ "StableMarking" = "UpperBounds" ] || [ "StableMarking" = "QuasiLiveness" ] || [ "StableMarking" = "StableMarking" ] || [ "StableMarking" = "Liveness" ] || [ "StableMarking" = "OneSafe" ] || [ "StableMarking" = "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 [ "StableMarking" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "StableMarking" != "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 "StableMarking.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property StableMarking.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "StableMarking.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 '' StableMarking.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "StableMarking" = "ReachabilityDeadlock" ] || [ "StableMarking" = "QuasiLiveness" ] || [ "StableMarking" = "StableMarking" ] || [ "StableMarking" = "Liveness" ] || [ "StableMarking" = "OneSafe" ] ; then
echo "FORMULA_NAME StableMarking"
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 ;