Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r084-tall-174860080700477.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2025-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-5832
Executing tool gold2024
Input is EisenbergMcGuire-PT-04, examination is QuasiLiveness
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r084-tall-174860080700477
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 636K
-rw-r--r-- 1 mcc users 7.3K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 72K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.9K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.3K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 30K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.1K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 6.7K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 53K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 76K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 3 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 255K May 29 14:32 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 QuasiLiveness

=== Now, execution of the tool begins

BK_START 1748741150743

Invoking MCC driver with
BK_TOOL=gold2024
BK_EXAMINATION=QuasiLiveness
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=EisenbergMcGuire-PT-04
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2025-06-01 01:25:52] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, QuasiLiveness, -timeout, 180, -rebuildPNML]
[2025-06-01 01:25:52] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-01 01:25:52] [INFO ] Load time of PNML (sax parser for PT used): 93 ms
[2025-06-01 01:25:52] [INFO ] Transformed 196 places.
[2025-06-01 01:25:52] [INFO ] Transformed 448 transitions.
[2025-06-01 01:25:52] [INFO ] Found NUPN structural information;
[2025-06-01 01:25:52] [INFO ] Parsed PT model containing 196 places and 448 transitions and 1952 arcs in 209 ms.
Starting structural reductions in LIVENESS mode, iteration 0 : 196/196 places, 448/448 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 4 place count 196 transition count 444
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 8 place count 192 transition count 444
Performed 52 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 52 Pre rules applied. Total rules applied 8 place count 192 transition count 392
Deduced a syphon composed of 52 places in 2 ms
Reduce places removed 52 places and 0 transitions.
Iterating global reduction 2 with 104 rules applied. Total rules applied 112 place count 140 transition count 392
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 2 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 136 place count 128 transition count 380
Applied a total of 136 rules in 74 ms. Remains 128 /196 variables (removed 68) and now considering 380/448 (removed 68) transitions.
[2025-06-01 01:25:52] [INFO ] Flow matrix only has 216 transitions (discarded 164 similar events)
// Phase 1: matrix 216 rows 128 cols
[2025-06-01 01:25:52] [INFO ] Computed 13 invariants in 14 ms
[2025-06-01 01:25:53] [INFO ] Implicit Places using invariants in 374 ms returned []
[2025-06-01 01:25:53] [INFO ] Flow matrix only has 216 transitions (discarded 164 similar events)
[2025-06-01 01:25:53] [INFO ] Invariant cache hit.
[2025-06-01 01:25:53] [INFO ] State equation strengthened by 112 read => feed constraints.
[2025-06-01 01:25:53] [INFO ] Implicit Places using invariants and state equation in 352 ms returned []
Implicit Place search using SMT with State Equation took 764 ms to find 0 implicit places.
Running 376 sub problems to find dead transitions.
[2025-06-01 01:25:53] [INFO ] Flow matrix only has 216 transitions (discarded 164 similar events)
[2025-06-01 01:25:53] [INFO ] Invariant cache hit.
[2025-06-01 01:25:53] [INFO ] State equation strengthened by 112 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/128 variables, 128/128 constraints. Problems are: Problem set: 0 solved, 376 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/128 variables, 9/137 constraints. Problems are: Problem set: 0 solved, 376 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/128 variables, 4/141 constraints. Problems are: Problem set: 0 solved, 376 unsolved
[2025-06-01 01:25:55] [INFO ] Deduced a trap composed of 3 places in 107 ms of which 17 ms to minimize.
[2025-06-01 01:25:55] [INFO ] Deduced a trap composed of 3 places in 38 ms of which 0 ms to minimize.
[2025-06-01 01:25:55] [INFO ] Deduced a trap composed of 27 places in 54 ms of which 1 ms to minimize.
[2025-06-01 01:25:55] [INFO ] Deduced a trap composed of 41 places in 77 ms of which 1 ms to minimize.
[2025-06-01 01:25:55] [INFO ] Deduced a trap composed of 35 places in 74 ms of which 1 ms to minimize.
[2025-06-01 01:25:55] [INFO ] Deduced a trap composed of 27 places in 74 ms of which 2 ms to minimize.
[2025-06-01 01:25:55] [INFO ] Deduced a trap composed of 37 places in 73 ms of which 1 ms to minimize.
[2025-06-01 01:25:55] [INFO ] Deduced a trap composed of 30 places in 71 ms of which 2 ms to minimize.
[2025-06-01 01:25:55] [INFO ] Deduced a trap composed of 47 places in 71 ms of which 1 ms to minimize.
[2025-06-01 01:25:55] [INFO ] Deduced a trap composed of 42 places in 70 ms of which 2 ms to minimize.
[2025-06-01 01:25:56] [INFO ] Deduced a trap composed of 33 places in 70 ms of which 1 ms to minimize.
[2025-06-01 01:25:56] [INFO ] Deduced a trap composed of 30 places in 41 ms of which 1 ms to minimize.
[2025-06-01 01:25:56] [INFO ] Deduced a trap composed of 15 places in 40 ms of which 1 ms to minimize.
[2025-06-01 01:25:56] [INFO ] Deduced a trap composed of 5 places in 40 ms of which 1 ms to minimize.
[2025-06-01 01:25:56] [INFO ] Deduced a trap composed of 3 places in 42 ms of which 1 ms to minimize.
[2025-06-01 01:25:56] [INFO ] Deduced a trap composed of 3 places in 67 ms of which 1 ms to minimize.
[2025-06-01 01:25:56] [INFO ] Deduced a trap composed of 19 places in 66 ms of which 1 ms to minimize.
[2025-06-01 01:25:56] [INFO ] Deduced a trap composed of 11 places in 70 ms of which 1 ms to minimize.
[2025-06-01 01:25:56] [INFO ] Deduced a trap composed of 33 places in 60 ms of which 1 ms to minimize.
[2025-06-01 01:25:56] [INFO ] Deduced a trap composed of 34 places in 61 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/128 variables, 20/161 constraints. Problems are: Problem set: 0 solved, 376 unsolved
[2025-06-01 01:25:58] [INFO ] Deduced a trap composed of 34 places in 56 ms of which 1 ms to minimize.
[2025-06-01 01:25:58] [INFO ] Deduced a trap composed of 26 places in 58 ms of which 1 ms to minimize.
[2025-06-01 01:25:58] [INFO ] Deduced a trap composed of 30 places in 54 ms of which 1 ms to minimize.
[2025-06-01 01:25:58] [INFO ] Deduced a trap composed of 38 places in 64 ms of which 1 ms to minimize.
[2025-06-01 01:25:58] [INFO ] Deduced a trap composed of 46 places in 57 ms of which 1 ms to minimize.
[2025-06-01 01:25:58] [INFO ] Deduced a trap composed of 34 places in 58 ms of which 1 ms to minimize.
[2025-06-01 01:25:58] [INFO ] Deduced a trap composed of 29 places in 57 ms of which 1 ms to minimize.
[2025-06-01 01:25:58] [INFO ] Deduced a trap composed of 26 places in 57 ms of which 1 ms to minimize.
[2025-06-01 01:25:58] [INFO ] Deduced a trap composed of 37 places in 68 ms of which 1 ms to minimize.
[2025-06-01 01:25:58] [INFO ] Deduced a trap composed of 13 places in 43 ms of which 0 ms to minimize.
[2025-06-01 01:25:58] [INFO ] Deduced a trap composed of 35 places in 61 ms of which 1 ms to minimize.
[2025-06-01 01:25:58] [INFO ] Deduced a trap composed of 40 places in 57 ms of which 1 ms to minimize.
[2025-06-01 01:25:59] [INFO ] Deduced a trap composed of 37 places in 60 ms of which 1 ms to minimize.
[2025-06-01 01:25:59] [INFO ] Deduced a trap composed of 45 places in 62 ms of which 1 ms to minimize.
[2025-06-01 01:25:59] [INFO ] Deduced a trap composed of 17 places in 62 ms of which 1 ms to minimize.
[2025-06-01 01:25:59] [INFO ] Deduced a trap composed of 31 places in 58 ms of which 1 ms to minimize.
[2025-06-01 01:25:59] [INFO ] Deduced a trap composed of 37 places in 60 ms of which 1 ms to minimize.
[2025-06-01 01:25:59] [INFO ] Deduced a trap composed of 28 places in 60 ms of which 1 ms to minimize.
[2025-06-01 01:25:59] [INFO ] Deduced a trap composed of 36 places in 56 ms of which 1 ms to minimize.
[2025-06-01 01:25:59] [INFO ] Deduced a trap composed of 15 places in 37 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/128 variables, 20/181 constraints. Problems are: Problem set: 0 solved, 376 unsolved
[2025-06-01 01:26:00] [INFO ] Deduced a trap composed of 32 places in 65 ms of which 2 ms to minimize.
[2025-06-01 01:26:00] [INFO ] Deduced a trap composed of 43 places in 61 ms of which 1 ms to minimize.
[2025-06-01 01:26:00] [INFO ] Deduced a trap composed of 38 places in 59 ms of which 1 ms to minimize.
[2025-06-01 01:26:00] [INFO ] Deduced a trap composed of 46 places in 68 ms of which 1 ms to minimize.
[2025-06-01 01:26:00] [INFO ] Deduced a trap composed of 44 places in 53 ms of which 1 ms to minimize.
[2025-06-01 01:26:00] [INFO ] Deduced a trap composed of 41 places in 50 ms of which 1 ms to minimize.
[2025-06-01 01:26:00] [INFO ] Deduced a trap composed of 44 places in 58 ms of which 1 ms to minimize.
[2025-06-01 01:26:00] [INFO ] Deduced a trap composed of 36 places in 65 ms of which 1 ms to minimize.
[2025-06-01 01:26:00] [INFO ] Deduced a trap composed of 34 places in 63 ms of which 1 ms to minimize.
[2025-06-01 01:26:01] [INFO ] Deduced a trap composed of 34 places in 57 ms of which 1 ms to minimize.
[2025-06-01 01:26:01] [INFO ] Deduced a trap composed of 34 places in 59 ms of which 2 ms to minimize.
[2025-06-01 01:26:01] [INFO ] Deduced a trap composed of 33 places in 68 ms of which 1 ms to minimize.
[2025-06-01 01:26:01] [INFO ] Deduced a trap composed of 33 places in 61 ms of which 1 ms to minimize.
[2025-06-01 01:26:01] [INFO ] Deduced a trap composed of 33 places in 61 ms of which 1 ms to minimize.
[2025-06-01 01:26:01] [INFO ] Deduced a trap composed of 38 places in 56 ms of which 1 ms to minimize.
[2025-06-01 01:26:01] [INFO ] Deduced a trap composed of 36 places in 72 ms of which 1 ms to minimize.
[2025-06-01 01:26:01] [INFO ] Deduced a trap composed of 38 places in 55 ms of which 2 ms to minimize.
[2025-06-01 01:26:01] [INFO ] Deduced a trap composed of 42 places in 63 ms of which 1 ms to minimize.
[2025-06-01 01:26:02] [INFO ] Deduced a trap composed of 44 places in 61 ms of which 1 ms to minimize.
[2025-06-01 01:26:02] [INFO ] Deduced a trap composed of 28 places in 59 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/128 variables, 20/201 constraints. Problems are: Problem set: 0 solved, 376 unsolved
[2025-06-01 01:26:02] [INFO ] Deduced a trap composed of 31 places in 63 ms of which 1 ms to minimize.
[2025-06-01 01:26:03] [INFO ] Deduced a trap composed of 36 places in 53 ms of which 1 ms to minimize.
[2025-06-01 01:26:03] [INFO ] Deduced a trap composed of 28 places in 58 ms of which 1 ms to minimize.
[2025-06-01 01:26:03] [INFO ] Deduced a trap composed of 31 places in 58 ms of which 1 ms to minimize.
[2025-06-01 01:26:03] [INFO ] Deduced a trap composed of 27 places in 52 ms of which 1 ms to minimize.
[2025-06-01 01:26:04] [INFO ] Deduced a trap composed of 43 places in 65 ms of which 1 ms to minimize.
[2025-06-01 01:26:04] [INFO ] Deduced a trap composed of 50 places in 68 ms of which 1 ms to minimize.
[2025-06-01 01:26:04] [INFO ] Deduced a trap composed of 44 places in 59 ms of which 1 ms to minimize.
[2025-06-01 01:26:04] [INFO ] Deduced a trap composed of 42 places in 62 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/128 variables, 9/210 constraints. Problems are: Problem set: 0 solved, 376 unsolved
[2025-06-01 01:26:06] [INFO ] Deduced a trap composed of 48 places in 74 ms of which 1 ms to minimize.
[2025-06-01 01:26:06] [INFO ] Deduced a trap composed of 54 places in 60 ms of which 1 ms to minimize.
[2025-06-01 01:26:06] [INFO ] Deduced a trap composed of 37 places in 60 ms of which 1 ms to minimize.
[2025-06-01 01:26:07] [INFO ] Deduced a trap composed of 36 places in 65 ms of which 1 ms to minimize.
[2025-06-01 01:26:07] [INFO ] Deduced a trap composed of 39 places in 56 ms of which 1 ms to minimize.
[2025-06-01 01:26:07] [INFO ] Deduced a trap composed of 29 places in 52 ms of which 1 ms to minimize.
[2025-06-01 01:26:07] [INFO ] Deduced a trap composed of 41 places in 61 ms of which 1 ms to minimize.
[2025-06-01 01:26:07] [INFO ] Deduced a trap composed of 37 places in 69 ms of which 1 ms to minimize.
[2025-06-01 01:26:08] [INFO ] Deduced a trap composed of 34 places in 54 ms of which 1 ms to minimize.
[2025-06-01 01:26:08] [INFO ] Deduced a trap composed of 34 places in 54 ms of which 1 ms to minimize.
[2025-06-01 01:26:08] [INFO ] Deduced a trap composed of 35 places in 45 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/128 variables, 11/221 constraints. Problems are: Problem set: 0 solved, 376 unsolved
[2025-06-01 01:26:09] [INFO ] Deduced a trap composed of 37 places in 65 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/128 variables, 1/222 constraints. Problems are: Problem set: 0 solved, 376 unsolved
[2025-06-01 01:26:11] [INFO ] Deduced a trap composed of 36 places in 58 ms of which 1 ms to minimize.
[2025-06-01 01:26:11] [INFO ] Deduced a trap composed of 58 places in 59 ms of which 0 ms to minimize.
[2025-06-01 01:26:11] [INFO ] Deduced a trap composed of 49 places in 54 ms of which 1 ms to minimize.
[2025-06-01 01:26:11] [INFO ] Deduced a trap composed of 53 places in 54 ms of which 1 ms to minimize.
[2025-06-01 01:26:11] [INFO ] Deduced a trap composed of 50 places in 75 ms of which 1 ms to minimize.
[2025-06-01 01:26:11] [INFO ] Deduced a trap composed of 42 places in 54 ms of which 0 ms to minimize.
[2025-06-01 01:26:12] [INFO ] Deduced a trap composed of 35 places in 57 ms of which 1 ms to minimize.
[2025-06-01 01:26:12] [INFO ] Deduced a trap composed of 44 places in 49 ms of which 1 ms to minimize.
[2025-06-01 01:26:12] [INFO ] Deduced a trap composed of 40 places in 54 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/128 variables, 9/231 constraints. Problems are: Problem set: 0 solved, 376 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/128 variables, 0/231 constraints. Problems are: Problem set: 0 solved, 376 unsolved
At refinement iteration 11 (OVERLAPS) 216/344 variables, 128/359 constraints. Problems are: Problem set: 0 solved, 376 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/344 variables, 112/471 constraints. Problems are: Problem set: 0 solved, 376 unsolved
[2025-06-01 01:26:23] [INFO ] Deduced a trap composed of 38 places in 62 ms of which 1 ms to minimize.
[2025-06-01 01:26:23] [INFO ] Deduced a trap composed of 33 places in 56 ms of which 1 ms to minimize.
SMT process timed out in 30205ms, After SMT, problems are : Problem set: 0 solved, 376 unsolved
Search for dead transitions found 0 dead transitions in 30230ms
Starting structural reductions in LIVENESS mode, iteration 1 : 128/196 places, 380/448 transitions.
Finished structural reductions in LIVENESS mode , in 1 iterations and 31104 ms. Remains : 128/196 places, 380/448 transitions.
Initial state reduction rules removed 4 formulas.
RANDOM walk for 40000 steps (8 resets) in 2424 ms. (16 steps per ms) remains 239/376 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 239/239 properties
BEST_FIRST walk for 404 steps (8 resets) in 10 ms. (36 steps per ms) remains 239/239 properties
BEST_FIRST walk for 404 steps (8 resets) in 14 ms. (26 steps per ms) remains 239/239 properties
BEST_FIRST walk for 404 steps (8 resets) in 12 ms. (31 steps per ms) remains 239/239 properties
BEST_FIRST walk for 404 steps (8 resets) in 14 ms. (26 steps per ms) remains 239/239 properties
BEST_FIRST walk for 404 steps (8 resets) in 16 ms. (23 steps per ms) remains 239/239 properties
BEST_FIRST walk for 404 steps (8 resets) in 15 ms. (25 steps per ms) remains 238/239 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 237/238 properties
BEST_FIRST walk for 404 steps (8 resets) in 13 ms. (28 steps per ms) remains 237/237 properties
BEST_FIRST walk for 404 steps (8 resets) in 11 ms. (33 steps per ms) remains 237/237 properties
BEST_FIRST walk for 404 steps (8 resets) in 11 ms. (33 steps per ms) remains 237/237 properties
BEST_FIRST walk for 404 steps (8 resets) in 11 ms. (33 steps per ms) remains 237/237 properties
BEST_FIRST walk for 404 steps (8 resets) in 12 ms. (31 steps per ms) remains 237/237 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 237/237 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 237/237 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 237/237 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 237/237 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 237/237 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 237/237 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 237/237 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 237/237 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 237/237 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 237/237 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 237/237 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 237/237 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 237/237 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 237/237 properties
BEST_FIRST walk for 404 steps (8 resets) in 5 ms. (67 steps per ms) remains 237/237 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 237/237 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 237/237 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 237/237 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 237/237 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 237/237 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 237/237 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 237/237 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 237/237 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 237/237 properties
BEST_FIRST walk for 404 steps (8 resets) in 10 ms. (36 steps per ms) remains 237/237 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 237/237 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 237/237 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 237/237 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 237/237 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 237/237 properties
BEST_FIRST walk for 404 steps (8 resets) in 5 ms. (67 steps per ms) remains 237/237 properties
BEST_FIRST walk for 404 steps (8 resets) in 5 ms. (67 steps per ms) remains 237/237 properties
BEST_FIRST walk for 404 steps (8 resets) in 4 ms. (80 steps per ms) remains 237/237 properties
BEST_FIRST walk for 404 steps (8 resets) in 5 ms. (67 steps per ms) remains 237/237 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 237/237 properties
BEST_FIRST walk for 404 steps (8 resets) in 5 ms. (67 steps per ms) remains 237/237 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 237/237 properties
BEST_FIRST walk for 404 steps (8 resets) in 5 ms. (67 steps per ms) remains 237/237 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 237/237 properties
BEST_FIRST walk for 404 steps (8 resets) in 5 ms. (67 steps per ms) remains 237/237 properties
BEST_FIRST walk for 404 steps (8 resets) in 5 ms. (67 steps per ms) remains 237/237 properties
BEST_FIRST walk for 404 steps (8 resets) in 4 ms. (80 steps per ms) remains 237/237 properties
BEST_FIRST walk for 404 steps (8 resets) in 4 ms. (80 steps per ms) remains 237/237 properties
BEST_FIRST walk for 404 steps (8 resets) in 4 ms. (80 steps per ms) remains 237/237 properties
[2025-06-01 01:26:24] [INFO ] Flow matrix only has 216 transitions (discarded 164 similar events)
[2025-06-01 01:26:24] [INFO ] Invariant cache hit.
[2025-06-01 01:26:24] [INFO ] State equation strengthened by 112 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/87 variables, 87/87 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/87 variables, 1/88 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/87 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 3 (OVERLAPS) 41/128 variables, 8/96 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/128 variables, 41/137 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/128 variables, 4/141 constraints. Problems are: Problem set: 0 solved, 237 unsolved
[2025-06-01 01:26:26] [INFO ] Deduced a trap composed of 19 places in 57 ms of which 1 ms to minimize.
[2025-06-01 01:26:26] [INFO ] Deduced a trap composed of 15 places in 36 ms of which 1 ms to minimize.
[2025-06-01 01:26:26] [INFO ] Deduced a trap composed of 17 places in 39 ms of which 0 ms to minimize.
[2025-06-01 01:26:26] [INFO ] Deduced a trap composed of 35 places in 70 ms of which 1 ms to minimize.
[2025-06-01 01:26:26] [INFO ] Deduced a trap composed of 33 places in 60 ms of which 1 ms to minimize.
[2025-06-01 01:26:26] [INFO ] Deduced a trap composed of 45 places in 62 ms of which 1 ms to minimize.
[2025-06-01 01:26:26] [INFO ] Deduced a trap composed of 33 places in 63 ms of which 1 ms to minimize.
[2025-06-01 01:26:26] [INFO ] Deduced a trap composed of 38 places in 60 ms of which 2 ms to minimize.
[2025-06-01 01:26:27] [INFO ] Deduced a trap composed of 33 places in 61 ms of which 1 ms to minimize.
[2025-06-01 01:26:27] [INFO ] Deduced a trap composed of 3 places in 70 ms of which 1 ms to minimize.
[2025-06-01 01:26:27] [INFO ] Deduced a trap composed of 34 places in 50 ms of which 1 ms to minimize.
[2025-06-01 01:26:27] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 1 ms to minimize.
[2025-06-01 01:26:27] [INFO ] Deduced a trap composed of 41 places in 60 ms of which 1 ms to minimize.
[2025-06-01 01:26:27] [INFO ] Deduced a trap composed of 41 places in 61 ms of which 1 ms to minimize.
[2025-06-01 01:26:27] [INFO ] Deduced a trap composed of 36 places in 59 ms of which 1 ms to minimize.
[2025-06-01 01:26:27] [INFO ] Deduced a trap composed of 26 places in 59 ms of which 1 ms to minimize.
[2025-06-01 01:26:27] [INFO ] Deduced a trap composed of 27 places in 56 ms of which 1 ms to minimize.
[2025-06-01 01:26:27] [INFO ] Deduced a trap composed of 11 places in 66 ms of which 1 ms to minimize.
[2025-06-01 01:26:27] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2025-06-01 01:26:27] [INFO ] Deduced a trap composed of 33 places in 58 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/128 variables, 20/161 constraints. Problems are: Problem set: 0 solved, 237 unsolved
[2025-06-01 01:26:28] [INFO ] Deduced a trap composed of 45 places in 63 ms of which 2 ms to minimize.
[2025-06-01 01:26:28] [INFO ] Deduced a trap composed of 33 places in 53 ms of which 1 ms to minimize.
[2025-06-01 01:26:28] [INFO ] Deduced a trap composed of 36 places in 50 ms of which 1 ms to minimize.
[2025-06-01 01:26:28] [INFO ] Deduced a trap composed of 14 places in 48 ms of which 1 ms to minimize.
[2025-06-01 01:26:28] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2025-06-01 01:26:28] [INFO ] Deduced a trap composed of 33 places in 56 ms of which 1 ms to minimize.
[2025-06-01 01:26:29] [INFO ] Deduced a trap composed of 36 places in 66 ms of which 1 ms to minimize.
[2025-06-01 01:26:29] [INFO ] Deduced a trap composed of 15 places in 37 ms of which 1 ms to minimize.
[2025-06-01 01:26:29] [INFO ] Deduced a trap composed of 34 places in 65 ms of which 1 ms to minimize.
[2025-06-01 01:26:29] [INFO ] Deduced a trap composed of 49 places in 73 ms of which 1 ms to minimize.
[2025-06-01 01:26:29] [INFO ] Deduced a trap composed of 30 places in 66 ms of which 1 ms to minimize.
[2025-06-01 01:26:29] [INFO ] Deduced a trap composed of 31 places in 49 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 128/344 variables, and 173 constraints, problems are : Problem set: 0 solved, 237 unsolved in 5015 ms.
Refiners :[Domain max(s): 128/128 constraints, Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/128 constraints, ReadFeed: 0/112 constraints, PredecessorRefiner: 237/237 constraints, Known Traps: 32/32 constraints]
Escalating to Integer solving :Problem set: 0 solved, 237 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/87 variables, 87/87 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/87 variables, 1/88 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/87 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 3 (OVERLAPS) 41/128 variables, 8/96 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/128 variables, 41/137 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/128 variables, 4/141 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/128 variables, 32/173 constraints. Problems are: Problem set: 0 solved, 237 unsolved
[2025-06-01 01:26:30] [INFO ] Deduced a trap composed of 27 places in 70 ms of which 1 ms to minimize.
[2025-06-01 01:26:30] [INFO ] Deduced a trap composed of 44 places in 57 ms of which 1 ms to minimize.
[2025-06-01 01:26:30] [INFO ] Deduced a trap composed of 33 places in 64 ms of which 2 ms to minimize.
[2025-06-01 01:26:31] [INFO ] Deduced a trap composed of 33 places in 61 ms of which 1 ms to minimize.
[2025-06-01 01:26:31] [INFO ] Deduced a trap composed of 36 places in 67 ms of which 1 ms to minimize.
[2025-06-01 01:26:31] [INFO ] Deduced a trap composed of 33 places in 67 ms of which 1 ms to minimize.
[2025-06-01 01:26:31] [INFO ] Deduced a trap composed of 33 places in 63 ms of which 2 ms to minimize.
[2025-06-01 01:26:31] [INFO ] Deduced a trap composed of 27 places in 73 ms of which 1 ms to minimize.
[2025-06-01 01:26:32] [INFO ] Deduced a trap composed of 33 places in 68 ms of which 1 ms to minimize.
[2025-06-01 01:26:32] [INFO ] Deduced a trap composed of 37 places in 59 ms of which 1 ms to minimize.
[2025-06-01 01:26:32] [INFO ] Deduced a trap composed of 38 places in 57 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/128 variables, 11/184 constraints. Problems are: Problem set: 0 solved, 237 unsolved
[2025-06-01 01:26:32] [INFO ] Deduced a trap composed of 30 places in 60 ms of which 0 ms to minimize.
[2025-06-01 01:26:32] [INFO ] Deduced a trap composed of 34 places in 60 ms of which 1 ms to minimize.
[2025-06-01 01:26:32] [INFO ] Deduced a trap composed of 33 places in 57 ms of which 1 ms to minimize.
[2025-06-01 01:26:32] [INFO ] Deduced a trap composed of 27 places in 52 ms of which 1 ms to minimize.
[2025-06-01 01:26:33] [INFO ] Deduced a trap composed of 38 places in 57 ms of which 1 ms to minimize.
[2025-06-01 01:26:33] [INFO ] Deduced a trap composed of 35 places in 64 ms of which 1 ms to minimize.
[2025-06-01 01:26:33] [INFO ] Deduced a trap composed of 33 places in 68 ms of which 0 ms to minimize.
[2025-06-01 01:26:33] [INFO ] Deduced a trap composed of 31 places in 55 ms of which 2 ms to minimize.
[2025-06-01 01:26:33] [INFO ] Deduced a trap composed of 27 places in 65 ms of which 1 ms to minimize.
[2025-06-01 01:26:34] [INFO ] Deduced a trap composed of 28 places in 57 ms of which 1 ms to minimize.
[2025-06-01 01:26:34] [INFO ] Deduced a trap composed of 41 places in 69 ms of which 1 ms to minimize.
[2025-06-01 01:26:34] [INFO ] Deduced a trap composed of 38 places in 60 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/128 variables, 12/196 constraints. Problems are: Problem set: 0 solved, 237 unsolved
[2025-06-01 01:26:34] [INFO ] Deduced a trap composed of 39 places in 65 ms of which 1 ms to minimize.
[2025-06-01 01:26:34] [INFO ] Deduced a trap composed of 39 places in 60 ms of which 1 ms to minimize.
SMT process timed out in 10138ms, After SMT, problems are : Problem set: 0 solved, 237 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 87 out of 128 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 128/128 places, 380/380 transitions.
Applied a total of 0 rules in 24 ms. Remains 128 /128 variables (removed 0) and now considering 380/380 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 25 ms. Remains : 128/128 places, 380/380 transitions.
RANDOM walk for 4000000 steps (8 resets) in 61571 ms. (64 steps per ms) remains 224/237 properties
BEST_FIRST walk for 40004 steps (8 resets) in 142 ms. (279 steps per ms) remains 224/224 properties
BEST_FIRST walk for 40004 steps (8 resets) in 139 ms. (285 steps per ms) remains 223/224 properties
BEST_FIRST walk for 40004 steps (8 resets) in 134 ms. (296 steps per ms) remains 222/223 properties
BEST_FIRST walk for 40004 steps (8 resets) in 121 ms. (327 steps per ms) remains 222/222 properties
BEST_FIRST walk for 40004 steps (8 resets) in 148 ms. (268 steps per ms) remains 220/222 properties
BEST_FIRST walk for 40004 steps (8 resets) in 138 ms. (287 steps per ms) remains 220/220 properties
BEST_FIRST walk for 40004 steps (8 resets) in 127 ms. (312 steps per ms) remains 219/220 properties
BEST_FIRST walk for 40004 steps (8 resets) in 121 ms. (327 steps per ms) remains 218/219 properties
BEST_FIRST walk for 40004 steps (8 resets) in 122 ms. (325 steps per ms) remains 218/218 properties
BEST_FIRST walk for 40004 steps (8 resets) in 121 ms. (327 steps per ms) remains 218/218 properties
BEST_FIRST walk for 40004 steps (8 resets) in 127 ms. (312 steps per ms) remains 217/218 properties
BEST_FIRST walk for 40004 steps (8 resets) in 120 ms. (330 steps per ms) remains 214/217 properties
BEST_FIRST walk for 40004 steps (8 resets) in 121 ms. (327 steps per ms) remains 214/214 properties
BEST_FIRST walk for 40004 steps (8 resets) in 161 ms. (246 steps per ms) remains 214/214 properties
BEST_FIRST walk for 40004 steps (8 resets) in 135 ms. (294 steps per ms) remains 213/214 properties
BEST_FIRST walk for 40004 steps (8 resets) in 118 ms. (336 steps per ms) remains 212/213 properties
BEST_FIRST walk for 40004 steps (8 resets) in 117 ms. (339 steps per ms) remains 212/212 properties
BEST_FIRST walk for 40004 steps (8 resets) in 120 ms. (330 steps per ms) remains 212/212 properties
BEST_FIRST walk for 40004 steps (8 resets) in 125 ms. (317 steps per ms) remains 207/212 properties
BEST_FIRST walk for 40004 steps (8 resets) in 116 ms. (341 steps per ms) remains 207/207 properties
BEST_FIRST walk for 40004 steps (8 resets) in 119 ms. (333 steps per ms) remains 207/207 properties
BEST_FIRST walk for 40004 steps (8 resets) in 119 ms. (333 steps per ms) remains 202/207 properties
BEST_FIRST walk for 40004 steps (8 resets) in 116 ms. (341 steps per ms) remains 202/202 properties
BEST_FIRST walk for 40004 steps (8 resets) in 120 ms. (330 steps per ms) remains 200/202 properties
BEST_FIRST walk for 40004 steps (8 resets) in 116 ms. (341 steps per ms) remains 194/200 properties
BEST_FIRST walk for 40004 steps (8 resets) in 111 ms. (357 steps per ms) remains 194/194 properties
BEST_FIRST walk for 40004 steps (8 resets) in 112 ms. (354 steps per ms) remains 194/194 properties
BEST_FIRST walk for 40004 steps (8 resets) in 119 ms. (333 steps per ms) remains 194/194 properties
BEST_FIRST walk for 40004 steps (8 resets) in 113 ms. (350 steps per ms) remains 194/194 properties
BEST_FIRST walk for 40004 steps (8 resets) in 115 ms. (344 steps per ms) remains 194/194 properties
BEST_FIRST walk for 40004 steps (8 resets) in 113 ms. (350 steps per ms) remains 194/194 properties
BEST_FIRST walk for 40004 steps (8 resets) in 117 ms. (339 steps per ms) remains 190/194 properties
BEST_FIRST walk for 40004 steps (8 resets) in 127 ms. (312 steps per ms) remains 190/190 properties
BEST_FIRST walk for 40004 steps (8 resets) in 113 ms. (350 steps per ms) remains 190/190 properties
BEST_FIRST walk for 40004 steps (8 resets) in 114 ms. (347 steps per ms) remains 190/190 properties
BEST_FIRST walk for 40004 steps (8 resets) in 117 ms. (339 steps per ms) remains 189/190 properties
BEST_FIRST walk for 40004 steps (8 resets) in 120 ms. (330 steps per ms) remains 189/189 properties
BEST_FIRST walk for 40004 steps (8 resets) in 112 ms. (354 steps per ms) remains 188/189 properties
BEST_FIRST walk for 40004 steps (8 resets) in 138 ms. (287 steps per ms) remains 188/188 properties
BEST_FIRST walk for 40004 steps (8 resets) in 124 ms. (320 steps per ms) remains 188/188 properties
BEST_FIRST walk for 40004 steps (8 resets) in 126 ms. (314 steps per ms) remains 187/188 properties
BEST_FIRST walk for 40004 steps (8 resets) in 119 ms. (333 steps per ms) remains 187/187 properties
BEST_FIRST walk for 40004 steps (8 resets) in 114 ms. (347 steps per ms) remains 187/187 properties
BEST_FIRST walk for 40004 steps (8 resets) in 114 ms. (347 steps per ms) remains 187/187 properties
BEST_FIRST walk for 40004 steps (8 resets) in 125 ms. (317 steps per ms) remains 187/187 properties
BEST_FIRST walk for 40004 steps (8 resets) in 120 ms. (330 steps per ms) remains 187/187 properties
BEST_FIRST walk for 40004 steps (8 resets) in 107 ms. (370 steps per ms) remains 183/187 properties
BEST_FIRST walk for 40004 steps (8 resets) in 110 ms. (360 steps per ms) remains 183/183 properties
BEST_FIRST walk for 40004 steps (8 resets) in 110 ms. (360 steps per ms) remains 183/183 properties
BEST_FIRST walk for 40004 steps (8 resets) in 111 ms. (357 steps per ms) remains 183/183 properties
BEST_FIRST walk for 40004 steps (8 resets) in 120 ms. (330 steps per ms) remains 183/183 properties
BEST_FIRST walk for 40004 steps (8 resets) in 111 ms. (357 steps per ms) remains 183/183 properties
BEST_FIRST walk for 40004 steps (8 resets) in 112 ms. (354 steps per ms) remains 183/183 properties
BEST_FIRST walk for 40004 steps (8 resets) in 109 ms. (363 steps per ms) remains 183/183 properties
BEST_FIRST walk for 40004 steps (8 resets) in 110 ms. (360 steps per ms) remains 183/183 properties
BEST_FIRST walk for 40004 steps (8 resets) in 107 ms. (370 steps per ms) remains 183/183 properties
BEST_FIRST walk for 40004 steps (8 resets) in 110 ms. (360 steps per ms) remains 183/183 properties
BEST_FIRST walk for 40004 steps (8 resets) in 154 ms. (258 steps per ms) remains 181/183 properties
BEST_FIRST walk for 40004 steps (8 resets) in 120 ms. (330 steps per ms) remains 181/181 properties
BEST_FIRST walk for 40004 steps (8 resets) in 116 ms. (341 steps per ms) remains 181/181 properties
BEST_FIRST walk for 40004 steps (8 resets) in 114 ms. (347 steps per ms) remains 181/181 properties
BEST_FIRST walk for 40004 steps (8 resets) in 110 ms. (360 steps per ms) remains 181/181 properties
BEST_FIRST walk for 40004 steps (8 resets) in 108 ms. (367 steps per ms) remains 181/181 properties
BEST_FIRST walk for 40004 steps (8 resets) in 120 ms. (330 steps per ms) remains 179/181 properties
BEST_FIRST walk for 40004 steps (8 resets) in 108 ms. (367 steps per ms) remains 179/179 properties
BEST_FIRST walk for 40004 steps (8 resets) in 112 ms. (354 steps per ms) remains 178/179 properties
BEST_FIRST walk for 40004 steps (8 resets) in 116 ms. (341 steps per ms) remains 178/178 properties
BEST_FIRST walk for 40004 steps (8 resets) in 111 ms. (357 steps per ms) remains 178/178 properties
BEST_FIRST walk for 40004 steps (8 resets) in 158 ms. (251 steps per ms) remains 178/178 properties
BEST_FIRST walk for 40004 steps (8 resets) in 114 ms. (347 steps per ms) remains 178/178 properties
BEST_FIRST walk for 40004 steps (8 resets) in 109 ms. (363 steps per ms) remains 178/178 properties
BEST_FIRST walk for 40004 steps (8 resets) in 111 ms. (357 steps per ms) remains 178/178 properties
BEST_FIRST walk for 40004 steps (8 resets) in 113 ms. (350 steps per ms) remains 178/178 properties
BEST_FIRST walk for 40004 steps (8 resets) in 110 ms. (360 steps per ms) remains 178/178 properties
BEST_FIRST walk for 40004 steps (8 resets) in 111 ms. (357 steps per ms) remains 178/178 properties
BEST_FIRST walk for 40004 steps (8 resets) in 107 ms. (370 steps per ms) remains 178/178 properties
BEST_FIRST walk for 40004 steps (8 resets) in 106 ms. (373 steps per ms) remains 178/178 properties
BEST_FIRST walk for 40004 steps (8 resets) in 111 ms. (357 steps per ms) remains 178/178 properties
BEST_FIRST walk for 40004 steps (8 resets) in 117 ms. (339 steps per ms) remains 178/178 properties
BEST_FIRST walk for 40004 steps (8 resets) in 112 ms. (354 steps per ms) remains 178/178 properties
BEST_FIRST walk for 40004 steps (8 resets) in 113 ms. (350 steps per ms) remains 178/178 properties
BEST_FIRST walk for 40004 steps (8 resets) in 113 ms. (350 steps per ms) remains 178/178 properties
BEST_FIRST walk for 40004 steps (8 resets) in 116 ms. (341 steps per ms) remains 178/178 properties
BEST_FIRST walk for 40004 steps (8 resets) in 112 ms. (354 steps per ms) remains 178/178 properties
BEST_FIRST walk for 40004 steps (8 resets) in 104 ms. (380 steps per ms) remains 178/178 properties
BEST_FIRST walk for 40004 steps (8 resets) in 111 ms. (357 steps per ms) remains 177/178 properties
BEST_FIRST walk for 40004 steps (8 resets) in 113 ms. (350 steps per ms) remains 177/177 properties
BEST_FIRST walk for 40004 steps (8 resets) in 108 ms. (367 steps per ms) remains 177/177 properties
BEST_FIRST walk for 40004 steps (8 resets) in 110 ms. (360 steps per ms) remains 177/177 properties
BEST_FIRST walk for 40004 steps (8 resets) in 110 ms. (360 steps per ms) remains 177/177 properties
BEST_FIRST walk for 40004 steps (8 resets) in 109 ms. (363 steps per ms) remains 177/177 properties
BEST_FIRST walk for 40004 steps (8 resets) in 115 ms. (344 steps per ms) remains 177/177 properties
BEST_FIRST walk for 40004 steps (8 resets) in 105 ms. (377 steps per ms) remains 177/177 properties
BEST_FIRST walk for 40004 steps (8 resets) in 102 ms. (388 steps per ms) remains 177/177 properties
BEST_FIRST walk for 40004 steps (8 resets) in 103 ms. (384 steps per ms) remains 177/177 properties
BEST_FIRST walk for 40004 steps (8 resets) in 118 ms. (336 steps per ms) remains 177/177 properties
BEST_FIRST walk for 40004 steps (8 resets) in 111 ms. (357 steps per ms) remains 177/177 properties
BEST_FIRST walk for 40004 steps (8 resets) in 112 ms. (354 steps per ms) remains 177/177 properties
BEST_FIRST walk for 40004 steps (8 resets) in 109 ms. (363 steps per ms) remains 177/177 properties
BEST_FIRST walk for 40004 steps (8 resets) in 108 ms. (367 steps per ms) remains 177/177 properties
BEST_FIRST walk for 40004 steps (8 resets) in 107 ms. (370 steps per ms) remains 177/177 properties
BEST_FIRST walk for 40004 steps (8 resets) in 104 ms. (380 steps per ms) remains 177/177 properties
BEST_FIRST walk for 40004 steps (8 resets) in 104 ms. (380 steps per ms) remains 177/177 properties
BEST_FIRST walk for 40004 steps (8 resets) in 113 ms. (350 steps per ms) remains 177/177 properties
BEST_FIRST walk for 40004 steps (8 resets) in 115 ms. (344 steps per ms) remains 177/177 properties
BEST_FIRST walk for 40004 steps (8 resets) in 107 ms. (370 steps per ms) remains 177/177 properties
BEST_FIRST walk for 40004 steps (8 resets) in 107 ms. (370 steps per ms) remains 177/177 properties
BEST_FIRST walk for 40004 steps (8 resets) in 108 ms. (367 steps per ms) remains 177/177 properties
BEST_FIRST walk for 40004 steps (8 resets) in 102 ms. (388 steps per ms) remains 177/177 properties
BEST_FIRST walk for 40004 steps (8 resets) in 108 ms. (367 steps per ms) remains 177/177 properties
BEST_FIRST walk for 40004 steps (8 resets) in 102 ms. (388 steps per ms) remains 177/177 properties
BEST_FIRST walk for 40004 steps (8 resets) in 108 ms. (367 steps per ms) remains 177/177 properties
BEST_FIRST walk for 40004 steps (8 resets) in 110 ms. (360 steps per ms) remains 177/177 properties
BEST_FIRST walk for 40004 steps (8 resets) in 108 ms. (367 steps per ms) remains 177/177 properties
BEST_FIRST walk for 40004 steps (8 resets) in 112 ms. (354 steps per ms) remains 177/177 properties
BEST_FIRST walk for 40004 steps (8 resets) in 103 ms. (384 steps per ms) remains 177/177 properties
BEST_FIRST walk for 40004 steps (8 resets) in 107 ms. (370 steps per ms) remains 177/177 properties
BEST_FIRST walk for 40004 steps (8 resets) in 110 ms. (360 steps per ms) remains 177/177 properties
BEST_FIRST walk for 40004 steps (8 resets) in 113 ms. (350 steps per ms) remains 174/177 properties
BEST_FIRST walk for 40004 steps (8 resets) in 107 ms. (370 steps per ms) remains 174/174 properties
BEST_FIRST walk for 40004 steps (8 resets) in 111 ms. (357 steps per ms) remains 174/174 properties
BEST_FIRST walk for 40004 steps (8 resets) in 103 ms. (384 steps per ms) remains 174/174 properties
BEST_FIRST walk for 40004 steps (8 resets) in 204 ms. (195 steps per ms) remains 174/174 properties
BEST_FIRST walk for 40004 steps (8 resets) in 129 ms. (307 steps per ms) remains 174/174 properties
BEST_FIRST walk for 40004 steps (8 resets) in 108 ms. (367 steps per ms) remains 174/174 properties
BEST_FIRST walk for 40004 steps (8 resets) in 110 ms. (360 steps per ms) remains 174/174 properties
BEST_FIRST walk for 40004 steps (8 resets) in 109 ms. (363 steps per ms) remains 174/174 properties
BEST_FIRST walk for 40004 steps (8 resets) in 112 ms. (354 steps per ms) remains 174/174 properties
BEST_FIRST walk for 40004 steps (8 resets) in 109 ms. (363 steps per ms) remains 174/174 properties
BEST_FIRST walk for 40004 steps (8 resets) in 111 ms. (357 steps per ms) remains 174/174 properties
BEST_FIRST walk for 40004 steps (8 resets) in 109 ms. (363 steps per ms) remains 174/174 properties
BEST_FIRST walk for 40004 steps (8 resets) in 104 ms. (380 steps per ms) remains 174/174 properties
BEST_FIRST walk for 40004 steps (8 resets) in 107 ms. (370 steps per ms) remains 174/174 properties
BEST_FIRST walk for 40004 steps (8 resets) in 102 ms. (388 steps per ms) remains 174/174 properties
BEST_FIRST walk for 40004 steps (8 resets) in 102 ms. (388 steps per ms) remains 174/174 properties
BEST_FIRST walk for 40004 steps (8 resets) in 102 ms. (388 steps per ms) remains 174/174 properties
BEST_FIRST walk for 40004 steps (8 resets) in 103 ms. (384 steps per ms) remains 174/174 properties
BEST_FIRST walk for 40004 steps (8 resets) in 107 ms. (370 steps per ms) remains 174/174 properties
BEST_FIRST walk for 40004 steps (8 resets) in 100 ms. (396 steps per ms) remains 174/174 properties
BEST_FIRST walk for 40004 steps (8 resets) in 102 ms. (388 steps per ms) remains 174/174 properties
BEST_FIRST walk for 40004 steps (8 resets) in 107 ms. (370 steps per ms) remains 174/174 properties
BEST_FIRST walk for 40004 steps (8 resets) in 113 ms. (350 steps per ms) remains 174/174 properties
BEST_FIRST walk for 40004 steps (8 resets) in 106 ms. (373 steps per ms) remains 174/174 properties
BEST_FIRST walk for 40004 steps (8 resets) in 107 ms. (370 steps per ms) remains 174/174 properties
BEST_FIRST walk for 40004 steps (8 resets) in 112 ms. (354 steps per ms) remains 174/174 properties
BEST_FIRST walk for 40004 steps (8 resets) in 106 ms. (373 steps per ms) remains 174/174 properties
BEST_FIRST walk for 40004 steps (8 resets) in 113 ms. (350 steps per ms) remains 174/174 properties
BEST_FIRST walk for 40004 steps (8 resets) in 109 ms. (363 steps per ms) remains 174/174 properties
BEST_FIRST walk for 40004 steps (8 resets) in 108 ms. (367 steps per ms) remains 174/174 properties
BEST_FIRST walk for 40004 steps (8 resets) in 110 ms. (360 steps per ms) remains 174/174 properties
BEST_FIRST walk for 40004 steps (8 resets) in 112 ms. (354 steps per ms) remains 174/174 properties
BEST_FIRST walk for 40004 steps (8 resets) in 106 ms. (373 steps per ms) remains 174/174 properties
BEST_FIRST walk for 40004 steps (8 resets) in 102 ms. (388 steps per ms) remains 174/174 properties
BEST_FIRST walk for 40004 steps (8 resets) in 110 ms. (360 steps per ms) remains 174/174 properties
BEST_FIRST walk for 40004 steps (8 resets) in 109 ms. (363 steps per ms) remains 174/174 properties
BEST_FIRST walk for 40004 steps (8 resets) in 112 ms. (354 steps per ms) remains 174/174 properties
BEST_FIRST walk for 40004 steps (8 resets) in 106 ms. (373 steps per ms) remains 174/174 properties
BEST_FIRST walk for 40004 steps (8 resets) in 104 ms. (380 steps per ms) remains 174/174 properties
BEST_FIRST walk for 40004 steps (8 resets) in 108 ms. (367 steps per ms) remains 174/174 properties
BEST_FIRST walk for 40004 steps (8 resets) in 110 ms. (360 steps per ms) remains 174/174 properties
BEST_FIRST walk for 40004 steps (8 resets) in 114 ms. (347 steps per ms) remains 174/174 properties
BEST_FIRST walk for 40004 steps (8 resets) in 110 ms. (360 steps per ms) remains 174/174 properties
BEST_FIRST walk for 40004 steps (8 resets) in 107 ms. (370 steps per ms) remains 174/174 properties
BEST_FIRST walk for 40004 steps (8 resets) in 104 ms. (380 steps per ms) remains 174/174 properties
BEST_FIRST walk for 40004 steps (8 resets) in 117 ms. (339 steps per ms) remains 170/174 properties
BEST_FIRST walk for 40004 steps (8 resets) in 107 ms. (370 steps per ms) remains 170/170 properties
BEST_FIRST walk for 40004 steps (8 resets) in 109 ms. (363 steps per ms) remains 170/170 properties
BEST_FIRST walk for 40004 steps (8 resets) in 109 ms. (363 steps per ms) remains 170/170 properties
BEST_FIRST walk for 40004 steps (8 resets) in 110 ms. (360 steps per ms) remains 170/170 properties
BEST_FIRST walk for 40004 steps (8 resets) in 110 ms. (360 steps per ms) remains 170/170 properties
BEST_FIRST walk for 40004 steps (8 resets) in 109 ms. (363 steps per ms) remains 168/170 properties
BEST_FIRST walk for 40004 steps (8 resets) in 106 ms. (373 steps per ms) remains 168/168 properties
BEST_FIRST walk for 40004 steps (8 resets) in 109 ms. (363 steps per ms) remains 168/168 properties
BEST_FIRST walk for 40004 steps (8 resets) in 112 ms. (354 steps per ms) remains 168/168 properties
BEST_FIRST walk for 40004 steps (8 resets) in 110 ms. (360 steps per ms) remains 168/168 properties
BEST_FIRST walk for 40004 steps (8 resets) in 108 ms. (367 steps per ms) remains 168/168 properties
BEST_FIRST walk for 40004 steps (8 resets) in 106 ms. (373 steps per ms) remains 168/168 properties
BEST_FIRST walk for 40004 steps (8 resets) in 106 ms. (373 steps per ms) remains 168/168 properties
BEST_FIRST walk for 40004 steps (8 resets) in 110 ms. (360 steps per ms) remains 168/168 properties
BEST_FIRST walk for 40004 steps (8 resets) in 104 ms. (380 steps per ms) remains 168/168 properties
BEST_FIRST walk for 40004 steps (8 resets) in 107 ms. (370 steps per ms) remains 168/168 properties
BEST_FIRST walk for 40004 steps (8 resets) in 106 ms. (373 steps per ms) remains 168/168 properties
[2025-06-01 01:26:56] [INFO ] Flow matrix only has 216 transitions (discarded 164 similar events)
[2025-06-01 01:26:56] [INFO ] Invariant cache hit.
[2025-06-01 01:26:56] [INFO ] State equation strengthened by 112 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/67 variables, 67/67 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/67 variables, 1/68 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/67 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 3 (OVERLAPS) 61/128 variables, 8/76 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/128 variables, 61/137 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/128 variables, 4/141 constraints. Problems are: Problem set: 0 solved, 168 unsolved
[2025-06-01 01:26:57] [INFO ] Deduced a trap composed of 39 places in 70 ms of which 1 ms to minimize.
[2025-06-01 01:26:57] [INFO ] Deduced a trap composed of 34 places in 65 ms of which 1 ms to minimize.
[2025-06-01 01:26:57] [INFO ] Deduced a trap composed of 23 places in 53 ms of which 1 ms to minimize.
[2025-06-01 01:26:57] [INFO ] Deduced a trap composed of 17 places in 33 ms of which 1 ms to minimize.
[2025-06-01 01:26:57] [INFO ] Deduced a trap composed of 45 places in 67 ms of which 1 ms to minimize.
[2025-06-01 01:26:57] [INFO ] Deduced a trap composed of 61 places in 65 ms of which 1 ms to minimize.
[2025-06-01 01:26:57] [INFO ] Deduced a trap composed of 25 places in 65 ms of which 1 ms to minimize.
[2025-06-01 01:26:57] [INFO ] Deduced a trap composed of 48 places in 61 ms of which 1 ms to minimize.
[2025-06-01 01:26:57] [INFO ] Deduced a trap composed of 35 places in 60 ms of which 1 ms to minimize.
[2025-06-01 01:26:57] [INFO ] Deduced a trap composed of 40 places in 60 ms of which 1 ms to minimize.
[2025-06-01 01:26:58] [INFO ] Deduced a trap composed of 39 places in 53 ms of which 1 ms to minimize.
[2025-06-01 01:26:58] [INFO ] Deduced a trap composed of 40 places in 64 ms of which 1 ms to minimize.
[2025-06-01 01:26:58] [INFO ] Deduced a trap composed of 15 places in 32 ms of which 0 ms to minimize.
[2025-06-01 01:26:58] [INFO ] Deduced a trap composed of 47 places in 61 ms of which 1 ms to minimize.
[2025-06-01 01:26:58] [INFO ] Deduced a trap composed of 42 places in 73 ms of which 1 ms to minimize.
[2025-06-01 01:26:58] [INFO ] Deduced a trap composed of 3 places in 41 ms of which 1 ms to minimize.
[2025-06-01 01:26:58] [INFO ] Deduced a trap composed of 37 places in 69 ms of which 1 ms to minimize.
[2025-06-01 01:26:58] [INFO ] Deduced a trap composed of 32 places in 59 ms of which 1 ms to minimize.
[2025-06-01 01:26:58] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2025-06-01 01:26:58] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/128 variables, 20/161 constraints. Problems are: Problem set: 0 solved, 168 unsolved
[2025-06-01 01:26:59] [INFO ] Deduced a trap composed of 19 places in 66 ms of which 1 ms to minimize.
[2025-06-01 01:26:59] [INFO ] Deduced a trap composed of 46 places in 58 ms of which 1 ms to minimize.
[2025-06-01 01:26:59] [INFO ] Deduced a trap composed of 28 places in 55 ms of which 1 ms to minimize.
[2025-06-01 01:26:59] [INFO ] Deduced a trap composed of 35 places in 61 ms of which 1 ms to minimize.
[2025-06-01 01:26:59] [INFO ] Deduced a trap composed of 45 places in 57 ms of which 1 ms to minimize.
[2025-06-01 01:26:59] [INFO ] Deduced a trap composed of 38 places in 57 ms of which 1 ms to minimize.
[2025-06-01 01:26:59] [INFO ] Deduced a trap composed of 35 places in 63 ms of which 1 ms to minimize.
[2025-06-01 01:26:59] [INFO ] Deduced a trap composed of 38 places in 62 ms of which 1 ms to minimize.
[2025-06-01 01:26:59] [INFO ] Deduced a trap composed of 33 places in 65 ms of which 1 ms to minimize.
[2025-06-01 01:26:59] [INFO ] Deduced a trap composed of 27 places in 56 ms of which 1 ms to minimize.
[2025-06-01 01:26:59] [INFO ] Deduced a trap composed of 28 places in 62 ms of which 1 ms to minimize.
[2025-06-01 01:26:59] [INFO ] Deduced a trap composed of 3 places in 61 ms of which 1 ms to minimize.
[2025-06-01 01:26:59] [INFO ] Deduced a trap composed of 33 places in 57 ms of which 1 ms to minimize.
[2025-06-01 01:27:00] [INFO ] Deduced a trap composed of 11 places in 64 ms of which 1 ms to minimize.
[2025-06-01 01:27:00] [INFO ] Deduced a trap composed of 39 places in 63 ms of which 1 ms to minimize.
[2025-06-01 01:27:00] [INFO ] Deduced a trap composed of 43 places in 62 ms of which 1 ms to minimize.
[2025-06-01 01:27:00] [INFO ] Deduced a trap composed of 31 places in 55 ms of which 1 ms to minimize.
[2025-06-01 01:27:00] [INFO ] Deduced a trap composed of 44 places in 66 ms of which 1 ms to minimize.
[2025-06-01 01:27:00] [INFO ] Deduced a trap composed of 15 places in 63 ms of which 1 ms to minimize.
[2025-06-01 01:27:00] [INFO ] Deduced a trap composed of 37 places in 60 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/128 variables, 20/181 constraints. Problems are: Problem set: 0 solved, 168 unsolved
[2025-06-01 01:27:00] [INFO ] Deduced a trap composed of 43 places in 62 ms of which 1 ms to minimize.
[2025-06-01 01:27:00] [INFO ] Deduced a trap composed of 33 places in 60 ms of which 1 ms to minimize.
[2025-06-01 01:27:00] [INFO ] Deduced a trap composed of 45 places in 58 ms of which 1 ms to minimize.
[2025-06-01 01:27:01] [INFO ] Deduced a trap composed of 41 places in 57 ms of which 1 ms to minimize.
[2025-06-01 01:27:01] [INFO ] Deduced a trap composed of 37 places in 59 ms of which 1 ms to minimize.
[2025-06-01 01:27:01] [INFO ] Deduced a trap composed of 13 places in 55 ms of which 1 ms to minimize.
[2025-06-01 01:27:01] [INFO ] Deduced a trap composed of 40 places in 64 ms of which 1 ms to minimize.
[2025-06-01 01:27:01] [INFO ] Deduced a trap composed of 35 places in 58 ms of which 1 ms to minimize.
[2025-06-01 01:27:01] [INFO ] Deduced a trap composed of 33 places in 62 ms of which 1 ms to minimize.
[2025-06-01 01:27:01] [INFO ] Deduced a trap composed of 39 places in 60 ms of which 0 ms to minimize.
[2025-06-01 01:27:01] [INFO ] Deduced a trap composed of 41 places in 64 ms of which 1 ms to minimize.
[2025-06-01 01:27:01] [INFO ] Deduced a trap composed of 36 places in 57 ms of which 2 ms to minimize.
[2025-06-01 01:27:01] [INFO ] Deduced a trap composed of 33 places in 59 ms of which 0 ms to minimize.
[2025-06-01 01:27:02] [INFO ] Deduced a trap composed of 33 places in 64 ms of which 1 ms to minimize.
[2025-06-01 01:27:02] [INFO ] Deduced a trap composed of 33 places in 56 ms of which 1 ms to minimize.
[2025-06-01 01:27:02] [INFO ] Deduced a trap composed of 33 places in 63 ms of which 1 ms to minimize.
[2025-06-01 01:27:02] [INFO ] Deduced a trap composed of 40 places in 51 ms of which 1 ms to minimize.
[2025-06-01 01:27:02] [INFO ] Deduced a trap composed of 33 places in 46 ms of which 1 ms to minimize.
[2025-06-01 01:27:02] [INFO ] Deduced a trap composed of 36 places in 50 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/128 variables, 19/200 constraints. Problems are: Problem set: 0 solved, 168 unsolved
[2025-06-01 01:27:02] [INFO ] Deduced a trap composed of 42 places in 59 ms of which 1 ms to minimize.
[2025-06-01 01:27:02] [INFO ] Deduced a trap composed of 30 places in 50 ms of which 1 ms to minimize.
[2025-06-01 01:27:02] [INFO ] Deduced a trap composed of 25 places in 54 ms of which 1 ms to minimize.
[2025-06-01 01:27:02] [INFO ] Deduced a trap composed of 36 places in 48 ms of which 1 ms to minimize.
[2025-06-01 01:27:03] [INFO ] Deduced a trap composed of 28 places in 66 ms of which 1 ms to minimize.
[2025-06-01 01:27:04] [INFO ] Deduced a trap composed of 26 places in 59 ms of which 1 ms to minimize.
[2025-06-01 01:27:04] [INFO ] Deduced a trap composed of 34 places in 54 ms of which 1 ms to minimize.
[2025-06-01 01:27:04] [INFO ] Deduced a trap composed of 31 places in 75 ms of which 1 ms to minimize.
[2025-06-01 01:27:04] [INFO ] Deduced a trap composed of 27 places in 58 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/128 variables, 9/209 constraints. Problems are: Problem set: 0 solved, 168 unsolved
[2025-06-01 01:27:06] [INFO ] Deduced a trap composed of 36 places in 61 ms of which 1 ms to minimize.
[2025-06-01 01:27:06] [INFO ] Deduced a trap composed of 33 places in 55 ms of which 1 ms to minimize.
[2025-06-01 01:27:06] [INFO ] Deduced a trap composed of 33 places in 58 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/128 variables, 3/212 constraints. Problems are: Problem set: 0 solved, 168 unsolved
[2025-06-01 01:27:07] [INFO ] Deduced a trap composed of 37 places in 66 ms of which 1 ms to minimize.
[2025-06-01 01:27:07] [INFO ] Deduced a trap composed of 28 places in 60 ms of which 1 ms to minimize.
[2025-06-01 01:27:07] [INFO ] Deduced a trap composed of 28 places in 57 ms of which 1 ms to minimize.
[2025-06-01 01:27:07] [INFO ] Deduced a trap composed of 27 places in 55 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/128 variables, 4/216 constraints. Problems are: Problem set: 0 solved, 168 unsolved
[2025-06-01 01:27:08] [INFO ] Deduced a trap composed of 39 places in 59 ms of which 1 ms to minimize.
[2025-06-01 01:27:08] [INFO ] Deduced a trap composed of 28 places in 60 ms of which 1 ms to minimize.
[2025-06-01 01:27:08] [INFO ] Deduced a trap composed of 30 places in 58 ms of which 1 ms to minimize.
[2025-06-01 01:27:08] [INFO ] Deduced a trap composed of 52 places in 57 ms of which 1 ms to minimize.
[2025-06-01 01:27:08] [INFO ] Deduced a trap composed of 33 places in 50 ms of which 1 ms to minimize.
[2025-06-01 01:27:08] [INFO ] Deduced a trap composed of 37 places in 54 ms of which 1 ms to minimize.
[2025-06-01 01:27:08] [INFO ] Deduced a trap composed of 52 places in 62 ms of which 1 ms to minimize.
[2025-06-01 01:27:08] [INFO ] Deduced a trap composed of 29 places in 46 ms of which 2 ms to minimize.
[2025-06-01 01:27:08] [INFO ] Deduced a trap composed of 35 places in 61 ms of which 1 ms to minimize.
[2025-06-01 01:27:08] [INFO ] Deduced a trap composed of 35 places in 50 ms of which 1 ms to minimize.
[2025-06-01 01:27:09] [INFO ] Deduced a trap composed of 34 places in 60 ms of which 1 ms to minimize.
[2025-06-01 01:27:09] [INFO ] Deduced a trap composed of 27 places in 56 ms of which 1 ms to minimize.
[2025-06-01 01:27:09] [INFO ] Deduced a trap composed of 44 places in 67 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/128 variables, 13/229 constraints. Problems are: Problem set: 0 solved, 168 unsolved
[2025-06-01 01:27:10] [INFO ] Deduced a trap composed of 42 places in 70 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/128 variables, 1/230 constraints. Problems are: Problem set: 0 solved, 168 unsolved
[2025-06-01 01:27:11] [INFO ] Deduced a trap composed of 28 places in 57 ms of which 1 ms to minimize.
[2025-06-01 01:27:11] [INFO ] Deduced a trap composed of 36 places in 55 ms of which 1 ms to minimize.
[2025-06-01 01:27:11] [INFO ] Deduced a trap composed of 43 places in 74 ms of which 1 ms to minimize.
[2025-06-01 01:27:11] [INFO ] Deduced a trap composed of 40 places in 60 ms of which 1 ms to minimize.
[2025-06-01 01:27:11] [INFO ] Deduced a trap composed of 41 places in 56 ms of which 1 ms to minimize.
[2025-06-01 01:27:11] [INFO ] Deduced a trap composed of 42 places in 56 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/128 variables, 6/236 constraints. Problems are: Problem set: 0 solved, 168 unsolved
[2025-06-01 01:27:12] [INFO ] Deduced a trap composed of 39 places in 59 ms of which 1 ms to minimize.
[2025-06-01 01:27:12] [INFO ] Deduced a trap composed of 36 places in 52 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/128 variables, 2/238 constraints. Problems are: Problem set: 0 solved, 168 unsolved
[2025-06-01 01:27:13] [INFO ] Deduced a trap composed of 30 places in 61 ms of which 1 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/128 variables, 1/239 constraints. Problems are: Problem set: 0 solved, 168 unsolved
[2025-06-01 01:27:15] [INFO ] Deduced a trap composed of 36 places in 61 ms of which 1 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/128 variables, 1/240 constraints. Problems are: Problem set: 0 solved, 168 unsolved
[2025-06-01 01:27:15] [INFO ] Deduced a trap composed of 49 places in 61 ms of which 1 ms to minimize.
[2025-06-01 01:27:15] [INFO ] Deduced a trap composed of 32 places in 66 ms of which 1 ms to minimize.
[2025-06-01 01:27:16] [INFO ] Deduced a trap composed of 38 places in 70 ms of which 2 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/128 variables, 3/243 constraints. Problems are: Problem set: 0 solved, 168 unsolved
[2025-06-01 01:27:17] [INFO ] Deduced a trap composed of 37 places in 68 ms of which 1 ms to minimize.
[2025-06-01 01:27:17] [INFO ] Deduced a trap composed of 39 places in 73 ms of which 1 ms to minimize.
[2025-06-01 01:27:17] [INFO ] Deduced a trap composed of 43 places in 61 ms of which 1 ms to minimize.
[2025-06-01 01:27:18] [INFO ] Deduced a trap composed of 33 places in 59 ms of which 2 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/128 variables, 4/247 constraints. Problems are: Problem set: 0 solved, 168 unsolved
[2025-06-01 01:27:19] [INFO ] Deduced a trap composed of 38 places in 65 ms of which 4 ms to minimize.
[2025-06-01 01:27:19] [INFO ] Deduced a trap composed of 33 places in 50 ms of which 0 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/128 variables, 2/249 constraints. Problems are: Problem set: 0 solved, 168 unsolved
[2025-06-01 01:27:20] [INFO ] Deduced a trap composed of 37 places in 70 ms of which 1 ms to minimize.
[2025-06-01 01:27:20] [INFO ] Deduced a trap composed of 35 places in 56 ms of which 1 ms to minimize.
[2025-06-01 01:27:20] [INFO ] Deduced a trap composed of 46 places in 62 ms of which 1 ms to minimize.
At refinement iteration 21 (INCLUDED_ONLY) 0/128 variables, 3/252 constraints. Problems are: Problem set: 0 solved, 168 unsolved
[2025-06-01 01:27:22] [INFO ] Deduced a trap composed of 41 places in 60 ms of which 1 ms to minimize.
At refinement iteration 22 (INCLUDED_ONLY) 0/128 variables, 1/253 constraints. Problems are: Problem set: 0 solved, 168 unsolved
[2025-06-01 01:27:22] [INFO ] Deduced a trap composed of 43 places in 78 ms of which 1 ms to minimize.
[2025-06-01 01:27:23] [INFO ] Deduced a trap composed of 45 places in 63 ms of which 1 ms to minimize.
At refinement iteration 23 (INCLUDED_ONLY) 0/128 variables, 2/255 constraints. Problems are: Problem set: 0 solved, 168 unsolved
[2025-06-01 01:27:23] [INFO ] Deduced a trap composed of 56 places in 66 ms of which 1 ms to minimize.
[2025-06-01 01:27:24] [INFO ] Deduced a trap composed of 37 places in 65 ms of which 1 ms to minimize.
At refinement iteration 24 (INCLUDED_ONLY) 0/128 variables, 2/257 constraints. Problems are: Problem set: 0 solved, 168 unsolved
[2025-06-01 01:27:25] [INFO ] Deduced a trap composed of 49 places in 76 ms of which 1 ms to minimize.
[2025-06-01 01:27:25] [INFO ] Deduced a trap composed of 35 places in 58 ms of which 1 ms to minimize.
[2025-06-01 01:27:26] [INFO ] Deduced a trap composed of 33 places in 62 ms of which 1 ms to minimize.
[2025-06-01 01:27:26] [INFO ] Deduced a trap composed of 35 places in 56 ms of which 1 ms to minimize.
[2025-06-01 01:27:26] [INFO ] Deduced a trap composed of 35 places in 62 ms of which 1 ms to minimize.
[2025-06-01 01:27:26] [INFO ] Deduced a trap composed of 33 places in 54 ms of which 1 ms to minimize.
At refinement iteration 25 (INCLUDED_ONLY) 0/128 variables, 6/263 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/128 variables, 0/263 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 27 (OVERLAPS) 216/344 variables, 128/391 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/344 variables, 112/503 constraints. Problems are: Problem set: 0 solved, 168 unsolved
[2025-06-01 01:27:30] [INFO ] Deduced a trap composed of 37 places in 60 ms of which 1 ms to minimize.
At refinement iteration 29 (INCLUDED_ONLY) 0/344 variables, 1/504 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/344 variables, 0/504 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 31 (OVERLAPS) 0/344 variables, 0/504 constraints. Problems are: Problem set: 0 solved, 168 unsolved
No progress, stopping.
After SMT solving in domain Real declared 344/344 variables, and 504 constraints, problems are : Problem set: 0 solved, 168 unsolved in 44646 ms.
Refiners :[Domain max(s): 128/128 constraints, Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 128/128 constraints, ReadFeed: 112/112 constraints, PredecessorRefiner: 168/168 constraints, Known Traps: 123/123 constraints]
Escalating to Integer solving :Problem set: 0 solved, 168 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/67 variables, 67/67 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/67 variables, 1/68 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/67 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 3 (OVERLAPS) 61/128 variables, 8/76 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/128 variables, 61/137 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/128 variables, 4/141 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/128 variables, 123/264 constraints. Problems are: Problem set: 0 solved, 168 unsolved
[2025-06-01 01:27:41] [INFO ] Deduced a trap composed of 42 places in 67 ms of which 1 ms to minimize.
[2025-06-01 01:27:41] [INFO ] Deduced a trap composed of 45 places in 53 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/128 variables, 2/266 constraints. Problems are: Problem set: 0 solved, 168 unsolved
[2025-06-01 01:27:42] [INFO ] Deduced a trap composed of 45 places in 68 ms of which 1 ms to minimize.
[2025-06-01 01:27:43] [INFO ] Deduced a trap composed of 36 places in 62 ms of which 1 ms to minimize.
[2025-06-01 01:27:43] [INFO ] Deduced a trap composed of 30 places in 53 ms of which 1 ms to minimize.
[2025-06-01 01:27:43] [INFO ] Deduced a trap composed of 47 places in 58 ms of which 1 ms to minimize.
[2025-06-01 01:27:43] [INFO ] Deduced a trap composed of 41 places in 56 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/128 variables, 5/271 constraints. Problems are: Problem set: 0 solved, 168 unsolved
[2025-06-01 01:27:44] [INFO ] Deduced a trap composed of 41 places in 63 ms of which 1 ms to minimize.
[2025-06-01 01:27:44] [INFO ] Deduced a trap composed of 38 places in 57 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/128 variables, 2/273 constraints. Problems are: Problem set: 0 solved, 168 unsolved
[2025-06-01 01:27:45] [INFO ] Deduced a trap composed of 47 places in 52 ms of which 0 ms to minimize.
[2025-06-01 01:27:45] [INFO ] Deduced a trap composed of 43 places in 53 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/128 variables, 2/275 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/128 variables, 0/275 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 12 (OVERLAPS) 216/344 variables, 128/403 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/344 variables, 112/515 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/344 variables, 168/683 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/344 variables, 0/683 constraints. Problems are: Problem set: 0 solved, 168 unsolved
[2025-06-01 01:28:00] [INFO ] Deduced a trap composed of 50 places in 68 ms of which 1 ms to minimize.
At refinement iteration 16 (OVERLAPS) 0/344 variables, 1/684 constraints. Problems are: Problem set: 0 solved, 168 unsolved
[2025-06-01 01:28:08] [INFO ] Deduced a trap composed of 38 places in 60 ms of which 1 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/344 variables, 1/685 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/344 variables, 0/685 constraints. Problems are: Problem set: 0 solved, 168 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 344/344 variables, and 685 constraints, problems are : Problem set: 0 solved, 168 unsolved in 45014 ms.
Refiners :[Domain max(s): 128/128 constraints, Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 128/128 constraints, ReadFeed: 112/112 constraints, PredecessorRefiner: 168/168 constraints, Known Traps: 136/136 constraints]
After SMT, in 89736ms problems are : Problem set: 0 solved, 168 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 67 out of 128 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 128/128 places, 380/380 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 123 transition count 360
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 123 transition count 360
Applied a total of 10 rules in 23 ms. Remains 123 /128 variables (removed 5) and now considering 360/380 (removed 20) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 23 ms. Remains : 123/128 places, 360/380 transitions.
RANDOM walk for 4000000 steps (8 resets) in 64181 ms. (62 steps per ms) remains 168/168 properties
BEST_FIRST walk for 40004 steps (8 resets) in 132 ms. (300 steps per ms) remains 168/168 properties
BEST_FIRST walk for 40004 steps (8 resets) in 164 ms. (242 steps per ms) remains 168/168 properties
BEST_FIRST walk for 40004 steps (8 resets) in 138 ms. (287 steps per ms) remains 166/168 properties
BEST_FIRST walk for 40004 steps (8 resets) in 206 ms. (193 steps per ms) remains 166/166 properties
BEST_FIRST walk for 40004 steps (8 resets) in 137 ms. (289 steps per ms) remains 166/166 properties
BEST_FIRST walk for 40004 steps (8 resets) in 194 ms. (205 steps per ms) remains 166/166 properties
BEST_FIRST walk for 40004 steps (8 resets) in 132 ms. (300 steps per ms) remains 166/166 properties
BEST_FIRST walk for 40004 steps (8 resets) in 216 ms. (184 steps per ms) remains 166/166 properties
BEST_FIRST walk for 40004 steps (8 resets) in 135 ms. (294 steps per ms) remains 166/166 properties
BEST_FIRST walk for 40004 steps (8 resets) in 199 ms. (200 steps per ms) remains 166/166 properties
BEST_FIRST walk for 40004 steps (8 resets) in 140 ms. (283 steps per ms) remains 166/166 properties
BEST_FIRST walk for 40004 steps (8 resets) in 268 ms. (148 steps per ms) remains 166/166 properties
BEST_FIRST walk for 40004 steps (8 resets) in 258 ms. (154 steps per ms) remains 166/166 properties
BEST_FIRST walk for 40004 steps (8 resets) in 206 ms. (193 steps per ms) remains 166/166 properties
BEST_FIRST walk for 40004 steps (8 resets) in 194 ms. (205 steps per ms) remains 166/166 properties
BEST_FIRST walk for 40004 steps (8 resets) in 212 ms. (187 steps per ms) remains 166/166 properties
BEST_FIRST walk for 40004 steps (8 resets) in 175 ms. (227 steps per ms) remains 166/166 properties
BEST_FIRST walk for 40004 steps (8 resets) in 194 ms. (205 steps per ms) remains 166/166 properties
BEST_FIRST walk for 40004 steps (8 resets) in 126 ms. (314 steps per ms) remains 166/166 properties
BEST_FIRST walk for 40004 steps (8 resets) in 188 ms. (211 steps per ms) remains 166/166 properties
BEST_FIRST walk for 40004 steps (8 resets) in 204 ms. (195 steps per ms) remains 166/166 properties
BEST_FIRST walk for 40004 steps (8 resets) in 181 ms. (219 steps per ms) remains 166/166 properties
BEST_FIRST walk for 40004 steps (8 resets) in 254 ms. (156 steps per ms) remains 166/166 properties
BEST_FIRST walk for 40004 steps (8 resets) in 222 ms. (179 steps per ms) remains 166/166 properties
BEST_FIRST walk for 40004 steps (8 resets) in 239 ms. (166 steps per ms) remains 166/166 properties
BEST_FIRST walk for 40004 steps (8 resets) in 214 ms. (186 steps per ms) remains 166/166 properties
BEST_FIRST walk for 40004 steps (8 resets) in 231 ms. (172 steps per ms) remains 166/166 properties
BEST_FIRST walk for 40004 steps (8 resets) in 187 ms. (212 steps per ms) remains 166/166 properties
BEST_FIRST walk for 40004 steps (8 resets) in 215 ms. (185 steps per ms) remains 166/166 properties
BEST_FIRST walk for 40004 steps (8 resets) in 151 ms. (263 steps per ms) remains 166/166 properties
BEST_FIRST walk for 40004 steps (8 resets) in 153 ms. (259 steps per ms) remains 166/166 properties
BEST_FIRST walk for 40004 steps (8 resets) in 206 ms. (193 steps per ms) remains 166/166 properties
BEST_FIRST walk for 40004 steps (8 resets) in 127 ms. (312 steps per ms) remains 166/166 properties
BEST_FIRST walk for 40004 steps (8 resets) in 271 ms. (147 steps per ms) remains 166/166 properties
BEST_FIRST walk for 40004 steps (8 resets) in 167 ms. (238 steps per ms) remains 166/166 properties
BEST_FIRST walk for 40004 steps (8 resets) in 259 ms. (153 steps per ms) remains 166/166 properties
BEST_FIRST walk for 40004 steps (8 resets) in 151 ms. (263 steps per ms) remains 166/166 properties
BEST_FIRST walk for 40004 steps (8 resets) in 220 ms. (181 steps per ms) remains 166/166 properties
BEST_FIRST walk for 40004 steps (8 resets) in 171 ms. (232 steps per ms) remains 166/166 properties
BEST_FIRST walk for 40004 steps (8 resets) in 278 ms. (143 steps per ms) remains 166/166 properties
BEST_FIRST walk for 40004 steps (8 resets) in 164 ms. (242 steps per ms) remains 166/166 properties
BEST_FIRST walk for 40004 steps (8 resets) in 194 ms. (205 steps per ms) remains 166/166 properties
BEST_FIRST walk for 40004 steps (8 resets) in 146 ms. (272 steps per ms) remains 166/166 properties
BEST_FIRST walk for 40004 steps (8 resets) in 193 ms. (206 steps per ms) remains 166/166 properties
BEST_FIRST walk for 40004 steps (8 resets) in 163 ms. (243 steps per ms) remains 166/166 properties
BEST_FIRST walk for 40004 steps (8 resets) in 247 ms. (161 steps per ms) remains 166/166 properties
BEST_FIRST walk for 40004 steps (8 resets) in 257 ms. (155 steps per ms) remains 166/166 properties
BEST_FIRST walk for 40004 steps (8 resets) in 235 ms. (169 steps per ms) remains 166/166 properties
BEST_FIRST walk for 40004 steps (8 resets) in 170 ms. (233 steps per ms) remains 166/166 properties
BEST_FIRST walk for 40004 steps (8 resets) in 243 ms. (163 steps per ms) remains 166/166 properties
BEST_FIRST walk for 40004 steps (8 resets) in 162 ms. (245 steps per ms) remains 166/166 properties
BEST_FIRST walk for 40004 steps (8 resets) in 280 ms. (142 steps per ms) remains 166/166 properties
Finished probabilistic random walk after 1027738 steps, run visited all 166 properties in 7104 ms. (steps per millisecond=144 )
Probabilistic random walk after 1027738 steps, saw 206953 distinct states, run finished after 7110 ms. (steps per millisecond=144 ) properties seen :166
Able to resolve query QuasiLiveness after proving 380 properties.
FORMULA QuasiLiveness TRUE TECHNIQUES RANDOM_WALK PROBABILISTIC_WALK BESTFIRST_WALK TOPOLOGICAL INITIAL_STATE
Total runtime 184325 ms.
ITS solved all properties within timeout

BK_STOP 1748741336690

--------------------
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 QuasiLiveness -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="EisenbergMcGuire-PT-04"
export BK_EXAMINATION="QuasiLiveness"
export BK_TOOL="gold2024"
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-5832"
echo " Executing tool gold2024"
echo " Input is EisenbergMcGuire-PT-04, examination is QuasiLiveness"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r084-tall-174860080700477"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/EisenbergMcGuire-PT-04.tgz
mv EisenbergMcGuire-PT-04 execution
cd execution
if [ "QuasiLiveness" = "ReachabilityDeadlock" ] || [ "QuasiLiveness" = "UpperBounds" ] || [ "QuasiLiveness" = "QuasiLiveness" ] || [ "QuasiLiveness" = "StableMarking" ] || [ "QuasiLiveness" = "Liveness" ] || [ "QuasiLiveness" = "OneSafe" ] || [ "QuasiLiveness" = "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 [ "QuasiLiveness" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "QuasiLiveness" != "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 "QuasiLiveness.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 '' QuasiLiveness.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "QuasiLiveness" = "ReachabilityDeadlock" ] || [ "QuasiLiveness" = "QuasiLiveness" ] || [ "QuasiLiveness" = "StableMarking" ] || [ "QuasiLiveness" = "Liveness" ] || [ "QuasiLiveness" = "OneSafe" ] ; then
echo "FORMULA_NAME QuasiLiveness"
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 ;