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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 492K
-rw-r--r-- 1 mcc users 6.6K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 72K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K 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.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.1K May 19 07:18 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 19 18:26 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Apr 12 20:33 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 118K Apr 12 20:33 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.1K Apr 12 20:30 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 59K Apr 12 20: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 73K 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 1716476050129

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-15
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-23 14:54:11] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, StableMarking, -timeout, 180, -rebuildPNML]
[2024-05-23 14:54:11] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-23 14:54:11] [INFO ] Load time of PNML (sax parser for PT used): 72 ms
[2024-05-23 14:54:11] [INFO ] Transformed 163 places.
[2024-05-23 14:54:11] [INFO ] Transformed 348 transitions.
[2024-05-23 14:54:11] [INFO ] Found NUPN structural information;
[2024-05-23 14:54:11] [INFO ] Parsed PT model containing 163 places and 348 transitions and 919 arcs in 182 ms.
Graph (trivial) has 278 edges and 163 vertex of which 6 / 163 are part of one of the 3 SCC in 3 ms
Free SCC test removed 3 places
Structural test allowed to assert that 28 places are NOT stable. Took 19 ms.
Ensure Unique test removed 32 transitions
Reduce redundant transitions removed 32 transitions.
RANDOM walk for 40000 steps (3687 resets) in 1923 ms. (20 steps per ms) remains 63/135 properties
BEST_FIRST walk for 4004 steps (48 resets) in 28 ms. (138 steps per ms) remains 63/63 properties
BEST_FIRST walk for 4004 steps (49 resets) in 14 ms. (266 steps per ms) remains 63/63 properties
BEST_FIRST walk for 4003 steps (46 resets) in 23 ms. (166 steps per ms) remains 63/63 properties
BEST_FIRST walk for 4004 steps (45 resets) in 18 ms. (210 steps per ms) remains 63/63 properties
BEST_FIRST walk for 4004 steps (48 resets) in 12 ms. (308 steps per ms) remains 63/63 properties
BEST_FIRST walk for 4002 steps (46 resets) in 27 ms. (142 steps per ms) remains 63/63 properties
BEST_FIRST walk for 4003 steps (46 resets) in 12 ms. (307 steps per ms) remains 63/63 properties
BEST_FIRST walk for 4003 steps (47 resets) in 22 ms. (174 steps per ms) remains 62/63 properties
BEST_FIRST walk for 4003 steps (45 resets) in 24 ms. (160 steps per ms) remains 61/62 properties
BEST_FIRST walk for 4004 steps (49 resets) in 33 ms. (117 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4003 steps (46 resets) in 19 ms. (200 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4004 steps (43 resets) in 13 ms. (286 steps per ms) remains 60/61 properties
BEST_FIRST walk for 4004 steps (44 resets) in 10 ms. (364 steps per ms) remains 59/60 properties
BEST_FIRST walk for 4004 steps (44 resets) in 17 ms. (222 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4004 steps (44 resets) in 15 ms. (250 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4003 steps (47 resets) in 10 ms. (363 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4004 steps (44 resets) in 16 ms. (235 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4003 steps (44 resets) in 23 ms. (166 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4003 steps (49 resets) in 10 ms. (363 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4003 steps (48 resets) in 17 ms. (222 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4003 steps (44 resets) in 15 ms. (250 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4004 steps (47 resets) in 9 ms. (400 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4003 steps (47 resets) in 19 ms. (200 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4002 steps (42 resets) in 13 ms. (285 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4004 steps (49 resets) in 16 ms. (235 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4003 steps (45 resets) in 12 ms. (307 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4002 steps (49 resets) in 10 ms. (363 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4003 steps (43 resets) in 11 ms. (333 steps per ms) remains 58/59 properties
BEST_FIRST walk for 4003 steps (50 resets) in 11 ms. (333 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4004 steps (44 resets) in 14 ms. (266 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4003 steps (48 resets) in 12 ms. (307 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4003 steps (48 resets) in 13 ms. (285 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4002 steps (45 resets) in 12 ms. (307 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4004 steps (47 resets) in 14 ms. (266 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4004 steps (47 resets) in 11 ms. (333 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4004 steps (44 resets) in 8 ms. (444 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4004 steps (46 resets) in 10 ms. (364 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4003 steps (48 resets) in 16 ms. (235 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4004 steps (45 resets) in 11 ms. (333 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4003 steps (46 resets) in 12 ms. (307 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4004 steps (46 resets) in 10 ms. (364 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4002 steps (46 resets) in 10 ms. (363 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4004 steps (49 resets) in 16 ms. (235 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4004 steps (48 resets) in 18 ms. (210 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4004 steps (50 resets) in 10 ms. (364 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4003 steps (47 resets) in 10 ms. (363 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4004 steps (45 resets) in 11 ms. (333 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4003 steps (47 resets) in 15 ms. (250 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4003 steps (46 resets) in 12 ms. (307 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4004 steps (48 resets) in 9 ms. (400 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4004 steps (45 resets) in 10 ms. (364 steps per ms) remains 57/58 properties
BEST_FIRST walk for 4003 steps (42 resets) in 9 ms. (400 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4004 steps (43 resets) in 10 ms. (364 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4003 steps (46 resets) in 12 ms. (307 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4003 steps (49 resets) in 11 ms. (333 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4004 steps (48 resets) in 13 ms. (286 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4004 steps (50 resets) in 14 ms. (266 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4004 steps (48 resets) in 10 ms. (364 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4003 steps (49 resets) in 11 ms. (333 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4004 steps (43 resets) in 11 ms. (333 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4004 steps (50 resets) in 12 ms. (308 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4002 steps (40 resets) in 9 ms. (400 steps per ms) remains 55/57 properties
BEST_FIRST walk for 4003 steps (44 resets) in 10 ms. (363 steps per ms) remains 55/55 properties
[2024-05-23 14:54:12] [INFO ] Flow matrix only has 301 transitions (discarded 15 similar events)
// Phase 1: matrix 301 rows 160 cols
[2024-05-23 14:54:12] [INFO ] Computed 18 invariants in 17 ms
[2024-05-23 14:54:12] [INFO ] State equation strengthened by 1 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/55 variables, 55/55 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/55 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 2 (OVERLAPS) 41/96 variables, 10/65 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/96 variables, 41/106 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/96 variables, 0/106 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 5 (OVERLAPS) 64/160 variables, 8/114 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/160 variables, 64/178 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/160 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 8 (OVERLAPS) 300/460 variables, 160/338 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/460 variables, 0/338 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 10 (OVERLAPS) 1/461 variables, 1/339 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/461 variables, 0/339 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 12 (OVERLAPS) 0/461 variables, 0/339 constraints. Problems are: Problem set: 0 solved, 55 unsolved
No progress, stopping.
After SMT solving in domain Real declared 461/461 variables, and 339 constraints, problems are : Problem set: 0 solved, 55 unsolved in 2167 ms.
Refiners :[Domain max(s): 160/160 constraints, Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 160/160 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 55/55 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 55 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/55 variables, 55/55 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/55 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 2 (OVERLAPS) 41/96 variables, 10/65 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/96 variables, 41/106 constraints. Problems are: Problem set: 0 solved, 55 unsolved
[2024-05-23 14:54:15] [INFO ] Deduced a trap composed of 25 places in 73 ms of which 20 ms to minimize.
[2024-05-23 14:54:15] [INFO ] Deduced a trap composed of 44 places in 46 ms of which 2 ms to minimize.
[2024-05-23 14:54:15] [INFO ] Deduced a trap composed of 44 places in 39 ms of which 1 ms to minimize.
[2024-05-23 14:54:15] [INFO ] Deduced a trap composed of 44 places in 39 ms of which 1 ms to minimize.
[2024-05-23 14:54:15] [INFO ] Deduced a trap composed of 41 places in 73 ms of which 1 ms to minimize.
[2024-05-23 14:54:15] [INFO ] Deduced a trap composed of 22 places in 31 ms of which 1 ms to minimize.
[2024-05-23 14:54:15] [INFO ] Deduced a trap composed of 38 places in 43 ms of which 1 ms to minimize.
[2024-05-23 14:54:15] [INFO ] Deduced a trap composed of 38 places in 45 ms of which 1 ms to minimize.
[2024-05-23 14:54:15] [INFO ] Deduced a trap composed of 41 places in 44 ms of which 1 ms to minimize.
[2024-05-23 14:54:15] [INFO ] Deduced a trap composed of 41 places in 45 ms of which 1 ms to minimize.
[2024-05-23 14:54:15] [INFO ] Deduced a trap composed of 40 places in 41 ms of which 1 ms to minimize.
[2024-05-23 14:54:15] [INFO ] Deduced a trap composed of 42 places in 41 ms of which 0 ms to minimize.
[2024-05-23 14:54:15] [INFO ] Deduced a trap composed of 41 places in 35 ms of which 1 ms to minimize.
[2024-05-23 14:54:15] [INFO ] Deduced a trap composed of 39 places in 47 ms of which 1 ms to minimize.
[2024-05-23 14:54:15] [INFO ] Deduced a trap composed of 40 places in 39 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/96 variables, 15/121 constraints. Problems are: Problem set: 0 solved, 55 unsolved
[2024-05-23 14:54:16] [INFO ] Deduced a trap composed of 40 places in 50 ms of which 1 ms to minimize.
[2024-05-23 14:54:16] [INFO ] Deduced a trap composed of 40 places in 39 ms of which 0 ms to minimize.
[2024-05-23 14:54:16] [INFO ] Deduced a trap composed of 41 places in 45 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/96 variables, 3/124 constraints. Problems are: Problem set: 0 solved, 55 unsolved
[2024-05-23 14:54:16] [INFO ] Deduced a trap composed of 41 places in 44 ms of which 1 ms to minimize.
[2024-05-23 14:54:16] [INFO ] Deduced a trap composed of 40 places in 39 ms of which 1 ms to minimize.
[2024-05-23 14:54:16] [INFO ] Deduced a trap composed of 39 places in 42 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/96 variables, 3/127 constraints. Problems are: Problem set: 0 solved, 55 unsolved
[2024-05-23 14:54:16] [INFO ] Deduced a trap composed of 40 places in 48 ms of which 1 ms to minimize.
[2024-05-23 14:54:16] [INFO ] Deduced a trap composed of 41 places in 42 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/96 variables, 2/129 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/96 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 9 (OVERLAPS) 64/160 variables, 8/137 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/160 variables, 64/201 constraints. Problems are: Problem set: 0 solved, 55 unsolved
[2024-05-23 14:54:17] [INFO ] Deduced a trap composed of 32 places in 60 ms of which 1 ms to minimize.
[2024-05-23 14:54:17] [INFO ] Deduced a trap composed of 41 places in 59 ms of which 1 ms to minimize.
[2024-05-23 14:54:17] [INFO ] Deduced a trap composed of 46 places in 61 ms of which 1 ms to minimize.
[2024-05-23 14:54:17] [INFO ] Deduced a trap composed of 40 places in 53 ms of which 1 ms to minimize.
[2024-05-23 14:54:17] [INFO ] Deduced a trap composed of 40 places in 51 ms of which 1 ms to minimize.
[2024-05-23 14:54:17] [INFO ] Deduced a trap composed of 30 places in 39 ms of which 1 ms to minimize.
[2024-05-23 14:54:17] [INFO ] Deduced a trap composed of 30 places in 34 ms of which 1 ms to minimize.
[2024-05-23 14:54:17] [INFO ] Deduced a trap composed of 39 places in 53 ms of which 1 ms to minimize.
[2024-05-23 14:54:17] [INFO ] Deduced a trap composed of 30 places in 65 ms of which 1 ms to minimize.
[2024-05-23 14:54:17] [INFO ] Deduced a trap composed of 39 places in 49 ms of which 1 ms to minimize.
[2024-05-23 14:54:17] [INFO ] Deduced a trap composed of 41 places in 50 ms of which 2 ms to minimize.
[2024-05-23 14:54:17] [INFO ] Deduced a trap composed of 15 places in 94 ms of which 5 ms to minimize.
[2024-05-23 14:54:17] [INFO ] Deduced a trap composed of 30 places in 54 ms of which 1 ms to minimize.
[2024-05-23 14:54:17] [INFO ] Deduced a trap composed of 31 places in 51 ms of which 1 ms to minimize.
[2024-05-23 14:54:17] [INFO ] Deduced a trap composed of 26 places in 48 ms of which 1 ms to minimize.
[2024-05-23 14:54:17] [INFO ] Deduced a trap composed of 30 places in 47 ms of which 1 ms to minimize.
[2024-05-23 14:54:17] [INFO ] Deduced a trap composed of 39 places in 50 ms of which 2 ms to minimize.
[2024-05-23 14:54:18] [INFO ] Deduced a trap composed of 39 places in 47 ms of which 1 ms to minimize.
[2024-05-23 14:54:18] [INFO ] Deduced a trap composed of 45 places in 87 ms of which 1 ms to minimize.
[2024-05-23 14:54:18] [INFO ] Deduced a trap composed of 45 places in 64 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/160 variables, 20/221 constraints. Problems are: Problem set: 0 solved, 55 unsolved
[2024-05-23 14:54:18] [INFO ] Deduced a trap composed of 39 places in 52 ms of which 4 ms to minimize.
[2024-05-23 14:54:18] [INFO ] Deduced a trap composed of 41 places in 49 ms of which 1 ms to minimize.
[2024-05-23 14:54:18] [INFO ] Deduced a trap composed of 38 places in 49 ms of which 1 ms to minimize.
[2024-05-23 14:54:18] [INFO ] Deduced a trap composed of 44 places in 52 ms of which 1 ms to minimize.
[2024-05-23 14:54:18] [INFO ] Deduced a trap composed of 39 places in 45 ms of which 1 ms to minimize.
[2024-05-23 14:54:18] [INFO ] Deduced a trap composed of 41 places in 49 ms of which 1 ms to minimize.
[2024-05-23 14:54:18] [INFO ] Deduced a trap composed of 44 places in 53 ms of which 2 ms to minimize.
[2024-05-23 14:54:18] [INFO ] Deduced a trap composed of 39 places in 51 ms of which 1 ms to minimize.
[2024-05-23 14:54:18] [INFO ] Deduced a trap composed of 40 places in 45 ms of which 1 ms to minimize.
[2024-05-23 14:54:18] [INFO ] Deduced a trap composed of 39 places in 46 ms of which 1 ms to minimize.
[2024-05-23 14:54:18] [INFO ] Deduced a trap composed of 41 places in 46 ms of which 1 ms to minimize.
[2024-05-23 14:54:18] [INFO ] Deduced a trap composed of 39 places in 47 ms of which 1 ms to minimize.
[2024-05-23 14:54:18] [INFO ] Deduced a trap composed of 48 places in 54 ms of which 9 ms to minimize.
[2024-05-23 14:54:19] [INFO ] Deduced a trap composed of 32 places in 52 ms of which 1 ms to minimize.
[2024-05-23 14:54:19] [INFO ] Deduced a trap composed of 30 places in 57 ms of which 1 ms to minimize.
[2024-05-23 14:54:19] [INFO ] Deduced a trap composed of 30 places in 61 ms of which 1 ms to minimize.
[2024-05-23 14:54:19] [INFO ] Deduced a trap composed of 30 places in 62 ms of which 1 ms to minimize.
[2024-05-23 14:54:19] [INFO ] Deduced a trap composed of 30 places in 61 ms of which 1 ms to minimize.
[2024-05-23 14:54:19] [INFO ] Deduced a trap composed of 50 places in 79 ms of which 1 ms to minimize.
[2024-05-23 14:54:19] [INFO ] Deduced a trap composed of 43 places in 61 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/160 variables, 20/241 constraints. Problems are: Problem set: 0 solved, 55 unsolved
[2024-05-23 14:54:19] [INFO ] Deduced a trap composed of 45 places in 67 ms of which 2 ms to minimize.
[2024-05-23 14:54:19] [INFO ] Deduced a trap composed of 31 places in 63 ms of which 1 ms to minimize.
[2024-05-23 14:54:19] [INFO ] Deduced a trap composed of 30 places in 47 ms of which 1 ms to minimize.
[2024-05-23 14:54:19] [INFO ] Deduced a trap composed of 30 places in 46 ms of which 1 ms to minimize.
[2024-05-23 14:54:19] [INFO ] Deduced a trap composed of 40 places in 52 ms of which 1 ms to minimize.
[2024-05-23 14:54:19] [INFO ] Deduced a trap composed of 41 places in 48 ms of which 1 ms to minimize.
SMT process timed out in 7255ms, After SMT, problems are : Problem set: 0 solved, 55 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 55 out of 160 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 160/160 places, 316/316 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 0 with 16 rules applied. Total rules applied 16 place count 160 transition count 300
Discarding 54 places :
Symmetric choice reduction at 1 with 54 rule applications. Total rules 70 place count 106 transition count 192
Iterating global reduction 1 with 54 rules applied. Total rules applied 124 place count 106 transition count 192
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 129 place count 101 transition count 182
Iterating global reduction 1 with 5 rules applied. Total rules applied 134 place count 101 transition count 182
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 142 place count 101 transition count 174
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: -30
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 156 place count 94 transition count 204
Drop transitions (Redundant composition of simpler transitions.) removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 2 with 5 rules applied. Total rules applied 161 place count 94 transition count 199
Free-agglomeration rule applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 163 place count 94 transition count 197
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 165 place count 92 transition count 197
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 166 place count 92 transition count 197
Applied a total of 166 rules in 54 ms. Remains 92 /160 variables (removed 68) and now considering 197/316 (removed 119) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 63 ms. Remains : 92/160 places, 197/316 transitions.
RANDOM walk for 4000000 steps (726779 resets) in 23557 ms. (169 steps per ms) remains 34/55 properties
BEST_FIRST walk for 400003 steps (11048 resets) in 526 ms. (759 steps per ms) remains 34/34 properties
BEST_FIRST walk for 400004 steps (11107 resets) in 404 ms. (987 steps per ms) remains 34/34 properties
BEST_FIRST walk for 400003 steps (11030 resets) in 588 ms. (679 steps per ms) remains 34/34 properties
BEST_FIRST walk for 400004 steps (10948 resets) in 476 ms. (838 steps per ms) remains 34/34 properties
BEST_FIRST walk for 400003 steps (11066 resets) in 562 ms. (710 steps per ms) remains 34/34 properties
BEST_FIRST walk for 400003 steps (11001 resets) in 664 ms. (601 steps per ms) remains 34/34 properties
BEST_FIRST walk for 400003 steps (11097 resets) in 814 ms. (490 steps per ms) remains 34/34 properties
BEST_FIRST walk for 400002 steps (10934 resets) in 774 ms. (516 steps per ms) remains 34/34 properties
BEST_FIRST walk for 400003 steps (10974 resets) in 478 ms. (835 steps per ms) remains 34/34 properties
BEST_FIRST walk for 400004 steps (10906 resets) in 692 ms. (577 steps per ms) remains 34/34 properties
BEST_FIRST walk for 400003 steps (10950 resets) in 533 ms. (749 steps per ms) remains 34/34 properties
BEST_FIRST walk for 400003 steps (11019 resets) in 806 ms. (495 steps per ms) remains 34/34 properties
BEST_FIRST walk for 400004 steps (10994 resets) in 604 ms. (661 steps per ms) remains 34/34 properties
BEST_FIRST walk for 400004 steps (10952 resets) in 672 ms. (594 steps per ms) remains 34/34 properties
BEST_FIRST walk for 400004 steps (10993 resets) in 645 ms. (619 steps per ms) remains 34/34 properties
BEST_FIRST walk for 400004 steps (11023 resets) in 674 ms. (592 steps per ms) remains 34/34 properties
BEST_FIRST walk for 400003 steps (10988 resets) in 433 ms. (921 steps per ms) remains 34/34 properties
BEST_FIRST walk for 400002 steps (11098 resets) in 477 ms. (836 steps per ms) remains 34/34 properties
BEST_FIRST walk for 400004 steps (10999 resets) in 537 ms. (743 steps per ms) remains 34/34 properties
BEST_FIRST walk for 400004 steps (11030 resets) in 573 ms. (696 steps per ms) remains 34/34 properties
BEST_FIRST walk for 400004 steps (10944 resets) in 478 ms. (835 steps per ms) remains 34/34 properties
BEST_FIRST walk for 400004 steps (10961 resets) in 502 ms. (795 steps per ms) remains 34/34 properties
BEST_FIRST walk for 400004 steps (11070 resets) in 442 ms. (902 steps per ms) remains 34/34 properties
BEST_FIRST walk for 400003 steps (11010 resets) in 419 ms. (952 steps per ms) remains 34/34 properties
BEST_FIRST walk for 400004 steps (10954 resets) in 402 ms. (992 steps per ms) remains 34/34 properties
BEST_FIRST walk for 400002 steps (11033 resets) in 398 ms. (1002 steps per ms) remains 34/34 properties
BEST_FIRST walk for 400004 steps (10998 resets) in 409 ms. (975 steps per ms) remains 34/34 properties
BEST_FIRST walk for 400004 steps (11039 resets) in 399 ms. (1000 steps per ms) remains 34/34 properties
BEST_FIRST walk for 400003 steps (11027 resets) in 398 ms. (1002 steps per ms) remains 34/34 properties
BEST_FIRST walk for 400003 steps (10977 resets) in 401 ms. (995 steps per ms) remains 34/34 properties
BEST_FIRST walk for 400003 steps (11121 resets) in 398 ms. (1002 steps per ms) remains 34/34 properties
BEST_FIRST walk for 400004 steps (11028 resets) in 396 ms. (1007 steps per ms) remains 34/34 properties
BEST_FIRST walk for 400003 steps (10967 resets) in 392 ms. (1017 steps per ms) remains 34/34 properties
BEST_FIRST walk for 400003 steps (11032 resets) in 386 ms. (1033 steps per ms) remains 34/34 properties
[2024-05-23 14:54:35] [INFO ] Flow matrix only has 176 transitions (discarded 21 similar events)
// Phase 1: matrix 176 rows 92 cols
[2024-05-23 14:54:35] [INFO ] Computed 18 invariants in 5 ms
[2024-05-23 14:54:35] [INFO ] State equation strengthened by 7 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) 35/69 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/69 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 3 (OVERLAPS) 23/92 variables, 8/18 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/92 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 5 (OVERLAPS) 176/268 variables, 92/110 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/268 variables, 7/117 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/268 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 8 (OVERLAPS) 0/268 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 34 unsolved
No progress, stopping.
After SMT solving in domain Real declared 268/268 variables, and 117 constraints, problems are : Problem set: 0 solved, 34 unsolved in 645 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 92/92 constraints, ReadFeed: 7/7 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) 35/69 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 34 unsolved
[2024-05-23 14:54:35] [INFO ] Deduced a trap composed of 21 places in 42 ms of which 1 ms to minimize.
[2024-05-23 14:54:35] [INFO ] Deduced a trap composed of 14 places in 49 ms of which 1 ms to minimize.
[2024-05-23 14:54:36] [INFO ] Deduced a trap composed of 21 places in 48 ms of which 1 ms to minimize.
[2024-05-23 14:54:36] [INFO ] Deduced a trap composed of 21 places in 47 ms of which 1 ms to minimize.
[2024-05-23 14:54:36] [INFO ] Deduced a trap composed of 21 places in 48 ms of which 1 ms to minimize.
[2024-05-23 14:54:36] [INFO ] Deduced a trap composed of 21 places in 36 ms of which 2 ms to minimize.
[2024-05-23 14:54:36] [INFO ] Deduced a trap composed of 30 places in 42 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/69 variables, 7/17 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/69 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 4 (OVERLAPS) 23/92 variables, 8/25 constraints. Problems are: Problem set: 0 solved, 34 unsolved
[2024-05-23 14:54:36] [INFO ] Deduced a trap composed of 15 places in 53 ms of which 1 ms to minimize.
[2024-05-23 14:54:36] [INFO ] Deduced a trap composed of 33 places in 55 ms of which 1 ms to minimize.
[2024-05-23 14:54:36] [INFO ] Deduced a trap composed of 30 places in 44 ms of which 1 ms to minimize.
[2024-05-23 14:54:36] [INFO ] Deduced a trap composed of 14 places in 55 ms of which 1 ms to minimize.
[2024-05-23 14:54:36] [INFO ] Deduced a trap composed of 29 places in 52 ms of which 1 ms to minimize.
[2024-05-23 14:54:36] [INFO ] Deduced a trap composed of 14 places in 35 ms of which 0 ms to minimize.
[2024-05-23 14:54:36] [INFO ] Deduced a trap composed of 11 places in 29 ms of which 0 ms to minimize.
[2024-05-23 14:54:36] [INFO ] Deduced a trap composed of 29 places in 49 ms of which 1 ms to minimize.
[2024-05-23 14:54:36] [INFO ] Deduced a trap composed of 14 places in 52 ms of which 1 ms to minimize.
[2024-05-23 14:54:36] [INFO ] Deduced a trap composed of 29 places in 37 ms of which 1 ms to minimize.
[2024-05-23 14:54:36] [INFO ] Deduced a trap composed of 14 places in 36 ms of which 0 ms to minimize.
[2024-05-23 14:54:36] [INFO ] Deduced a trap composed of 33 places in 53 ms of which 1 ms to minimize.
[2024-05-23 14:54:36] [INFO ] Deduced a trap composed of 28 places in 53 ms of which 0 ms to minimize.
[2024-05-23 14:54:37] [INFO ] Deduced a trap composed of 14 places in 44 ms of which 1 ms to minimize.
[2024-05-23 14:54:37] [INFO ] Deduced a trap composed of 14 places in 39 ms of which 1 ms to minimize.
[2024-05-23 14:54:37] [INFO ] Deduced a trap composed of 14 places in 36 ms of which 0 ms to minimize.
[2024-05-23 14:54:37] [INFO ] Deduced a trap composed of 15 places in 35 ms of which 0 ms to minimize.
[2024-05-23 14:54:37] [INFO ] Deduced a trap composed of 33 places in 52 ms of which 1 ms to minimize.
[2024-05-23 14:54:37] [INFO ] Deduced a trap composed of 28 places in 45 ms of which 0 ms to minimize.
[2024-05-23 14:54:37] [INFO ] Deduced a trap composed of 27 places in 52 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/92 variables, 20/45 constraints. Problems are: Problem set: 0 solved, 34 unsolved
[2024-05-23 14:54:37] [INFO ] Deduced a trap composed of 30 places in 41 ms of which 0 ms to minimize.
[2024-05-23 14:54:37] [INFO ] Deduced a trap composed of 14 places in 48 ms of which 1 ms to minimize.
[2024-05-23 14:54:37] [INFO ] Deduced a trap composed of 33 places in 50 ms of which 1 ms to minimize.
[2024-05-23 14:54:37] [INFO ] Deduced a trap composed of 14 places in 32 ms of which 1 ms to minimize.
[2024-05-23 14:54:37] [INFO ] Deduced a trap composed of 15 places in 56 ms of which 1 ms to minimize.
[2024-05-23 14:54:37] [INFO ] Deduced a trap composed of 36 places in 130 ms of which 0 ms to minimize.
[2024-05-23 14:54:37] [INFO ] Deduced a trap composed of 26 places in 50 ms of which 0 ms to minimize.
[2024-05-23 14:54:37] [INFO ] Deduced a trap composed of 14 places in 37 ms of which 1 ms to minimize.
[2024-05-23 14:54:37] [INFO ] Deduced a trap composed of 15 places in 37 ms of which 1 ms to minimize.
[2024-05-23 14:54:37] [INFO ] Deduced a trap composed of 32 places in 49 ms of which 1 ms to minimize.
[2024-05-23 14:54:37] [INFO ] Deduced a trap composed of 32 places in 50 ms of which 1 ms to minimize.
[2024-05-23 14:54:38] [INFO ] Deduced a trap composed of 27 places in 62 ms of which 1 ms to minimize.
[2024-05-23 14:54:38] [INFO ] Deduced a trap composed of 28 places in 41 ms of which 1 ms to minimize.
[2024-05-23 14:54:38] [INFO ] Deduced a trap composed of 28 places in 47 ms of which 1 ms to minimize.
[2024-05-23 14:54:38] [INFO ] Deduced a trap composed of 14 places in 35 ms of which 1 ms to minimize.
[2024-05-23 14:54:38] [INFO ] Deduced a trap composed of 33 places in 39 ms of which 1 ms to minimize.
[2024-05-23 14:54:38] [INFO ] Deduced a trap composed of 16 places in 28 ms of which 1 ms to minimize.
[2024-05-23 14:54:38] [INFO ] Deduced a trap composed of 16 places in 50 ms of which 1 ms to minimize.
[2024-05-23 14:54:38] [INFO ] Deduced a trap composed of 15 places in 41 ms of which 0 ms to minimize.
[2024-05-23 14:54:38] [INFO ] Deduced a trap composed of 11 places in 55 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/92 variables, 20/65 constraints. Problems are: Problem set: 0 solved, 34 unsolved
[2024-05-23 14:54:38] [INFO ] Deduced a trap composed of 28 places in 55 ms of which 1 ms to minimize.
[2024-05-23 14:54:38] [INFO ] Deduced a trap composed of 27 places in 47 ms of which 0 ms to minimize.
[2024-05-23 14:54:38] [INFO ] Deduced a trap composed of 27 places in 35 ms of which 0 ms to minimize.
[2024-05-23 14:54:38] [INFO ] Deduced a trap composed of 29 places in 44 ms of which 1 ms to minimize.
[2024-05-23 14:54:38] [INFO ] Deduced a trap composed of 29 places in 36 ms of which 1 ms to minimize.
[2024-05-23 14:54:38] [INFO ] Deduced a trap composed of 29 places in 40 ms of which 0 ms to minimize.
[2024-05-23 14:54:38] [INFO ] Deduced a trap composed of 33 places in 43 ms of which 1 ms to minimize.
[2024-05-23 14:54:38] [INFO ] Deduced a trap composed of 33 places in 38 ms of which 1 ms to minimize.
[2024-05-23 14:54:38] [INFO ] Deduced a trap composed of 29 places in 56 ms of which 0 ms to minimize.
[2024-05-23 14:54:38] [INFO ] Deduced a trap composed of 28 places in 40 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/92 variables, 10/75 constraints. Problems are: Problem set: 0 solved, 34 unsolved
[2024-05-23 14:54:39] [INFO ] Deduced a trap composed of 31 places in 49 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/92 variables, 1/76 constraints. Problems are: Problem set: 0 solved, 34 unsolved
[2024-05-23 14:54:39] [INFO ] Deduced a trap composed of 28 places in 56 ms of which 1 ms to minimize.
[2024-05-23 14:54:39] [INFO ] Deduced a trap composed of 29 places in 55 ms of which 1 ms to minimize.
[2024-05-23 14:54:39] [INFO ] Deduced a trap composed of 27 places in 44 ms of which 1 ms to minimize.
[2024-05-23 14:54:39] [INFO ] Deduced a trap composed of 14 places in 27 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/92 variables, 4/80 constraints. Problems are: Problem set: 0 solved, 34 unsolved
[2024-05-23 14:54:39] [INFO ] Deduced a trap composed of 16 places in 35 ms of which 1 ms to minimize.
[2024-05-23 14:54:39] [INFO ] Deduced a trap composed of 29 places in 51 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/92 variables, 2/82 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/92 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 12 (OVERLAPS) 176/268 variables, 92/174 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/268 variables, 7/181 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/268 variables, 34/215 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/268 variables, 0/215 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 16 (OVERLAPS) 0/268 variables, 0/215 constraints. Problems are: Problem set: 0 solved, 34 unsolved
No progress, stopping.
After SMT solving in domain Int declared 268/268 variables, and 215 constraints, problems are : Problem set: 0 solved, 34 unsolved in 4760 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 92/92 constraints, ReadFeed: 7/7 constraints, PredecessorRefiner: 34/34 constraints, Known Traps: 64/64 constraints]
After SMT, in 5426ms problems are : Problem set: 0 solved, 34 unsolved
Fused 34 Parikh solutions to 14 different solutions.
Parikh walk visited 31 properties in 997 ms.
Support contains 3 out of 92 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 92/92 places, 197/197 transitions.
Graph (complete) has 480 edges and 92 vertex of which 83 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.1 ms
Discarding 9 places :
Also discarding 0 output transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 5 place count 83 transition count 193
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 10 place count 79 transition count 192
Discarding 28 places :
Symmetric choice reduction at 2 with 28 rule applications. Total rules 38 place count 51 transition count 136
Iterating global reduction 2 with 28 rules applied. Total rules applied 66 place count 51 transition count 136
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 70 place count 47 transition count 128
Iterating global reduction 2 with 4 rules applied. Total rules applied 74 place count 47 transition count 128
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 77 place count 44 transition count 119
Iterating global reduction 2 with 3 rules applied. Total rules applied 80 place count 44 transition count 119
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 82 place count 42 transition count 115
Iterating global reduction 2 with 2 rules applied. Total rules applied 84 place count 42 transition count 115
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 94 place count 42 transition count 105
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -9
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 100 place count 39 transition count 114
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 102 place count 39 transition count 112
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 4 with 1 rules applied. Total rules applied 103 place count 39 transition count 217
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 5 rules applied. Total rules applied 108 place count 38 transition count 213
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 109 place count 37 transition count 158
Iterating global reduction 5 with 1 rules applied. Total rules applied 110 place count 37 transition count 158
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 112 place count 35 transition count 153
Iterating global reduction 5 with 2 rules applied. Total rules applied 114 place count 35 transition count 153
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 5 with 8 rules applied. Total rules applied 122 place count 35 transition count 145
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 6 with 4 rules applied. Total rules applied 126 place count 35 transition count 141
Partial Free-agglomeration rule applied 9 times.
Drop transitions (Partial Free agglomeration) removed 9 transitions
Iterating global reduction 6 with 9 rules applied. Total rules applied 135 place count 35 transition count 141
Partial Free-agglomeration rule applied 8 times.
Drop transitions (Partial Free agglomeration) removed 8 transitions
Iterating global reduction 6 with 8 rules applied. Total rules applied 143 place count 35 transition count 141
Applied a total of 143 rules in 52 ms. Remains 35 /92 variables (removed 57) and now considering 141/197 (removed 56) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 54 ms. Remains : 35/92 places, 141/197 transitions.
RANDOM walk for 3069344 steps (298695 resets) in 15020 ms. (204 steps per ms) remains 0/3 properties
Able to resolve query StableMarking after proving 137 properties.
FORMULA StableMarking FALSE TECHNIQUES RANDOM_WALK PARIKH_WALK MARKED_SUFFIX_TEST TRIVIAL_UNMARKED_SCC_TEST BESTFIRST_WALK TOPOLOGICAL
Total runtime 35408 ms.
ITS solved all properties within timeout

BK_STOP 1716476086722

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

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