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.r468-smll-171620166900087.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 ltsminxred
Input is AutoFlight-PT-02b, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r468-smll-171620166900087
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 576K
-rw-r--r-- 1 mcc users 8.0K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 89K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.0K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 57K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.8K Apr 22 14:28 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 22 14:28 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 22 14:28 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 22 14:28 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K Apr 12 22:24 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 164K Apr 12 22:24 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.5K Apr 12 22:23 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 75K Apr 12 22:23 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 22 14:28 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:28 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 48K May 18 16:42 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME AutoFlight-PT-02b-ReachabilityFireability-2024-00
FORMULA_NAME AutoFlight-PT-02b-ReachabilityFireability-2024-01
FORMULA_NAME AutoFlight-PT-02b-ReachabilityFireability-2024-02
FORMULA_NAME AutoFlight-PT-02b-ReachabilityFireability-2024-03
FORMULA_NAME AutoFlight-PT-02b-ReachabilityFireability-2024-04
FORMULA_NAME AutoFlight-PT-02b-ReachabilityFireability-2024-05
FORMULA_NAME AutoFlight-PT-02b-ReachabilityFireability-2024-06
FORMULA_NAME AutoFlight-PT-02b-ReachabilityFireability-2024-07
FORMULA_NAME AutoFlight-PT-02b-ReachabilityFireability-2024-08
FORMULA_NAME AutoFlight-PT-02b-ReachabilityFireability-2024-09
FORMULA_NAME AutoFlight-PT-02b-ReachabilityFireability-2024-10
FORMULA_NAME AutoFlight-PT-02b-ReachabilityFireability-2024-11
FORMULA_NAME AutoFlight-PT-02b-ReachabilityFireability-2024-12
FORMULA_NAME AutoFlight-PT-02b-ReachabilityFireability-2024-13
FORMULA_NAME AutoFlight-PT-02b-ReachabilityFireability-2024-14
FORMULA_NAME AutoFlight-PT-02b-ReachabilityFireability-2024-15

=== Now, execution of the tool begins

BK_START 1717183515609

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=AutoFlight-PT-02b
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-05-31 19:25:17] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2024-05-31 19:25:17] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-31 19:25:18] [INFO ] Load time of PNML (sax parser for PT used): 169 ms
[2024-05-31 19:25:18] [INFO ] Transformed 206 places.
[2024-05-31 19:25:18] [INFO ] Transformed 204 transitions.
[2024-05-31 19:25:18] [INFO ] Found NUPN structural information;
[2024-05-31 19:25:18] [INFO ] Parsed PT model containing 206 places and 204 transitions and 478 arcs in 498 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 38 ms.
Working with output stream class java.io.PrintStream
RANDOM walk for 40000 steps (351 resets) in 2268 ms. (17 steps per ms) remains 11/16 properties
FORMULA AutoFlight-PT-02b-ReachabilityFireability-2024-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-02b-ReachabilityFireability-2024-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-02b-ReachabilityFireability-2024-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-02b-ReachabilityFireability-2024-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-02b-ReachabilityFireability-2024-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40003 steps (46 resets) in 375 ms. (106 steps per ms) remains 10/11 properties
FORMULA AutoFlight-PT-02b-ReachabilityFireability-2024-00 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40003 steps (45 resets) in 575 ms. (69 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (68 resets) in 579 ms. (68 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (43 resets) in 192 ms. (207 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (45 resets) in 749 ms. (53 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (44 resets) in 125 ms. (317 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (43 resets) in 151 ms. (263 steps per ms) remains 9/10 properties
FORMULA AutoFlight-PT-02b-ReachabilityFireability-2024-10 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40002 steps (43 resets) in 50 ms. (784 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (44 resets) in 77 ms. (512 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (45 resets) in 112 ms. (354 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (60 resets) in 205 ms. (194 steps per ms) remains 9/9 properties
// Phase 1: matrix 204 rows 206 cols
[2024-05-31 19:25:20] [INFO ] Computed 16 invariants in 20 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/123 variables, 123/123 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/123 variables, 1/124 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/123 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (OVERLAPS) 77/200 variables, 14/138 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/200 variables, 77/215 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/200 variables, 0/215 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (OVERLAPS) 6/206 variables, 1/216 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/206 variables, 6/222 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/206 variables, 0/222 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 9 (OVERLAPS) 204/410 variables, 206/428 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/410 variables, 0/428 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 11 (OVERLAPS) 0/410 variables, 0/428 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Real declared 410/410 variables, and 428 constraints, problems are : Problem set: 0 solved, 9 unsolved in 2009 ms.
Refiners :[Domain max(s): 206/206 constraints, Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 206/206 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 9 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/123 variables, 123/123 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/123 variables, 1/124 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/123 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 9 unsolved
Problem AutoFlight-PT-02b-ReachabilityFireability-2024-05 is UNSAT
FORMULA AutoFlight-PT-02b-ReachabilityFireability-2024-05 TRUE TECHNIQUES SMT_REFINEMENT
Problem AutoFlight-PT-02b-ReachabilityFireability-2024-15 is UNSAT
FORMULA AutoFlight-PT-02b-ReachabilityFireability-2024-15 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 3 (OVERLAPS) 77/200 variables, 14/138 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/200 variables, 77/215 constraints. Problems are: Problem set: 2 solved, 7 unsolved
[2024-05-31 19:25:23] [INFO ] Deduced a trap composed of 30 places in 112 ms of which 29 ms to minimize.
[2024-05-31 19:25:23] [INFO ] Deduced a trap composed of 31 places in 110 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/200 variables, 2/217 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/200 variables, 0/217 constraints. Problems are: Problem set: 2 solved, 7 unsolved
Problem AutoFlight-PT-02b-ReachabilityFireability-2024-06 is UNSAT
FORMULA AutoFlight-PT-02b-ReachabilityFireability-2024-06 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 7 (OVERLAPS) 6/206 variables, 1/218 constraints. Problems are: Problem set: 3 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/206 variables, 6/224 constraints. Problems are: Problem set: 3 solved, 6 unsolved
[2024-05-31 19:25:23] [INFO ] Deduced a trap composed of 37 places in 136 ms of which 4 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/206 variables, 1/225 constraints. Problems are: Problem set: 3 solved, 6 unsolved
[2024-05-31 19:25:23] [INFO ] Deduced a trap composed of 30 places in 129 ms of which 3 ms to minimize.
[2024-05-31 19:25:24] [INFO ] Deduced a trap composed of 37 places in 144 ms of which 3 ms to minimize.
[2024-05-31 19:25:24] [INFO ] Deduced a trap composed of 49 places in 116 ms of which 3 ms to minimize.
[2024-05-31 19:25:24] [INFO ] Deduced a trap composed of 35 places in 89 ms of which 3 ms to minimize.
[2024-05-31 19:25:24] [INFO ] Deduced a trap composed of 39 places in 103 ms of which 3 ms to minimize.
[2024-05-31 19:25:24] [INFO ] Deduced a trap composed of 19 places in 99 ms of which 3 ms to minimize.
[2024-05-31 19:25:24] [INFO ] Deduced a trap composed of 27 places in 108 ms of which 4 ms to minimize.
[2024-05-31 19:25:24] [INFO ] Deduced a trap composed of 33 places in 67 ms of which 2 ms to minimize.
[2024-05-31 19:25:24] [INFO ] Deduced a trap composed of 45 places in 101 ms of which 4 ms to minimize.
[2024-05-31 19:25:24] [INFO ] Deduced a trap composed of 43 places in 92 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/206 variables, 10/235 constraints. Problems are: Problem set: 3 solved, 6 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/206 variables, 0/235 constraints. Problems are: Problem set: 3 solved, 6 unsolved
At refinement iteration 12 (OVERLAPS) 204/410 variables, 206/441 constraints. Problems are: Problem set: 3 solved, 6 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/410 variables, 6/447 constraints. Problems are: Problem set: 3 solved, 6 unsolved
[2024-05-31 19:25:25] [INFO ] Deduced a trap composed of 31 places in 53 ms of which 2 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/410 variables, 1/448 constraints. Problems are: Problem set: 3 solved, 6 unsolved
[2024-05-31 19:25:26] [INFO ] Deduced a trap composed of 29 places in 46 ms of which 2 ms to minimize.
[2024-05-31 19:25:26] [INFO ] Deduced a trap composed of 40 places in 81 ms of which 3 ms to minimize.
[2024-05-31 19:25:26] [INFO ] Deduced a trap composed of 44 places in 104 ms of which 3 ms to minimize.
[2024-05-31 19:25:26] [INFO ] Deduced a trap composed of 52 places in 106 ms of which 3 ms to minimize.
[2024-05-31 19:25:26] [INFO ] Deduced a trap composed of 28 places in 53 ms of which 2 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/410 variables, 5/453 constraints. Problems are: Problem set: 3 solved, 6 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/410 variables, 0/453 constraints. Problems are: Problem set: 3 solved, 6 unsolved
At refinement iteration 17 (OVERLAPS) 0/410 variables, 0/453 constraints. Problems are: Problem set: 3 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 410/410 variables, and 453 constraints, problems are : Problem set: 3 solved, 6 unsolved in 5010 ms.
Refiners :[Domain max(s): 206/206 constraints, Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 206/206 constraints, PredecessorRefiner: 6/9 constraints, Known Traps: 19/19 constraints]
After SMT, in 7232ms problems are : Problem set: 3 solved, 6 unsolved
Fused 6 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 987 ms.
Support contains 78 out of 206 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 206/206 places, 204/204 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 17 transitions
Trivial Post-agglo rules discarded 17 transitions
Performed 17 trivial Post agglomeration. Transition count delta: 17
Iterating post reduction 0 with 17 rules applied. Total rules applied 17 place count 206 transition count 187
Reduce places removed 17 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: 17
Iterating post reduction 1 with 35 rules applied. Total rules applied 52 place count 189 transition count 169
Reduce places removed 17 places and 0 transitions.
Iterating post reduction 2 with 17 rules applied. Total rules applied 69 place count 172 transition count 169
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 11 Pre rules applied. Total rules applied 69 place count 172 transition count 158
Deduced a syphon composed of 11 places in 2 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 3 with 22 rules applied. Total rules applied 91 place count 161 transition count 158
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 98 place count 154 transition count 151
Iterating global reduction 3 with 7 rules applied. Total rules applied 105 place count 154 transition count 151
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Deduced a syphon composed of 11 places in 1 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 3 with 22 rules applied. Total rules applied 127 place count 143 transition count 140
Drop transitions (Redundant composition of simpler transitions.) removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 3 with 7 rules applied. Total rules applied 134 place count 143 transition count 133
Free-agglomeration rule applied 3 times.
Iterating global reduction 3 with 3 rules applied. Total rules applied 137 place count 143 transition count 130
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 140 place count 140 transition count 130
Applied a total of 140 rules in 133 ms. Remains 140 /206 variables (removed 66) and now considering 130/204 (removed 74) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 172 ms. Remains : 140/206 places, 130/204 transitions.
RANDOM walk for 40000 steps (517 resets) in 580 ms. (68 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (76 resets) in 275 ms. (144 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (72 resets) in 302 ms. (132 steps per ms) remains 5/6 properties
FORMULA AutoFlight-PT-02b-ReachabilityFireability-2024-12 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40003 steps (75 resets) in 85 ms. (465 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (74 resets) in 120 ms. (330 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (73 resets) in 150 ms. (264 steps per ms) remains 5/5 properties
// Phase 1: matrix 130 rows 140 cols
[2024-05-31 19:25:29] [INFO ] Computed 16 invariants in 13 ms
[2024-05-31 19:25:29] [INFO ] State equation strengthened by 1 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/77 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 55/132 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/132 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 8/140 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/140 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 130/270 variables, 140/156 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/270 variables, 1/157 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/270 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (OVERLAPS) 0/270 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 270/270 variables, and 157 constraints, problems are : Problem set: 0 solved, 5 unsolved in 463 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 140/140 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/77 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 55/132 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-31 19:25:29] [INFO ] Deduced a trap composed of 23 places in 43 ms of which 1 ms to minimize.
[2024-05-31 19:25:30] [INFO ] Deduced a trap composed of 18 places in 37 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/132 variables, 2/17 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/132 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (OVERLAPS) 8/140 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-31 19:25:30] [INFO ] Deduced a trap composed of 34 places in 97 ms of which 3 ms to minimize.
[2024-05-31 19:25:30] [INFO ] Deduced a trap composed of 16 places in 78 ms of which 2 ms to minimize.
[2024-05-31 19:25:30] [INFO ] Deduced a trap composed of 20 places in 65 ms of which 1 ms to minimize.
[2024-05-31 19:25:30] [INFO ] Deduced a trap composed of 19 places in 39 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/140 variables, 4/22 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/140 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 130/270 variables, 140/162 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/270 variables, 1/163 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/270 variables, 5/168 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-31 19:25:30] [INFO ] Deduced a trap composed of 23 places in 36 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/270 variables, 1/169 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-31 19:25:31] [INFO ] Deduced a trap composed of 16 places in 48 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/270 variables, 1/170 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-31 19:25:31] [INFO ] Deduced a trap composed of 19 places in 40 ms of which 1 ms to minimize.
[2024-05-31 19:25:31] [INFO ] Deduced a trap composed of 13 places in 32 ms of which 2 ms to minimize.
[2024-05-31 19:25:31] [INFO ] Deduced a trap composed of 22 places in 58 ms of which 2 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/270 variables, 3/173 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/270 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (OVERLAPS) 0/270 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 270/270 variables, and 173 constraints, problems are : Problem set: 0 solved, 5 unsolved in 2301 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 140/140 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 11/11 constraints]
After SMT, in 2812ms problems are : Problem set: 0 solved, 5 unsolved
FORMULA AutoFlight-PT-02b-ReachabilityFireability-2024-14 FALSE TECHNIQUES PARIKH_WALK
FORMULA AutoFlight-PT-02b-ReachabilityFireability-2024-09 TRUE TECHNIQUES PARIKH_WALK
Parikh walk visited 2 properties in 2000 ms.
Support contains 66 out of 140 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 140/140 places, 130/130 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 140 transition count 128
Reduce places removed 2 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 5 rules applied. Total rules applied 7 place count 138 transition count 125
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 10 place count 135 transition count 125
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 10 place count 135 transition count 122
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 16 place count 132 transition count 122
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 10 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 24 place count 128 transition count 118
Applied a total of 24 rules in 43 ms. Remains 128 /140 variables (removed 12) and now considering 118/130 (removed 12) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 43 ms. Remains : 128/140 places, 118/130 transitions.
RANDOM walk for 40000 steps (593 resets) in 162 ms. (245 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (84 resets) in 130 ms. (305 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (82 resets) in 125 ms. (317 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (83 resets) in 41 ms. (952 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 860044 steps, run timeout after 3001 ms. (steps per millisecond=286 ) properties seen :0 out of 3
Probabilistic random walk after 860044 steps, saw 153259 distinct states, run finished after 3020 ms. (steps per millisecond=284 ) properties seen :0
// Phase 1: matrix 118 rows 128 cols
[2024-05-31 19:25:37] [INFO ] Computed 16 invariants in 8 ms
[2024-05-31 19:25:37] [INFO ] State equation strengthened by 1 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/66 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 54/120 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/120 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 8/128 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/128 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 118/246 variables, 128/144 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/246 variables, 1/145 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/246 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 0/246 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 246/246 variables, and 145 constraints, problems are : Problem set: 0 solved, 3 unsolved in 255 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 128/128 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/66 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 54/120 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-31 19:25:37] [INFO ] Deduced a trap composed of 11 places in 39 ms of which 1 ms to minimize.
[2024-05-31 19:25:37] [INFO ] Deduced a trap composed of 22 places in 60 ms of which 2 ms to minimize.
[2024-05-31 19:25:37] [INFO ] Deduced a trap composed of 17 places in 37 ms of which 1 ms to minimize.
[2024-05-31 19:25:37] [INFO ] Deduced a trap composed of 11 places in 30 ms of which 2 ms to minimize.
[2024-05-31 19:25:38] [INFO ] Deduced a trap composed of 15 places in 39 ms of which 8 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/120 variables, 5/20 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/120 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 8/128 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-31 19:25:38] [INFO ] Deduced a trap composed of 17 places in 36 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/128 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-31 19:25:38] [INFO ] Deduced a trap composed of 29 places in 70 ms of which 1 ms to minimize.
[2024-05-31 19:25:38] [INFO ] Deduced a trap composed of 31 places in 63 ms of which 2 ms to minimize.
[2024-05-31 19:25:38] [INFO ] Deduced a trap composed of 27 places in 45 ms of which 1 ms to minimize.
[2024-05-31 19:25:38] [INFO ] Deduced a trap composed of 19 places in 50 ms of which 3 ms to minimize.
[2024-05-31 19:25:38] [INFO ] Deduced a trap composed of 16 places in 41 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/128 variables, 5/27 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-31 19:25:38] [INFO ] Deduced a trap composed of 18 places in 51 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/128 variables, 1/28 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/128 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 118/246 variables, 128/156 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/246 variables, 1/157 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/246 variables, 3/160 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/246 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 0/246 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 246/246 variables, and 160 constraints, problems are : Problem set: 0 solved, 3 unsolved in 1262 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 128/128 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 12/12 constraints]
After SMT, in 1546ms problems are : Problem set: 0 solved, 3 unsolved
FORMULA AutoFlight-PT-02b-ReachabilityFireability-2024-02 TRUE TECHNIQUES PARIKH_WALK
Parikh walk visited 1 properties in 406 ms.
Support contains 40 out of 128 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 128/128 places, 118/118 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 128 transition count 114
Reduce places removed 4 places and 0 transitions.
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Iterating post reduction 1 with 11 rules applied. Total rules applied 15 place count 124 transition count 107
Reduce places removed 7 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 23 place count 117 transition count 106
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 23 place count 117 transition count 100
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 35 place count 111 transition count 100
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 36 place count 110 transition count 99
Iterating global reduction 3 with 1 rules applied. Total rules applied 37 place count 110 transition count 99
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 49 place count 104 transition count 93
Free-agglomeration rule applied 5 times.
Iterating global reduction 3 with 5 rules applied. Total rules applied 54 place count 104 transition count 88
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 59 place count 99 transition count 88
Applied a total of 59 rules in 24 ms. Remains 99 /128 variables (removed 29) and now considering 88/118 (removed 30) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 24 ms. Remains : 99/128 places, 88/118 transitions.
RANDOM walk for 40000 steps (567 resets) in 115 ms. (344 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (90 resets) in 140 ms. (283 steps per ms) remains 1/2 properties
FORMULA AutoFlight-PT-02b-ReachabilityFireability-2024-08 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40001 steps (122 resets) in 33 ms. (1176 steps per ms) remains 1/1 properties
// Phase 1: matrix 88 rows 99 cols
[2024-05-31 19:25:39] [INFO ] Computed 16 invariants in 1 ms
[2024-05-31 19:25:39] [INFO ] State equation strengthened by 8 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 24/29 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/29 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 60/89 variables, 11/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/89 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 10/99 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/99 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 88/187 variables, 99/115 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/187 variables, 8/123 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/187 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/187 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 187/187 variables, and 123 constraints, problems are : Problem set: 0 solved, 1 unsolved in 106 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 99/99 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 24/29 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/29 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 60/89 variables, 11/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-31 19:25:39] [INFO ] Deduced a trap composed of 11 places in 27 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/89 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/89 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 10/99 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-31 19:25:39] [INFO ] Deduced a trap composed of 11 places in 32 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/99 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/99 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 88/187 variables, 99/117 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/187 variables, 8/125 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/187 variables, 1/126 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/187 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/187 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 187/187 variables, and 126 constraints, problems are : Problem set: 0 solved, 1 unsolved in 172 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 99/99 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints]
After SMT, in 284ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 67 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=67 )
FORMULA AutoFlight-PT-02b-ReachabilityFireability-2024-13 TRUE TECHNIQUES PARIKH_WALK
Parikh walk visited 1 properties in 7 ms.
All properties solved without resorting to model-checking.
Total runtime 21858 ms.
ITS solved all properties within timeout

BK_STOP 1717183539826

--------------------
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 ReachabilityFireability -timeout 360 -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="AutoFlight-PT-02b"
export BK_EXAMINATION="ReachabilityFireability"
export BK_TOOL="ltsminxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
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 ltsminxred"
echo " Input is AutoFlight-PT-02b, examination is ReachabilityFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r468-smll-171620166900087"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/AutoFlight-PT-02b.tgz
mv AutoFlight-PT-02b execution
cd execution
if [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "UpperBounds" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] || [ "ReachabilityFireability" = "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 [ "ReachabilityFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityFireability" != "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 "ReachabilityFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityFireability.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 '' ReachabilityFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityFireability"
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 ;