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.r012-smll-171620124100199.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 greatspnxred
Input is Anderson-PT-04, examination is Liveness
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r012-smll-171620124100199
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 548K
-rw-r--r-- 1 mcc users 5.3K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 51K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.8K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 50K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K Apr 22 14:27 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Apr 22 14:27 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.0K Apr 22 14:27 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 22 14:27 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K Apr 12 15:51 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 151K Apr 12 15:51 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Apr 12 15:50 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 70K Apr 12 15:50 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 22 14:27 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Apr 22 14:27 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 3 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 103K May 18 16:42 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

FORMULA_NAME Liveness

=== Now, execution of the tool begins

BK_START 1716261280752

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=Liveness
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=Anderson-PT-04
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-21 03:14:42] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, Liveness, -timeout, 180, -rebuildPNML]
[2024-05-21 03:14:42] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 03:14:43] [INFO ] Load time of PNML (sax parser for PT used): 145 ms
[2024-05-21 03:14:43] [INFO ] Transformed 105 places.
[2024-05-21 03:14:43] [INFO ] Transformed 200 transitions.
[2024-05-21 03:14:43] [INFO ] Found NUPN structural information;
[2024-05-21 03:14:43] [INFO ] Parsed PT model containing 105 places and 200 transitions and 752 arcs in 371 ms.
Built sparse matrix representations for Structural reductions in 10 ms.18030KB memory used
Starting structural reductions in DEADLOCK mode, iteration 0 : 105/105 places, 200/200 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Applied a total of 0 rules in 50 ms. Remains 105 /105 variables (removed 0) and now considering 200/200 (removed 0) transitions.
Finished structural reductions in DEADLOCK mode , in 1 iterations and 83 ms. Remains : 105/105 places, 200/200 transitions.
Starting structural reductions in DEADLOCK mode, iteration 0 : 105/105 places, 200/200 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Applied a total of 0 rules in 22 ms. Remains 105 /105 variables (removed 0) and now considering 200/200 (removed 0) transitions.
// Phase 1: matrix 200 rows 105 cols
[2024-05-21 03:14:43] [INFO ] Computed 11 invariants in 42 ms
[2024-05-21 03:14:44] [INFO ] Implicit Places using invariants in 407 ms returned []
[2024-05-21 03:14:44] [INFO ] Invariant cache hit.
[2024-05-21 03:14:44] [INFO ] State equation strengthened by 12 read => feed constraints.
[2024-05-21 03:14:44] [INFO ] Implicit Places using invariants and state equation in 326 ms returned []
Implicit Place search using SMT with State Equation took 927 ms to find 0 implicit places.
[2024-05-21 03:14:44] [INFO ] Redundant transitions in 18 ms returned []
Running 196 sub problems to find dead transitions.
[2024-05-21 03:14:44] [INFO ] Invariant cache hit.
[2024-05-21 03:14:44] [INFO ] State equation strengthened by 12 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/105 variables, 105/105 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/105 variables, 5/110 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/105 variables, 6/116 constraints. Problems are: Problem set: 0 solved, 196 unsolved
[2024-05-21 03:14:47] [INFO ] Deduced a trap composed of 38 places in 177 ms of which 30 ms to minimize.
[2024-05-21 03:14:47] [INFO ] Deduced a trap composed of 48 places in 192 ms of which 3 ms to minimize.
[2024-05-21 03:14:47] [INFO ] Deduced a trap composed of 49 places in 177 ms of which 3 ms to minimize.
[2024-05-21 03:14:47] [INFO ] Deduced a trap composed of 54 places in 90 ms of which 2 ms to minimize.
[2024-05-21 03:14:47] [INFO ] Deduced a trap composed of 53 places in 101 ms of which 2 ms to minimize.
[2024-05-21 03:14:47] [INFO ] Deduced a trap composed of 44 places in 91 ms of which 2 ms to minimize.
[2024-05-21 03:14:47] [INFO ] Deduced a trap composed of 47 places in 95 ms of which 2 ms to minimize.
[2024-05-21 03:14:48] [INFO ] Deduced a trap composed of 51 places in 92 ms of which 2 ms to minimize.
[2024-05-21 03:14:48] [INFO ] Deduced a trap composed of 52 places in 94 ms of which 2 ms to minimize.
[2024-05-21 03:14:48] [INFO ] Deduced a trap composed of 72 places in 81 ms of which 2 ms to minimize.
[2024-05-21 03:14:48] [INFO ] Deduced a trap composed of 52 places in 88 ms of which 2 ms to minimize.
[2024-05-21 03:14:48] [INFO ] Deduced a trap composed of 37 places in 88 ms of which 2 ms to minimize.
[2024-05-21 03:14:48] [INFO ] Deduced a trap composed of 61 places in 140 ms of which 9 ms to minimize.
[2024-05-21 03:14:48] [INFO ] Deduced a trap composed of 41 places in 93 ms of which 2 ms to minimize.
[2024-05-21 03:14:48] [INFO ] Deduced a trap composed of 68 places in 118 ms of which 2 ms to minimize.
[2024-05-21 03:14:49] [INFO ] Deduced a trap composed of 78 places in 124 ms of which 3 ms to minimize.
[2024-05-21 03:14:49] [INFO ] Deduced a trap composed of 32 places in 149 ms of which 2 ms to minimize.
[2024-05-21 03:14:49] [INFO ] Deduced a trap composed of 33 places in 82 ms of which 2 ms to minimize.
[2024-05-21 03:14:49] [INFO ] Deduced a trap composed of 53 places in 85 ms of which 2 ms to minimize.
[2024-05-21 03:14:49] [INFO ] Deduced a trap composed of 46 places in 87 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/105 variables, 20/136 constraints. Problems are: Problem set: 0 solved, 196 unsolved
[2024-05-21 03:14:50] [INFO ] Deduced a trap composed of 48 places in 86 ms of which 1 ms to minimize.
[2024-05-21 03:14:51] [INFO ] Deduced a trap composed of 32 places in 79 ms of which 1 ms to minimize.
[2024-05-21 03:14:51] [INFO ] Deduced a trap composed of 49 places in 76 ms of which 2 ms to minimize.
[2024-05-21 03:14:51] [INFO ] Deduced a trap composed of 75 places in 73 ms of which 2 ms to minimize.
[2024-05-21 03:14:51] [INFO ] Deduced a trap composed of 66 places in 71 ms of which 1 ms to minimize.
[2024-05-21 03:14:51] [INFO ] Deduced a trap composed of 58 places in 68 ms of which 1 ms to minimize.
[2024-05-21 03:14:51] [INFO ] Deduced a trap composed of 62 places in 69 ms of which 2 ms to minimize.
[2024-05-21 03:14:51] [INFO ] Deduced a trap composed of 66 places in 86 ms of which 1 ms to minimize.
[2024-05-21 03:14:51] [INFO ] Deduced a trap composed of 51 places in 74 ms of which 2 ms to minimize.
[2024-05-21 03:14:51] [INFO ] Deduced a trap composed of 62 places in 69 ms of which 2 ms to minimize.
[2024-05-21 03:14:51] [INFO ] Deduced a trap composed of 65 places in 68 ms of which 1 ms to minimize.
[2024-05-21 03:14:52] [INFO ] Deduced a trap composed of 62 places in 97 ms of which 1 ms to minimize.
[2024-05-21 03:14:52] [INFO ] Deduced a trap composed of 62 places in 81 ms of which 2 ms to minimize.
[2024-05-21 03:14:52] [INFO ] Deduced a trap composed of 63 places in 66 ms of which 1 ms to minimize.
[2024-05-21 03:14:52] [INFO ] Deduced a trap composed of 46 places in 129 ms of which 7 ms to minimize.
[2024-05-21 03:14:52] [INFO ] Deduced a trap composed of 56 places in 121 ms of which 2 ms to minimize.
[2024-05-21 03:14:52] [INFO ] Deduced a trap composed of 68 places in 140 ms of which 3 ms to minimize.
[2024-05-21 03:14:52] [INFO ] Deduced a trap composed of 49 places in 113 ms of which 2 ms to minimize.
[2024-05-21 03:14:52] [INFO ] Deduced a trap composed of 28 places in 95 ms of which 2 ms to minimize.
[2024-05-21 03:14:53] [INFO ] Deduced a trap composed of 24 places in 92 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/105 variables, 20/156 constraints. Problems are: Problem set: 0 solved, 196 unsolved
[2024-05-21 03:14:53] [INFO ] Deduced a trap composed of 35 places in 65 ms of which 1 ms to minimize.
[2024-05-21 03:14:53] [INFO ] Deduced a trap composed of 28 places in 67 ms of which 2 ms to minimize.
[2024-05-21 03:14:53] [INFO ] Deduced a trap composed of 52 places in 86 ms of which 2 ms to minimize.
[2024-05-21 03:14:53] [INFO ] Deduced a trap composed of 40 places in 88 ms of which 2 ms to minimize.
[2024-05-21 03:14:54] [INFO ] Deduced a trap composed of 70 places in 82 ms of which 2 ms to minimize.
[2024-05-21 03:14:54] [INFO ] Deduced a trap composed of 57 places in 84 ms of which 2 ms to minimize.
[2024-05-21 03:14:54] [INFO ] Deduced a trap composed of 63 places in 77 ms of which 2 ms to minimize.
[2024-05-21 03:14:54] [INFO ] Deduced a trap composed of 50 places in 77 ms of which 1 ms to minimize.
[2024-05-21 03:14:54] [INFO ] Deduced a trap composed of 39 places in 78 ms of which 2 ms to minimize.
[2024-05-21 03:14:54] [INFO ] Deduced a trap composed of 49 places in 76 ms of which 1 ms to minimize.
[2024-05-21 03:14:55] [INFO ] Deduced a trap composed of 56 places in 75 ms of which 2 ms to minimize.
[2024-05-21 03:14:55] [INFO ] Deduced a trap composed of 39 places in 74 ms of which 1 ms to minimize.
[2024-05-21 03:14:55] [INFO ] Deduced a trap composed of 36 places in 67 ms of which 2 ms to minimize.
[2024-05-21 03:14:55] [INFO ] Deduced a trap composed of 66 places in 74 ms of which 1 ms to minimize.
[2024-05-21 03:14:55] [INFO ] Deduced a trap composed of 79 places in 80 ms of which 2 ms to minimize.
[2024-05-21 03:14:55] [INFO ] Deduced a trap composed of 51 places in 76 ms of which 2 ms to minimize.
[2024-05-21 03:14:55] [INFO ] Deduced a trap composed of 80 places in 100 ms of which 12 ms to minimize.
[2024-05-21 03:14:55] [INFO ] Deduced a trap composed of 54 places in 74 ms of which 1 ms to minimize.
[2024-05-21 03:14:55] [INFO ] Deduced a trap composed of 42 places in 67 ms of which 1 ms to minimize.
[2024-05-21 03:14:55] [INFO ] Deduced a trap composed of 51 places in 65 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/105 variables, 20/176 constraints. Problems are: Problem set: 0 solved, 196 unsolved
[2024-05-21 03:14:56] [INFO ] Deduced a trap composed of 53 places in 90 ms of which 2 ms to minimize.
[2024-05-21 03:14:56] [INFO ] Deduced a trap composed of 62 places in 105 ms of which 3 ms to minimize.
[2024-05-21 03:14:56] [INFO ] Deduced a trap composed of 53 places in 110 ms of which 2 ms to minimize.
[2024-05-21 03:14:57] [INFO ] Deduced a trap composed of 58 places in 87 ms of which 3 ms to minimize.
[2024-05-21 03:14:57] [INFO ] Deduced a trap composed of 49 places in 96 ms of which 2 ms to minimize.
[2024-05-21 03:14:57] [INFO ] Deduced a trap composed of 50 places in 129 ms of which 3 ms to minimize.
[2024-05-21 03:14:57] [INFO ] Deduced a trap composed of 36 places in 89 ms of which 3 ms to minimize.
[2024-05-21 03:14:58] [INFO ] Deduced a trap composed of 57 places in 113 ms of which 2 ms to minimize.
[2024-05-21 03:14:58] [INFO ] Deduced a trap composed of 54 places in 93 ms of which 2 ms to minimize.
[2024-05-21 03:14:58] [INFO ] Deduced a trap composed of 44 places in 70 ms of which 2 ms to minimize.
[2024-05-21 03:14:58] [INFO ] Deduced a trap composed of 49 places in 95 ms of which 2 ms to minimize.
[2024-05-21 03:14:58] [INFO ] Deduced a trap composed of 65 places in 94 ms of which 2 ms to minimize.
[2024-05-21 03:14:58] [INFO ] Deduced a trap composed of 52 places in 77 ms of which 2 ms to minimize.
[2024-05-21 03:14:58] [INFO ] Deduced a trap composed of 56 places in 110 ms of which 2 ms to minimize.
[2024-05-21 03:14:59] [INFO ] Deduced a trap composed of 42 places in 127 ms of which 3 ms to minimize.
[2024-05-21 03:14:59] [INFO ] Deduced a trap composed of 39 places in 101 ms of which 2 ms to minimize.
[2024-05-21 03:14:59] [INFO ] Deduced a trap composed of 50 places in 78 ms of which 1 ms to minimize.
[2024-05-21 03:14:59] [INFO ] Deduced a trap composed of 30 places in 79 ms of which 2 ms to minimize.
[2024-05-21 03:14:59] [INFO ] Deduced a trap composed of 56 places in 73 ms of which 1 ms to minimize.
[2024-05-21 03:14:59] [INFO ] Deduced a trap composed of 51 places in 76 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/105 variables, 20/196 constraints. Problems are: Problem set: 0 solved, 196 unsolved
[2024-05-21 03:15:02] [INFO ] Deduced a trap composed of 27 places in 96 ms of which 2 ms to minimize.
[2024-05-21 03:15:03] [INFO ] Deduced a trap composed of 24 places in 101 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/105 variables, 2/198 constraints. Problems are: Problem set: 0 solved, 196 unsolved
[2024-05-21 03:15:04] [INFO ] Deduced a trap composed of 45 places in 87 ms of which 2 ms to minimize.
[2024-05-21 03:15:04] [INFO ] Deduced a trap composed of 35 places in 100 ms of which 2 ms to minimize.
[2024-05-21 03:15:05] [INFO ] Deduced a trap composed of 24 places in 108 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/105 variables, 3/201 constraints. Problems are: Problem set: 0 solved, 196 unsolved
[2024-05-21 03:15:06] [INFO ] Deduced a trap composed of 77 places in 85 ms of which 2 ms to minimize.
[2024-05-21 03:15:06] [INFO ] Deduced a trap composed of 57 places in 96 ms of which 3 ms to minimize.
[2024-05-21 03:15:06] [INFO ] Deduced a trap composed of 68 places in 103 ms of which 2 ms to minimize.
[2024-05-21 03:15:06] [INFO ] Deduced a trap composed of 51 places in 64 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/105 variables, 4/205 constraints. Problems are: Problem set: 0 solved, 196 unsolved
[2024-05-21 03:15:10] [INFO ] Deduced a trap composed of 56 places in 84 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/105 variables, 1/206 constraints. Problems are: Problem set: 0 solved, 196 unsolved
[2024-05-21 03:15:12] [INFO ] Deduced a trap composed of 33 places in 87 ms of which 2 ms to minimize.
[2024-05-21 03:15:12] [INFO ] Deduced a trap composed of 58 places in 132 ms of which 3 ms to minimize.
[2024-05-21 03:15:13] [INFO ] Deduced a trap composed of 51 places in 97 ms of which 2 ms to minimize.
[2024-05-21 03:15:13] [INFO ] Deduced a trap composed of 52 places in 130 ms of which 2 ms to minimize.
[2024-05-21 03:15:13] [INFO ] Deduced a trap composed of 49 places in 112 ms of which 2 ms to minimize.
[2024-05-21 03:15:14] [INFO ] Deduced a trap composed of 69 places in 130 ms of which 2 ms to minimize.
[2024-05-21 03:15:14] [INFO ] Deduced a trap composed of 46 places in 109 ms of which 2 ms to minimize.
[2024-05-21 03:15:14] [INFO ] Deduced a trap composed of 35 places in 97 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/105 variables, 8/214 constraints. Problems are: Problem set: 0 solved, 196 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 105/305 variables, and 214 constraints, problems are : Problem set: 0 solved, 196 unsolved in 30039 ms.
Refiners :[Domain max(s): 105/105 constraints, Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 0/105 constraints, ReadFeed: 0/12 constraints, PredecessorRefiner: 196/196 constraints, Known Traps: 98/98 constraints]
Escalating to Integer solving :Problem set: 0 solved, 196 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/105 variables, 105/105 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/105 variables, 5/110 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/105 variables, 6/116 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/105 variables, 98/214 constraints. Problems are: Problem set: 0 solved, 196 unsolved
[2024-05-21 03:15:16] [INFO ] Deduced a trap composed of 68 places in 71 ms of which 2 ms to minimize.
[2024-05-21 03:15:16] [INFO ] Deduced a trap composed of 63 places in 109 ms of which 3 ms to minimize.
[2024-05-21 03:15:17] [INFO ] Deduced a trap composed of 44 places in 134 ms of which 2 ms to minimize.
[2024-05-21 03:15:17] [INFO ] Deduced a trap composed of 27 places in 72 ms of which 2 ms to minimize.
[2024-05-21 03:15:18] [INFO ] Deduced a trap composed of 42 places in 64 ms of which 2 ms to minimize.
[2024-05-21 03:15:18] [INFO ] Deduced a trap composed of 40 places in 68 ms of which 1 ms to minimize.
[2024-05-21 03:15:18] [INFO ] Deduced a trap composed of 46 places in 82 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/105 variables, 7/221 constraints. Problems are: Problem set: 0 solved, 196 unsolved
[2024-05-21 03:15:20] [INFO ] Deduced a trap composed of 29 places in 73 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/105 variables, 1/222 constraints. Problems are: Problem set: 0 solved, 196 unsolved
[2024-05-21 03:15:25] [INFO ] Deduced a trap composed of 51 places in 103 ms of which 3 ms to minimize.
[2024-05-21 03:15:25] [INFO ] Deduced a trap composed of 47 places in 85 ms of which 2 ms to minimize.
[2024-05-21 03:15:25] [INFO ] Deduced a trap composed of 52 places in 122 ms of which 2 ms to minimize.
[2024-05-21 03:15:25] [INFO ] Deduced a trap composed of 50 places in 110 ms of which 2 ms to minimize.
[2024-05-21 03:15:27] [INFO ] Deduced a trap composed of 43 places in 80 ms of which 2 ms to minimize.
[2024-05-21 03:15:27] [INFO ] Deduced a trap composed of 50 places in 99 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/105 variables, 6/228 constraints. Problems are: Problem set: 0 solved, 196 unsolved
[2024-05-21 03:15:29] [INFO ] Deduced a trap composed of 45 places in 91 ms of which 2 ms to minimize.
[2024-05-21 03:15:29] [INFO ] Deduced a trap composed of 47 places in 73 ms of which 2 ms to minimize.
[2024-05-21 03:15:29] [INFO ] Deduced a trap composed of 27 places in 126 ms of which 3 ms to minimize.
[2024-05-21 03:15:31] [INFO ] Deduced a trap composed of 46 places in 80 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/105 variables, 4/232 constraints. Problems are: Problem set: 0 solved, 196 unsolved
[2024-05-21 03:15:33] [INFO ] Deduced a trap composed of 33 places in 70 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/105 variables, 1/233 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/105 variables, 0/233 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 10 (OVERLAPS) 200/305 variables, 105/338 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/305 variables, 12/350 constraints. Problems are: Problem set: 0 solved, 196 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 305/305 variables, and 546 constraints, problems are : Problem set: 0 solved, 196 unsolved in 30092 ms.
Refiners :[Domain max(s): 105/105 constraints, Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 105/105 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 196/196 constraints, Known Traps: 117/117 constraints]
After SMT, in 60588ms problems are : Problem set: 0 solved, 196 unsolved
Search for dead transitions found 0 dead transitions in 60639ms
Finished structural reductions in DEADLOCK mode , in 1 iterations and 61634 ms. Remains : 105/105 places, 200/200 transitions.
Random walk for 1250000 steps, including 0 resets, run took 1441 ms (no deadlock found). (steps per millisecond=867 )
Random directed walk for 1250001 steps, including 0 resets, run took 962 ms (no deadlock found). (steps per millisecond=1299 )
[2024-05-21 03:15:47] [INFO ] Invariant cache hit.
[2024-05-21 03:15:47] [INFO ] [Real]Absence check using 5 positive place invariants in 5 ms returned sat
[2024-05-21 03:15:47] [INFO ] [Real]Absence check using 5 positive and 6 generalized place invariants in 23 ms returned unsat
Starting structural reductions in LIVENESS mode, iteration 0 : 105/105 places, 200/200 transitions.
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 12 Pre rules applied. Total rules applied 0 place count 105 transition count 188
Deduced a syphon composed of 12 places in 1 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 0 with 24 rules applied. Total rules applied 24 place count 93 transition count 188
Applied a total of 24 rules in 22 ms. Remains 93 /105 variables (removed 12) and now considering 188/200 (removed 12) transitions.
// Phase 1: matrix 188 rows 93 cols
[2024-05-21 03:15:47] [INFO ] Computed 11 invariants in 4 ms
[2024-05-21 03:15:47] [INFO ] Implicit Places using invariants in 206 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 215 ms to find 1 implicit places.
Starting structural reductions in LIVENESS mode, iteration 1 : 92/105 places, 188/200 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 0 with 16 rules applied. Total rules applied 16 place count 92 transition count 172
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 1 with 16 rules applied. Total rules applied 32 place count 76 transition count 172
Applied a total of 32 rules in 6 ms. Remains 76 /92 variables (removed 16) and now considering 172/188 (removed 16) transitions.
// Phase 1: matrix 172 rows 76 cols
[2024-05-21 03:15:47] [INFO ] Computed 10 invariants in 2 ms
[2024-05-21 03:15:48] [INFO ] Implicit Places using invariants in 151 ms returned []
[2024-05-21 03:15:48] [INFO ] Invariant cache hit.
[2024-05-21 03:15:48] [INFO ] State equation strengthened by 20 read => feed constraints.
[2024-05-21 03:15:48] [INFO ] Implicit Places using invariants and state equation in 303 ms returned []
Implicit Place search using SMT with State Equation took 457 ms to find 0 implicit places.
Starting structural reductions in LIVENESS mode, iteration 2 : 76/105 places, 172/200 transitions.
Finished structural reductions in LIVENESS mode , in 2 iterations and 701 ms. Remains : 76/105 places, 172/200 transitions.
Initial state reduction rules removed 4 formulas.
RANDOM walk for 40000 steps (8 resets) in 2283 ms. (17 steps per ms) remains 2/168 properties
BEST_FIRST walk for 40003 steps (8 resets) in 159 ms. (250 steps per ms) remains 1/2 properties
BEST_FIRST walk for 2483 steps (0 resets) in 15 ms. (155 steps per ms) remains 0/1 properties
Able to resolve query QuasiLiveness after proving 172 properties.
Starting structural reductions in LIVENESS mode, iteration 0 : 105/105 places, 200/200 transitions.
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 12 Pre rules applied. Total rules applied 0 place count 105 transition count 188
Deduced a syphon composed of 12 places in 1 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 0 with 24 rules applied. Total rules applied 24 place count 93 transition count 188
Applied a total of 24 rules in 6 ms. Remains 93 /105 variables (removed 12) and now considering 188/200 (removed 12) transitions.
// Phase 1: matrix 188 rows 93 cols
[2024-05-21 03:15:49] [INFO ] Computed 11 invariants in 4 ms
[2024-05-21 03:15:49] [INFO ] Implicit Places using invariants in 212 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 214 ms to find 1 implicit places.
Starting structural reductions in LIVENESS mode, iteration 1 : 92/105 places, 188/200 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 0 with 16 rules applied. Total rules applied 16 place count 92 transition count 172
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 1 with 16 rules applied. Total rules applied 32 place count 76 transition count 172
Applied a total of 32 rules in 5 ms. Remains 76 /92 variables (removed 16) and now considering 172/188 (removed 16) transitions.
// Phase 1: matrix 172 rows 76 cols
[2024-05-21 03:15:49] [INFO ] Computed 10 invariants in 2 ms
[2024-05-21 03:15:49] [INFO ] Implicit Places using invariants in 171 ms returned []
[2024-05-21 03:15:49] [INFO ] Invariant cache hit.
[2024-05-21 03:15:49] [INFO ] State equation strengthened by 20 read => feed constraints.
[2024-05-21 03:15:49] [INFO ] Implicit Places using invariants and state equation in 263 ms returned []
Implicit Place search using SMT with State Equation took 436 ms to find 0 implicit places.
Starting structural reductions in LIVENESS mode, iteration 2 : 76/105 places, 172/200 transitions.
Finished structural reductions in LIVENESS mode , in 2 iterations and 662 ms. Remains : 76/105 places, 172/200 transitions.
Net is quasi-live, checking if it is reversible to establish liveness.
Net is conservative; using simplified expression for initial state.
Unable to solve all queries for examination Liveness. Remains :1 assertions to prove.
Unable to solve all queries for examination Liveness. Remains :172 assertions to prove.
No /home/mcc/execution/Liveness.xml examination file found. Proceeding without properties.
Parsed 172 properties from file /home/mcc/execution/Liveness.xml in 1 ms.
Working with output stream class java.io.PrintStream
Total runtime 66992 ms.
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running Anderson-PT-04

IS_COLORED=
IS_NUPN=1

LOADING model.pnml ...
MODEL CLASS: P/T NET WITH NUPN EXTENSION
PLACES: 105
TRANSITIONS: 200
CONSTANTS: 0
TEMPLATE VARS: 0
ARCS: 752
NUPN UNITS: 7
LOADING TIME: 0.461

SAVING AS /home/mcc/execution/model.(net/def) ...
exportGspn useExt=true
SAVING TIME: 0.047
SAVING NAME MAP FILE /home/mcc/execution/model.id2name ...
SAVING NUPN UNITS AS FILE /home/mcc/execution/model.nu ...
TOTAL TIME: 0.965
OK.
----------------------------------------------------------------------
GreatSPN/Meddly.
Copyright (C) 1987-2022, University of Torino, Italy.
website: https://github.com/greatspn/SOURCES

Based on MEDDLY version 0.16.0
Copyright (C) 2009, Iowa State University Research Foundation, Inc.
website: http://meddly.sourceforge.net

Process ID: 935
MODEL NAME: /home/mcc/execution/model
105 places, 200 transitions.

Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Building monolithic NSF...
FORMULA Liveness TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
Ok.
EXITCODE: 0
----------------------------------------------------------------------

BK_STOP 1716261393173

--------------------
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 Liveness -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="Anderson-PT-04"
export BK_EXAMINATION="Liveness"
export BK_TOOL="greatspnxred"
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 greatspnxred"
echo " Input is Anderson-PT-04, examination is Liveness"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r012-smll-171620124100199"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/Anderson-PT-04.tgz
mv Anderson-PT-04 execution
cd execution
if [ "Liveness" = "ReachabilityDeadlock" ] || [ "Liveness" = "UpperBounds" ] || [ "Liveness" = "QuasiLiveness" ] || [ "Liveness" = "StableMarking" ] || [ "Liveness" = "Liveness" ] || [ "Liveness" = "OneSafe" ] || [ "Liveness" = "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 [ "Liveness" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "Liveness" != "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 "Liveness.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property Liveness.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "Liveness.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 '' Liveness.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "Liveness" = "ReachabilityDeadlock" ] || [ "Liveness" = "QuasiLiveness" ] || [ "Liveness" = "StableMarking" ] || [ "Liveness" = "Liveness" ] || [ "Liveness" = "OneSafe" ] ; then
echo "FORMULA_NAME Liveness"
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 ;