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.r009-oct2-167813597400111.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 ltsminxred
Input is ASLink-PT-07a, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r009-oct2-167813597400111
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.1M
-rw-r--r-- 1 mcc users 7.2K Feb 26 13:09 CTLCardinality.txt
-rw-r--r-- 1 mcc users 80K Feb 26 13:09 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.9K Feb 26 13:08 CTLFireability.txt
-rw-r--r-- 1 mcc users 54K Feb 26 13:08 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.0K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K Feb 25 15:29 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 15:29 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 15:29 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 15:29 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.6K Feb 26 13:10 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 74K Feb 26 13:10 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.1K Feb 26 13:09 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 68K Feb 26 13:09 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 15:29 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Feb 25 15:29 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 677K 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 ASLink-PT-07a-ReachabilityFireability-00
FORMULA_NAME ASLink-PT-07a-ReachabilityFireability-01
FORMULA_NAME ASLink-PT-07a-ReachabilityFireability-02
FORMULA_NAME ASLink-PT-07a-ReachabilityFireability-03
FORMULA_NAME ASLink-PT-07a-ReachabilityFireability-04
FORMULA_NAME ASLink-PT-07a-ReachabilityFireability-05
FORMULA_NAME ASLink-PT-07a-ReachabilityFireability-06
FORMULA_NAME ASLink-PT-07a-ReachabilityFireability-07
FORMULA_NAME ASLink-PT-07a-ReachabilityFireability-08
FORMULA_NAME ASLink-PT-07a-ReachabilityFireability-09
FORMULA_NAME ASLink-PT-07a-ReachabilityFireability-10
FORMULA_NAME ASLink-PT-07a-ReachabilityFireability-11
FORMULA_NAME ASLink-PT-07a-ReachabilityFireability-12
FORMULA_NAME ASLink-PT-07a-ReachabilityFireability-13
FORMULA_NAME ASLink-PT-07a-ReachabilityFireability-14
FORMULA_NAME ASLink-PT-07a-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1678611410846

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=ltsminxred
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ASLink-PT-07a
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-12 08:56:54] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2023-03-12 08:56:54] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-12 08:56:54] [INFO ] Load time of PNML (sax parser for PT used): 139 ms
[2023-03-12 08:56:54] [INFO ] Transformed 1601 places.
[2023-03-12 08:56:54] [INFO ] Transformed 2373 transitions.
[2023-03-12 08:56:54] [INFO ] Found NUPN structural information;
[2023-03-12 08:56:54] [INFO ] Parsed PT model containing 1601 places and 2373 transitions and 8915 arcs in 337 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 24 ms.
Working with output stream class java.io.PrintStream
Ensure Unique test removed 25 transitions
Reduce redundant transitions removed 25 transitions.
Incomplete random walk after 10000 steps, including 54 resets, run finished after 452 ms. (steps per millisecond=22 ) properties (out of 16) seen :3
FORMULA ASLink-PT-07a-ReachabilityFireability-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-07a-ReachabilityFireability-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-07a-ReachabilityFireability-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 201 ms. (steps per millisecond=49 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 84 ms. (steps per millisecond=119 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 79 ms. (steps per millisecond=126 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 86 ms. (steps per millisecond=116 ) properties (out of 13) seen :1
FORMULA ASLink-PT-07a-ReachabilityFireability-06 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 86 ms. (steps per millisecond=116 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10000 steps, including 5 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 12) seen :0
Running SMT prover for 12 properties.
// Phase 1: matrix 2348 rows 1601 cols
[2023-03-12 08:56:56] [INFO ] Computed 308 place invariants in 99 ms
[2023-03-12 08:56:57] [INFO ] After 1216ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:12
[2023-03-12 08:56:58] [INFO ] [Nat]Absence check using 75 positive place invariants in 66 ms returned sat
[2023-03-12 08:56:58] [INFO ] [Nat]Absence check using 75 positive and 233 generalized place invariants in 222 ms returned sat
[2023-03-12 08:57:22] [INFO ] After 23569ms SMT Verify possible using state equation in natural domain returned unsat :5 sat :4
[2023-03-12 08:57:23] [INFO ] After 23587ms SMT Verify possible using trap constraints in natural domain returned unsat :5 sat :4
Attempting to minimize the solution found.
Minimization took 1 ms.
[2023-03-12 08:57:23] [INFO ] After 25041ms SMT Verify possible using all constraints in natural domain returned unsat :5 sat :4
FORMULA ASLink-PT-07a-ReachabilityFireability-12 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA ASLink-PT-07a-ReachabilityFireability-08 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA ASLink-PT-07a-ReachabilityFireability-04 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA ASLink-PT-07a-ReachabilityFireability-03 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA ASLink-PT-07a-ReachabilityFireability-01 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 12 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 83 ms.
Support contains 229 out of 1601 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1601/1601 places, 2348/2348 transitions.
Ensure Unique test removed 26 places
Discarding 14 places :
Implicit places reduction removed 14 places
Drop transitions removed 109 transitions
Trivial Post-agglo rules discarded 109 transitions
Performed 109 trivial Post agglomeration. Transition count delta: 109
Iterating post reduction 0 with 149 rules applied. Total rules applied 149 place count 1561 transition count 2239
Reduce places removed 109 places and 0 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Iterating post reduction 1 with 114 rules applied. Total rules applied 263 place count 1452 transition count 2234
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 268 place count 1447 transition count 2234
Performed 132 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 132 Pre rules applied. Total rules applied 268 place count 1447 transition count 2102
Deduced a syphon composed of 132 places in 7 ms
Ensure Unique test removed 48 places
Reduce places removed 180 places and 0 transitions.
Iterating global reduction 3 with 312 rules applied. Total rules applied 580 place count 1267 transition count 2102
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 1 rules applied. Total rules applied 581 place count 1267 transition count 2101
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 582 place count 1266 transition count 2101
Discarding 7 places :
Symmetric choice reduction at 5 with 7 rule applications. Total rules 589 place count 1259 transition count 2066
Ensure Unique test removed 1 places
Iterating global reduction 5 with 8 rules applied. Total rules applied 597 place count 1258 transition count 2066
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 5 with 6 rules applied. Total rules applied 603 place count 1257 transition count 2061
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 6 with 3 rules applied. Total rules applied 606 place count 1254 transition count 2061
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 607 place count 1253 transition count 2053
Iterating global reduction 7 with 1 rules applied. Total rules applied 608 place count 1253 transition count 2053
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 609 place count 1252 transition count 2045
Iterating global reduction 7 with 1 rules applied. Total rules applied 610 place count 1252 transition count 2045
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 611 place count 1251 transition count 2037
Iterating global reduction 7 with 1 rules applied. Total rules applied 612 place count 1251 transition count 2037
Performed 34 Post agglomeration using F-continuation condition.Transition count delta: 34
Deduced a syphon composed of 34 places in 6 ms
Reduce places removed 34 places and 0 transitions.
Iterating global reduction 7 with 68 rules applied. Total rules applied 680 place count 1217 transition count 2003
Free-agglomeration rule applied 1 times.
Iterating global reduction 7 with 1 rules applied. Total rules applied 681 place count 1217 transition count 2002
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 682 place count 1216 transition count 2002
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 8 with 3 rules applied. Total rules applied 685 place count 1216 transition count 1999
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 8 with 3 rules applied. Total rules applied 688 place count 1213 transition count 1999
Partial Free-agglomeration rule applied 5 times.
Drop transitions removed 5 transitions
Iterating global reduction 9 with 5 rules applied. Total rules applied 693 place count 1213 transition count 1999
Applied a total of 693 rules in 1435 ms. Remains 1213 /1601 variables (removed 388) and now considering 1999/2348 (removed 349) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1449 ms. Remains : 1213/1601 places, 1999/2348 transitions.
Incomplete random walk after 10000 steps, including 87 resets, run finished after 305 ms. (steps per millisecond=32 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 11 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 184 ms. (steps per millisecond=54 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 7) seen :0
Interrupted probabilistic random walk after 112216 steps, run timeout after 3001 ms. (steps per millisecond=37 ) properties seen :{}
Probabilistic random walk after 112216 steps, saw 30481 distinct states, run finished after 3002 ms. (steps per millisecond=37 ) properties seen :0
Running SMT prover for 7 properties.
// Phase 1: matrix 1999 rows 1213 cols
[2023-03-12 08:57:28] [INFO ] Computed 218 place invariants in 128 ms
[2023-03-12 08:57:29] [INFO ] After 599ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2023-03-12 08:57:29] [INFO ] [Nat]Absence check using 56 positive place invariants in 86 ms returned sat
[2023-03-12 08:57:29] [INFO ] [Nat]Absence check using 56 positive and 162 generalized place invariants in 114 ms returned sat
[2023-03-12 08:57:50] [INFO ] After 20184ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :4
[2023-03-12 08:57:50] [INFO ] State equation strengthened by 28 read => feed constraints.
[2023-03-12 08:57:54] [INFO ] After 4102ms SMT Verify possible using 28 Read/Feed constraints in natural domain returned unsat :2 sat :3
[2023-03-12 08:57:54] [INFO ] After 4102ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :3
Attempting to minimize the solution found.
Minimization took 0 ms.
[2023-03-12 08:57:54] [INFO ] After 25021ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :3
FORMULA ASLink-PT-07a-ReachabilityFireability-14 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA ASLink-PT-07a-ReachabilityFireability-11 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 7 Parikh solutions to 5 different solutions.
FORMULA ASLink-PT-07a-ReachabilityFireability-13 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 1 properties in 374 ms.
Support contains 214 out of 1213 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1213/1213 places, 1999/1999 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 1 place count 1213 transition count 1998
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 1212 transition count 1998
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 2 place count 1212 transition count 1997
Deduced a syphon composed of 1 places in 5 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 1211 transition count 1997
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 5 place count 1211 transition count 1996
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 6 place count 1210 transition count 1996
Applied a total of 6 rules in 157 ms. Remains 1210 /1213 variables (removed 3) and now considering 1996/1999 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 157 ms. Remains : 1210/1213 places, 1996/1999 transitions.
Incomplete random walk after 10000 steps, including 74 resets, run finished after 185 ms. (steps per millisecond=54 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 103 ms. (steps per millisecond=97 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 86 ms. (steps per millisecond=116 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 129976 steps, run timeout after 3003 ms. (steps per millisecond=43 ) properties seen :{}
Probabilistic random walk after 129976 steps, saw 38927 distinct states, run finished after 3003 ms. (steps per millisecond=43 ) properties seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 1996 rows 1210 cols
[2023-03-12 08:57:58] [INFO ] Computed 218 place invariants in 28 ms
[2023-03-12 08:57:58] [INFO ] After 276ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-12 08:57:59] [INFO ] [Nat]Absence check using 58 positive place invariants in 11 ms returned sat
[2023-03-12 08:57:59] [INFO ] [Nat]Absence check using 58 positive and 160 generalized place invariants in 65 ms returned sat
[2023-03-12 08:58:17] [INFO ] After 17735ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-12 08:58:17] [INFO ] State equation strengthened by 29 read => feed constraints.
[2023-03-12 08:58:23] [INFO ] After 6825ms SMT Verify possible using 29 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-12 08:58:23] [INFO ] After 6838ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 1 ms.
[2023-03-12 08:58:23] [INFO ] After 25056ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 229 ms.
Support contains 214 out of 1210 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1210/1210 places, 1996/1996 transitions.
Applied a total of 0 rules in 33 ms. Remains 1210 /1210 variables (removed 0) and now considering 1996/1996 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 34 ms. Remains : 1210/1210 places, 1996/1996 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1210/1210 places, 1996/1996 transitions.
Applied a total of 0 rules in 32 ms. Remains 1210 /1210 variables (removed 0) and now considering 1996/1996 (removed 0) transitions.
[2023-03-12 08:58:24] [INFO ] Invariant cache hit.
[2023-03-12 08:58:25] [INFO ] Implicit Places using invariants in 1051 ms returned [1, 19, 20, 22, 51, 69, 156, 175, 196, 214, 267, 301, 316, 321, 323, 341, 359, 395, 433, 460, 461, 462, 463, 464, 482, 500, 564, 575, 604, 607, 628, 646, 682, 699, 724, 738, 753, 754, 756, 757, 775, 793, 878, 895, 896, 898, 934, 973, 1019, 1024, 1035, 1040, 1041, 1073, 1096, 1097, 1098, 1099, 1111, 1118, 1125, 1131, 1137, 1143, 1149, 1155, 1161, 1167, 1174]
Discarding 69 places :
Implicit Place search using SMT only with invariants took 1072 ms to find 69 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 1141/1210 places, 1996/1996 transitions.
Drop transitions removed 48 transitions
Trivial Post-agglo rules discarded 48 transitions
Performed 48 trivial Post agglomeration. Transition count delta: 48
Iterating post reduction 0 with 48 rules applied. Total rules applied 48 place count 1141 transition count 1948
Reduce places removed 48 places and 0 transitions.
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: 19
Iterating post reduction 1 with 67 rules applied. Total rules applied 115 place count 1093 transition count 1929
Reduce places removed 19 places and 0 transitions.
Iterating post reduction 2 with 19 rules applied. Total rules applied 134 place count 1074 transition count 1929
Performed 25 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 25 Pre rules applied. Total rules applied 134 place count 1074 transition count 1904
Deduced a syphon composed of 25 places in 3 ms
Ensure Unique test removed 1 places
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 3 with 51 rules applied. Total rules applied 185 place count 1048 transition count 1904
Discarding 9 places :
Implicit places reduction removed 9 places
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 3 with 12 rules applied. Total rules applied 197 place count 1039 transition count 1901
Reduce places removed 3 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 4 with 4 rules applied. Total rules applied 201 place count 1036 transition count 1900
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 202 place count 1035 transition count 1900
Discarding 12 places :
Symmetric choice reduction at 6 with 12 rule applications. Total rules 214 place count 1023 transition count 1888
Iterating global reduction 6 with 12 rules applied. Total rules applied 226 place count 1023 transition count 1888
Discarding 11 places :
Symmetric choice reduction at 6 with 11 rule applications. Total rules 237 place count 1012 transition count 1877
Iterating global reduction 6 with 11 rules applied. Total rules applied 248 place count 1012 transition count 1877
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 249 place count 1012 transition count 1876
Discarding 3 places :
Symmetric choice reduction at 7 with 3 rule applications. Total rules 252 place count 1009 transition count 1873
Iterating global reduction 7 with 3 rules applied. Total rules applied 255 place count 1009 transition count 1873
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 7 with 3 rules applied. Total rules applied 258 place count 1009 transition count 1870
Performed 35 Post agglomeration using F-continuation condition.Transition count delta: 35
Deduced a syphon composed of 35 places in 2 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 8 with 70 rules applied. Total rules applied 328 place count 974 transition count 1835
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 329 place count 973 transition count 1834
Iterating global reduction 8 with 1 rules applied. Total rules applied 330 place count 973 transition count 1834
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 331 place count 973 transition count 1833
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 9 with 1 rules applied. Total rules applied 332 place count 973 transition count 1832
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 334 place count 972 transition count 1831
Free-agglomeration rule applied 3 times.
Iterating global reduction 9 with 3 rules applied. Total rules applied 337 place count 972 transition count 1828
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 9 with 4 rules applied. Total rules applied 341 place count 969 transition count 1827
Free-agglomeration rule (complex) applied 23 times.
Iterating global reduction 10 with 23 rules applied. Total rules applied 364 place count 969 transition count 1804
Reduce places removed 23 places and 0 transitions.
Iterating post reduction 10 with 23 rules applied. Total rules applied 387 place count 946 transition count 1804
Partial Free-agglomeration rule applied 19 times.
Drop transitions removed 19 transitions
Iterating global reduction 11 with 19 rules applied. Total rules applied 406 place count 946 transition count 1804
Partial Post-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 11 with 3 rules applied. Total rules applied 409 place count 946 transition count 1804
Applied a total of 409 rules in 638 ms. Remains 946 /1141 variables (removed 195) and now considering 1804/1996 (removed 192) transitions.
// Phase 1: matrix 1804 rows 946 cols
[2023-03-12 08:58:25] [INFO ] Computed 139 place invariants in 14 ms
[2023-03-12 08:58:26] [INFO ] Implicit Places using invariants in 828 ms returned [116, 133, 140, 141, 242, 248, 256, 327, 346, 353, 356, 362, 463, 479, 490, 548, 592, 604, 611, 665, 700, 713, 718, 719, 806, 815, 821, 942]
Discarding 28 places :
Implicit Place search using SMT only with invariants took 846 ms to find 28 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 918/1210 places, 1804/1996 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 909 transition count 1795
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 909 transition count 1795
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 908 transition count 1794
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 908 transition count 1794
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 2 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 0 with 10 rules applied. Total rules applied 30 place count 903 transition count 1789
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 31 place count 902 transition count 1787
Iterating global reduction 0 with 1 rules applied. Total rules applied 32 place count 902 transition count 1787
Free-agglomeration rule applied 3 times.
Iterating global reduction 0 with 3 rules applied. Total rules applied 35 place count 902 transition count 1784
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 38 place count 899 transition count 1784
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 39 place count 899 transition count 1783
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 40 place count 898 transition count 1783
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 41 place count 898 transition count 1783
Applied a total of 41 rules in 171 ms. Remains 898 /918 variables (removed 20) and now considering 1783/1804 (removed 21) transitions.
// Phase 1: matrix 1783 rows 898 cols
[2023-03-12 08:58:26] [INFO ] Computed 111 place invariants in 13 ms
[2023-03-12 08:58:27] [INFO ] Implicit Places using invariants in 672 ms returned []
[2023-03-12 08:58:27] [INFO ] Invariant cache hit.
[2023-03-12 08:58:28] [INFO ] State equation strengthened by 6 read => feed constraints.
[2023-03-12 08:58:30] [INFO ] Implicit Places using invariants and state equation in 2482 ms returned []
Implicit Place search using SMT with State Equation took 3169 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 898/1210 places, 1783/1996 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 5938 ms. Remains : 898/1210 places, 1783/1996 transitions.
Incomplete random walk after 10000 steps, including 83 resets, run finished after 175 ms. (steps per millisecond=57 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 14 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 15 resets, run finished after 134 ms. (steps per millisecond=74 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 97 ms. (steps per millisecond=103 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 252903 steps, run timeout after 3001 ms. (steps per millisecond=84 ) properties seen :{0=1}
Probabilistic random walk after 252903 steps, saw 74795 distinct states, run finished after 3001 ms. (steps per millisecond=84 ) properties seen :1
FORMULA ASLink-PT-07a-ReachabilityFireability-00 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
Running SMT prover for 3 properties.
[2023-03-12 08:58:33] [INFO ] Invariant cache hit.
[2023-03-12 08:58:33] [INFO ] After 167ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-12 08:58:34] [INFO ] [Nat]Absence check using 28 positive place invariants in 9 ms returned sat
[2023-03-12 08:58:34] [INFO ] [Nat]Absence check using 28 positive and 83 generalized place invariants in 40 ms returned sat
[2023-03-12 08:58:47] [INFO ] After 13505ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-12 08:58:47] [INFO ] State equation strengthened by 6 read => feed constraints.
[2023-03-12 08:58:58] [INFO ] After 10282ms SMT Verify possible using 6 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-12 08:58:58] [INFO ] After 11128ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :0
[2023-03-12 08:58:58] [INFO ] After 25025ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 139 ms.
Support contains 213 out of 898 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 898/898 places, 1783/1783 transitions.
Applied a total of 0 rules in 24 ms. Remains 898 /898 variables (removed 0) and now considering 1783/1783 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 37 ms. Remains : 898/898 places, 1783/1783 transitions.
Incomplete random walk after 10000 steps, including 99 resets, run finished after 117 ms. (steps per millisecond=85 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 17 resets, run finished after 80 ms. (steps per millisecond=125 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 196220 steps, run timeout after 3001 ms. (steps per millisecond=65 ) properties seen :{}
Probabilistic random walk after 196220 steps, saw 63678 distinct states, run finished after 3001 ms. (steps per millisecond=65 ) properties seen :0
Running SMT prover for 3 properties.
[2023-03-12 08:59:02] [INFO ] Invariant cache hit.
[2023-03-12 08:59:02] [INFO ] After 189ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-12 08:59:02] [INFO ] [Nat]Absence check using 28 positive place invariants in 21 ms returned sat
[2023-03-12 08:59:03] [INFO ] [Nat]Absence check using 28 positive and 83 generalized place invariants in 134 ms returned sat
[2023-03-12 08:59:22] [INFO ] After 19372ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-12 08:59:22] [INFO ] State equation strengthened by 6 read => feed constraints.
[2023-03-12 08:59:23] [INFO ] After 1399ms SMT Verify possible using 6 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-12 08:59:25] [INFO ] Deduced a trap composed of 47 places in 303 ms of which 5 ms to minimize.
[2023-03-12 08:59:25] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 446 ms
[2023-03-12 08:59:25] [INFO ] After 3219ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 1994 ms.
[2023-03-12 08:59:27] [INFO ] After 25013ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 84 ms.
Support contains 213 out of 898 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 898/898 places, 1783/1783 transitions.
Applied a total of 0 rules in 22 ms. Remains 898 /898 variables (removed 0) and now considering 1783/1783 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 22 ms. Remains : 898/898 places, 1783/1783 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 898/898 places, 1783/1783 transitions.
Applied a total of 0 rules in 19 ms. Remains 898 /898 variables (removed 0) and now considering 1783/1783 (removed 0) transitions.
[2023-03-12 08:59:27] [INFO ] Invariant cache hit.
[2023-03-12 08:59:28] [INFO ] Implicit Places using invariants in 637 ms returned []
[2023-03-12 08:59:28] [INFO ] Invariant cache hit.
[2023-03-12 08:59:29] [INFO ] State equation strengthened by 6 read => feed constraints.
[2023-03-12 08:59:30] [INFO ] Implicit Places using invariants and state equation in 2260 ms returned []
Implicit Place search using SMT with State Equation took 2916 ms to find 0 implicit places.
[2023-03-12 08:59:30] [INFO ] Redundant transitions in 80 ms returned []
[2023-03-12 08:59:30] [INFO ] Invariant cache hit.
[2023-03-12 08:59:31] [INFO ] Dead Transitions using invariants and state equation in 839 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3887 ms. Remains : 898/898 places, 1783/1783 transitions.
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 0 place count 898 transition count 1781
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 896 transition count 1781
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 894 transition count 1779
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 9 place count 894 transition count 1778
Applied a total of 9 rules in 39 ms. Remains 894 /898 variables (removed 4) and now considering 1778/1783 (removed 5) transitions.
Running SMT prover for 3 properties.
// Phase 1: matrix 1778 rows 894 cols
[2023-03-12 08:59:31] [INFO ] Computed 111 place invariants in 13 ms
[2023-03-12 08:59:32] [INFO ] After 223ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-12 08:59:32] [INFO ] [Nat]Absence check using 31 positive place invariants in 8 ms returned sat
[2023-03-12 08:59:32] [INFO ] [Nat]Absence check using 31 positive and 80 generalized place invariants in 24 ms returned sat
[2023-03-12 08:59:45] [INFO ] After 13404ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-12 08:59:56] [INFO ] Deduced a trap composed of 54 places in 250 ms of which 13 ms to minimize.
[2023-03-12 08:59:57] [INFO ] Deduced a trap composed of 53 places in 213 ms of which 5 ms to minimize.
[2023-03-12 08:59:57] [INFO ] Deduced a trap composed of 29 places in 250 ms of which 1 ms to minimize.
[2023-03-12 08:59:58] [INFO ] Deduced a trap composed of 49 places in 564 ms of which 0 ms to minimize.
[2023-03-12 08:59:58] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1665 ms
[2023-03-12 08:59:58] [INFO ] After 26081ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 2098 ms.
[2023-03-12 09:00:00] [INFO ] After 28489ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2023-03-12 09:00:00] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 23 ms.
[2023-03-12 09:00:00] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 898 places, 1783 transitions and 6990 arcs took 16 ms.
[2023-03-12 09:00:01] [INFO ] Flatten gal took : 193 ms
Total runtime 187006 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-sym model.pnml --lace-workers=4 --vset=lddmc --saturation=sat -rbs,w2W,ru,hf --sylvan-sizes=20,28,20,28 --inv-bin-par --invariant=/tmp/567/inv_0_ --invariant=/tmp/567/inv_1_ --invariant=/tmp/567/inv_2_ --inv-par
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393220 kB
MemFree: 9597196 kB
After kill :
MemTotal: 16393220 kB
MemFree: 16095784 kB

BK_TIME_CONFINEMENT_REACHED

--------------------
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.202303021504.jar
+ 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
mcc2023

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="ASLink-PT-07a"
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-5348"
echo " Executing tool ltsminxred"
echo " Input is ASLink-PT-07a, 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 r009-oct2-167813597400111"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/ASLink-PT-07a.tgz
mv ASLink-PT-07a 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 ;