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.r224-tall-174902009500062.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 ShieldRVs-PT-020A, examination is QuasiLiveness
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r224-tall-174902009500062
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 532K
-rw-r--r-- 1 mcc users 6.4K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 68K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 48K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 29 14:33 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.7K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.3K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 81K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.1K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 78K 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.7K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:33 equiv_col
-rw-r--r-- 1 mcc users 5 May 29 14:33 instance
-rw-r--r-- 1 mcc users 6 May 29 14:33 iscolored
-rw-r--r-- 1 mcc users 127K May 29 14:33 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

FORMULA_NAME QuasiLiveness

=== Now, execution of the tool begins

BK_START 1749106372135

Invoking MCC driver with
BK_TOOL=gold2024
BK_EXAMINATION=QuasiLiveness
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=ShieldRVs-PT-020A
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2025-06-05 06:52:53] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, QuasiLiveness, -timeout, 180, -rebuildPNML]
[2025-06-05 06:52:53] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-05 06:52:53] [INFO ] Load time of PNML (sax parser for PT used): 90 ms
[2025-06-05 06:52:53] [INFO ] Transformed 283 places.
[2025-06-05 06:52:53] [INFO ] Transformed 383 transitions.
[2025-06-05 06:52:53] [INFO ] Found NUPN structural information;
[2025-06-05 06:52:53] [INFO ] Parsed PT model containing 283 places and 383 transitions and 1840 arcs in 197 ms.
Starting structural reductions in LIVENESS mode, iteration 0 : 283/283 places, 383/383 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 282 transition count 382
Applied a total of 2 rules in 45 ms. Remains 282 /283 variables (removed 1) and now considering 382/383 (removed 1) transitions.
// Phase 1: matrix 382 rows 282 cols
[2025-06-05 06:52:53] [INFO ] Computed 81 invariants in 25 ms
[2025-06-05 06:52:54] [INFO ] Implicit Places using invariants in 387 ms returned []
[2025-06-05 06:52:54] [INFO ] Invariant cache hit.
[2025-06-05 06:52:54] [INFO ] Implicit Places using invariants and state equation in 445 ms returned []
Implicit Place search using SMT with State Equation took 860 ms to find 0 implicit places.
Running 381 sub problems to find dead transitions.
[2025-06-05 06:52:54] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/281 variables, 281/281 constraints. Problems are: Problem set: 0 solved, 381 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/281 variables, 0/281 constraints. Problems are: Problem set: 0 solved, 381 unsolved
At refinement iteration 2 (OVERLAPS) 1/282 variables, 81/362 constraints. Problems are: Problem set: 0 solved, 381 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/282 variables, 1/363 constraints. Problems are: Problem set: 0 solved, 381 unsolved
[2025-06-05 06:53:00] [INFO ] Deduced a trap composed of 8 places in 109 ms of which 16 ms to minimize.
[2025-06-05 06:53:00] [INFO ] Deduced a trap composed of 8 places in 112 ms of which 1 ms to minimize.
[2025-06-05 06:53:00] [INFO ] Deduced a trap composed of 7 places in 107 ms of which 1 ms to minimize.
[2025-06-05 06:53:00] [INFO ] Deduced a trap composed of 7 places in 73 ms of which 1 ms to minimize.
[2025-06-05 06:53:00] [INFO ] Deduced a trap composed of 14 places in 97 ms of which 2 ms to minimize.
[2025-06-05 06:53:01] [INFO ] Deduced a trap composed of 7 places in 208 ms of which 7 ms to minimize.
[2025-06-05 06:53:01] [INFO ] Deduced a trap composed of 14 places in 94 ms of which 2 ms to minimize.
[2025-06-05 06:53:01] [INFO ] Deduced a trap composed of 7 places in 52 ms of which 2 ms to minimize.
[2025-06-05 06:53:01] [INFO ] Deduced a trap composed of 17 places in 91 ms of which 2 ms to minimize.
[2025-06-05 06:53:01] [INFO ] Deduced a trap composed of 12 places in 143 ms of which 2 ms to minimize.
[2025-06-05 06:53:01] [INFO ] Deduced a trap composed of 17 places in 83 ms of which 2 ms to minimize.
[2025-06-05 06:53:01] [INFO ] Deduced a trap composed of 13 places in 79 ms of which 1 ms to minimize.
[2025-06-05 06:53:01] [INFO ] Deduced a trap composed of 13 places in 115 ms of which 1 ms to minimize.
[2025-06-05 06:53:01] [INFO ] Deduced a trap composed of 7 places in 58 ms of which 1 ms to minimize.
[2025-06-05 06:53:02] [INFO ] Deduced a trap composed of 13 places in 78 ms of which 1 ms to minimize.
[2025-06-05 06:53:02] [INFO ] Deduced a trap composed of 7 places in 83 ms of which 1 ms to minimize.
[2025-06-05 06:53:02] [INFO ] Deduced a trap composed of 13 places in 62 ms of which 1 ms to minimize.
[2025-06-05 06:53:02] [INFO ] Deduced a trap composed of 7 places in 52 ms of which 1 ms to minimize.
[2025-06-05 06:53:02] [INFO ] Deduced a trap composed of 17 places in 63 ms of which 1 ms to minimize.
[2025-06-05 06:53:02] [INFO ] Deduced a trap composed of 7 places in 101 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/282 variables, 20/383 constraints. Problems are: Problem set: 0 solved, 381 unsolved
[2025-06-05 06:53:02] [INFO ] Deduced a trap composed of 13 places in 78 ms of which 1 ms to minimize.
[2025-06-05 06:53:02] [INFO ] Deduced a trap composed of 12 places in 66 ms of which 1 ms to minimize.
[2025-06-05 06:53:02] [INFO ] Deduced a trap composed of 13 places in 66 ms of which 1 ms to minimize.
[2025-06-05 06:53:03] [INFO ] Deduced a trap composed of 13 places in 69 ms of which 1 ms to minimize.
[2025-06-05 06:53:03] [INFO ] Deduced a trap composed of 21 places in 67 ms of which 2 ms to minimize.
[2025-06-05 06:53:03] [INFO ] Deduced a trap composed of 14 places in 73 ms of which 1 ms to minimize.
[2025-06-05 06:53:03] [INFO ] Deduced a trap composed of 7 places in 39 ms of which 1 ms to minimize.
[2025-06-05 06:53:03] [INFO ] Deduced a trap composed of 13 places in 78 ms of which 1 ms to minimize.
[2025-06-05 06:53:03] [INFO ] Deduced a trap composed of 7 places in 64 ms of which 1 ms to minimize.
[2025-06-05 06:53:03] [INFO ] Deduced a trap composed of 13 places in 88 ms of which 2 ms to minimize.
[2025-06-05 06:53:03] [INFO ] Deduced a trap composed of 7 places in 38 ms of which 0 ms to minimize.
[2025-06-05 06:53:03] [INFO ] Deduced a trap composed of 13 places in 72 ms of which 1 ms to minimize.
[2025-06-05 06:53:03] [INFO ] Deduced a trap composed of 27 places in 68 ms of which 1 ms to minimize.
[2025-06-05 06:53:03] [INFO ] Deduced a trap composed of 13 places in 68 ms of which 1 ms to minimize.
[2025-06-05 06:53:03] [INFO ] Deduced a trap composed of 7 places in 34 ms of which 1 ms to minimize.
[2025-06-05 06:53:03] [INFO ] Deduced a trap composed of 13 places in 77 ms of which 1 ms to minimize.
[2025-06-05 06:53:04] [INFO ] Deduced a trap composed of 7 places in 69 ms of which 2 ms to minimize.
[2025-06-05 06:53:04] [INFO ] Deduced a trap composed of 13 places in 69 ms of which 1 ms to minimize.
[2025-06-05 06:53:04] [INFO ] Deduced a trap composed of 7 places in 35 ms of which 1 ms to minimize.
[2025-06-05 06:53:04] [INFO ] Deduced a trap composed of 13 places in 76 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/282 variables, 20/403 constraints. Problems are: Problem set: 0 solved, 381 unsolved
[2025-06-05 06:53:04] [INFO ] Deduced a trap composed of 7 places in 73 ms of which 1 ms to minimize.
[2025-06-05 06:53:04] [INFO ] Deduced a trap composed of 13 places in 71 ms of which 2 ms to minimize.
[2025-06-05 06:53:04] [INFO ] Deduced a trap composed of 7 places in 28 ms of which 0 ms to minimize.
[2025-06-05 06:53:04] [INFO ] Deduced a trap composed of 13 places in 70 ms of which 1 ms to minimize.
[2025-06-05 06:53:04] [INFO ] Deduced a trap composed of 7 places in 65 ms of which 1 ms to minimize.
[2025-06-05 06:53:05] [INFO ] Deduced a trap composed of 13 places in 70 ms of which 2 ms to minimize.
[2025-06-05 06:53:05] [INFO ] Deduced a trap composed of 7 places in 33 ms of which 1 ms to minimize.
[2025-06-05 06:53:05] [INFO ] Deduced a trap composed of 17 places in 75 ms of which 1 ms to minimize.
[2025-06-05 06:53:05] [INFO ] Deduced a trap composed of 7 places in 74 ms of which 1 ms to minimize.
[2025-06-05 06:53:05] [INFO ] Deduced a trap composed of 17 places in 74 ms of which 1 ms to minimize.
[2025-06-05 06:53:05] [INFO ] Deduced a trap composed of 7 places in 31 ms of which 1 ms to minimize.
[2025-06-05 06:53:05] [INFO ] Deduced a trap composed of 13 places in 75 ms of which 1 ms to minimize.
[2025-06-05 06:53:05] [INFO ] Deduced a trap composed of 7 places in 77 ms of which 1 ms to minimize.
[2025-06-05 06:53:05] [INFO ] Deduced a trap composed of 13 places in 72 ms of which 1 ms to minimize.
[2025-06-05 06:53:05] [INFO ] Deduced a trap composed of 7 places in 30 ms of which 1 ms to minimize.
[2025-06-05 06:53:05] [INFO ] Deduced a trap composed of 13 places in 78 ms of which 2 ms to minimize.
[2025-06-05 06:53:05] [INFO ] Deduced a trap composed of 7 places in 73 ms of which 2 ms to minimize.
[2025-06-05 06:53:06] [INFO ] Deduced a trap composed of 13 places in 70 ms of which 2 ms to minimize.
[2025-06-05 06:53:06] [INFO ] Deduced a trap composed of 7 places in 27 ms of which 0 ms to minimize.
[2025-06-05 06:53:06] [INFO ] Deduced a trap composed of 14 places in 81 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/282 variables, 20/423 constraints. Problems are: Problem set: 0 solved, 381 unsolved
[2025-06-05 06:53:08] [INFO ] Deduced a trap composed of 14 places in 70 ms of which 1 ms to minimize.
[2025-06-05 06:53:08] [INFO ] Deduced a trap composed of 7 places in 72 ms of which 2 ms to minimize.
[2025-06-05 06:53:08] [INFO ] Deduced a trap composed of 14 places in 68 ms of which 2 ms to minimize.
[2025-06-05 06:53:08] [INFO ] Deduced a trap composed of 7 places in 28 ms of which 1 ms to minimize.
[2025-06-05 06:53:08] [INFO ] Deduced a trap composed of 13 places in 75 ms of which 2 ms to minimize.
[2025-06-05 06:53:08] [INFO ] Deduced a trap composed of 7 places in 71 ms of which 1 ms to minimize.
[2025-06-05 06:53:08] [INFO ] Deduced a trap composed of 13 places in 80 ms of which 1 ms to minimize.
[2025-06-05 06:53:08] [INFO ] Deduced a trap composed of 7 places in 24 ms of which 0 ms to minimize.
[2025-06-05 06:53:08] [INFO ] Deduced a trap composed of 17 places in 78 ms of which 2 ms to minimize.
[2025-06-05 06:53:09] [INFO ] Deduced a trap composed of 7 places in 79 ms of which 1 ms to minimize.
[2025-06-05 06:53:09] [INFO ] Deduced a trap composed of 17 places in 74 ms of which 1 ms to minimize.
[2025-06-05 06:53:09] [INFO ] Deduced a trap composed of 7 places in 22 ms of which 1 ms to minimize.
[2025-06-05 06:53:09] [INFO ] Deduced a trap composed of 21 places in 72 ms of which 2 ms to minimize.
[2025-06-05 06:53:09] [INFO ] Deduced a trap composed of 7 places in 80 ms of which 1 ms to minimize.
[2025-06-05 06:53:09] [INFO ] Deduced a trap composed of 21 places in 74 ms of which 2 ms to minimize.
[2025-06-05 06:53:09] [INFO ] Deduced a trap composed of 7 places in 23 ms of which 1 ms to minimize.
[2025-06-05 06:53:09] [INFO ] Deduced a trap composed of 13 places in 82 ms of which 2 ms to minimize.
[2025-06-05 06:53:09] [INFO ] Deduced a trap composed of 7 places in 79 ms of which 2 ms to minimize.
[2025-06-05 06:53:09] [INFO ] Deduced a trap composed of 13 places in 81 ms of which 2 ms to minimize.
[2025-06-05 06:53:09] [INFO ] Deduced a trap composed of 7 places in 21 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/282 variables, 20/443 constraints. Problems are: Problem set: 0 solved, 381 unsolved
[2025-06-05 06:53:10] [INFO ] Deduced a trap composed of 13 places in 73 ms of which 1 ms to minimize.
[2025-06-05 06:53:10] [INFO ] Deduced a trap composed of 14 places in 65 ms of which 1 ms to minimize.
[2025-06-05 06:53:10] [INFO ] Deduced a trap composed of 14 places in 76 ms of which 2 ms to minimize.
[2025-06-05 06:53:10] [INFO ] Deduced a trap composed of 14 places in 75 ms of which 1 ms to minimize.
[2025-06-05 06:53:10] [INFO ] Deduced a trap composed of 14 places in 79 ms of which 2 ms to minimize.
[2025-06-05 06:53:11] [INFO ] Deduced a trap composed of 18 places in 86 ms of which 2 ms to minimize.
[2025-06-05 06:53:11] [INFO ] Deduced a trap composed of 7 places in 82 ms of which 2 ms to minimize.
[2025-06-05 06:53:11] [INFO ] Deduced a trap composed of 18 places in 76 ms of which 2 ms to minimize.
[2025-06-05 06:53:11] [INFO ] Deduced a trap composed of 7 places in 20 ms of which 0 ms to minimize.
[2025-06-05 06:53:11] [INFO ] Deduced a trap composed of 13 places in 79 ms of which 1 ms to minimize.
[2025-06-05 06:53:11] [INFO ] Deduced a trap composed of 13 places in 83 ms of which 1 ms to minimize.
[2025-06-05 06:53:11] [INFO ] Deduced a trap composed of 14 places in 75 ms of which 2 ms to minimize.
[2025-06-05 06:53:11] [INFO ] Deduced a trap composed of 12 places in 85 ms of which 1 ms to minimize.
[2025-06-05 06:53:11] [INFO ] Deduced a trap composed of 12 places in 25 ms of which 1 ms to minimize.
[2025-06-05 06:53:11] [INFO ] Deduced a trap composed of 12 places in 16 ms of which 0 ms to minimize.
[2025-06-05 06:53:12] [INFO ] Deduced a trap composed of 12 places in 27 ms of which 0 ms to minimize.
[2025-06-05 06:53:12] [INFO ] Deduced a trap composed of 8 places in 29 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/282 variables, 17/460 constraints. Problems are: Problem set: 0 solved, 381 unsolved
[2025-06-05 06:53:13] [INFO ] Deduced a trap composed of 7 places in 76 ms of which 1 ms to minimize.
[2025-06-05 06:53:13] [INFO ] Deduced a trap composed of 13 places in 71 ms of which 1 ms to minimize.
[2025-06-05 06:53:13] [INFO ] Deduced a trap composed of 14 places in 65 ms of which 1 ms to minimize.
[2025-06-05 06:53:14] [INFO ] Deduced a trap composed of 13 places in 88 ms of which 2 ms to minimize.
[2025-06-05 06:53:14] [INFO ] Deduced a trap composed of 13 places in 75 ms of which 2 ms to minimize.
[2025-06-05 06:53:14] [INFO ] Deduced a trap composed of 12 places in 82 ms of which 1 ms to minimize.
[2025-06-05 06:53:14] [INFO ] Deduced a trap composed of 13 places in 83 ms of which 2 ms to minimize.
[2025-06-05 06:53:14] [INFO ] Deduced a trap composed of 7 places in 76 ms of which 2 ms to minimize.
[2025-06-05 06:53:14] [INFO ] Deduced a trap composed of 12 places in 78 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/282 variables, 9/469 constraints. Problems are: Problem set: 0 solved, 381 unsolved
[2025-06-05 06:53:18] [INFO ] Deduced a trap composed of 14 places in 82 ms of which 2 ms to minimize.
[2025-06-05 06:53:18] [INFO ] Deduced a trap composed of 14 places in 75 ms of which 2 ms to minimize.
[2025-06-05 06:53:18] [INFO ] Deduced a trap composed of 14 places in 82 ms of which 1 ms to minimize.
[2025-06-05 06:53:19] [INFO ] Deduced a trap composed of 13 places in 39 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/282 variables, 4/473 constraints. Problems are: Problem set: 0 solved, 381 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/282 variables, 0/473 constraints. Problems are: Problem set: 0 solved, 381 unsolved
At refinement iteration 12 (OVERLAPS) 382/664 variables, 282/755 constraints. Problems are: Problem set: 0 solved, 381 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 664/664 variables, and 755 constraints, problems are : Problem set: 0 solved, 381 unsolved in 30017 ms.
Refiners :[Domain max(s): 282/282 constraints, Positive P Invariants (semi-flows): 81/81 constraints, State Equation: 282/282 constraints, PredecessorRefiner: 381/381 constraints, Known Traps: 110/110 constraints]
Escalating to Integer solving :Problem set: 0 solved, 381 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/281 variables, 281/281 constraints. Problems are: Problem set: 0 solved, 381 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/281 variables, 0/281 constraints. Problems are: Problem set: 0 solved, 381 unsolved
At refinement iteration 2 (OVERLAPS) 1/282 variables, 81/362 constraints. Problems are: Problem set: 0 solved, 381 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/282 variables, 1/363 constraints. Problems are: Problem set: 0 solved, 381 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/282 variables, 110/473 constraints. Problems are: Problem set: 0 solved, 381 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/282 variables, 0/473 constraints. Problems are: Problem set: 0 solved, 381 unsolved
At refinement iteration 6 (OVERLAPS) 382/664 variables, 282/755 constraints. Problems are: Problem set: 0 solved, 381 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/664 variables, 381/1136 constraints. Problems are: Problem set: 0 solved, 381 unsolved
[2025-06-05 06:53:33] [INFO ] Deduced a trap composed of 7 places in 44 ms of which 1 ms to minimize.
[2025-06-05 06:53:36] [INFO ] Deduced a trap composed of 7 places in 73 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/664 variables, 2/1138 constraints. Problems are: Problem set: 0 solved, 381 unsolved
[2025-06-05 06:53:46] [INFO ] Deduced a trap composed of 11 places in 35 ms of which 1 ms to minimize.
[2025-06-05 06:53:49] [INFO ] Deduced a trap composed of 6 places in 39 ms of which 1 ms to minimize.
[2025-06-05 06:53:50] [INFO ] Deduced a trap composed of 11 places in 31 ms of which 1 ms to minimize.
[2025-06-05 06:53:51] [INFO ] Deduced a trap composed of 12 places in 37 ms of which 1 ms to minimize.
[2025-06-05 06:53:51] [INFO ] Deduced a trap composed of 7 places in 23 ms of which 0 ms to minimize.
[2025-06-05 06:53:52] [INFO ] Deduced a trap composed of 8 places in 28 ms of which 0 ms to minimize.
[2025-06-05 06:53:52] [INFO ] Deduced a trap composed of 8 places in 16 ms of which 0 ms to minimize.
[2025-06-05 06:53:52] [INFO ] Deduced a trap composed of 8 places in 25 ms of which 0 ms to minimize.
[2025-06-05 06:53:52] [INFO ] Deduced a trap composed of 8 places in 27 ms of which 1 ms to minimize.
[2025-06-05 06:53:54] [INFO ] Deduced a trap composed of 8 places in 35 ms of which 1 ms to minimize.
[2025-06-05 06:53:54] [INFO ] Deduced a trap composed of 15 places in 32 ms of which 1 ms to minimize.
[2025-06-05 06:53:54] [INFO ] Deduced a trap composed of 8 places in 28 ms of which 0 ms to minimize.
[2025-06-05 06:53:54] [INFO ] Deduced a trap composed of 11 places in 27 ms of which 1 ms to minimize.
[2025-06-05 06:53:54] [INFO ] Deduced a trap composed of 11 places in 32 ms of which 1 ms to minimize.
[2025-06-05 06:53:54] [INFO ] Deduced a trap composed of 11 places in 56 ms of which 1 ms to minimize.
[2025-06-05 06:53:54] [INFO ] Deduced a trap composed of 12 places in 38 ms of which 1 ms to minimize.
[2025-06-05 06:53:54] [INFO ] Deduced a trap composed of 10 places in 32 ms of which 0 ms to minimize.
SMT process timed out in 60256ms, After SMT, problems are : Problem set: 0 solved, 381 unsolved
Search for dead transitions found 0 dead transitions in 60416ms
Starting structural reductions in LIVENESS mode, iteration 1 : 282/283 places, 382/383 transitions.
Finished structural reductions in LIVENESS mode , in 1 iterations and 61349 ms. Remains : 282/283 places, 382/383 transitions.
Discarding 120 transitions out of 382. Remains 262
Initial state reduction rules removed 1 formulas.
RANDOM walk for 40000 steps (144 resets) in 2234 ms. (17 steps per ms) remains 0/261 properties
Able to resolve query QuasiLiveness after proving 262 properties.
FORMULA QuasiLiveness TRUE TECHNIQUES RANDOM_WALK TOPOLOGICAL INITIAL_STATE
Total runtime 62405 ms.
ITS solved all properties within timeout

BK_STOP 1749106435853

--------------------
content from stderr:

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination QuasiLiveness -timeout 180 -rebuildPNML

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="ShieldRVs-PT-020A"
export BK_EXAMINATION="QuasiLiveness"
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 ShieldRVs-PT-020A, examination is QuasiLiveness"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r224-tall-174902009500062"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/ShieldRVs-PT-020A.tgz
mv ShieldRVs-PT-020A execution
cd execution
if [ "QuasiLiveness" = "ReachabilityDeadlock" ] || [ "QuasiLiveness" = "UpperBounds" ] || [ "QuasiLiveness" = "QuasiLiveness" ] || [ "QuasiLiveness" = "StableMarking" ] || [ "QuasiLiveness" = "Liveness" ] || [ "QuasiLiveness" = "OneSafe" ] || [ "QuasiLiveness" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "QuasiLiveness" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "QuasiLiveness" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "QuasiLiveness.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 '' QuasiLiveness.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "QuasiLiveness" = "ReachabilityDeadlock" ] || [ "QuasiLiveness" = "QuasiLiveness" ] || [ "QuasiLiveness" = "StableMarking" ] || [ "QuasiLiveness" = "Liveness" ] || [ "QuasiLiveness" = "OneSafe" ] ; then
echo "FORMULA_NAME QuasiLiveness"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;