About the Execution of GreatSPN+red for DBSingleClientW-PT-d0m05
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 840.563 | 58709.00 | 153118.00 | 147.50 | 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/mcc2024-input.r100-tall-171624200600277.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-d0m05, examination is QuasiLiveness
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r100-tall-171624200600277
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 604K
-rw-r--r-- 1 mcc users 7.7K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 84K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.2K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 47K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.9K Apr 22 14:35 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Apr 22 14:35 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Apr 22 14:35 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 22 14:35 LTLFireability.xml
-rw-r--r-- 1 mcc users 16K Apr 12 12:50 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 184K Apr 12 12:50 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.5K Apr 12 12:49 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 52K Apr 12 12:49 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 1716364867022
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-d0m05
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-22 08:01:08] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, QuasiLiveness, -timeout, 180, -rebuildPNML]
[2024-05-22 08:01:08] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-22 08:01:08] [INFO ] Load time of PNML (sax parser for PT used): 79 ms
[2024-05-22 08:01:08] [INFO ] Transformed 553 places.
[2024-05-22 08:01:08] [INFO ] Transformed 150 transitions.
[2024-05-22 08:01:08] [INFO ] Parsed PT model containing 553 places and 150 transitions and 600 arcs in 174 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 29 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:01:08] [INFO ] Computed 2 invariants in 17 ms
[2024-05-22 08:01:08] [INFO ] Implicit Places using invariants in 252 ms returned []
[2024-05-22 08:01:08] [INFO ] Invariant cache hit.
[2024-05-22 08:01:08] [INFO ] State equation strengthened by 63 read => feed constraints.
[2024-05-22 08:01:08] [INFO ] Implicit Places using invariants and state equation in 253 ms returned []
Implicit Place search using SMT with State Equation took 533 ms to find 0 implicit places.
Running 138 sub problems to find dead transitions.
[2024-05-22 08:01:08] [INFO ] Invariant cache hit.
[2024-05-22 08:01:08] [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 4005 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 6658 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 10937ms problems are : Problem set: 0 solved, 138 unsolved
Search for dead transitions found 0 dead transitions in 10954ms
Starting structural reductions in LIVENESS mode, iteration 1 : 102/553 places, 139/150 transitions.
Finished structural reductions in LIVENESS mode , in 1 iterations and 11551 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 (9136 resets) in 2385 ms. (16 steps per ms) remains 50/90 properties
BEST_FIRST walk for 4004 steps (186 resets) in 105 ms. (37 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4001 steps (183 resets) in 18 ms. (210 steps per ms) remains 49/50 properties
BEST_FIRST walk for 4002 steps (183 resets) in 19 ms. (200 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4003 steps (183 resets) in 75 ms. (52 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4004 steps (191 resets) in 38 ms. (102 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4004 steps (206 resets) in 30 ms. (129 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4003 steps (179 resets) in 25 ms. (153 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4004 steps (167 resets) in 20 ms. (190 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4003 steps (182 resets) in 14 ms. (266 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4003 steps (206 resets) in 14 ms. (266 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4003 steps (185 resets) in 17 ms. (222 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4003 steps (173 resets) in 20 ms. (190 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4004 steps (195 resets) in 15 ms. (250 steps per ms) remains 48/49 properties
BEST_FIRST walk for 4002 steps (200 resets) in 18 ms. (210 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4003 steps (196 resets) in 17 ms. (222 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4003 steps (204 resets) in 16 ms. (235 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4003 steps (197 resets) in 19 ms. (200 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4002 steps (197 resets) in 13 ms. (285 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4001 steps (215 resets) in 29 ms. (133 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4004 steps (186 resets) in 12 ms. (308 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4002 steps (206 resets) in 15 ms. (250 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4002 steps (195 resets) in 22 ms. (174 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4003 steps (173 resets) in 13 ms. (285 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4003 steps (207 resets) in 13 ms. (285 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4002 steps (198 resets) in 14 ms. (266 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4004 steps (195 resets) in 37 ms. (105 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4000 steps (800 resets) in 18 ms. (210 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4000 steps (800 resets) in 16 ms. (235 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4002 steps (389 resets) in 46 ms. (85 steps per ms) remains 46/48 properties
BEST_FIRST walk for 4003 steps (402 resets) in 17 ms. (222 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4003 steps (383 resets) in 19 ms. (200 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4001 steps (423 resets) in 46 ms. (85 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4003 steps (373 resets) in 38 ms. (102 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4001 steps (415 resets) in 21 ms. (181 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4001 steps (396 resets) in 22 ms. (173 steps per ms) remains 44/46 properties
BEST_FIRST walk for 4002 steps (412 resets) in 16 ms. (235 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4001 steps (414 resets) in 18 ms. (210 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4002 steps (426 resets) in 14 ms. (266 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4004 steps (413 resets) in 14 ms. (266 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4003 steps (413 resets) in 20 ms. (190 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4003 steps (402 resets) in 12 ms. (307 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4003 steps (413 resets) in 14 ms. (266 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4004 steps (402 resets) in 15 ms. (250 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4002 steps (396 resets) in 13 ms. (285 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4004 steps (382 resets) in 13 ms. (286 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4003 steps (402 resets) in 21 ms. (181 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4001 steps (421 resets) in 14 ms. (266 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4003 steps (408 resets) in 22 ms. (174 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4002 steps (396 resets) in 13 ms. (285 steps per ms) remains 44/44 properties
[2024-05-22 08:01:21] [INFO ] Invariant cache hit.
[2024-05-22 08:01:21] [INFO ] State equation strengthened by 63 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/52 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 1 (OVERLAPS) 18/70 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/70 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 3 (OVERLAPS) 20/90 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/90 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 5 (OVERLAPS) 123/213 variables, 90/92 constraints. Problems are: Problem set: 0 solved, 44 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, 44 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/213 variables, 0/139 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 8 (OVERLAPS) 28/241 variables, 12/151 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/241 variables, 16/167 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/241 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 11 (OVERLAPS) 0/241 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 44 unsolved
No progress, stopping.
After SMT solving in domain Real declared 241/241 variables, and 167 constraints, problems are : Problem set: 0 solved, 44 unsolved in 1842 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: 44/44 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 44 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/52 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 1 (OVERLAPS) 18/70 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/70 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 3 (OVERLAPS) 20/90 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/90 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 5 (OVERLAPS) 123/213 variables, 90/92 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/213 variables, 47/139 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/213 variables, 16/155 constraints. Problems are: Problem set: 0 solved, 44 unsolved
[2024-05-22 08:01:23] [INFO ] Deduced a trap composed of 36 places in 70 ms of which 20 ms to minimize.
[2024-05-22 08:01:23] [INFO ] Deduced a trap composed of 37 places in 45 ms of which 1 ms to minimize.
[2024-05-22 08:01:23] [INFO ] Deduced a trap composed of 36 places in 39 ms of which 2 ms to minimize.
[2024-05-22 08:01:23] [INFO ] Deduced a trap composed of 38 places in 40 ms of which 1 ms to minimize.
[2024-05-22 08:01:23] [INFO ] Deduced a trap composed of 38 places in 38 ms of which 1 ms to minimize.
[2024-05-22 08:01:23] [INFO ] Deduced a trap composed of 38 places in 40 ms of which 0 ms to minimize.
[2024-05-22 08:01:23] [INFO ] Deduced a trap composed of 38 places in 38 ms of which 1 ms to minimize.
[2024-05-22 08:01:23] [INFO ] Deduced a trap composed of 39 places in 38 ms of which 1 ms to minimize.
[2024-05-22 08:01:23] [INFO ] Deduced a trap composed of 38 places in 43 ms of which 1 ms to minimize.
[2024-05-22 08:01:24] [INFO ] Deduced a trap composed of 37 places in 35 ms of which 1 ms to minimize.
[2024-05-22 08:01:24] [INFO ] Deduced a trap composed of 38 places in 38 ms of which 1 ms to minimize.
[2024-05-22 08:01:24] [INFO ] Deduced a trap composed of 37 places in 39 ms of which 1 ms to minimize.
[2024-05-22 08:01:24] [INFO ] Deduced a trap composed of 39 places in 36 ms of which 1 ms to minimize.
[2024-05-22 08:01:24] [INFO ] Deduced a trap composed of 39 places in 42 ms of which 1 ms to minimize.
[2024-05-22 08:01:24] [INFO ] Deduced a trap composed of 38 places in 36 ms of which 1 ms to minimize.
[2024-05-22 08:01:24] [INFO ] Deduced a trap composed of 38 places in 42 ms of which 8 ms to minimize.
[2024-05-22 08:01:24] [INFO ] Deduced a trap composed of 38 places in 40 ms of which 1 ms to minimize.
[2024-05-22 08:01:24] [INFO ] Deduced a trap composed of 38 places in 37 ms of which 1 ms to minimize.
[2024-05-22 08:01:24] [INFO ] Deduced a trap composed of 37 places in 64 ms of which 1 ms to minimize.
[2024-05-22 08:01:24] [INFO ] Deduced a trap composed of 38 places in 37 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/213 variables, 20/175 constraints. Problems are: Problem set: 0 solved, 44 unsolved
[2024-05-22 08:01:24] [INFO ] Deduced a trap composed of 37 places in 42 ms of which 1 ms to minimize.
[2024-05-22 08:01:24] [INFO ] Deduced a trap composed of 38 places in 59 ms of which 1 ms to minimize.
[2024-05-22 08:01:24] [INFO ] Deduced a trap composed of 37 places in 42 ms of which 1 ms to minimize.
[2024-05-22 08:01:24] [INFO ] Deduced a trap composed of 38 places in 36 ms of which 1 ms to minimize.
[2024-05-22 08:01:25] [INFO ] Deduced a trap composed of 38 places in 60 ms of which 1 ms to minimize.
[2024-05-22 08:01:25] [INFO ] Deduced a trap composed of 39 places in 36 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/213 variables, 6/181 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/213 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 11 (OVERLAPS) 28/241 variables, 12/193 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/241 variables, 16/209 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/241 variables, 28/237 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/241 variables, 0/237 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 15 (OVERLAPS) 0/241 variables, 0/237 constraints. Problems are: Problem set: 0 solved, 44 unsolved
No progress, stopping.
After SMT solving in domain Int declared 241/241 variables, and 237 constraints, problems are : Problem set: 0 solved, 44 unsolved in 4467 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: 44/44 constraints, Known Traps: 26/26 constraints]
After SMT, in 6367ms problems are : Problem set: 0 solved, 44 unsolved
Parikh walk visited 6 properties in 2005 ms.
Support contains 46 out of 102 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 102/102 places, 139/139 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 92 transition count 123
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 92 transition count 123
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 22 place count 90 transition count 121
Iterating global reduction 0 with 2 rules applied. Total rules applied 24 place count 90 transition count 121
Applied a total of 24 rules in 20 ms. Remains 90 /102 variables (removed 12) and now considering 121/139 (removed 18) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 20 ms. Remains : 90/102 places, 121/139 transitions.
RANDOM walk for 4000000 steps (915951 resets) in 19543 ms. (204 steps per ms) remains 16/38 properties
BEST_FIRST walk for 400003 steps (19712 resets) in 608 ms. (656 steps per ms) remains 16/16 properties
BEST_FIRST walk for 400003 steps (20112 resets) in 710 ms. (562 steps per ms) remains 16/16 properties
BEST_FIRST walk for 400002 steps (19733 resets) in 628 ms. (635 steps per ms) remains 16/16 properties
BEST_FIRST walk for 400003 steps (19674 resets) in 800 ms. (499 steps per ms) remains 16/16 properties
BEST_FIRST walk for 400003 steps (19755 resets) in 666 ms. (599 steps per ms) remains 16/16 properties
BEST_FIRST walk for 400004 steps (20109 resets) in 581 ms. (687 steps per ms) remains 13/16 properties
BEST_FIRST walk for 400000 steps (80000 resets) in 900 ms. (443 steps per ms) remains 13/13 properties
BEST_FIRST walk for 400003 steps (40595 resets) in 787 ms. (507 steps per ms) remains 13/13 properties
BEST_FIRST walk for 400002 steps (40758 resets) in 782 ms. (510 steps per ms) remains 13/13 properties
BEST_FIRST walk for 400002 steps (40496 resets) in 705 ms. (566 steps per ms) remains 11/13 properties
BEST_FIRST walk for 400004 steps (40674 resets) in 713 ms. (560 steps per ms) remains 11/11 properties
BEST_FIRST walk for 400001 steps (40359 resets) in 746 ms. (535 steps per ms) remains 11/11 properties
BEST_FIRST walk for 400002 steps (40611 resets) in 785 ms. (508 steps per ms) remains 11/11 properties
BEST_FIRST walk for 400003 steps (40474 resets) in 679 ms. (588 steps per ms) remains 11/11 properties
// Phase 1: matrix 121 rows 90 cols
[2024-05-22 08:01:39] [INFO ] Computed 2 invariants in 3 ms
[2024-05-22 08:01:39] [INFO ] State equation strengthened by 52 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/18 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (OVERLAPS) 24/42 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/42 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 3 (OVERLAPS) 22/64 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/64 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 5 (OVERLAPS) 87/151 variables, 64/66 constraints. Problems are: Problem set: 0 solved, 11 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/151 variables, 18/84 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/151 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 8 (OVERLAPS) 54/205 variables, 23/107 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/205 variables, 31/138 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/205 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 11 (OVERLAPS) 6/211 variables, 3/141 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/211 variables, 3/144 constraints. Problems are: Problem set: 0 solved, 11 unsolved
[2024-05-22 08:01:40] [INFO ] Deduced a trap composed of 13 places in 50 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/211 variables, 1/145 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/211 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 15 (OVERLAPS) 0/211 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 11 unsolved
No progress, stopping.
After SMT solving in domain Real declared 211/211 variables, and 145 constraints, problems are : Problem set: 0 solved, 11 unsolved in 482 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 90/90 constraints, ReadFeed: 52/52 constraints, PredecessorRefiner: 11/11 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 11 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/18 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (OVERLAPS) 24/42 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/42 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 3 (OVERLAPS) 22/64 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/64 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 5 (OVERLAPS) 87/151 variables, 64/66 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/151 variables, 18/84 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/151 variables, 2/86 constraints. Problems are: Problem set: 0 solved, 11 unsolved
[2024-05-22 08:01:40] [INFO ] Deduced a trap composed of 12 places in 38 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/151 variables, 1/87 constraints. Problems are: Problem set: 0 solved, 11 unsolved
[2024-05-22 08:01:40] [INFO ] Deduced a trap composed of 32 places in 31 ms of which 1 ms to minimize.
[2024-05-22 08:01:40] [INFO ] Deduced a trap composed of 32 places in 26 ms of which 0 ms to minimize.
[2024-05-22 08:01:40] [INFO ] Deduced a trap composed of 32 places in 39 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/151 variables, 3/90 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/151 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 11 (OVERLAPS) 54/205 variables, 23/113 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/205 variables, 31/144 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/205 variables, 9/153 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/205 variables, 1/154 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/205 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 16 (OVERLAPS) 6/211 variables, 3/157 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/211 variables, 3/160 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/211 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 19 (OVERLAPS) 0/211 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 11 unsolved
No progress, stopping.
After SMT solving in domain Int declared 211/211 variables, and 160 constraints, problems are : Problem set: 0 solved, 11 unsolved in 856 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 90/90 constraints, ReadFeed: 52/52 constraints, PredecessorRefiner: 11/11 constraints, Known Traps: 5/5 constraints]
After SMT, in 1361ms problems are : Problem set: 0 solved, 11 unsolved
Parikh walk visited 0 properties in 3435 ms.
Support contains 18 out of 90 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 90/90 places, 121/121 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 82 transition count 103
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 82 transition count 103
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 23 place count 75 transition count 96
Iterating global reduction 0 with 7 rules applied. Total rules applied 30 place count 75 transition count 96
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 32 place count 73 transition count 93
Iterating global reduction 0 with 2 rules applied. Total rules applied 34 place count 73 transition count 93
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 35 place count 73 transition count 92
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 36 place count 72 transition count 90
Iterating global reduction 1 with 1 rules applied. Total rules applied 37 place count 72 transition count 90
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 38 place count 71 transition count 89
Iterating global reduction 1 with 1 rules applied. Total rules applied 39 place count 71 transition count 89
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 40 place count 70 transition count 88
Iterating global reduction 1 with 1 rules applied. Total rules applied 41 place count 70 transition count 88
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 43 place count 70 transition count 86
Applied a total of 43 rules in 20 ms. Remains 70 /90 variables (removed 20) and now considering 86/121 (removed 35) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 20 ms. Remains : 70/90 places, 86/121 transitions.
RANDOM walk for 4000000 steps (916313 resets) in 14397 ms. (277 steps per ms) remains 7/11 properties
BEST_FIRST walk for 4000004 steps (200154 resets) in 4981 ms. (802 steps per ms) remains 5/7 properties
BEST_FIRST walk for 4000000 steps (800000 resets) in 6916 ms. (578 steps per ms) remains 5/5 properties
BEST_FIRST walk for 4000004 steps (406055 resets) in 5562 ms. (719 steps per ms) remains 5/5 properties
BEST_FIRST walk for 4000002 steps (405795 resets) in 5744 ms. (696 steps per ms) remains 5/5 properties
BEST_FIRST walk for 4000001 steps (406449 resets) in 5596 ms. (714 steps per ms) remains 4/5 properties
// Phase 1: matrix 86 rows 70 cols
[2024-05-22 08:01:58] [INFO ] Computed 2 invariants in 4 ms
[2024-05-22 08:01:58] [INFO ] State equation strengthened by 29 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) 23/31 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/31 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 21/52 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/52 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 67/119 variables, 52/54 constraints. Problems are: Problem set: 0 solved, 4 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/119 variables, 10/64 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/119 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 35/154 variables, 17/81 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/154 variables, 18/99 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/154 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 2/156 variables, 1/100 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/156 variables, 1/101 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/156 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (OVERLAPS) 0/156 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 156/156 variables, and 101 constraints, problems are : Problem set: 0 solved, 4 unsolved in 135 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 70/70 constraints, ReadFeed: 29/29 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) 23/31 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/31 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 21/52 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/52 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 67/119 variables, 52/54 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/119 variables, 10/64 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/119 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 35/154 variables, 17/81 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/154 variables, 18/99 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/154 variables, 4/103 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/154 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 2/156 variables, 1/104 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/156 variables, 1/105 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/156 variables, 0/105 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (OVERLAPS) 0/156 variables, 0/105 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 156/156 variables, and 105 constraints, problems are : Problem set: 0 solved, 4 unsolved in 167 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 70/70 constraints, ReadFeed: 29/29 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
After SMT, in 316ms problems are : Problem set: 0 solved, 4 unsolved
Parikh walk visited 0 properties in 57 ms.
Support contains 8 out of 70 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 70/70 places, 86/86 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 65 transition count 79
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 65 transition count 79
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 12 place count 63 transition count 77
Iterating global reduction 0 with 2 rules applied. Total rules applied 14 place count 63 transition count 77
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 16 place count 63 transition count 75
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 17 place count 62 transition count 72
Iterating global reduction 1 with 1 rules applied. Total rules applied 18 place count 62 transition count 72
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 19 place count 61 transition count 71
Iterating global reduction 1 with 1 rules applied. Total rules applied 20 place count 61 transition count 71
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 21 place count 60 transition count 70
Iterating global reduction 1 with 1 rules applied. Total rules applied 22 place count 60 transition count 70
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 24 place count 60 transition count 68
Applied a total of 24 rules in 14 ms. Remains 60 /70 variables (removed 10) and now considering 68/86 (removed 18) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14 ms. Remains : 60/70 places, 68/86 transitions.
RANDOM walk for 4000000 steps (916549 resets) in 7717 ms. (518 steps per ms) remains 4/4 properties
BEST_FIRST walk for 4000004 steps (202760 resets) in 2949 ms. (1355 steps per ms) remains 4/4 properties
BEST_FIRST walk for 4000000 steps (800000 resets) in 3493 ms. (1144 steps per ms) remains 4/4 properties
BEST_FIRST walk for 4000003 steps (406979 resets) in 3584 ms. (1115 steps per ms) remains 4/4 properties
BEST_FIRST walk for 4000004 steps (407374 resets) in 3425 ms. (1167 steps per ms) remains 4/4 properties
Finished probabilistic random walk after 4395 steps, run visited all 4 properties in 24 ms. (steps per millisecond=183 )
Probabilistic random walk after 4395 steps, saw 1980 distinct states, run finished after 28 ms. (steps per millisecond=156 ) properties seen :4
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 57600 ms.
ITS solved all properties within timeout
BK_STOP 1716364925731
--------------------
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="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-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 r100-tall-171624200600277"
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.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 '
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 ;