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.r498-tall-171640618000498.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 ltsminxred
Input is HealthRecord-PT-13, examination is StableMarking
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r498-tall-171640618000498
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 496K
-rw-r--r-- 1 mcc users 5.8K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 59K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.4K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 37K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K 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.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 13K Apr 12 20:06 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 142K Apr 12 20:06 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.6K Apr 12 20:05 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 63K Apr 12 20:05 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 22 14:48 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:48 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 3 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 71K May 18 16:42 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

FORMULA_NAME StableMarking

=== Now, execution of the tool begins

BK_START 1717194060133

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=StableMarking
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=HealthRecord-PT-13
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-05-31 22:21:01] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, StableMarking, -timeout, 180, -rebuildPNML]
[2024-05-31 22:21:01] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-31 22:21:01] [INFO ] Load time of PNML (sax parser for PT used): 77 ms
[2024-05-31 22:21:01] [INFO ] Transformed 161 places.
[2024-05-31 22:21:01] [INFO ] Transformed 341 transitions.
[2024-05-31 22:21:01] [INFO ] Found NUPN structural information;
[2024-05-31 22:21:01] [INFO ] Parsed PT model containing 161 places and 341 transitions and 899 arcs in 175 ms.
Graph (trivial) has 274 edges and 161 vertex of which 8 / 161 are part of one of the 4 SCC in 4 ms
Free SCC test removed 4 places
Structural test allowed to assert that 29 places are NOT stable. Took 20 ms.
Ensure Unique test removed 32 transitions
Reduce redundant transitions removed 32 transitions.
RANDOM walk for 40000 steps (3493 resets) in 2063 ms. (19 steps per ms) remains 59/132 properties
BEST_FIRST walk for 4004 steps (47 resets) in 33 ms. (117 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4003 steps (45 resets) in 14 ms. (266 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4004 steps (43 resets) in 19 ms. (200 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4004 steps (47 resets) in 13 ms. (286 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4003 steps (45 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 4004 steps (45 resets) in 15 ms. (250 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4004 steps (44 resets) in 12 ms. (308 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4004 steps (42 resets) in 13 ms. (286 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4004 steps (44 resets) in 13 ms. (286 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4003 steps (47 resets) in 10 ms. (363 steps per ms) remains 58/59 properties
BEST_FIRST walk for 4004 steps (46 resets) in 15 ms. (250 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4004 steps (46 resets) in 8 ms. (444 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4004 steps (46 resets) in 16 ms. (235 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4004 steps (43 resets) in 17 ms. (222 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4004 steps (46 resets) in 12 ms. (308 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4004 steps (44 resets) in 10 ms. (364 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4004 steps (43 resets) in 13 ms. (286 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4003 steps (48 resets) in 22 ms. (174 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4004 steps (45 resets) in 19 ms. (200 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4002 steps (44 resets) in 10 ms. (363 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4003 steps (45 resets) in 10 ms. (363 steps per ms) remains 56/58 properties
BEST_FIRST walk for 4004 steps (44 resets) in 11 ms. (333 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4004 steps (46 resets) in 16 ms. (235 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4004 steps (47 resets) in 12 ms. (308 steps per ms) remains 55/56 properties
BEST_FIRST walk for 4003 steps (43 resets) in 9 ms. (400 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4004 steps (44 resets) in 9 ms. (400 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4003 steps (44 resets) in 12 ms. (307 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4004 steps (47 resets) in 10 ms. (364 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4004 steps (42 resets) in 10 ms. (364 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4004 steps (45 resets) in 8 ms. (444 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4004 steps (46 resets) in 9 ms. (400 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4004 steps (45 resets) in 9 ms. (400 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4004 steps (44 resets) in 10 ms. (364 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4004 steps (44 resets) in 16 ms. (235 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4004 steps (44 resets) in 10 ms. (364 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4004 steps (47 resets) in 8 ms. (444 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4003 steps (47 resets) in 12 ms. (307 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4003 steps (47 resets) in 14 ms. (266 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4003 steps (45 resets) in 10 ms. (363 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4002 steps (47 resets) in 9 ms. (400 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4004 steps (47 resets) in 10 ms. (364 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4004 steps (44 resets) in 14 ms. (266 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4004 steps (44 resets) in 15 ms. (250 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4003 steps (44 resets) in 13 ms. (285 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4003 steps (43 resets) in 25 ms. (153 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4004 steps (45 resets) in 11 ms. (333 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4003 steps (44 resets) in 9 ms. (400 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4003 steps (44 resets) in 12 ms. (307 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4004 steps (44 resets) in 8 ms. (444 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4003 steps (46 resets) in 8 ms. (444 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4002 steps (41 resets) in 10 ms. (363 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4003 steps (46 resets) in 9 ms. (400 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4004 steps (46 resets) in 7 ms. (500 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4004 steps (44 resets) in 8 ms. (444 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4003 steps (46 resets) in 9 ms. (400 steps per ms) remains 55/55 properties
[2024-05-31 22:21:02] [INFO ] Flow matrix only has 293 transitions (discarded 16 similar events)
// Phase 1: matrix 293 rows 157 cols
[2024-05-31 22:21:02] [INFO ] Computed 18 invariants in 8 ms
[2024-05-31 22:21:02] [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) 39/94 variables, 10/65 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/94 variables, 39/104 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/94 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 5 (OVERLAPS) 63/157 variables, 8/112 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/157 variables, 63/175 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/157 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 8 (OVERLAPS) 292/449 variables, 157/332 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/449 variables, 0/332 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 10 (OVERLAPS) 1/450 variables, 1/333 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/450 variables, 0/333 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 12 (OVERLAPS) 0/450 variables, 0/333 constraints. Problems are: Problem set: 0 solved, 55 unsolved
No progress, stopping.
After SMT solving in domain Real declared 450/450 variables, and 333 constraints, problems are : Problem set: 0 solved, 55 unsolved in 1937 ms.
Refiners :[Domain max(s): 157/157 constraints, Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 157/157 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) 39/94 variables, 10/65 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/94 variables, 39/104 constraints. Problems are: Problem set: 0 solved, 55 unsolved
[2024-05-31 22:21:04] [INFO ] Deduced a trap composed of 25 places in 57 ms of which 10 ms to minimize.
[2024-05-31 22:21:04] [INFO ] Deduced a trap composed of 45 places in 43 ms of which 2 ms to minimize.
[2024-05-31 22:21:05] [INFO ] Deduced a trap composed of 44 places in 39 ms of which 1 ms to minimize.
[2024-05-31 22:21:05] [INFO ] Deduced a trap composed of 44 places in 38 ms of which 1 ms to minimize.
[2024-05-31 22:21:05] [INFO ] Deduced a trap composed of 44 places in 45 ms of which 1 ms to minimize.
[2024-05-31 22:21:05] [INFO ] Deduced a trap composed of 40 places in 43 ms of which 1 ms to minimize.
[2024-05-31 22:21:05] [INFO ] Deduced a trap composed of 22 places in 27 ms of which 1 ms to minimize.
[2024-05-31 22:21:05] [INFO ] Deduced a trap composed of 41 places in 32 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/94 variables, 8/112 constraints. Problems are: Problem set: 0 solved, 55 unsolved
[2024-05-31 22:21:05] [INFO ] Deduced a trap composed of 40 places in 49 ms of which 1 ms to minimize.
[2024-05-31 22:21:05] [INFO ] Deduced a trap composed of 40 places in 46 ms of which 1 ms to minimize.
[2024-05-31 22:21:05] [INFO ] Deduced a trap composed of 38 places in 43 ms of which 1 ms to minimize.
[2024-05-31 22:21:05] [INFO ] Deduced a trap composed of 40 places in 40 ms of which 1 ms to minimize.
[2024-05-31 22:21:05] [INFO ] Deduced a trap composed of 39 places in 41 ms of which 1 ms to minimize.
[2024-05-31 22:21:05] [INFO ] Deduced a trap composed of 40 places in 41 ms of which 1 ms to minimize.
[2024-05-31 22:21:05] [INFO ] Deduced a trap composed of 38 places in 38 ms of which 1 ms to minimize.
[2024-05-31 22:21:05] [INFO ] Deduced a trap composed of 40 places in 40 ms of which 1 ms to minimize.
[2024-05-31 22:21:05] [INFO ] Deduced a trap composed of 39 places in 48 ms of which 1 ms to minimize.
[2024-05-31 22:21:05] [INFO ] Deduced a trap composed of 39 places in 41 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/94 variables, 10/122 constraints. Problems are: Problem set: 0 solved, 55 unsolved
[2024-05-31 22:21:05] [INFO ] Deduced a trap composed of 40 places in 43 ms of which 0 ms to minimize.
[2024-05-31 22:21:06] [INFO ] Deduced a trap composed of 39 places in 46 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/94 variables, 2/124 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/94 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 8 (OVERLAPS) 63/157 variables, 8/132 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/157 variables, 63/195 constraints. Problems are: Problem set: 0 solved, 55 unsolved
[2024-05-31 22:21:06] [INFO ] Deduced a trap composed of 30 places in 62 ms of which 2 ms to minimize.
[2024-05-31 22:21:06] [INFO ] Deduced a trap composed of 46 places in 54 ms of which 1 ms to minimize.
[2024-05-31 22:21:06] [INFO ] Deduced a trap composed of 30 places in 71 ms of which 1 ms to minimize.
[2024-05-31 22:21:06] [INFO ] Deduced a trap composed of 38 places in 49 ms of which 1 ms to minimize.
[2024-05-31 22:21:06] [INFO ] Deduced a trap composed of 30 places in 50 ms of which 1 ms to minimize.
[2024-05-31 22:21:06] [INFO ] Deduced a trap composed of 50 places in 53 ms of which 1 ms to minimize.
[2024-05-31 22:21:06] [INFO ] Deduced a trap composed of 46 places in 53 ms of which 1 ms to minimize.
[2024-05-31 22:21:06] [INFO ] Deduced a trap composed of 44 places in 51 ms of which 1 ms to minimize.
[2024-05-31 22:21:06] [INFO ] Deduced a trap composed of 43 places in 49 ms of which 2 ms to minimize.
[2024-05-31 22:21:06] [INFO ] Deduced a trap composed of 40 places in 49 ms of which 1 ms to minimize.
[2024-05-31 22:21:06] [INFO ] Deduced a trap composed of 42 places in 50 ms of which 1 ms to minimize.
[2024-05-31 22:21:07] [INFO ] Deduced a trap composed of 42 places in 50 ms of which 1 ms to minimize.
[2024-05-31 22:21:07] [INFO ] Deduced a trap composed of 39 places in 49 ms of which 1 ms to minimize.
[2024-05-31 22:21:07] [INFO ] Deduced a trap composed of 47 places in 53 ms of which 1 ms to minimize.
[2024-05-31 22:21:07] [INFO ] Deduced a trap composed of 30 places in 49 ms of which 5 ms to minimize.
[2024-05-31 22:21:07] [INFO ] Deduced a trap composed of 49 places in 52 ms of which 2 ms to minimize.
[2024-05-31 22:21:07] [INFO ] Deduced a trap composed of 45 places in 50 ms of which 1 ms to minimize.
[2024-05-31 22:21:07] [INFO ] Deduced a trap composed of 30 places in 60 ms of which 3 ms to minimize.
[2024-05-31 22:21:07] [INFO ] Deduced a trap composed of 40 places in 48 ms of which 1 ms to minimize.
[2024-05-31 22:21:07] [INFO ] Deduced a trap composed of 30 places in 45 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/157 variables, 20/215 constraints. Problems are: Problem set: 0 solved, 55 unsolved
[2024-05-31 22:21:07] [INFO ] Deduced a trap composed of 44 places in 54 ms of which 1 ms to minimize.
[2024-05-31 22:21:07] [INFO ] Deduced a trap composed of 50 places in 52 ms of which 1 ms to minimize.
[2024-05-31 22:21:07] [INFO ] Deduced a trap composed of 40 places in 63 ms of which 1 ms to minimize.
[2024-05-31 22:21:07] [INFO ] Deduced a trap composed of 44 places in 48 ms of which 1 ms to minimize.
[2024-05-31 22:21:07] [INFO ] Deduced a trap composed of 40 places in 49 ms of which 1 ms to minimize.
[2024-05-31 22:21:07] [INFO ] Deduced a trap composed of 42 places in 45 ms of which 1 ms to minimize.
[2024-05-31 22:21:07] [INFO ] Deduced a trap composed of 39 places in 43 ms of which 1 ms to minimize.
[2024-05-31 22:21:07] [INFO ] Deduced a trap composed of 30 places in 39 ms of which 1 ms to minimize.
[2024-05-31 22:21:07] [INFO ] Deduced a trap composed of 40 places in 46 ms of which 1 ms to minimize.
[2024-05-31 22:21:08] [INFO ] Deduced a trap composed of 29 places in 52 ms of which 1 ms to minimize.
[2024-05-31 22:21:08] [INFO ] Deduced a trap composed of 29 places in 42 ms of which 1 ms to minimize.
[2024-05-31 22:21:08] [INFO ] Deduced a trap composed of 42 places in 40 ms of which 1 ms to minimize.
[2024-05-31 22:21:08] [INFO ] Deduced a trap composed of 50 places in 42 ms of which 1 ms to minimize.
[2024-05-31 22:21:08] [INFO ] Deduced a trap composed of 42 places in 47 ms of which 1 ms to minimize.
[2024-05-31 22:21:08] [INFO ] Deduced a trap composed of 41 places in 40 ms of which 0 ms to minimize.
[2024-05-31 22:21:08] [INFO ] Deduced a trap composed of 40 places in 46 ms of which 0 ms to minimize.
[2024-05-31 22:21:08] [INFO ] Deduced a trap composed of 42 places in 58 ms of which 4 ms to minimize.
[2024-05-31 22:21:08] [INFO ] Deduced a trap composed of 30 places in 50 ms of which 1 ms to minimize.
[2024-05-31 22:21:08] [INFO ] Deduced a trap composed of 42 places in 52 ms of which 1 ms to minimize.
[2024-05-31 22:21:08] [INFO ] Deduced a trap composed of 39 places in 45 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/157 variables, 20/235 constraints. Problems are: Problem set: 0 solved, 55 unsolved
[2024-05-31 22:21:08] [INFO ] Deduced a trap composed of 51 places in 44 ms of which 1 ms to minimize.
[2024-05-31 22:21:08] [INFO ] Deduced a trap composed of 40 places in 41 ms of which 1 ms to minimize.
[2024-05-31 22:21:08] [INFO ] Deduced a trap composed of 45 places in 51 ms of which 1 ms to minimize.
[2024-05-31 22:21:08] [INFO ] Deduced a trap composed of 40 places in 44 ms of which 2 ms to minimize.
[2024-05-31 22:21:08] [INFO ] Deduced a trap composed of 38 places in 61 ms of which 1 ms to minimize.
[2024-05-31 22:21:08] [INFO ] Deduced a trap composed of 39 places in 42 ms of which 1 ms to minimize.
[2024-05-31 22:21:09] [INFO ] Deduced a trap composed of 30 places in 53 ms of which 1 ms to minimize.
[2024-05-31 22:21:09] [INFO ] Deduced a trap composed of 36 places in 50 ms of which 1 ms to minimize.
[2024-05-31 22:21:09] [INFO ] Deduced a trap composed of 30 places in 51 ms of which 1 ms to minimize.
[2024-05-31 22:21:09] [INFO ] Deduced a trap composed of 39 places in 50 ms of which 1 ms to minimize.
[2024-05-31 22:21:09] [INFO ] Deduced a trap composed of 12 places in 69 ms of which 1 ms to minimize.
[2024-05-31 22:21:09] [INFO ] Deduced a trap composed of 40 places in 46 ms of which 1 ms to minimize.
[2024-05-31 22:21:09] [INFO ] Deduced a trap composed of 39 places in 40 ms of which 1 ms to minimize.
[2024-05-31 22:21:09] [INFO ] Deduced a trap composed of 39 places in 55 ms of which 0 ms to minimize.
[2024-05-31 22:21:09] [INFO ] Deduced a trap composed of 30 places in 37 ms of which 1 ms to minimize.
[2024-05-31 22:21:09] [INFO ] Deduced a trap composed of 39 places in 51 ms of which 1 ms to minimize.
[2024-05-31 22:21:09] [INFO ] Deduced a trap composed of 41 places in 40 ms of which 1 ms to minimize.
[2024-05-31 22:21:09] [INFO ] Deduced a trap composed of 38 places in 47 ms of which 1 ms to minimize.
SMT process timed out in 7053ms, After SMT, problems are : Problem set: 0 solved, 55 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 55 out of 157 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 157/157 places, 309/309 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 17 transitions
Reduce isomorphic transitions removed 17 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 0 with 18 rules applied. Total rules applied 18 place count 157 transition count 291
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 20 place count 156 transition count 290
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 20 place count 156 transition count 289
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 22 place count 155 transition count 289
Discarding 51 places :
Symmetric choice reduction at 2 with 51 rule applications. Total rules 73 place count 104 transition count 187
Iterating global reduction 2 with 51 rules applied. Total rules applied 124 place count 104 transition count 187
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 128 place count 100 transition count 179
Iterating global reduction 2 with 4 rules applied. Total rules applied 132 place count 100 transition count 179
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 138 place count 100 transition count 173
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: -34
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 152 place count 93 transition count 207
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 3 with 3 rules applied. Total rules applied 155 place count 93 transition count 204
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 156 place count 93 transition count 204
Applied a total of 156 rules in 54 ms. Remains 93 /157 variables (removed 64) and now considering 204/309 (removed 105) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 63 ms. Remains : 93/157 places, 204/309 transitions.
RANDOM walk for 4000000 steps (726133 resets) in 20037 ms. (199 steps per ms) remains 38/55 properties
BEST_FIRST walk for 400004 steps (11055 resets) in 376 ms. (1061 steps per ms) remains 38/38 properties
BEST_FIRST walk for 400004 steps (11014 resets) in 362 ms. (1101 steps per ms) remains 38/38 properties
BEST_FIRST walk for 400002 steps (11032 resets) in 364 ms. (1095 steps per ms) remains 38/38 properties
BEST_FIRST walk for 400004 steps (10992 resets) in 355 ms. (1123 steps per ms) remains 38/38 properties
BEST_FIRST walk for 400002 steps (11010 resets) in 360 ms. (1108 steps per ms) remains 38/38 properties
BEST_FIRST walk for 400003 steps (10970 resets) in 364 ms. (1095 steps per ms) remains 38/38 properties
BEST_FIRST walk for 400002 steps (10970 resets) in 355 ms. (1123 steps per ms) remains 38/38 properties
BEST_FIRST walk for 400004 steps (11025 resets) in 371 ms. (1075 steps per ms) remains 38/38 properties
BEST_FIRST walk for 400002 steps (11004 resets) in 357 ms. (1117 steps per ms) remains 38/38 properties
BEST_FIRST walk for 400003 steps (10935 resets) in 353 ms. (1129 steps per ms) remains 38/38 properties
BEST_FIRST walk for 400003 steps (10968 resets) in 367 ms. (1086 steps per ms) remains 38/38 properties
BEST_FIRST walk for 400003 steps (10984 resets) in 359 ms. (1111 steps per ms) remains 38/38 properties
BEST_FIRST walk for 400002 steps (10955 resets) in 352 ms. (1133 steps per ms) remains 38/38 properties
BEST_FIRST walk for 400003 steps (10975 resets) in 355 ms. (1123 steps per ms) remains 38/38 properties
BEST_FIRST walk for 400003 steps (11028 resets) in 359 ms. (1111 steps per ms) remains 38/38 properties
BEST_FIRST walk for 400004 steps (10922 resets) in 351 ms. (1136 steps per ms) remains 38/38 properties
BEST_FIRST walk for 400004 steps (10975 resets) in 421 ms. (947 steps per ms) remains 38/38 properties
BEST_FIRST walk for 400003 steps (11017 resets) in 390 ms. (1023 steps per ms) remains 38/38 properties
BEST_FIRST walk for 400004 steps (10922 resets) in 354 ms. (1126 steps per ms) remains 38/38 properties
BEST_FIRST walk for 400004 steps (10946 resets) in 355 ms. (1123 steps per ms) remains 38/38 properties
BEST_FIRST walk for 400004 steps (11057 resets) in 352 ms. (1133 steps per ms) remains 38/38 properties
BEST_FIRST walk for 400004 steps (10978 resets) in 358 ms. (1114 steps per ms) remains 38/38 properties
BEST_FIRST walk for 400004 steps (10940 resets) in 353 ms. (1129 steps per ms) remains 38/38 properties
BEST_FIRST walk for 400002 steps (11035 resets) in 359 ms. (1111 steps per ms) remains 38/38 properties
BEST_FIRST walk for 400003 steps (11062 resets) in 366 ms. (1089 steps per ms) remains 38/38 properties
BEST_FIRST walk for 400004 steps (10967 resets) in 368 ms. (1084 steps per ms) remains 38/38 properties
BEST_FIRST walk for 400004 steps (10992 resets) in 370 ms. (1078 steps per ms) remains 38/38 properties
BEST_FIRST walk for 400004 steps (11040 resets) in 385 ms. (1036 steps per ms) remains 38/38 properties
BEST_FIRST walk for 400004 steps (11049 resets) in 371 ms. (1075 steps per ms) remains 38/38 properties
BEST_FIRST walk for 400003 steps (11036 resets) in 629 ms. (634 steps per ms) remains 38/38 properties
BEST_FIRST walk for 400004 steps (10986 resets) in 603 ms. (662 steps per ms) remains 38/38 properties
BEST_FIRST walk for 400003 steps (10965 resets) in 747 ms. (534 steps per ms) remains 38/38 properties
BEST_FIRST walk for 400003 steps (11048 resets) in 685 ms. (583 steps per ms) remains 38/38 properties
BEST_FIRST walk for 400003 steps (10985 resets) in 420 ms. (950 steps per ms) remains 38/38 properties
BEST_FIRST walk for 400002 steps (11012 resets) in 409 ms. (975 steps per ms) remains 38/38 properties
BEST_FIRST walk for 400003 steps (11059 resets) in 350 ms. (1139 steps per ms) remains 38/38 properties
BEST_FIRST walk for 400004 steps (10977 resets) in 357 ms. (1117 steps per ms) remains 38/38 properties
BEST_FIRST walk for 400004 steps (10999 resets) in 349 ms. (1142 steps per ms) remains 38/38 properties
[2024-05-31 22:21:19] [INFO ] Flow matrix only has 182 transitions (discarded 22 similar events)
// Phase 1: matrix 182 rows 93 cols
[2024-05-31 22:21:19] [INFO ] Computed 18 invariants in 2 ms
[2024-05-31 22:21:19] [INFO ] State equation strengthened by 8 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/38 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 1 (OVERLAPS) 37/75 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/75 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 3 (OVERLAPS) 18/93 variables, 8/18 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/93 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 5 (OVERLAPS) 182/275 variables, 93/111 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/275 variables, 8/119 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/275 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 8 (OVERLAPS) 0/275 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 38 unsolved
No progress, stopping.
After SMT solving in domain Real declared 275/275 variables, and 119 constraints, problems are : Problem set: 0 solved, 38 unsolved in 682 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 93/93 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 38/38 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 38 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/38 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 1 (OVERLAPS) 37/75 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 38 unsolved
[2024-05-31 22:21:20] [INFO ] Deduced a trap composed of 23 places in 46 ms of which 2 ms to minimize.
[2024-05-31 22:21:20] [INFO ] Deduced a trap composed of 19 places in 34 ms of which 0 ms to minimize.
[2024-05-31 22:21:20] [INFO ] Deduced a trap composed of 23 places in 37 ms of which 1 ms to minimize.
[2024-05-31 22:21:20] [INFO ] Deduced a trap composed of 23 places in 34 ms of which 0 ms to minimize.
[2024-05-31 22:21:20] [INFO ] Deduced a trap composed of 24 places in 50 ms of which 1 ms to minimize.
[2024-05-31 22:21:20] [INFO ] Deduced a trap composed of 23 places in 33 ms of which 0 ms to minimize.
[2024-05-31 22:21:20] [INFO ] Deduced a trap composed of 24 places in 44 ms of which 1 ms to minimize.
[2024-05-31 22:21:20] [INFO ] Deduced a trap composed of 33 places in 32 ms of which 1 ms to minimize.
[2024-05-31 22:21:21] [INFO ] Deduced a trap composed of 23 places in 34 ms of which 1 ms to minimize.
[2024-05-31 22:21:21] [INFO ] Deduced a trap composed of 32 places in 35 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/75 variables, 10/20 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/75 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 4 (OVERLAPS) 18/93 variables, 8/28 constraints. Problems are: Problem set: 0 solved, 38 unsolved
[2024-05-31 22:21:21] [INFO ] Deduced a trap composed of 14 places in 43 ms of which 1 ms to minimize.
[2024-05-31 22:21:21] [INFO ] Deduced a trap composed of 14 places in 33 ms of which 0 ms to minimize.
[2024-05-31 22:21:21] [INFO ] Deduced a trap composed of 30 places in 34 ms of which 1 ms to minimize.
[2024-05-31 22:21:21] [INFO ] Deduced a trap composed of 35 places in 35 ms of which 1 ms to minimize.
[2024-05-31 22:21:21] [INFO ] Deduced a trap composed of 13 places in 28 ms of which 1 ms to minimize.
[2024-05-31 22:21:21] [INFO ] Deduced a trap composed of 14 places in 37 ms of which 1 ms to minimize.
[2024-05-31 22:21:21] [INFO ] Deduced a trap composed of 30 places in 35 ms of which 0 ms to minimize.
[2024-05-31 22:21:21] [INFO ] Deduced a trap composed of 13 places in 36 ms of which 1 ms to minimize.
[2024-05-31 22:21:21] [INFO ] Deduced a trap composed of 30 places in 35 ms of which 0 ms to minimize.
[2024-05-31 22:21:21] [INFO ] Deduced a trap composed of 30 places in 35 ms of which 1 ms to minimize.
[2024-05-31 22:21:21] [INFO ] Deduced a trap composed of 13 places in 36 ms of which 1 ms to minimize.
[2024-05-31 22:21:21] [INFO ] Deduced a trap composed of 35 places in 34 ms of which 1 ms to minimize.
[2024-05-31 22:21:21] [INFO ] Deduced a trap composed of 14 places in 40 ms of which 1 ms to minimize.
[2024-05-31 22:21:21] [INFO ] Deduced a trap composed of 13 places in 35 ms of which 1 ms to minimize.
[2024-05-31 22:21:21] [INFO ] Deduced a trap composed of 30 places in 36 ms of which 1 ms to minimize.
[2024-05-31 22:21:21] [INFO ] Deduced a trap composed of 31 places in 35 ms of which 1 ms to minimize.
[2024-05-31 22:21:21] [INFO ] Deduced a trap composed of 13 places in 37 ms of which 1 ms to minimize.
[2024-05-31 22:21:21] [INFO ] Deduced a trap composed of 13 places in 28 ms of which 1 ms to minimize.
[2024-05-31 22:21:21] [INFO ] Deduced a trap composed of 30 places in 35 ms of which 0 ms to minimize.
[2024-05-31 22:21:22] [INFO ] Deduced a trap composed of 31 places in 37 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/93 variables, 20/48 constraints. Problems are: Problem set: 0 solved, 38 unsolved
[2024-05-31 22:21:22] [INFO ] Deduced a trap composed of 29 places in 42 ms of which 1 ms to minimize.
[2024-05-31 22:21:22] [INFO ] Deduced a trap composed of 14 places in 41 ms of which 1 ms to minimize.
[2024-05-31 22:21:22] [INFO ] Deduced a trap composed of 31 places in 40 ms of which 1 ms to minimize.
[2024-05-31 22:21:22] [INFO ] Deduced a trap composed of 30 places in 36 ms of which 0 ms to minimize.
[2024-05-31 22:21:22] [INFO ] Deduced a trap composed of 31 places in 33 ms of which 1 ms to minimize.
[2024-05-31 22:21:22] [INFO ] Deduced a trap composed of 18 places in 40 ms of which 1 ms to minimize.
[2024-05-31 22:21:22] [INFO ] Deduced a trap composed of 13 places in 37 ms of which 1 ms to minimize.
[2024-05-31 22:21:22] [INFO ] Deduced a trap composed of 13 places in 25 ms of which 0 ms to minimize.
[2024-05-31 22:21:22] [INFO ] Deduced a trap composed of 30 places in 39 ms of which 1 ms to minimize.
[2024-05-31 22:21:22] [INFO ] Deduced a trap composed of 29 places in 37 ms of which 1 ms to minimize.
[2024-05-31 22:21:22] [INFO ] Deduced a trap composed of 14 places in 37 ms of which 1 ms to minimize.
[2024-05-31 22:21:22] [INFO ] Deduced a trap composed of 14 places in 35 ms of which 1 ms to minimize.
[2024-05-31 22:21:22] [INFO ] Deduced a trap composed of 13 places in 26 ms of which 1 ms to minimize.
[2024-05-31 22:21:22] [INFO ] Deduced a trap composed of 13 places in 26 ms of which 0 ms to minimize.
[2024-05-31 22:21:22] [INFO ] Deduced a trap composed of 13 places in 29 ms of which 1 ms to minimize.
[2024-05-31 22:21:22] [INFO ] Deduced a trap composed of 13 places in 26 ms of which 0 ms to minimize.
[2024-05-31 22:21:22] [INFO ] Deduced a trap composed of 14 places in 36 ms of which 1 ms to minimize.
[2024-05-31 22:21:22] [INFO ] Deduced a trap composed of 33 places in 37 ms of which 0 ms to minimize.
[2024-05-31 22:21:22] [INFO ] Deduced a trap composed of 31 places in 36 ms of which 0 ms to minimize.
[2024-05-31 22:21:22] [INFO ] Deduced a trap composed of 30 places in 32 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/93 variables, 20/68 constraints. Problems are: Problem set: 0 solved, 38 unsolved
[2024-05-31 22:21:22] [INFO ] Deduced a trap composed of 35 places in 38 ms of which 1 ms to minimize.
[2024-05-31 22:21:22] [INFO ] Deduced a trap composed of 29 places in 33 ms of which 1 ms to minimize.
[2024-05-31 22:21:22] [INFO ] Deduced a trap composed of 32 places in 36 ms of which 0 ms to minimize.
[2024-05-31 22:21:23] [INFO ] Deduced a trap composed of 29 places in 32 ms of which 1 ms to minimize.
[2024-05-31 22:21:23] [INFO ] Deduced a trap composed of 30 places in 43 ms of which 1 ms to minimize.
[2024-05-31 22:21:23] [INFO ] Deduced a trap composed of 31 places in 41 ms of which 1 ms to minimize.
[2024-05-31 22:21:23] [INFO ] Deduced a trap composed of 29 places in 41 ms of which 1 ms to minimize.
[2024-05-31 22:21:23] [INFO ] Deduced a trap composed of 30 places in 37 ms of which 1 ms to minimize.
[2024-05-31 22:21:23] [INFO ] Deduced a trap composed of 30 places in 38 ms of which 1 ms to minimize.
[2024-05-31 22:21:23] [INFO ] Deduced a trap composed of 14 places in 31 ms of which 1 ms to minimize.
[2024-05-31 22:21:23] [INFO ] Deduced a trap composed of 13 places in 30 ms of which 1 ms to minimize.
[2024-05-31 22:21:23] [INFO ] Deduced a trap composed of 31 places in 39 ms of which 1 ms to minimize.
[2024-05-31 22:21:23] [INFO ] Deduced a trap composed of 23 places in 45 ms of which 1 ms to minimize.
[2024-05-31 22:21:23] [INFO ] Deduced a trap composed of 34 places in 42 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/93 variables, 14/82 constraints. Problems are: Problem set: 0 solved, 38 unsolved
[2024-05-31 22:21:23] [INFO ] Deduced a trap composed of 32 places in 49 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/93 variables, 1/83 constraints. Problems are: Problem set: 0 solved, 38 unsolved
[2024-05-31 22:21:23] [INFO ] Deduced a trap composed of 30 places in 39 ms of which 1 ms to minimize.
[2024-05-31 22:21:23] [INFO ] Deduced a trap composed of 29 places in 35 ms of which 1 ms to minimize.
[2024-05-31 22:21:23] [INFO ] Deduced a trap composed of 14 places in 36 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/93 variables, 3/86 constraints. Problems are: Problem set: 0 solved, 38 unsolved
[2024-05-31 22:21:23] [INFO ] Deduced a trap composed of 23 places in 46 ms of which 0 ms to minimize.
[2024-05-31 22:21:24] [INFO ] Deduced a trap composed of 31 places in 44 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/93 variables, 2/88 constraints. Problems are: Problem set: 0 solved, 38 unsolved
[2024-05-31 22:21:24] [INFO ] Deduced a trap composed of 12 places in 37 ms of which 0 ms to minimize.
[2024-05-31 22:21:24] [INFO ] Deduced a trap composed of 13 places in 22 ms of which 0 ms to minimize.
[2024-05-31 22:21:24] [INFO ] Deduced a trap composed of 13 places in 25 ms of which 1 ms to minimize.
[2024-05-31 22:21:24] [INFO ] Deduced a trap composed of 34 places in 43 ms of which 0 ms to minimize.
[2024-05-31 22:21:24] [INFO ] Deduced a trap composed of 13 places in 30 ms of which 1 ms to minimize.
[2024-05-31 22:21:24] [INFO ] Deduced a trap composed of 13 places in 32 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/93 variables, 6/94 constraints. Problems are: Problem set: 0 solved, 38 unsolved
[2024-05-31 22:21:24] [INFO ] Deduced a trap composed of 13 places in 34 ms of which 0 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/93 variables, 1/95 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/93 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 14 (OVERLAPS) 182/275 variables, 93/188 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/275 variables, 8/196 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/275 variables, 38/234 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/275 variables, 0/234 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 18 (OVERLAPS) 0/275 variables, 0/234 constraints. Problems are: Problem set: 0 solved, 38 unsolved
No progress, stopping.
After SMT solving in domain Int declared 275/275 variables, and 234 constraints, problems are : Problem set: 0 solved, 38 unsolved in 5561 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 93/93 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 38/38 constraints, Known Traps: 77/77 constraints]
After SMT, in 6257ms problems are : Problem set: 0 solved, 38 unsolved
Fused 38 Parikh solutions to 24 different solutions.
Parikh walk visited 29 properties in 2357 ms.
Support contains 9 out of 93 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 93/93 places, 204/204 transitions.
Graph (complete) has 482 edges and 93 vertex of which 84 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 84 transition count 200
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 80 transition count 199
Discarding 23 places :
Symmetric choice reduction at 2 with 23 rule applications. Total rules 33 place count 57 transition count 153
Iterating global reduction 2 with 23 rules applied. Total rules applied 56 place count 57 transition count 153
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 60 place count 53 transition count 145
Iterating global reduction 2 with 4 rules applied. Total rules applied 64 place count 53 transition count 145
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 66 place count 51 transition count 139
Iterating global reduction 2 with 2 rules applied. Total rules applied 68 place count 51 transition count 139
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 69 place count 50 transition count 137
Iterating global reduction 2 with 1 rules applied. Total rules applied 70 place count 50 transition count 137
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 76 place count 50 transition count 131
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 82 place count 47 transition count 139
Partial Free-agglomeration rule applied 14 times.
Drop transitions (Partial Free agglomeration) removed 14 transitions
Iterating global reduction 3 with 14 rules applied. Total rules applied 96 place count 47 transition count 139
Partial Free-agglomeration rule applied 13 times.
Drop transitions (Partial Free agglomeration) removed 13 transitions
Iterating global reduction 3 with 13 rules applied. Total rules applied 109 place count 47 transition count 139
Applied a total of 109 rules in 53 ms. Remains 47 /93 variables (removed 46) and now considering 139/204 (removed 65) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 53 ms. Remains : 47/93 places, 139/204 transitions.
RANDOM walk for 4000000 steps (289291 resets) in 12706 ms. (314 steps per ms) remains 3/9 properties
BEST_FIRST walk for 3166949 steps (40684 resets) in 4034 ms. (784 steps per ms) remains 0/3 properties
Able to resolve query StableMarking after proving 134 properties.
FORMULA StableMarking FALSE TECHNIQUES RANDOM_WALK PARIKH_WALK MARKED_SUFFIX_TEST TRIVIAL_UNMARKED_SCC_TEST BESTFIRST_WALK TOPOLOGICAL
Total runtime 34236 ms.
ITS solved all properties within timeout

BK_STOP 1717194095526

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination 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-13"
export BK_EXAMINATION="StableMarking"
export BK_TOOL="ltsminxred"
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 ltsminxred"
echo " Input is HealthRecord-PT-13, 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 r498-tall-171640618000498"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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