Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r011-oct2-167813600200463.qcow2', fmt=qcow2 cluster_size=65536 extended_l2=off compression_type=zlib size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 backing_fmt=qcow2 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool smartxred
Input is AutoFlight-PT-06b, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r011-oct2-167813600200463
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 568K
-rw-r--r-- 1 mcc users 6.2K Feb 25 18:09 CTLCardinality.txt
-rw-r--r-- 1 mcc users 63K Feb 25 18:09 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.4K Feb 25 18:08 CTLFireability.txt
-rw-r--r-- 1 mcc users 62K Feb 25 18:08 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.3K Feb 25 15:32 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Feb 25 15:32 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 15:32 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 15:32 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.3K Feb 25 18:10 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 83K Feb 25 18:10 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Feb 25 18:09 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 93K Feb 25 18:09 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 15:32 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 15:32 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 134K Mar 5 18:22 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-06b-ReachabilityFireability-00
FORMULA_NAME AutoFlight-PT-06b-ReachabilityFireability-01
FORMULA_NAME AutoFlight-PT-06b-ReachabilityFireability-02
FORMULA_NAME AutoFlight-PT-06b-ReachabilityFireability-03
FORMULA_NAME AutoFlight-PT-06b-ReachabilityFireability-04
FORMULA_NAME AutoFlight-PT-06b-ReachabilityFireability-05
FORMULA_NAME AutoFlight-PT-06b-ReachabilityFireability-06
FORMULA_NAME AutoFlight-PT-06b-ReachabilityFireability-07
FORMULA_NAME AutoFlight-PT-06b-ReachabilityFireability-08
FORMULA_NAME AutoFlight-PT-06b-ReachabilityFireability-09
FORMULA_NAME AutoFlight-PT-06b-ReachabilityFireability-10
FORMULA_NAME AutoFlight-PT-06b-ReachabilityFireability-11
FORMULA_NAME AutoFlight-PT-06b-ReachabilityFireability-12
FORMULA_NAME AutoFlight-PT-06b-ReachabilityFireability-13
FORMULA_NAME AutoFlight-PT-06b-ReachabilityFireability-14
FORMULA_NAME AutoFlight-PT-06b-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1678735878970

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=smartxred
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=AutoFlight-PT-06b
Applying reductions before tool smart
Invoking reducer
Running Version 202303021504
[2023-03-13 19:31:21] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2023-03-13 19:31:21] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-13 19:31:21] [INFO ] Load time of PNML (sax parser for PT used): 85 ms
[2023-03-13 19:31:21] [INFO ] Transformed 574 places.
[2023-03-13 19:31:21] [INFO ] Transformed 572 transitions.
[2023-03-13 19:31:21] [INFO ] Found NUPN structural information;
[2023-03-13 19:31:21] [INFO ] Parsed PT model containing 574 places and 572 transitions and 1334 arcs in 154 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 11 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 34 resets, run finished after 362 ms. (steps per millisecond=27 ) properties (out of 16) seen :9
FORMULA AutoFlight-PT-06b-ReachabilityFireability-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-06b-ReachabilityFireability-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-06b-ReachabilityFireability-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-06b-ReachabilityFireability-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-06b-ReachabilityFireability-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-06b-ReachabilityFireability-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-06b-ReachabilityFireability-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-06b-ReachabilityFireability-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-06b-ReachabilityFireability-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 7) seen :1
FORMULA AutoFlight-PT-06b-ReachabilityFireability-03 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 6) seen :1
FORMULA AutoFlight-PT-06b-ReachabilityFireability-06 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10000 steps, including 3 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 3 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
// Phase 1: matrix 572 rows 574 cols
[2023-03-13 19:31:21] [INFO ] Computed 40 place invariants in 28 ms
[2023-03-13 19:31:22] [INFO ] After 379ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-13 19:31:22] [INFO ] [Nat]Absence check using 39 positive place invariants in 17 ms returned sat
[2023-03-13 19:31:22] [INFO ] [Nat]Absence check using 39 positive and 1 generalized place invariants in 7 ms returned sat
[2023-03-13 19:31:23] [INFO ] After 571ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :4
[2023-03-13 19:31:23] [INFO ] Deduced a trap composed of 21 places in 446 ms of which 11 ms to minimize.
[2023-03-13 19:31:24] [INFO ] Deduced a trap composed of 44 places in 249 ms of which 1 ms to minimize.
[2023-03-13 19:31:24] [INFO ] Deduced a trap composed of 43 places in 168 ms of which 1 ms to minimize.
[2023-03-13 19:31:24] [INFO ] Deduced a trap composed of 46 places in 153 ms of which 2 ms to minimize.
[2023-03-13 19:31:24] [INFO ] Deduced a trap composed of 63 places in 150 ms of which 0 ms to minimize.
[2023-03-13 19:31:24] [INFO ] Deduced a trap composed of 29 places in 142 ms of which 0 ms to minimize.
[2023-03-13 19:31:24] [INFO ] Deduced a trap composed of 34 places in 136 ms of which 1 ms to minimize.
[2023-03-13 19:31:25] [INFO ] Deduced a trap composed of 19 places in 133 ms of which 1 ms to minimize.
[2023-03-13 19:31:25] [INFO ] Deduced a trap composed of 69 places in 127 ms of which 0 ms to minimize.
[2023-03-13 19:31:25] [INFO ] Deduced a trap composed of 88 places in 113 ms of which 1 ms to minimize.
[2023-03-13 19:31:25] [INFO ] Deduced a trap composed of 41 places in 98 ms of which 1 ms to minimize.
[2023-03-13 19:31:25] [INFO ] Deduced a trap composed of 51 places in 131 ms of which 1 ms to minimize.
[2023-03-13 19:31:25] [INFO ] Deduced a trap composed of 31 places in 142 ms of which 1 ms to minimize.
[2023-03-13 19:31:26] [INFO ] Deduced a trap composed of 31 places in 172 ms of which 1 ms to minimize.
[2023-03-13 19:31:26] [INFO ] Deduced a trap composed of 48 places in 155 ms of which 1 ms to minimize.
[2023-03-13 19:31:26] [INFO ] Trap strengthening (SAT) tested/added 16/15 trap constraints in 3045 ms
[2023-03-13 19:31:26] [INFO ] Deduced a trap composed of 18 places in 240 ms of which 0 ms to minimize.
[2023-03-13 19:31:27] [INFO ] Deduced a trap composed of 22 places in 171 ms of which 0 ms to minimize.
[2023-03-13 19:31:27] [INFO ] Deduced a trap composed of 53 places in 182 ms of which 0 ms to minimize.
[2023-03-13 19:31:27] [INFO ] Deduced a trap composed of 55 places in 159 ms of which 1 ms to minimize.
[2023-03-13 19:31:27] [INFO ] Deduced a trap composed of 25 places in 122 ms of which 0 ms to minimize.
[2023-03-13 19:31:27] [INFO ] Deduced a trap composed of 51 places in 122 ms of which 0 ms to minimize.
[2023-03-13 19:31:27] [INFO ] Deduced a trap composed of 27 places in 179 ms of which 13 ms to minimize.
[2023-03-13 19:31:28] [INFO ] Deduced a trap composed of 54 places in 106 ms of which 1 ms to minimize.
[2023-03-13 19:31:28] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 1607 ms
[2023-03-13 19:31:28] [INFO ] Deduced a trap composed of 35 places in 157 ms of which 1 ms to minimize.
[2023-03-13 19:31:28] [INFO ] Deduced a trap composed of 77 places in 201 ms of which 1 ms to minimize.
[2023-03-13 19:31:28] [INFO ] Deduced a trap composed of 71 places in 147 ms of which 1 ms to minimize.
[2023-03-13 19:31:28] [INFO ] Deduced a trap composed of 70 places in 111 ms of which 0 ms to minimize.
[2023-03-13 19:31:29] [INFO ] Deduced a trap composed of 67 places in 103 ms of which 0 ms to minimize.
[2023-03-13 19:31:29] [INFO ] Deduced a trap composed of 39 places in 127 ms of which 0 ms to minimize.
[2023-03-13 19:31:29] [INFO ] Deduced a trap composed of 83 places in 131 ms of which 1 ms to minimize.
[2023-03-13 19:31:29] [INFO ] Deduced a trap composed of 95 places in 114 ms of which 0 ms to minimize.
[2023-03-13 19:31:29] [INFO ] Deduced a trap composed of 54 places in 108 ms of which 0 ms to minimize.
[2023-03-13 19:31:29] [INFO ] Deduced a trap composed of 39 places in 98 ms of which 1 ms to minimize.
[2023-03-13 19:31:29] [INFO ] Deduced a trap composed of 53 places in 92 ms of which 1 ms to minimize.
[2023-03-13 19:31:30] [INFO ] Deduced a trap composed of 78 places in 121 ms of which 8 ms to minimize.
[2023-03-13 19:31:30] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 1900 ms
[2023-03-13 19:31:30] [INFO ] After 7493ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :3
Attempting to minimize the solution found.
Minimization took 293 ms.
[2023-03-13 19:31:30] [INFO ] After 8014ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :3
FORMULA AutoFlight-PT-06b-ReachabilityFireability-10 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA AutoFlight-PT-06b-ReachabilityFireability-08 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 5 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 37 ms.
Support contains 89 out of 574 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 574/574 places, 572/572 transitions.
Drop transitions removed 148 transitions
Trivial Post-agglo rules discarded 148 transitions
Performed 148 trivial Post agglomeration. Transition count delta: 148
Iterating post reduction 0 with 148 rules applied. Total rules applied 148 place count 574 transition count 424
Reduce places removed 148 places and 0 transitions.
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 1 with 165 rules applied. Total rules applied 313 place count 426 transition count 407
Reduce places removed 5 places and 0 transitions.
Performed 33 Post agglomeration using F-continuation condition.Transition count delta: 33
Iterating post reduction 2 with 38 rules applied. Total rules applied 351 place count 421 transition count 374
Reduce places removed 33 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 40 rules applied. Total rules applied 391 place count 388 transition count 367
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 392 place count 387 transition count 367
Performed 54 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 54 Pre rules applied. Total rules applied 392 place count 387 transition count 313
Deduced a syphon composed of 54 places in 2 ms
Reduce places removed 54 places and 0 transitions.
Iterating global reduction 5 with 108 rules applied. Total rules applied 500 place count 333 transition count 313
Discarding 29 places :
Symmetric choice reduction at 5 with 29 rule applications. Total rules 529 place count 304 transition count 284
Iterating global reduction 5 with 29 rules applied. Total rules applied 558 place count 304 transition count 284
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 560 place count 304 transition count 282
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 3 Pre rules applied. Total rules applied 560 place count 304 transition count 279
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 6 with 6 rules applied. Total rules applied 566 place count 301 transition count 279
Performed 60 Post agglomeration using F-continuation condition.Transition count delta: 60
Deduced a syphon composed of 60 places in 0 ms
Reduce places removed 60 places and 0 transitions.
Iterating global reduction 6 with 120 rules applied. Total rules applied 686 place count 241 transition count 219
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 688 place count 240 transition count 219
Drop transitions removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 6 with 9 rules applied. Total rules applied 697 place count 240 transition count 210
Free-agglomeration rule applied 8 times.
Iterating global reduction 6 with 8 rules applied. Total rules applied 705 place count 240 transition count 202
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 6 with 8 rules applied. Total rules applied 713 place count 232 transition count 202
Applied a total of 713 rules in 140 ms. Remains 232 /574 variables (removed 342) and now considering 202/572 (removed 370) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 140 ms. Remains : 232/574 places, 202/572 transitions.
Incomplete random walk after 10000 steps, including 113 resets, run finished after 138 ms. (steps per millisecond=72 ) properties (out of 3) seen :1
FORMULA AutoFlight-PT-06b-ReachabilityFireability-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 202 rows 232 cols
[2023-03-13 19:31:30] [INFO ] Computed 40 place invariants in 2 ms
[2023-03-13 19:31:30] [INFO ] After 49ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-13 19:31:30] [INFO ] [Nat]Absence check using 38 positive place invariants in 6 ms returned sat
[2023-03-13 19:31:30] [INFO ] [Nat]Absence check using 38 positive and 2 generalized place invariants in 2 ms returned sat
[2023-03-13 19:31:31] [INFO ] After 121ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-13 19:31:31] [INFO ] State equation strengthened by 13 read => feed constraints.
[2023-03-13 19:31:31] [INFO ] After 96ms SMT Verify possible using 13 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-13 19:31:31] [INFO ] Deduced a trap composed of 22 places in 99 ms of which 1 ms to minimize.
[2023-03-13 19:31:31] [INFO ] Deduced a trap composed of 10 places in 108 ms of which 0 ms to minimize.
[2023-03-13 19:31:31] [INFO ] Deduced a trap composed of 14 places in 79 ms of which 1 ms to minimize.
[2023-03-13 19:31:31] [INFO ] Deduced a trap composed of 12 places in 150 ms of which 4 ms to minimize.
[2023-03-13 19:31:31] [INFO ] Deduced a trap composed of 21 places in 85 ms of which 1 ms to minimize.
[2023-03-13 19:31:31] [INFO ] Deduced a trap composed of 11 places in 72 ms of which 0 ms to minimize.
[2023-03-13 19:31:32] [INFO ] Deduced a trap composed of 14 places in 90 ms of which 1 ms to minimize.
[2023-03-13 19:31:32] [INFO ] Deduced a trap composed of 20 places in 63 ms of which 1 ms to minimize.
[2023-03-13 19:31:32] [INFO ] Deduced a trap composed of 61 places in 61 ms of which 0 ms to minimize.
[2023-03-13 19:31:32] [INFO ] Deduced a trap composed of 20 places in 27 ms of which 1 ms to minimize.
[2023-03-13 19:31:32] [INFO ] Deduced a trap composed of 26 places in 32 ms of which 1 ms to minimize.
[2023-03-13 19:31:32] [INFO ] Deduced a trap composed of 23 places in 44 ms of which 0 ms to minimize.
[2023-03-13 19:31:32] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 1131 ms
[2023-03-13 19:31:32] [INFO ] Deduced a trap composed of 25 places in 77 ms of which 1 ms to minimize.
[2023-03-13 19:31:32] [INFO ] Deduced a trap composed of 19 places in 96 ms of which 1 ms to minimize.
[2023-03-13 19:31:32] [INFO ] Deduced a trap composed of 16 places in 78 ms of which 13 ms to minimize.
[2023-03-13 19:31:32] [INFO ] Deduced a trap composed of 67 places in 57 ms of which 0 ms to minimize.
[2023-03-13 19:31:32] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 391 ms
[2023-03-13 19:31:32] [INFO ] After 1734ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 118 ms.
[2023-03-13 19:31:32] [INFO ] After 2049ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 20 ms.
Support contains 59 out of 232 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 232/232 places, 202/202 transitions.
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 232 transition count 194
Reduce places removed 8 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 11 rules applied. Total rules applied 19 place count 224 transition count 191
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 22 place count 221 transition count 191
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 22 place count 221 transition count 186
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 32 place count 216 transition count 186
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 34 place count 214 transition count 184
Iterating global reduction 3 with 2 rules applied. Total rules applied 36 place count 214 transition count 184
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 3 with 28 rules applied. Total rules applied 64 place count 200 transition count 170
Free-agglomeration rule applied 3 times.
Iterating global reduction 3 with 3 rules applied. Total rules applied 67 place count 200 transition count 167
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 70 place count 197 transition count 167
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 71 place count 196 transition count 166
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 73 place count 194 transition count 166
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 73 place count 194 transition count 164
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 77 place count 192 transition count 164
Applied a total of 77 rules in 90 ms. Remains 192 /232 variables (removed 40) and now considering 164/202 (removed 38) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 90 ms. Remains : 192/232 places, 164/202 transitions.
Incomplete random walk after 10000 steps, including 158 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 1084557 steps, run timeout after 3001 ms. (steps per millisecond=361 ) properties seen :{}
Probabilistic random walk after 1084557 steps, saw 143061 distinct states, run finished after 3009 ms. (steps per millisecond=360 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 164 rows 192 cols
[2023-03-13 19:31:36] [INFO ] Computed 38 place invariants in 2 ms
[2023-03-13 19:31:36] [INFO ] After 43ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-13 19:31:36] [INFO ] [Nat]Absence check using 36 positive place invariants in 9 ms returned sat
[2023-03-13 19:31:36] [INFO ] [Nat]Absence check using 36 positive and 2 generalized place invariants in 2 ms returned sat
[2023-03-13 19:31:36] [INFO ] After 137ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-13 19:31:36] [INFO ] State equation strengthened by 20 read => feed constraints.
[2023-03-13 19:31:36] [INFO ] After 92ms SMT Verify possible using 20 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-13 19:31:36] [INFO ] Deduced a trap composed of 16 places in 111 ms of which 27 ms to minimize.
[2023-03-13 19:31:36] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 129 ms
[2023-03-13 19:31:36] [INFO ] Deduced a trap composed of 46 places in 54 ms of which 0 ms to minimize.
[2023-03-13 19:31:36] [INFO ] Deduced a trap composed of 10 places in 94 ms of which 1 ms to minimize.
[2023-03-13 19:31:36] [INFO ] Deduced a trap composed of 62 places in 84 ms of which 1 ms to minimize.
[2023-03-13 19:31:37] [INFO ] Deduced a trap composed of 63 places in 90 ms of which 1 ms to minimize.
[2023-03-13 19:31:37] [INFO ] Deduced a trap composed of 9 places in 44 ms of which 1 ms to minimize.
[2023-03-13 19:31:37] [INFO ] Deduced a trap composed of 8 places in 52 ms of which 0 ms to minimize.
[2023-03-13 19:31:37] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 538 ms
[2023-03-13 19:31:37] [INFO ] After 843ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 90 ms.
[2023-03-13 19:31:37] [INFO ] After 1143ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 13 ms.
Support contains 59 out of 192 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 192/192 places, 164/164 transitions.
Applied a total of 0 rules in 13 ms. Remains 192 /192 variables (removed 0) and now considering 164/164 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13 ms. Remains : 192/192 places, 164/164 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 192/192 places, 164/164 transitions.
Applied a total of 0 rules in 10 ms. Remains 192 /192 variables (removed 0) and now considering 164/164 (removed 0) transitions.
[2023-03-13 19:31:37] [INFO ] Invariant cache hit.
[2023-03-13 19:31:37] [INFO ] Implicit Places using invariants in 126 ms returned [175, 184]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 129 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 190/192 places, 164/164 transitions.
Applied a total of 0 rules in 4 ms. Remains 190 /190 variables (removed 0) and now considering 164/164 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 145 ms. Remains : 190/192 places, 164/164 transitions.
Incomplete random walk after 10000 steps, including 160 resets, run finished after 82 ms. (steps per millisecond=121 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 12 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 1224357 steps, run timeout after 3001 ms. (steps per millisecond=407 ) properties seen :{}
Probabilistic random walk after 1224357 steps, saw 165201 distinct states, run finished after 3001 ms. (steps per millisecond=407 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 164 rows 190 cols
[2023-03-13 19:31:40] [INFO ] Computed 36 place invariants in 3 ms
[2023-03-13 19:31:40] [INFO ] After 32ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-13 19:31:40] [INFO ] [Nat]Absence check using 36 positive place invariants in 5 ms returned sat
[2023-03-13 19:31:40] [INFO ] After 92ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-13 19:31:40] [INFO ] State equation strengthened by 20 read => feed constraints.
[2023-03-13 19:31:40] [INFO ] After 66ms SMT Verify possible using 20 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-13 19:31:41] [INFO ] Deduced a trap composed of 15 places in 62 ms of which 0 ms to minimize.
[2023-03-13 19:31:41] [INFO ] Deduced a trap composed of 20 places in 48 ms of which 0 ms to minimize.
[2023-03-13 19:31:41] [INFO ] Deduced a trap composed of 10 places in 59 ms of which 14 ms to minimize.
[2023-03-13 19:31:41] [INFO ] Deduced a trap composed of 16 places in 57 ms of which 0 ms to minimize.
[2023-03-13 19:31:41] [INFO ] Deduced a trap composed of 11 places in 48 ms of which 1 ms to minimize.
[2023-03-13 19:31:41] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 356 ms
[2023-03-13 19:31:41] [INFO ] Deduced a trap composed of 12 places in 85 ms of which 0 ms to minimize.
[2023-03-13 19:31:41] [INFO ] Deduced a trap composed of 7 places in 75 ms of which 1 ms to minimize.
[2023-03-13 19:31:41] [INFO ] Deduced a trap composed of 14 places in 73 ms of which 1 ms to minimize.
[2023-03-13 19:31:41] [INFO ] Deduced a trap composed of 14 places in 83 ms of which 2 ms to minimize.
[2023-03-13 19:31:41] [INFO ] Deduced a trap composed of 20 places in 56 ms of which 0 ms to minimize.
[2023-03-13 19:31:41] [INFO ] Deduced a trap composed of 17 places in 37 ms of which 0 ms to minimize.
[2023-03-13 19:31:41] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 506 ms
[2023-03-13 19:31:41] [INFO ] After 1008ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 96 ms.
[2023-03-13 19:31:41] [INFO ] After 1256ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 12 ms.
Support contains 59 out of 190 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 190/190 places, 164/164 transitions.
Applied a total of 0 rules in 13 ms. Remains 190 /190 variables (removed 0) and now considering 164/164 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13 ms. Remains : 190/190 places, 164/164 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 190/190 places, 164/164 transitions.
Applied a total of 0 rules in 12 ms. Remains 190 /190 variables (removed 0) and now considering 164/164 (removed 0) transitions.
[2023-03-13 19:31:41] [INFO ] Invariant cache hit.
[2023-03-13 19:31:42] [INFO ] Implicit Places using invariants in 206 ms returned []
[2023-03-13 19:31:42] [INFO ] Invariant cache hit.
[2023-03-13 19:31:42] [INFO ] State equation strengthened by 20 read => feed constraints.
[2023-03-13 19:31:42] [INFO ] Implicit Places using invariants and state equation in 163 ms returned [26]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 372 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 189/190 places, 164/164 transitions.
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 4 Pre rules applied. Total rules applied 0 place count 189 transition count 160
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 8 place count 185 transition count 160
Applied a total of 8 rules in 12 ms. Remains 185 /189 variables (removed 4) and now considering 160/164 (removed 4) transitions.
// Phase 1: matrix 160 rows 185 cols
[2023-03-13 19:31:42] [INFO ] Computed 35 place invariants in 3 ms
[2023-03-13 19:31:42] [INFO ] Implicit Places using invariants in 109 ms returned []
[2023-03-13 19:31:42] [INFO ] Invariant cache hit.
[2023-03-13 19:31:42] [INFO ] State equation strengthened by 16 read => feed constraints.
[2023-03-13 19:31:42] [INFO ] Implicit Places using invariants and state equation in 183 ms returned []
Implicit Place search using SMT with State Equation took 306 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 185/190 places, 160/164 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 702 ms. Remains : 185/190 places, 160/164 transitions.
Incomplete random walk after 10000 steps, including 159 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 1289061 steps, run timeout after 3001 ms. (steps per millisecond=429 ) properties seen :{}
Probabilistic random walk after 1289061 steps, saw 176090 distinct states, run finished after 3001 ms. (steps per millisecond=429 ) properties seen :0
Running SMT prover for 2 properties.
[2023-03-13 19:31:45] [INFO ] Invariant cache hit.
[2023-03-13 19:31:45] [INFO ] After 38ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-13 19:31:45] [INFO ] [Nat]Absence check using 35 positive place invariants in 5 ms returned sat
[2023-03-13 19:31:46] [INFO ] After 101ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-13 19:31:46] [INFO ] State equation strengthened by 16 read => feed constraints.
[2023-03-13 19:31:46] [INFO ] After 57ms SMT Verify possible using 16 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-13 19:31:46] [INFO ] Deduced a trap composed of 15 places in 91 ms of which 1 ms to minimize.
[2023-03-13 19:31:46] [INFO ] Deduced a trap composed of 45 places in 85 ms of which 1 ms to minimize.
[2023-03-13 19:31:46] [INFO ] Deduced a trap composed of 55 places in 108 ms of which 1 ms to minimize.
[2023-03-13 19:31:46] [INFO ] Deduced a trap composed of 13 places in 102 ms of which 0 ms to minimize.
[2023-03-13 19:31:46] [INFO ] Deduced a trap composed of 27 places in 72 ms of which 0 ms to minimize.
[2023-03-13 19:31:46] [INFO ] Deduced a trap composed of 19 places in 41 ms of which 0 ms to minimize.
[2023-03-13 19:31:46] [INFO ] Deduced a trap composed of 8 places in 42 ms of which 0 ms to minimize.
[2023-03-13 19:31:46] [INFO ] Deduced a trap composed of 10 places in 33 ms of which 0 ms to minimize.
[2023-03-13 19:31:46] [INFO ] Deduced a trap composed of 9 places in 53 ms of which 0 ms to minimize.
[2023-03-13 19:31:46] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 746 ms
[2023-03-13 19:31:46] [INFO ] Deduced a trap composed of 45 places in 52 ms of which 0 ms to minimize.
[2023-03-13 19:31:47] [INFO ] Deduced a trap composed of 10 places in 50 ms of which 1 ms to minimize.
[2023-03-13 19:31:47] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 128 ms
[2023-03-13 19:31:47] [INFO ] After 1035ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 65 ms.
[2023-03-13 19:31:47] [INFO ] After 1268ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 13 ms.
Support contains 59 out of 185 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 185/185 places, 160/160 transitions.
Applied a total of 0 rules in 5 ms. Remains 185 /185 variables (removed 0) and now considering 160/160 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 185/185 places, 160/160 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 185/185 places, 160/160 transitions.
Applied a total of 0 rules in 5 ms. Remains 185 /185 variables (removed 0) and now considering 160/160 (removed 0) transitions.
[2023-03-13 19:31:47] [INFO ] Invariant cache hit.
[2023-03-13 19:31:47] [INFO ] Implicit Places using invariants in 91 ms returned []
[2023-03-13 19:31:47] [INFO ] Invariant cache hit.
[2023-03-13 19:31:47] [INFO ] State equation strengthened by 16 read => feed constraints.
[2023-03-13 19:31:47] [INFO ] Implicit Places using invariants and state equation in 171 ms returned []
Implicit Place search using SMT with State Equation took 264 ms to find 0 implicit places.
[2023-03-13 19:31:47] [INFO ] Redundant transitions in 6 ms returned []
[2023-03-13 19:31:47] [INFO ] Invariant cache hit.
[2023-03-13 19:31:47] [INFO ] Dead Transitions using invariants and state equation in 126 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 425 ms. Remains : 185/185 places, 160/160 transitions.
Graph (complete) has 329 edges and 185 vertex of which 177 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.2 ms
Discarding 8 places :
Also discarding 0 output transitions
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 177 transition count 159
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 176 transition count 158
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 5 place count 175 transition count 158
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 12 Pre rules applied. Total rules applied 5 place count 175 transition count 146
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 3 with 24 rules applied. Total rules applied 29 place count 163 transition count 146
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 30 place count 163 transition count 145
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 31 place count 162 transition count 145
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 32 place count 162 transition count 145
Applied a total of 32 rules in 22 ms. Remains 162 /185 variables (removed 23) and now considering 145/160 (removed 15) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 145 rows 162 cols
[2023-03-13 19:31:47] [INFO ] Computed 27 place invariants in 3 ms
[2023-03-13 19:31:47] [INFO ] After 61ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-13 19:31:47] [INFO ] [Nat]Absence check using 27 positive place invariants in 12 ms returned sat
[2023-03-13 19:31:47] [INFO ] After 171ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-13 19:31:48] [INFO ] Deduced a trap composed of 15 places in 57 ms of which 1 ms to minimize.
[2023-03-13 19:31:48] [INFO ] Deduced a trap composed of 40 places in 74 ms of which 0 ms to minimize.
[2023-03-13 19:31:48] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 154 ms
[2023-03-13 19:31:48] [INFO ] Deduced a trap composed of 36 places in 69 ms of which 0 ms to minimize.
[2023-03-13 19:31:48] [INFO ] Deduced a trap composed of 13 places in 78 ms of which 0 ms to minimize.
[2023-03-13 19:31:48] [INFO ] Deduced a trap composed of 7 places in 36 ms of which 1 ms to minimize.
[2023-03-13 19:31:48] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 228 ms
[2023-03-13 19:31:48] [INFO ] After 623ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 64 ms.
[2023-03-13 19:31:48] [INFO ] After 796ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
[2023-03-13 19:31:48] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 6 ms.
[2023-03-13 19:31:48] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 185 places, 160 transitions and 511 arcs took 3 ms.
[2023-03-13 19:31:48] [INFO ] Flatten gal took : 39 ms
Total runtime 27685 ms.
There are residual formulas that ITS could not solve within timeout
======================================================
========== this is Smart for the MCC'2018 ============
======================================================
Running AutoFlight (PT), instance 06b
Examination ReachabilityFireability
Parser /home/mcc/BenchKit/bin//../reducer/bin//../../smart/bin//parser/Fireability.jar
Model checker /home/mcc/BenchKit/bin//../reducer/bin//../../smart/bin//rem_exec//smart

GOT IT HERE. BS
Petri model created: 185 places, 160 transitions, 511 arcs.
Final Score: 2763.529
Took : 5 seconds
Reachability Fireability file is: ReachabilityFireability.xml
READY TO PARSE. BS

BK_STOP 1678735914258

--------------------
content from stderr:

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityFireability -timeout 360 -rebuildPNML
ERROR in file model.sm near line 867:
syntax error

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-06b"
export BK_EXAMINATION="ReachabilityFireability"
export BK_TOOL="smartxred"
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-5348"
echo " Executing tool smartxred"
echo " Input is AutoFlight-PT-06b, 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 r011-oct2-167813600200463"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/AutoFlight-PT-06b.tgz
mv AutoFlight-PT-06b 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 ;