Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r154-tall-174876825600379.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2025-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
..................
=====================================================================
Generated by BenchKit 2-5832
Executing tool gold2024
Input is Peterson-PT-3, examination is Liveness
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r154-tall-174876825600379
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.4M
-rw-r--r-- 1 mcc users 40K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 189K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 25K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 120K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 29 14:32 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 25K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 82K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 12K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 45K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 47K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 237K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 58K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 284K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 5.8K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 13K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 2 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 143K May 29 14:32 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

FORMULA_NAME Liveness

=== Now, execution of the tool begins

BK_START 1748844151139

Invoking MCC driver with
BK_TOOL=gold2024
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
[2025-06-02 06:02:32] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, Liveness, -timeout, 180, -rebuildPNML]
[2025-06-02 06:02:32] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-02 06:02:32] [INFO ] Load time of PNML (sax parser for PT used): 84 ms
[2025-06-02 06:02:32] [INFO ] Transformed 244 places.
[2025-06-02 06:02:32] [INFO ] Transformed 332 transitions.
[2025-06-02 06:02:32] [INFO ] Found NUPN structural information;
[2025-06-02 06:02:32] [INFO ] Parsed PT model containing 244 places and 332 transitions and 1016 arcs in 181 ms.
Built sparse matrix representations for Structural reductions in 6 ms.19996KB 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 33 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 46 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 14 ms. Remains 244 /244 variables (removed 0) and now considering 332/332 (removed 0) transitions.
[2025-06-02 06:02:32] [INFO ] Flow matrix only has 308 transitions (discarded 24 similar events)
// Phase 1: matrix 308 rows 244 cols
[2025-06-02 06:02:32] [INFO ] Computed 15 invariants in 16 ms
[2025-06-02 06:02:33] [INFO ] Implicit Places using invariants in 235 ms returned []
[2025-06-02 06:02:33] [INFO ] Flow matrix only has 308 transitions (discarded 24 similar events)
[2025-06-02 06:02:33] [INFO ] Invariant cache hit.
[2025-06-02 06:02:33] [INFO ] State equation strengthened by 57 read => feed constraints.
[2025-06-02 06:02:33] [INFO ] Implicit Places using invariants and state equation in 179 ms returned []
Implicit Place search using SMT with State Equation took 445 ms to find 0 implicit places.
[2025-06-02 06:02:33] [INFO ] Redundant transitions in 17 ms returned []
Running 328 sub problems to find dead transitions.
[2025-06-02 06:02:33] [INFO ] Flow matrix only has 308 transitions (discarded 24 similar events)
[2025-06-02 06:02:33] [INFO ] Invariant cache hit.
[2025-06-02 06:02:33] [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
[2025-06-02 06:02:35] [INFO ] Deduced a trap composed of 17 places in 43 ms of which 7 ms to minimize.
[2025-06-02 06:02:35] [INFO ] Deduced a trap composed of 89 places in 128 ms of which 3 ms to minimize.
[2025-06-02 06:02:35] [INFO ] Deduced a trap composed of 97 places in 65 ms of which 2 ms to minimize.
[2025-06-02 06:02:35] [INFO ] Deduced a trap composed of 53 places in 74 ms of which 1 ms to minimize.
[2025-06-02 06:02:36] [INFO ] Deduced a trap composed of 38 places in 47 ms of which 1 ms to minimize.
[2025-06-02 06:02:36] [INFO ] Deduced a trap composed of 35 places in 41 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
[2025-06-02 06:02:40] [INFO ] Deduced a trap composed of 50 places in 59 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/240 variables, 1/254 constraints. Problems are: Problem set: 0 solved, 328 unsolved
[2025-06-02 06:02:41] [INFO ] Deduced a trap composed of 53 places in 50 ms of which 1 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
[2025-06-02 06:02:46] [INFO ] Deduced a trap composed of 9 places in 72 ms of which 1 ms to minimize.
[2025-06-02 06:02:46] [INFO ] Deduced a trap composed of 34 places in 58 ms of which 1 ms to minimize.
[2025-06-02 06:02:46] [INFO ] Deduced a trap composed of 52 places in 55 ms of which 1 ms to minimize.
[2025-06-02 06:02:46] [INFO ] Deduced a trap composed of 34 places in 47 ms of which 1 ms to minimize.
[2025-06-02 06:02:46] [INFO ] Deduced a trap composed of 52 places in 47 ms of which 1 ms to minimize.
[2025-06-02 06:02:46] [INFO ] Deduced a trap composed of 49 places in 51 ms of which 1 ms to minimize.
[2025-06-02 06:02:46] [INFO ] Deduced a trap composed of 16 places in 69 ms of which 1 ms to minimize.
[2025-06-02 06:02:46] [INFO ] Deduced a trap composed of 45 places in 75 ms of which 1 ms to minimize.
[2025-06-02 06:02:46] [INFO ] Deduced a trap composed of 16 places in 59 ms of which 1 ms to minimize.
[2025-06-02 06:02:46] [INFO ] Deduced a trap composed of 9 places in 56 ms of which 1 ms to minimize.
[2025-06-02 06:02:46] [INFO ] Deduced a trap composed of 27 places in 70 ms of which 2 ms to minimize.
[2025-06-02 06:02:46] [INFO ] Deduced a trap composed of 12 places in 67 ms of which 2 ms to minimize.
[2025-06-02 06:02:47] [INFO ] Deduced a trap composed of 20 places in 59 ms of which 1 ms to minimize.
[2025-06-02 06:02:47] [INFO ] Deduced a trap composed of 45 places in 56 ms of which 2 ms to minimize.
[2025-06-02 06:02:47] [INFO ] Deduced a trap composed of 27 places in 40 ms of which 1 ms to minimize.
[2025-06-02 06:02:47] [INFO ] Deduced a trap composed of 38 places in 42 ms of which 1 ms to minimize.
[2025-06-02 06:02:47] [INFO ] Deduced a trap composed of 38 places in 44 ms of which 1 ms to minimize.
[2025-06-02 06:02:47] [INFO ] Deduced a trap composed of 27 places in 63 ms of which 2 ms to minimize.
[2025-06-02 06:02:47] [INFO ] Deduced a trap composed of 9 places in 59 ms of which 1 ms to minimize.
[2025-06-02 06:02:47] [INFO ] Deduced a trap composed of 29 places in 68 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
[2025-06-02 06:02:47] [INFO ] Deduced a trap composed of 31 places in 71 ms of which 2 ms to minimize.
[2025-06-02 06:02:47] [INFO ] Deduced a trap composed of 13 places in 55 ms of which 1 ms to minimize.
[2025-06-02 06:02:48] [INFO ] Deduced a trap composed of 37 places in 63 ms of which 1 ms to minimize.
[2025-06-02 06:02:48] [INFO ] Deduced a trap composed of 56 places in 52 ms of which 1 ms to minimize.
[2025-06-02 06:02:48] [INFO ] Deduced a trap composed of 81 places in 58 ms of which 1 ms to minimize.
[2025-06-02 06:02:48] [INFO ] Deduced a trap composed of 83 places in 54 ms of which 2 ms to minimize.
[2025-06-02 06:02:48] [INFO ] Deduced a trap composed of 48 places in 48 ms of which 2 ms to minimize.
[2025-06-02 06:02:48] [INFO ] Deduced a trap composed of 45 places in 39 ms of which 1 ms to minimize.
[2025-06-02 06:02:48] [INFO ] Deduced a trap composed of 30 places in 54 ms of which 1 ms to minimize.
[2025-06-02 06:02:48] [INFO ] Deduced a trap composed of 31 places in 52 ms of which 2 ms to minimize.
[2025-06-02 06:02:48] [INFO ] Deduced a trap composed of 61 places in 65 ms of which 1 ms to minimize.
[2025-06-02 06:02:48] [INFO ] Deduced a trap composed of 56 places in 61 ms of which 2 ms to minimize.
[2025-06-02 06:02:48] [INFO ] Deduced a trap composed of 26 places in 64 ms of which 2 ms to minimize.
[2025-06-02 06:02:48] [INFO ] Deduced a trap composed of 49 places in 50 ms of which 1 ms to minimize.
[2025-06-02 06:02:49] [INFO ] Deduced a trap composed of 73 places in 63 ms of which 2 ms to minimize.
[2025-06-02 06:02:49] [INFO ] Deduced a trap composed of 74 places in 58 ms of which 1 ms to minimize.
[2025-06-02 06:02:49] [INFO ] Deduced a trap composed of 49 places in 53 ms of which 1 ms to minimize.
[2025-06-02 06:02:49] [INFO ] Deduced a trap composed of 49 places in 62 ms of which 1 ms to minimize.
[2025-06-02 06:02:49] [INFO ] Deduced a trap composed of 56 places in 52 ms of which 1 ms to minimize.
[2025-06-02 06:02:49] [INFO ] Deduced a trap composed of 86 places in 56 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/244 variables, 20/307 constraints. Problems are: Problem set: 0 solved, 328 unsolved
[2025-06-02 06:02:50] [INFO ] Deduced a trap composed of 45 places in 44 ms of which 1 ms to minimize.
[2025-06-02 06:02:50] [INFO ] Deduced a trap composed of 56 places in 51 ms of which 1 ms to minimize.
[2025-06-02 06:02:50] [INFO ] Deduced a trap composed of 69 places in 59 ms of which 1 ms to minimize.
[2025-06-02 06:02:50] [INFO ] Deduced a trap composed of 73 places in 55 ms of which 2 ms to minimize.
[2025-06-02 06:02:50] [INFO ] Deduced a trap composed of 38 places in 44 ms of which 1 ms to minimize.
[2025-06-02 06:02:51] [INFO ] Deduced a trap composed of 30 places in 61 ms of which 1 ms to minimize.
[2025-06-02 06:02:51] [INFO ] Deduced a trap composed of 13 places in 59 ms of which 1 ms to minimize.
[2025-06-02 06:02:51] [INFO ] Deduced a trap composed of 38 places in 60 ms of which 1 ms to minimize.
[2025-06-02 06:02:51] [INFO ] Deduced a trap composed of 20 places in 38 ms of which 1 ms to minimize.
[2025-06-02 06:02:51] [INFO ] Deduced a trap composed of 42 places in 48 ms of which 1 ms to minimize.
[2025-06-02 06:02:51] [INFO ] Deduced a trap composed of 27 places in 63 ms of which 1 ms to minimize.
[2025-06-02 06:02:51] [INFO ] Deduced a trap composed of 50 places in 51 ms of which 1 ms to minimize.
[2025-06-02 06:02:52] [INFO ] Deduced a trap composed of 20 places in 66 ms of which 2 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/244 variables, 13/320 constraints. Problems are: Problem set: 0 solved, 328 unsolved
[2025-06-02 06:02:55] [INFO ] Deduced a trap composed of 49 places in 67 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/244 variables, 1/321 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/244 variables, 0/321 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 15 (OVERLAPS) 308/552 variables, 244/565 constraints. Problems are: Problem set: 0 solved, 328 unsolved
SMT process timed out in 30115ms, After SMT, problems are : Problem set: 0 solved, 328 unsolved
Search for dead transitions found 0 dead transitions in 30129ms
Finished structural reductions in DEADLOCK mode , in 1 iterations and 30618 ms. Remains : 244/244 places, 332/332 transitions.
Random walk for 1250000 steps, including 0 resets, run took 1304 ms (no deadlock found). (steps per millisecond=958 )
Random directed walk for 1250000 steps, including 0 resets, run took 1389 ms (no deadlock found). (steps per millisecond=899 )
[2025-06-02 06:03:06] [INFO ] Flow matrix only has 308 transitions (discarded 24 similar events)
[2025-06-02 06:03:06] [INFO ] Invariant cache hit.
[2025-06-02 06:03:06] [INFO ] [Real]Absence check using 11 positive place invariants in 6 ms returned sat
[2025-06-02 06:03:06] [INFO ] [Real]Absence check using 11 positive and 4 generalized place invariants in 11 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 36 ms. Remains 88 /244 variables (removed 156) and now considering 176/332 (removed 156) transitions.
[2025-06-02 06:03:06] [INFO ] Flow matrix only has 152 transitions (discarded 24 similar events)
// Phase 1: matrix 152 rows 88 cols
[2025-06-02 06:03:06] [INFO ] Computed 15 invariants in 5 ms
[2025-06-02 06:03:06] [INFO ] Implicit Places using invariants in 115 ms returned [81, 82, 83, 84]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 117 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 1 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 154 ms. Remains : 84/244 places, 176/332 transitions.
Discarding 4 transitions out of 176. Remains 172
RANDOM walk for 40000 steps (8 resets) in 1562 ms. (25 steps per ms) remains 45/172 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 44/45 properties
BEST_FIRST walk for 4004 steps (8 resets) in 32 ms. (121 steps per ms) remains 42/44 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 36/42 properties
BEST_FIRST walk for 4004 steps (8 resets) in 43 ms. (91 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 34/36 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 32/34 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (8 resets) in 8 ms. (444 steps per ms) remains 31/32 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 12 ms. (308 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 10 ms. (364 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 9 ms. (400 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 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 19 ms. (200 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (8 resets) in 8 ms. (444 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (8 resets) in 9 ms. (400 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
BEST_FIRST walk for 4004 steps (8 resets) in 9 ms. (400 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (8 resets) in 8 ms. (444 steps per ms) remains 30/31 properties
BEST_FIRST walk for 4004 steps (8 resets) in 8 ms. (444 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 9 ms. (400 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 30/30 properties
[2025-06-02 06:03:07] [INFO ] Flow matrix only has 152 transitions (discarded 24 similar events)
// Phase 1: matrix 152 rows 84 cols
[2025-06-02 06:03:07] [INFO ] Computed 11 invariants in 0 ms
[2025-06-02 06:03:07] [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, 30 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/38 variables, 2/40 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/38 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 3 (OVERLAPS) 45/83 variables, 8/48 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/83 variables, 45/93 constraints. Problems are: Problem set: 0 solved, 30 unsolved
[2025-06-02 06:03:07] [INFO ] Deduced a trap composed of 7 places in 36 ms of which 1 ms to minimize.
[2025-06-02 06:03:07] [INFO ] Deduced a trap composed of 18 places in 42 ms of which 1 ms to minimize.
[2025-06-02 06:03:07] [INFO ] Deduced a trap composed of 8 places in 20 ms of which 0 ms to minimize.
[2025-06-02 06:03:07] [INFO ] Deduced a trap composed of 12 places in 33 ms of which 1 ms to minimize.
[2025-06-02 06:03:07] [INFO ] Deduced a trap composed of 7 places in 33 ms of which 0 ms to minimize.
[2025-06-02 06:03:07] [INFO ] Deduced a trap composed of 7 places in 32 ms of which 1 ms to minimize.
[2025-06-02 06:03:07] [INFO ] Deduced a trap composed of 19 places in 36 ms of which 1 ms to minimize.
[2025-06-02 06:03:07] [INFO ] Deduced a trap composed of 19 places in 35 ms of which 1 ms to minimize.
[2025-06-02 06:03:07] [INFO ] Deduced a trap composed of 14 places in 31 ms of which 0 ms to minimize.
[2025-06-02 06:03:07] [INFO ] Deduced a trap composed of 14 places in 30 ms of which 0 ms to minimize.
[2025-06-02 06:03:07] [INFO ] Deduced a trap composed of 22 places in 31 ms of which 0 ms to minimize.
[2025-06-02 06:03:07] [INFO ] Deduced a trap composed of 8 places in 20 ms of which 0 ms to minimize.
[2025-06-02 06:03:07] [INFO ] Deduced a trap composed of 21 places in 32 ms of which 1 ms to minimize.
[2025-06-02 06:03:07] [INFO ] Deduced a trap composed of 7 places in 32 ms of which 1 ms to minimize.
[2025-06-02 06:03:07] [INFO ] Deduced a trap composed of 19 places in 23 ms of which 1 ms to minimize.
[2025-06-02 06:03:07] [INFO ] Deduced a trap composed of 12 places in 29 ms of which 1 ms to minimize.
[2025-06-02 06:03:07] [INFO ] Deduced a trap composed of 14 places in 25 ms of which 1 ms to minimize.
[2025-06-02 06:03:07] [INFO ] Deduced a trap composed of 17 places in 25 ms of which 0 ms to minimize.
[2025-06-02 06:03:07] [INFO ] Deduced a trap composed of 10 places in 31 ms of which 1 ms to minimize.
[2025-06-02 06:03:07] [INFO ] Deduced a trap composed of 17 places in 28 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/83 variables, 20/113 constraints. Problems are: Problem set: 0 solved, 30 unsolved
[2025-06-02 06:03:08] [INFO ] Deduced a trap composed of 9 places in 27 ms of which 0 ms to minimize.
[2025-06-02 06:03:08] [INFO ] Deduced a trap composed of 8 places in 22 ms of which 0 ms to minimize.
[2025-06-02 06:03:08] [INFO ] Deduced a trap composed of 14 places in 35 ms of which 1 ms to minimize.
[2025-06-02 06:03:08] [INFO ] Deduced a trap composed of 13 places in 28 ms of which 1 ms to minimize.
[2025-06-02 06:03:08] [INFO ] Deduced a trap composed of 17 places in 54 ms of which 0 ms to minimize.
[2025-06-02 06:03:08] [INFO ] Deduced a trap composed of 25 places in 47 ms of which 1 ms to minimize.
[2025-06-02 06:03:08] [INFO ] Deduced a trap composed of 12 places in 25 ms of which 0 ms to minimize.
[2025-06-02 06:03:08] [INFO ] Deduced a trap composed of 9 places in 45 ms of which 0 ms to minimize.
[2025-06-02 06:03:08] [INFO ] Deduced a trap composed of 17 places in 42 ms of which 1 ms to minimize.
[2025-06-02 06:03:08] [INFO ] Deduced a trap composed of 17 places in 38 ms of which 1 ms to minimize.
[2025-06-02 06:03:08] [INFO ] Deduced a trap composed of 12 places in 53 ms of which 1 ms to minimize.
[2025-06-02 06:03:08] [INFO ] Deduced a trap composed of 18 places in 41 ms of which 1 ms to minimize.
[2025-06-02 06:03:08] [INFO ] Deduced a trap composed of 18 places in 23 ms of which 0 ms to minimize.
[2025-06-02 06:03:08] [INFO ] Deduced a trap composed of 20 places in 39 ms of which 0 ms to minimize.
[2025-06-02 06:03:08] [INFO ] Deduced a trap composed of 24 places in 31 ms of which 1 ms to minimize.
[2025-06-02 06:03:08] [INFO ] Deduced a trap composed of 13 places in 38 ms of which 0 ms to minimize.
[2025-06-02 06:03:08] [INFO ] Deduced a trap composed of 15 places in 44 ms of which 1 ms to minimize.
[2025-06-02 06:03:08] [INFO ] Deduced a trap composed of 25 places in 33 ms of which 1 ms to minimize.
[2025-06-02 06:03:08] [INFO ] Deduced a trap composed of 13 places in 56 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/83 variables, 19/132 constraints. Problems are: Problem set: 0 solved, 30 unsolved
[2025-06-02 06:03:09] [INFO ] Deduced a trap composed of 19 places in 30 ms of which 0 ms to minimize.
[2025-06-02 06:03:09] [INFO ] Deduced a trap composed of 18 places in 37 ms of which 1 ms to minimize.
[2025-06-02 06:03:09] [INFO ] Deduced a trap composed of 25 places in 30 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/83 variables, 3/135 constraints. Problems are: Problem set: 0 solved, 30 unsolved
[2025-06-02 06:03:09] [INFO ] Deduced a trap composed of 26 places in 42 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/83 variables, 1/136 constraints. Problems are: Problem set: 0 solved, 30 unsolved
[2025-06-02 06:03:09] [INFO ] Deduced a trap composed of 9 places in 22 ms of which 0 ms to minimize.
[2025-06-02 06:03:09] [INFO ] Deduced a trap composed of 13 places in 45 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/83 variables, 2/138 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/83 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 11 (OVERLAPS) 1/84 variables, 1/139 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/84 variables, 1/140 constraints. Problems are: Problem set: 0 solved, 30 unsolved
[2025-06-02 06:03:09] [INFO ] Deduced a trap composed of 26 places in 35 ms of which 1 ms to minimize.
[2025-06-02 06:03:09] [INFO ] Deduced a trap composed of 25 places in 30 ms of which 0 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/84 variables, 2/142 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/84 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 15 (OVERLAPS) 152/236 variables, 84/226 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/236 variables, 57/283 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/236 variables, 0/283 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 18 (OVERLAPS) 0/236 variables, 0/283 constraints. Problems are: Problem set: 0 solved, 30 unsolved
No progress, stopping.
After SMT solving in domain Real declared 236/236 variables, and 283 constraints, problems are : Problem set: 0 solved, 30 unsolved in 4269 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: 30/30 constraints, Known Traps: 47/47 constraints]
Escalating to Integer solving :Problem set: 0 solved, 30 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/38 variables, 38/38 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/38 variables, 2/40 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/38 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 3 (OVERLAPS) 45/83 variables, 8/48 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/83 variables, 45/93 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/83 variables, 47/140 constraints. Problems are: Problem set: 0 solved, 30 unsolved
[2025-06-02 06:03:11] [INFO ] Deduced a trap composed of 19 places in 24 ms of which 1 ms to minimize.
[2025-06-02 06:03:11] [INFO ] Deduced a trap composed of 9 places in 48 ms of which 1 ms to minimize.
[2025-06-02 06:03:11] [INFO ] Deduced a trap composed of 18 places in 48 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/83 variables, 3/143 constraints. Problems are: Problem set: 0 solved, 30 unsolved
[2025-06-02 06:03:11] [INFO ] Deduced a trap composed of 21 places in 42 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/83 variables, 1/144 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/83 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 9 (OVERLAPS) 1/84 variables, 1/145 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/84 variables, 1/146 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/84 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 12 (OVERLAPS) 152/236 variables, 84/230 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/236 variables, 57/287 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/236 variables, 30/317 constraints. Problems are: Problem set: 0 solved, 30 unsolved
[2025-06-02 06:03:12] [INFO ] Deduced a trap composed of 22 places in 44 ms of which 0 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/236 variables, 1/318 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/236 variables, 0/318 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 17 (OVERLAPS) 0/236 variables, 0/318 constraints. Problems are: Problem set: 0 solved, 30 unsolved
No progress, stopping.
After SMT solving in domain Int declared 236/236 variables, and 318 constraints, problems are : Problem set: 0 solved, 30 unsolved in 2606 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: 30/30 constraints, Known Traps: 52/52 constraints]
After SMT, in 6898ms problems are : Problem set: 0 solved, 30 unsolved
Parikh walk visited 4 properties in 953 ms.
Support contains 35 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 5 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 5 ms. Remains : 84/84 places, 176/176 transitions.
RANDOM walk for 4000000 steps (8 resets) in 16107 ms. (248 steps per ms) remains 26/26 properties
BEST_FIRST walk for 400004 steps (8 resets) in 373 ms. (1069 steps per ms) remains 26/26 properties
BEST_FIRST walk for 400004 steps (8 resets) in 360 ms. (1108 steps per ms) remains 26/26 properties
BEST_FIRST walk for 400004 steps (8 resets) in 360 ms. (1108 steps per ms) remains 26/26 properties
BEST_FIRST walk for 400004 steps (8 resets) in 364 ms. (1095 steps per ms) remains 26/26 properties
BEST_FIRST walk for 400004 steps (8 resets) in 367 ms. (1086 steps per ms) remains 26/26 properties
BEST_FIRST walk for 400004 steps (8 resets) in 363 ms. (1098 steps per ms) remains 26/26 properties
BEST_FIRST walk for 400004 steps (8 resets) in 369 ms. (1081 steps per ms) remains 26/26 properties
BEST_FIRST walk for 400004 steps (8 resets) in 371 ms. (1075 steps per ms) remains 26/26 properties
BEST_FIRST walk for 400004 steps (8 resets) in 373 ms. (1069 steps per ms) remains 26/26 properties
BEST_FIRST walk for 400004 steps (8 resets) in 380 ms. (1049 steps per ms) remains 26/26 properties
BEST_FIRST walk for 400004 steps (8 resets) in 375 ms. (1063 steps per ms) remains 26/26 properties
BEST_FIRST walk for 400004 steps (8 resets) in 373 ms. (1069 steps per ms) remains 26/26 properties
BEST_FIRST walk for 400004 steps (8 resets) in 378 ms. (1055 steps per ms) remains 26/26 properties
BEST_FIRST walk for 400004 steps (8 resets) in 372 ms. (1072 steps per ms) remains 26/26 properties
BEST_FIRST walk for 400004 steps (8 resets) in 373 ms. (1069 steps per ms) remains 26/26 properties
BEST_FIRST walk for 400004 steps (8 resets) in 375 ms. (1063 steps per ms) remains 25/26 properties
BEST_FIRST walk for 400004 steps (8 resets) in 368 ms. (1084 steps per ms) remains 25/25 properties
BEST_FIRST walk for 400004 steps (8 resets) in 371 ms. (1075 steps per ms) remains 25/25 properties
BEST_FIRST walk for 400004 steps (8 resets) in 374 ms. (1066 steps per ms) remains 25/25 properties
BEST_FIRST walk for 400004 steps (8 resets) in 394 ms. (1012 steps per ms) remains 25/25 properties
BEST_FIRST walk for 400004 steps (8 resets) in 379 ms. (1052 steps per ms) remains 25/25 properties
BEST_FIRST walk for 400004 steps (8 resets) in 402 ms. (992 steps per ms) remains 25/25 properties
BEST_FIRST walk for 400004 steps (8 resets) in 371 ms. (1075 steps per ms) remains 25/25 properties
BEST_FIRST walk for 400004 steps (8 resets) in 369 ms. (1081 steps per ms) remains 25/25 properties
BEST_FIRST walk for 400004 steps (8 resets) in 429 ms. (930 steps per ms) remains 25/25 properties
Finished probabilistic random walk after 121825 steps, run visited all 25 properties in 641 ms. (steps per millisecond=190 )
Probabilistic random walk after 121825 steps, saw 24599 distinct states, run finished after 644 ms. (steps per millisecond=189 ) properties seen :25
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 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 9 ms. Remains 88 /244 variables (removed 156) and now considering 176/332 (removed 156) transitions.
[2025-06-02 06:03:22] [INFO ] Flow matrix only has 152 transitions (discarded 24 similar events)
// Phase 1: matrix 152 rows 88 cols
[2025-06-02 06:03:22] [INFO ] Computed 15 invariants in 2 ms
[2025-06-02 06:03:22] [INFO ] Implicit Places using invariants in 88 ms returned [81, 82, 83, 84]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 89 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 100 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 50440 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.317

SAVING AS /home/mcc/execution/model.(net/def) ...
exportGspn useExt=true
SAVING TIME: 0.026
SAVING NAME MAP FILE /home/mcc/execution/model.id2name ...
SAVING NUPN UNITS AS FILE /home/mcc/execution/model.nu ...
TOTAL TIME: 0.547
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: 904
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 1748844755787

--------------------
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="gold2024"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="1800"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5832"
echo " Executing tool gold2024"
echo " Input is 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 r154-tall-174876825600379"
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.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 '' Liveness.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
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 ;