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-171620124100209.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-06, examination is Liveness
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r012-smll-171620124100209
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 732K
-rw-r--r-- 1 mcc users 5.3K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 53K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.5K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 57K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K Apr 22 14:27 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 22 14:27 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.1K Apr 22 14:27 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K Apr 22 14:27 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Apr 12 15:37 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 133K Apr 12 15:37 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.0K Apr 12 15:36 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 58K Apr 12 15:36 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 302K 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 1716261916933

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-06
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-21 03:25:18] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, Liveness, -timeout, 180, -rebuildPNML]
[2024-05-21 03:25:18] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 03:25:19] [INFO ] Load time of PNML (sax parser for PT used): 202 ms
[2024-05-21 03:25:19] [INFO ] Transformed 229 places.
[2024-05-21 03:25:19] [INFO ] Transformed 600 transitions.
[2024-05-21 03:25:19] [INFO ] Found NUPN structural information;
[2024-05-21 03:25:19] [INFO ] Parsed PT model containing 229 places and 600 transitions and 2280 arcs in 485 ms.
Built sparse matrix representations for Structural reductions in 11 ms.18417KB memory used
Starting structural reductions in DEADLOCK mode, iteration 0 : 229/229 places, 600/600 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 275 ms. Remains 229 /229 variables (removed 0) and now considering 600/600 (removed 0) transitions.
Finished structural reductions in DEADLOCK mode , in 1 iterations and 338 ms. Remains : 229/229 places, 600/600 transitions.
Starting structural reductions in DEADLOCK mode, iteration 0 : 229/229 places, 600/600 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 95 ms. Remains 229 /229 variables (removed 0) and now considering 600/600 (removed 0) transitions.
// Phase 1: matrix 600 rows 229 cols
[2024-05-21 03:25:20] [INFO ] Computed 15 invariants in 67 ms
[2024-05-21 03:25:20] [INFO ] Implicit Places using invariants in 775 ms returned []
[2024-05-21 03:25:20] [INFO ] Invariant cache hit.
[2024-05-21 03:25:21] [INFO ] State equation strengthened by 30 read => feed constraints.
[2024-05-21 03:25:21] [INFO ] Implicit Places using invariants and state equation in 807 ms returned []
Implicit Place search using SMT with State Equation took 1667 ms to find 0 implicit places.
[2024-05-21 03:25:21] [INFO ] Redundant transitions in 41 ms returned []
Running 594 sub problems to find dead transitions.
[2024-05-21 03:25:21] [INFO ] Invariant cache hit.
[2024-05-21 03:25:21] [INFO ] State equation strengthened by 30 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/229 variables, 229/229 constraints. Problems are: Problem set: 0 solved, 594 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/229 variables, 7/236 constraints. Problems are: Problem set: 0 solved, 594 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/229 variables, 8/244 constraints. Problems are: Problem set: 0 solved, 594 unsolved
[2024-05-21 03:25:27] [INFO ] Deduced a trap composed of 47 places in 301 ms of which 32 ms to minimize.
[2024-05-21 03:25:28] [INFO ] Deduced a trap composed of 90 places in 271 ms of which 4 ms to minimize.
[2024-05-21 03:25:28] [INFO ] Deduced a trap composed of 98 places in 222 ms of which 3 ms to minimize.
[2024-05-21 03:25:28] [INFO ] Deduced a trap composed of 156 places in 234 ms of which 4 ms to minimize.
[2024-05-21 03:25:28] [INFO ] Deduced a trap composed of 122 places in 242 ms of which 4 ms to minimize.
[2024-05-21 03:25:29] [INFO ] Deduced a trap composed of 148 places in 261 ms of which 5 ms to minimize.
[2024-05-21 03:25:29] [INFO ] Deduced a trap composed of 105 places in 234 ms of which 7 ms to minimize.
[2024-05-21 03:25:29] [INFO ] Deduced a trap composed of 120 places in 193 ms of which 3 ms to minimize.
[2024-05-21 03:25:29] [INFO ] Deduced a trap composed of 61 places in 199 ms of which 2 ms to minimize.
[2024-05-21 03:25:30] [INFO ] Deduced a trap composed of 91 places in 176 ms of which 3 ms to minimize.
[2024-05-21 03:25:30] [INFO ] Deduced a trap composed of 128 places in 192 ms of which 2 ms to minimize.
[2024-05-21 03:25:30] [INFO ] Deduced a trap composed of 141 places in 190 ms of which 2 ms to minimize.
[2024-05-21 03:25:30] [INFO ] Deduced a trap composed of 138 places in 192 ms of which 2 ms to minimize.
[2024-05-21 03:25:30] [INFO ] Deduced a trap composed of 152 places in 188 ms of which 3 ms to minimize.
[2024-05-21 03:25:31] [INFO ] Deduced a trap composed of 144 places in 183 ms of which 3 ms to minimize.
[2024-05-21 03:25:31] [INFO ] Deduced a trap composed of 144 places in 199 ms of which 3 ms to minimize.
[2024-05-21 03:25:31] [INFO ] Deduced a trap composed of 131 places in 190 ms of which 3 ms to minimize.
[2024-05-21 03:25:32] [INFO ] Deduced a trap composed of 150 places in 197 ms of which 3 ms to minimize.
[2024-05-21 03:25:32] [INFO ] Deduced a trap composed of 71 places in 167 ms of which 3 ms to minimize.
[2024-05-21 03:25:32] [INFO ] Deduced a trap composed of 143 places in 272 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/229 variables, 20/264 constraints. Problems are: Problem set: 0 solved, 594 unsolved
[2024-05-21 03:25:38] [INFO ] Deduced a trap composed of 78 places in 201 ms of which 2 ms to minimize.
[2024-05-21 03:25:38] [INFO ] Deduced a trap composed of 99 places in 233 ms of which 3 ms to minimize.
[2024-05-21 03:25:38] [INFO ] Deduced a trap composed of 97 places in 185 ms of which 3 ms to minimize.
[2024-05-21 03:25:39] [INFO ] Deduced a trap composed of 81 places in 271 ms of which 4 ms to minimize.
[2024-05-21 03:25:39] [INFO ] Deduced a trap composed of 71 places in 308 ms of which 4 ms to minimize.
[2024-05-21 03:25:39] [INFO ] Deduced a trap composed of 74 places in 173 ms of which 3 ms to minimize.
[2024-05-21 03:25:40] [INFO ] Deduced a trap composed of 93 places in 173 ms of which 3 ms to minimize.
[2024-05-21 03:25:40] [INFO ] Deduced a trap composed of 93 places in 181 ms of which 3 ms to minimize.
[2024-05-21 03:25:40] [INFO ] Deduced a trap composed of 48 places in 180 ms of which 2 ms to minimize.
[2024-05-21 03:25:40] [INFO ] Deduced a trap composed of 86 places in 175 ms of which 2 ms to minimize.
[2024-05-21 03:25:41] [INFO ] Deduced a trap composed of 91 places in 249 ms of which 4 ms to minimize.
[2024-05-21 03:25:41] [INFO ] Deduced a trap composed of 138 places in 258 ms of which 4 ms to minimize.
[2024-05-21 03:25:41] [INFO ] Deduced a trap composed of 91 places in 161 ms of which 3 ms to minimize.
[2024-05-21 03:25:41] [INFO ] Deduced a trap composed of 63 places in 161 ms of which 2 ms to minimize.
[2024-05-21 03:25:42] [INFO ] Deduced a trap composed of 74 places in 158 ms of which 3 ms to minimize.
[2024-05-21 03:25:42] [INFO ] Deduced a trap composed of 127 places in 172 ms of which 3 ms to minimize.
[2024-05-21 03:25:42] [INFO ] Deduced a trap composed of 131 places in 196 ms of which 3 ms to minimize.
[2024-05-21 03:25:42] [INFO ] Deduced a trap composed of 148 places in 191 ms of which 3 ms to minimize.
[2024-05-21 03:25:43] [INFO ] Deduced a trap composed of 146 places in 159 ms of which 3 ms to minimize.
[2024-05-21 03:25:43] [INFO ] Deduced a trap composed of 75 places in 183 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/229 variables, 20/284 constraints. Problems are: Problem set: 0 solved, 594 unsolved
[2024-05-21 03:25:44] [INFO ] Deduced a trap composed of 76 places in 183 ms of which 4 ms to minimize.
[2024-05-21 03:25:45] [INFO ] Deduced a trap composed of 145 places in 188 ms of which 2 ms to minimize.
[2024-05-21 03:25:45] [INFO ] Deduced a trap composed of 75 places in 179 ms of which 3 ms to minimize.
[2024-05-21 03:25:45] [INFO ] Deduced a trap composed of 69 places in 180 ms of which 2 ms to minimize.
[2024-05-21 03:25:45] [INFO ] Deduced a trap composed of 75 places in 265 ms of which 4 ms to minimize.
[2024-05-21 03:25:46] [INFO ] Deduced a trap composed of 119 places in 174 ms of which 2 ms to minimize.
[2024-05-21 03:25:46] [INFO ] Deduced a trap composed of 129 places in 272 ms of which 4 ms to minimize.
[2024-05-21 03:25:46] [INFO ] Deduced a trap composed of 108 places in 240 ms of which 5 ms to minimize.
[2024-05-21 03:25:46] [INFO ] Deduced a trap composed of 131 places in 173 ms of which 3 ms to minimize.
[2024-05-21 03:25:47] [INFO ] Deduced a trap composed of 130 places in 239 ms of which 3 ms to minimize.
[2024-05-21 03:25:47] [INFO ] Deduced a trap composed of 114 places in 157 ms of which 3 ms to minimize.
[2024-05-21 03:25:47] [INFO ] Deduced a trap composed of 45 places in 184 ms of which 2 ms to minimize.
[2024-05-21 03:25:47] [INFO ] Deduced a trap composed of 111 places in 266 ms of which 3 ms to minimize.
[2024-05-21 03:25:48] [INFO ] Deduced a trap composed of 112 places in 174 ms of which 2 ms to minimize.
[2024-05-21 03:25:48] [INFO ] Deduced a trap composed of 107 places in 181 ms of which 3 ms to minimize.
[2024-05-21 03:25:48] [INFO ] Deduced a trap composed of 149 places in 186 ms of which 2 ms to minimize.
[2024-05-21 03:25:48] [INFO ] Deduced a trap composed of 154 places in 181 ms of which 4 ms to minimize.
[2024-05-21 03:25:49] [INFO ] Deduced a trap composed of 144 places in 268 ms of which 4 ms to minimize.
[2024-05-21 03:25:49] [INFO ] Deduced a trap composed of 67 places in 245 ms of which 4 ms to minimize.
[2024-05-21 03:25:49] [INFO ] Deduced a trap composed of 56 places in 245 ms of which 4 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/229 variables, 20/304 constraints. Problems are: Problem set: 0 solved, 594 unsolved
[2024-05-21 03:25:51] [INFO ] Deduced a trap composed of 83 places in 154 ms of which 3 ms to minimize.
[2024-05-21 03:25:51] [INFO ] Deduced a trap composed of 86 places in 162 ms of which 3 ms to minimize.
[2024-05-21 03:25:52] [INFO ] Deduced a trap composed of 62 places in 176 ms of which 3 ms to minimize.
[2024-05-21 03:25:52] [INFO ] Deduced a trap composed of 121 places in 171 ms of which 3 ms to minimize.
[2024-05-21 03:25:52] [INFO ] Deduced a trap composed of 108 places in 260 ms of which 4 ms to minimize.
[2024-05-21 03:25:53] [INFO ] Deduced a trap composed of 127 places in 266 ms of which 4 ms to minimize.
[2024-05-21 03:25:53] [INFO ] Deduced a trap composed of 98 places in 258 ms of which 4 ms to minimize.
SMT process timed out in 31546ms, After SMT, problems are : Problem set: 0 solved, 594 unsolved
Search for dead transitions found 0 dead transitions in 31584ms
Finished structural reductions in DEADLOCK mode , in 1 iterations and 33412 ms. Remains : 229/229 places, 600/600 transitions.
Random walk for 1250000 steps, including 0 resets, run took 2519 ms (no deadlock found). (steps per millisecond=496 )
Random directed walk for 1250000 steps, including 0 resets, run took 1761 ms (no deadlock found). (steps per millisecond=709 )
[2024-05-21 03:25:57] [INFO ] Invariant cache hit.
[2024-05-21 03:25:57] [INFO ] [Real]Absence check using 7 positive place invariants in 9 ms returned sat
[2024-05-21 03:25:58] [INFO ] [Real]Absence check using 7 positive and 8 generalized place invariants in 287 ms returned unsat
Starting structural reductions in LIVENESS mode, iteration 0 : 229/229 places, 600/600 transitions.
Performed 30 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 30 Pre rules applied. Total rules applied 0 place count 229 transition count 570
Deduced a syphon composed of 30 places in 1 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 0 with 60 rules applied. Total rules applied 60 place count 199 transition count 570
Applied a total of 60 rules in 31 ms. Remains 199 /229 variables (removed 30) and now considering 570/600 (removed 30) transitions.
// Phase 1: matrix 570 rows 199 cols
[2024-05-21 03:25:58] [INFO ] Computed 15 invariants in 11 ms
[2024-05-21 03:25:58] [INFO ] Implicit Places using invariants in 597 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 609 ms to find 1 implicit places.
Starting structural reductions in LIVENESS mode, iteration 1 : 198/229 places, 570/600 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 36 transitions
Trivial Post-agglo rules discarded 36 transitions
Performed 36 trivial Post agglomeration. Transition count delta: 36
Iterating post reduction 0 with 36 rules applied. Total rules applied 36 place count 198 transition count 534
Reduce places removed 36 places and 0 transitions.
Iterating post reduction 1 with 36 rules applied. Total rules applied 72 place count 162 transition count 534
Applied a total of 72 rules in 8 ms. Remains 162 /198 variables (removed 36) and now considering 534/570 (removed 36) transitions.
// Phase 1: matrix 534 rows 162 cols
[2024-05-21 03:25:58] [INFO ] Computed 14 invariants in 6 ms
[2024-05-21 03:25:59] [INFO ] Implicit Places using invariants in 416 ms returned []
[2024-05-21 03:25:59] [INFO ] Invariant cache hit.
[2024-05-21 03:25:59] [INFO ] State equation strengthened by 54 read => feed constraints.
[2024-05-21 03:26:00] [INFO ] Implicit Places using invariants and state equation in 1028 ms returned []
Implicit Place search using SMT with State Equation took 1446 ms to find 0 implicit places.
Starting structural reductions in LIVENESS mode, iteration 2 : 162/229 places, 534/600 transitions.
Finished structural reductions in LIVENESS mode , in 2 iterations and 2095 ms. Remains : 162/229 places, 534/600 transitions.
Initial state reduction rules removed 6 formulas.
RANDOM walk for 40000 steps (8 resets) in 3361 ms. (11 steps per ms) remains 92/528 properties
BEST_FIRST walk for 4003 steps (8 resets) in 66 ms. (59 steps per ms) remains 73/92 properties
BEST_FIRST walk for 4003 steps (8 resets) in 31 ms. (125 steps per ms) remains 68/73 properties
BEST_FIRST walk for 4001 steps (8 resets) in 24 ms. (160 steps per ms) remains 68/68 properties
BEST_FIRST walk for 4003 steps (8 resets) in 40 ms. (97 steps per ms) remains 65/68 properties
BEST_FIRST walk for 4002 steps (8 resets) in 63 ms. (62 steps per ms) remains 58/65 properties
BEST_FIRST walk for 4002 steps (8 resets) in 70 ms. (56 steps per ms) remains 54/58 properties
BEST_FIRST walk for 4003 steps (8 resets) in 33 ms. (117 steps per ms) remains 50/54 properties
BEST_FIRST walk for 4002 steps (8 resets) in 15 ms. (250 steps per ms) remains 49/50 properties
BEST_FIRST walk for 4002 steps (8 resets) in 19 ms. (200 steps per ms) remains 46/49 properties
BEST_FIRST walk for 4003 steps (8 resets) in 18 ms. (210 steps per ms) remains 43/46 properties
BEST_FIRST walk for 4002 steps (8 resets) in 20 ms. (190 steps per ms) remains 42/43 properties
BEST_FIRST walk for 4003 steps (8 resets) in 19 ms. (200 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4002 steps (8 resets) in 18 ms. (210 steps per ms) remains 30/42 properties
BEST_FIRST walk for 4003 steps (8 resets) in 19 ms. (200 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4003 steps (8 resets) in 16 ms. (235 steps per ms) remains 28/30 properties
BEST_FIRST walk for 4002 steps (8 resets) in 33 ms. (117 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4001 steps (8 resets) in 20 ms. (190 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4003 steps (8 resets) in 17 ms. (222 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4002 steps (8 resets) in 32 ms. (121 steps per ms) remains 25/28 properties
BEST_FIRST walk for 4004 steps (8 resets) in 32 ms. (121 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4003 steps (8 resets) in 21 ms. (181 steps per ms) remains 24/25 properties
BEST_FIRST walk for 4004 steps (8 resets) in 25 ms. (154 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (8 resets) in 34 ms. (114 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (8 resets) in 28 ms. (138 steps per ms) remains 23/24 properties
BEST_FIRST walk for 4003 steps (8 resets) in 28 ms. (138 steps per ms) remains 21/23 properties
BEST_FIRST walk for 4001 steps (8 resets) in 30 ms. (129 steps per ms) remains 20/21 properties
BEST_FIRST walk for 4003 steps (8 resets) in 25 ms. (153 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 18/20 properties
BEST_FIRST walk for 4000 steps (8 resets) in 27 ms. (142 steps per ms) remains 16/18 properties
BEST_FIRST walk for 4003 steps (8 resets) in 19 ms. (200 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (8 resets) in 45 ms. (87 steps per ms) remains 14/16 properties
BEST_FIRST walk for 4003 steps (8 resets) in 32 ms. (121 steps per ms) remains 14/14 properties
[2024-05-21 03:26:01] [INFO ] Invariant cache hit.
[2024-05-21 03:26:01] [INFO ] State equation strengthened by 54 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 2 (OVERLAPS) 109/122 variables, 5/18 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/122 variables, 109/127 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/122 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 5 (OVERLAPS) 33/155 variables, 7/134 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/155 variables, 33/167 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/155 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 8 (OVERLAPS) 7/162 variables, 2/169 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/162 variables, 7/176 constraints. Problems are: Problem set: 0 solved, 14 unsolved
[2024-05-21 03:26:02] [INFO ] Deduced a trap composed of 29 places in 157 ms of which 3 ms to minimize.
[2024-05-21 03:26:02] [INFO ] Deduced a trap composed of 51 places in 149 ms of which 2 ms to minimize.
[2024-05-21 03:26:02] [INFO ] Deduced a trap composed of 42 places in 160 ms of which 2 ms to minimize.
[2024-05-21 03:26:03] [INFO ] Deduced a trap composed of 52 places in 151 ms of which 2 ms to minimize.
[2024-05-21 03:26:03] [INFO ] Deduced a trap composed of 84 places in 175 ms of which 3 ms to minimize.
[2024-05-21 03:26:03] [INFO ] Deduced a trap composed of 91 places in 179 ms of which 2 ms to minimize.
[2024-05-21 03:26:03] [INFO ] Deduced a trap composed of 53 places in 220 ms of which 2 ms to minimize.
[2024-05-21 03:26:03] [INFO ] Deduced a trap composed of 58 places in 193 ms of which 3 ms to minimize.
[2024-05-21 03:26:04] [INFO ] Deduced a trap composed of 96 places in 194 ms of which 2 ms to minimize.
[2024-05-21 03:26:04] [INFO ] Deduced a trap composed of 67 places in 189 ms of which 3 ms to minimize.
[2024-05-21 03:26:04] [INFO ] Deduced a trap composed of 53 places in 204 ms of which 3 ms to minimize.
[2024-05-21 03:26:04] [INFO ] Deduced a trap composed of 82 places in 186 ms of which 2 ms to minimize.
[2024-05-21 03:26:04] [INFO ] Deduced a trap composed of 89 places in 201 ms of which 3 ms to minimize.
[2024-05-21 03:26:05] [INFO ] Deduced a trap composed of 76 places in 184 ms of which 2 ms to minimize.
[2024-05-21 03:26:05] [INFO ] Deduced a trap composed of 31 places in 192 ms of which 2 ms to minimize.
[2024-05-21 03:26:05] [INFO ] Deduced a trap composed of 57 places in 184 ms of which 2 ms to minimize.
[2024-05-21 03:26:05] [INFO ] Deduced a trap composed of 65 places in 187 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/162 variables, 17/193 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/162 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 12 (OVERLAPS) 534/696 variables, 162/355 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/696 variables, 54/409 constraints. Problems are: Problem set: 0 solved, 14 unsolved
[2024-05-21 03:26:06] [INFO ] Deduced a trap composed of 34 places in 171 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 696/696 variables, and 410 constraints, problems are : Problem set: 0 solved, 14 unsolved in 5010 ms.
Refiners :[Domain max(s): 162/162 constraints, Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 162/162 constraints, ReadFeed: 54/54 constraints, PredecessorRefiner: 14/14 constraints, Known Traps: 18/18 constraints]
Escalating to Integer solving :Problem set: 0 solved, 14 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 2 (OVERLAPS) 109/122 variables, 5/18 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/122 variables, 109/127 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/122 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 5 (OVERLAPS) 33/155 variables, 7/134 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/155 variables, 33/167 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/155 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 8 (OVERLAPS) 7/162 variables, 2/169 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/162 variables, 7/176 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/162 variables, 18/194 constraints. Problems are: Problem set: 0 solved, 14 unsolved
[2024-05-21 03:26:07] [INFO ] Deduced a trap composed of 88 places in 154 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/162 variables, 1/195 constraints. Problems are: Problem set: 0 solved, 14 unsolved
[2024-05-21 03:26:07] [INFO ] Deduced a trap composed of 83 places in 138 ms of which 2 ms to minimize.
[2024-05-21 03:26:07] [INFO ] Deduced a trap composed of 46 places in 152 ms of which 2 ms to minimize.
[2024-05-21 03:26:07] [INFO ] Deduced a trap composed of 67 places in 148 ms of which 2 ms to minimize.
[2024-05-21 03:26:08] [INFO ] Deduced a trap composed of 68 places in 149 ms of which 2 ms to minimize.
[2024-05-21 03:26:08] [INFO ] Deduced a trap composed of 44 places in 146 ms of which 1 ms to minimize.
[2024-05-21 03:26:08] [INFO ] Deduced a trap composed of 54 places in 133 ms of which 1 ms to minimize.
[2024-05-21 03:26:08] [INFO ] Deduced a trap composed of 58 places in 145 ms of which 2 ms to minimize.
[2024-05-21 03:26:08] [INFO ] Deduced a trap composed of 61 places in 213 ms of which 3 ms to minimize.
[2024-05-21 03:26:09] [INFO ] Deduced a trap composed of 64 places in 186 ms of which 3 ms to minimize.
[2024-05-21 03:26:09] [INFO ] Deduced a trap composed of 54 places in 209 ms of which 3 ms to minimize.
[2024-05-21 03:26:09] [INFO ] Deduced a trap composed of 37 places in 215 ms of which 3 ms to minimize.
[2024-05-21 03:26:09] [INFO ] Deduced a trap composed of 25 places in 214 ms of which 3 ms to minimize.
[2024-05-21 03:26:09] [INFO ] Deduced a trap composed of 75 places in 213 ms of which 3 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/162 variables, 13/208 constraints. Problems are: Problem set: 0 solved, 14 unsolved
[2024-05-21 03:26:10] [INFO ] Deduced a trap composed of 85 places in 133 ms of which 2 ms to minimize.
[2024-05-21 03:26:10] [INFO ] Deduced a trap composed of 65 places in 212 ms of which 3 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/162 variables, 2/210 constraints. Problems are: Problem set: 0 solved, 14 unsolved
[2024-05-21 03:26:10] [INFO ] Deduced a trap composed of 76 places in 150 ms of which 2 ms to minimize.
[2024-05-21 03:26:10] [INFO ] Deduced a trap composed of 43 places in 184 ms of which 3 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/162 variables, 2/212 constraints. Problems are: Problem set: 0 solved, 14 unsolved
[2024-05-21 03:26:11] [INFO ] Deduced a trap composed of 58 places in 135 ms of which 1 ms to minimize.
[2024-05-21 03:26:11] [INFO ] Deduced a trap composed of 76 places in 148 ms of which 2 ms to minimize.
[2024-05-21 03:26:11] [INFO ] Deduced a trap composed of 37 places in 151 ms of which 2 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/162 variables, 3/215 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/162 variables, 0/215 constraints. Problems are: Problem set: 0 solved, 14 unsolved
SMT process timed out in 10077ms, After SMT, problems are : Problem set: 0 solved, 14 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 13 out of 162 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 162/162 places, 534/534 transitions.
Discarding 49 places :
Symmetric choice reduction at 0 with 49 rule applications. Total rules 49 place count 113 transition count 295
Iterating global reduction 0 with 49 rules applied. Total rules applied 98 place count 113 transition count 295
Applied a total of 98 rules in 36 ms. Remains 113 /162 variables (removed 49) and now considering 295/534 (removed 239) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 36 ms. Remains : 113/162 places, 295/534 transitions.
RANDOM walk for 4000000 steps (8 resets) in 13100 ms. (305 steps per ms) remains 4/14 properties
BEST_FIRST walk for 4000004 steps (8 resets) in 2751 ms. (1453 steps per ms) remains 3/4 properties
BEST_FIRST walk for 4000003 steps (8 resets) in 2585 ms. (1546 steps per ms) remains 2/3 properties
BEST_FIRST walk for 3714726 steps (8 resets) in 2584 ms. (1437 steps per ms) remains 0/2 properties
Able to resolve query QuasiLiveness after proving 534 properties.
Starting structural reductions in LIVENESS mode, iteration 0 : 229/229 places, 600/600 transitions.
Performed 30 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 30 Pre rules applied. Total rules applied 0 place count 229 transition count 570
Deduced a syphon composed of 30 places in 1 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 0 with 60 rules applied. Total rules applied 60 place count 199 transition count 570
Applied a total of 60 rules in 19 ms. Remains 199 /229 variables (removed 30) and now considering 570/600 (removed 30) transitions.
// Phase 1: matrix 570 rows 199 cols
[2024-05-21 03:26:17] [INFO ] Computed 15 invariants in 4 ms
[2024-05-21 03:26:18] [INFO ] Implicit Places using invariants in 486 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 489 ms to find 1 implicit places.
Starting structural reductions in LIVENESS mode, iteration 1 : 198/229 places, 570/600 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 36 transitions
Trivial Post-agglo rules discarded 36 transitions
Performed 36 trivial Post agglomeration. Transition count delta: 36
Iterating post reduction 0 with 36 rules applied. Total rules applied 36 place count 198 transition count 534
Reduce places removed 36 places and 0 transitions.
Iterating post reduction 1 with 36 rules applied. Total rules applied 72 place count 162 transition count 534
Applied a total of 72 rules in 10 ms. Remains 162 /198 variables (removed 36) and now considering 534/570 (removed 36) transitions.
// Phase 1: matrix 534 rows 162 cols
[2024-05-21 03:26:18] [INFO ] Computed 14 invariants in 3 ms
[2024-05-21 03:26:18] [INFO ] Implicit Places using invariants in 457 ms returned []
[2024-05-21 03:26:18] [INFO ] Invariant cache hit.
[2024-05-21 03:26:18] [INFO ] State equation strengthened by 54 read => feed constraints.
[2024-05-21 03:26:19] [INFO ] Implicit Places using invariants and state equation in 1090 ms returned []
Implicit Place search using SMT with State Equation took 1549 ms to find 0 implicit places.
Starting structural reductions in LIVENESS mode, iteration 2 : 162/229 places, 534/600 transitions.
Finished structural reductions in LIVENESS mode , in 2 iterations and 2067 ms. Remains : 162/229 places, 534/600 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 :534 assertions to prove.
No /home/mcc/execution/Liveness.xml examination file found. Proceeding without properties.
Parsed 534 properties from file /home/mcc/execution/Liveness.xml in 2 ms.
Working with output stream class java.io.PrintStream
Total runtime 61059 ms.
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running Anderson-PT-06

IS_COLORED=
IS_NUPN=1

LOADING model.pnml ...
MODEL CLASS: P/T NET WITH NUPN EXTENSION
PLACES: 229
TRANSITIONS: 600
CONSTANTS: 0
TEMPLATE VARS: 0
ARCS: 2280
NUPN UNITS: 9
LOADING TIME: 0.572

SAVING AS /home/mcc/execution/model.(net/def) ...
exportGspn useExt=true
SAVING TIME: 0.061
SAVING NAME MAP FILE /home/mcc/execution/model.id2name ...
SAVING NUPN UNITS AS FILE /home/mcc/execution/model.nu ...
TOTAL TIME: 1.064
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: 907
MODEL NAME: /home/mcc/execution/model
229 places, 600 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...

BK_TIME_CONFINEMENT_REACHED

--------------------
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-06"
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-06, 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-171620124100209"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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