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.r100-tall-171624200600272.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 DBSingleClientW-PT-d0m04, examination is QuasiLiveness
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r100-tall-171624200600272
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 512K
-rw-r--r-- 1 mcc users 7.3K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 79K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Apr 22 14:35 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 22 14:35 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Apr 22 14:35 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 22 14:35 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.2K Apr 12 12:45 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 69K Apr 12 12:45 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.0K Apr 12 12:44 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 80K Apr 12 12:44 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 22 14:35 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 22 14:35 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 6 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 119K 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 QuasiLiveness

=== Now, execution of the tool begins

BK_START 1716364853167

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=QuasiLiveness
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=DBSingleClientW-PT-d0m04
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-22 08:00:54] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, QuasiLiveness, -timeout, 180, -rebuildPNML]
[2024-05-22 08:00:54] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-22 08:00:54] [INFO ] Load time of PNML (sax parser for PT used): 73 ms
[2024-05-22 08:00:54] [INFO ] Transformed 553 places.
[2024-05-22 08:00:54] [INFO ] Transformed 150 transitions.
[2024-05-22 08:00:54] [INFO ] Parsed PT model containing 553 places and 150 transitions and 600 arcs in 160 ms.
Starting structural reductions in LIVENESS mode, iteration 0 : 553/553 places, 150/150 transitions.
Reduce places removed 451 places and 0 transitions.
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 0 with 462 rules applied. Total rules applied 462 place count 102 transition count 139
Applied a total of 462 rules in 28 ms. Remains 102 /553 variables (removed 451) and now considering 139/150 (removed 11) transitions.
// Phase 1: matrix 139 rows 102 cols
[2024-05-22 08:00:54] [INFO ] Computed 2 invariants in 16 ms
[2024-05-22 08:00:54] [INFO ] Implicit Places using invariants in 242 ms returned []
[2024-05-22 08:00:54] [INFO ] Invariant cache hit.
[2024-05-22 08:00:54] [INFO ] State equation strengthened by 63 read => feed constraints.
[2024-05-22 08:00:54] [INFO ] Implicit Places using invariants and state equation in 205 ms returned []
Implicit Place search using SMT with State Equation took 471 ms to find 0 implicit places.
Running 138 sub problems to find dead transitions.
[2024-05-22 08:00:54] [INFO ] Invariant cache hit.
[2024-05-22 08:00:54] [INFO ] State equation strengthened by 63 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/101 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 1 (OVERLAPS) 1/102 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/102 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/102 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 4 (OVERLAPS) 139/241 variables, 102/104 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/241 variables, 63/167 constraints. Problems are: Problem set: 0 solved, 138 unsolved
[2024-05-22 08:00:57] [INFO ] Deduced a trap composed of 16 places in 78 ms of which 12 ms to minimize.
[2024-05-22 08:00:57] [INFO ] Deduced a trap composed of 38 places in 55 ms of which 1 ms to minimize.
[2024-05-22 08:00:57] [INFO ] Deduced a trap composed of 37 places in 49 ms of which 1 ms to minimize.
[2024-05-22 08:00:57] [INFO ] Deduced a trap composed of 36 places in 44 ms of which 1 ms to minimize.
[2024-05-22 08:00:57] [INFO ] Deduced a trap composed of 35 places in 46 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/241 variables, 5/172 constraints. Problems are: Problem set: 0 solved, 138 unsolved
[2024-05-22 08:00:58] [INFO ] Deduced a trap composed of 36 places in 53 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/241 variables, 1/173 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/241 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 138 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 0/241 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 138 unsolved
No progress, stopping.
After SMT solving in domain Real declared 241/241 variables, and 173 constraints, problems are : Problem set: 0 solved, 138 unsolved in 6627 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 102/102 constraints, ReadFeed: 63/63 constraints, PredecessorRefiner: 138/138 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 0 solved, 138 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/101 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/101 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 2 (OVERLAPS) 1/102 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/102 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/102 variables, 5/8 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/102 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 6 (OVERLAPS) 139/241 variables, 102/110 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/241 variables, 63/173 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/241 variables, 138/311 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/241 variables, 0/311 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 10 (OVERLAPS) 0/241 variables, 0/311 constraints. Problems are: Problem set: 0 solved, 138 unsolved
No progress, stopping.
After SMT solving in domain Int declared 241/241 variables, and 311 constraints, problems are : Problem set: 0 solved, 138 unsolved in 6491 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 102/102 constraints, ReadFeed: 63/63 constraints, PredecessorRefiner: 138/138 constraints, Known Traps: 6/6 constraints]
After SMT, in 13355ms problems are : Problem set: 0 solved, 138 unsolved
Search for dead transitions found 0 dead transitions in 13373ms
Starting structural reductions in LIVENESS mode, iteration 1 : 102/553 places, 139/150 transitions.
Finished structural reductions in LIVENESS mode , in 1 iterations and 13899 ms. Remains : 102/553 places, 139/150 transitions.
Discarding 48 transitions out of 139. Remains 91
Initial state reduction rules removed 1 formulas.
RANDOM walk for 40000 steps (9209 resets) in 1770 ms. (22 steps per ms) remains 44/90 properties
BEST_FIRST walk for 4001 steps (195 resets) in 39 ms. (100 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4002 steps (197 resets) in 67 ms. (58 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4004 steps (190 resets) in 32 ms. (121 steps per ms) remains 43/44 properties
BEST_FIRST walk for 4003 steps (209 resets) in 50 ms. (78 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4003 steps (184 resets) in 26 ms. (148 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4002 steps (183 resets) in 37 ms. (105 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4002 steps (208 resets) in 19 ms. (200 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4002 steps (209 resets) in 23 ms. (166 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4004 steps (198 resets) in 17 ms. (222 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4001 steps (220 resets) in 22 ms. (173 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4003 steps (201 resets) in 14 ms. (266 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4004 steps (192 resets) in 20 ms. (190 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4003 steps (199 resets) in 21 ms. (181 steps per ms) remains 41/43 properties
BEST_FIRST walk for 4002 steps (191 resets) in 12 ms. (307 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4002 steps (194 resets) in 12 ms. (307 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4000 steps (176 resets) in 13 ms. (285 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4003 steps (205 resets) in 13 ms. (285 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4003 steps (185 resets) in 13 ms. (285 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4002 steps (185 resets) in 23 ms. (166 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4001 steps (173 resets) in 11 ms. (333 steps per ms) remains 32/41 properties
BEST_FIRST walk for 4000 steps (800 resets) in 16 ms. (235 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4000 steps (800 resets) in 15 ms. (250 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4001 steps (408 resets) in 14 ms. (266 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4003 steps (409 resets) in 18 ms. (210 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4003 steps (418 resets) in 24 ms. (160 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4003 steps (401 resets) in 21 ms. (181 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4001 steps (402 resets) in 20 ms. (190 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4001 steps (428 resets) in 13 ms. (285 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4001 steps (439 resets) in 29 ms. (133 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4003 steps (396 resets) in 13 ms. (285 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4003 steps (394 resets) in 28 ms. (138 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4002 steps (410 resets) in 13 ms. (285 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4002 steps (400 resets) in 13 ms. (285 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4001 steps (417 resets) in 18 ms. (210 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4002 steps (411 resets) in 14 ms. (266 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4003 steps (389 resets) in 13 ms. (285 steps per ms) remains 28/32 properties
BEST_FIRST walk for 4000 steps (381 resets) in 13 ms. (285 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4003 steps (393 resets) in 16 ms. (235 steps per ms) remains 28/28 properties
[2024-05-22 08:01:09] [INFO ] Invariant cache hit.
[2024-05-22 08:01:09] [INFO ] State equation strengthened by 63 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/38 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 1 (OVERLAPS) 23/61 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/61 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 3 (OVERLAPS) 22/83 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/83 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 5 (OVERLAPS) 112/195 variables, 83/85 constraints. Problems are: Problem set: 0 solved, 28 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/195 variables, 36/121 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/195 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 8 (OVERLAPS) 44/239 variables, 18/139 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/239 variables, 26/165 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/239 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 11 (OVERLAPS) 2/241 variables, 1/166 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/241 variables, 1/167 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/241 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 14 (OVERLAPS) 0/241 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 28 unsolved
No progress, stopping.
After SMT solving in domain Real declared 241/241 variables, and 167 constraints, problems are : Problem set: 0 solved, 28 unsolved in 1456 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 102/102 constraints, ReadFeed: 63/63 constraints, PredecessorRefiner: 28/28 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 28 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/38 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 1 (OVERLAPS) 23/61 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/61 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 3 (OVERLAPS) 22/83 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/83 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 5 (OVERLAPS) 112/195 variables, 83/85 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/195 variables, 36/121 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/195 variables, 8/129 constraints. Problems are: Problem set: 0 solved, 28 unsolved
[2024-05-22 08:01:11] [INFO ] Deduced a trap composed of 18 places in 49 ms of which 1 ms to minimize.
[2024-05-22 08:01:11] [INFO ] Deduced a trap composed of 20 places in 44 ms of which 5 ms to minimize.
[2024-05-22 08:01:11] [INFO ] Deduced a trap composed of 18 places in 46 ms of which 1 ms to minimize.
[2024-05-22 08:01:11] [INFO ] Deduced a trap composed of 19 places in 43 ms of which 1 ms to minimize.
[2024-05-22 08:01:11] [INFO ] Deduced a trap composed of 18 places in 47 ms of which 1 ms to minimize.
[2024-05-22 08:01:11] [INFO ] Deduced a trap composed of 19 places in 42 ms of which 1 ms to minimize.
[2024-05-22 08:01:11] [INFO ] Deduced a trap composed of 18 places in 47 ms of which 1 ms to minimize.
[2024-05-22 08:01:11] [INFO ] Deduced a trap composed of 18 places in 43 ms of which 0 ms to minimize.
[2024-05-22 08:01:11] [INFO ] Deduced a trap composed of 19 places in 31 ms of which 1 ms to minimize.
[2024-05-22 08:01:11] [INFO ] Deduced a trap composed of 19 places in 30 ms of which 1 ms to minimize.
[2024-05-22 08:01:11] [INFO ] Deduced a trap composed of 37 places in 67 ms of which 1 ms to minimize.
[2024-05-22 08:01:11] [INFO ] Deduced a trap composed of 38 places in 39 ms of which 1 ms to minimize.
[2024-05-22 08:01:11] [INFO ] Deduced a trap composed of 38 places in 45 ms of which 1 ms to minimize.
[2024-05-22 08:01:11] [INFO ] Deduced a trap composed of 39 places in 43 ms of which 1 ms to minimize.
[2024-05-22 08:01:11] [INFO ] Deduced a trap composed of 36 places in 42 ms of which 1 ms to minimize.
[2024-05-22 08:01:11] [INFO ] Deduced a trap composed of 37 places in 44 ms of which 1 ms to minimize.
[2024-05-22 08:01:11] [INFO ] Deduced a trap composed of 36 places in 44 ms of which 1 ms to minimize.
[2024-05-22 08:01:12] [INFO ] Deduced a trap composed of 37 places in 48 ms of which 1 ms to minimize.
[2024-05-22 08:01:12] [INFO ] Deduced a trap composed of 36 places in 47 ms of which 1 ms to minimize.
[2024-05-22 08:01:12] [INFO ] Deduced a trap composed of 37 places in 38 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/195 variables, 20/149 constraints. Problems are: Problem set: 0 solved, 28 unsolved
[2024-05-22 08:01:12] [INFO ] Deduced a trap composed of 36 places in 34 ms of which 1 ms to minimize.
[2024-05-22 08:01:12] [INFO ] Deduced a trap composed of 36 places in 43 ms of which 1 ms to minimize.
[2024-05-22 08:01:12] [INFO ] Deduced a trap composed of 36 places in 48 ms of which 1 ms to minimize.
[2024-05-22 08:01:12] [INFO ] Deduced a trap composed of 37 places in 29 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/195 variables, 4/153 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/195 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 11 (OVERLAPS) 44/239 variables, 18/171 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/239 variables, 26/197 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/239 variables, 20/217 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/239 variables, 0/217 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 15 (OVERLAPS) 2/241 variables, 1/218 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/241 variables, 1/219 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/241 variables, 0/219 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 18 (OVERLAPS) 0/241 variables, 0/219 constraints. Problems are: Problem set: 0 solved, 28 unsolved
No progress, stopping.
After SMT solving in domain Int declared 241/241 variables, and 219 constraints, problems are : Problem set: 0 solved, 28 unsolved in 3955 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 102/102 constraints, ReadFeed: 63/63 constraints, PredecessorRefiner: 28/28 constraints, Known Traps: 24/24 constraints]
After SMT, in 5439ms problems are : Problem set: 0 solved, 28 unsolved
Parikh walk visited 2 properties in 170 ms.
Support contains 36 out of 102 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 102/102 places, 139/139 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 91 transition count 119
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 91 transition count 119
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 25 place count 88 transition count 116
Iterating global reduction 0 with 3 rules applied. Total rules applied 28 place count 88 transition count 116
Applied a total of 28 rules in 25 ms. Remains 88 /102 variables (removed 14) and now considering 116/139 (removed 23) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 26 ms. Remains : 88/102 places, 116/139 transitions.
RANDOM walk for 4000000 steps (916396 resets) in 22189 ms. (180 steps per ms) remains 7/26 properties
BEST_FIRST walk for 4000003 steps (199878 resets) in 3510 ms. (1139 steps per ms) remains 4/7 properties
BEST_FIRST walk for 4000004 steps (200117 resets) in 2701 ms. (1480 steps per ms) remains 2/4 properties
BEST_FIRST walk for 4000002 steps (405283 resets) in 2632 ms. (1519 steps per ms) remains 1/2 properties
BEST_FIRST walk for 2492572 steps (253416 resets) in 1991 ms. (1251 steps per ms) remains 0/1 properties
Able to resolve query QuasiLiveness after proving 91 properties.
FORMULA QuasiLiveness TRUE TECHNIQUES RANDOM_WALK PARIKH_WALK BESTFIRST_WALK TOPOLOGICAL INITIAL_STATE
Total runtime 31616 ms.
ITS solved all properties within timeout

BK_STOP 1716364885926

--------------------
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="DBSingleClientW-PT-d0m04"
export BK_EXAMINATION="QuasiLiveness"
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 DBSingleClientW-PT-d0m04, 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 r100-tall-171624200600272"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/DBSingleClientW-PT-d0m04.tgz
mv DBSingleClientW-PT-d0m04 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.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property QuasiLiveness.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -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 ;