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.r070-smll-174854076000022.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 DBSingleClientW-PT-d0m08, examination is QuasiLiveness
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r070-smll-174854076000022
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 596K
-rw-r--r-- 1 mcc users 7.6K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 83K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.9K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 55K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.9K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K 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 18K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 113K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 98K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 6 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 119K May 29 14:32 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

FORMULA_NAME QuasiLiveness

=== Now, execution of the tool begins

BK_START 1748644808195

Invoking MCC driver with
BK_TOOL=gold2024
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
[2025-05-30 22:40:10] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, QuasiLiveness, -timeout, 180, -rebuildPNML]
[2025-05-30 22:40:10] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-05-30 22:40:11] [INFO ] Load time of PNML (sax parser for PT used): 193 ms
[2025-05-30 22:40:11] [INFO ] Transformed 553 places.
[2025-05-30 22:40:11] [INFO ] Transformed 150 transitions.
[2025-05-30 22:40:11] [INFO ] Parsed PT model containing 553 places and 150 transitions and 600 arcs in 425 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 251 ms. Remains 102 /553 variables (removed 451) and now considering 139/150 (removed 11) transitions.
// Phase 1: matrix 139 rows 102 cols
[2025-05-30 22:40:11] [INFO ] Computed 2 invariants in 32 ms
[2025-05-30 22:40:12] [INFO ] Implicit Places using invariants in 601 ms returned []
[2025-05-30 22:40:12] [INFO ] Invariant cache hit.
[2025-05-30 22:40:12] [INFO ] State equation strengthened by 63 read => feed constraints.
[2025-05-30 22:40:12] [INFO ] Implicit Places using invariants and state equation in 549 ms returned []
Implicit Place search using SMT with State Equation took 1222 ms to find 0 implicit places.
Running 138 sub problems to find dead transitions.
[2025-05-30 22:40:13] [INFO ] Invariant cache hit.
[2025-05-30 22:40: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
[2025-05-30 22:40:17] [INFO ] Deduced a trap composed of 18 places in 158 ms of which 33 ms to minimize.
[2025-05-30 22:40:18] [INFO ] Deduced a trap composed of 19 places in 137 ms of which 4 ms to minimize.
[2025-05-30 22:40:18] [INFO ] Deduced a trap composed of 18 places in 132 ms of which 2 ms to minimize.
[2025-05-30 22:40:18] [INFO ] Deduced a trap composed of 18 places in 106 ms of which 3 ms to minimize.
[2025-05-30 22:40:18] [INFO ] Deduced a trap composed of 18 places in 103 ms of which 3 ms to minimize.
[2025-05-30 22:40:18] [INFO ] Deduced a trap composed of 37 places in 92 ms of which 2 ms to minimize.
[2025-05-30 22:40:18] [INFO ] Deduced a trap composed of 38 places in 89 ms of which 2 ms to minimize.
[2025-05-30 22:40:18] [INFO ] Deduced a trap composed of 38 places in 92 ms of which 3 ms to minimize.
[2025-05-30 22:40:18] [INFO ] Deduced a trap composed of 39 places in 91 ms of which 3 ms to minimize.
[2025-05-30 22:40:19] [INFO ] Deduced a trap composed of 37 places in 91 ms of which 2 ms to minimize.
[2025-05-30 22:40:19] [INFO ] Deduced a trap composed of 38 places in 93 ms of which 2 ms to minimize.
[2025-05-30 22:40:19] [INFO ] Deduced a trap composed of 38 places in 88 ms of which 2 ms to minimize.
[2025-05-30 22:40:19] [INFO ] Deduced a trap composed of 39 places in 88 ms of which 4 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
[2025-05-30 22:40:22] [INFO ] Deduced a trap composed of 37 places in 89 ms of which 6 ms to minimize.
[2025-05-30 22:40:22] [INFO ] Deduced a trap composed of 37 places in 106 ms of which 5 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 15090 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 14126 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 29829ms problems are : Problem set: 0 solved, 138 unsolved
Search for dead transitions found 0 dead transitions in 29860ms
Starting structural reductions in LIVENESS mode, iteration 1 : 102/553 places, 139/150 transitions.
Finished structural reductions in LIVENESS mode , in 1 iterations and 31423 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 (9149 resets) in 4641 ms. (8 steps per ms) remains 51/90 properties
BEST_FIRST walk for 4002 steps (201 resets) in 104 ms. (38 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4004 steps (211 resets) in 36 ms. (108 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4002 steps (222 resets) in 42 ms. (93 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4003 steps (177 resets) in 115 ms. (34 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4004 steps (187 resets) in 16 ms. (235 steps per ms) remains 49/51 properties
BEST_FIRST walk for 4002 steps (184 resets) in 44 ms. (88 steps per ms) remains 48/49 properties
BEST_FIRST walk for 4004 steps (182 resets) in 31 ms. (125 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4002 steps (212 resets) in 26 ms. (148 steps per ms) remains 46/48 properties
BEST_FIRST walk for 4002 steps (176 resets) in 20 ms. (190 steps per ms) remains 39/46 properties
BEST_FIRST walk for 4003 steps (206 resets) in 49 ms. (80 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4003 steps (197 resets) in 57 ms. (69 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4002 steps (166 resets) in 41 ms. (95 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4003 steps (189 resets) in 21 ms. (181 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4001 steps (206 resets) in 17 ms. (222 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4003 steps (218 resets) in 19 ms. (200 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4003 steps (205 resets) in 39 ms. (100 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4003 steps (204 resets) in 24 ms. (160 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4004 steps (204 resets) in 47 ms. (83 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4003 steps (193 resets) in 24 ms. (160 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4002 steps (189 resets) in 39 ms. (100 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4003 steps (219 resets) in 34 ms. (114 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4003 steps (198 resets) in 17 ms. (222 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4002 steps (186 resets) in 17 ms. (222 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4000 steps (800 resets) in 28 ms. (137 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4000 steps (800 resets) in 27 ms. (142 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4001 steps (378 resets) in 39 ms. (100 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4001 steps (445 resets) in 24 ms. (160 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4002 steps (385 resets) in 46 ms. (85 steps per ms) remains 37/39 properties
BEST_FIRST walk for 4003 steps (377 resets) in 45 ms. (87 steps per ms) remains 35/37 properties
BEST_FIRST walk for 4003 steps (409 resets) in 23 ms. (166 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4001 steps (422 resets) in 22 ms. (173 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4002 steps (444 resets) in 22 ms. (174 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4000 steps (410 resets) in 31 ms. (125 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4001 steps (405 resets) in 22 ms. (173 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4003 steps (426 resets) in 25 ms. (153 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4003 steps (411 resets) in 32 ms. (121 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4000 steps (388 resets) in 24 ms. (160 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4002 steps (387 resets) in 43 ms. (90 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4002 steps (433 resets) in 35 ms. (111 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4002 steps (417 resets) in 30 ms. (129 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4001 steps (395 resets) in 37 ms. (105 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4003 steps (391 resets) in 38 ms. (102 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4003 steps (390 resets) in 51 ms. (76 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4002 steps (432 resets) in 37 ms. (105 steps per ms) remains 35/35 properties
[2025-05-30 22:40:45] [INFO ] Invariant cache hit.
[2025-05-30 22:40:45] [INFO ] State equation strengthened by 63 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/44 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 1 (OVERLAPS) 21/65 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/65 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 3 (OVERLAPS) 22/87 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/87 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 5 (OVERLAPS) 120/207 variables, 87/89 constraints. Problems are: Problem set: 0 solved, 35 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/207 variables, 44/133 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/207 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 8 (OVERLAPS) 34/241 variables, 15/148 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/241 variables, 19/167 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/241 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 11 (OVERLAPS) 0/241 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 35 unsolved
No progress, stopping.
After SMT solving in domain Real declared 241/241 variables, and 167 constraints, problems are : Problem set: 0 solved, 35 unsolved in 1743 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: 35/35 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 35 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/44 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 1 (OVERLAPS) 21/65 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/65 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 3 (OVERLAPS) 22/87 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/87 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 5 (OVERLAPS) 120/207 variables, 87/89 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/207 variables, 44/133 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/207 variables, 11/144 constraints. Problems are: Problem set: 0 solved, 35 unsolved
[2025-05-30 22:40:47] [INFO ] Deduced a trap composed of 37 places in 66 ms of which 2 ms to minimize.
[2025-05-30 22:40:48] [INFO ] Deduced a trap composed of 39 places in 63 ms of which 2 ms to minimize.
[2025-05-30 22:40:48] [INFO ] Deduced a trap composed of 38 places in 61 ms of which 2 ms to minimize.
[2025-05-30 22:40:48] [INFO ] Deduced a trap composed of 37 places in 57 ms of which 2 ms to minimize.
[2025-05-30 22:40:48] [INFO ] Deduced a trap composed of 37 places in 40 ms of which 1 ms to minimize.
[2025-05-30 22:40:48] [INFO ] Deduced a trap composed of 37 places in 40 ms of which 1 ms to minimize.
[2025-05-30 22:40:48] [INFO ] Deduced a trap composed of 39 places in 39 ms of which 2 ms to minimize.
[2025-05-30 22:40:48] [INFO ] Deduced a trap composed of 36 places in 39 ms of which 1 ms to minimize.
[2025-05-30 22:40:48] [INFO ] Deduced a trap composed of 38 places in 36 ms of which 1 ms to minimize.
[2025-05-30 22:40:48] [INFO ] Deduced a trap composed of 38 places in 38 ms of which 1 ms to minimize.
[2025-05-30 22:40:48] [INFO ] Deduced a trap composed of 38 places in 38 ms of which 1 ms to minimize.
[2025-05-30 22:40:48] [INFO ] Deduced a trap composed of 38 places in 39 ms of which 2 ms to minimize.
[2025-05-30 22:40:48] [INFO ] Deduced a trap composed of 39 places in 38 ms of which 1 ms to minimize.
[2025-05-30 22:40:48] [INFO ] Deduced a trap composed of 35 places in 39 ms of which 1 ms to minimize.
[2025-05-30 22:40:48] [INFO ] Deduced a trap composed of 36 places in 39 ms of which 1 ms to minimize.
[2025-05-30 22:40:48] [INFO ] Deduced a trap composed of 37 places in 39 ms of which 1 ms to minimize.
[2025-05-30 22:40:48] [INFO ] Deduced a trap composed of 37 places in 39 ms of which 1 ms to minimize.
[2025-05-30 22:40:48] [INFO ] Deduced a trap composed of 38 places in 39 ms of which 1 ms to minimize.
[2025-05-30 22:40:48] [INFO ] Deduced a trap composed of 38 places in 40 ms of which 2 ms to minimize.
[2025-05-30 22:40:49] [INFO ] Deduced a trap composed of 37 places in 45 ms of which 6 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/207 variables, 20/164 constraints. Problems are: Problem set: 0 solved, 35 unsolved
[2025-05-30 22:40:49] [INFO ] Deduced a trap composed of 37 places in 49 ms of which 2 ms to minimize.
[2025-05-30 22:40:49] [INFO ] Deduced a trap composed of 36 places in 71 ms of which 2 ms to minimize.
[2025-05-30 22:40:49] [INFO ] Deduced a trap composed of 37 places in 62 ms of which 2 ms to minimize.
[2025-05-30 22:40:49] [INFO ] Deduced a trap composed of 37 places in 65 ms of which 1 ms to minimize.
[2025-05-30 22:40:49] [INFO ] Deduced a trap composed of 37 places in 62 ms of which 3 ms to minimize.
[2025-05-30 22:40:49] [INFO ] Deduced a trap composed of 37 places in 62 ms of which 2 ms to minimize.
[2025-05-30 22:40:49] [INFO ] Deduced a trap composed of 39 places in 61 ms of which 2 ms to minimize.
[2025-05-30 22:40:49] [INFO ] Deduced a trap composed of 38 places in 61 ms of which 2 ms to minimize.
[2025-05-30 22:40:49] [INFO ] Deduced a trap composed of 36 places in 46 ms of which 1 ms to minimize.
[2025-05-30 22:40:49] [INFO ] Deduced a trap composed of 37 places in 64 ms of which 2 ms to minimize.
[2025-05-30 22:40:49] [INFO ] Deduced a trap composed of 37 places in 51 ms of which 1 ms to minimize.
[2025-05-30 22:40:50] [INFO ] Deduced a trap composed of 39 places in 44 ms of which 1 ms to minimize.
[2025-05-30 22:40:50] [INFO ] Deduced a trap composed of 38 places in 45 ms of which 1 ms to minimize.
[2025-05-30 22:40:50] [INFO ] Deduced a trap composed of 37 places in 44 ms of which 2 ms to minimize.
[2025-05-30 22:40:50] [INFO ] Deduced a trap composed of 37 places in 46 ms of which 1 ms to minimize.
[2025-05-30 22:40:50] [INFO ] Deduced a trap composed of 39 places in 44 ms of which 2 ms to minimize.
[2025-05-30 22:40:50] [INFO ] Deduced a trap composed of 38 places in 44 ms of which 1 ms to minimize.
[2025-05-30 22:40:50] [INFO ] Deduced a trap composed of 39 places in 54 ms of which 1 ms to minimize.
[2025-05-30 22:40:50] [INFO ] Deduced a trap composed of 40 places in 44 ms of which 1 ms to minimize.
[2025-05-30 22:40:50] [INFO ] Deduced a trap composed of 38 places in 44 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/207 variables, 20/184 constraints. Problems are: Problem set: 0 solved, 35 unsolved
[2025-05-30 22:40:50] [INFO ] Deduced a trap composed of 37 places in 47 ms of which 2 ms to minimize.
[2025-05-30 22:40:50] [INFO ] Deduced a trap composed of 37 places in 47 ms of which 1 ms to minimize.
[2025-05-30 22:40:50] [INFO ] Deduced a trap composed of 39 places in 46 ms of which 2 ms to minimize.
[2025-05-30 22:40:50] [INFO ] Deduced a trap composed of 39 places in 62 ms of which 1 ms to minimize.
[2025-05-30 22:40:50] [INFO ] Deduced a trap composed of 38 places in 63 ms of which 2 ms to minimize.
[2025-05-30 22:40:51] [INFO ] Deduced a trap composed of 38 places in 65 ms of which 1 ms to minimize.
[2025-05-30 22:40:51] [INFO ] Deduced a trap composed of 39 places in 70 ms of which 2 ms to minimize.
[2025-05-30 22:40:51] [INFO ] Deduced a trap composed of 40 places in 69 ms of which 2 ms to minimize.
[2025-05-30 22:40:51] [INFO ] Deduced a trap composed of 38 places in 65 ms of which 3 ms to minimize.
[2025-05-30 22:40:51] [INFO ] Deduced a trap composed of 38 places in 69 ms of which 2 ms to minimize.
[2025-05-30 22:40:51] [INFO ] Deduced a trap composed of 39 places in 62 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/207 variables, 11/195 constraints. Problems are: Problem set: 0 solved, 35 unsolved
[2025-05-30 22:40:51] [INFO ] Deduced a trap composed of 37 places in 63 ms of which 2 ms to minimize.
[2025-05-30 22:40:52] [INFO ] Deduced a trap composed of 38 places in 71 ms of which 2 ms to minimize.
[2025-05-30 22:40:52] [INFO ] Deduced a trap composed of 38 places in 71 ms of which 2 ms to minimize.
[2025-05-30 22:40:52] [INFO ] Deduced a trap composed of 39 places in 63 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 207/241 variables, and 199 constraints, problems are : Problem set: 0 solved, 35 unsolved in 5011 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 87/102 constraints, ReadFeed: 44/63 constraints, PredecessorRefiner: 11/35 constraints, Known Traps: 55/55 constraints]
After SMT, in 6820ms problems are : Problem set: 0 solved, 35 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 44 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 124
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 93 transition count 124
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 20 place count 91 transition count 122
Iterating global reduction 0 with 2 rules applied. Total rules applied 22 place count 91 transition count 122
Applied a total of 22 rules in 46 ms. Remains 91 /102 variables (removed 11) and now considering 122/139 (removed 17) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 46 ms. Remains : 91/102 places, 122/139 transitions.
RANDOM walk for 4000000 steps (915572 resets) in 25795 ms. (155 steps per ms) remains 12/35 properties
BEST_FIRST walk for 4000004 steps (197496 resets) in 6687 ms. (598 steps per ms) remains 7/12 properties
BEST_FIRST walk for 4000000 steps (800000 resets) in 6940 ms. (576 steps per ms) remains 7/7 properties
BEST_FIRST walk for 4000002 steps (403358 resets) in 5658 ms. (706 steps per ms) remains 7/7 properties
BEST_FIRST walk for 4000001 steps (404553 resets) in 5422 ms. (737 steps per ms) remains 7/7 properties
BEST_FIRST walk for 4000004 steps (404734 resets) in 5497 ms. (727 steps per ms) remains 7/7 properties
BEST_FIRST walk for 4000002 steps (403559 resets) in 5546 ms. (721 steps per ms) remains 6/7 properties
BEST_FIRST walk for 4000003 steps (403778 resets) in 5247 ms. (762 steps per ms) remains 5/6 properties
// Phase 1: matrix 122 rows 91 cols
[2025-05-30 22:41:12] [INFO ] Computed 2 invariants in 3 ms
[2025-05-30 22:41:12] [INFO ] State equation strengthened by 52 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 29/38 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/38 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 24/62 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/62 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 79/141 variables, 62/64 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/141 variables, 9/73 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/141 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (OVERLAPS) 60/201 variables, 23/96 constraints. Problems are: Problem set: 0 solved, 5 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/201 variables, 37/133 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/201 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (OVERLAPS) 12/213 variables, 6/139 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/213 variables, 6/145 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/213 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (OVERLAPS) 0/213 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 213/213 variables, and 145 constraints, problems are : Problem set: 0 solved, 5 unsolved in 286 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 91/91 constraints, ReadFeed: 52/52 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 29/38 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/38 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 24/62 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/62 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 79/141 variables, 62/64 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/141 variables, 9/73 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/141 variables, 2/75 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/141 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (OVERLAPS) 60/201 variables, 23/98 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/201 variables, 37/135 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/201 variables, 3/138 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/201 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (OVERLAPS) 12/213 variables, 6/144 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/213 variables, 6/150 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/213 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 16 (OVERLAPS) 0/213 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 213/213 variables, and 150 constraints, problems are : Problem set: 0 solved, 5 unsolved in 525 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 91/91 constraints, ReadFeed: 52/52 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
After SMT, in 829ms problems are : Problem set: 0 solved, 5 unsolved
Parikh walk visited 0 properties in 1256 ms.
Support contains 9 out of 91 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 91/91 places, 122/122 transitions.
Graph (complete) has 269 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 120
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 15 place count 78 transition count 96
Iterating global reduction 1 with 12 rules applied. Total rules applied 27 place count 78 transition count 96
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 95
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 38 place count 68 transition count 85
Iterating global reduction 2 with 10 rules applied. Total rules applied 48 place count 68 transition count 85
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 84
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 52 place count 65 transition count 78
Iterating global reduction 3 with 3 rules applied. Total rules applied 55 place count 65 transition count 78
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 56 place count 65 transition count 77
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 58 place count 63 transition count 74
Iterating global reduction 4 with 2 rules applied. Total rules applied 60 place count 63 transition count 74
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 62 place count 61 transition count 72
Iterating global reduction 4 with 2 rules applied. Total rules applied 64 place count 61 transition count 72
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 66 place count 61 transition count 70
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 67 place count 60 transition count 69
Iterating global reduction 5 with 1 rules applied. Total rules applied 68 place count 60 transition count 69
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 70 place count 60 transition count 67
Applied a total of 70 rules in 39 ms. Remains 60 /91 variables (removed 31) and now considering 67/122 (removed 55) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 39 ms. Remains : 60/91 places, 67/122 transitions.
RANDOM walk for 4000000 steps (916333 resets) in 7974 ms. (501 steps per ms) remains 5/5 properties
BEST_FIRST walk for 4000003 steps (202026 resets) in 3075 ms. (1300 steps per ms) remains 2/5 properties
BEST_FIRST walk for 4000002 steps (407446 resets) in 2561 ms. (1561 steps per ms) remains 2/2 properties
BEST_FIRST walk for 4000000 steps (407332 resets) in 2544 ms. (1571 steps per ms) remains 2/2 properties
// Phase 1: matrix 67 rows 60 cols
[2025-05-30 22:41:19] [INFO ] Computed 2 invariants in 2 ms
[2025-05-30 22:41:19] [INFO ] State equation strengthened by 20 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) 39/43 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/43 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 53/96 variables, 43/45 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/96 variables, 8/53 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/96 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 30/126 variables, 16/69 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/126 variables, 12/81 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/126 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 1/127 variables, 1/82 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/127 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 0/127 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 127/127 variables, and 82 constraints, problems are : Problem set: 0 solved, 2 unsolved in 107 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 60/60 constraints, ReadFeed: 20/20 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) 39/43 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/43 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 53/96 variables, 43/45 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/96 variables, 8/53 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/96 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 30/126 variables, 16/69 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/126 variables, 12/81 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/126 variables, 2/83 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/126 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 1/127 variables, 1/84 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/127 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 0/127 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 127/127 variables, and 84 constraints, problems are : Problem set: 0 solved, 2 unsolved in 127 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 60/60 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 242ms problems are : Problem set: 0 solved, 2 unsolved
Finished Parikh walk after 63 steps, including 3 resets, run visited all 2 properties in 2 ms. (steps per millisecond=31 )
Parikh walk visited 2 properties in 51 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 68826 ms.
ITS solved all properties within timeout

BK_STOP 1748644879816

--------------------
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="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 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 r070-smll-174854076000022"
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.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 ;