About the Execution of GreatSPN+red for Peterson-PT-3
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 3836.260 | 682782.00 | 809397.00 | 1977.40 | F | 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.r276-smll-171654416100164.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 Peterson-PT-3, examination is Liveness
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r276-smll-171654416100164
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.7M
-rw-r--r-- 1 mcc users 27K Apr 12 02:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 143K Apr 12 02:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 27K Apr 12 02:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 134K Apr 12 02:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 17K Apr 23 07:42 LTLCardinality.txt
-rw-r--r-- 1 mcc users 63K Apr 23 07:42 LTLCardinality.xml
-rw-r--r-- 1 mcc users 14K Apr 23 07:42 LTLFireability.txt
-rw-r--r-- 1 mcc users 55K Apr 23 07:42 LTLFireability.xml
-rw-r--r-- 1 mcc users 108K Apr 12 02:33 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 511K Apr 12 02:33 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 71K Apr 12 02:28 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 344K Apr 12 02:28 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 5.5K Apr 23 07:42 UpperBounds.txt
-rw-r--r-- 1 mcc users 12K Apr 23 07:42 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 2 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 143K May 18 16:43 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 Liveness
=== Now, execution of the tool begins
BK_START 1716820482294
Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=Liveness
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=Peterson-PT-3
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-27 14:34:44] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, Liveness, -timeout, 180, -rebuildPNML]
[2024-05-27 14:34:44] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-27 14:34:44] [INFO ] Load time of PNML (sax parser for PT used): 203 ms
[2024-05-27 14:34:44] [INFO ] Transformed 244 places.
[2024-05-27 14:34:44] [INFO ] Transformed 332 transitions.
[2024-05-27 14:34:44] [INFO ] Found NUPN structural information;
[2024-05-27 14:34:44] [INFO ] Parsed PT model containing 244 places and 332 transitions and 1016 arcs in 495 ms.
Built sparse matrix representations for Structural reductions in 9 ms.20023KB memory used
Starting structural reductions in DEADLOCK mode, iteration 0 : 244/244 places, 332/332 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Applied a total of 0 rules in 50 ms. Remains 244 /244 variables (removed 0) and now considering 332/332 (removed 0) transitions.
Finished structural reductions in DEADLOCK mode , in 1 iterations and 78 ms. Remains : 244/244 places, 332/332 transitions.
Starting structural reductions in DEADLOCK mode, iteration 0 : 244/244 places, 332/332 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Applied a total of 0 rules in 19 ms. Remains 244 /244 variables (removed 0) and now considering 332/332 (removed 0) transitions.
[2024-05-27 14:34:44] [INFO ] Flow matrix only has 308 transitions (discarded 24 similar events)
// Phase 1: matrix 308 rows 244 cols
[2024-05-27 14:34:44] [INFO ] Computed 15 invariants in 27 ms
[2024-05-27 14:34:45] [INFO ] Implicit Places using invariants in 510 ms returned []
[2024-05-27 14:34:45] [INFO ] Flow matrix only has 308 transitions (discarded 24 similar events)
[2024-05-27 14:34:45] [INFO ] Invariant cache hit.
[2024-05-27 14:34:45] [INFO ] State equation strengthened by 57 read => feed constraints.
[2024-05-27 14:34:45] [INFO ] Implicit Places using invariants and state equation in 331 ms returned []
Implicit Place search using SMT with State Equation took 887 ms to find 0 implicit places.
[2024-05-27 14:34:45] [INFO ] Redundant transitions in 26 ms returned []
Running 328 sub problems to find dead transitions.
[2024-05-27 14:34:45] [INFO ] Flow matrix only has 308 transitions (discarded 24 similar events)
[2024-05-27 14:34:45] [INFO ] Invariant cache hit.
[2024-05-27 14:34:45] [INFO ] State equation strengthened by 57 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/240 variables, 240/240 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/240 variables, 5/245 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/240 variables, 2/247 constraints. Problems are: Problem set: 0 solved, 328 unsolved
[2024-05-27 14:34:48] [INFO ] Deduced a trap composed of 17 places in 60 ms of which 11 ms to minimize.
[2024-05-27 14:34:49] [INFO ] Deduced a trap composed of 89 places in 90 ms of which 7 ms to minimize.
[2024-05-27 14:34:49] [INFO ] Deduced a trap composed of 97 places in 79 ms of which 2 ms to minimize.
[2024-05-27 14:34:49] [INFO ] Deduced a trap composed of 53 places in 59 ms of which 1 ms to minimize.
[2024-05-27 14:34:50] [INFO ] Deduced a trap composed of 38 places in 68 ms of which 2 ms to minimize.
[2024-05-27 14:34:50] [INFO ] Deduced a trap composed of 35 places in 66 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/240 variables, 6/253 constraints. Problems are: Problem set: 0 solved, 328 unsolved
[2024-05-27 14:34:55] [INFO ] Deduced a trap composed of 50 places in 84 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/240 variables, 1/254 constraints. Problems are: Problem set: 0 solved, 328 unsolved
[2024-05-27 14:34:58] [INFO ] Deduced a trap composed of 53 places in 114 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/240 variables, 1/255 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/240 variables, 0/255 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 7 (OVERLAPS) 4/244 variables, 6/261 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/244 variables, 4/265 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/244 variables, 2/267 constraints. Problems are: Problem set: 0 solved, 328 unsolved
[2024-05-27 14:35:05] [INFO ] Deduced a trap composed of 9 places in 118 ms of which 3 ms to minimize.
[2024-05-27 14:35:05] [INFO ] Deduced a trap composed of 34 places in 101 ms of which 2 ms to minimize.
[2024-05-27 14:35:05] [INFO ] Deduced a trap composed of 52 places in 112 ms of which 2 ms to minimize.
[2024-05-27 14:35:05] [INFO ] Deduced a trap composed of 34 places in 145 ms of which 4 ms to minimize.
[2024-05-27 14:35:05] [INFO ] Deduced a trap composed of 52 places in 90 ms of which 3 ms to minimize.
[2024-05-27 14:35:06] [INFO ] Deduced a trap composed of 49 places in 133 ms of which 11 ms to minimize.
[2024-05-27 14:35:06] [INFO ] Deduced a trap composed of 16 places in 138 ms of which 3 ms to minimize.
[2024-05-27 14:35:06] [INFO ] Deduced a trap composed of 45 places in 139 ms of which 2 ms to minimize.
[2024-05-27 14:35:06] [INFO ] Deduced a trap composed of 16 places in 106 ms of which 2 ms to minimize.
[2024-05-27 14:35:06] [INFO ] Deduced a trap composed of 9 places in 113 ms of which 2 ms to minimize.
[2024-05-27 14:35:06] [INFO ] Deduced a trap composed of 27 places in 121 ms of which 2 ms to minimize.
[2024-05-27 14:35:06] [INFO ] Deduced a trap composed of 12 places in 241 ms of which 3 ms to minimize.
[2024-05-27 14:35:07] [INFO ] Deduced a trap composed of 20 places in 134 ms of which 2 ms to minimize.
[2024-05-27 14:35:07] [INFO ] Deduced a trap composed of 45 places in 124 ms of which 2 ms to minimize.
[2024-05-27 14:35:07] [INFO ] Deduced a trap composed of 27 places in 71 ms of which 2 ms to minimize.
[2024-05-27 14:35:07] [INFO ] Deduced a trap composed of 38 places in 91 ms of which 2 ms to minimize.
[2024-05-27 14:35:07] [INFO ] Deduced a trap composed of 38 places in 91 ms of which 1 ms to minimize.
[2024-05-27 14:35:07] [INFO ] Deduced a trap composed of 27 places in 119 ms of which 3 ms to minimize.
[2024-05-27 14:35:07] [INFO ] Deduced a trap composed of 9 places in 124 ms of which 3 ms to minimize.
[2024-05-27 14:35:08] [INFO ] Deduced a trap composed of 29 places in 107 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/244 variables, 20/287 constraints. Problems are: Problem set: 0 solved, 328 unsolved
[2024-05-27 14:35:08] [INFO ] Deduced a trap composed of 31 places in 124 ms of which 2 ms to minimize.
[2024-05-27 14:35:08] [INFO ] Deduced a trap composed of 13 places in 89 ms of which 2 ms to minimize.
[2024-05-27 14:35:08] [INFO ] Deduced a trap composed of 37 places in 135 ms of which 2 ms to minimize.
[2024-05-27 14:35:09] [INFO ] Deduced a trap composed of 56 places in 116 ms of which 2 ms to minimize.
[2024-05-27 14:35:09] [INFO ] Deduced a trap composed of 81 places in 95 ms of which 2 ms to minimize.
[2024-05-27 14:35:09] [INFO ] Deduced a trap composed of 83 places in 102 ms of which 16 ms to minimize.
[2024-05-27 14:35:09] [INFO ] Deduced a trap composed of 48 places in 82 ms of which 6 ms to minimize.
[2024-05-27 14:35:09] [INFO ] Deduced a trap composed of 45 places in 77 ms of which 1 ms to minimize.
[2024-05-27 14:35:09] [INFO ] Deduced a trap composed of 30 places in 111 ms of which 1 ms to minimize.
[2024-05-27 14:35:09] [INFO ] Deduced a trap composed of 31 places in 98 ms of which 2 ms to minimize.
[2024-05-27 14:35:10] [INFO ] Deduced a trap composed of 61 places in 115 ms of which 3 ms to minimize.
[2024-05-27 14:35:10] [INFO ] Deduced a trap composed of 56 places in 131 ms of which 3 ms to minimize.
[2024-05-27 14:35:10] [INFO ] Deduced a trap composed of 26 places in 116 ms of which 2 ms to minimize.
[2024-05-27 14:35:10] [INFO ] Deduced a trap composed of 49 places in 101 ms of which 2 ms to minimize.
[2024-05-27 14:35:10] [INFO ] Deduced a trap composed of 73 places in 124 ms of which 2 ms to minimize.
[2024-05-27 14:35:10] [INFO ] Deduced a trap composed of 74 places in 101 ms of which 2 ms to minimize.
[2024-05-27 14:35:10] [INFO ] Deduced a trap composed of 49 places in 99 ms of which 1 ms to minimize.
[2024-05-27 14:35:11] [INFO ] Deduced a trap composed of 49 places in 107 ms of which 2 ms to minimize.
[2024-05-27 14:35:11] [INFO ] Deduced a trap composed of 56 places in 78 ms of which 2 ms to minimize.
[2024-05-27 14:35:11] [INFO ] Deduced a trap composed of 86 places in 123 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/244 variables, 20/307 constraints. Problems are: Problem set: 0 solved, 328 unsolved
[2024-05-27 14:35:12] [INFO ] Deduced a trap composed of 45 places in 53 ms of which 2 ms to minimize.
[2024-05-27 14:35:12] [INFO ] Deduced a trap composed of 56 places in 169 ms of which 2 ms to minimize.
[2024-05-27 14:35:12] [INFO ] Deduced a trap composed of 69 places in 86 ms of which 3 ms to minimize.
[2024-05-27 14:35:13] [INFO ] Deduced a trap composed of 73 places in 103 ms of which 2 ms to minimize.
[2024-05-27 14:35:13] [INFO ] Deduced a trap composed of 38 places in 84 ms of which 2 ms to minimize.
[2024-05-27 14:35:13] [INFO ] Deduced a trap composed of 30 places in 116 ms of which 2 ms to minimize.
[2024-05-27 14:35:13] [INFO ] Deduced a trap composed of 13 places in 77 ms of which 2 ms to minimize.
[2024-05-27 14:35:13] [INFO ] Deduced a trap composed of 38 places in 91 ms of which 5 ms to minimize.
[2024-05-27 14:35:14] [INFO ] Deduced a trap composed of 20 places in 47 ms of which 1 ms to minimize.
[2024-05-27 14:35:14] [INFO ] Deduced a trap composed of 42 places in 83 ms of which 2 ms to minimize.
[2024-05-27 14:35:14] [INFO ] Deduced a trap composed of 27 places in 105 ms of which 2 ms to minimize.
[2024-05-27 14:35:14] [INFO ] Deduced a trap composed of 50 places in 98 ms of which 2 ms to minimize.
[2024-05-27 14:35:16] [INFO ] Deduced a trap composed of 20 places in 130 ms of which 2 ms to minimize.
SMT process timed out in 30238ms, After SMT, problems are : Problem set: 0 solved, 328 unsolved
Search for dead transitions found 0 dead transitions in 30267ms
Finished structural reductions in DEADLOCK mode , in 1 iterations and 31227 ms. Remains : 244/244 places, 332/332 transitions.
Random walk for 1250000 steps, including 0 resets, run took 1535 ms (no deadlock found). (steps per millisecond=814 )
Random directed walk for 1250000 steps, including 0 resets, run took 1454 ms (no deadlock found). (steps per millisecond=859 )
[2024-05-27 14:35:19] [INFO ] Flow matrix only has 308 transitions (discarded 24 similar events)
[2024-05-27 14:35:19] [INFO ] Invariant cache hit.
[2024-05-27 14:35:19] [INFO ] [Real]Absence check using 11 positive place invariants in 12 ms returned sat
[2024-05-27 14:35:19] [INFO ] [Real]Absence check using 11 positive and 4 generalized place invariants in 6 ms returned unsat
Starting structural reductions in LIVENESS mode, iteration 0 : 244/244 places, 332/332 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 96 transitions
Trivial Post-agglo rules discarded 96 transitions
Performed 96 trivial Post agglomeration. Transition count delta: 96
Iterating post reduction 0 with 96 rules applied. Total rules applied 96 place count 244 transition count 236
Reduce places removed 96 places and 0 transitions.
Iterating post reduction 1 with 96 rules applied. Total rules applied 192 place count 148 transition count 236
Performed 48 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 48 Pre rules applied. Total rules applied 192 place count 148 transition count 188
Deduced a syphon composed of 48 places in 1 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 2 with 96 rules applied. Total rules applied 288 place count 100 transition count 188
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 312 place count 88 transition count 176
Applied a total of 312 rules in 60 ms. Remains 88 /244 variables (removed 156) and now considering 176/332 (removed 156) transitions.
[2024-05-27 14:35:19] [INFO ] Flow matrix only has 152 transitions (discarded 24 similar events)
// Phase 1: matrix 152 rows 88 cols
[2024-05-27 14:35:19] [INFO ] Computed 15 invariants in 2 ms
[2024-05-27 14:35:19] [INFO ] Implicit Places using invariants in 177 ms returned [81, 82, 83, 84]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 204 ms to find 4 implicit places.
Starting structural reductions in LIVENESS mode, iteration 1 : 84/244 places, 176/332 transitions.
Applied a total of 0 rules in 3 ms. Remains 84 /84 variables (removed 0) and now considering 176/176 (removed 0) transitions.
Finished structural reductions in LIVENESS mode , in 2 iterations and 267 ms. Remains : 84/244 places, 176/332 transitions.
Discarding 4 transitions out of 176. Remains 172
RANDOM walk for 40000 steps (8 resets) in 2598 ms. (15 steps per ms) remains 43/172 properties
BEST_FIRST walk for 4004 steps (8 resets) in 41 ms. (95 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4004 steps (8 resets) in 49 ms. (80 steps per ms) remains 41/43 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4004 steps (8 resets) in 58 ms. (67 steps per ms) remains 40/41 properties
BEST_FIRST walk for 4004 steps (8 resets) in 57 ms. (69 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 38/40 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4004 steps (8 resets) in 29 ms. (133 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4004 steps (8 resets) in 29 ms. (133 steps per ms) remains 37/38 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 36/37 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 35/36 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 34/35 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 33/34 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 31/33 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (8 resets) in 27 ms. (143 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 31/31 properties
[2024-05-27 14:35:20] [INFO ] Flow matrix only has 152 transitions (discarded 24 similar events)
// Phase 1: matrix 152 rows 84 cols
[2024-05-27 14:35:20] [INFO ] Computed 11 invariants in 5 ms
[2024-05-27 14:35:20] [INFO ] State equation strengthened by 57 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/38 variables, 38/38 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/38 variables, 2/40 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/38 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 3 (OVERLAPS) 45/83 variables, 8/48 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/83 variables, 45/93 constraints. Problems are: Problem set: 0 solved, 31 unsolved
[2024-05-27 14:35:21] [INFO ] Deduced a trap composed of 7 places in 56 ms of which 2 ms to minimize.
[2024-05-27 14:35:21] [INFO ] Deduced a trap composed of 18 places in 51 ms of which 2 ms to minimize.
[2024-05-27 14:35:21] [INFO ] Deduced a trap composed of 8 places in 46 ms of which 2 ms to minimize.
[2024-05-27 14:35:21] [INFO ] Deduced a trap composed of 12 places in 48 ms of which 1 ms to minimize.
[2024-05-27 14:35:21] [INFO ] Deduced a trap composed of 7 places in 47 ms of which 1 ms to minimize.
[2024-05-27 14:35:21] [INFO ] Deduced a trap composed of 7 places in 47 ms of which 2 ms to minimize.
[2024-05-27 14:35:21] [INFO ] Deduced a trap composed of 19 places in 52 ms of which 1 ms to minimize.
[2024-05-27 14:35:21] [INFO ] Deduced a trap composed of 19 places in 56 ms of which 1 ms to minimize.
[2024-05-27 14:35:21] [INFO ] Deduced a trap composed of 14 places in 53 ms of which 1 ms to minimize.
[2024-05-27 14:35:21] [INFO ] Deduced a trap composed of 14 places in 56 ms of which 1 ms to minimize.
[2024-05-27 14:35:21] [INFO ] Deduced a trap composed of 14 places in 50 ms of which 1 ms to minimize.
[2024-05-27 14:35:22] [INFO ] Deduced a trap composed of 22 places in 59 ms of which 2 ms to minimize.
[2024-05-27 14:35:22] [INFO ] Deduced a trap composed of 19 places in 52 ms of which 1 ms to minimize.
[2024-05-27 14:35:22] [INFO ] Deduced a trap composed of 9 places in 51 ms of which 2 ms to minimize.
[2024-05-27 14:35:22] [INFO ] Deduced a trap composed of 12 places in 40 ms of which 1 ms to minimize.
[2024-05-27 14:35:22] [INFO ] Deduced a trap composed of 12 places in 45 ms of which 1 ms to minimize.
[2024-05-27 14:35:22] [INFO ] Deduced a trap composed of 8 places in 41 ms of which 2 ms to minimize.
[2024-05-27 14:35:22] [INFO ] Deduced a trap composed of 13 places in 40 ms of which 1 ms to minimize.
[2024-05-27 14:35:22] [INFO ] Deduced a trap composed of 18 places in 69 ms of which 1 ms to minimize.
[2024-05-27 14:35:22] [INFO ] Deduced a trap composed of 19 places in 52 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/83 variables, 20/113 constraints. Problems are: Problem set: 0 solved, 31 unsolved
[2024-05-27 14:35:22] [INFO ] Deduced a trap composed of 17 places in 84 ms of which 1 ms to minimize.
[2024-05-27 14:35:22] [INFO ] Deduced a trap composed of 17 places in 93 ms of which 1 ms to minimize.
[2024-05-27 14:35:22] [INFO ] Deduced a trap composed of 17 places in 54 ms of which 1 ms to minimize.
[2024-05-27 14:35:22] [INFO ] Deduced a trap composed of 17 places in 111 ms of which 1 ms to minimize.
[2024-05-27 14:35:23] [INFO ] Deduced a trap composed of 18 places in 102 ms of which 1 ms to minimize.
[2024-05-27 14:35:23] [INFO ] Deduced a trap composed of 12 places in 73 ms of which 1 ms to minimize.
[2024-05-27 14:35:23] [INFO ] Deduced a trap composed of 22 places in 77 ms of which 1 ms to minimize.
[2024-05-27 14:35:23] [INFO ] Deduced a trap composed of 21 places in 46 ms of which 1 ms to minimize.
[2024-05-27 14:35:23] [INFO ] Deduced a trap composed of 13 places in 124 ms of which 1 ms to minimize.
[2024-05-27 14:35:23] [INFO ] Deduced a trap composed of 24 places in 51 ms of which 1 ms to minimize.
[2024-05-27 14:35:23] [INFO ] Deduced a trap composed of 14 places in 48 ms of which 1 ms to minimize.
[2024-05-27 14:35:23] [INFO ] Deduced a trap composed of 13 places in 42 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/83 variables, 12/125 constraints. Problems are: Problem set: 0 solved, 31 unsolved
[2024-05-27 14:35:23] [INFO ] Deduced a trap composed of 17 places in 113 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/83 variables, 1/126 constraints. Problems are: Problem set: 0 solved, 31 unsolved
[2024-05-27 14:35:25] [INFO ] Deduced a trap composed of 9 places in 1113 ms of which 33 ms to minimize.
[2024-05-27 14:35:25] [INFO ] Deduced a trap composed of 8 places in 92 ms of which 1 ms to minimize.
[2024-05-27 14:35:25] [INFO ] Deduced a trap composed of 18 places in 66 ms of which 1 ms to minimize.
[2024-05-27 14:35:25] [INFO ] Deduced a trap composed of 25 places in 94 ms of which 2 ms to minimize.
[2024-05-27 14:35:25] [INFO ] Deduced a trap composed of 13 places in 122 ms of which 1 ms to minimize.
[2024-05-27 14:35:25] [INFO ] Deduced a trap composed of 8 places in 47 ms of which 1 ms to minimize.
[2024-05-27 14:35:25] [INFO ] Deduced a trap composed of 9 places in 123 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/83 variables, 7/133 constraints. Problems are: Problem set: 0 solved, 31 unsolved
[2024-05-27 14:35:26] [INFO ] Deduced a trap composed of 7 places in 99 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 83/236 variables, and 134 constraints, problems are : Problem set: 0 solved, 31 unsolved in 5012 ms.
Refiners :[Domain max(s): 83/84 constraints, Positive P Invariants (semi-flows): 10/11 constraints, State Equation: 0/84 constraints, ReadFeed: 0/57 constraints, PredecessorRefiner: 31/31 constraints, Known Traps: 41/41 constraints]
Escalating to Integer solving :Problem set: 0 solved, 31 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/38 variables, 38/38 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/38 variables, 2/40 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/38 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 3 (OVERLAPS) 45/83 variables, 8/48 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/83 variables, 45/93 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/83 variables, 41/134 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/83 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 7 (OVERLAPS) 1/84 variables, 1/135 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/84 variables, 1/136 constraints. Problems are: Problem set: 0 solved, 31 unsolved
[2024-05-27 14:35:26] [INFO ] Deduced a trap composed of 19 places in 92 ms of which 1 ms to minimize.
[2024-05-27 14:35:27] [INFO ] Deduced a trap composed of 27 places in 69 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/84 variables, 2/138 constraints. Problems are: Problem set: 0 solved, 31 unsolved
[2024-05-27 14:35:27] [INFO ] Deduced a trap composed of 18 places in 72 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/84 variables, 1/139 constraints. Problems are: Problem set: 0 solved, 31 unsolved
[2024-05-27 14:35:28] [INFO ] Deduced a trap composed of 9 places in 44 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/84 variables, 1/140 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/84 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 13 (OVERLAPS) 152/236 variables, 84/224 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/236 variables, 57/281 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/236 variables, 31/312 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/236 variables, 0/312 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 17 (OVERLAPS) 0/236 variables, 0/312 constraints. Problems are: Problem set: 0 solved, 31 unsolved
No progress, stopping.
After SMT solving in domain Int declared 236/236 variables, and 312 constraints, problems are : Problem set: 0 solved, 31 unsolved in 3964 ms.
Refiners :[Domain max(s): 84/84 constraints, Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 84/84 constraints, ReadFeed: 57/57 constraints, PredecessorRefiner: 31/31 constraints, Known Traps: 45/45 constraints]
After SMT, in 9016ms problems are : Problem set: 0 solved, 31 unsolved
Parikh walk visited 4 properties in 1617 ms.
Support contains 36 out of 84 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 84/84 places, 176/176 transitions.
Applied a total of 0 rules in 8 ms. Remains 84 /84 variables (removed 0) and now considering 176/176 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 84/84 places, 176/176 transitions.
RANDOM walk for 4000000 steps (8 resets) in 29406 ms. (136 steps per ms) remains 27/27 properties
BEST_FIRST walk for 400004 steps (8 resets) in 701 ms. (569 steps per ms) remains 27/27 properties
BEST_FIRST walk for 400004 steps (8 resets) in 689 ms. (579 steps per ms) remains 27/27 properties
BEST_FIRST walk for 400004 steps (8 resets) in 617 ms. (647 steps per ms) remains 27/27 properties
BEST_FIRST walk for 400004 steps (8 resets) in 776 ms. (514 steps per ms) remains 27/27 properties
BEST_FIRST walk for 400004 steps (8 resets) in 799 ms. (500 steps per ms) remains 27/27 properties
BEST_FIRST walk for 400004 steps (8 resets) in 788 ms. (506 steps per ms) remains 27/27 properties
BEST_FIRST walk for 400004 steps (8 resets) in 624 ms. (640 steps per ms) remains 27/27 properties
BEST_FIRST walk for 400004 steps (8 resets) in 698 ms. (572 steps per ms) remains 27/27 properties
BEST_FIRST walk for 400004 steps (8 resets) in 760 ms. (525 steps per ms) remains 27/27 properties
BEST_FIRST walk for 400004 steps (8 resets) in 653 ms. (611 steps per ms) remains 27/27 properties
BEST_FIRST walk for 400004 steps (8 resets) in 690 ms. (578 steps per ms) remains 27/27 properties
BEST_FIRST walk for 400004 steps (8 resets) in 674 ms. (592 steps per ms) remains 27/27 properties
BEST_FIRST walk for 400004 steps (8 resets) in 973 ms. (410 steps per ms) remains 27/27 properties
BEST_FIRST walk for 400004 steps (8 resets) in 698 ms. (572 steps per ms) remains 27/27 properties
BEST_FIRST walk for 400004 steps (8 resets) in 836 ms. (477 steps per ms) remains 27/27 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1103 ms. (362 steps per ms) remains 27/27 properties
BEST_FIRST walk for 400004 steps (8 resets) in 718 ms. (556 steps per ms) remains 27/27 properties
BEST_FIRST walk for 400004 steps (8 resets) in 845 ms. (472 steps per ms) remains 27/27 properties
BEST_FIRST walk for 400004 steps (8 resets) in 692 ms. (577 steps per ms) remains 27/27 properties
BEST_FIRST walk for 400004 steps (8 resets) in 617 ms. (647 steps per ms) remains 27/27 properties
BEST_FIRST walk for 400004 steps (8 resets) in 641 ms. (623 steps per ms) remains 27/27 properties
BEST_FIRST walk for 400004 steps (8 resets) in 823 ms. (485 steps per ms) remains 26/27 properties
BEST_FIRST walk for 400004 steps (8 resets) in 876 ms. (456 steps per ms) remains 26/26 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1076 ms. (371 steps per ms) remains 26/26 properties
BEST_FIRST walk for 400004 steps (8 resets) in 907 ms. (440 steps per ms) remains 26/26 properties
BEST_FIRST walk for 400004 steps (8 resets) in 697 ms. (573 steps per ms) remains 26/26 properties
BEST_FIRST walk for 400004 steps (8 resets) in 665 ms. (600 steps per ms) remains 26/26 properties
Finished probabilistic random walk after 121825 steps, run visited all 26 properties in 766 ms. (steps per millisecond=159 )
Probabilistic random walk after 121825 steps, saw 24599 distinct states, run finished after 776 ms. (steps per millisecond=156 ) properties seen :26
Able to resolve query QuasiLiveness after proving 172 properties.
Starting structural reductions in LIVENESS mode, iteration 0 : 244/244 places, 332/332 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 96 transitions
Trivial Post-agglo rules discarded 96 transitions
Performed 96 trivial Post agglomeration. Transition count delta: 96
Iterating post reduction 0 with 96 rules applied. Total rules applied 96 place count 244 transition count 236
Reduce places removed 96 places and 0 transitions.
Iterating post reduction 1 with 96 rules applied. Total rules applied 192 place count 148 transition count 236
Performed 48 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 48 Pre rules applied. Total rules applied 192 place count 148 transition count 188
Deduced a syphon composed of 48 places in 0 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 2 with 96 rules applied. Total rules applied 288 place count 100 transition count 188
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 312 place count 88 transition count 176
Applied a total of 312 rules in 26 ms. Remains 88 /244 variables (removed 156) and now considering 176/332 (removed 156) transitions.
[2024-05-27 14:35:49] [INFO ] Flow matrix only has 152 transitions (discarded 24 similar events)
// Phase 1: matrix 152 rows 88 cols
[2024-05-27 14:35:49] [INFO ] Computed 15 invariants in 2 ms
[2024-05-27 14:35:49] [INFO ] Implicit Places using invariants in 196 ms returned [81, 82, 83, 84]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 198 ms to find 4 implicit places.
Starting structural reductions in LIVENESS mode, iteration 1 : 84/244 places, 176/332 transitions.
Applied a total of 0 rules in 2 ms. Remains 84 /84 variables (removed 0) and now considering 176/176 (removed 0) transitions.
Finished structural reductions in LIVENESS mode , in 2 iterations and 226 ms. Remains : 84/244 places, 176/332 transitions.
Discarding 4 transitions out of 176. Remains 172
Net is quasi-live, checking if it is reversible to establish liveness.
Unable to solve all queries for examination Liveness. Remains :1 assertions to prove.
Unable to solve all queries for examination Liveness. Remains :172 assertions to prove.
No /home/mcc/execution/Liveness.xml examination file found. Proceeding without properties.
Parsed 172 properties from file /home/mcc/execution/Liveness.xml in 1 ms.
Working with output stream class java.io.PrintStream
Total runtime 65425 ms.
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------
Running Peterson-PT-3
IS_COLORED=
IS_NUPN=1
LOADING model.pnml ...
MODEL CLASS: P/T NET WITH NUPN EXTENSION
PLACES: 244
TRANSITIONS: 332
CONSTANTS: 0
TEMPLATE VARS: 0
ARCS: 1016
NUPN UNITS: 13
LOADING TIME: 0.537
SAVING AS /home/mcc/execution/model.(net/def) ...
exportGspn useExt=true
SAVING TIME: 0.06
SAVING NAME MAP FILE /home/mcc/execution/model.id2name ...
SAVING NUPN UNITS AS FILE /home/mcc/execution/model.nu ...
TOTAL TIME: 1.075
OK.
----------------------------------------------------------------------
GreatSPN/Meddly.
Copyright (C) 1987-2022, University of Torino, Italy.
website: https://github.com/greatspn/SOURCES
Based on MEDDLY version 0.16.0
Copyright (C) 2009, Iowa State University Research Foundation, Inc.
website: http://meddly.sourceforge.net
Process ID: 887
MODEL NAME: /home/mcc/execution/model
244 places, 332 transitions.
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Building monolithic NSF...
FORMULA Liveness FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
Ok.
EXITCODE: 0
----------------------------------------------------------------------
BK_STOP 1716821165076
--------------------
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 Liveness -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="Peterson-PT-3"
export BK_EXAMINATION="Liveness"
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 Peterson-PT-3, examination is Liveness"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r276-smll-171654416100164"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/Peterson-PT-3.tgz
mv Peterson-PT-3 execution
cd execution
if [ "Liveness" = "ReachabilityDeadlock" ] || [ "Liveness" = "UpperBounds" ] || [ "Liveness" = "QuasiLiveness" ] || [ "Liveness" = "StableMarking" ] || [ "Liveness" = "Liveness" ] || [ "Liveness" = "OneSafe" ] || [ "Liveness" = "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 [ "Liveness" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "Liveness" != "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 "Liveness.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property Liveness.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "Liveness.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 [ "Liveness" = "ReachabilityDeadlock" ] || [ "Liveness" = "QuasiLiveness" ] || [ "Liveness" = "StableMarking" ] || [ "Liveness" = "Liveness" ] || [ "Liveness" = "OneSafe" ] ; then
echo "FORMULA_NAME Liveness"
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 ;