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

--------------------
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 1717194096191

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-15
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-05-31 22:21:37] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, StableMarking, -timeout, 180, -rebuildPNML]
[2024-05-31 22:21:37] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-31 22:21:37] [INFO ] Load time of PNML (sax parser for PT used): 72 ms
[2024-05-31 22:21:37] [INFO ] Transformed 163 places.
[2024-05-31 22:21:37] [INFO ] Transformed 348 transitions.
[2024-05-31 22:21:37] [INFO ] Found NUPN structural information;
[2024-05-31 22:21:37] [INFO ] Parsed PT model containing 163 places and 348 transitions and 919 arcs in 169 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 20 ms.
Ensure Unique test removed 32 transitions
Reduce redundant transitions removed 32 transitions.
RANDOM walk for 40000 steps (3705 resets) in 1677 ms. (23 steps per ms) remains 66/135 properties
BEST_FIRST walk for 4003 steps (43 resets) in 28 ms. (138 steps per ms) remains 66/66 properties
BEST_FIRST walk for 4004 steps (47 resets) in 20 ms. (190 steps per ms) remains 66/66 properties
BEST_FIRST walk for 4004 steps (48 resets) in 22 ms. (174 steps per ms) remains 66/66 properties
BEST_FIRST walk for 4003 steps (45 resets) in 18 ms. (210 steps per ms) remains 66/66 properties
BEST_FIRST walk for 4004 steps (45 resets) in 19 ms. (200 steps per ms) remains 66/66 properties
BEST_FIRST walk for 4003 steps (47 resets) in 39 ms. (100 steps per ms) remains 66/66 properties
BEST_FIRST walk for 4003 steps (45 resets) in 20 ms. (190 steps per ms) remains 66/66 properties
BEST_FIRST walk for 4003 steps (46 resets) in 30 ms. (129 steps per ms) remains 66/66 properties
BEST_FIRST walk for 4003 steps (46 resets) in 16 ms. (235 steps per ms) remains 66/66 properties
BEST_FIRST walk for 4003 steps (42 resets) in 16 ms. (235 steps per ms) remains 66/66 properties
BEST_FIRST walk for 4002 steps (48 resets) in 11 ms. (333 steps per ms) remains 64/66 properties
BEST_FIRST walk for 4003 steps (47 resets) in 9 ms. (400 steps per ms) remains 64/64 properties
BEST_FIRST walk for 4002 steps (46 resets) in 15 ms. (250 steps per ms) remains 64/64 properties
BEST_FIRST walk for 4004 steps (43 resets) in 14 ms. (266 steps per ms) remains 64/64 properties
BEST_FIRST walk for 4003 steps (47 resets) in 12 ms. (307 steps per ms) remains 64/64 properties
BEST_FIRST walk for 4002 steps (46 resets) in 9 ms. (400 steps per ms) remains 63/64 properties
BEST_FIRST walk for 4004 steps (46 resets) in 17 ms. (222 steps per ms) remains 63/63 properties
BEST_FIRST walk for 4004 steps (47 resets) in 15 ms. (250 steps per ms) remains 63/63 properties
BEST_FIRST walk for 4004 steps (47 resets) in 15 ms. (250 steps per ms) remains 63/63 properties
BEST_FIRST walk for 4004 steps (49 resets) in 13 ms. (286 steps per ms) remains 63/63 properties
BEST_FIRST walk for 4004 steps (46 resets) in 14 ms. (266 steps per ms) remains 63/63 properties
BEST_FIRST walk for 4003 steps (44 resets) in 10 ms. (363 steps per ms) remains 62/63 properties
BEST_FIRST walk for 4004 steps (47 resets) in 11 ms. (333 steps per ms) remains 62/62 properties
BEST_FIRST walk for 4003 steps (45 resets) in 13 ms. (285 steps per ms) remains 62/62 properties
BEST_FIRST walk for 4003 steps (46 resets) in 13 ms. (285 steps per ms) remains 62/62 properties
BEST_FIRST walk for 4003 steps (46 resets) in 22 ms. (174 steps per ms) remains 62/62 properties
BEST_FIRST walk for 4004 steps (45 resets) in 11 ms. (333 steps per ms) remains 62/62 properties
BEST_FIRST walk for 4003 steps (48 resets) in 10 ms. (363 steps per ms) remains 62/62 properties
BEST_FIRST walk for 4003 steps (44 resets) in 12 ms. (307 steps per ms) remains 61/62 properties
BEST_FIRST walk for 4003 steps (47 resets) in 10 ms. (363 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4004 steps (47 resets) in 11 ms. (333 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4004 steps (46 resets) in 10 ms. (364 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4004 steps (46 resets) in 10 ms. (364 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4004 steps (45 resets) in 11 ms. (333 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4004 steps (48 resets) in 9 ms. (400 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4003 steps (45 resets) in 11 ms. (333 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4004 steps (47 resets) in 10 ms. (364 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4004 steps (49 resets) in 10 ms. (364 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4004 steps (45 resets) in 11 ms. (333 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4004 steps (44 resets) in 9 ms. (400 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4003 steps (48 resets) in 11 ms. (333 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4004 steps (48 resets) in 9 ms. (400 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4003 steps (47 resets) in 13 ms. (285 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4004 steps (46 resets) in 10 ms. (364 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4002 steps (46 resets) in 9 ms. (400 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4003 steps (48 resets) in 11 ms. (333 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4004 steps (48 resets) in 8 ms. (444 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4003 steps (45 resets) in 10 ms. (363 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4003 steps (47 resets) in 11 ms. (333 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4004 steps (46 resets) in 10 ms. (364 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4003 steps (42 resets) in 12 ms. (307 steps per ms) remains 60/61 properties
BEST_FIRST walk for 4002 steps (44 resets) in 9 ms. (400 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4003 steps (44 resets) in 9 ms. (400 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4004 steps (44 resets) in 9 ms. (400 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4004 steps (45 resets) in 8 ms. (444 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4004 steps (46 resets) in 8 ms. (444 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4004 steps (44 resets) in 14 ms. (266 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4003 steps (47 resets) in 9 ms. (400 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4002 steps (47 resets) in 9 ms. (400 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4004 steps (49 resets) in 10 ms. (364 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4003 steps (48 resets) in 9 ms. (400 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4004 steps (47 resets) in 9 ms. (400 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4003 steps (47 resets) in 9 ms. (400 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4004 steps (51 resets) in 10 ms. (364 steps per ms) remains 60/60 properties
[2024-05-31 22:21:38] [INFO ] Flow matrix only has 301 transitions (discarded 15 similar events)
// Phase 1: matrix 301 rows 160 cols
[2024-05-31 22:21:38] [INFO ] Computed 18 invariants in 16 ms
[2024-05-31 22:21:38] [INFO ] State equation strengthened by 1 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 60/60 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/60 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 2 (OVERLAPS) 39/99 variables, 10/70 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/99 variables, 39/109 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/99 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 5 (OVERLAPS) 61/160 variables, 8/117 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/160 variables, 61/178 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/160 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 8 (OVERLAPS) 300/460 variables, 160/338 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/460 variables, 0/338 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 10 (OVERLAPS) 1/461 variables, 1/339 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/461 variables, 0/339 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 12 (OVERLAPS) 0/461 variables, 0/339 constraints. Problems are: Problem set: 0 solved, 60 unsolved
No progress, stopping.
After SMT solving in domain Real declared 461/461 variables, and 339 constraints, problems are : Problem set: 0 solved, 60 unsolved in 2052 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: 60/60 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 60 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 60/60 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/60 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 2 (OVERLAPS) 39/99 variables, 10/70 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/99 variables, 39/109 constraints. Problems are: Problem set: 0 solved, 60 unsolved
[2024-05-31 22:21:40] [INFO ] Deduced a trap composed of 25 places in 61 ms of which 14 ms to minimize.
[2024-05-31 22:21:40] [INFO ] Deduced a trap composed of 43 places in 45 ms of which 1 ms to minimize.
[2024-05-31 22:21:40] [INFO ] Deduced a trap composed of 37 places in 44 ms of which 1 ms to minimize.
[2024-05-31 22:21:41] [INFO ] Deduced a trap composed of 40 places in 43 ms of which 1 ms to minimize.
[2024-05-31 22:21:41] [INFO ] Deduced a trap composed of 39 places in 44 ms of which 1 ms to minimize.
[2024-05-31 22:21:41] [INFO ] Deduced a trap composed of 41 places in 57 ms of which 1 ms to minimize.
[2024-05-31 22:21:41] [INFO ] Deduced a trap composed of 39 places in 40 ms of which 1 ms to minimize.
[2024-05-31 22:21:41] [INFO ] Deduced a trap composed of 22 places in 25 ms of which 1 ms to minimize.
[2024-05-31 22:21:41] [INFO ] Deduced a trap composed of 40 places in 40 ms of which 1 ms to minimize.
[2024-05-31 22:21:41] [INFO ] Deduced a trap composed of 41 places in 34 ms of which 1 ms to minimize.
[2024-05-31 22:21:41] [INFO ] Deduced a trap composed of 41 places in 37 ms of which 1 ms to minimize.
[2024-05-31 22:21:41] [INFO ] Deduced a trap composed of 38 places in 64 ms of which 1 ms to minimize.
[2024-05-31 22:21:41] [INFO ] Deduced a trap composed of 40 places in 47 ms of which 1 ms to minimize.
[2024-05-31 22:21:41] [INFO ] Deduced a trap composed of 39 places in 36 ms of which 1 ms to minimize.
[2024-05-31 22:21:41] [INFO ] Deduced a trap composed of 39 places in 35 ms of which 3 ms to minimize.
[2024-05-31 22:21:41] [INFO ] Deduced a trap composed of 41 places in 30 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/99 variables, 16/125 constraints. Problems are: Problem set: 0 solved, 60 unsolved
[2024-05-31 22:21:41] [INFO ] Deduced a trap composed of 37 places in 38 ms of which 1 ms to minimize.
[2024-05-31 22:21:41] [INFO ] Deduced a trap composed of 40 places in 44 ms of which 0 ms to minimize.
[2024-05-31 22:21:41] [INFO ] Deduced a trap composed of 42 places in 39 ms of which 1 ms to minimize.
[2024-05-31 22:21:41] [INFO ] Deduced a trap composed of 40 places in 41 ms of which 5 ms to minimize.
[2024-05-31 22:21:41] [INFO ] Deduced a trap composed of 42 places in 36 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/99 variables, 5/130 constraints. Problems are: Problem set: 0 solved, 60 unsolved
[2024-05-31 22:21:42] [INFO ] Deduced a trap composed of 41 places in 41 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/99 variables, 1/131 constraints. Problems are: Problem set: 0 solved, 60 unsolved
[2024-05-31 22:21:42] [INFO ] Deduced a trap composed of 42 places in 40 ms of which 1 ms to minimize.
[2024-05-31 22:21:42] [INFO ] Deduced a trap composed of 44 places in 32 ms of which 1 ms to minimize.
[2024-05-31 22:21:42] [INFO ] Deduced a trap composed of 42 places in 47 ms of which 0 ms to minimize.
[2024-05-31 22:21:42] [INFO ] Deduced a trap composed of 43 places in 32 ms of which 0 ms to minimize.
[2024-05-31 22:21:42] [INFO ] Deduced a trap composed of 43 places in 31 ms of which 0 ms to minimize.
[2024-05-31 22:21:42] [INFO ] Deduced a trap composed of 40 places in 38 ms of which 1 ms to minimize.
[2024-05-31 22:21:42] [INFO ] Deduced a trap composed of 38 places in 31 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/99 variables, 7/138 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/99 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 9 (OVERLAPS) 61/160 variables, 8/146 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/160 variables, 61/207 constraints. Problems are: Problem set: 0 solved, 60 unsolved
[2024-05-31 22:21:42] [INFO ] Deduced a trap composed of 46 places in 93 ms of which 1 ms to minimize.
[2024-05-31 22:21:42] [INFO ] Deduced a trap composed of 46 places in 57 ms of which 1 ms to minimize.
[2024-05-31 22:21:43] [INFO ] Deduced a trap composed of 40 places in 51 ms of which 1 ms to minimize.
[2024-05-31 22:21:43] [INFO ] Deduced a trap composed of 46 places in 51 ms of which 1 ms to minimize.
[2024-05-31 22:21:43] [INFO ] Deduced a trap composed of 45 places in 64 ms of which 2 ms to minimize.
[2024-05-31 22:21:43] [INFO ] Deduced a trap composed of 47 places in 56 ms of which 4 ms to minimize.
[2024-05-31 22:21:43] [INFO ] Deduced a trap composed of 45 places in 69 ms of which 2 ms to minimize.
[2024-05-31 22:21:43] [INFO ] Deduced a trap composed of 46 places in 55 ms of which 1 ms to minimize.
[2024-05-31 22:21:43] [INFO ] Deduced a trap composed of 31 places in 38 ms of which 1 ms to minimize.
[2024-05-31 22:21:43] [INFO ] Deduced a trap composed of 45 places in 43 ms of which 1 ms to minimize.
[2024-05-31 22:21:43] [INFO ] Deduced a trap composed of 45 places in 56 ms of which 1 ms to minimize.
[2024-05-31 22:21:43] [INFO ] Deduced a trap composed of 46 places in 53 ms of which 1 ms to minimize.
[2024-05-31 22:21:43] [INFO ] Deduced a trap composed of 32 places in 60 ms of which 1 ms to minimize.
[2024-05-31 22:21:43] [INFO ] Deduced a trap composed of 31 places in 53 ms of which 1 ms to minimize.
[2024-05-31 22:21:43] [INFO ] Deduced a trap composed of 44 places in 51 ms of which 1 ms to minimize.
[2024-05-31 22:21:43] [INFO ] Deduced a trap composed of 31 places in 36 ms of which 0 ms to minimize.
[2024-05-31 22:21:43] [INFO ] Deduced a trap composed of 47 places in 53 ms of which 1 ms to minimize.
[2024-05-31 22:21:43] [INFO ] Deduced a trap composed of 45 places in 46 ms of which 1 ms to minimize.
[2024-05-31 22:21:43] [INFO ] Deduced a trap composed of 47 places in 48 ms of which 1 ms to minimize.
[2024-05-31 22:21:43] [INFO ] Deduced a trap composed of 31 places in 33 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/160 variables, 20/227 constraints. Problems are: Problem set: 0 solved, 60 unsolved
[2024-05-31 22:21:44] [INFO ] Deduced a trap composed of 41 places in 55 ms of which 1 ms to minimize.
[2024-05-31 22:21:44] [INFO ] Deduced a trap composed of 30 places in 46 ms of which 1 ms to minimize.
[2024-05-31 22:21:44] [INFO ] Deduced a trap composed of 47 places in 47 ms of which 1 ms to minimize.
[2024-05-31 22:21:44] [INFO ] Deduced a trap composed of 45 places in 47 ms of which 1 ms to minimize.
[2024-05-31 22:21:44] [INFO ] Deduced a trap composed of 47 places in 47 ms of which 1 ms to minimize.
[2024-05-31 22:21:44] [INFO ] Deduced a trap composed of 48 places in 50 ms of which 1 ms to minimize.
[2024-05-31 22:21:44] [INFO ] Deduced a trap composed of 30 places in 46 ms of which 1 ms to minimize.
[2024-05-31 22:21:44] [INFO ] Deduced a trap composed of 41 places in 47 ms of which 5 ms to minimize.
[2024-05-31 22:21:44] [INFO ] Deduced a trap composed of 30 places in 44 ms of which 1 ms to minimize.
[2024-05-31 22:21:44] [INFO ] Deduced a trap composed of 30 places in 44 ms of which 1 ms to minimize.
[2024-05-31 22:21:44] [INFO ] Deduced a trap composed of 40 places in 49 ms of which 1 ms to minimize.
[2024-05-31 22:21:44] [INFO ] Deduced a trap composed of 40 places in 50 ms of which 1 ms to minimize.
[2024-05-31 22:21:44] [INFO ] Deduced a trap composed of 46 places in 45 ms of which 1 ms to minimize.
[2024-05-31 22:21:44] [INFO ] Deduced a trap composed of 46 places in 46 ms of which 1 ms to minimize.
[2024-05-31 22:21:44] [INFO ] Deduced a trap composed of 40 places in 41 ms of which 1 ms to minimize.
[2024-05-31 22:21:44] [INFO ] Deduced a trap composed of 39 places in 42 ms of which 0 ms to minimize.
[2024-05-31 22:21:44] [INFO ] Deduced a trap composed of 30 places in 43 ms of which 1 ms to minimize.
[2024-05-31 22:21:44] [INFO ] Deduced a trap composed of 40 places in 48 ms of which 1 ms to minimize.
[2024-05-31 22:21:45] [INFO ] Deduced a trap composed of 38 places in 47 ms of which 1 ms to minimize.
[2024-05-31 22:21:45] [INFO ] Deduced a trap composed of 31 places in 30 ms of which 0 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/160 variables, 20/247 constraints. Problems are: Problem set: 0 solved, 60 unsolved
[2024-05-31 22:21:45] [INFO ] Deduced a trap composed of 43 places in 49 ms of which 0 ms to minimize.
[2024-05-31 22:21:45] [INFO ] Deduced a trap composed of 30 places in 41 ms of which 1 ms to minimize.
[2024-05-31 22:21:45] [INFO ] Deduced a trap composed of 44 places in 47 ms of which 1 ms to minimize.
[2024-05-31 22:21:45] [INFO ] Deduced a trap composed of 46 places in 46 ms of which 1 ms to minimize.
[2024-05-31 22:21:45] [INFO ] Deduced a trap composed of 40 places in 47 ms of which 1 ms to minimize.
[2024-05-31 22:21:45] [INFO ] Deduced a trap composed of 30 places in 44 ms of which 1 ms to minimize.
[2024-05-31 22:21:45] [INFO ] Deduced a trap composed of 39 places in 41 ms of which 1 ms to minimize.
[2024-05-31 22:21:45] [INFO ] Deduced a trap composed of 39 places in 41 ms of which 1 ms to minimize.
[2024-05-31 22:21:45] [INFO ] Deduced a trap composed of 41 places in 48 ms of which 1 ms to minimize.
[2024-05-31 22:21:45] [INFO ] Deduced a trap composed of 44 places in 52 ms of which 0 ms to minimize.
SMT process timed out in 7178ms, After SMT, problems are : Problem set: 0 solved, 60 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 60 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 48 places :
Symmetric choice reduction at 1 with 48 rule applications. Total rules 64 place count 112 transition count 204
Iterating global reduction 1 with 48 rules applied. Total rules applied 112 place count 112 transition count 204
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 115 place count 109 transition count 198
Iterating global reduction 1 with 3 rules applied. Total rules applied 118 place count 109 transition count 198
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 119 place count 109 transition count 197
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 2 with 14 rules applied. Total rules applied 133 place count 102 transition count 231
Drop transitions (Redundant composition of simpler transitions.) removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 2 with 7 rules applied. Total rules applied 140 place count 102 transition count 224
Free-agglomeration rule applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 142 place count 102 transition count 222
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 144 place count 100 transition count 222
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 145 place count 100 transition count 222
Applied a total of 145 rules in 54 ms. Remains 100 /160 variables (removed 60) and now considering 222/316 (removed 94) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61 ms. Remains : 100/160 places, 222/316 transitions.
RANDOM walk for 4000000 steps (726478 resets) in 19675 ms. (203 steps per ms) remains 38/60 properties
BEST_FIRST walk for 400004 steps (10992 resets) in 352 ms. (1133 steps per ms) remains 38/38 properties
BEST_FIRST walk for 400003 steps (10942 resets) in 351 ms. (1136 steps per ms) remains 38/38 properties
BEST_FIRST walk for 400003 steps (10984 resets) in 353 ms. (1129 steps per ms) remains 38/38 properties
BEST_FIRST walk for 400004 steps (10984 resets) in 360 ms. (1108 steps per ms) remains 38/38 properties
BEST_FIRST walk for 400002 steps (11046 resets) in 358 ms. (1114 steps per ms) remains 38/38 properties
BEST_FIRST walk for 400004 steps (10968 resets) in 354 ms. (1126 steps per ms) remains 38/38 properties
BEST_FIRST walk for 400002 steps (11017 resets) in 358 ms. (1114 steps per ms) remains 38/38 properties
BEST_FIRST walk for 400003 steps (10901 resets) in 354 ms. (1126 steps per ms) remains 38/38 properties
BEST_FIRST walk for 400003 steps (10984 resets) in 351 ms. (1136 steps per ms) remains 38/38 properties
BEST_FIRST walk for 400003 steps (10987 resets) in 355 ms. (1123 steps per ms) remains 38/38 properties
BEST_FIRST walk for 400003 steps (11014 resets) in 359 ms. (1111 steps per ms) remains 38/38 properties
BEST_FIRST walk for 400003 steps (10954 resets) in 350 ms. (1139 steps per ms) remains 38/38 properties
BEST_FIRST walk for 400003 steps (10928 resets) in 346 ms. (1152 steps per ms) remains 38/38 properties
BEST_FIRST walk for 400004 steps (11039 resets) in 347 ms. (1149 steps per ms) remains 38/38 properties
BEST_FIRST walk for 400004 steps (10970 resets) in 353 ms. (1129 steps per ms) remains 38/38 properties
BEST_FIRST walk for 400003 steps (10932 resets) in 360 ms. (1108 steps per ms) remains 38/38 properties
BEST_FIRST walk for 400004 steps (11019 resets) in 361 ms. (1104 steps per ms) remains 38/38 properties
BEST_FIRST walk for 400003 steps (10930 resets) in 352 ms. (1133 steps per ms) remains 38/38 properties
BEST_FIRST walk for 400004 steps (10942 resets) in 353 ms. (1129 steps per ms) remains 38/38 properties
BEST_FIRST walk for 400004 steps (10992 resets) in 349 ms. (1142 steps per ms) remains 38/38 properties
BEST_FIRST walk for 400004 steps (10949 resets) in 345 ms. (1156 steps per ms) remains 38/38 properties
BEST_FIRST walk for 400004 steps (10954 resets) in 345 ms. (1156 steps per ms) remains 38/38 properties
BEST_FIRST walk for 400003 steps (10967 resets) in 351 ms. (1136 steps per ms) remains 38/38 properties
BEST_FIRST walk for 400003 steps (10984 resets) in 358 ms. (1114 steps per ms) remains 38/38 properties
BEST_FIRST walk for 400004 steps (11018 resets) in 352 ms. (1133 steps per ms) remains 38/38 properties
BEST_FIRST walk for 400003 steps (10943 resets) in 351 ms. (1136 steps per ms) remains 38/38 properties
BEST_FIRST walk for 400004 steps (10955 resets) in 354 ms. (1126 steps per ms) remains 38/38 properties
BEST_FIRST walk for 400004 steps (10955 resets) in 352 ms. (1133 steps per ms) remains 38/38 properties
BEST_FIRST walk for 400003 steps (10947 resets) in 352 ms. (1133 steps per ms) remains 38/38 properties
BEST_FIRST walk for 400004 steps (10975 resets) in 353 ms. (1129 steps per ms) remains 38/38 properties
BEST_FIRST walk for 400003 steps (10947 resets) in 344 ms. (1159 steps per ms) remains 38/38 properties
BEST_FIRST walk for 400004 steps (10991 resets) in 348 ms. (1146 steps per ms) remains 38/38 properties
BEST_FIRST walk for 400004 steps (10971 resets) in 341 ms. (1169 steps per ms) remains 38/38 properties
BEST_FIRST walk for 400003 steps (10990 resets) in 359 ms. (1111 steps per ms) remains 38/38 properties
BEST_FIRST walk for 400004 steps (11020 resets) in 359 ms. (1111 steps per ms) remains 38/38 properties
BEST_FIRST walk for 400004 steps (11100 resets) in 360 ms. (1108 steps per ms) remains 38/38 properties
BEST_FIRST walk for 400004 steps (10918 resets) in 349 ms. (1142 steps per ms) remains 38/38 properties
BEST_FIRST walk for 400004 steps (10897 resets) in 355 ms. (1123 steps per ms) remains 38/38 properties
[2024-05-31 22:21:55] [INFO ] Flow matrix only has 200 transitions (discarded 22 similar events)
// Phase 1: matrix 200 rows 100 cols
[2024-05-31 22:21:55] [INFO ] Computed 18 invariants in 2 ms
[2024-05-31 22:21:55] [INFO ] State equation strengthened by 9 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) 39/77 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/77 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 3 (OVERLAPS) 23/100 variables, 8/18 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/100 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 5 (OVERLAPS) 200/300 variables, 100/118 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/300 variables, 9/127 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/300 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 8 (OVERLAPS) 0/300 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 38 unsolved
No progress, stopping.
After SMT solving in domain Real declared 300/300 variables, and 127 constraints, problems are : Problem set: 0 solved, 38 unsolved in 707 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 100/100 constraints, ReadFeed: 9/9 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) 39/77 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 38 unsolved
[2024-05-31 22:21:56] [INFO ] Deduced a trap composed of 25 places in 36 ms of which 1 ms to minimize.
[2024-05-31 22:21:56] [INFO ] Deduced a trap composed of 25 places in 33 ms of which 1 ms to minimize.
[2024-05-31 22:21:56] [INFO ] Deduced a trap composed of 15 places in 34 ms of which 1 ms to minimize.
[2024-05-31 22:21:56] [INFO ] Deduced a trap composed of 25 places in 39 ms of which 1 ms to minimize.
[2024-05-31 22:21:56] [INFO ] Deduced a trap composed of 25 places in 39 ms of which 0 ms to minimize.
[2024-05-31 22:21:56] [INFO ] Deduced a trap composed of 25 places in 35 ms of which 1 ms to minimize.
[2024-05-31 22:21:56] [INFO ] Deduced a trap composed of 25 places in 36 ms of which 1 ms to minimize.
[2024-05-31 22:21:56] [INFO ] Deduced a trap composed of 34 places in 29 ms of which 1 ms to minimize.
[2024-05-31 22:21:56] [INFO ] Deduced a trap composed of 25 places in 33 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/77 variables, 9/19 constraints. Problems are: Problem set: 0 solved, 38 unsolved
[2024-05-31 22:21:56] [INFO ] Deduced a trap composed of 24 places in 40 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/77 variables, 1/20 constraints. Problems are: Problem set: 0 solved, 38 unsolved
[2024-05-31 22:21:56] [INFO ] Deduced a trap composed of 23 places in 34 ms of which 1 ms to minimize.
[2024-05-31 22:21:56] [INFO ] Deduced a trap composed of 25 places in 41 ms of which 0 ms to minimize.
[2024-05-31 22:21:56] [INFO ] Deduced a trap composed of 24 places in 32 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/77 variables, 3/23 constraints. Problems are: Problem set: 0 solved, 38 unsolved
[2024-05-31 22:21:56] [INFO ] Deduced a trap composed of 25 places in 41 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/77 variables, 1/24 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/77 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 7 (OVERLAPS) 23/100 variables, 8/32 constraints. Problems are: Problem set: 0 solved, 38 unsolved
[2024-05-31 22:21:56] [INFO ] Deduced a trap composed of 28 places in 44 ms of which 1 ms to minimize.
[2024-05-31 22:21:56] [INFO ] Deduced a trap composed of 32 places in 43 ms of which 0 ms to minimize.
[2024-05-31 22:21:56] [INFO ] Deduced a trap composed of 33 places in 36 ms of which 1 ms to minimize.
[2024-05-31 22:21:57] [INFO ] Deduced a trap composed of 15 places in 27 ms of which 1 ms to minimize.
[2024-05-31 22:21:57] [INFO ] Deduced a trap composed of 18 places in 28 ms of which 0 ms to minimize.
[2024-05-31 22:21:57] [INFO ] Deduced a trap composed of 13 places in 25 ms of which 1 ms to minimize.
[2024-05-31 22:21:57] [INFO ] Deduced a trap composed of 16 places in 22 ms of which 1 ms to minimize.
[2024-05-31 22:21:57] [INFO ] Deduced a trap composed of 33 places in 36 ms of which 1 ms to minimize.
[2024-05-31 22:21:57] [INFO ] Deduced a trap composed of 32 places in 43 ms of which 0 ms to minimize.
[2024-05-31 22:21:57] [INFO ] Deduced a trap composed of 33 places in 38 ms of which 1 ms to minimize.
[2024-05-31 22:21:57] [INFO ] Deduced a trap composed of 19 places in 37 ms of which 0 ms to minimize.
[2024-05-31 22:21:57] [INFO ] Deduced a trap composed of 18 places in 38 ms of which 1 ms to minimize.
[2024-05-31 22:21:57] [INFO ] Deduced a trap composed of 16 places in 27 ms of which 1 ms to minimize.
[2024-05-31 22:21:57] [INFO ] Deduced a trap composed of 16 places in 28 ms of which 1 ms to minimize.
[2024-05-31 22:21:57] [INFO ] Deduced a trap composed of 16 places in 26 ms of which 0 ms to minimize.
[2024-05-31 22:21:57] [INFO ] Deduced a trap composed of 15 places in 36 ms of which 0 ms to minimize.
[2024-05-31 22:21:57] [INFO ] Deduced a trap composed of 16 places in 26 ms of which 1 ms to minimize.
[2024-05-31 22:21:57] [INFO ] Deduced a trap composed of 16 places in 39 ms of which 0 ms to minimize.
[2024-05-31 22:21:57] [INFO ] Deduced a trap composed of 32 places in 40 ms of which 1 ms to minimize.
[2024-05-31 22:21:57] [INFO ] Deduced a trap composed of 32 places in 40 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/100 variables, 20/52 constraints. Problems are: Problem set: 0 solved, 38 unsolved
[2024-05-31 22:21:57] [INFO ] Deduced a trap composed of 32 places in 44 ms of which 0 ms to minimize.
[2024-05-31 22:21:57] [INFO ] Deduced a trap composed of 34 places in 39 ms of which 1 ms to minimize.
[2024-05-31 22:21:57] [INFO ] Deduced a trap composed of 33 places in 39 ms of which 1 ms to minimize.
[2024-05-31 22:21:57] [INFO ] Deduced a trap composed of 15 places in 26 ms of which 1 ms to minimize.
[2024-05-31 22:21:57] [INFO ] Deduced a trap composed of 29 places in 45 ms of which 1 ms to minimize.
[2024-05-31 22:21:57] [INFO ] Deduced a trap composed of 32 places in 39 ms of which 1 ms to minimize.
[2024-05-31 22:21:57] [INFO ] Deduced a trap composed of 17 places in 36 ms of which 0 ms to minimize.
[2024-05-31 22:21:58] [INFO ] Deduced a trap composed of 34 places in 41 ms of which 1 ms to minimize.
[2024-05-31 22:21:58] [INFO ] Deduced a trap composed of 34 places in 36 ms of which 1 ms to minimize.
[2024-05-31 22:21:58] [INFO ] Deduced a trap composed of 18 places in 33 ms of which 1 ms to minimize.
[2024-05-31 22:21:58] [INFO ] Deduced a trap composed of 18 places in 31 ms of which 1 ms to minimize.
[2024-05-31 22:21:58] [INFO ] Deduced a trap composed of 16 places in 30 ms of which 1 ms to minimize.
[2024-05-31 22:21:58] [INFO ] Deduced a trap composed of 33 places in 45 ms of which 1 ms to minimize.
[2024-05-31 22:21:58] [INFO ] Deduced a trap composed of 18 places in 26 ms of which 1 ms to minimize.
[2024-05-31 22:21:58] [INFO ] Deduced a trap composed of 34 places in 32 ms of which 0 ms to minimize.
[2024-05-31 22:21:58] [INFO ] Deduced a trap composed of 32 places in 39 ms of which 1 ms to minimize.
[2024-05-31 22:21:58] [INFO ] Deduced a trap composed of 33 places in 35 ms of which 1 ms to minimize.
[2024-05-31 22:21:58] [INFO ] Deduced a trap composed of 32 places in 39 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/100 variables, 18/70 constraints. Problems are: Problem set: 0 solved, 38 unsolved
[2024-05-31 22:21:58] [INFO ] Deduced a trap composed of 16 places in 27 ms of which 0 ms to minimize.
[2024-05-31 22:21:58] [INFO ] Deduced a trap composed of 16 places in 23 ms of which 1 ms to minimize.
[2024-05-31 22:21:58] [INFO ] Deduced a trap composed of 16 places in 28 ms of which 0 ms to minimize.
[2024-05-31 22:21:58] [INFO ] Deduced a trap composed of 15 places in 28 ms of which 1 ms to minimize.
[2024-05-31 22:21:58] [INFO ] Deduced a trap composed of 18 places in 27 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/100 variables, 5/75 constraints. Problems are: Problem set: 0 solved, 38 unsolved
[2024-05-31 22:21:58] [INFO ] Deduced a trap composed of 27 places in 45 ms of which 1 ms to minimize.
[2024-05-31 22:21:58] [INFO ] Deduced a trap composed of 16 places in 27 ms of which 1 ms to minimize.
[2024-05-31 22:21:58] [INFO ] Deduced a trap composed of 16 places in 39 ms of which 0 ms to minimize.
[2024-05-31 22:21:58] [INFO ] Deduced a trap composed of 15 places in 21 ms of which 1 ms to minimize.
[2024-05-31 22:21:58] [INFO ] Deduced a trap composed of 29 places in 40 ms of which 0 ms to minimize.
[2024-05-31 22:21:59] [INFO ] Deduced a trap composed of 15 places in 27 ms of which 1 ms to minimize.
[2024-05-31 22:21:59] [INFO ] Deduced a trap composed of 32 places in 43 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/100 variables, 7/82 constraints. Problems are: Problem set: 0 solved, 38 unsolved
[2024-05-31 22:21:59] [INFO ] Deduced a trap composed of 28 places in 44 ms of which 1 ms to minimize.
[2024-05-31 22:21:59] [INFO ] Deduced a trap composed of 16 places in 45 ms of which 0 ms to minimize.
[2024-05-31 22:21:59] [INFO ] Deduced a trap composed of 15 places in 23 ms of which 1 ms to minimize.
[2024-05-31 22:21:59] [INFO ] Deduced a trap composed of 34 places in 40 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/100 variables, 4/86 constraints. Problems are: Problem set: 0 solved, 38 unsolved
[2024-05-31 22:21:59] [INFO ] Deduced a trap composed of 27 places in 49 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/100 variables, 1/87 constraints. Problems are: Problem set: 0 solved, 38 unsolved
[2024-05-31 22:21:59] [INFO ] Deduced a trap composed of 27 places in 40 ms of which 1 ms to minimize.
[2024-05-31 22:21:59] [INFO ] Deduced a trap composed of 33 places in 32 ms of which 1 ms to minimize.
[2024-05-31 22:21:59] [INFO ] Deduced a trap composed of 16 places in 32 ms of which 1 ms to minimize.
[2024-05-31 22:21:59] [INFO ] Deduced a trap composed of 28 places in 36 ms of which 1 ms to minimize.
[2024-05-31 22:21:59] [INFO ] Deduced a trap composed of 27 places in 35 ms of which 1 ms to minimize.
[2024-05-31 22:21:59] [INFO ] Deduced a trap composed of 28 places in 43 ms of which 1 ms to minimize.
[2024-05-31 22:21:59] [INFO ] Deduced a trap composed of 18 places in 26 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/100 variables, 7/94 constraints. Problems are: Problem set: 0 solved, 38 unsolved
[2024-05-31 22:22:00] [INFO ] Deduced a trap composed of 20 places in 33 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/100 variables, 1/95 constraints. Problems are: Problem set: 0 solved, 38 unsolved
[2024-05-31 22:22:00] [INFO ] Deduced a trap composed of 16 places in 36 ms of which 1 ms to minimize.
[2024-05-31 22:22:00] [INFO ] Deduced a trap composed of 15 places in 28 ms of which 0 ms to minimize.
[2024-05-31 22:22:00] [INFO ] Deduced a trap composed of 16 places in 25 ms of which 0 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/100 variables, 3/98 constraints. Problems are: Problem set: 0 solved, 38 unsolved
[2024-05-31 22:22:00] [INFO ] Deduced a trap composed of 16 places in 33 ms of which 0 ms to minimize.
[2024-05-31 22:22:00] [INFO ] Deduced a trap composed of 15 places in 30 ms of which 0 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/100 variables, 2/100 constraints. Problems are: Problem set: 0 solved, 38 unsolved
[2024-05-31 22:22:00] [INFO ] Deduced a trap composed of 15 places in 33 ms of which 0 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/100 variables, 1/101 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/100 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 20 (OVERLAPS) 200/300 variables, 100/201 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/300 variables, 9/210 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/300 variables, 38/248 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/300 variables, 0/248 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 24 (OVERLAPS) 0/300 variables, 0/248 constraints. Problems are: Problem set: 0 solved, 38 unsolved
No progress, stopping.
After SMT solving in domain Int declared 300/300 variables, and 248 constraints, problems are : Problem set: 0 solved, 38 unsolved in 6135 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 100/100 constraints, ReadFeed: 9/9 constraints, PredecessorRefiner: 38/38 constraints, Known Traps: 83/83 constraints]
After SMT, in 6858ms problems are : Problem set: 0 solved, 38 unsolved
Fused 38 Parikh solutions to 21 different solutions.
Parikh walk visited 35 properties in 1269 ms.
Support contains 3 out of 100 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 100/100 places, 222/222 transitions.
Graph (complete) has 515 edges and 100 vertex of which 91 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 91 transition count 218
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 87 transition count 217
Discarding 34 places :
Symmetric choice reduction at 2 with 34 rule applications. Total rules 44 place count 53 transition count 149
Iterating global reduction 2 with 34 rules applied. Total rules applied 78 place count 53 transition count 149
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 84 place count 47 transition count 137
Iterating global reduction 2 with 6 rules applied. Total rules applied 90 place count 47 transition count 137
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 94 place count 47 transition count 133
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 97 place count 44 transition count 124
Iterating global reduction 3 with 3 rules applied. Total rules applied 100 place count 44 transition count 124
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 103 place count 41 transition count 118
Iterating global reduction 3 with 3 rules applied. Total rules applied 106 place count 41 transition count 118
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 3 with 14 rules applied. Total rules applied 120 place count 41 transition count 104
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 122 place count 40 transition count 103
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -11
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 126 place count 38 transition count 114
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 130 place count 38 transition count 110
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 5 with 2 rules applied. Total rules applied 132 place count 38 transition count 108
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 5 with 1 rules applied. Total rules applied 133 place count 38 transition count 211
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 5 with 5 rules applied. Total rules applied 138 place count 37 transition count 207
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 139 place count 36 transition count 153
Iterating global reduction 6 with 1 rules applied. Total rules applied 140 place count 36 transition count 153
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 141 place count 35 transition count 151
Iterating global reduction 6 with 1 rules applied. Total rules applied 142 place count 35 transition count 151
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 6 with 10 rules applied. Total rules applied 152 place count 35 transition count 141
Partial Free-agglomeration rule applied 9 times.
Drop transitions (Partial Free agglomeration) removed 9 transitions
Iterating global reduction 7 with 9 rules applied. Total rules applied 161 place count 35 transition count 141
Partial Free-agglomeration rule applied 8 times.
Drop transitions (Partial Free agglomeration) removed 8 transitions
Iterating global reduction 7 with 8 rules applied. Total rules applied 169 place count 35 transition count 141
Applied a total of 169 rules in 63 ms. Remains 35 /100 variables (removed 65) and now considering 141/222 (removed 81) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 63 ms. Remains : 35/100 places, 141/222 transitions.
RANDOM walk for 3644110 steps (354906 resets) in 8240 ms. (442 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 28497 ms.
ITS solved all properties within timeout

BK_STOP 1717194125783

--------------------
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="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-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 r498-tall-171640618000508"
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 ;