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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 556K
-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 6.2K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 63K 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.4K 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 13K Apr 12 12:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 138K Apr 12 12:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.6K Apr 12 12:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 64K Apr 12 12:47 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 1716364931152

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-d0m08
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-22 08:02:12] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, QuasiLiveness, -timeout, 180, -rebuildPNML]
[2024-05-22 08:02:12] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-22 08:02:12] [INFO ] Load time of PNML (sax parser for PT used): 88 ms
[2024-05-22 08:02:12] [INFO ] Transformed 553 places.
[2024-05-22 08:02:12] [INFO ] Transformed 150 transitions.
[2024-05-22 08:02:12] [INFO ] Parsed PT model containing 553 places and 150 transitions and 600 arcs in 190 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 26 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:02:12] [INFO ] Computed 2 invariants in 13 ms
[2024-05-22 08:02:12] [INFO ] Implicit Places using invariants in 255 ms returned []
[2024-05-22 08:02:12] [INFO ] Invariant cache hit.
[2024-05-22 08:02:12] [INFO ] State equation strengthened by 63 read => feed constraints.
[2024-05-22 08:02:13] [INFO ] Implicit Places using invariants and state equation in 230 ms returned []
Implicit Place search using SMT with State Equation took 511 ms to find 0 implicit places.
Running 138 sub problems to find dead transitions.
[2024-05-22 08:02:13] [INFO ] Invariant cache hit.
[2024-05-22 08:02:13] [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:02:15] [INFO ] Deduced a trap composed of 18 places in 61 ms of which 11 ms to minimize.
[2024-05-22 08:02:15] [INFO ] Deduced a trap composed of 19 places in 45 ms of which 1 ms to minimize.
[2024-05-22 08:02:15] [INFO ] Deduced a trap composed of 18 places in 41 ms of which 1 ms to minimize.
[2024-05-22 08:02:15] [INFO ] Deduced a trap composed of 18 places in 41 ms of which 1 ms to minimize.
[2024-05-22 08:02:15] [INFO ] Deduced a trap composed of 18 places in 41 ms of which 1 ms to minimize.
[2024-05-22 08:02:15] [INFO ] Deduced a trap composed of 37 places in 42 ms of which 1 ms to minimize.
[2024-05-22 08:02:15] [INFO ] Deduced a trap composed of 38 places in 39 ms of which 1 ms to minimize.
[2024-05-22 08:02:15] [INFO ] Deduced a trap composed of 38 places in 38 ms of which 1 ms to minimize.
[2024-05-22 08:02:15] [INFO ] Deduced a trap composed of 39 places in 38 ms of which 1 ms to minimize.
[2024-05-22 08:02:15] [INFO ] Deduced a trap composed of 37 places in 40 ms of which 1 ms to minimize.
[2024-05-22 08:02:15] [INFO ] Deduced a trap composed of 38 places in 39 ms of which 1 ms to minimize.
[2024-05-22 08:02:15] [INFO ] Deduced a trap composed of 38 places in 39 ms of which 1 ms to minimize.
[2024-05-22 08:02:15] [INFO ] Deduced a trap composed of 39 places in 36 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/241 variables, 13/180 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/241 variables, 0/180 constraints. Problems are: Problem set: 0 solved, 138 unsolved
[2024-05-22 08:02:18] [INFO ] Deduced a trap composed of 37 places in 50 ms of which 1 ms to minimize.
[2024-05-22 08:02:18] [INFO ] Deduced a trap composed of 37 places in 46 ms of which 1 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/241 variables, 2/182 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/241 variables, 0/182 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 10 (OVERLAPS) 0/241 variables, 0/182 constraints. Problems are: Problem set: 0 solved, 138 unsolved
No progress, stopping.
After SMT solving in domain Real declared 241/241 variables, and 182 constraints, problems are : Problem set: 0 solved, 138 unsolved in 7606 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: 15/15 constraints]
Escalating to Integer solving :Problem set: 0 solved, 138 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/101 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/101 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 2 (OVERLAPS) 1/102 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/102 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/102 variables, 10/17 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/102 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 6 (OVERLAPS) 139/241 variables, 102/119 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/241 variables, 63/182 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/241 variables, 138/320 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/241 variables, 0/320 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 10 (OVERLAPS) 0/241 variables, 0/320 constraints. Problems are: Problem set: 0 solved, 138 unsolved
No progress, stopping.
After SMT solving in domain Int declared 241/241 variables, and 320 constraints, problems are : Problem set: 0 solved, 138 unsolved in 8198 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: 15/15 constraints]
After SMT, in 16047ms problems are : Problem set: 0 solved, 138 unsolved
Search for dead transitions found 0 dead transitions in 16060ms
Starting structural reductions in LIVENESS mode, iteration 1 : 102/553 places, 139/150 transitions.
Finished structural reductions in LIVENESS mode , in 1 iterations and 16624 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 (9096 resets) in 2159 ms. (18 steps per ms) remains 46/90 properties
BEST_FIRST walk for 4003 steps (188 resets) in 55 ms. (71 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4003 steps (197 resets) in 27 ms. (142 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4002 steps (195 resets) in 19 ms. (200 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4002 steps (219 resets) in 93 ms. (42 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4004 steps (194 resets) in 45 ms. (87 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4001 steps (195 resets) in 42 ms. (93 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4002 steps (173 resets) in 27 ms. (142 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4004 steps (203 resets) in 21 ms. (182 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4003 steps (204 resets) in 21 ms. (181 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4002 steps (186 resets) in 16 ms. (235 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4002 steps (197 resets) in 13 ms. (285 steps per ms) remains 45/46 properties
BEST_FIRST walk for 4003 steps (199 resets) in 15 ms. (250 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4001 steps (206 resets) in 17 ms. (222 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4003 steps (195 resets) in 15 ms. (250 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4002 steps (181 resets) in 14 ms. (266 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4002 steps (206 resets) in 13 ms. (285 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4003 steps (177 resets) in 15 ms. (250 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4004 steps (208 resets) in 18 ms. (210 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4002 steps (189 resets) in 13 ms. (285 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4002 steps (206 resets) in 13 ms. (285 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4002 steps (217 resets) in 16 ms. (235 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4003 steps (193 resets) in 17 ms. (222 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4003 steps (183 resets) in 14 ms. (266 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4000 steps (800 resets) in 20 ms. (190 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4000 steps (800 resets) in 18 ms. (210 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4003 steps (403 resets) in 17 ms. (222 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4003 steps (415 resets) in 19 ms. (200 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4002 steps (400 resets) in 17 ms. (222 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4002 steps (382 resets) in 19 ms. (200 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4002 steps (381 resets) in 16 ms. (235 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4002 steps (434 resets) in 18 ms. (210 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4004 steps (413 resets) in 16 ms. (235 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4003 steps (372 resets) in 18 ms. (210 steps per ms) remains 43/45 properties
BEST_FIRST walk for 4002 steps (436 resets) in 14 ms. (266 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4003 steps (411 resets) in 17 ms. (222 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4002 steps (397 resets) in 18 ms. (210 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4003 steps (416 resets) in 17 ms. (222 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4003 steps (417 resets) in 14 ms. (266 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4002 steps (333 resets) in 16 ms. (235 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4003 steps (394 resets) in 17 ms. (222 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4002 steps (423 resets) in 17 ms. (222 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4002 steps (377 resets) in 27 ms. (142 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4003 steps (407 resets) in 17 ms. (222 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4003 steps (398 resets) in 17 ms. (222 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4003 steps (407 resets) in 17 ms. (222 steps per ms) remains 43/43 properties
[2024-05-22 08:02:30] [INFO ] Invariant cache hit.
[2024-05-22 08:02:30] [INFO ] State equation strengthened by 63 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/51 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 1 (OVERLAPS) 19/70 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/70 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 3 (OVERLAPS) 20/90 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/90 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 5 (OVERLAPS) 123/213 variables, 90/92 constraints. Problems are: Problem set: 0 solved, 43 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/213 variables, 47/139 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/213 variables, 0/139 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 8 (OVERLAPS) 28/241 variables, 12/151 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/241 variables, 16/167 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/241 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 11 (OVERLAPS) 0/241 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 43 unsolved
No progress, stopping.
After SMT solving in domain Real declared 241/241 variables, and 167 constraints, problems are : Problem set: 0 solved, 43 unsolved in 1415 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: 43/43 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 43 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/51 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 1 (OVERLAPS) 19/70 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/70 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 3 (OVERLAPS) 20/90 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/90 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 5 (OVERLAPS) 123/213 variables, 90/92 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/213 variables, 47/139 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/213 variables, 16/155 constraints. Problems are: Problem set: 0 solved, 43 unsolved
[2024-05-22 08:02:32] [INFO ] Deduced a trap composed of 38 places in 42 ms of which 1 ms to minimize.
[2024-05-22 08:02:32] [INFO ] Deduced a trap composed of 38 places in 33 ms of which 1 ms to minimize.
[2024-05-22 08:02:32] [INFO ] Deduced a trap composed of 38 places in 29 ms of which 1 ms to minimize.
[2024-05-22 08:02:32] [INFO ] Deduced a trap composed of 37 places in 38 ms of which 1 ms to minimize.
[2024-05-22 08:02:32] [INFO ] Deduced a trap composed of 38 places in 34 ms of which 0 ms to minimize.
[2024-05-22 08:02:32] [INFO ] Deduced a trap composed of 39 places in 30 ms of which 1 ms to minimize.
[2024-05-22 08:02:32] [INFO ] Deduced a trap composed of 38 places in 33 ms of which 1 ms to minimize.
[2024-05-22 08:02:32] [INFO ] Deduced a trap composed of 39 places in 31 ms of which 1 ms to minimize.
[2024-05-22 08:02:32] [INFO ] Deduced a trap composed of 38 places in 29 ms of which 1 ms to minimize.
[2024-05-22 08:02:32] [INFO ] Deduced a trap composed of 39 places in 33 ms of which 1 ms to minimize.
[2024-05-22 08:02:32] [INFO ] Deduced a trap composed of 37 places in 34 ms of which 1 ms to minimize.
[2024-05-22 08:02:32] [INFO ] Deduced a trap composed of 37 places in 30 ms of which 1 ms to minimize.
[2024-05-22 08:02:32] [INFO ] Deduced a trap composed of 37 places in 28 ms of which 0 ms to minimize.
[2024-05-22 08:02:32] [INFO ] Deduced a trap composed of 37 places in 27 ms of which 1 ms to minimize.
[2024-05-22 08:02:32] [INFO ] Deduced a trap composed of 37 places in 31 ms of which 1 ms to minimize.
[2024-05-22 08:02:32] [INFO ] Deduced a trap composed of 37 places in 28 ms of which 0 ms to minimize.
[2024-05-22 08:02:33] [INFO ] Deduced a trap composed of 39 places in 26 ms of which 1 ms to minimize.
[2024-05-22 08:02:33] [INFO ] Deduced a trap composed of 39 places in 27 ms of which 0 ms to minimize.
[2024-05-22 08:02:33] [INFO ] Deduced a trap composed of 36 places in 32 ms of which 1 ms to minimize.
[2024-05-22 08:02:33] [INFO ] Deduced a trap composed of 38 places in 30 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/213 variables, 20/175 constraints. Problems are: Problem set: 0 solved, 43 unsolved
[2024-05-22 08:02:33] [INFO ] Deduced a trap composed of 37 places in 37 ms of which 1 ms to minimize.
[2024-05-22 08:02:33] [INFO ] Deduced a trap composed of 36 places in 42 ms of which 1 ms to minimize.
[2024-05-22 08:02:33] [INFO ] Deduced a trap composed of 37 places in 30 ms of which 1 ms to minimize.
[2024-05-22 08:02:33] [INFO ] Deduced a trap composed of 37 places in 34 ms of which 1 ms to minimize.
[2024-05-22 08:02:33] [INFO ] Deduced a trap composed of 37 places in 31 ms of which 2 ms to minimize.
[2024-05-22 08:02:33] [INFO ] Deduced a trap composed of 38 places in 32 ms of which 0 ms to minimize.
[2024-05-22 08:02:33] [INFO ] Deduced a trap composed of 38 places in 29 ms of which 1 ms to minimize.
[2024-05-22 08:02:33] [INFO ] Deduced a trap composed of 38 places in 30 ms of which 1 ms to minimize.
[2024-05-22 08:02:33] [INFO ] Deduced a trap composed of 36 places in 30 ms of which 1 ms to minimize.
[2024-05-22 08:02:33] [INFO ] Deduced a trap composed of 37 places in 31 ms of which 1 ms to minimize.
[2024-05-22 08:02:33] [INFO ] Deduced a trap composed of 38 places in 29 ms of which 1 ms to minimize.
[2024-05-22 08:02:33] [INFO ] Deduced a trap composed of 38 places in 30 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/213 variables, 12/187 constraints. Problems are: Problem set: 0 solved, 43 unsolved
[2024-05-22 08:02:34] [INFO ] Deduced a trap composed of 38 places in 37 ms of which 9 ms to minimize.
[2024-05-22 08:02:34] [INFO ] Deduced a trap composed of 38 places in 45 ms of which 1 ms to minimize.
[2024-05-22 08:02:34] [INFO ] Deduced a trap composed of 38 places in 43 ms of which 1 ms to minimize.
[2024-05-22 08:02:34] [INFO ] Deduced a trap composed of 38 places in 32 ms of which 3 ms to minimize.
[2024-05-22 08:02:34] [INFO ] Deduced a trap composed of 39 places in 41 ms of which 1 ms to minimize.
[2024-05-22 08:02:34] [INFO ] Deduced a trap composed of 37 places in 39 ms of which 0 ms to minimize.
[2024-05-22 08:02:34] [INFO ] Deduced a trap composed of 39 places in 44 ms of which 1 ms to minimize.
[2024-05-22 08:02:34] [INFO ] Deduced a trap composed of 38 places in 44 ms of which 1 ms to minimize.
[2024-05-22 08:02:34] [INFO ] Deduced a trap composed of 38 places in 28 ms of which 1 ms to minimize.
[2024-05-22 08:02:34] [INFO ] Deduced a trap composed of 38 places in 44 ms of which 15 ms to minimize.
[2024-05-22 08:02:34] [INFO ] Deduced a trap composed of 38 places in 42 ms of which 1 ms to minimize.
[2024-05-22 08:02:34] [INFO ] Deduced a trap composed of 39 places in 29 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/213 variables, 12/199 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/213 variables, 0/199 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 12 (OVERLAPS) 28/241 variables, 12/211 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/241 variables, 16/227 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/241 variables, 27/254 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/241 variables, 0/254 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 16 (OVERLAPS) 0/241 variables, 0/254 constraints. Problems are: Problem set: 0 solved, 43 unsolved
No progress, stopping.
After SMT solving in domain Int declared 241/241 variables, and 254 constraints, problems are : Problem set: 0 solved, 43 unsolved in 5011 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: 43/43 constraints, Known Traps: 44/44 constraints]
After SMT, in 6465ms problems are : Problem set: 0 solved, 43 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 51 out of 102 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 102/102 places, 139/139 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 93 transition count 126
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 93 transition count 126
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 20 place count 91 transition count 124
Iterating global reduction 0 with 2 rules applied. Total rules applied 22 place count 91 transition count 124
Applied a total of 22 rules in 19 ms. Remains 91 /102 variables (removed 11) and now considering 124/139 (removed 15) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 19 ms. Remains : 91/102 places, 124/139 transitions.
RANDOM walk for 4000000 steps (915349 resets) in 23274 ms. (171 steps per ms) remains 16/43 properties
BEST_FIRST walk for 400004 steps (19800 resets) in 626 ms. (637 steps per ms) remains 16/16 properties
BEST_FIRST walk for 400004 steps (19930 resets) in 685 ms. (583 steps per ms) remains 16/16 properties
BEST_FIRST walk for 400001 steps (19727 resets) in 667 ms. (598 steps per ms) remains 15/16 properties
BEST_FIRST walk for 400002 steps (19757 resets) in 684 ms. (583 steps per ms) remains 14/15 properties
BEST_FIRST walk for 400000 steps (80000 resets) in 1083 ms. (369 steps per ms) remains 14/14 properties
BEST_FIRST walk for 400000 steps (80000 resets) in 959 ms. (416 steps per ms) remains 14/14 properties
BEST_FIRST walk for 400001 steps (40716 resets) in 1216 ms. (328 steps per ms) remains 14/14 properties
BEST_FIRST walk for 400002 steps (40209 resets) in 752 ms. (531 steps per ms) remains 14/14 properties
BEST_FIRST walk for 400002 steps (40237 resets) in 1045 ms. (382 steps per ms) remains 12/14 properties
BEST_FIRST walk for 400004 steps (40140 resets) in 1079 ms. (370 steps per ms) remains 12/12 properties
BEST_FIRST walk for 400002 steps (40371 resets) in 802 ms. (498 steps per ms) remains 12/12 properties
BEST_FIRST walk for 400002 steps (40255 resets) in 650 ms. (614 steps per ms) remains 12/12 properties
BEST_FIRST walk for 400003 steps (40139 resets) in 1200 ms. (333 steps per ms) remains 12/12 properties
BEST_FIRST walk for 400003 steps (40458 resets) in 1221 ms. (327 steps per ms) remains 12/12 properties
// Phase 1: matrix 124 rows 91 cols
[2024-05-22 08:02:49] [INFO ] Computed 2 invariants in 4 ms
[2024-05-22 08:02:49] [INFO ] State equation strengthened by 55 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/18 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (OVERLAPS) 24/42 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/42 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 3 (OVERLAPS) 22/64 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/64 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 5 (OVERLAPS) 86/150 variables, 64/66 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/150 variables, 17/83 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/150 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 8 (OVERLAPS) 57/207 variables, 23/106 constraints. Problems are: Problem set: 0 solved, 12 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/207 variables, 34/140 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/207 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 11 (OVERLAPS) 8/215 variables, 4/144 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/215 variables, 4/148 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/215 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 14 (OVERLAPS) 0/215 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Real declared 215/215 variables, and 148 constraints, problems are : Problem set: 0 solved, 12 unsolved in 433 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 91/91 constraints, ReadFeed: 55/55 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 12 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/18 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (OVERLAPS) 24/42 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/42 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 3 (OVERLAPS) 22/64 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/64 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 5 (OVERLAPS) 86/150 variables, 64/66 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/150 variables, 17/83 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/150 variables, 2/85 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/150 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 9 (OVERLAPS) 57/207 variables, 23/108 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/207 variables, 34/142 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/207 variables, 10/152 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/207 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 13 (OVERLAPS) 8/215 variables, 4/156 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/215 variables, 4/160 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/215 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 16 (OVERLAPS) 0/215 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Int declared 215/215 variables, and 160 constraints, problems are : Problem set: 0 solved, 12 unsolved in 654 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 91/91 constraints, ReadFeed: 55/55 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 0/0 constraints]
After SMT, in 1114ms problems are : Problem set: 0 solved, 12 unsolved
Parikh walk visited 6 properties in 1708 ms.
Support contains 10 out of 91 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 91/91 places, 124/124 transitions.
Graph (complete) has 267 edges and 91 vertex of which 90 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 90 transition count 122
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 15 place count 78 transition count 98
Iterating global reduction 1 with 12 rules applied. Total rules applied 27 place count 78 transition count 98
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 28 place count 78 transition count 97
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 36 place count 70 transition count 89
Iterating global reduction 2 with 8 rules applied. Total rules applied 44 place count 70 transition count 89
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 46 place count 68 transition count 86
Iterating global reduction 2 with 2 rules applied. Total rules applied 48 place count 68 transition count 86
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 49 place count 68 transition count 85
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 50 place count 67 transition count 83
Iterating global reduction 3 with 1 rules applied. Total rules applied 51 place count 67 transition count 83
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 52 place count 66 transition count 82
Iterating global reduction 3 with 1 rules applied. Total rules applied 53 place count 66 transition count 82
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 54 place count 65 transition count 81
Iterating global reduction 3 with 1 rules applied. Total rules applied 55 place count 65 transition count 81
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 57 place count 65 transition count 79
Applied a total of 57 rules in 31 ms. Remains 65 /91 variables (removed 26) and now considering 79/124 (removed 45) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 31 ms. Remains : 65/91 places, 79/124 transitions.
RANDOM walk for 4000000 steps (916719 resets) in 8821 ms. (453 steps per ms) remains 6/6 properties
BEST_FIRST walk for 4000000 steps (200390 resets) in 3736 ms. (1070 steps per ms) remains 2/6 properties
BEST_FIRST walk for 4000003 steps (405262 resets) in 3301 ms. (1211 steps per ms) remains 2/2 properties
BEST_FIRST walk for 4000002 steps (405837 resets) in 3349 ms. (1194 steps per ms) remains 2/2 properties
// Phase 1: matrix 79 rows 65 cols
[2024-05-22 08:02:58] [INFO ] Computed 2 invariants in 1 ms
[2024-05-22 08:02:58] [INFO ] State equation strengthened by 23 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 42/46 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/46 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 62/108 variables, 46/48 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/108 variables, 8/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/108 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 35/143 variables, 18/74 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/143 variables, 15/89 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/143 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 1/144 variables, 1/90 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/144 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 0/144 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 144/144 variables, and 90 constraints, problems are : Problem set: 0 solved, 2 unsolved in 72 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 65/65 constraints, ReadFeed: 23/23 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 42/46 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/46 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 62/108 variables, 46/48 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/108 variables, 8/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/108 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 35/143 variables, 18/74 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/143 variables, 15/89 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/143 variables, 2/91 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/143 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 1/144 variables, 1/92 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/144 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 0/144 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 144/144 variables, and 92 constraints, problems are : Problem set: 0 solved, 2 unsolved in 101 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 65/65 constraints, ReadFeed: 23/23 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 189ms problems are : Problem set: 0 solved, 2 unsolved
Finished Parikh walk after 943 steps, including 90 resets, run visited all 2 properties in 6 ms. (steps per millisecond=157 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 2 properties in 13 ms.
Able to resolve query QuasiLiveness after proving 91 properties.
FORMULA QuasiLiveness TRUE TECHNIQUES RANDOM_WALK PARIKH_WALK BESTFIRST_WALK TOPOLOGICAL INITIAL_STATE
Total runtime 45879 ms.
ITS solved all properties within timeout

BK_STOP 1716364978293

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

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