About the Execution of 2024-gold for DBSingleClientW-PT-d0m05
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 15691.100 | 57756.00 | 141626.00 | 375.20 | T | normal |
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-174854076000007.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-d0m05, examination is QuasiLiveness
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r070-smll-174854076000007
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 528K
-rw-r--r-- 1 mcc users 7.0K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 78K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 48K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K 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 19K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.9K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 104K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.5K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 62K 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 1748644608271
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-d0m05
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2025-05-30 22:36:50] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, QuasiLiveness, -timeout, 180, -rebuildPNML]
[2025-05-30 22:36:50] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-05-30 22:36:51] [INFO ] Load time of PNML (sax parser for PT used): 148 ms
[2025-05-30 22:36:51] [INFO ] Transformed 553 places.
[2025-05-30 22:36:51] [INFO ] Transformed 150 transitions.
[2025-05-30 22:36:51] [INFO ] Parsed PT model containing 553 places and 150 transitions and 600 arcs in 465 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 48 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:36:51] [INFO ] Computed 2 invariants in 22 ms
[2025-05-30 22:36:51] [INFO ] Implicit Places using invariants in 426 ms returned []
[2025-05-30 22:36:51] [INFO ] Invariant cache hit.
[2025-05-30 22:36:51] [INFO ] State equation strengthened by 63 read => feed constraints.
[2025-05-30 22:36:52] [INFO ] Implicit Places using invariants and state equation in 427 ms returned []
Implicit Place search using SMT with State Equation took 906 ms to find 0 implicit places.
Running 138 sub problems to find dead transitions.
[2025-05-30 22:36:52] [INFO ] Invariant cache hit.
[2025-05-30 22:36:52] [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
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/241 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 7 (OVERLAPS) 0/241 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 138 unsolved
No progress, stopping.
After SMT solving in domain Real declared 241/241 variables, and 167 constraints, problems are : Problem set: 0 solved, 138 unsolved in 6614 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: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 138 unsolved
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
At refinement iteration 6 (INCLUDED_ONLY) 0/241 variables, 138/305 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/241 variables, 0/305 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 8 (OVERLAPS) 0/241 variables, 0/305 constraints. Problems are: Problem set: 0 solved, 138 unsolved
No progress, stopping.
After SMT solving in domain Int declared 241/241 variables, and 305 constraints, problems are : Problem set: 0 solved, 138 unsolved in 11655 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: 0/0 constraints]
After SMT, in 18781ms problems are : Problem set: 0 solved, 138 unsolved
Search for dead transitions found 0 dead transitions in 18803ms
Starting structural reductions in LIVENESS mode, iteration 1 : 102/553 places, 139/150 transitions.
Finished structural reductions in LIVENESS mode , in 1 iterations and 19803 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 (9228 resets) in 3161 ms. (12 steps per ms) remains 45/90 properties
BEST_FIRST walk for 4003 steps (184 resets) in 39 ms. (100 steps per ms) remains 44/45 properties
BEST_FIRST walk for 4003 steps (198 resets) in 59 ms. (66 steps per ms) remains 43/44 properties
BEST_FIRST walk for 4003 steps (176 resets) in 43 ms. (90 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4003 steps (212 resets) in 34 ms. (114 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4003 steps (192 resets) in 43 ms. (90 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4001 steps (215 resets) in 60 ms. (65 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4004 steps (179 resets) in 53 ms. (74 steps per ms) remains 41/43 properties
BEST_FIRST walk for 4004 steps (186 resets) in 36 ms. (108 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4003 steps (204 resets) in 20 ms. (190 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4003 steps (210 resets) in 30 ms. (129 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4002 steps (202 resets) in 12 ms. (307 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4001 steps (204 resets) in 22 ms. (173 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4003 steps (200 resets) in 16 ms. (235 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4003 steps (180 resets) in 15 ms. (250 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4002 steps (188 resets) in 14 ms. (266 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4004 steps (203 resets) in 30 ms. (129 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4003 steps (196 resets) in 25 ms. (153 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4003 steps (211 resets) in 19 ms. (200 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4004 steps (201 resets) in 18 ms. (210 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4001 steps (200 resets) in 18 ms. (210 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4002 steps (199 resets) in 15 ms. (250 steps per ms) remains 40/41 properties
BEST_FIRST walk for 4002 steps (185 resets) in 17 ms. (222 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (202 resets) in 28 ms. (138 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4000 steps (800 resets) in 36 ms. (108 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4000 steps (800 resets) in 39 ms. (100 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4002 steps (418 resets) in 25 ms. (153 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4001 steps (386 resets) in 22 ms. (173 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4002 steps (412 resets) in 28 ms. (138 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4001 steps (431 resets) in 27 ms. (142 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4003 steps (412 resets) in 31 ms. (125 steps per ms) remains 39/40 properties
BEST_FIRST walk for 4002 steps (398 resets) in 27 ms. (142 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4003 steps (355 resets) in 27 ms. (142 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4003 steps (369 resets) in 22 ms. (174 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4002 steps (395 resets) in 25 ms. (153 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4004 steps (417 resets) in 43 ms. (91 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4002 steps (389 resets) in 30 ms. (129 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4002 steps (375 resets) in 28 ms. (138 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4001 steps (420 resets) in 31 ms. (125 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4002 steps (389 resets) in 23 ms. (166 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4002 steps (408 resets) in 30 ms. (129 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4003 steps (440 resets) in 27 ms. (142 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4001 steps (427 resets) in 34 ms. (114 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4003 steps (416 resets) in 23 ms. (166 steps per ms) remains 39/39 properties
[2025-05-30 22:37:12] [INFO ] Invariant cache hit.
[2025-05-30 22:37:12] [INFO ] State equation strengthened by 63 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/47 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 1 (OVERLAPS) 20/67 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/67 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 3 (OVERLAPS) 21/88 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/88 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 5 (OVERLAPS) 119/207 variables, 88/90 constraints. Problems are: Problem set: 0 solved, 39 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/207 variables, 43/133 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/207 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 8 (OVERLAPS) 34/241 variables, 14/147 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/241 variables, 20/167 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/241 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 11 (OVERLAPS) 0/241 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 39 unsolved
No progress, stopping.
After SMT solving in domain Real declared 241/241 variables, and 167 constraints, problems are : Problem set: 0 solved, 39 unsolved in 2566 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: 39/39 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 39 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/47 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 1 (OVERLAPS) 20/67 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/67 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 3 (OVERLAPS) 21/88 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/88 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 5 (OVERLAPS) 119/207 variables, 88/90 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/207 variables, 43/133 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/207 variables, 13/146 constraints. Problems are: Problem set: 0 solved, 39 unsolved
[2025-05-30 22:37:16] [INFO ] Deduced a trap composed of 36 places in 105 ms of which 26 ms to minimize.
[2025-05-30 22:37:16] [INFO ] Deduced a trap composed of 36 places in 81 ms of which 3 ms to minimize.
[2025-05-30 22:37:16] [INFO ] Deduced a trap composed of 37 places in 73 ms of which 3 ms to minimize.
[2025-05-30 22:37:16] [INFO ] Deduced a trap composed of 37 places in 69 ms of which 3 ms to minimize.
[2025-05-30 22:37:16] [INFO ] Deduced a trap composed of 38 places in 75 ms of which 2 ms to minimize.
[2025-05-30 22:37:16] [INFO ] Deduced a trap composed of 37 places in 69 ms of which 2 ms to minimize.
[2025-05-30 22:37:17] [INFO ] Deduced a trap composed of 38 places in 78 ms of which 2 ms to minimize.
[2025-05-30 22:37:17] [INFO ] Deduced a trap composed of 38 places in 87 ms of which 3 ms to minimize.
[2025-05-30 22:37:17] [INFO ] Deduced a trap composed of 37 places in 80 ms of which 2 ms to minimize.
[2025-05-30 22:37:17] [INFO ] Deduced a trap composed of 38 places in 64 ms of which 2 ms to minimize.
[2025-05-30 22:37:17] [INFO ] Deduced a trap composed of 37 places in 70 ms of which 4 ms to minimize.
[2025-05-30 22:37:17] [INFO ] Deduced a trap composed of 38 places in 87 ms of which 2 ms to minimize.
[2025-05-30 22:37:17] [INFO ] Deduced a trap composed of 38 places in 65 ms of which 2 ms to minimize.
[2025-05-30 22:37:17] [INFO ] Deduced a trap composed of 39 places in 82 ms of which 2 ms to minimize.
[2025-05-30 22:37:17] [INFO ] Deduced a trap composed of 37 places in 74 ms of which 2 ms to minimize.
[2025-05-30 22:37:17] [INFO ] Deduced a trap composed of 39 places in 72 ms of which 2 ms to minimize.
[2025-05-30 22:37:18] [INFO ] Deduced a trap composed of 38 places in 74 ms of which 2 ms to minimize.
[2025-05-30 22:37:18] [INFO ] Deduced a trap composed of 37 places in 83 ms of which 2 ms to minimize.
[2025-05-30 22:37:18] [INFO ] Deduced a trap composed of 38 places in 72 ms of which 1 ms to minimize.
[2025-05-30 22:37:18] [INFO ] Deduced a trap composed of 38 places in 75 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/207 variables, 20/166 constraints. Problems are: Problem set: 0 solved, 39 unsolved
[2025-05-30 22:37:18] [INFO ] Deduced a trap composed of 37 places in 73 ms of which 3 ms to minimize.
[2025-05-30 22:37:18] [INFO ] Deduced a trap composed of 38 places in 58 ms of which 2 ms to minimize.
[2025-05-30 22:37:18] [INFO ] Deduced a trap composed of 38 places in 81 ms of which 1 ms to minimize.
[2025-05-30 22:37:18] [INFO ] Deduced a trap composed of 38 places in 80 ms of which 2 ms to minimize.
[2025-05-30 22:37:19] [INFO ] Deduced a trap composed of 39 places in 67 ms of which 1 ms to minimize.
[2025-05-30 22:37:19] [INFO ] Deduced a trap composed of 38 places in 71 ms of which 2 ms to minimize.
[2025-05-30 22:37:19] [INFO ] Deduced a trap composed of 38 places in 70 ms of which 2 ms to minimize.
[2025-05-30 22:37:19] [INFO ] Deduced a trap composed of 37 places in 56 ms of which 2 ms to minimize.
[2025-05-30 22:37:19] [INFO ] Deduced a trap composed of 38 places in 58 ms of which 1 ms to minimize.
[2025-05-30 22:37:19] [INFO ] Deduced a trap composed of 38 places in 56 ms of which 1 ms to minimize.
[2025-05-30 22:37:19] [INFO ] Deduced a trap composed of 37 places in 56 ms of which 1 ms to minimize.
[2025-05-30 22:37:19] [INFO ] Deduced a trap composed of 37 places in 55 ms of which 1 ms to minimize.
[2025-05-30 22:37:19] [INFO ] Deduced a trap composed of 36 places in 56 ms of which 2 ms to minimize.
[2025-05-30 22:37:19] [INFO ] Deduced a trap composed of 37 places in 56 ms of which 2 ms to minimize.
[2025-05-30 22:37:19] [INFO ] Deduced a trap composed of 38 places in 63 ms of which 9 ms to minimize.
[2025-05-30 22:37:19] [INFO ] Deduced a trap composed of 38 places in 61 ms of which 2 ms to minimize.
[2025-05-30 22:37:19] [INFO ] Deduced a trap composed of 37 places in 66 ms of which 2 ms to minimize.
[2025-05-30 22:37:20] [INFO ] Deduced a trap composed of 37 places in 67 ms of which 2 ms to minimize.
[2025-05-30 22:37:20] [INFO ] Deduced a trap composed of 36 places in 78 ms of which 2 ms to minimize.
[2025-05-30 22:37:20] [INFO ] Deduced a trap composed of 38 places in 71 ms of which 3 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/207 variables, 20/186 constraints. Problems are: Problem set: 0 solved, 39 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 207/241 variables, and 186 constraints, problems are : Problem set: 0 solved, 39 unsolved in 5019 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 88/102 constraints, ReadFeed: 43/63 constraints, PredecessorRefiner: 13/39 constraints, Known Traps: 40/40 constraints]
After SMT, in 7683ms problems are : Problem set: 0 solved, 39 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 47 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 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 92 transition count 123
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 92 transition count 123
Applied a total of 20 rules in 57 ms. Remains 92 /102 variables (removed 10) and now considering 123/139 (removed 16) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 57 ms. Remains : 92/102 places, 123/139 transitions.
RANDOM walk for 4000000 steps (916521 resets) in 22323 ms. (179 steps per ms) remains 15/39 properties
BEST_FIRST walk for 400002 steps (20017 resets) in 523 ms. (763 steps per ms) remains 13/15 properties
BEST_FIRST walk for 400002 steps (19850 resets) in 490 ms. (814 steps per ms) remains 13/13 properties
BEST_FIRST walk for 400004 steps (19944 resets) in 499 ms. (800 steps per ms) remains 13/13 properties
BEST_FIRST walk for 400003 steps (19912 resets) in 507 ms. (787 steps per ms) remains 12/13 properties
BEST_FIRST walk for 400004 steps (20006 resets) in 476 ms. (838 steps per ms) remains 12/12 properties
BEST_FIRST walk for 400000 steps (80000 resets) in 816 ms. (489 steps per ms) remains 12/12 properties
BEST_FIRST walk for 400002 steps (40622 resets) in 628 ms. (635 steps per ms) remains 12/12 properties
BEST_FIRST walk for 400003 steps (40643 resets) in 620 ms. (644 steps per ms) remains 12/12 properties
BEST_FIRST walk for 400002 steps (40506 resets) in 636 ms. (627 steps per ms) remains 9/12 properties
BEST_FIRST walk for 400002 steps (40476 resets) in 530 ms. (753 steps per ms) remains 9/9 properties
BEST_FIRST walk for 400003 steps (40366 resets) in 528 ms. (756 steps per ms) remains 9/9 properties
BEST_FIRST walk for 400004 steps (40515 resets) in 526 ms. (759 steps per ms) remains 9/9 properties
// Phase 1: matrix 123 rows 92 cols
[2025-05-30 22:37:28] [INFO ] Computed 2 invariants in 8 ms
[2025-05-30 22:37:28] [INFO ] State equation strengthened by 53 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 26/41 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/41 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (OVERLAPS) 24/65 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/65 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (OVERLAPS) 88/153 variables, 65/67 constraints. Problems are: Problem set: 0 solved, 9 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/153 variables, 18/85 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/153 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (OVERLAPS) 54/207 variables, 23/108 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/207 variables, 31/139 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/207 variables, 0/139 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 11 (OVERLAPS) 8/215 variables, 4/143 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/215 variables, 4/147 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/215 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 14 (OVERLAPS) 0/215 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Real declared 215/215 variables, and 147 constraints, problems are : Problem set: 0 solved, 9 unsolved in 461 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 92/92 constraints, ReadFeed: 53/53 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 9 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 26/41 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/41 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (OVERLAPS) 24/65 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/65 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (OVERLAPS) 88/153 variables, 65/67 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/153 variables, 18/85 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/153 variables, 2/87 constraints. Problems are: Problem set: 0 solved, 9 unsolved
[2025-05-30 22:37:29] [INFO ] Deduced a trap composed of 35 places in 35 ms of which 1 ms to minimize.
[2025-05-30 22:37:29] [INFO ] Deduced a trap composed of 35 places in 42 ms of which 1 ms to minimize.
[2025-05-30 22:37:29] [INFO ] Deduced a trap composed of 35 places in 57 ms of which 2 ms to minimize.
[2025-05-30 22:37:29] [INFO ] Deduced a trap composed of 35 places in 52 ms of which 2 ms to minimize.
[2025-05-30 22:37:29] [INFO ] Deduced a trap composed of 33 places in 55 ms of which 2 ms to minimize.
[2025-05-30 22:37:29] [INFO ] Deduced a trap composed of 33 places in 52 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/153 variables, 6/93 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/153 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 10 (OVERLAPS) 54/207 variables, 23/116 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/207 variables, 31/147 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/207 variables, 7/154 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/207 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 14 (OVERLAPS) 8/215 variables, 4/158 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/215 variables, 4/162 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/215 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 17 (OVERLAPS) 0/215 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Int declared 215/215 variables, and 162 constraints, problems are : Problem set: 0 solved, 9 unsolved in 1590 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 92/92 constraints, ReadFeed: 53/53 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 6/6 constraints]
After SMT, in 2072ms problems are : Problem set: 0 solved, 9 unsolved
Fused 9 Parikh solutions to 8 different solutions.
Parikh walk visited 0 properties in 1952 ms.
Support contains 15 out of 92 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 92/92 places, 123/123 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 82 transition count 103
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 82 transition count 103
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 29 place count 73 transition count 94
Iterating global reduction 0 with 9 rules applied. Total rules applied 38 place count 73 transition count 94
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 40 place count 71 transition count 91
Iterating global reduction 0 with 2 rules applied. Total rules applied 42 place count 71 transition count 91
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 43 place count 71 transition count 90
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 44 place count 70 transition count 88
Iterating global reduction 1 with 1 rules applied. Total rules applied 45 place count 70 transition count 88
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 46 place count 69 transition count 87
Iterating global reduction 1 with 1 rules applied. Total rules applied 47 place count 69 transition count 87
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 48 place count 68 transition count 86
Iterating global reduction 1 with 1 rules applied. Total rules applied 49 place count 68 transition count 86
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 51 place count 68 transition count 84
Applied a total of 51 rules in 28 ms. Remains 68 /92 variables (removed 24) and now considering 84/123 (removed 39) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 28 ms. Remains : 68/92 places, 84/123 transitions.
RANDOM walk for 4000000 steps (916469 resets) in 9528 ms. (419 steps per ms) remains 9/9 properties
BEST_FIRST walk for 4000002 steps (200443 resets) in 3750 ms. (1066 steps per ms) remains 7/9 properties
BEST_FIRST walk for 4000002 steps (200464 resets) in 3205 ms. (1247 steps per ms) remains 5/7 properties
BEST_FIRST walk for 4000000 steps (800000 resets) in 4313 ms. (927 steps per ms) remains 5/5 properties
BEST_FIRST walk for 4000002 steps (406829 resets) in 3406 ms. (1174 steps per ms) remains 4/5 properties
BEST_FIRST walk for 4000004 steps (405621 resets) in 3119 ms. (1282 steps per ms) remains 4/4 properties
BEST_FIRST walk for 4000003 steps (406646 resets) in 3150 ms. (1269 steps per ms) remains 4/4 properties
// Phase 1: matrix 84 rows 68 cols
[2025-05-30 22:37:41] [INFO ] Computed 2 invariants in 2 ms
[2025-05-30 22:37:41] [INFO ] State equation strengthened by 28 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 22/30 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/30 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 21/51 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/51 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 63/114 variables, 51/53 constraints. Problems are: Problem set: 0 solved, 4 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/114 variables, 7/60 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/114 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 34/148 variables, 15/75 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/148 variables, 19/94 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/148 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 4/152 variables, 2/96 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/152 variables, 2/98 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/152 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (OVERLAPS) 0/152 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 152/152 variables, and 98 constraints, problems are : Problem set: 0 solved, 4 unsolved in 241 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 68/68 constraints, ReadFeed: 28/28 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 22/30 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/30 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 21/51 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/51 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 63/114 variables, 51/53 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/114 variables, 7/60 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/114 variables, 2/62 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/114 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 34/148 variables, 15/77 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/148 variables, 19/96 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/148 variables, 2/98 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/148 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 4/152 variables, 2/100 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/152 variables, 2/102 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/152 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (OVERLAPS) 0/152 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 152/152 variables, and 102 constraints, problems are : Problem set: 0 solved, 4 unsolved in 444 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 68/68 constraints, ReadFeed: 28/28 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
After SMT, in 693ms problems are : Problem set: 0 solved, 4 unsolved
Parikh walk visited 1 properties in 180 ms.
Support contains 6 out of 68 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 68/68 places, 84/84 transitions.
Graph (complete) has 203 edges and 68 vertex of which 67 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 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 67 transition count 82
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 8 place count 62 transition count 75
Iterating global reduction 1 with 5 rules applied. Total rules applied 13 place count 62 transition count 75
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 14 place count 62 transition count 74
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 16 place count 60 transition count 70
Iterating global reduction 2 with 2 rules applied. Total rules applied 18 place count 60 transition count 70
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 20 place count 60 transition count 68
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 21 place count 59 transition count 67
Iterating global reduction 3 with 1 rules applied. Total rules applied 22 place count 59 transition count 67
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 23 place count 58 transition count 66
Iterating global reduction 3 with 1 rules applied. Total rules applied 24 place count 58 transition count 66
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 26 place count 58 transition count 64
Applied a total of 26 rules in 51 ms. Remains 58 /68 variables (removed 10) and now considering 64/84 (removed 20) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 51 ms. Remains : 58/68 places, 64/84 transitions.
RANDOM walk for 4000000 steps (917635 resets) in 6103 ms. (655 steps per ms) remains 3/3 properties
BEST_FIRST walk for 4000004 steps (202679 resets) in 2292 ms. (1744 steps per ms) remains 3/3 properties
BEST_FIRST walk for 4000003 steps (407420 resets) in 2533 ms. (1578 steps per ms) remains 3/3 properties
BEST_FIRST walk for 4000003 steps (407502 resets) in 2588 ms. (1544 steps per ms) remains 3/3 properties
Finished probabilistic random walk after 4354 steps, run visited all 3 properties in 41 ms. (steps per millisecond=106 )
Probabilistic random walk after 4354 steps, saw 1966 distinct states, run finished after 57 ms. (steps per millisecond=76 ) properties seen :3
Able to resolve query QuasiLiveness after proving 91 properties.
FORMULA QuasiLiveness TRUE TECHNIQUES RANDOM_WALK PARIKH_WALK PROBABILISTIC_WALK BESTFIRST_WALK TOPOLOGICAL INITIAL_STATE
Total runtime 55217 ms.
ITS solved all properties within timeout
BK_STOP 1748644666027
--------------------
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//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
++ perl -pe 's/.*\.//g'
+ 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-d0m05"
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-d0m05, 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-174854076000007"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/DBSingleClientW-PT-d0m05.tgz
mv DBSingleClientW-PT-d0m05 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 '
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 ;