About the Execution of LTSMin+red for TokenRing-PT-005
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 435.775 | 127120.00 | 318157.00 | 385.60 | F | normal |
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.r542-smll-171690581300097.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 TokenRing-PT-005, examination is QuasiLiveness
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r542-smll-171690581300097
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.9M
-rw-r--r-- 1 mcc users 61K Apr 11 19:06 CTLCardinality.txt
-rw-r--r-- 1 mcc users 352K Apr 11 19:06 CTLCardinality.xml
-rw-r--r-- 1 mcc users 109K Apr 11 19:05 CTLFireability.txt
-rw-r--r-- 1 mcc users 433K Apr 11 19:05 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 27K Apr 23 08:02 LTLCardinality.txt
-rw-r--r-- 1 mcc users 108K Apr 23 08:02 LTLCardinality.xml
-rw-r--r-- 1 mcc users 55K Apr 23 08:02 LTLFireability.txt
-rw-r--r-- 1 mcc users 168K Apr 23 08:02 LTLFireability.xml
-rw-r--r-- 1 mcc users 63K Apr 11 19:08 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 356K Apr 11 19:08 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 211K Apr 11 19:07 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 829K Apr 11 19:07 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 5.0K Apr 23 08:02 UpperBounds.txt
-rw-r--r-- 1 mcc users 13K Apr 23 08:02 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 119K May 18 16:43 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 1717250420093
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=QuasiLiveness
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=TokenRing-PT-005
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 14:00:22] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, QuasiLiveness, -timeout, 180, -rebuildPNML]
[2024-06-01 14:00:22] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 14:00:22] [INFO ] Load time of PNML (sax parser for PT used): 215 ms
[2024-06-01 14:00:22] [INFO ] Transformed 36 places.
[2024-06-01 14:00:22] [INFO ] Transformed 156 transitions.
[2024-06-01 14:00:22] [INFO ] Found NUPN structural information;
[2024-06-01 14:00:22] [INFO ] Parsed PT model containing 36 places and 156 transitions and 624 arcs in 594 ms.
Starting structural reductions in LIVENESS mode, iteration 0 : 36/36 places, 156/156 transitions.
Applied a total of 0 rules in 19 ms. Remains 36 /36 variables (removed 0) and now considering 156/156 (removed 0) transitions.
// Phase 1: matrix 156 rows 36 cols
[2024-06-01 14:00:22] [INFO ] Computed 6 invariants in 34 ms
[2024-06-01 14:00:23] [INFO ] Implicit Places using invariants in 418 ms returned []
[2024-06-01 14:00:23] [INFO ] Invariant cache hit.
[2024-06-01 14:00:23] [INFO ] State equation strengthened by 130 read => feed constraints.
[2024-06-01 14:00:23] [INFO ] Implicit Places using invariants and state equation in 381 ms returned []
Implicit Place search using SMT with State Equation took 872 ms to find 0 implicit places.
Running 151 sub problems to find dead transitions.
[2024-06-01 14:00:23] [INFO ] Invariant cache hit.
[2024-06-01 14:00:23] [INFO ] State equation strengthened by 130 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/36 variables, 36/36 constraints. Problems are: Problem set: 0 solved, 151 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/36 variables, 6/42 constraints. Problems are: Problem set: 0 solved, 151 unsolved
[2024-06-01 14:00:24] [INFO ] Deduced a trap composed of 19 places in 124 ms of which 23 ms to minimize.
[2024-06-01 14:00:24] [INFO ] Deduced a trap composed of 19 places in 51 ms of which 2 ms to minimize.
[2024-06-01 14:00:24] [INFO ] Deduced a trap composed of 19 places in 50 ms of which 3 ms to minimize.
[2024-06-01 14:00:25] [INFO ] Deduced a trap composed of 19 places in 45 ms of which 1 ms to minimize.
[2024-06-01 14:00:25] [INFO ] Deduced a trap composed of 20 places in 72 ms of which 1 ms to minimize.
[2024-06-01 14:00:25] [INFO ] Deduced a trap composed of 20 places in 62 ms of which 1 ms to minimize.
[2024-06-01 14:00:25] [INFO ] Deduced a trap composed of 19 places in 55 ms of which 1 ms to minimize.
[2024-06-01 14:00:25] [INFO ] Deduced a trap composed of 19 places in 56 ms of which 2 ms to minimize.
[2024-06-01 14:00:25] [INFO ] Deduced a trap composed of 19 places in 44 ms of which 2 ms to minimize.
[2024-06-01 14:00:25] [INFO ] Deduced a trap composed of 19 places in 45 ms of which 1 ms to minimize.
[2024-06-01 14:00:25] [INFO ] Deduced a trap composed of 20 places in 44 ms of which 1 ms to minimize.
[2024-06-01 14:00:25] [INFO ] Deduced a trap composed of 19 places in 45 ms of which 1 ms to minimize.
[2024-06-01 14:00:25] [INFO ] Deduced a trap composed of 19 places in 40 ms of which 1 ms to minimize.
[2024-06-01 14:00:25] [INFO ] Deduced a trap composed of 19 places in 39 ms of which 1 ms to minimize.
[2024-06-01 14:00:25] [INFO ] Deduced a trap composed of 19 places in 40 ms of which 1 ms to minimize.
[2024-06-01 14:00:25] [INFO ] Deduced a trap composed of 19 places in 39 ms of which 1 ms to minimize.
[2024-06-01 14:00:25] [INFO ] Deduced a trap composed of 20 places in 39 ms of which 1 ms to minimize.
[2024-06-01 14:00:25] [INFO ] Deduced a trap composed of 19 places in 41 ms of which 1 ms to minimize.
[2024-06-01 14:00:25] [INFO ] Deduced a trap composed of 19 places in 53 ms of which 1 ms to minimize.
[2024-06-01 14:00:25] [INFO ] Deduced a trap composed of 20 places in 50 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/36 variables, 20/62 constraints. Problems are: Problem set: 0 solved, 151 unsolved
[2024-06-01 14:00:25] [INFO ] Deduced a trap composed of 20 places in 39 ms of which 1 ms to minimize.
[2024-06-01 14:00:26] [INFO ] Deduced a trap composed of 20 places in 56 ms of which 2 ms to minimize.
[2024-06-01 14:00:26] [INFO ] Deduced a trap composed of 20 places in 50 ms of which 1 ms to minimize.
[2024-06-01 14:00:26] [INFO ] Deduced a trap composed of 19 places in 58 ms of which 2 ms to minimize.
[2024-06-01 14:00:26] [INFO ] Deduced a trap composed of 19 places in 59 ms of which 1 ms to minimize.
[2024-06-01 14:00:26] [INFO ] Deduced a trap composed of 19 places in 36 ms of which 1 ms to minimize.
[2024-06-01 14:00:26] [INFO ] Deduced a trap composed of 20 places in 47 ms of which 1 ms to minimize.
[2024-06-01 14:00:26] [INFO ] Deduced a trap composed of 21 places in 48 ms of which 1 ms to minimize.
[2024-06-01 14:00:26] [INFO ] Deduced a trap composed of 20 places in 37 ms of which 1 ms to minimize.
[2024-06-01 14:00:26] [INFO ] Deduced a trap composed of 19 places in 36 ms of which 1 ms to minimize.
[2024-06-01 14:00:26] [INFO ] Deduced a trap composed of 19 places in 37 ms of which 1 ms to minimize.
[2024-06-01 14:00:26] [INFO ] Deduced a trap composed of 20 places in 37 ms of which 1 ms to minimize.
[2024-06-01 14:00:26] [INFO ] Deduced a trap composed of 19 places in 38 ms of which 1 ms to minimize.
[2024-06-01 14:00:26] [INFO ] Deduced a trap composed of 19 places in 40 ms of which 1 ms to minimize.
[2024-06-01 14:00:26] [INFO ] Deduced a trap composed of 20 places in 48 ms of which 9 ms to minimize.
[2024-06-01 14:00:26] [INFO ] Deduced a trap composed of 20 places in 49 ms of which 1 ms to minimize.
[2024-06-01 14:00:26] [INFO ] Deduced a trap composed of 19 places in 42 ms of which 1 ms to minimize.
[2024-06-01 14:00:26] [INFO ] Deduced a trap composed of 20 places in 48 ms of which 1 ms to minimize.
[2024-06-01 14:00:26] [INFO ] Deduced a trap composed of 21 places in 47 ms of which 1 ms to minimize.
[2024-06-01 14:00:26] [INFO ] Deduced a trap composed of 21 places in 49 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/36 variables, 20/82 constraints. Problems are: Problem set: 0 solved, 151 unsolved
[2024-06-01 14:00:27] [INFO ] Deduced a trap composed of 19 places in 46 ms of which 2 ms to minimize.
[2024-06-01 14:00:27] [INFO ] Deduced a trap composed of 19 places in 45 ms of which 2 ms to minimize.
[2024-06-01 14:00:27] [INFO ] Deduced a trap composed of 20 places in 51 ms of which 1 ms to minimize.
[2024-06-01 14:00:27] [INFO ] Deduced a trap composed of 19 places in 52 ms of which 1 ms to minimize.
[2024-06-01 14:00:27] [INFO ] Deduced a trap composed of 19 places in 45 ms of which 1 ms to minimize.
[2024-06-01 14:00:27] [INFO ] Deduced a trap composed of 20 places in 45 ms of which 1 ms to minimize.
[2024-06-01 14:00:27] [INFO ] Deduced a trap composed of 19 places in 45 ms of which 1 ms to minimize.
[2024-06-01 14:00:27] [INFO ] Deduced a trap composed of 20 places in 34 ms of which 1 ms to minimize.
[2024-06-01 14:00:27] [INFO ] Deduced a trap composed of 19 places in 44 ms of which 1 ms to minimize.
[2024-06-01 14:00:27] [INFO ] Deduced a trap composed of 19 places in 45 ms of which 1 ms to minimize.
[2024-06-01 14:00:27] [INFO ] Deduced a trap composed of 19 places in 45 ms of which 3 ms to minimize.
[2024-06-01 14:00:28] [INFO ] Deduced a trap composed of 19 places in 34 ms of which 1 ms to minimize.
[2024-06-01 14:00:28] [INFO ] Deduced a trap composed of 19 places in 33 ms of which 1 ms to minimize.
[2024-06-01 14:00:28] [INFO ] Deduced a trap composed of 20 places in 34 ms of which 1 ms to minimize.
[2024-06-01 14:00:28] [INFO ] Deduced a trap composed of 20 places in 34 ms of which 1 ms to minimize.
[2024-06-01 14:00:28] [INFO ] Deduced a trap composed of 20 places in 46 ms of which 1 ms to minimize.
[2024-06-01 14:00:28] [INFO ] Deduced a trap composed of 19 places in 58 ms of which 15 ms to minimize.
[2024-06-01 14:00:28] [INFO ] Deduced a trap composed of 19 places in 36 ms of which 1 ms to minimize.
[2024-06-01 14:00:28] [INFO ] Deduced a trap composed of 19 places in 34 ms of which 1 ms to minimize.
[2024-06-01 14:00:28] [INFO ] Deduced a trap composed of 19 places in 37 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/36 variables, 20/102 constraints. Problems are: Problem set: 0 solved, 151 unsolved
[2024-06-01 14:00:28] [INFO ] Deduced a trap composed of 20 places in 34 ms of which 1 ms to minimize.
[2024-06-01 14:00:28] [INFO ] Deduced a trap composed of 19 places in 36 ms of which 1 ms to minimize.
[2024-06-01 14:00:28] [INFO ] Deduced a trap composed of 19 places in 38 ms of which 1 ms to minimize.
[2024-06-01 14:00:28] [INFO ] Deduced a trap composed of 19 places in 38 ms of which 2 ms to minimize.
[2024-06-01 14:00:28] [INFO ] Deduced a trap composed of 21 places in 42 ms of which 1 ms to minimize.
[2024-06-01 14:00:28] [INFO ] Deduced a trap composed of 19 places in 40 ms of which 1 ms to minimize.
[2024-06-01 14:00:28] [INFO ] Deduced a trap composed of 20 places in 41 ms of which 1 ms to minimize.
[2024-06-01 14:00:28] [INFO ] Deduced a trap composed of 19 places in 43 ms of which 1 ms to minimize.
[2024-06-01 14:00:29] [INFO ] Deduced a trap composed of 19 places in 43 ms of which 1 ms to minimize.
[2024-06-01 14:00:29] [INFO ] Deduced a trap composed of 19 places in 40 ms of which 0 ms to minimize.
[2024-06-01 14:00:29] [INFO ] Deduced a trap composed of 19 places in 40 ms of which 1 ms to minimize.
[2024-06-01 14:00:29] [INFO ] Deduced a trap composed of 19 places in 48 ms of which 1 ms to minimize.
[2024-06-01 14:00:29] [INFO ] Deduced a trap composed of 20 places in 36 ms of which 1 ms to minimize.
[2024-06-01 14:00:29] [INFO ] Deduced a trap composed of 19 places in 35 ms of which 0 ms to minimize.
[2024-06-01 14:00:29] [INFO ] Deduced a trap composed of 19 places in 36 ms of which 1 ms to minimize.
[2024-06-01 14:00:29] [INFO ] Deduced a trap composed of 21 places in 34 ms of which 0 ms to minimize.
[2024-06-01 14:00:29] [INFO ] Deduced a trap composed of 20 places in 59 ms of which 1 ms to minimize.
[2024-06-01 14:00:29] [INFO ] Deduced a trap composed of 20 places in 35 ms of which 1 ms to minimize.
[2024-06-01 14:00:29] [INFO ] Deduced a trap composed of 20 places in 34 ms of which 1 ms to minimize.
[2024-06-01 14:00:29] [INFO ] Deduced a trap composed of 19 places in 34 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/36 variables, 20/122 constraints. Problems are: Problem set: 0 solved, 151 unsolved
[2024-06-01 14:00:29] [INFO ] Deduced a trap composed of 19 places in 40 ms of which 1 ms to minimize.
[2024-06-01 14:00:29] [INFO ] Deduced a trap composed of 19 places in 37 ms of which 1 ms to minimize.
[2024-06-01 14:00:30] [INFO ] Deduced a trap composed of 20 places in 39 ms of which 1 ms to minimize.
[2024-06-01 14:00:30] [INFO ] Deduced a trap composed of 20 places in 39 ms of which 1 ms to minimize.
[2024-06-01 14:00:30] [INFO ] Deduced a trap composed of 19 places in 36 ms of which 1 ms to minimize.
[2024-06-01 14:00:30] [INFO ] Deduced a trap composed of 20 places in 37 ms of which 1 ms to minimize.
[2024-06-01 14:00:30] [INFO ] Deduced a trap composed of 20 places in 38 ms of which 1 ms to minimize.
[2024-06-01 14:00:30] [INFO ] Deduced a trap composed of 20 places in 36 ms of which 1 ms to minimize.
[2024-06-01 14:00:30] [INFO ] Deduced a trap composed of 19 places in 36 ms of which 1 ms to minimize.
[2024-06-01 14:00:30] [INFO ] Deduced a trap composed of 19 places in 38 ms of which 1 ms to minimize.
[2024-06-01 14:00:30] [INFO ] Deduced a trap composed of 19 places in 38 ms of which 1 ms to minimize.
[2024-06-01 14:00:30] [INFO ] Deduced a trap composed of 19 places in 36 ms of which 1 ms to minimize.
[2024-06-01 14:00:30] [INFO ] Deduced a trap composed of 19 places in 40 ms of which 1 ms to minimize.
[2024-06-01 14:00:30] [INFO ] Deduced a trap composed of 19 places in 38 ms of which 1 ms to minimize.
[2024-06-01 14:00:30] [INFO ] Deduced a trap composed of 19 places in 42 ms of which 1 ms to minimize.
[2024-06-01 14:00:30] [INFO ] Deduced a trap composed of 20 places in 41 ms of which 1 ms to minimize.
[2024-06-01 14:00:30] [INFO ] Deduced a trap composed of 19 places in 42 ms of which 1 ms to minimize.
[2024-06-01 14:00:30] [INFO ] Deduced a trap composed of 20 places in 42 ms of which 1 ms to minimize.
[2024-06-01 14:00:30] [INFO ] Deduced a trap composed of 19 places in 49 ms of which 1 ms to minimize.
[2024-06-01 14:00:30] [INFO ] Deduced a trap composed of 19 places in 50 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/36 variables, 20/142 constraints. Problems are: Problem set: 0 solved, 151 unsolved
[2024-06-01 14:00:31] [INFO ] Deduced a trap composed of 19 places in 33 ms of which 0 ms to minimize.
[2024-06-01 14:00:31] [INFO ] Deduced a trap composed of 19 places in 48 ms of which 0 ms to minimize.
[2024-06-01 14:00:31] [INFO ] Deduced a trap composed of 21 places in 34 ms of which 1 ms to minimize.
[2024-06-01 14:00:31] [INFO ] Deduced a trap composed of 20 places in 52 ms of which 1 ms to minimize.
[2024-06-01 14:00:31] [INFO ] Deduced a trap composed of 19 places in 44 ms of which 2 ms to minimize.
[2024-06-01 14:00:31] [INFO ] Deduced a trap composed of 19 places in 54 ms of which 1 ms to minimize.
[2024-06-01 14:00:32] [INFO ] Deduced a trap composed of 20 places in 42 ms of which 1 ms to minimize.
[2024-06-01 14:00:32] [INFO ] Deduced a trap composed of 19 places in 40 ms of which 1 ms to minimize.
[2024-06-01 14:00:32] [INFO ] Deduced a trap composed of 20 places in 38 ms of which 1 ms to minimize.
[2024-06-01 14:00:32] [INFO ] Deduced a trap composed of 19 places in 39 ms of which 1 ms to minimize.
[2024-06-01 14:00:32] [INFO ] Deduced a trap composed of 19 places in 41 ms of which 1 ms to minimize.
[2024-06-01 14:00:32] [INFO ] Deduced a trap composed of 19 places in 61 ms of which 1 ms to minimize.
[2024-06-01 14:00:32] [INFO ] Deduced a trap composed of 20 places in 39 ms of which 1 ms to minimize.
[2024-06-01 14:00:32] [INFO ] Deduced a trap composed of 19 places in 48 ms of which 2 ms to minimize.
[2024-06-01 14:00:32] [INFO ] Deduced a trap composed of 19 places in 49 ms of which 1 ms to minimize.
[2024-06-01 14:00:32] [INFO ] Deduced a trap composed of 20 places in 47 ms of which 1 ms to minimize.
[2024-06-01 14:00:32] [INFO ] Deduced a trap composed of 21 places in 39 ms of which 0 ms to minimize.
[2024-06-01 14:00:32] [INFO ] Deduced a trap composed of 20 places in 54 ms of which 1 ms to minimize.
[2024-06-01 14:00:32] [INFO ] Deduced a trap composed of 19 places in 40 ms of which 1 ms to minimize.
[2024-06-01 14:00:32] [INFO ] Deduced a trap composed of 19 places in 41 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/36 variables, 20/162 constraints. Problems are: Problem set: 0 solved, 151 unsolved
[2024-06-01 14:00:32] [INFO ] Deduced a trap composed of 19 places in 38 ms of which 1 ms to minimize.
[2024-06-01 14:00:33] [INFO ] Deduced a trap composed of 19 places in 61 ms of which 1 ms to minimize.
[2024-06-01 14:00:33] [INFO ] Deduced a trap composed of 19 places in 48 ms of which 2 ms to minimize.
[2024-06-01 14:00:33] [INFO ] Deduced a trap composed of 21 places in 44 ms of which 1 ms to minimize.
[2024-06-01 14:00:33] [INFO ] Deduced a trap composed of 19 places in 55 ms of which 1 ms to minimize.
[2024-06-01 14:00:33] [INFO ] Deduced a trap composed of 19 places in 39 ms of which 1 ms to minimize.
[2024-06-01 14:00:33] [INFO ] Deduced a trap composed of 20 places in 38 ms of which 1 ms to minimize.
[2024-06-01 14:00:33] [INFO ] Deduced a trap composed of 19 places in 56 ms of which 1 ms to minimize.
[2024-06-01 14:00:33] [INFO ] Deduced a trap composed of 19 places in 49 ms of which 1 ms to minimize.
[2024-06-01 14:00:33] [INFO ] Deduced a trap composed of 20 places in 47 ms of which 1 ms to minimize.
[2024-06-01 14:00:33] [INFO ] Deduced a trap composed of 20 places in 39 ms of which 1 ms to minimize.
[2024-06-01 14:00:33] [INFO ] Deduced a trap composed of 20 places in 45 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/36 variables, 12/174 constraints. Problems are: Problem set: 0 solved, 151 unsolved
[2024-06-01 14:00:34] [INFO ] Deduced a trap composed of 19 places in 38 ms of which 2 ms to minimize.
[2024-06-01 14:00:34] [INFO ] Deduced a trap composed of 19 places in 42 ms of which 1 ms to minimize.
[2024-06-01 14:00:34] [INFO ] Deduced a trap composed of 20 places in 60 ms of which 1 ms to minimize.
[2024-06-01 14:00:34] [INFO ] Deduced a trap composed of 19 places in 49 ms of which 1 ms to minimize.
[2024-06-01 14:00:34] [INFO ] Deduced a trap composed of 19 places in 37 ms of which 1 ms to minimize.
[2024-06-01 14:00:34] [INFO ] Deduced a trap composed of 20 places in 44 ms of which 1 ms to minimize.
[2024-06-01 14:00:34] [INFO ] Deduced a trap composed of 19 places in 35 ms of which 1 ms to minimize.
[2024-06-01 14:00:34] [INFO ] Deduced a trap composed of 20 places in 51 ms of which 1 ms to minimize.
[2024-06-01 14:00:35] [INFO ] Deduced a trap composed of 20 places in 35 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/36 variables, 9/183 constraints. Problems are: Problem set: 0 solved, 151 unsolved
[2024-06-01 14:00:35] [INFO ] Deduced a trap composed of 19 places in 45 ms of which 1 ms to minimize.
[2024-06-01 14:00:35] [INFO ] Deduced a trap composed of 19 places in 46 ms of which 3 ms to minimize.
[2024-06-01 14:00:35] [INFO ] Deduced a trap composed of 19 places in 34 ms of which 1 ms to minimize.
[2024-06-01 14:00:35] [INFO ] Deduced a trap composed of 19 places in 46 ms of which 1 ms to minimize.
[2024-06-01 14:00:36] [INFO ] Deduced a trap composed of 20 places in 35 ms of which 1 ms to minimize.
[2024-06-01 14:00:36] [INFO ] Deduced a trap composed of 19 places in 34 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/36 variables, 6/189 constraints. Problems are: Problem set: 0 solved, 151 unsolved
[2024-06-01 14:00:37] [INFO ] Deduced a trap composed of 19 places in 32 ms of which 1 ms to minimize.
[2024-06-01 14:00:37] [INFO ] Deduced a trap composed of 19 places in 52 ms of which 1 ms to minimize.
[2024-06-01 14:00:37] [INFO ] Deduced a trap composed of 19 places in 44 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/36 variables, 3/192 constraints. Problems are: Problem set: 0 solved, 151 unsolved
[2024-06-01 14:00:37] [INFO ] Deduced a trap composed of 19 places in 35 ms of which 1 ms to minimize.
[2024-06-01 14:00:37] [INFO ] Deduced a trap composed of 19 places in 33 ms of which 1 ms to minimize.
[2024-06-01 14:00:37] [INFO ] Deduced a trap composed of 19 places in 36 ms of which 1 ms to minimize.
[2024-06-01 14:00:38] [INFO ] Deduced a trap composed of 19 places in 47 ms of which 2 ms to minimize.
[2024-06-01 14:00:38] [INFO ] Deduced a trap composed of 19 places in 50 ms of which 1 ms to minimize.
[2024-06-01 14:00:38] [INFO ] Deduced a trap composed of 20 places in 45 ms of which 1 ms to minimize.
[2024-06-01 14:00:38] [INFO ] Deduced a trap composed of 19 places in 38 ms of which 1 ms to minimize.
[2024-06-01 14:00:38] [INFO ] Deduced a trap composed of 20 places in 42 ms of which 1 ms to minimize.
[2024-06-01 14:00:38] [INFO ] Deduced a trap composed of 20 places in 39 ms of which 1 ms to minimize.
[2024-06-01 14:00:38] [INFO ] Deduced a trap composed of 19 places in 49 ms of which 1 ms to minimize.
[2024-06-01 14:00:38] [INFO ] Deduced a trap composed of 19 places in 40 ms of which 1 ms to minimize.
[2024-06-01 14:00:38] [INFO ] Deduced a trap composed of 19 places in 39 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/36 variables, 12/204 constraints. Problems are: Problem set: 0 solved, 151 unsolved
[2024-06-01 14:00:39] [INFO ] Deduced a trap composed of 19 places in 45 ms of which 1 ms to minimize.
[2024-06-01 14:00:39] [INFO ] Deduced a trap composed of 20 places in 33 ms of which 0 ms to minimize.
[2024-06-01 14:00:39] [INFO ] Deduced a trap composed of 19 places in 32 ms of which 1 ms to minimize.
[2024-06-01 14:00:39] [INFO ] Deduced a trap composed of 20 places in 35 ms of which 1 ms to minimize.
[2024-06-01 14:00:39] [INFO ] Deduced a trap composed of 19 places in 33 ms of which 1 ms to minimize.
[2024-06-01 14:00:40] [INFO ] Deduced a trap composed of 20 places in 35 ms of which 1 ms to minimize.
[2024-06-01 14:00:40] [INFO ] Deduced a trap composed of 19 places in 32 ms of which 1 ms to minimize.
[2024-06-01 14:00:40] [INFO ] Deduced a trap composed of 20 places in 32 ms of which 1 ms to minimize.
[2024-06-01 14:00:40] [INFO ] Deduced a trap composed of 19 places in 32 ms of which 1 ms to minimize.
[2024-06-01 14:00:40] [INFO ] Deduced a trap composed of 20 places in 45 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/36 variables, 10/214 constraints. Problems are: Problem set: 0 solved, 151 unsolved
[2024-06-01 14:00:41] [INFO ] Deduced a trap composed of 19 places in 35 ms of which 1 ms to minimize.
[2024-06-01 14:00:41] [INFO ] Deduced a trap composed of 21 places in 43 ms of which 1 ms to minimize.
[2024-06-01 14:00:41] [INFO ] Deduced a trap composed of 20 places in 45 ms of which 1 ms to minimize.
[2024-06-01 14:00:41] [INFO ] Deduced a trap composed of 20 places in 39 ms of which 2 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/36 variables, 4/218 constraints. Problems are: Problem set: 0 solved, 151 unsolved
[2024-06-01 14:00:42] [INFO ] Deduced a trap composed of 19 places in 44 ms of which 1 ms to minimize.
[2024-06-01 14:00:42] [INFO ] Deduced a trap composed of 19 places in 44 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/36 variables, 2/220 constraints. Problems are: Problem set: 0 solved, 151 unsolved
[2024-06-01 14:00:43] [INFO ] Deduced a trap composed of 19 places in 44 ms of which 1 ms to minimize.
[2024-06-01 14:00:43] [INFO ] Deduced a trap composed of 19 places in 42 ms of which 1 ms to minimize.
[2024-06-01 14:00:43] [INFO ] Deduced a trap composed of 21 places in 44 ms of which 1 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/36 variables, 3/223 constraints. Problems are: Problem set: 0 solved, 151 unsolved
[2024-06-01 14:00:44] [INFO ] Deduced a trap composed of 21 places in 46 ms of which 1 ms to minimize.
[2024-06-01 14:00:44] [INFO ] Deduced a trap composed of 19 places in 33 ms of which 1 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/36 variables, 2/225 constraints. Problems are: Problem set: 0 solved, 151 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/36 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 151 unsolved
At refinement iteration 19 (OVERLAPS) 156/192 variables, 36/261 constraints. Problems are: Problem set: 0 solved, 151 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/192 variables, 130/391 constraints. Problems are: Problem set: 0 solved, 151 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/192 variables, 0/391 constraints. Problems are: Problem set: 0 solved, 151 unsolved
[2024-06-01 14:00:53] [INFO ] Deduced a trap composed of 20 places in 42 ms of which 1 ms to minimize.
At refinement iteration 22 (OVERLAPS) 0/192 variables, 1/392 constraints. Problems are: Problem set: 0 solved, 151 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 192/192 variables, and 392 constraints, problems are : Problem set: 0 solved, 151 unsolved in 30019 ms.
Refiners :[Domain max(s): 36/36 constraints, Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 36/36 constraints, ReadFeed: 130/130 constraints, PredecessorRefiner: 151/151 constraints, Known Traps: 184/184 constraints]
Escalating to Integer solving :Problem set: 0 solved, 151 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/36 variables, 36/36 constraints. Problems are: Problem set: 0 solved, 151 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/36 variables, 6/42 constraints. Problems are: Problem set: 0 solved, 151 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/36 variables, 184/226 constraints. Problems are: Problem set: 0 solved, 151 unsolved
[2024-06-01 14:00:54] [INFO ] Deduced a trap composed of 19 places in 46 ms of which 1 ms to minimize.
[2024-06-01 14:00:54] [INFO ] Deduced a trap composed of 19 places in 40 ms of which 1 ms to minimize.
[2024-06-01 14:00:54] [INFO ] Deduced a trap composed of 19 places in 42 ms of which 1 ms to minimize.
[2024-06-01 14:00:54] [INFO ] Deduced a trap composed of 19 places in 40 ms of which 1 ms to minimize.
[2024-06-01 14:00:55] [INFO ] Deduced a trap composed of 19 places in 49 ms of which 1 ms to minimize.
[2024-06-01 14:00:55] [INFO ] Deduced a trap composed of 20 places in 37 ms of which 1 ms to minimize.
[2024-06-01 14:00:55] [INFO ] Deduced a trap composed of 19 places in 38 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/36 variables, 7/233 constraints. Problems are: Problem set: 0 solved, 151 unsolved
[2024-06-01 14:00:55] [INFO ] Deduced a trap composed of 19 places in 47 ms of which 2 ms to minimize.
[2024-06-01 14:00:56] [INFO ] Deduced a trap composed of 19 places in 52 ms of which 2 ms to minimize.
[2024-06-01 14:00:56] [INFO ] Deduced a trap composed of 19 places in 39 ms of which 1 ms to minimize.
[2024-06-01 14:00:56] [INFO ] Deduced a trap composed of 19 places in 52 ms of which 1 ms to minimize.
[2024-06-01 14:00:56] [INFO ] Deduced a trap composed of 21 places in 57 ms of which 1 ms to minimize.
[2024-06-01 14:00:56] [INFO ] Deduced a trap composed of 19 places in 56 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/36 variables, 6/239 constraints. Problems are: Problem set: 0 solved, 151 unsolved
[2024-06-01 14:00:57] [INFO ] Deduced a trap composed of 19 places in 49 ms of which 1 ms to minimize.
[2024-06-01 14:00:57] [INFO ] Deduced a trap composed of 21 places in 48 ms of which 1 ms to minimize.
[2024-06-01 14:00:57] [INFO ] Deduced a trap composed of 19 places in 49 ms of which 1 ms to minimize.
[2024-06-01 14:00:57] [INFO ] Deduced a trap composed of 19 places in 38 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/36 variables, 4/243 constraints. Problems are: Problem set: 0 solved, 151 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/36 variables, 0/243 constraints. Problems are: Problem set: 0 solved, 151 unsolved
At refinement iteration 7 (OVERLAPS) 156/192 variables, 36/279 constraints. Problems are: Problem set: 0 solved, 151 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/192 variables, 130/409 constraints. Problems are: Problem set: 0 solved, 151 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/192 variables, 151/560 constraints. Problems are: Problem set: 0 solved, 151 unsolved
[2024-06-01 14:01:04] [INFO ] Deduced a trap composed of 19 places in 45 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/192 variables, 1/561 constraints. Problems are: Problem set: 0 solved, 151 unsolved
[2024-06-01 14:01:07] [INFO ] Deduced a trap composed of 19 places in 39 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/192 variables, 1/562 constraints. Problems are: Problem set: 0 solved, 151 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/192 variables, 0/562 constraints. Problems are: Problem set: 0 solved, 151 unsolved
At refinement iteration 13 (OVERLAPS) 0/192 variables, 0/562 constraints. Problems are: Problem set: 0 solved, 151 unsolved
No progress, stopping.
After SMT solving in domain Int declared 192/192 variables, and 562 constraints, problems are : Problem set: 0 solved, 151 unsolved in 28145 ms.
Refiners :[Domain max(s): 36/36 constraints, Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 36/36 constraints, ReadFeed: 130/130 constraints, PredecessorRefiner: 151/151 constraints, Known Traps: 203/203 constraints]
After SMT, in 58395ms problems are : Problem set: 0 solved, 151 unsolved
Search for dead transitions found 0 dead transitions in 58422ms
Finished structural reductions in LIVENESS mode , in 1 iterations and 59367 ms. Remains : 36/36 places, 156/156 transitions.
Initial state reduction rules removed 5 formulas.
RANDOM walk for 40000 steps (8 resets) in 3757 ms. (10 steps per ms) remains 92/151 properties
BEST_FIRST walk for 4000 steps (8 resets) in 124 ms. (32 steps per ms) remains 89/92 properties
BEST_FIRST walk for 4000 steps (8 resets) in 119 ms. (33 steps per ms) remains 86/89 properties
BEST_FIRST walk for 4000 steps (8 resets) in 59 ms. (66 steps per ms) remains 86/86 properties
BEST_FIRST walk for 4000 steps (8 resets) in 180 ms. (22 steps per ms) remains 86/86 properties
BEST_FIRST walk for 4000 steps (8 resets) in 128 ms. (31 steps per ms) remains 86/86 properties
BEST_FIRST walk for 4000 steps (8 resets) in 77 ms. (51 steps per ms) remains 86/86 properties
BEST_FIRST walk for 4000 steps (8 resets) in 65 ms. (60 steps per ms) remains 86/86 properties
BEST_FIRST walk for 4000 steps (8 resets) in 44 ms. (88 steps per ms) remains 86/86 properties
BEST_FIRST walk for 4000 steps (8 resets) in 41 ms. (95 steps per ms) remains 86/86 properties
BEST_FIRST walk for 4000 steps (8 resets) in 41 ms. (95 steps per ms) remains 86/86 properties
BEST_FIRST walk for 4000 steps (8 resets) in 51 ms. (76 steps per ms) remains 86/86 properties
BEST_FIRST walk for 4000 steps (8 resets) in 51 ms. (76 steps per ms) remains 86/86 properties
BEST_FIRST walk for 4000 steps (8 resets) in 55 ms. (71 steps per ms) remains 86/86 properties
BEST_FIRST walk for 4000 steps (8 resets) in 51 ms. (76 steps per ms) remains 86/86 properties
BEST_FIRST walk for 4000 steps (8 resets) in 51 ms. (76 steps per ms) remains 86/86 properties
BEST_FIRST walk for 4000 steps (8 resets) in 77 ms. (51 steps per ms) remains 86/86 properties
BEST_FIRST walk for 4000 steps (8 resets) in 51 ms. (76 steps per ms) remains 86/86 properties
BEST_FIRST walk for 4000 steps (8 resets) in 54 ms. (72 steps per ms) remains 86/86 properties
BEST_FIRST walk for 4000 steps (8 resets) in 71 ms. (55 steps per ms) remains 86/86 properties
BEST_FIRST walk for 4000 steps (8 resets) in 51 ms. (76 steps per ms) remains 86/86 properties
BEST_FIRST walk for 4000 steps (8 resets) in 49 ms. (80 steps per ms) remains 86/86 properties
BEST_FIRST walk for 4000 steps (8 resets) in 51 ms. (76 steps per ms) remains 86/86 properties
BEST_FIRST walk for 4000 steps (8 resets) in 50 ms. (78 steps per ms) remains 86/86 properties
BEST_FIRST walk for 4000 steps (8 resets) in 80 ms. (49 steps per ms) remains 86/86 properties
BEST_FIRST walk for 4000 steps (8 resets) in 51 ms. (76 steps per ms) remains 86/86 properties
BEST_FIRST walk for 4000 steps (8 resets) in 76 ms. (51 steps per ms) remains 86/86 properties
BEST_FIRST walk for 4000 steps (8 resets) in 63 ms. (62 steps per ms) remains 86/86 properties
BEST_FIRST walk for 4000 steps (8 resets) in 51 ms. (76 steps per ms) remains 86/86 properties
BEST_FIRST walk for 4000 steps (8 resets) in 52 ms. (75 steps per ms) remains 86/86 properties
BEST_FIRST walk for 4000 steps (8 resets) in 53 ms. (74 steps per ms) remains 86/86 properties
BEST_FIRST walk for 4000 steps (8 resets) in 52 ms. (75 steps per ms) remains 86/86 properties
BEST_FIRST walk for 4000 steps (8 resets) in 77 ms. (51 steps per ms) remains 86/86 properties
BEST_FIRST walk for 4000 steps (8 resets) in 75 ms. (52 steps per ms) remains 86/86 properties
BEST_FIRST walk for 4000 steps (8 resets) in 49 ms. (80 steps per ms) remains 86/86 properties
BEST_FIRST walk for 4000 steps (8 resets) in 51 ms. (76 steps per ms) remains 86/86 properties
BEST_FIRST walk for 4000 steps (8 resets) in 61 ms. (64 steps per ms) remains 86/86 properties
BEST_FIRST walk for 4000 steps (8 resets) in 50 ms. (78 steps per ms) remains 86/86 properties
BEST_FIRST walk for 4000 steps (8 resets) in 52 ms. (75 steps per ms) remains 86/86 properties
BEST_FIRST walk for 4000 steps (8 resets) in 65 ms. (60 steps per ms) remains 86/86 properties
BEST_FIRST walk for 4000 steps (8 resets) in 75 ms. (52 steps per ms) remains 86/86 properties
BEST_FIRST walk for 4000 steps (8 resets) in 51 ms. (76 steps per ms) remains 86/86 properties
BEST_FIRST walk for 4000 steps (8 resets) in 51 ms. (76 steps per ms) remains 86/86 properties
BEST_FIRST walk for 4000 steps (8 resets) in 51 ms. (76 steps per ms) remains 86/86 properties
BEST_FIRST walk for 4000 steps (8 resets) in 52 ms. (75 steps per ms) remains 86/86 properties
BEST_FIRST walk for 4000 steps (8 resets) in 53 ms. (74 steps per ms) remains 86/86 properties
BEST_FIRST walk for 4000 steps (8 resets) in 47 ms. (83 steps per ms) remains 86/86 properties
BEST_FIRST walk for 4000 steps (8 resets) in 56 ms. (70 steps per ms) remains 86/86 properties
BEST_FIRST walk for 4000 steps (8 resets) in 54 ms. (72 steps per ms) remains 86/86 properties
BEST_FIRST walk for 4000 steps (8 resets) in 52 ms. (75 steps per ms) remains 86/86 properties
BEST_FIRST walk for 4000 steps (8 resets) in 52 ms. (75 steps per ms) remains 86/86 properties
BEST_FIRST walk for 4000 steps (8 resets) in 52 ms. (75 steps per ms) remains 86/86 properties
[2024-06-01 14:01:24] [INFO ] Invariant cache hit.
[2024-06-01 14:01:24] [INFO ] State equation strengthened by 130 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/34 variables, 34/34 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/34 variables, 5/39 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/34 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 3 (OVERLAPS) 2/36 variables, 1/40 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/36 variables, 2/42 constraints. Problems are: Problem set: 0 solved, 86 unsolved
[2024-06-01 14:01:25] [INFO ] Deduced a trap composed of 20 places in 54 ms of which 1 ms to minimize.
[2024-06-01 14:01:25] [INFO ] Deduced a trap composed of 20 places in 53 ms of which 1 ms to minimize.
[2024-06-01 14:01:25] [INFO ] Deduced a trap composed of 19 places in 43 ms of which 1 ms to minimize.
[2024-06-01 14:01:25] [INFO ] Deduced a trap composed of 20 places in 45 ms of which 1 ms to minimize.
[2024-06-01 14:01:25] [INFO ] Deduced a trap composed of 19 places in 33 ms of which 1 ms to minimize.
[2024-06-01 14:01:25] [INFO ] Deduced a trap composed of 19 places in 32 ms of which 1 ms to minimize.
[2024-06-01 14:01:25] [INFO ] Deduced a trap composed of 19 places in 33 ms of which 1 ms to minimize.
[2024-06-01 14:01:25] [INFO ] Deduced a trap composed of 22 places in 36 ms of which 1 ms to minimize.
[2024-06-01 14:01:25] [INFO ] Deduced a trap composed of 20 places in 32 ms of which 1 ms to minimize.
[2024-06-01 14:01:25] [INFO ] Deduced a trap composed of 19 places in 32 ms of which 1 ms to minimize.
[2024-06-01 14:01:25] [INFO ] Deduced a trap composed of 19 places in 33 ms of which 0 ms to minimize.
[2024-06-01 14:01:25] [INFO ] Deduced a trap composed of 19 places in 34 ms of which 1 ms to minimize.
[2024-06-01 14:01:25] [INFO ] Deduced a trap composed of 19 places in 35 ms of which 1 ms to minimize.
[2024-06-01 14:01:25] [INFO ] Deduced a trap composed of 19 places in 34 ms of which 1 ms to minimize.
[2024-06-01 14:01:25] [INFO ] Deduced a trap composed of 20 places in 32 ms of which 1 ms to minimize.
[2024-06-01 14:01:25] [INFO ] Deduced a trap composed of 19 places in 32 ms of which 0 ms to minimize.
[2024-06-01 14:01:26] [INFO ] Deduced a trap composed of 22 places in 32 ms of which 1 ms to minimize.
[2024-06-01 14:01:26] [INFO ] Deduced a trap composed of 20 places in 36 ms of which 1 ms to minimize.
[2024-06-01 14:01:26] [INFO ] Deduced a trap composed of 19 places in 35 ms of which 0 ms to minimize.
[2024-06-01 14:01:26] [INFO ] Deduced a trap composed of 20 places in 35 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/36 variables, 20/62 constraints. Problems are: Problem set: 0 solved, 86 unsolved
[2024-06-01 14:01:26] [INFO ] Deduced a trap composed of 20 places in 35 ms of which 1 ms to minimize.
[2024-06-01 14:01:26] [INFO ] Deduced a trap composed of 19 places in 34 ms of which 1 ms to minimize.
[2024-06-01 14:01:26] [INFO ] Deduced a trap composed of 21 places in 33 ms of which 1 ms to minimize.
[2024-06-01 14:01:26] [INFO ] Deduced a trap composed of 20 places in 34 ms of which 1 ms to minimize.
[2024-06-01 14:01:26] [INFO ] Deduced a trap composed of 19 places in 32 ms of which 1 ms to minimize.
[2024-06-01 14:01:26] [INFO ] Deduced a trap composed of 19 places in 32 ms of which 1 ms to minimize.
[2024-06-01 14:01:26] [INFO ] Deduced a trap composed of 19 places in 32 ms of which 1 ms to minimize.
[2024-06-01 14:01:26] [INFO ] Deduced a trap composed of 20 places in 33 ms of which 1 ms to minimize.
[2024-06-01 14:01:26] [INFO ] Deduced a trap composed of 19 places in 32 ms of which 1 ms to minimize.
[2024-06-01 14:01:26] [INFO ] Deduced a trap composed of 20 places in 35 ms of which 0 ms to minimize.
[2024-06-01 14:01:26] [INFO ] Deduced a trap composed of 20 places in 33 ms of which 0 ms to minimize.
[2024-06-01 14:01:26] [INFO ] Deduced a trap composed of 20 places in 34 ms of which 1 ms to minimize.
[2024-06-01 14:01:26] [INFO ] Deduced a trap composed of 19 places in 36 ms of which 1 ms to minimize.
[2024-06-01 14:01:26] [INFO ] Deduced a trap composed of 19 places in 33 ms of which 1 ms to minimize.
[2024-06-01 14:01:26] [INFO ] Deduced a trap composed of 19 places in 36 ms of which 1 ms to minimize.
[2024-06-01 14:01:26] [INFO ] Deduced a trap composed of 20 places in 48 ms of which 1 ms to minimize.
[2024-06-01 14:01:26] [INFO ] Deduced a trap composed of 19 places in 43 ms of which 1 ms to minimize.
[2024-06-01 14:01:26] [INFO ] Deduced a trap composed of 19 places in 33 ms of which 1 ms to minimize.
[2024-06-01 14:01:26] [INFO ] Deduced a trap composed of 20 places in 33 ms of which 1 ms to minimize.
[2024-06-01 14:01:27] [INFO ] Deduced a trap composed of 20 places in 44 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/36 variables, 20/82 constraints. Problems are: Problem set: 0 solved, 86 unsolved
[2024-06-01 14:01:27] [INFO ] Deduced a trap composed of 20 places in 52 ms of which 0 ms to minimize.
[2024-06-01 14:01:27] [INFO ] Deduced a trap composed of 19 places in 48 ms of which 1 ms to minimize.
[2024-06-01 14:01:27] [INFO ] Deduced a trap composed of 21 places in 49 ms of which 1 ms to minimize.
[2024-06-01 14:01:27] [INFO ] Deduced a trap composed of 20 places in 51 ms of which 1 ms to minimize.
[2024-06-01 14:01:27] [INFO ] Deduced a trap composed of 19 places in 51 ms of which 1 ms to minimize.
[2024-06-01 14:01:27] [INFO ] Deduced a trap composed of 19 places in 35 ms of which 3 ms to minimize.
[2024-06-01 14:01:27] [INFO ] Deduced a trap composed of 21 places in 51 ms of which 1 ms to minimize.
[2024-06-01 14:01:27] [INFO ] Deduced a trap composed of 20 places in 59 ms of which 1 ms to minimize.
[2024-06-01 14:01:27] [INFO ] Deduced a trap composed of 19 places in 34 ms of which 1 ms to minimize.
[2024-06-01 14:01:27] [INFO ] Deduced a trap composed of 19 places in 32 ms of which 1 ms to minimize.
[2024-06-01 14:01:27] [INFO ] Deduced a trap composed of 19 places in 33 ms of which 1 ms to minimize.
[2024-06-01 14:01:27] [INFO ] Deduced a trap composed of 19 places in 33 ms of which 1 ms to minimize.
[2024-06-01 14:01:27] [INFO ] Deduced a trap composed of 19 places in 39 ms of which 5 ms to minimize.
[2024-06-01 14:01:27] [INFO ] Deduced a trap composed of 19 places in 32 ms of which 0 ms to minimize.
[2024-06-01 14:01:28] [INFO ] Deduced a trap composed of 19 places in 33 ms of which 1 ms to minimize.
[2024-06-01 14:01:28] [INFO ] Deduced a trap composed of 19 places in 32 ms of which 1 ms to minimize.
[2024-06-01 14:01:28] [INFO ] Deduced a trap composed of 19 places in 31 ms of which 0 ms to minimize.
[2024-06-01 14:01:28] [INFO ] Deduced a trap composed of 19 places in 33 ms of which 1 ms to minimize.
[2024-06-01 14:01:28] [INFO ] Deduced a trap composed of 19 places in 32 ms of which 1 ms to minimize.
[2024-06-01 14:01:28] [INFO ] Deduced a trap composed of 19 places in 33 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/36 variables, 20/102 constraints. Problems are: Problem set: 0 solved, 86 unsolved
[2024-06-01 14:01:28] [INFO ] Deduced a trap composed of 20 places in 32 ms of which 1 ms to minimize.
[2024-06-01 14:01:28] [INFO ] Deduced a trap composed of 19 places in 32 ms of which 1 ms to minimize.
[2024-06-01 14:01:28] [INFO ] Deduced a trap composed of 19 places in 33 ms of which 1 ms to minimize.
[2024-06-01 14:01:28] [INFO ] Deduced a trap composed of 19 places in 32 ms of which 1 ms to minimize.
[2024-06-01 14:01:28] [INFO ] Deduced a trap composed of 19 places in 32 ms of which 1 ms to minimize.
[2024-06-01 14:01:28] [INFO ] Deduced a trap composed of 19 places in 32 ms of which 1 ms to minimize.
[2024-06-01 14:01:28] [INFO ] Deduced a trap composed of 19 places in 32 ms of which 1 ms to minimize.
[2024-06-01 14:01:28] [INFO ] Deduced a trap composed of 20 places in 32 ms of which 0 ms to minimize.
[2024-06-01 14:01:28] [INFO ] Deduced a trap composed of 19 places in 32 ms of which 0 ms to minimize.
[2024-06-01 14:01:28] [INFO ] Deduced a trap composed of 19 places in 31 ms of which 1 ms to minimize.
[2024-06-01 14:01:28] [INFO ] Deduced a trap composed of 19 places in 32 ms of which 1 ms to minimize.
[2024-06-01 14:01:28] [INFO ] Deduced a trap composed of 19 places in 32 ms of which 1 ms to minimize.
[2024-06-01 14:01:28] [INFO ] Deduced a trap composed of 20 places in 32 ms of which 1 ms to minimize.
[2024-06-01 14:01:28] [INFO ] Deduced a trap composed of 19 places in 32 ms of which 0 ms to minimize.
[2024-06-01 14:01:28] [INFO ] Deduced a trap composed of 19 places in 31 ms of which 0 ms to minimize.
[2024-06-01 14:01:29] [INFO ] Deduced a trap composed of 19 places in 32 ms of which 1 ms to minimize.
[2024-06-01 14:01:29] [INFO ] Deduced a trap composed of 19 places in 40 ms of which 0 ms to minimize.
[2024-06-01 14:01:29] [INFO ] Deduced a trap composed of 19 places in 49 ms of which 1 ms to minimize.
[2024-06-01 14:01:29] [INFO ] Deduced a trap composed of 20 places in 36 ms of which 1 ms to minimize.
[2024-06-01 14:01:29] [INFO ] Deduced a trap composed of 20 places in 33 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/36 variables, 20/122 constraints. Problems are: Problem set: 0 solved, 86 unsolved
[2024-06-01 14:01:29] [INFO ] Deduced a trap composed of 21 places in 41 ms of which 2 ms to minimize.
[2024-06-01 14:01:29] [INFO ] Deduced a trap composed of 19 places in 36 ms of which 1 ms to minimize.
[2024-06-01 14:01:29] [INFO ] Deduced a trap composed of 19 places in 37 ms of which 1 ms to minimize.
[2024-06-01 14:01:29] [INFO ] Deduced a trap composed of 21 places in 37 ms of which 0 ms to minimize.
[2024-06-01 14:01:29] [INFO ] Deduced a trap composed of 19 places in 40 ms of which 1 ms to minimize.
SMT process timed out in 5093ms, After SMT, problems are : Problem set: 0 solved, 86 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 34 out of 36 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 36/36 places, 156/156 transitions.
Applied a total of 0 rules in 11 ms. Remains 36 /36 variables (removed 0) and now considering 156/156 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 36/36 places, 156/156 transitions.
RANDOM walk for 4000000 steps (8 resets) in 37145 ms. (107 steps per ms) remains 86/86 properties
BEST_FIRST walk for 400000 steps (8 resets) in 3544 ms. (112 steps per ms) remains 86/86 properties
BEST_FIRST walk for 400000 steps (8 resets) in 3553 ms. (112 steps per ms) remains 86/86 properties
BEST_FIRST walk for 400000 steps (8 resets) in 3558 ms. (112 steps per ms) remains 86/86 properties
BEST_FIRST walk for 400000 steps (8 resets) in 3551 ms. (112 steps per ms) remains 86/86 properties
BEST_FIRST walk for 400000 steps (8 resets) in 3545 ms. (112 steps per ms) remains 86/86 properties
BEST_FIRST walk for 400000 steps (8 resets) in 3553 ms. (112 steps per ms) remains 86/86 properties
BEST_FIRST walk for 400000 steps (8 resets) in 3553 ms. (112 steps per ms) remains 86/86 properties
BEST_FIRST walk for 400000 steps (8 resets) in 3544 ms. (112 steps per ms) remains 86/86 properties
BEST_FIRST walk for 400000 steps (8 resets) in 3543 ms. (112 steps per ms) remains 86/86 properties
BEST_FIRST walk for 400000 steps (8 resets) in 3541 ms. (112 steps per ms) remains 86/86 properties
BEST_FIRST walk for 400000 steps (8 resets) in 3542 ms. (112 steps per ms) remains 86/86 properties
BEST_FIRST walk for 400000 steps (8 resets) in 3778 ms. (105 steps per ms) remains 86/86 properties
BEST_FIRST walk for 400000 steps (8 resets) in 3539 ms. (112 steps per ms) remains 86/86 properties
BEST_FIRST walk for 400000 steps (8 resets) in 3536 ms. (113 steps per ms) remains 86/86 properties
BEST_FIRST walk for 400000 steps (8 resets) in 3530 ms. (113 steps per ms) remains 86/86 properties
BEST_FIRST walk for 400000 steps (8 resets) in 3547 ms. (112 steps per ms) remains 86/86 properties
BEST_FIRST walk for 400000 steps (8 resets) in 3591 ms. (111 steps per ms) remains 86/86 properties
BEST_FIRST walk for 400000 steps (8 resets) in 3547 ms. (112 steps per ms) remains 86/86 properties
BEST_FIRST walk for 400000 steps (8 resets) in 3539 ms. (112 steps per ms) remains 86/86 properties
BEST_FIRST walk for 400000 steps (8 resets) in 3568 ms. (112 steps per ms) remains 86/86 properties
BEST_FIRST walk for 400000 steps (8 resets) in 3532 ms. (113 steps per ms) remains 86/86 properties
BEST_FIRST walk for 400000 steps (8 resets) in 3566 ms. (112 steps per ms) remains 86/86 properties
BEST_FIRST walk for 400000 steps (8 resets) in 3534 ms. (113 steps per ms) remains 86/86 properties
BEST_FIRST walk for 400000 steps (8 resets) in 3563 ms. (112 steps per ms) remains 86/86 properties
BEST_FIRST walk for 400000 steps (8 resets) in 3538 ms. (113 steps per ms) remains 86/86 properties
BEST_FIRST walk for 400000 steps (8 resets) in 3539 ms. (112 steps per ms) remains 86/86 properties
BEST_FIRST walk for 400000 steps (8 resets) in 3533 ms. (113 steps per ms) remains 86/86 properties
BEST_FIRST walk for 400000 steps (8 resets) in 3538 ms. (113 steps per ms) remains 86/86 properties
BEST_FIRST walk for 400000 steps (8 resets) in 3533 ms. (113 steps per ms) remains 86/86 properties
BEST_FIRST walk for 400000 steps (8 resets) in 3536 ms. (113 steps per ms) remains 86/86 properties
BEST_FIRST walk for 400000 steps (8 resets) in 3527 ms. (113 steps per ms) remains 86/86 properties
BEST_FIRST walk for 400000 steps (8 resets) in 3519 ms. (113 steps per ms) remains 86/86 properties
BEST_FIRST walk for 400000 steps (8 resets) in 3529 ms. (113 steps per ms) remains 86/86 properties
BEST_FIRST walk for 400000 steps (8 resets) in 3536 ms. (113 steps per ms) remains 86/86 properties
BEST_FIRST walk for 400000 steps (8 resets) in 3567 ms. (112 steps per ms) remains 86/86 properties
BEST_FIRST walk for 400000 steps (8 resets) in 3536 ms. (113 steps per ms) remains 86/86 properties
BEST_FIRST walk for 400000 steps (8 resets) in 3532 ms. (113 steps per ms) remains 86/86 properties
BEST_FIRST walk for 400000 steps (8 resets) in 3531 ms. (113 steps per ms) remains 86/86 properties
BEST_FIRST walk for 400000 steps (8 resets) in 3536 ms. (113 steps per ms) remains 86/86 properties
BEST_FIRST walk for 400000 steps (8 resets) in 3529 ms. (113 steps per ms) remains 86/86 properties
BEST_FIRST walk for 400000 steps (8 resets) in 3537 ms. (113 steps per ms) remains 86/86 properties
BEST_FIRST walk for 400000 steps (8 resets) in 3547 ms. (112 steps per ms) remains 86/86 properties
BEST_FIRST walk for 400000 steps (8 resets) in 3538 ms. (113 steps per ms) remains 86/86 properties
BEST_FIRST walk for 400000 steps (8 resets) in 3561 ms. (112 steps per ms) remains 86/86 properties
BEST_FIRST walk for 400000 steps (8 resets) in 3545 ms. (112 steps per ms) remains 86/86 properties
BEST_FIRST walk for 400000 steps (8 resets) in 3551 ms. (112 steps per ms) remains 86/86 properties
BEST_FIRST walk for 400000 steps (8 resets) in 3745 ms. (106 steps per ms) remains 86/86 properties
BEST_FIRST walk for 400000 steps (8 resets) in 3550 ms. (112 steps per ms) remains 86/86 properties
BEST_FIRST walk for 400000 steps (8 resets) in 3561 ms. (112 steps per ms) remains 86/86 properties
BEST_FIRST walk for 400000 steps (8 resets) in 3542 ms. (112 steps per ms) remains 86/86 properties
Probably explored full state space saw : 166 states, properties seen :0
Probabilistic random walk after 531 steps, saw 166 distinct states, run finished after 24 ms. (steps per millisecond=22 ) properties seen :0
Explored full state space saw : 166 states, properties seen :0
Exhaustive walk after 531 steps, saw 166 distinct states, run finished after 22 ms. (steps per millisecond=24 ) properties seen :0
FORMULA QuasiLiveness FALSE TECHNIQUES RANDOM_WALK EXHAUSTIVE_WALK BESTFIRST_WALK TOPOLOGICAL INITIAL_STATE
Total runtime 125061 ms.
ITS solved all properties within timeout
BK_STOP 1717250547213
--------------------
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="TokenRing-PT-005"
export BK_EXAMINATION="QuasiLiveness"
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 TokenRing-PT-005, 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 r542-smll-171690581300097"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/TokenRing-PT-005.tgz
mv TokenRing-PT-005 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.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property QuasiLiveness.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -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 '
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 ;