Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r014-tall-174853743300099.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2025-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5832
Executing tool gold2024
Input is Anderson-PT-05, examination is Liveness
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r014-tall-174853743300099
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 592K
-rw-r--r-- 1 mcc users 7.3K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 75K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.6K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 58K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.9K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.0K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 21K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.6K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 80K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 65K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 3 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 185K May 29 14:32 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

FORMULA_NAME Liveness

=== Now, execution of the tool begins

BK_START 1748542208186

Invoking MCC driver with
BK_TOOL=gold2024
BK_EXAMINATION=Liveness
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=Anderson-PT-05
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2025-05-29 18:10:09] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, Liveness, -timeout, 180, -rebuildPNML]
[2025-05-29 18:10:09] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-05-29 18:10:09] [INFO ] Load time of PNML (sax parser for PT used): 79 ms
[2025-05-29 18:10:09] [INFO ] Transformed 161 places.
[2025-05-29 18:10:09] [INFO ] Transformed 365 transitions.
[2025-05-29 18:10:09] [INFO ] Found NUPN structural information;
[2025-05-29 18:10:09] [INFO ] Parsed PT model containing 161 places and 365 transitions and 1380 arcs in 177 ms.
Built sparse matrix representations for Structural reductions in 5 ms.21384KB memory used
Starting structural reductions in DEADLOCK mode, iteration 0 : 161/161 places, 365/365 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 36 ms. Remains 161 /161 variables (removed 0) and now considering 365/365 (removed 0) transitions.
Finished structural reductions in DEADLOCK mode , in 1 iterations and 49 ms. Remains : 161/161 places, 365/365 transitions.
Starting structural reductions in DEADLOCK mode, iteration 0 : 161/161 places, 365/365 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 15 ms. Remains 161 /161 variables (removed 0) and now considering 365/365 (removed 0) transitions.
// Phase 1: matrix 365 rows 161 cols
[2025-05-29 18:10:09] [INFO ] Computed 13 invariants in 21 ms
[2025-05-29 18:10:09] [INFO ] Implicit Places using invariants in 200 ms returned []
[2025-05-29 18:10:09] [INFO ] Invariant cache hit.
[2025-05-29 18:10:10] [INFO ] State equation strengthened by 20 read => feed constraints.
[2025-05-29 18:10:10] [INFO ] Implicit Places using invariants and state equation in 179 ms returned []
Implicit Place search using SMT with State Equation took 406 ms to find 0 implicit places.
[2025-05-29 18:10:10] [INFO ] Redundant transitions in 20 ms returned []
Running 360 sub problems to find dead transitions.
[2025-05-29 18:10:10] [INFO ] Invariant cache hit.
[2025-05-29 18:10:10] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/161 variables, 161/161 constraints. Problems are: Problem set: 0 solved, 360 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/161 variables, 6/167 constraints. Problems are: Problem set: 0 solved, 360 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/161 variables, 7/174 constraints. Problems are: Problem set: 0 solved, 360 unsolved
[2025-05-29 18:10:12] [INFO ] Deduced a trap composed of 84 places in 105 ms of which 13 ms to minimize.
[2025-05-29 18:10:12] [INFO ] Deduced a trap composed of 97 places in 80 ms of which 2 ms to minimize.
[2025-05-29 18:10:12] [INFO ] Deduced a trap composed of 68 places in 80 ms of which 1 ms to minimize.
[2025-05-29 18:10:12] [INFO ] Deduced a trap composed of 93 places in 85 ms of which 1 ms to minimize.
[2025-05-29 18:10:12] [INFO ] Deduced a trap composed of 93 places in 77 ms of which 2 ms to minimize.
[2025-05-29 18:10:12] [INFO ] Deduced a trap composed of 65 places in 67 ms of which 2 ms to minimize.
[2025-05-29 18:10:12] [INFO ] Deduced a trap composed of 62 places in 68 ms of which 2 ms to minimize.
[2025-05-29 18:10:12] [INFO ] Deduced a trap composed of 65 places in 69 ms of which 2 ms to minimize.
[2025-05-29 18:10:12] [INFO ] Deduced a trap composed of 83 places in 86 ms of which 1 ms to minimize.
[2025-05-29 18:10:12] [INFO ] Deduced a trap composed of 60 places in 75 ms of which 2 ms to minimize.
[2025-05-29 18:10:13] [INFO ] Deduced a trap composed of 45 places in 70 ms of which 2 ms to minimize.
[2025-05-29 18:10:13] [INFO ] Deduced a trap composed of 56 places in 73 ms of which 1 ms to minimize.
[2025-05-29 18:10:13] [INFO ] Deduced a trap composed of 54 places in 71 ms of which 1 ms to minimize.
[2025-05-29 18:10:13] [INFO ] Deduced a trap composed of 39 places in 72 ms of which 1 ms to minimize.
[2025-05-29 18:10:13] [INFO ] Deduced a trap composed of 74 places in 67 ms of which 1 ms to minimize.
[2025-05-29 18:10:13] [INFO ] Deduced a trap composed of 91 places in 72 ms of which 1 ms to minimize.
[2025-05-29 18:10:13] [INFO ] Deduced a trap composed of 98 places in 70 ms of which 1 ms to minimize.
[2025-05-29 18:10:13] [INFO ] Deduced a trap composed of 88 places in 69 ms of which 1 ms to minimize.
[2025-05-29 18:10:13] [INFO ] Deduced a trap composed of 63 places in 69 ms of which 1 ms to minimize.
[2025-05-29 18:10:13] [INFO ] Deduced a trap composed of 75 places in 69 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/161 variables, 20/194 constraints. Problems are: Problem set: 0 solved, 360 unsolved
[2025-05-29 18:10:15] [INFO ] Deduced a trap composed of 65 places in 63 ms of which 1 ms to minimize.
[2025-05-29 18:10:15] [INFO ] Deduced a trap composed of 88 places in 72 ms of which 1 ms to minimize.
[2025-05-29 18:10:15] [INFO ] Deduced a trap composed of 92 places in 76 ms of which 2 ms to minimize.
[2025-05-29 18:10:15] [INFO ] Deduced a trap composed of 82 places in 63 ms of which 2 ms to minimize.
[2025-05-29 18:10:16] [INFO ] Deduced a trap composed of 77 places in 63 ms of which 2 ms to minimize.
[2025-05-29 18:10:16] [INFO ] Deduced a trap composed of 73 places in 73 ms of which 1 ms to minimize.
[2025-05-29 18:10:16] [INFO ] Deduced a trap composed of 84 places in 65 ms of which 1 ms to minimize.
[2025-05-29 18:10:16] [INFO ] Deduced a trap composed of 90 places in 66 ms of which 1 ms to minimize.
[2025-05-29 18:10:16] [INFO ] Deduced a trap composed of 81 places in 72 ms of which 1 ms to minimize.
[2025-05-29 18:10:16] [INFO ] Deduced a trap composed of 77 places in 69 ms of which 2 ms to minimize.
[2025-05-29 18:10:16] [INFO ] Deduced a trap composed of 62 places in 69 ms of which 1 ms to minimize.
[2025-05-29 18:10:16] [INFO ] Deduced a trap composed of 57 places in 69 ms of which 1 ms to minimize.
[2025-05-29 18:10:16] [INFO ] Deduced a trap composed of 77 places in 66 ms of which 1 ms to minimize.
[2025-05-29 18:10:16] [INFO ] Deduced a trap composed of 64 places in 69 ms of which 1 ms to minimize.
[2025-05-29 18:10:17] [INFO ] Deduced a trap composed of 97 places in 75 ms of which 3 ms to minimize.
[2025-05-29 18:10:17] [INFO ] Deduced a trap composed of 43 places in 69 ms of which 1 ms to minimize.
[2025-05-29 18:10:17] [INFO ] Deduced a trap composed of 83 places in 75 ms of which 1 ms to minimize.
[2025-05-29 18:10:17] [INFO ] Deduced a trap composed of 56 places in 76 ms of which 2 ms to minimize.
[2025-05-29 18:10:17] [INFO ] Deduced a trap composed of 44 places in 66 ms of which 1 ms to minimize.
[2025-05-29 18:10:17] [INFO ] Deduced a trap composed of 85 places in 66 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/161 variables, 20/214 constraints. Problems are: Problem set: 0 solved, 360 unsolved
[2025-05-29 18:10:18] [INFO ] Deduced a trap composed of 61 places in 73 ms of which 1 ms to minimize.
[2025-05-29 18:10:18] [INFO ] Deduced a trap composed of 96 places in 72 ms of which 1 ms to minimize.
[2025-05-29 18:10:18] [INFO ] Deduced a trap composed of 82 places in 71 ms of which 1 ms to minimize.
[2025-05-29 18:10:18] [INFO ] Deduced a trap composed of 77 places in 65 ms of which 1 ms to minimize.
[2025-05-29 18:10:18] [INFO ] Deduced a trap composed of 114 places in 64 ms of which 1 ms to minimize.
[2025-05-29 18:10:18] [INFO ] Deduced a trap composed of 39 places in 76 ms of which 1 ms to minimize.
[2025-05-29 18:10:18] [INFO ] Deduced a trap composed of 66 places in 68 ms of which 1 ms to minimize.
[2025-05-29 18:10:19] [INFO ] Deduced a trap composed of 62 places in 73 ms of which 1 ms to minimize.
[2025-05-29 18:10:19] [INFO ] Deduced a trap composed of 73 places in 69 ms of which 1 ms to minimize.
[2025-05-29 18:10:19] [INFO ] Deduced a trap composed of 89 places in 69 ms of which 1 ms to minimize.
[2025-05-29 18:10:19] [INFO ] Deduced a trap composed of 80 places in 65 ms of which 1 ms to minimize.
[2025-05-29 18:10:19] [INFO ] Deduced a trap composed of 92 places in 74 ms of which 1 ms to minimize.
[2025-05-29 18:10:19] [INFO ] Deduced a trap composed of 77 places in 67 ms of which 1 ms to minimize.
[2025-05-29 18:10:19] [INFO ] Deduced a trap composed of 76 places in 69 ms of which 1 ms to minimize.
[2025-05-29 18:10:19] [INFO ] Deduced a trap composed of 68 places in 73 ms of which 1 ms to minimize.
[2025-05-29 18:10:19] [INFO ] Deduced a trap composed of 64 places in 77 ms of which 1 ms to minimize.
[2025-05-29 18:10:19] [INFO ] Deduced a trap composed of 80 places in 71 ms of which 4 ms to minimize.
[2025-05-29 18:10:20] [INFO ] Deduced a trap composed of 52 places in 70 ms of which 1 ms to minimize.
[2025-05-29 18:10:20] [INFO ] Deduced a trap composed of 52 places in 68 ms of which 1 ms to minimize.
[2025-05-29 18:10:20] [INFO ] Deduced a trap composed of 50 places in 74 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/161 variables, 20/234 constraints. Problems are: Problem set: 0 solved, 360 unsolved
[2025-05-29 18:10:21] [INFO ] Deduced a trap composed of 103 places in 74 ms of which 2 ms to minimize.
[2025-05-29 18:10:21] [INFO ] Deduced a trap composed of 74 places in 75 ms of which 1 ms to minimize.
[2025-05-29 18:10:21] [INFO ] Deduced a trap composed of 90 places in 68 ms of which 1 ms to minimize.
[2025-05-29 18:10:21] [INFO ] Deduced a trap composed of 65 places in 68 ms of which 2 ms to minimize.
[2025-05-29 18:10:21] [INFO ] Deduced a trap composed of 80 places in 69 ms of which 1 ms to minimize.
[2025-05-29 18:10:21] [INFO ] Deduced a trap composed of 59 places in 61 ms of which 1 ms to minimize.
[2025-05-29 18:10:22] [INFO ] Deduced a trap composed of 49 places in 71 ms of which 1 ms to minimize.
[2025-05-29 18:10:22] [INFO ] Deduced a trap composed of 99 places in 71 ms of which 1 ms to minimize.
[2025-05-29 18:10:22] [INFO ] Deduced a trap composed of 100 places in 72 ms of which 2 ms to minimize.
[2025-05-29 18:10:22] [INFO ] Deduced a trap composed of 82 places in 67 ms of which 1 ms to minimize.
[2025-05-29 18:10:22] [INFO ] Deduced a trap composed of 74 places in 69 ms of which 1 ms to minimize.
[2025-05-29 18:10:22] [INFO ] Deduced a trap composed of 77 places in 71 ms of which 1 ms to minimize.
[2025-05-29 18:10:22] [INFO ] Deduced a trap composed of 82 places in 76 ms of which 1 ms to minimize.
[2025-05-29 18:10:23] [INFO ] Deduced a trap composed of 80 places in 77 ms of which 1 ms to minimize.
[2025-05-29 18:10:23] [INFO ] Deduced a trap composed of 78 places in 68 ms of which 1 ms to minimize.
[2025-05-29 18:10:23] [INFO ] Deduced a trap composed of 63 places in 74 ms of which 2 ms to minimize.
[2025-05-29 18:10:23] [INFO ] Deduced a trap composed of 61 places in 70 ms of which 1 ms to minimize.
[2025-05-29 18:10:23] [INFO ] Deduced a trap composed of 64 places in 67 ms of which 1 ms to minimize.
[2025-05-29 18:10:23] [INFO ] Deduced a trap composed of 76 places in 65 ms of which 1 ms to minimize.
[2025-05-29 18:10:23] [INFO ] Deduced a trap composed of 56 places in 74 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/161 variables, 20/254 constraints. Problems are: Problem set: 0 solved, 360 unsolved
[2025-05-29 18:10:26] [INFO ] Deduced a trap composed of 95 places in 74 ms of which 1 ms to minimize.
[2025-05-29 18:10:26] [INFO ] Deduced a trap composed of 98 places in 72 ms of which 1 ms to minimize.
[2025-05-29 18:10:27] [INFO ] Deduced a trap composed of 66 places in 67 ms of which 1 ms to minimize.
[2025-05-29 18:10:27] [INFO ] Deduced a trap composed of 93 places in 67 ms of which 1 ms to minimize.
[2025-05-29 18:10:27] [INFO ] Deduced a trap composed of 89 places in 68 ms of which 1 ms to minimize.
[2025-05-29 18:10:27] [INFO ] Deduced a trap composed of 95 places in 71 ms of which 1 ms to minimize.
[2025-05-29 18:10:27] [INFO ] Deduced a trap composed of 53 places in 70 ms of which 1 ms to minimize.
[2025-05-29 18:10:27] [INFO ] Deduced a trap composed of 53 places in 65 ms of which 1 ms to minimize.
[2025-05-29 18:10:27] [INFO ] Deduced a trap composed of 95 places in 62 ms of which 1 ms to minimize.
[2025-05-29 18:10:27] [INFO ] Deduced a trap composed of 64 places in 77 ms of which 1 ms to minimize.
[2025-05-29 18:10:28] [INFO ] Deduced a trap composed of 84 places in 67 ms of which 1 ms to minimize.
[2025-05-29 18:10:28] [INFO ] Deduced a trap composed of 61 places in 63 ms of which 1 ms to minimize.
[2025-05-29 18:10:28] [INFO ] Deduced a trap composed of 37 places in 62 ms of which 1 ms to minimize.
[2025-05-29 18:10:28] [INFO ] Deduced a trap composed of 40 places in 70 ms of which 1 ms to minimize.
[2025-05-29 18:10:28] [INFO ] Deduced a trap composed of 73 places in 62 ms of which 1 ms to minimize.
[2025-05-29 18:10:28] [INFO ] Deduced a trap composed of 67 places in 61 ms of which 1 ms to minimize.
[2025-05-29 18:10:28] [INFO ] Deduced a trap composed of 40 places in 69 ms of which 1 ms to minimize.
[2025-05-29 18:10:28] [INFO ] Deduced a trap composed of 97 places in 76 ms of which 1 ms to minimize.
[2025-05-29 18:10:28] [INFO ] Deduced a trap composed of 77 places in 78 ms of which 1 ms to minimize.
[2025-05-29 18:10:29] [INFO ] Deduced a trap composed of 79 places in 72 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/161 variables, 20/274 constraints. Problems are: Problem set: 0 solved, 360 unsolved
[2025-05-29 18:10:30] [INFO ] Deduced a trap composed of 74 places in 76 ms of which 1 ms to minimize.
[2025-05-29 18:10:30] [INFO ] Deduced a trap composed of 86 places in 70 ms of which 1 ms to minimize.
[2025-05-29 18:10:30] [INFO ] Deduced a trap composed of 53 places in 61 ms of which 1 ms to minimize.
[2025-05-29 18:10:30] [INFO ] Deduced a trap composed of 67 places in 72 ms of which 1 ms to minimize.
[2025-05-29 18:10:30] [INFO ] Deduced a trap composed of 61 places in 72 ms of which 1 ms to minimize.
[2025-05-29 18:10:31] [INFO ] Deduced a trap composed of 87 places in 74 ms of which 1 ms to minimize.
[2025-05-29 18:10:31] [INFO ] Deduced a trap composed of 76 places in 69 ms of which 1 ms to minimize.
[2025-05-29 18:10:31] [INFO ] Deduced a trap composed of 79 places in 74 ms of which 1 ms to minimize.
[2025-05-29 18:10:32] [INFO ] Deduced a trap composed of 73 places in 77 ms of which 1 ms to minimize.
[2025-05-29 18:10:32] [INFO ] Deduced a trap composed of 49 places in 70 ms of which 1 ms to minimize.
[2025-05-29 18:10:33] [INFO ] Deduced a trap composed of 95 places in 76 ms of which 1 ms to minimize.
[2025-05-29 18:10:33] [INFO ] Deduced a trap composed of 48 places in 76 ms of which 1 ms to minimize.
[2025-05-29 18:10:34] [INFO ] Deduced a trap composed of 66 places in 70 ms of which 1 ms to minimize.
[2025-05-29 18:10:34] [INFO ] Deduced a trap composed of 69 places in 71 ms of which 1 ms to minimize.
[2025-05-29 18:10:34] [INFO ] Deduced a trap composed of 40 places in 75 ms of which 1 ms to minimize.
[2025-05-29 18:10:34] [INFO ] Deduced a trap composed of 78 places in 70 ms of which 1 ms to minimize.
[2025-05-29 18:10:34] [INFO ] Deduced a trap composed of 36 places in 72 ms of which 1 ms to minimize.
[2025-05-29 18:10:34] [INFO ] Deduced a trap composed of 65 places in 68 ms of which 1 ms to minimize.
[2025-05-29 18:10:34] [INFO ] Deduced a trap composed of 41 places in 73 ms of which 1 ms to minimize.
[2025-05-29 18:10:34] [INFO ] Deduced a trap composed of 75 places in 77 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/161 variables, 20/294 constraints. Problems are: Problem set: 0 solved, 360 unsolved
[2025-05-29 18:10:36] [INFO ] Deduced a trap composed of 45 places in 75 ms of which 1 ms to minimize.
[2025-05-29 18:10:36] [INFO ] Deduced a trap composed of 84 places in 77 ms of which 1 ms to minimize.
[2025-05-29 18:10:37] [INFO ] Deduced a trap composed of 63 places in 78 ms of which 1 ms to minimize.
[2025-05-29 18:10:37] [INFO ] Deduced a trap composed of 95 places in 71 ms of which 1 ms to minimize.
[2025-05-29 18:10:37] [INFO ] Deduced a trap composed of 62 places in 72 ms of which 1 ms to minimize.
[2025-05-29 18:10:37] [INFO ] Deduced a trap composed of 64 places in 72 ms of which 1 ms to minimize.
[2025-05-29 18:10:37] [INFO ] Deduced a trap composed of 65 places in 65 ms of which 1 ms to minimize.
[2025-05-29 18:10:37] [INFO ] Deduced a trap composed of 109 places in 69 ms of which 1 ms to minimize.
[2025-05-29 18:10:39] [INFO ] Deduced a trap composed of 73 places in 68 ms of which 1 ms to minimize.
[2025-05-29 18:10:39] [INFO ] Deduced a trap composed of 97 places in 74 ms of which 2 ms to minimize.
[2025-05-29 18:10:39] [INFO ] Deduced a trap composed of 77 places in 63 ms of which 1 ms to minimize.
[2025-05-29 18:10:40] [INFO ] Deduced a trap composed of 62 places in 78 ms of which 1 ms to minimize.
[2025-05-29 18:10:40] [INFO ] Deduced a trap composed of 75 places in 67 ms of which 1 ms to minimize.
[2025-05-29 18:10:40] [INFO ] Deduced a trap composed of 43 places in 69 ms of which 1 ms to minimize.
[2025-05-29 18:10:40] [INFO ] Deduced a trap composed of 109 places in 76 ms of which 1 ms to minimize.
[2025-05-29 18:10:40] [INFO ] Deduced a trap composed of 91 places in 72 ms of which 1 ms to minimize.
SMT process timed out in 30440ms, After SMT, problems are : Problem set: 0 solved, 360 unsolved
Search for dead transitions found 0 dead transitions in 30455ms
Finished structural reductions in DEADLOCK mode , in 1 iterations and 30918 ms. Remains : 161/161 places, 365/365 transitions.
Random walk for 1250000 steps, including 0 resets, run took 1373 ms (no deadlock found). (steps per millisecond=910 )
Random directed walk for 1250001 steps, including 0 resets, run took 1101 ms (no deadlock found). (steps per millisecond=1135 )
[2025-05-29 18:10:43] [INFO ] Invariant cache hit.
[2025-05-29 18:10:43] [INFO ] [Real]Absence check using 6 positive place invariants in 4 ms returned sat
[2025-05-29 18:10:43] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 101 ms returned unsat
Starting structural reductions in LIVENESS mode, iteration 0 : 161/161 places, 365/365 transitions.
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 20 Pre rules applied. Total rules applied 0 place count 161 transition count 345
Deduced a syphon composed of 20 places in 1 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 0 with 40 rules applied. Total rules applied 40 place count 141 transition count 345
Applied a total of 40 rules in 22 ms. Remains 141 /161 variables (removed 20) and now considering 345/365 (removed 20) transitions.
// Phase 1: matrix 345 rows 141 cols
[2025-05-29 18:10:43] [INFO ] Computed 13 invariants in 13 ms
[2025-05-29 18:10:43] [INFO ] Implicit Places using invariants in 199 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 203 ms to find 1 implicit places.
Starting structural reductions in LIVENESS mode, iteration 1 : 140/161 places, 345/365 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 25 transitions
Trivial Post-agglo rules discarded 25 transitions
Performed 25 trivial Post agglomeration. Transition count delta: 25
Iterating post reduction 0 with 25 rules applied. Total rules applied 25 place count 140 transition count 320
Reduce places removed 25 places and 0 transitions.
Iterating post reduction 1 with 25 rules applied. Total rules applied 50 place count 115 transition count 320
Applied a total of 50 rules in 4 ms. Remains 115 /140 variables (removed 25) and now considering 320/345 (removed 25) transitions.
// Phase 1: matrix 320 rows 115 cols
[2025-05-29 18:10:43] [INFO ] Computed 12 invariants in 7 ms
[2025-05-29 18:10:43] [INFO ] Implicit Places using invariants in 152 ms returned []
[2025-05-29 18:10:43] [INFO ] Invariant cache hit.
[2025-05-29 18:10:43] [INFO ] State equation strengthened by 35 read => feed constraints.
[2025-05-29 18:10:43] [INFO ] Implicit Places using invariants and state equation in 343 ms returned []
Implicit Place search using SMT with State Equation took 497 ms to find 0 implicit places.
Starting structural reductions in LIVENESS mode, iteration 2 : 115/161 places, 320/365 transitions.
Finished structural reductions in LIVENESS mode , in 2 iterations and 727 ms. Remains : 115/161 places, 320/365 transitions.
Initial state reduction rules removed 5 formulas.
RANDOM walk for 40000 steps (8 resets) in 1634 ms. (24 steps per ms) remains 19/315 properties
BEST_FIRST walk for 4003 steps (8 resets) in 42 ms. (93 steps per ms) remains 18/19 properties
BEST_FIRST walk for 4002 steps (8 resets) in 30 ms. (129 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4002 steps (8 resets) in 31 ms. (125 steps per ms) remains 17/18 properties
BEST_FIRST walk for 4003 steps (8 resets) in 29 ms. (133 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4002 steps (8 resets) in 23 ms. (166 steps per ms) remains 16/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 27 ms. (143 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4001 steps (8 resets) in 18 ms. (210 steps per ms) remains 15/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 14/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 23 ms. (166 steps per ms) remains 13/14 properties
BEST_FIRST walk for 4002 steps (8 resets) in 11 ms. (333 steps per ms) remains 13/13 properties
BEST_FIRST walk for 4003 steps (8 resets) in 18 ms. (210 steps per ms) remains 13/13 properties
BEST_FIRST walk for 4003 steps (8 resets) in 17 ms. (222 steps per ms) remains 10/13 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 9/10 properties
BEST_FIRST walk for 4003 steps (8 resets) in 13 ms. (285 steps per ms) remains 8/9 properties
BEST_FIRST walk for 4002 steps (8 resets) in 17 ms. (222 steps per ms) remains 7/8 properties
BEST_FIRST walk for 4003 steps (8 resets) in 13 ms. (285 steps per ms) remains 7/7 properties
BEST_FIRST walk for 4003 steps (8 resets) in 15 ms. (250 steps per ms) remains 6/7 properties
[2025-05-29 18:10:44] [INFO ] Invariant cache hit.
[2025-05-29 18:10:44] [INFO ] State equation strengthened by 35 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/7 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (OVERLAPS) 94/101 variables, 5/12 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/101 variables, 94/106 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/101 variables, 0/106 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 13/114 variables, 6/112 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/114 variables, 13/125 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2025-05-29 18:10:44] [INFO ] Deduced a trap composed of 42 places in 60 ms of which 1 ms to minimize.
[2025-05-29 18:10:44] [INFO ] Deduced a trap composed of 31 places in 59 ms of which 1 ms to minimize.
[2025-05-29 18:10:44] [INFO ] Deduced a trap composed of 31 places in 59 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/114 variables, 3/128 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/114 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (OVERLAPS) 1/115 variables, 1/129 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/115 variables, 1/130 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/115 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (OVERLAPS) 320/435 variables, 115/245 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/435 variables, 35/280 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/435 variables, 0/280 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 15 (OVERLAPS) 0/435 variables, 0/280 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 435/435 variables, and 280 constraints, problems are : Problem set: 0 solved, 6 unsolved in 666 ms.
Refiners :[Domain max(s): 115/115 constraints, Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 115/115 constraints, ReadFeed: 35/35 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/7 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (OVERLAPS) 94/101 variables, 5/12 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/101 variables, 94/106 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/101 variables, 0/106 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 13/114 variables, 6/112 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/114 variables, 13/125 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/114 variables, 3/128 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2025-05-29 18:10:45] [INFO ] Deduced a trap composed of 56 places in 63 ms of which 1 ms to minimize.
[2025-05-29 18:10:45] [INFO ] Deduced a trap composed of 40 places in 57 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/114 variables, 2/130 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2025-05-29 18:10:45] [INFO ] Deduced a trap composed of 24 places in 59 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/114 variables, 1/131 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/114 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (OVERLAPS) 1/115 variables, 1/132 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/115 variables, 1/133 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/115 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (OVERLAPS) 320/435 variables, 115/248 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/435 variables, 35/283 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/435 variables, 6/289 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/435 variables, 0/289 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 18 (OVERLAPS) 0/435 variables, 0/289 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 435/435 variables, and 289 constraints, problems are : Problem set: 0 solved, 6 unsolved in 844 ms.
Refiners :[Domain max(s): 115/115 constraints, Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 115/115 constraints, ReadFeed: 35/35 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 6/6 constraints]
After SMT, in 1533ms problems are : Problem set: 0 solved, 6 unsolved
Parikh walk visited 4 properties in 2240 ms.
Support contains 3 out of 115 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 115/115 places, 320/320 transitions.
Discarding 38 places :
Symmetric choice reduction at 0 with 38 rule applications. Total rules 38 place count 77 transition count 138
Iterating global reduction 0 with 38 rules applied. Total rules applied 76 place count 77 transition count 138
Applied a total of 76 rules in 11 ms. Remains 77 /115 variables (removed 38) and now considering 138/320 (removed 182) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 77/115 places, 138/320 transitions.
RANDOM walk for 2784001 steps (5 resets) in 4949 ms. (562 steps per ms) remains 0/2 properties
Able to resolve query QuasiLiveness after proving 320 properties.
Starting structural reductions in LIVENESS mode, iteration 0 : 161/161 places, 365/365 transitions.
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 20 Pre rules applied. Total rules applied 0 place count 161 transition count 345
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 0 with 40 rules applied. Total rules applied 40 place count 141 transition count 345
Applied a total of 40 rules in 8 ms. Remains 141 /161 variables (removed 20) and now considering 345/365 (removed 20) transitions.
// Phase 1: matrix 345 rows 141 cols
[2025-05-29 18:10:50] [INFO ] Computed 13 invariants in 7 ms
[2025-05-29 18:10:50] [INFO ] Implicit Places using invariants in 173 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 174 ms to find 1 implicit places.
Starting structural reductions in LIVENESS mode, iteration 1 : 140/161 places, 345/365 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 25 transitions
Trivial Post-agglo rules discarded 25 transitions
Performed 25 trivial Post agglomeration. Transition count delta: 25
Iterating post reduction 0 with 25 rules applied. Total rules applied 25 place count 140 transition count 320
Reduce places removed 25 places and 0 transitions.
Iterating post reduction 1 with 25 rules applied. Total rules applied 50 place count 115 transition count 320
Applied a total of 50 rules in 3 ms. Remains 115 /140 variables (removed 25) and now considering 320/345 (removed 25) transitions.
// Phase 1: matrix 320 rows 115 cols
[2025-05-29 18:10:50] [INFO ] Computed 12 invariants in 3 ms
[2025-05-29 18:10:50] [INFO ] Implicit Places using invariants in 135 ms returned []
[2025-05-29 18:10:50] [INFO ] Invariant cache hit.
[2025-05-29 18:10:50] [INFO ] State equation strengthened by 35 read => feed constraints.
[2025-05-29 18:10:50] [INFO ] Implicit Places using invariants and state equation in 326 ms returned []
Implicit Place search using SMT with State Equation took 462 ms to find 0 implicit places.
Starting structural reductions in LIVENESS mode, iteration 2 : 115/161 places, 320/365 transitions.
Finished structural reductions in LIVENESS mode , in 2 iterations and 647 ms. Remains : 115/161 places, 320/365 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 :320 assertions to prove.
No /home/mcc/execution/Liveness.xml examination file found. Proceeding without properties.
Parsed 320 properties from file /home/mcc/execution/Liveness.xml in 1 ms.
Working with output stream class java.io.PrintStream
Total runtime 41633 ms.
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running Anderson-PT-05

IS_COLORED=
IS_NUPN=1

LOADING model.pnml ...
MODEL CLASS: P/T NET WITH NUPN EXTENSION
PLACES: 161
TRANSITIONS: 365
CONSTANTS: 0
TEMPLATE VARS: 0
ARCS: 1380
NUPN UNITS: 8
LOADING TIME: 0.31

SAVING AS /home/mcc/execution/model.(net/def) ...
exportGspn useExt=true
SAVING TIME: 0.026
SAVING NAME MAP FILE /home/mcc/execution/model.id2name ...
SAVING NUPN UNITS AS FILE /home/mcc/execution/model.nu ...
TOTAL TIME: 0.54
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: 1004
MODEL NAME: /home/mcc/execution/model
161 places, 365 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 1748542741022

--------------------
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-05"
export BK_EXAMINATION="Liveness"
export BK_TOOL="gold2024"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="1800"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5832"
echo " Executing tool gold2024"
echo " Input is Anderson-PT-05, 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 r014-tall-174853743300099"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/Anderson-PT-05.tgz
mv Anderson-PT-05 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.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 ;