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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 516K
-rw-r--r-- 1 mcc users 6.4K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 68K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K 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 25K Apr 22 14:48 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K May 19 07:18 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 19 18:26 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Apr 12 20:31 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 125K Apr 12 20:31 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.2K Apr 12 20:29 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 82K Apr 12 20:29 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 69K 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 1716475848086

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-10
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-23 14:50:49] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, StableMarking, -timeout, 180, -rebuildPNML]
[2024-05-23 14:50:49] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-23 14:50:49] [INFO ] Load time of PNML (sax parser for PT used): 74 ms
[2024-05-23 14:50:49] [INFO ] Transformed 158 places.
[2024-05-23 14:50:49] [INFO ] Transformed 333 transitions.
[2024-05-23 14:50:49] [INFO ] Found NUPN structural information;
[2024-05-23 14:50:49] [INFO ] Parsed PT model containing 158 places and 333 transitions and 875 arcs in 173 ms.
Graph (trivial) has 270 edges and 158 vertex of which 10 / 158 are part of one of the 5 SCC in 4 ms
Free SCC test removed 5 places
Structural test allowed to assert that 32 places are NOT stable. Took 20 ms.
Ensure Unique test removed 32 transitions
Reduce redundant transitions removed 32 transitions.
RANDOM walk for 40000 steps (3102 resets) in 2007 ms. (19 steps per ms) remains 57/126 properties
BEST_FIRST walk for 4003 steps (32 resets) in 30 ms. (129 steps per ms) remains 56/57 properties
BEST_FIRST walk for 4003 steps (34 resets) in 23 ms. (166 steps per ms) remains 45/56 properties
BEST_FIRST walk for 4003 steps (34 resets) in 24 ms. (160 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4004 steps (35 resets) in 36 ms. (108 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4004 steps (35 resets) in 18 ms. (210 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4004 steps (31 resets) in 26 ms. (148 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4004 steps (35 resets) in 19 ms. (200 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4004 steps (36 resets) in 16 ms. (235 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4003 steps (37 resets) in 11 ms. (333 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4004 steps (35 resets) in 12 ms. (308 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4004 steps (35 resets) in 14 ms. (266 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4004 steps (32 resets) in 10 ms. (364 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4004 steps (36 resets) in 8 ms. (444 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4002 steps (36 resets) in 12 ms. (307 steps per ms) remains 44/45 properties
BEST_FIRST walk for 4004 steps (35 resets) in 21 ms. (182 steps per ms) remains 43/44 properties
BEST_FIRST walk for 4003 steps (33 resets) in 17 ms. (222 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4003 steps (37 resets) in 16 ms. (235 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4004 steps (34 resets) in 10 ms. (364 steps per ms) remains 42/43 properties
BEST_FIRST walk for 4003 steps (35 resets) in 12 ms. (307 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4003 steps (37 resets) in 11 ms. (333 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4004 steps (35 resets) in 12 ms. (308 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4003 steps (37 resets) in 12 ms. (307 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4004 steps (34 resets) in 19 ms. (200 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4004 steps (35 resets) in 11 ms. (333 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4004 steps (36 resets) in 9 ms. (400 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4003 steps (34 resets) in 9 ms. (400 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4003 steps (33 resets) in 12 ms. (307 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4003 steps (31 resets) in 10 ms. (363 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4004 steps (33 resets) in 12 ms. (308 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4004 steps (34 resets) in 11 ms. (333 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4004 steps (35 resets) in 11 ms. (333 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4003 steps (36 resets) in 11 ms. (333 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4004 steps (33 resets) in 8 ms. (444 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4004 steps (37 resets) in 15 ms. (250 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4002 steps (36 resets) in 15 ms. (250 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4004 steps (36 resets) in 13 ms. (286 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4004 steps (37 resets) in 12 ms. (308 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4004 steps (32 resets) in 21 ms. (182 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4004 steps (34 resets) in 13 ms. (286 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4003 steps (37 resets) in 15 ms. (250 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4003 steps (36 resets) in 16 ms. (235 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4004 steps (35 resets) in 16 ms. (235 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4002 steps (37 resets) in 8 ms. (444 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4004 steps (32 resets) in 13 ms. (286 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4004 steps (34 resets) in 14 ms. (266 steps per ms) remains 42/42 properties
[2024-05-23 14:50:50] [INFO ] Flow matrix only has 284 transitions (discarded 17 similar events)
// Phase 1: matrix 284 rows 153 cols
[2024-05-23 14:50:50] [INFO ] Computed 18 invariants in 14 ms
[2024-05-23 14:50:50] [INFO ] State equation strengthened by 1 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/42 variables, 42/42 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/42 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 2 (OVERLAPS) 54/96 variables, 10/52 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/96 variables, 54/106 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/96 variables, 0/106 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 5 (OVERLAPS) 57/153 variables, 8/114 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/153 variables, 57/171 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/153 variables, 0/171 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 8 (OVERLAPS) 283/436 variables, 153/324 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/436 variables, 0/324 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 10 (OVERLAPS) 1/437 variables, 1/325 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/437 variables, 0/325 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 12 (OVERLAPS) 0/437 variables, 0/325 constraints. Problems are: Problem set: 0 solved, 42 unsolved
No progress, stopping.
After SMT solving in domain Real declared 437/437 variables, and 325 constraints, problems are : Problem set: 0 solved, 42 unsolved in 1804 ms.
Refiners :[Domain max(s): 153/153 constraints, Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 153/153 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 42/42 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 42 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/42 variables, 42/42 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/42 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 2 (OVERLAPS) 54/96 variables, 10/52 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/96 variables, 54/106 constraints. Problems are: Problem set: 0 solved, 42 unsolved
[2024-05-23 14:50:52] [INFO ] Deduced a trap composed of 22 places in 73 ms of which 11 ms to minimize.
[2024-05-23 14:50:52] [INFO ] Deduced a trap composed of 39 places in 51 ms of which 2 ms to minimize.
[2024-05-23 14:50:52] [INFO ] Deduced a trap composed of 25 places in 35 ms of which 0 ms to minimize.
[2024-05-23 14:50:52] [INFO ] Deduced a trap composed of 38 places in 43 ms of which 1 ms to minimize.
[2024-05-23 14:50:52] [INFO ] Deduced a trap composed of 38 places in 44 ms of which 1 ms to minimize.
[2024-05-23 14:50:52] [INFO ] Deduced a trap composed of 40 places in 38 ms of which 1 ms to minimize.
[2024-05-23 14:50:53] [INFO ] Deduced a trap composed of 38 places in 38 ms of which 1 ms to minimize.
[2024-05-23 14:50:53] [INFO ] Deduced a trap composed of 40 places in 45 ms of which 1 ms to minimize.
[2024-05-23 14:50:53] [INFO ] Deduced a trap composed of 40 places in 37 ms of which 1 ms to minimize.
[2024-05-23 14:50:53] [INFO ] Deduced a trap composed of 40 places in 38 ms of which 1 ms to minimize.
[2024-05-23 14:50:53] [INFO ] Deduced a trap composed of 40 places in 38 ms of which 0 ms to minimize.
[2024-05-23 14:50:53] [INFO ] Deduced a trap composed of 41 places in 35 ms of which 0 ms to minimize.
[2024-05-23 14:50:53] [INFO ] Deduced a trap composed of 39 places in 41 ms of which 1 ms to minimize.
[2024-05-23 14:50:53] [INFO ] Deduced a trap composed of 40 places in 38 ms of which 1 ms to minimize.
[2024-05-23 14:50:53] [INFO ] Deduced a trap composed of 41 places in 29 ms of which 1 ms to minimize.
[2024-05-23 14:50:53] [INFO ] Deduced a trap composed of 40 places in 38 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/96 variables, 16/122 constraints. Problems are: Problem set: 0 solved, 42 unsolved
[2024-05-23 14:50:53] [INFO ] Deduced a trap composed of 39 places in 39 ms of which 1 ms to minimize.
[2024-05-23 14:50:53] [INFO ] Deduced a trap composed of 40 places in 37 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/96 variables, 2/124 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/96 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 7 (OVERLAPS) 57/153 variables, 8/132 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/153 variables, 57/189 constraints. Problems are: Problem set: 0 solved, 42 unsolved
[2024-05-23 14:50:53] [INFO ] Deduced a trap composed of 56 places in 53 ms of which 2 ms to minimize.
[2024-05-23 14:50:53] [INFO ] Deduced a trap composed of 29 places in 54 ms of which 1 ms to minimize.
[2024-05-23 14:50:53] [INFO ] Deduced a trap composed of 39 places in 54 ms of which 1 ms to minimize.
[2024-05-23 14:50:53] [INFO ] Deduced a trap composed of 30 places in 32 ms of which 1 ms to minimize.
[2024-05-23 14:50:54] [INFO ] Deduced a trap composed of 50 places in 54 ms of which 1 ms to minimize.
[2024-05-23 14:50:54] [INFO ] Deduced a trap composed of 47 places in 52 ms of which 1 ms to minimize.
[2024-05-23 14:50:54] [INFO ] Deduced a trap composed of 48 places in 50 ms of which 1 ms to minimize.
[2024-05-23 14:50:54] [INFO ] Deduced a trap composed of 39 places in 50 ms of which 1 ms to minimize.
[2024-05-23 14:50:54] [INFO ] Deduced a trap composed of 29 places in 33 ms of which 1 ms to minimize.
[2024-05-23 14:50:54] [INFO ] Deduced a trap composed of 44 places in 50 ms of which 1 ms to minimize.
[2024-05-23 14:50:54] [INFO ] Deduced a trap composed of 38 places in 49 ms of which 1 ms to minimize.
[2024-05-23 14:50:54] [INFO ] Deduced a trap composed of 39 places in 51 ms of which 1 ms to minimize.
[2024-05-23 14:50:54] [INFO ] Deduced a trap composed of 39 places in 47 ms of which 1 ms to minimize.
[2024-05-23 14:50:54] [INFO ] Deduced a trap composed of 41 places in 45 ms of which 1 ms to minimize.
[2024-05-23 14:50:54] [INFO ] Deduced a trap composed of 29 places in 41 ms of which 1 ms to minimize.
[2024-05-23 14:50:54] [INFO ] Deduced a trap composed of 39 places in 42 ms of which 1 ms to minimize.
[2024-05-23 14:50:54] [INFO ] Deduced a trap composed of 29 places in 46 ms of which 4 ms to minimize.
[2024-05-23 14:50:54] [INFO ] Deduced a trap composed of 51 places in 51 ms of which 1 ms to minimize.
[2024-05-23 14:50:54] [INFO ] Deduced a trap composed of 29 places in 48 ms of which 1 ms to minimize.
[2024-05-23 14:50:54] [INFO ] Deduced a trap composed of 40 places in 64 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/153 variables, 20/209 constraints. Problems are: Problem set: 0 solved, 42 unsolved
[2024-05-23 14:50:54] [INFO ] Deduced a trap composed of 41 places in 54 ms of which 1 ms to minimize.
[2024-05-23 14:50:55] [INFO ] Deduced a trap composed of 40 places in 54 ms of which 2 ms to minimize.
[2024-05-23 14:50:55] [INFO ] Deduced a trap composed of 40 places in 39 ms of which 1 ms to minimize.
[2024-05-23 14:50:55] [INFO ] Deduced a trap composed of 29 places in 29 ms of which 0 ms to minimize.
[2024-05-23 14:50:55] [INFO ] Deduced a trap composed of 29 places in 46 ms of which 1 ms to minimize.
[2024-05-23 14:50:55] [INFO ] Deduced a trap composed of 39 places in 54 ms of which 1 ms to minimize.
[2024-05-23 14:50:55] [INFO ] Deduced a trap composed of 29 places in 41 ms of which 1 ms to minimize.
[2024-05-23 14:50:55] [INFO ] Deduced a trap composed of 39 places in 36 ms of which 0 ms to minimize.
[2024-05-23 14:50:55] [INFO ] Deduced a trap composed of 30 places in 29 ms of which 1 ms to minimize.
[2024-05-23 14:50:55] [INFO ] Deduced a trap composed of 30 places in 30 ms of which 0 ms to minimize.
[2024-05-23 14:50:55] [INFO ] Deduced a trap composed of 30 places in 35 ms of which 1 ms to minimize.
[2024-05-23 14:50:55] [INFO ] Deduced a trap composed of 29 places in 35 ms of which 1 ms to minimize.
[2024-05-23 14:50:55] [INFO ] Deduced a trap composed of 30 places in 29 ms of which 1 ms to minimize.
[2024-05-23 14:50:55] [INFO ] Deduced a trap composed of 30 places in 38 ms of which 1 ms to minimize.
[2024-05-23 14:50:55] [INFO ] Deduced a trap composed of 30 places in 36 ms of which 0 ms to minimize.
[2024-05-23 14:50:55] [INFO ] Deduced a trap composed of 30 places in 42 ms of which 1 ms to minimize.
[2024-05-23 14:50:55] [INFO ] Deduced a trap composed of 29 places in 34 ms of which 1 ms to minimize.
[2024-05-23 14:50:55] [INFO ] Deduced a trap composed of 30 places in 37 ms of which 0 ms to minimize.
[2024-05-23 14:50:55] [INFO ] Deduced a trap composed of 30 places in 35 ms of which 1 ms to minimize.
[2024-05-23 14:50:55] [INFO ] Deduced a trap composed of 39 places in 46 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/153 variables, 20/229 constraints. Problems are: Problem set: 0 solved, 42 unsolved
[2024-05-23 14:50:55] [INFO ] Deduced a trap composed of 29 places in 55 ms of which 1 ms to minimize.
[2024-05-23 14:50:56] [INFO ] Deduced a trap composed of 39 places in 46 ms of which 1 ms to minimize.
[2024-05-23 14:50:56] [INFO ] Deduced a trap composed of 40 places in 44 ms of which 1 ms to minimize.
[2024-05-23 14:50:56] [INFO ] Deduced a trap composed of 29 places in 32 ms of which 0 ms to minimize.
[2024-05-23 14:50:56] [INFO ] Deduced a trap composed of 29 places in 39 ms of which 1 ms to minimize.
[2024-05-23 14:50:56] [INFO ] Deduced a trap composed of 38 places in 46 ms of which 1 ms to minimize.
[2024-05-23 14:50:56] [INFO ] Deduced a trap composed of 40 places in 39 ms of which 1 ms to minimize.
[2024-05-23 14:50:56] [INFO ] Deduced a trap composed of 41 places in 42 ms of which 1 ms to minimize.
[2024-05-23 14:50:56] [INFO ] Deduced a trap composed of 38 places in 44 ms of which 1 ms to minimize.
[2024-05-23 14:50:56] [INFO ] Deduced a trap composed of 40 places in 69 ms of which 1 ms to minimize.
[2024-05-23 14:50:56] [INFO ] Deduced a trap composed of 52 places in 55 ms of which 1 ms to minimize.
[2024-05-23 14:50:56] [INFO ] Deduced a trap composed of 44 places in 61 ms of which 1 ms to minimize.
[2024-05-23 14:50:56] [INFO ] Deduced a trap composed of 46 places in 57 ms of which 1 ms to minimize.
[2024-05-23 14:50:56] [INFO ] Deduced a trap composed of 39 places in 46 ms of which 0 ms to minimize.
[2024-05-23 14:50:56] [INFO ] Deduced a trap composed of 38 places in 50 ms of which 1 ms to minimize.
[2024-05-23 14:50:56] [INFO ] Deduced a trap composed of 39 places in 48 ms of which 1 ms to minimize.
[2024-05-23 14:50:56] [INFO ] Deduced a trap composed of 40 places in 44 ms of which 1 ms to minimize.
[2024-05-23 14:50:56] [INFO ] Deduced a trap composed of 40 places in 38 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/153 variables, 18/247 constraints. Problems are: Problem set: 0 solved, 42 unsolved
[2024-05-23 14:50:57] [INFO ] Deduced a trap composed of 38 places in 44 ms of which 1 ms to minimize.
[2024-05-23 14:50:57] [INFO ] Deduced a trap composed of 39 places in 47 ms of which 1 ms to minimize.
[2024-05-23 14:50:57] [INFO ] Deduced a trap composed of 42 places in 43 ms of which 1 ms to minimize.
[2024-05-23 14:50:57] [INFO ] Deduced a trap composed of 44 places in 54 ms of which 1 ms to minimize.
[2024-05-23 14:50:57] [INFO ] Deduced a trap composed of 43 places in 48 ms of which 1 ms to minimize.
[2024-05-23 14:50:57] [INFO ] Deduced a trap composed of 46 places in 57 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 153/437 variables, and 253 constraints, problems are : Problem set: 0 solved, 42 unsolved in 5007 ms.
Refiners :[Domain max(s): 153/153 constraints, Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 0/153 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/42 constraints, Known Traps: 82/82 constraints]
After SMT, in 6886ms problems are : Problem set: 0 solved, 42 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 42 out of 153 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 153/153 places, 301/301 transitions.
Graph (complete) has 664 edges and 153 vertex of which 144 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 9 transitions
Reduce isomorphic transitions removed 9 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 12 rules applied. Total rules applied 13 place count 144 transition count 280
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
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 1 with 7 rules applied. Total rules applied 20 place count 141 transition count 276
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 21 place count 140 transition count 276
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 21 place count 140 transition count 274
Deduced a syphon composed of 2 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 5 rules applied. Total rules applied 26 place count 137 transition count 274
Discarding 49 places :
Symmetric choice reduction at 3 with 49 rule applications. Total rules 75 place count 88 transition count 176
Iterating global reduction 3 with 49 rules applied. Total rules applied 124 place count 88 transition count 176
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 129 place count 83 transition count 166
Iterating global reduction 3 with 5 rules applied. Total rules applied 134 place count 83 transition count 166
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 3 with 7 rules applied. Total rules applied 141 place count 83 transition count 159
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: -29
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 4 with 12 rules applied. Total rules applied 153 place count 77 transition count 188
Drop transitions (Redundant composition of simpler transitions.) removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 4 with 7 rules applied. Total rules applied 160 place count 77 transition count 181
Partial Free-agglomeration rule applied 15 times.
Drop transitions (Partial Free agglomeration) removed 15 transitions
Iterating global reduction 4 with 15 rules applied. Total rules applied 175 place count 77 transition count 181
Applied a total of 175 rules in 57 ms. Remains 77 /153 variables (removed 76) and now considering 181/301 (removed 120) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 66 ms. Remains : 77/153 places, 181/301 transitions.
RANDOM walk for 4000000 steps (251753 resets) in 12817 ms. (312 steps per ms) remains 3/42 properties
BEST_FIRST walk for 4000004 steps (46963 resets) in 2194 ms. (1822 steps per ms) remains 3/3 properties
BEST_FIRST walk for 4000003 steps (47150 resets) in 2204 ms. (1814 steps per ms) remains 3/3 properties
BEST_FIRST walk for 4000004 steps (47294 resets) in 2166 ms. (1845 steps per ms) remains 3/3 properties
[2024-05-23 14:51:02] [INFO ] Flow matrix only has 166 transitions (discarded 15 similar events)
// Phase 1: matrix 166 rows 77 cols
[2024-05-23 14:51:02] [INFO ] Computed 8 invariants in 2 ms
[2024-05-23 14:51:02] [INFO ] State equation strengthened by 7 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 11/14 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/14 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 63/77 variables, 7/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/77 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 166/243 variables, 77/85 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/243 variables, 7/92 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/243 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 0/243 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 243/243 variables, and 92 constraints, problems are : Problem set: 0 solved, 3 unsolved in 82 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 77/77 constraints, ReadFeed: 7/7 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 11/14 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/14 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 63/77 variables, 7/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/77 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 166/243 variables, 77/85 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/243 variables, 7/92 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/243 variables, 3/95 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/243 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 0/243 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 243/243 variables, and 95 constraints, problems are : Problem set: 0 solved, 3 unsolved in 121 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 77/77 constraints, ReadFeed: 7/7 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 220ms problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 2 different solutions.
Finished Parikh walk after 1223 steps, including 126 resets, run visited all 3 properties in 6 ms. (steps per millisecond=203 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 3 properties in 13 ms.
Able to resolve query StableMarking after proving 128 properties.
FORMULA StableMarking FALSE TECHNIQUES RANDOM_WALK PARIKH_WALK MARKED_SUFFIX_TEST TRIVIAL_UNMARKED_SCC_TEST BESTFIRST_WALK TOPOLOGICAL
Total runtime 13950 ms.
ITS solved all properties within timeout

BK_STOP 1716475863214

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

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