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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 616K
-rw-r--r-- 1 mcc users 6.6K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 73K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 49K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:48 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K 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 17K Apr 22 14:48 LTLFireability.xml
-rw-r--r-- 1 mcc users 19K Apr 12 21:33 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 230K Apr 12 21:33 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.9K Apr 12 21:30 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 68K Apr 12 21:30 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 1716475807170

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-09
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-23 14:50:08] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, StableMarking, -timeout, 180, -rebuildPNML]
[2024-05-23 14:50:08] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-23 14:50:08] [INFO ] Load time of PNML (sax parser for PT used): 69 ms
[2024-05-23 14:50:08] [INFO ] Transformed 157 places.
[2024-05-23 14:50:08] [INFO ] Transformed 327 transitions.
[2024-05-23 14:50:08] [INFO ] Found NUPN structural information;
[2024-05-23 14:50:08] [INFO ] Parsed PT model containing 157 places and 327 transitions and 859 arcs in 164 ms.
Graph (trivial) has 266 edges and 157 vertex of which 12 / 157 are part of one of the 6 SCC in 3 ms
Free SCC test removed 6 places
Structural test allowed to assert that 31 places are NOT stable. Took 24 ms.
Ensure Unique test removed 32 transitions
Reduce redundant transitions removed 32 transitions.
RANDOM walk for 40000 steps (3244 resets) in 1725 ms. (23 steps per ms) remains 61/126 properties
BEST_FIRST walk for 4003 steps (40 resets) in 18 ms. (210 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4003 steps (44 resets) in 20 ms. (190 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4004 steps (43 resets) in 18 ms. (210 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4003 steps (44 resets) in 16 ms. (235 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4002 steps (43 resets) in 18 ms. (210 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4004 steps (44 resets) in 19 ms. (200 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4003 steps (44 resets) in 13 ms. (285 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4003 steps (43 resets) in 16 ms. (235 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4004 steps (43 resets) in 15 ms. (250 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4003 steps (42 resets) in 15 ms. (250 steps per ms) remains 49/61 properties
BEST_FIRST walk for 4004 steps (45 resets) in 13 ms. (286 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4004 steps (43 resets) in 14 ms. (266 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4002 steps (43 resets) in 13 ms. (285 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4004 steps (40 resets) in 24 ms. (160 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4002 steps (41 resets) in 11 ms. (333 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4003 steps (45 resets) in 13 ms. (285 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4004 steps (37 resets) in 12 ms. (308 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4003 steps (44 resets) in 11 ms. (333 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4002 steps (43 resets) in 16 ms. (235 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4003 steps (41 resets) in 11 ms. (333 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4004 steps (41 resets) in 14 ms. (266 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4003 steps (39 resets) in 19 ms. (200 steps per ms) remains 48/49 properties
BEST_FIRST walk for 4004 steps (45 resets) in 12 ms. (308 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4004 steps (39 resets) in 13 ms. (286 steps per ms) remains 47/48 properties
BEST_FIRST walk for 4003 steps (41 resets) in 14 ms. (266 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4003 steps (42 resets) in 10 ms. (363 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4003 steps (41 resets) in 10 ms. (363 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4002 steps (41 resets) in 9 ms. (400 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4004 steps (42 resets) in 12 ms. (308 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4004 steps (43 resets) in 10 ms. (364 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4004 steps (42 resets) in 13 ms. (286 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4002 steps (43 resets) in 9 ms. (400 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4004 steps (42 resets) in 12 ms. (308 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4003 steps (43 resets) in 10 ms. (363 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4003 steps (42 resets) in 12 ms. (307 steps per ms) remains 46/47 properties
BEST_FIRST walk for 4004 steps (41 resets) in 10 ms. (364 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4003 steps (43 resets) in 9 ms. (400 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4004 steps (44 resets) in 8 ms. (444 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4003 steps (41 resets) in 8 ms. (444 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4004 steps (42 resets) in 10 ms. (364 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4003 steps (40 resets) in 10 ms. (363 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4004 steps (43 resets) in 18 ms. (210 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4002 steps (43 resets) in 12 ms. (307 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4004 steps (44 resets) in 20 ms. (190 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4004 steps (41 resets) in 14 ms. (266 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4004 steps (40 resets) in 11 ms. (333 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4004 steps (41 resets) in 14 ms. (266 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4003 steps (43 resets) in 11 ms. (333 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4002 steps (41 resets) in 19 ms. (200 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4001 steps (40 resets) in 9 ms. (400 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4002 steps (41 resets) in 16 ms. (235 steps per ms) remains 46/46 properties
[2024-05-23 14:50:09] [INFO ] Flow matrix only has 277 transitions (discarded 18 similar events)
// Phase 1: matrix 277 rows 151 cols
[2024-05-23 14:50:09] [INFO ] Computed 18 invariants in 16 ms
[2024-05-23 14:50:09] [INFO ] State equation strengthened by 1 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/46 variables, 46/46 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/46 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 2 (OVERLAPS) 49/95 variables, 10/56 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/95 variables, 49/105 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/95 variables, 0/105 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 5 (OVERLAPS) 56/151 variables, 8/113 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/151 variables, 56/169 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/151 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 8 (OVERLAPS) 276/427 variables, 151/320 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/427 variables, 0/320 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 10 (OVERLAPS) 1/428 variables, 1/321 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/428 variables, 0/321 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 12 (OVERLAPS) 0/428 variables, 0/321 constraints. Problems are: Problem set: 0 solved, 46 unsolved
No progress, stopping.
After SMT solving in domain Real declared 428/428 variables, and 321 constraints, problems are : Problem set: 0 solved, 46 unsolved in 1719 ms.
Refiners :[Domain max(s): 151/151 constraints, Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 151/151 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 46/46 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 46 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/46 variables, 46/46 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/46 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 2 (OVERLAPS) 49/95 variables, 10/56 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/95 variables, 49/105 constraints. Problems are: Problem set: 0 solved, 46 unsolved
[2024-05-23 14:50:11] [INFO ] Deduced a trap composed of 22 places in 74 ms of which 13 ms to minimize.
[2024-05-23 14:50:11] [INFO ] Deduced a trap composed of 40 places in 55 ms of which 1 ms to minimize.
[2024-05-23 14:50:11] [INFO ] Deduced a trap composed of 25 places in 43 ms of which 1 ms to minimize.
[2024-05-23 14:50:11] [INFO ] Deduced a trap composed of 39 places in 45 ms of which 1 ms to minimize.
[2024-05-23 14:50:11] [INFO ] Deduced a trap composed of 37 places in 52 ms of which 1 ms to minimize.
[2024-05-23 14:50:11] [INFO ] Deduced a trap composed of 39 places in 44 ms of which 1 ms to minimize.
[2024-05-23 14:50:11] [INFO ] Deduced a trap composed of 39 places in 41 ms of which 1 ms to minimize.
[2024-05-23 14:50:12] [INFO ] Deduced a trap composed of 39 places in 42 ms of which 1 ms to minimize.
[2024-05-23 14:50:12] [INFO ] Deduced a trap composed of 40 places in 44 ms of which 1 ms to minimize.
[2024-05-23 14:50:12] [INFO ] Deduced a trap composed of 38 places in 42 ms of which 1 ms to minimize.
[2024-05-23 14:50:12] [INFO ] Deduced a trap composed of 40 places in 40 ms of which 1 ms to minimize.
[2024-05-23 14:50:12] [INFO ] Deduced a trap composed of 40 places in 49 ms of which 1 ms to minimize.
[2024-05-23 14:50:12] [INFO ] Deduced a trap composed of 40 places in 44 ms of which 2 ms to minimize.
[2024-05-23 14:50:12] [INFO ] Deduced a trap composed of 41 places in 49 ms of which 1 ms to minimize.
[2024-05-23 14:50:12] [INFO ] Deduced a trap composed of 40 places in 54 ms of which 1 ms to minimize.
[2024-05-23 14:50:12] [INFO ] Deduced a trap composed of 39 places in 61 ms of which 5 ms to minimize.
[2024-05-23 14:50:12] [INFO ] Deduced a trap composed of 39 places in 39 ms of which 1 ms to minimize.
[2024-05-23 14:50:12] [INFO ] Deduced a trap composed of 41 places in 35 ms of which 1 ms to minimize.
[2024-05-23 14:50:12] [INFO ] Deduced a trap composed of 41 places in 42 ms of which 0 ms to minimize.
[2024-05-23 14:50:12] [INFO ] Deduced a trap composed of 40 places in 46 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, 46 unsolved
[2024-05-23 14:50:13] [INFO ] Deduced a trap composed of 40 places in 156 ms of which 0 ms to minimize.
[2024-05-23 14:50:13] [INFO ] Deduced a trap composed of 38 places in 49 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, 46 unsolved
[2024-05-23 14:50:13] [INFO ] Deduced a trap composed of 42 places in 61 ms of which 1 ms to minimize.
[2024-05-23 14:50:13] [INFO ] Deduced a trap composed of 40 places in 165 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, 46 unsolved
[2024-05-23 14:50:13] [INFO ] Deduced a trap composed of 40 places in 116 ms of which 1 ms to minimize.
[2024-05-23 14:50:13] [INFO ] Deduced a trap composed of 41 places in 65 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/95 variables, 2/131 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/95 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 9 (OVERLAPS) 56/151 variables, 8/139 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/151 variables, 56/195 constraints. Problems are: Problem set: 0 solved, 46 unsolved
[2024-05-23 14:50:14] [INFO ] Deduced a trap composed of 30 places in 108 ms of which 1 ms to minimize.
[2024-05-23 14:50:14] [INFO ] Deduced a trap composed of 41 places in 81 ms of which 1 ms to minimize.
[2024-05-23 14:50:14] [INFO ] Deduced a trap composed of 45 places in 75 ms of which 1 ms to minimize.
[2024-05-23 14:50:14] [INFO ] Deduced a trap composed of 37 places in 43 ms of which 1 ms to minimize.
[2024-05-23 14:50:14] [INFO ] Deduced a trap composed of 31 places in 55 ms of which 1 ms to minimize.
[2024-05-23 14:50:14] [INFO ] Deduced a trap composed of 40 places in 45 ms of which 1 ms to minimize.
[2024-05-23 14:50:14] [INFO ] Deduced a trap composed of 39 places in 51 ms of which 1 ms to minimize.
[2024-05-23 14:50:14] [INFO ] Deduced a trap composed of 31 places in 66 ms of which 2 ms to minimize.
[2024-05-23 14:50:14] [INFO ] Deduced a trap composed of 47 places in 54 ms of which 4 ms to minimize.
[2024-05-23 14:50:14] [INFO ] Deduced a trap composed of 51 places in 53 ms of which 2 ms to minimize.
[2024-05-23 14:50:14] [INFO ] Deduced a trap composed of 45 places in 47 ms of which 1 ms to minimize.
[2024-05-23 14:50:14] [INFO ] Deduced a trap composed of 45 places in 50 ms of which 0 ms to minimize.
[2024-05-23 14:50:14] [INFO ] Deduced a trap composed of 30 places in 55 ms of which 1 ms to minimize.
[2024-05-23 14:50:14] [INFO ] Deduced a trap composed of 40 places in 46 ms of which 2 ms to minimize.
[2024-05-23 14:50:14] [INFO ] Deduced a trap composed of 30 places in 46 ms of which 1 ms to minimize.
[2024-05-23 14:50:14] [INFO ] Deduced a trap composed of 40 places in 49 ms of which 1 ms to minimize.
[2024-05-23 14:50:15] [INFO ] Deduced a trap composed of 39 places in 42 ms of which 1 ms to minimize.
[2024-05-23 14:50:15] [INFO ] Deduced a trap composed of 39 places in 41 ms of which 1 ms to minimize.
[2024-05-23 14:50:15] [INFO ] Deduced a trap composed of 31 places in 39 ms of which 1 ms to minimize.
[2024-05-23 14:50:15] [INFO ] Deduced a trap composed of 44 places in 92 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/151 variables, 20/215 constraints. Problems are: Problem set: 0 solved, 46 unsolved
[2024-05-23 14:50:15] [INFO ] Deduced a trap composed of 44 places in 88 ms of which 1 ms to minimize.
[2024-05-23 14:50:15] [INFO ] Deduced a trap composed of 30 places in 39 ms of which 1 ms to minimize.
[2024-05-23 14:50:15] [INFO ] Deduced a trap composed of 30 places in 52 ms of which 1 ms to minimize.
[2024-05-23 14:50:15] [INFO ] Deduced a trap composed of 30 places in 34 ms of which 1 ms to minimize.
[2024-05-23 14:50:15] [INFO ] Deduced a trap composed of 30 places in 37 ms of which 1 ms to minimize.
[2024-05-23 14:50:15] [INFO ] Deduced a trap composed of 30 places in 45 ms of which 1 ms to minimize.
[2024-05-23 14:50:15] [INFO ] Deduced a trap composed of 30 places in 45 ms of which 1 ms to minimize.
[2024-05-23 14:50:15] [INFO ] Deduced a trap composed of 30 places in 35 ms of which 0 ms to minimize.
[2024-05-23 14:50:15] [INFO ] Deduced a trap composed of 30 places in 83 ms of which 1 ms to minimize.
[2024-05-23 14:50:15] [INFO ] Deduced a trap composed of 40 places in 52 ms of which 1 ms to minimize.
[2024-05-23 14:50:16] [INFO ] Deduced a trap composed of 43 places in 94 ms of which 4 ms to minimize.
[2024-05-23 14:50:16] [INFO ] Deduced a trap composed of 43 places in 77 ms of which 0 ms to minimize.
[2024-05-23 14:50:16] [INFO ] Deduced a trap composed of 43 places in 70 ms of which 2 ms to minimize.
[2024-05-23 14:50:17] [INFO ] Deduced a trap composed of 39 places in 1491 ms of which 32 ms to minimize.
SMT process timed out in 8092ms, After SMT, problems are : Problem set: 0 solved, 46 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 46 out of 151 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 151/151 places, 295/295 transitions.
Graph (complete) has 653 edges and 151 vertex of which 142 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 142 transition count 273
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 139 transition count 270
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 139 transition count 267
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 134 transition count 267
Discarding 44 places :
Symmetric choice reduction at 2 with 44 rule applications. Total rules 72 place count 90 transition count 179
Iterating global reduction 2 with 44 rules applied. Total rules applied 116 place count 90 transition count 179
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 120 place count 86 transition count 171
Iterating global reduction 2 with 4 rules applied. Total rules applied 124 place count 86 transition count 171
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 130 place count 86 transition count 165
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: -35
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 144 place count 79 transition count 200
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 3 with 4 rules applied. Total rules applied 148 place count 79 transition count 196
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 149 place count 79 transition count 195
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 150 place count 78 transition count 195
Applied a total of 150 rules in 59 ms. Remains 78 /151 variables (removed 73) and now considering 195/295 (removed 100) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 74 ms. Remains : 78/151 places, 195/295 transitions.
RANDOM walk for 4000000 steps (1216996 resets) in 31102 ms. (128 steps per ms) remains 38/46 properties
BEST_FIRST walk for 400003 steps (14667 resets) in 328 ms. (1215 steps per ms) remains 34/38 properties
BEST_FIRST walk for 400004 steps (14498 resets) in 323 ms. (1234 steps per ms) remains 34/34 properties
BEST_FIRST walk for 400004 steps (14581 resets) in 316 ms. (1261 steps per ms) remains 34/34 properties
BEST_FIRST walk for 400003 steps (14591 resets) in 316 ms. (1261 steps per ms) remains 34/34 properties
BEST_FIRST walk for 400003 steps (14586 resets) in 319 ms. (1250 steps per ms) remains 34/34 properties
BEST_FIRST walk for 400003 steps (14588 resets) in 310 ms. (1286 steps per ms) remains 34/34 properties
BEST_FIRST walk for 400003 steps (14598 resets) in 323 ms. (1234 steps per ms) remains 34/34 properties
BEST_FIRST walk for 400004 steps (14499 resets) in 312 ms. (1277 steps per ms) remains 34/34 properties
BEST_FIRST walk for 400004 steps (14611 resets) in 318 ms. (1253 steps per ms) remains 34/34 properties
BEST_FIRST walk for 400004 steps (14632 resets) in 321 ms. (1242 steps per ms) remains 34/34 properties
BEST_FIRST walk for 400004 steps (14553 resets) in 314 ms. (1269 steps per ms) remains 34/34 properties
BEST_FIRST walk for 400004 steps (14587 resets) in 320 ms. (1246 steps per ms) remains 34/34 properties
BEST_FIRST walk for 400003 steps (14561 resets) in 315 ms. (1265 steps per ms) remains 34/34 properties
BEST_FIRST walk for 400004 steps (14541 resets) in 317 ms. (1257 steps per ms) remains 34/34 properties
BEST_FIRST walk for 400004 steps (14468 resets) in 314 ms. (1269 steps per ms) remains 34/34 properties
BEST_FIRST walk for 400004 steps (14470 resets) in 311 ms. (1282 steps per ms) remains 34/34 properties
BEST_FIRST walk for 400003 steps (14545 resets) in 314 ms. (1269 steps per ms) remains 34/34 properties
BEST_FIRST walk for 400003 steps (14522 resets) in 331 ms. (1204 steps per ms) remains 34/34 properties
BEST_FIRST walk for 400004 steps (14523 resets) in 314 ms. (1269 steps per ms) remains 34/34 properties
BEST_FIRST walk for 400004 steps (14545 resets) in 313 ms. (1273 steps per ms) remains 34/34 properties
BEST_FIRST walk for 400004 steps (14556 resets) in 315 ms. (1265 steps per ms) remains 34/34 properties
BEST_FIRST walk for 400004 steps (14545 resets) in 312 ms. (1277 steps per ms) remains 34/34 properties
BEST_FIRST walk for 400004 steps (14434 resets) in 310 ms. (1286 steps per ms) remains 34/34 properties
BEST_FIRST walk for 400004 steps (14507 resets) in 318 ms. (1253 steps per ms) remains 34/34 properties
BEST_FIRST walk for 400004 steps (14477 resets) in 311 ms. (1282 steps per ms) remains 34/34 properties
BEST_FIRST walk for 400004 steps (14549 resets) in 304 ms. (1311 steps per ms) remains 34/34 properties
BEST_FIRST walk for 400003 steps (14522 resets) in 307 ms. (1298 steps per ms) remains 34/34 properties
BEST_FIRST walk for 400004 steps (14501 resets) in 303 ms. (1315 steps per ms) remains 34/34 properties
BEST_FIRST walk for 400003 steps (14569 resets) in 321 ms. (1242 steps per ms) remains 34/34 properties
BEST_FIRST walk for 400004 steps (14518 resets) in 309 ms. (1290 steps per ms) remains 34/34 properties
BEST_FIRST walk for 400004 steps (14528 resets) in 311 ms. (1282 steps per ms) remains 34/34 properties
BEST_FIRST walk for 400003 steps (14528 resets) in 352 ms. (1133 steps per ms) remains 34/34 properties
BEST_FIRST walk for 400004 steps (14528 resets) in 352 ms. (1133 steps per ms) remains 34/34 properties
BEST_FIRST walk for 400004 steps (14446 resets) in 310 ms. (1286 steps per ms) remains 34/34 properties
BEST_FIRST walk for 400003 steps (14547 resets) in 322 ms. (1238 steps per ms) remains 34/34 properties
[2024-05-23 14:50:33] [INFO ] Flow matrix only has 180 transitions (discarded 15 similar events)
// Phase 1: matrix 180 rows 78 cols
[2024-05-23 14:50:33] [INFO ] Computed 7 invariants in 2 ms
[2024-05-23 14:50:33] [INFO ] State equation strengthened by 14 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/34 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 1 (OVERLAPS) 8/42 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/42 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 3 (OVERLAPS) 36/78 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/78 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 5 (OVERLAPS) 180/258 variables, 78/85 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/258 variables, 14/99 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/258 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 8 (OVERLAPS) 0/258 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 34 unsolved
No progress, stopping.
After SMT solving in domain Real declared 258/258 variables, and 99 constraints, problems are : Problem set: 0 solved, 34 unsolved in 532 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 78/78 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 34/34 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 34 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/34 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 1 (OVERLAPS) 8/42 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/42 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 3 (OVERLAPS) 36/78 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/78 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 5 (OVERLAPS) 180/258 variables, 78/85 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/258 variables, 14/99 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/258 variables, 34/133 constraints. Problems are: Problem set: 0 solved, 34 unsolved
[2024-05-23 14:50:34] [INFO ] Deduced a trap composed of 33 places in 46 ms of which 2 ms to minimize.
[2024-05-23 14:50:34] [INFO ] Deduced a trap composed of 19 places in 41 ms of which 1 ms to minimize.
[2024-05-23 14:50:34] [INFO ] Deduced a trap composed of 35 places in 75 ms of which 0 ms to minimize.
[2024-05-23 14:50:35] [INFO ] Deduced a trap composed of 33 places in 40 ms of which 2 ms to minimize.
[2024-05-23 14:50:35] [INFO ] Deduced a trap composed of 33 places in 36 ms of which 0 ms to minimize.
[2024-05-23 14:50:35] [INFO ] Deduced a trap composed of 34 places in 37 ms of which 0 ms to minimize.
[2024-05-23 14:50:35] [INFO ] Deduced a trap composed of 34 places in 39 ms of which 1 ms to minimize.
[2024-05-23 14:50:35] [INFO ] Deduced a trap composed of 35 places in 35 ms of which 1 ms to minimize.
[2024-05-23 14:50:35] [INFO ] Deduced a trap composed of 34 places in 39 ms of which 0 ms to minimize.
[2024-05-23 14:50:35] [INFO ] Deduced a trap composed of 25 places in 43 ms of which 0 ms to minimize.
[2024-05-23 14:50:35] [INFO ] Deduced a trap composed of 26 places in 34 ms of which 1 ms to minimize.
[2024-05-23 14:50:35] [INFO ] Deduced a trap composed of 32 places in 37 ms of which 1 ms to minimize.
[2024-05-23 14:50:35] [INFO ] Deduced a trap composed of 32 places in 36 ms of which 1 ms to minimize.
[2024-05-23 14:50:35] [INFO ] Deduced a trap composed of 32 places in 38 ms of which 1 ms to minimize.
[2024-05-23 14:50:35] [INFO ] Deduced a trap composed of 25 places in 32 ms of which 1 ms to minimize.
[2024-05-23 14:50:35] [INFO ] Deduced a trap composed of 33 places in 43 ms of which 0 ms to minimize.
[2024-05-23 14:50:35] [INFO ] Deduced a trap composed of 26 places in 38 ms of which 1 ms to minimize.
[2024-05-23 14:50:35] [INFO ] Deduced a trap composed of 33 places in 42 ms of which 1 ms to minimize.
[2024-05-23 14:50:35] [INFO ] Deduced a trap composed of 34 places in 38 ms of which 1 ms to minimize.
[2024-05-23 14:50:35] [INFO ] Deduced a trap composed of 26 places in 38 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/258 variables, 20/153 constraints. Problems are: Problem set: 0 solved, 34 unsolved
[2024-05-23 14:50:35] [INFO ] Deduced a trap composed of 25 places in 44 ms of which 1 ms to minimize.
[2024-05-23 14:50:36] [INFO ] Deduced a trap composed of 32 places in 46 ms of which 0 ms to minimize.
[2024-05-23 14:50:36] [INFO ] Deduced a trap composed of 33 places in 48 ms of which 0 ms to minimize.
[2024-05-23 14:50:36] [INFO ] Deduced a trap composed of 18 places in 40 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/258 variables, 4/157 constraints. Problems are: Problem set: 0 solved, 34 unsolved
[2024-05-23 14:50:36] [INFO ] Deduced a trap composed of 34 places in 44 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/258 variables, 1/158 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/258 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 12 (OVERLAPS) 0/258 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 34 unsolved
No progress, stopping.
After SMT solving in domain Int declared 258/258 variables, and 158 constraints, problems are : Problem set: 0 solved, 34 unsolved in 2964 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 78/78 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 34/34 constraints, Known Traps: 25/25 constraints]
After SMT, in 3514ms problems are : Problem set: 0 solved, 34 unsolved
Fused 34 Parikh solutions to 20 different solutions.
Parikh walk visited 31 properties in 769 ms.
Support contains 3 out of 78 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 78/78 places, 195/195 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 3 rules applied. Total rules applied 3 place count 78 transition count 192
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 7 place count 75 transition count 191
Discarding 28 places :
Symmetric choice reduction at 2 with 28 rule applications. Total rules 35 place count 47 transition count 135
Iterating global reduction 2 with 28 rules applied. Total rules applied 63 place count 47 transition count 135
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 68 place count 42 transition count 125
Iterating global reduction 2 with 5 rules applied. Total rules applied 73 place count 42 transition count 125
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 76 place count 39 transition count 116
Iterating global reduction 2 with 3 rules applied. Total rules applied 79 place count 39 transition count 116
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 81 place count 37 transition count 110
Iterating global reduction 2 with 2 rules applied. Total rules applied 83 place count 37 transition count 110
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 2 with 12 rules applied. Total rules applied 95 place count 37 transition count 98
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -13
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 103 place count 33 transition count 111
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 104 place count 32 transition count 108
Iterating global reduction 3 with 1 rules applied. Total rules applied 105 place count 32 transition count 108
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 111 place count 32 transition count 102
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 112 place count 32 transition count 101
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 113 place count 31 transition count 97
Iterating global reduction 4 with 1 rules applied. Total rules applied 114 place count 31 transition count 97
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 120 place count 31 transition count 91
Partial Free-agglomeration rule applied 9 times.
Drop transitions (Partial Free agglomeration) removed 9 transitions
Iterating global reduction 5 with 9 rules applied. Total rules applied 129 place count 31 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 137 place count 31 transition count 91
Applied a total of 137 rules in 37 ms. Remains 31 /78 variables (removed 47) and now considering 91/195 (removed 104) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 37 ms. Remains : 31/78 places, 91/195 transitions.
RANDOM walk for 4000000 steps (1328218 resets) in 14657 ms. (272 steps per ms) remains 3/3 properties
BEST_FIRST walk for 4000004 steps (147330 resets) in 2997 ms. (1334 steps per ms) remains 3/3 properties
BEST_FIRST walk for 4000004 steps (147713 resets) in 1546 ms. (2585 steps per ms) remains 3/3 properties
BEST_FIRST walk for 4000004 steps (147672 resets) in 1659 ms. (2409 steps per ms) remains 3/3 properties
Finished probabilistic random walk after 2180 steps, run visited all 3 properties in 25 ms. (steps per millisecond=87 )
Probabilistic random walk after 2180 steps, saw 796 distinct states, run finished after 29 ms. (steps per millisecond=75 ) properties seen :3
Able to resolve query StableMarking after proving 128 properties.
FORMULA StableMarking FALSE TECHNIQUES RANDOM_WALK PARIKH_WALK PROBABILISTIC_WALK MARKED_SUFFIX_TEST TRIVIAL_UNMARKED_SCC_TEST BESTFIRST_WALK TOPOLOGICAL
Total runtime 37316 ms.
ITS solved all properties within timeout

BK_STOP 1716475845684

--------------------
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-09"
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-09, 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-171640616800478"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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