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 |
| 373.243 | 62927.00 | 83128.00 | 330.80 | TFF??FF???T????T | 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.r540-smll-171690573700153.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 CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r540-smll-171690573700153
=====================================================================
--------------------
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 6.6K May 18 16:43 GenericPropertiesVerdict.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
here is the order used to build the result vector(from text file)
FORMULA_NAME TokenRing-PT-005-CTLCardinality-2024-00
FORMULA_NAME TokenRing-PT-005-CTLCardinality-2024-01
FORMULA_NAME TokenRing-PT-005-CTLCardinality-2024-02
FORMULA_NAME TokenRing-PT-005-CTLCardinality-2024-03
FORMULA_NAME TokenRing-PT-005-CTLCardinality-2024-04
FORMULA_NAME TokenRing-PT-005-CTLCardinality-2024-05
FORMULA_NAME TokenRing-PT-005-CTLCardinality-2024-06
FORMULA_NAME TokenRing-PT-005-CTLCardinality-2024-07
FORMULA_NAME TokenRing-PT-005-CTLCardinality-2024-08
FORMULA_NAME TokenRing-PT-005-CTLCardinality-2024-09
FORMULA_NAME TokenRing-PT-005-CTLCardinality-2024-10
FORMULA_NAME TokenRing-PT-005-CTLCardinality-2024-11
FORMULA_NAME TokenRing-PT-005-CTLCardinality-2024-12
FORMULA_NAME TokenRing-PT-005-CTLCardinality-2024-13
FORMULA_NAME TokenRing-PT-005-CTLCardinality-2024-14
FORMULA_NAME TokenRing-PT-005-CTLCardinality-2024-15
=== Now, execution of the tool begins
BK_START 1717244936423
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=TokenRing-PT-005
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 12:28:58] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2024-06-01 12:28:58] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 12:28:58] [INFO ] Load time of PNML (sax parser for PT used): 119 ms
[2024-06-01 12:28:58] [INFO ] Transformed 36 places.
[2024-06-01 12:28:58] [INFO ] Transformed 156 transitions.
[2024-06-01 12:28:58] [INFO ] Found NUPN structural information;
[2024-06-01 12:28:58] [INFO ] Parsed PT model containing 36 places and 156 transitions and 624 arcs in 295 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 155 ms.
Initial state reduction rules removed 6 formulas.
FORMULA TokenRing-PT-005-CTLCardinality-2024-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA TokenRing-PT-005-CTLCardinality-2024-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA TokenRing-PT-005-CTLCardinality-2024-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA TokenRing-PT-005-CTLCardinality-2024-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA TokenRing-PT-005-CTLCardinality-2024-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA TokenRing-PT-005-CTLCardinality-2024-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA TokenRing-PT-005-CTLCardinality-2024-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 25 out of 36 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 36/36 places, 156/156 transitions.
Applied a total of 0 rules in 13 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 12:28:58] [INFO ] Computed 6 invariants in 22 ms
[2024-06-01 12:28:59] [INFO ] Implicit Places using invariants in 292 ms returned []
[2024-06-01 12:28:59] [INFO ] Invariant cache hit.
[2024-06-01 12:28:59] [INFO ] State equation strengthened by 130 read => feed constraints.
[2024-06-01 12:28:59] [INFO ] Implicit Places using invariants and state equation in 259 ms returned []
Implicit Place search using SMT with State Equation took 604 ms to find 0 implicit places.
Running 151 sub problems to find dead transitions.
[2024-06-01 12:28:59] [INFO ] Invariant cache hit.
[2024-06-01 12:28:59] [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 12:29:00] [INFO ] Deduced a trap composed of 19 places in 91 ms of which 15 ms to minimize.
[2024-06-01 12:29:00] [INFO ] Deduced a trap composed of 19 places in 51 ms of which 2 ms to minimize.
[2024-06-01 12:29:00] [INFO ] Deduced a trap composed of 19 places in 72 ms of which 4 ms to minimize.
[2024-06-01 12:29:00] [INFO ] Deduced a trap composed of 19 places in 61 ms of which 1 ms to minimize.
[2024-06-01 12:29:00] [INFO ] Deduced a trap composed of 20 places in 68 ms of which 2 ms to minimize.
[2024-06-01 12:29:00] [INFO ] Deduced a trap composed of 20 places in 64 ms of which 2 ms to minimize.
[2024-06-01 12:29:00] [INFO ] Deduced a trap composed of 19 places in 59 ms of which 1 ms to minimize.
[2024-06-01 12:29:01] [INFO ] Deduced a trap composed of 19 places in 60 ms of which 1 ms to minimize.
[2024-06-01 12:29:01] [INFO ] Deduced a trap composed of 19 places in 63 ms of which 1 ms to minimize.
[2024-06-01 12:29:01] [INFO ] Deduced a trap composed of 19 places in 44 ms of which 2 ms to minimize.
[2024-06-01 12:29:01] [INFO ] Deduced a trap composed of 20 places in 48 ms of which 1 ms to minimize.
[2024-06-01 12:29:01] [INFO ] Deduced a trap composed of 19 places in 66 ms of which 1 ms to minimize.
[2024-06-01 12:29:01] [INFO ] Deduced a trap composed of 19 places in 51 ms of which 2 ms to minimize.
[2024-06-01 12:29:01] [INFO ] Deduced a trap composed of 19 places in 42 ms of which 2 ms to minimize.
[2024-06-01 12:29:01] [INFO ] Deduced a trap composed of 19 places in 56 ms of which 2 ms to minimize.
[2024-06-01 12:29:01] [INFO ] Deduced a trap composed of 19 places in 49 ms of which 1 ms to minimize.
[2024-06-01 12:29:01] [INFO ] Deduced a trap composed of 20 places in 47 ms of which 1 ms to minimize.
[2024-06-01 12:29:01] [INFO ] Deduced a trap composed of 19 places in 46 ms of which 2 ms to minimize.
[2024-06-01 12:29:01] [INFO ] Deduced a trap composed of 19 places in 47 ms of which 1 ms to minimize.
[2024-06-01 12:29:01] [INFO ] Deduced a trap composed of 20 places in 44 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 12:29:01] [INFO ] Deduced a trap composed of 20 places in 45 ms of which 1 ms to minimize.
[2024-06-01 12:29:01] [INFO ] Deduced a trap composed of 20 places in 47 ms of which 2 ms to minimize.
[2024-06-01 12:29:01] [INFO ] Deduced a trap composed of 20 places in 47 ms of which 1 ms to minimize.
[2024-06-01 12:29:02] [INFO ] Deduced a trap composed of 19 places in 47 ms of which 1 ms to minimize.
[2024-06-01 12:29:02] [INFO ] Deduced a trap composed of 19 places in 40 ms of which 1 ms to minimize.
[2024-06-01 12:29:02] [INFO ] Deduced a trap composed of 19 places in 38 ms of which 1 ms to minimize.
[2024-06-01 12:29:02] [INFO ] Deduced a trap composed of 20 places in 45 ms of which 1 ms to minimize.
[2024-06-01 12:29:02] [INFO ] Deduced a trap composed of 21 places in 45 ms of which 1 ms to minimize.
[2024-06-01 12:29:02] [INFO ] Deduced a trap composed of 20 places in 39 ms of which 2 ms to minimize.
[2024-06-01 12:29:02] [INFO ] Deduced a trap composed of 19 places in 45 ms of which 6 ms to minimize.
[2024-06-01 12:29:02] [INFO ] Deduced a trap composed of 19 places in 40 ms of which 1 ms to minimize.
[2024-06-01 12:29:02] [INFO ] Deduced a trap composed of 20 places in 37 ms of which 1 ms to minimize.
[2024-06-01 12:29:02] [INFO ] Deduced a trap composed of 19 places in 53 ms of which 1 ms to minimize.
[2024-06-01 12:29:02] [INFO ] Deduced a trap composed of 19 places in 46 ms of which 2 ms to minimize.
[2024-06-01 12:29:02] [INFO ] Deduced a trap composed of 20 places in 35 ms of which 2 ms to minimize.
[2024-06-01 12:29:02] [INFO ] Deduced a trap composed of 20 places in 36 ms of which 1 ms to minimize.
[2024-06-01 12:29:02] [INFO ] Deduced a trap composed of 19 places in 59 ms of which 2 ms to minimize.
[2024-06-01 12:29:02] [INFO ] Deduced a trap composed of 20 places in 43 ms of which 2 ms to minimize.
[2024-06-01 12:29:02] [INFO ] Deduced a trap composed of 21 places in 43 ms of which 1 ms to minimize.
[2024-06-01 12:29:02] [INFO ] Deduced a trap composed of 21 places in 41 ms of which 2 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 12:29:03] [INFO ] Deduced a trap composed of 19 places in 35 ms of which 1 ms to minimize.
[2024-06-01 12:29:03] [INFO ] Deduced a trap composed of 19 places in 38 ms of which 1 ms to minimize.
[2024-06-01 12:29:03] [INFO ] Deduced a trap composed of 20 places in 43 ms of which 1 ms to minimize.
[2024-06-01 12:29:03] [INFO ] Deduced a trap composed of 19 places in 36 ms of which 1 ms to minimize.
[2024-06-01 12:29:03] [INFO ] Deduced a trap composed of 19 places in 34 ms of which 1 ms to minimize.
[2024-06-01 12:29:03] [INFO ] Deduced a trap composed of 20 places in 34 ms of which 1 ms to minimize.
[2024-06-01 12:29:03] [INFO ] Deduced a trap composed of 19 places in 35 ms of which 1 ms to minimize.
[2024-06-01 12:29:03] [INFO ] Deduced a trap composed of 20 places in 33 ms of which 1 ms to minimize.
[2024-06-01 12:29:03] [INFO ] Deduced a trap composed of 19 places in 33 ms of which 1 ms to minimize.
[2024-06-01 12:29:03] [INFO ] Deduced a trap composed of 19 places in 34 ms of which 1 ms to minimize.
[2024-06-01 12:29:03] [INFO ] Deduced a trap composed of 19 places in 35 ms of which 2 ms to minimize.
[2024-06-01 12:29:03] [INFO ] Deduced a trap composed of 19 places in 34 ms of which 0 ms to minimize.
[2024-06-01 12:29:03] [INFO ] Deduced a trap composed of 19 places in 34 ms of which 1 ms to minimize.
[2024-06-01 12:29:03] [INFO ] Deduced a trap composed of 20 places in 33 ms of which 1 ms to minimize.
[2024-06-01 12:29:03] [INFO ] Deduced a trap composed of 20 places in 33 ms of which 1 ms to minimize.
[2024-06-01 12:29:03] [INFO ] Deduced a trap composed of 20 places in 35 ms of which 1 ms to minimize.
[2024-06-01 12:29:04] [INFO ] Deduced a trap composed of 19 places in 46 ms of which 5 ms to minimize.
[2024-06-01 12:29:04] [INFO ] Deduced a trap composed of 19 places in 34 ms of which 1 ms to minimize.
[2024-06-01 12:29:04] [INFO ] Deduced a trap composed of 19 places in 33 ms of which 1 ms to minimize.
[2024-06-01 12:29:04] [INFO ] Deduced a trap composed of 19 places in 35 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 12:29:04] [INFO ] Deduced a trap composed of 20 places in 38 ms of which 1 ms to minimize.
[2024-06-01 12:29:04] [INFO ] Deduced a trap composed of 19 places in 35 ms of which 1 ms to minimize.
[2024-06-01 12:29:04] [INFO ] Deduced a trap composed of 19 places in 36 ms of which 1 ms to minimize.
[2024-06-01 12:29:04] [INFO ] Deduced a trap composed of 19 places in 35 ms of which 0 ms to minimize.
[2024-06-01 12:29:04] [INFO ] Deduced a trap composed of 21 places in 34 ms of which 1 ms to minimize.
[2024-06-01 12:29:04] [INFO ] Deduced a trap composed of 19 places in 35 ms of which 1 ms to minimize.
[2024-06-01 12:29:04] [INFO ] Deduced a trap composed of 20 places in 33 ms of which 1 ms to minimize.
[2024-06-01 12:29:04] [INFO ] Deduced a trap composed of 19 places in 33 ms of which 0 ms to minimize.
[2024-06-01 12:29:04] [INFO ] Deduced a trap composed of 19 places in 35 ms of which 1 ms to minimize.
[2024-06-01 12:29:04] [INFO ] Deduced a trap composed of 19 places in 35 ms of which 1 ms to minimize.
[2024-06-01 12:29:04] [INFO ] Deduced a trap composed of 19 places in 40 ms of which 1 ms to minimize.
[2024-06-01 12:29:04] [INFO ] Deduced a trap composed of 19 places in 34 ms of which 1 ms to minimize.
[2024-06-01 12:29:04] [INFO ] Deduced a trap composed of 20 places in 34 ms of which 1 ms to minimize.
[2024-06-01 12:29:04] [INFO ] Deduced a trap composed of 19 places in 33 ms of which 1 ms to minimize.
[2024-06-01 12:29:05] [INFO ] Deduced a trap composed of 19 places in 34 ms of which 1 ms to minimize.
[2024-06-01 12:29:05] [INFO ] Deduced a trap composed of 21 places in 33 ms of which 1 ms to minimize.
[2024-06-01 12:29:05] [INFO ] Deduced a trap composed of 20 places in 34 ms of which 1 ms to minimize.
[2024-06-01 12:29:05] [INFO ] Deduced a trap composed of 20 places in 38 ms of which 5 ms to minimize.
[2024-06-01 12:29:05] [INFO ] Deduced a trap composed of 20 places in 34 ms of which 1 ms to minimize.
[2024-06-01 12:29:05] [INFO ] Deduced a trap composed of 19 places in 35 ms of which 0 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 12:29:05] [INFO ] Deduced a trap composed of 19 places in 36 ms of which 1 ms to minimize.
[2024-06-01 12:29:05] [INFO ] Deduced a trap composed of 19 places in 35 ms of which 0 ms to minimize.
[2024-06-01 12:29:05] [INFO ] Deduced a trap composed of 20 places in 37 ms of which 1 ms to minimize.
[2024-06-01 12:29:05] [INFO ] Deduced a trap composed of 20 places in 38 ms of which 1 ms to minimize.
[2024-06-01 12:29:05] [INFO ] Deduced a trap composed of 19 places in 34 ms of which 0 ms to minimize.
[2024-06-01 12:29:05] [INFO ] Deduced a trap composed of 20 places in 33 ms of which 1 ms to minimize.
[2024-06-01 12:29:05] [INFO ] Deduced a trap composed of 20 places in 36 ms of which 1 ms to minimize.
[2024-06-01 12:29:05] [INFO ] Deduced a trap composed of 20 places in 34 ms of which 0 ms to minimize.
[2024-06-01 12:29:05] [INFO ] Deduced a trap composed of 19 places in 36 ms of which 1 ms to minimize.
[2024-06-01 12:29:05] [INFO ] Deduced a trap composed of 19 places in 36 ms of which 1 ms to minimize.
[2024-06-01 12:29:06] [INFO ] Deduced a trap composed of 19 places in 36 ms of which 1 ms to minimize.
[2024-06-01 12:29:06] [INFO ] Deduced a trap composed of 19 places in 48 ms of which 1 ms to minimize.
[2024-06-01 12:29:06] [INFO ] Deduced a trap composed of 19 places in 54 ms of which 1 ms to minimize.
[2024-06-01 12:29:06] [INFO ] Deduced a trap composed of 19 places in 45 ms of which 2 ms to minimize.
[2024-06-01 12:29:06] [INFO ] Deduced a trap composed of 19 places in 44 ms of which 1 ms to minimize.
[2024-06-01 12:29:06] [INFO ] Deduced a trap composed of 20 places in 45 ms of which 1 ms to minimize.
[2024-06-01 12:29:06] [INFO ] Deduced a trap composed of 19 places in 45 ms of which 2 ms to minimize.
[2024-06-01 12:29:06] [INFO ] Deduced a trap composed of 20 places in 40 ms of which 0 ms to minimize.
[2024-06-01 12:29:06] [INFO ] Deduced a trap composed of 19 places in 37 ms of which 1 ms to minimize.
[2024-06-01 12:29:06] [INFO ] Deduced a trap composed of 19 places in 35 ms of which 1 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 12:29:07] [INFO ] Deduced a trap composed of 19 places in 39 ms of which 1 ms to minimize.
[2024-06-01 12:29:07] [INFO ] Deduced a trap composed of 19 places in 33 ms of which 1 ms to minimize.
[2024-06-01 12:29:07] [INFO ] Deduced a trap composed of 21 places in 50 ms of which 0 ms to minimize.
[2024-06-01 12:29:07] [INFO ] Deduced a trap composed of 20 places in 39 ms of which 1 ms to minimize.
[2024-06-01 12:29:07] [INFO ] Deduced a trap composed of 19 places in 41 ms of which 0 ms to minimize.
[2024-06-01 12:29:07] [INFO ] Deduced a trap composed of 19 places in 38 ms of which 1 ms to minimize.
[2024-06-01 12:29:07] [INFO ] Deduced a trap composed of 20 places in 40 ms of which 1 ms to minimize.
[2024-06-01 12:29:07] [INFO ] Deduced a trap composed of 19 places in 35 ms of which 0 ms to minimize.
[2024-06-01 12:29:07] [INFO ] Deduced a trap composed of 20 places in 41 ms of which 1 ms to minimize.
[2024-06-01 12:29:07] [INFO ] Deduced a trap composed of 19 places in 41 ms of which 1 ms to minimize.
[2024-06-01 12:29:07] [INFO ] Deduced a trap composed of 19 places in 41 ms of which 1 ms to minimize.
[2024-06-01 12:29:07] [INFO ] Deduced a trap composed of 19 places in 42 ms of which 1 ms to minimize.
[2024-06-01 12:29:07] [INFO ] Deduced a trap composed of 20 places in 41 ms of which 0 ms to minimize.
[2024-06-01 12:29:08] [INFO ] Deduced a trap composed of 19 places in 34 ms of which 1 ms to minimize.
[2024-06-01 12:29:08] [INFO ] Deduced a trap composed of 19 places in 35 ms of which 2 ms to minimize.
[2024-06-01 12:29:08] [INFO ] Deduced a trap composed of 20 places in 48 ms of which 1 ms to minimize.
[2024-06-01 12:29:08] [INFO ] Deduced a trap composed of 21 places in 34 ms of which 1 ms to minimize.
[2024-06-01 12:29:08] [INFO ] Deduced a trap composed of 20 places in 52 ms of which 1 ms to minimize.
[2024-06-01 12:29:08] [INFO ] Deduced a trap composed of 19 places in 52 ms of which 1 ms to minimize.
[2024-06-01 12:29:08] [INFO ] Deduced a trap composed of 19 places in 51 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 12:29:08] [INFO ] Deduced a trap composed of 19 places in 38 ms of which 1 ms to minimize.
[2024-06-01 12:29:08] [INFO ] Deduced a trap composed of 19 places in 34 ms of which 1 ms to minimize.
[2024-06-01 12:29:08] [INFO ] Deduced a trap composed of 19 places in 45 ms of which 1 ms to minimize.
[2024-06-01 12:29:08] [INFO ] Deduced a trap composed of 21 places in 34 ms of which 1 ms to minimize.
[2024-06-01 12:29:08] [INFO ] Deduced a trap composed of 19 places in 40 ms of which 1 ms to minimize.
[2024-06-01 12:29:09] [INFO ] Deduced a trap composed of 19 places in 34 ms of which 1 ms to minimize.
[2024-06-01 12:29:09] [INFO ] Deduced a trap composed of 20 places in 35 ms of which 1 ms to minimize.
[2024-06-01 12:29:09] [INFO ] Deduced a trap composed of 19 places in 32 ms of which 1 ms to minimize.
[2024-06-01 12:29:09] [INFO ] Deduced a trap composed of 19 places in 34 ms of which 1 ms to minimize.
[2024-06-01 12:29:09] [INFO ] Deduced a trap composed of 20 places in 33 ms of which 1 ms to minimize.
[2024-06-01 12:29:09] [INFO ] Deduced a trap composed of 20 places in 34 ms of which 1 ms to minimize.
[2024-06-01 12:29:09] [INFO ] Deduced a trap composed of 20 places in 34 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 12:29:09] [INFO ] Deduced a trap composed of 19 places in 34 ms of which 1 ms to minimize.
[2024-06-01 12:29:09] [INFO ] Deduced a trap composed of 19 places in 35 ms of which 1 ms to minimize.
[2024-06-01 12:29:09] [INFO ] Deduced a trap composed of 20 places in 33 ms of which 1 ms to minimize.
[2024-06-01 12:29:09] [INFO ] Deduced a trap composed of 19 places in 34 ms of which 0 ms to minimize.
[2024-06-01 12:29:10] [INFO ] Deduced a trap composed of 19 places in 34 ms of which 1 ms to minimize.
[2024-06-01 12:29:10] [INFO ] Deduced a trap composed of 20 places in 33 ms of which 1 ms to minimize.
[2024-06-01 12:29:10] [INFO ] Deduced a trap composed of 19 places in 35 ms of which 1 ms to minimize.
[2024-06-01 12:29:10] [INFO ] Deduced a trap composed of 20 places in 35 ms of which 1 ms to minimize.
[2024-06-01 12:29:10] [INFO ] Deduced a trap composed of 20 places in 34 ms of which 1 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 12:29:11] [INFO ] Deduced a trap composed of 19 places in 33 ms of which 0 ms to minimize.
[2024-06-01 12:29:11] [INFO ] Deduced a trap composed of 19 places in 33 ms of which 1 ms to minimize.
[2024-06-01 12:29:11] [INFO ] Deduced a trap composed of 19 places in 35 ms of which 1 ms to minimize.
[2024-06-01 12:29:11] [INFO ] Deduced a trap composed of 19 places in 35 ms of which 1 ms to minimize.
[2024-06-01 12:29:11] [INFO ] Deduced a trap composed of 20 places in 35 ms of which 0 ms to minimize.
[2024-06-01 12:29:11] [INFO ] Deduced a trap composed of 19 places in 32 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 12:29:12] [INFO ] Deduced a trap composed of 19 places in 35 ms of which 1 ms to minimize.
[2024-06-01 12:29:12] [INFO ] Deduced a trap composed of 19 places in 35 ms of which 1 ms to minimize.
[2024-06-01 12:29:12] [INFO ] Deduced a trap composed of 19 places in 37 ms of which 0 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 12:29:13] [INFO ] Deduced a trap composed of 19 places in 35 ms of which 1 ms to minimize.
[2024-06-01 12:29:13] [INFO ] Deduced a trap composed of 19 places in 65 ms of which 2 ms to minimize.
[2024-06-01 12:29:13] [INFO ] Deduced a trap composed of 19 places in 60 ms of which 1 ms to minimize.
[2024-06-01 12:29:13] [INFO ] Deduced a trap composed of 19 places in 35 ms of which 1 ms to minimize.
[2024-06-01 12:29:13] [INFO ] Deduced a trap composed of 19 places in 36 ms of which 1 ms to minimize.
[2024-06-01 12:29:13] [INFO ] Deduced a trap composed of 20 places in 33 ms of which 1 ms to minimize.
[2024-06-01 12:29:13] [INFO ] Deduced a trap composed of 19 places in 34 ms of which 0 ms to minimize.
[2024-06-01 12:29:13] [INFO ] Deduced a trap composed of 20 places in 40 ms of which 0 ms to minimize.
[2024-06-01 12:29:13] [INFO ] Deduced a trap composed of 20 places in 32 ms of which 1 ms to minimize.
[2024-06-01 12:29:13] [INFO ] Deduced a trap composed of 19 places in 41 ms of which 1 ms to minimize.
[2024-06-01 12:29:13] [INFO ] Deduced a trap composed of 19 places in 45 ms of which 1 ms to minimize.
[2024-06-01 12:29:14] [INFO ] Deduced a trap composed of 19 places in 33 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 12:29:14] [INFO ] Deduced a trap composed of 19 places in 39 ms of which 1 ms to minimize.
[2024-06-01 12:29:14] [INFO ] Deduced a trap composed of 20 places in 39 ms of which 1 ms to minimize.
[2024-06-01 12:29:14] [INFO ] Deduced a trap composed of 19 places in 41 ms of which 1 ms to minimize.
[2024-06-01 12:29:14] [INFO ] Deduced a trap composed of 20 places in 35 ms of which 1 ms to minimize.
[2024-06-01 12:29:15] [INFO ] Deduced a trap composed of 19 places in 44 ms of which 1 ms to minimize.
[2024-06-01 12:29:15] [INFO ] Deduced a trap composed of 20 places in 43 ms of which 1 ms to minimize.
[2024-06-01 12:29:15] [INFO ] Deduced a trap composed of 19 places in 51 ms of which 1 ms to minimize.
[2024-06-01 12:29:15] [INFO ] Deduced a trap composed of 20 places in 55 ms of which 1 ms to minimize.
[2024-06-01 12:29:15] [INFO ] Deduced a trap composed of 19 places in 46 ms of which 1 ms to minimize.
[2024-06-01 12:29:15] [INFO ] Deduced a trap composed of 20 places in 36 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 12:29:16] [INFO ] Deduced a trap composed of 19 places in 37 ms of which 1 ms to minimize.
[2024-06-01 12:29:16] [INFO ] Deduced a trap composed of 21 places in 40 ms of which 0 ms to minimize.
[2024-06-01 12:29:16] [INFO ] Deduced a trap composed of 20 places in 33 ms of which 1 ms to minimize.
[2024-06-01 12:29:16] [INFO ] Deduced a trap composed of 20 places in 39 ms of which 1 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 12:29:17] [INFO ] Deduced a trap composed of 19 places in 33 ms of which 1 ms to minimize.
[2024-06-01 12:29:17] [INFO ] Deduced a trap composed of 19 places in 33 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 12:29:18] [INFO ] Deduced a trap composed of 19 places in 33 ms of which 1 ms to minimize.
[2024-06-01 12:29:19] [INFO ] Deduced a trap composed of 19 places in 35 ms of which 1 ms to minimize.
[2024-06-01 12:29:19] [INFO ] Deduced a trap composed of 21 places in 35 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 12:29:19] [INFO ] Deduced a trap composed of 21 places in 33 ms of which 1 ms to minimize.
[2024-06-01 12:29:19] [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 12:29:28] [INFO ] Deduced a trap composed of 20 places in 33 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 30027 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 12:29:30] [INFO ] Deduced a trap composed of 19 places in 46 ms of which 1 ms to minimize.
[2024-06-01 12:29:30] [INFO ] Deduced a trap composed of 19 places in 56 ms of which 1 ms to minimize.
[2024-06-01 12:29:30] [INFO ] Deduced a trap composed of 19 places in 49 ms of which 0 ms to minimize.
[2024-06-01 12:29:30] [INFO ] Deduced a trap composed of 19 places in 37 ms of which 1 ms to minimize.
[2024-06-01 12:29:31] [INFO ] Deduced a trap composed of 19 places in 44 ms of which 1 ms to minimize.
[2024-06-01 12:29:31] [INFO ] Deduced a trap composed of 20 places in 40 ms of which 1 ms to minimize.
[2024-06-01 12:29:31] [INFO ] Deduced a trap composed of 19 places in 41 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 12:29:31] [INFO ] Deduced a trap composed of 19 places in 53 ms of which 2 ms to minimize.
[2024-06-01 12:29:32] [INFO ] Deduced a trap composed of 19 places in 39 ms of which 1 ms to minimize.
[2024-06-01 12:29:32] [INFO ] Deduced a trap composed of 19 places in 38 ms of which 1 ms to minimize.
[2024-06-01 12:29:32] [INFO ] Deduced a trap composed of 19 places in 34 ms of which 0 ms to minimize.
[2024-06-01 12:29:32] [INFO ] Deduced a trap composed of 21 places in 34 ms of which 1 ms to minimize.
[2024-06-01 12:29:32] [INFO ] Deduced a trap composed of 19 places in 34 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 12:29:32] [INFO ] Deduced a trap composed of 19 places in 32 ms of which 1 ms to minimize.
[2024-06-01 12:29:32] [INFO ] Deduced a trap composed of 21 places in 34 ms of which 1 ms to minimize.
[2024-06-01 12:29:32] [INFO ] Deduced a trap composed of 19 places in 34 ms of which 0 ms to minimize.
[2024-06-01 12:29:33] [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, 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 12:29:40] [INFO ] Deduced a trap composed of 19 places in 39 ms of which 2 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 12:29:43] [INFO ] Deduced a trap composed of 19 places in 35 ms of which 1 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 27093 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 57340ms problems are : Problem set: 0 solved, 151 unsolved
Search for dead transitions found 0 dead transitions in 57364ms
Finished structural reductions in LTL mode , in 1 iterations and 58027 ms. Remains : 36/36 places, 156/156 transitions.
Support contains 25 out of 36 places after structural reductions.
[2024-06-01 12:29:57] [INFO ] Flatten gal took : 55 ms
[2024-06-01 12:29:57] [INFO ] Flatten gal took : 29 ms
[2024-06-01 12:29:57] [INFO ] Input system was already deterministic with 156 transitions.
Support contains 19 out of 36 places (down from 25) after GAL structural reductions.
RANDOM walk for 40000 steps (8 resets) in 1086 ms. (36 steps per ms) remains 1/17 properties
BEST_FIRST walk for 40000 steps (8 resets) in 626 ms. (63 steps per ms) remains 1/1 properties
[2024-06-01 12:29:57] [INFO ] Invariant cache hit.
[2024-06-01 12:29:57] [INFO ] State equation strengthened by 130 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/4 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 20/24 variables, 4/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/24 variables, 20/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/24 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 120/144 variables, 24/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/144 variables, 75/127 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/144 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 30/174 variables, 50/177 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/174 variables, 4/181 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/174 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 18/192 variables, 12/193 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/192 variables, 12/205 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/192 variables, 2/207 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/192 variables, 1/208 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 12:29:58] [INFO ] Deduced a trap composed of 21 places in 40 ms of which 1 ms to minimize.
All remaining problems are real, not stopping.
At refinement iteration 15 (INCLUDED_ONLY) 0/192 variables, 1/209 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/192 variables, 0/209 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/192 variables, 0/209 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 192/192 variables, and 209 constraints, problems are : Problem set: 0 solved, 1 unsolved in 186 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: 1/1 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/4 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 20/24 variables, 4/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/24 variables, 20/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/24 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 120/144 variables, 24/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/144 variables, 75/127 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/144 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 30/174 variables, 50/177 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/174 variables, 4/181 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/174 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 18/192 variables, 12/193 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/192 variables, 12/205 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/192 variables, 2/207 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/192 variables, 1/208 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/192 variables, 1/209 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/192 variables, 1/210 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/192 variables, 0/210 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 0/192 variables, 0/210 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 192/192 variables, and 210 constraints, problems are : Problem set: 0 solved, 1 unsolved in 145 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: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 346ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 15 ms.
Support contains 4 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 10 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 10 ms. Remains : 36/36 places, 156/156 transitions.
RANDOM walk for 40000 steps (8 resets) in 108 ms. (366 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40000 steps (8 resets) in 92 ms. (430 steps per ms) remains 1/1 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 15 ms. (steps per millisecond=35 ) 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 4 ms. (steps per millisecond=132 ) properties seen :0
Successfully simplified 1 atomic propositions for a total of 5 simplifications.
[2024-06-01 12:29:58] [INFO ] Flatten gal took : 13 ms
[2024-06-01 12:29:58] [INFO ] Flatten gal took : 15 ms
[2024-06-01 12:29:58] [INFO ] Input system was already deterministic with 156 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 36/36 places, 156/156 transitions.
Applied a total of 0 rules in 3 ms. Remains 36 /36 variables (removed 0) and now considering 156/156 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 36/36 places, 156/156 transitions.
[2024-06-01 12:29:58] [INFO ] Flatten gal took : 11 ms
[2024-06-01 12:29:58] [INFO ] Flatten gal took : 14 ms
[2024-06-01 12:29:58] [INFO ] Input system was already deterministic with 156 transitions.
Starting structural reductions in LTL mode, iteration 0 : 36/36 places, 156/156 transitions.
Applied a total of 0 rules in 3 ms. Remains 36 /36 variables (removed 0) and now considering 156/156 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 36/36 places, 156/156 transitions.
[2024-06-01 12:29:58] [INFO ] Flatten gal took : 11 ms
[2024-06-01 12:29:58] [INFO ] Flatten gal took : 13 ms
[2024-06-01 12:29:58] [INFO ] Input system was already deterministic with 156 transitions.
Starting structural reductions in LTL mode, iteration 0 : 36/36 places, 156/156 transitions.
Applied a total of 0 rules in 2 ms. Remains 36 /36 variables (removed 0) and now considering 156/156 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 36/36 places, 156/156 transitions.
[2024-06-01 12:29:58] [INFO ] Flatten gal took : 10 ms
[2024-06-01 12:29:58] [INFO ] Flatten gal took : 13 ms
[2024-06-01 12:29:58] [INFO ] Input system was already deterministic with 156 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 36/36 places, 156/156 transitions.
Applied a total of 0 rules in 7 ms. Remains 36 /36 variables (removed 0) and now considering 156/156 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 9 ms. Remains : 36/36 places, 156/156 transitions.
[2024-06-01 12:29:58] [INFO ] Flatten gal took : 10 ms
[2024-06-01 12:29:58] [INFO ] Flatten gal took : 13 ms
[2024-06-01 12:29:58] [INFO ] Input system was already deterministic with 156 transitions.
Starting structural reductions in LTL mode, iteration 0 : 36/36 places, 156/156 transitions.
Applied a total of 0 rules in 2 ms. Remains 36 /36 variables (removed 0) and now considering 156/156 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 36/36 places, 156/156 transitions.
[2024-06-01 12:29:58] [INFO ] Flatten gal took : 10 ms
[2024-06-01 12:29:58] [INFO ] Flatten gal took : 13 ms
[2024-06-01 12:29:58] [INFO ] Input system was already deterministic with 156 transitions.
Starting structural reductions in LTL mode, iteration 0 : 36/36 places, 156/156 transitions.
Applied a total of 0 rules in 2 ms. Remains 36 /36 variables (removed 0) and now considering 156/156 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 36/36 places, 156/156 transitions.
[2024-06-01 12:29:58] [INFO ] Flatten gal took : 14 ms
[2024-06-01 12:29:58] [INFO ] Flatten gal took : 13 ms
[2024-06-01 12:29:58] [INFO ] Input system was already deterministic with 156 transitions.
Starting structural reductions in LTL mode, iteration 0 : 36/36 places, 156/156 transitions.
Applied a total of 0 rules in 3 ms. Remains 36 /36 variables (removed 0) and now considering 156/156 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 36/36 places, 156/156 transitions.
[2024-06-01 12:29:58] [INFO ] Flatten gal took : 10 ms
[2024-06-01 12:29:58] [INFO ] Flatten gal took : 12 ms
[2024-06-01 12:29:58] [INFO ] Input system was already deterministic with 156 transitions.
Starting structural reductions in LTL mode, iteration 0 : 36/36 places, 156/156 transitions.
Applied a total of 0 rules in 3 ms. Remains 36 /36 variables (removed 0) and now considering 156/156 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 36/36 places, 156/156 transitions.
[2024-06-01 12:29:58] [INFO ] Flatten gal took : 9 ms
[2024-06-01 12:29:58] [INFO ] Flatten gal took : 12 ms
[2024-06-01 12:29:58] [INFO ] Input system was already deterministic with 156 transitions.
Starting structural reductions in LTL mode, iteration 0 : 36/36 places, 156/156 transitions.
Applied a total of 0 rules in 3 ms. Remains 36 /36 variables (removed 0) and now considering 156/156 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 36/36 places, 156/156 transitions.
[2024-06-01 12:29:58] [INFO ] Flatten gal took : 10 ms
[2024-06-01 12:29:58] [INFO ] Flatten gal took : 10 ms
[2024-06-01 12:29:58] [INFO ] Input system was already deterministic with 156 transitions.
[2024-06-01 12:29:58] [INFO ] Flatten gal took : 9 ms
[2024-06-01 12:29:58] [INFO ] Flatten gal took : 9 ms
[2024-06-01 12:29:58] [INFO ] Export to MCC of 9 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 4 ms.
[2024-06-01 12:29:58] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 36 places, 156 transitions and 624 arcs took 4 ms.
Total runtime 60675 ms.
There are residual formulas that ITS could not solve within timeout
Usage: pnml2lts-sym [-gvqh] [--order=
[--mu-opt] [--saturation=
[--sat-granularity=
[--guidance=
[--action=
[--trace=
[--mu=
[--ctl=
[--save-levels=STRING] [--pg-solve] [--attr=
[--saturating-attractor] [--write-strategy=
[--check-strategy] [--interactive-play] [--player]
[--pg-write=
[--edge-label=
[--mucalc=
[--allow-undefined-edges] [--allow-undefined-values]
[-p|--por=
[--weak=[valmari] (default: uses stronger left-commutativity)]
[--leap] [-r|--regroup=<(T,)+>] [--sloan-w1=
[--cw-max-cols=
[--mh-timeout=
[--graph-metrics] [--regroup-exit] [--regroup-time]
[-g|--pins-guards] [--vset=
[--ldd32-cache=
[--cache-ratio=
[--min-free-nodes=
[--fdd-reorder=
[--vset-cache-diff=
[--next-union] [--peak-nodes] [--maxsum=
[--block-size=
[--debug=
[--timeout=INT] [--version] [-h|--help] [--usage]
[OPTIONS]
Could not compute solution for formula : TokenRing-PT-005-CTLCardinality-2024-03
Could not compute solution for formula : TokenRing-PT-005-CTLCardinality-2024-04
Could not compute solution for formula : TokenRing-PT-005-CTLCardinality-2024-07
Could not compute solution for formula : TokenRing-PT-005-CTLCardinality-2024-08
Could not compute solution for formula : TokenRing-PT-005-CTLCardinality-2024-09
Could not compute solution for formula : TokenRing-PT-005-CTLCardinality-2024-11
Could not compute solution for formula : TokenRing-PT-005-CTLCardinality-2024-12
Could not compute solution for formula : TokenRing-PT-005-CTLCardinality-2024-13
Could not compute solution for formula : TokenRing-PT-005-CTLCardinality-2024-14
BK_STOP 1717244999350
--------------------
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:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ 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 CTLCardinality -timeout 360 -rebuildPNML
mcc2024
ctl formula name TokenRing-PT-005-CTLCardinality-2024-03
ctl formula formula --ctl=/tmp/1133/ctl_0_
ctl formula name TokenRing-PT-005-CTLCardinality-2024-04
ctl formula formula --ctl=/tmp/1133/ctl_1_
ctl formula name TokenRing-PT-005-CTLCardinality-2024-07
ctl formula formula --ctl=/tmp/1133/ctl_2_
ctl formula name TokenRing-PT-005-CTLCardinality-2024-08
ctl formula formula --ctl=/tmp/1133/ctl_3_
ctl formula name TokenRing-PT-005-CTLCardinality-2024-09
ctl formula formula --ctl=/tmp/1133/ctl_4_
ctl formula name TokenRing-PT-005-CTLCardinality-2024-11
ctl formula formula --ctl=/tmp/1133/ctl_5_
ctl formula name TokenRing-PT-005-CTLCardinality-2024-12
ctl formula formula --ctl=/tmp/1133/ctl_6_
ctl formula name TokenRing-PT-005-CTLCardinality-2024-13
ctl formula formula --ctl=/tmp/1133/ctl_7_
ctl formula name TokenRing-PT-005-CTLCardinality-2024-14
ctl formula formula --ctl=/tmp/1133/ctl_8_
pnml2lts-sym, ** error **: unknown vector set implementation lddmc
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="CTLCardinality"
export BK_TOOL="ltsminxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
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 CTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r540-smll-171690573700153"
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 [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "UpperBounds" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] || [ "CTLCardinality" = "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 [ "CTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLCardinality" != "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 "CTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLCardinality.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 [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLCardinality"
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 ;