Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2023-input.r037-tajo-167813690500527.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2023-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
.......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool itstools
Input is BusinessProcesses-PT-10, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r037-tajo-167813690500527
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 580K
-rw-r--r-- 1 mcc users 6.2K Feb 25 16:51 CTLCardinality.txt
-rw-r--r-- 1 mcc users 65K Feb 25 16:51 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K Feb 25 16:50 CTLFireability.txt
-rw-r--r-- 1 mcc users 50K Feb 25 16:50 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.3K Feb 25 15:39 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Feb 25 15:39 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 15:39 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 15:39 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Feb 25 16:52 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 149K Feb 25 16:52 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.6K Feb 25 16:52 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 52K Feb 25 16:52 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 15:39 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 15:39 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 131K 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 BusinessProcesses-PT-10-ReachabilityFireability-00
FORMULA_NAME BusinessProcesses-PT-10-ReachabilityFireability-01
FORMULA_NAME BusinessProcesses-PT-10-ReachabilityFireability-02
FORMULA_NAME BusinessProcesses-PT-10-ReachabilityFireability-03
FORMULA_NAME BusinessProcesses-PT-10-ReachabilityFireability-04
FORMULA_NAME BusinessProcesses-PT-10-ReachabilityFireability-05
FORMULA_NAME BusinessProcesses-PT-10-ReachabilityFireability-06
FORMULA_NAME BusinessProcesses-PT-10-ReachabilityFireability-07
FORMULA_NAME BusinessProcesses-PT-10-ReachabilityFireability-08
FORMULA_NAME BusinessProcesses-PT-10-ReachabilityFireability-09
FORMULA_NAME BusinessProcesses-PT-10-ReachabilityFireability-10
FORMULA_NAME BusinessProcesses-PT-10-ReachabilityFireability-11
FORMULA_NAME BusinessProcesses-PT-10-ReachabilityFireability-12
FORMULA_NAME BusinessProcesses-PT-10-ReachabilityFireability-13
FORMULA_NAME BusinessProcesses-PT-10-ReachabilityFireability-14
FORMULA_NAME BusinessProcesses-PT-10-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1678361792205

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=itstools
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BusinessProcesses-PT-10
Not applying reductions.
Model is PT
ReachabilityFireability PT
Running Version 202303021504
[2023-03-09 11:36:34] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2023-03-09 11:36:34] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-09 11:36:34] [INFO ] Load time of PNML (sax parser for PT used): 94 ms
[2023-03-09 11:36:34] [INFO ] Transformed 518 places.
[2023-03-09 11:36:34] [INFO ] Transformed 471 transitions.
[2023-03-09 11:36:34] [INFO ] Found NUPN structural information;
[2023-03-09 11:36:34] [INFO ] Parsed PT model containing 518 places and 471 transitions and 1415 arcs in 180 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 11 ms.
Working with output stream class java.io.PrintStream
[2023-03-09 11:36:34] [INFO ] Flatten gal took : 119 ms
[2023-03-09 11:36:34] [INFO ] Flatten gal took : 148 ms
Incomplete random walk after 10000 steps, including 80 resets, run finished after 546 ms. (steps per millisecond=18 ) properties (out of 16) seen :7
FORMULA BusinessProcesses-PT-10-ReachabilityFireability-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-10-ReachabilityFireability-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-10-ReachabilityFireability-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-10-ReachabilityFireability-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-10-ReachabilityFireability-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-10-ReachabilityFireability-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-10-ReachabilityFireability-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
[2023-03-09 11:36:34] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality15258819774691718743.gal : 30 ms
[2023-03-09 11:36:35] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality3862842439300744477.prop : 3 ms
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 83 ms. (steps per millisecond=120 ) properties (out of 9) seen :0
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality15258819774691718743.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality3862842439300744477.prop' '--nowitness' '--gen-order' 'FOLLOW'
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 9) seen :1

FORMULA BusinessProcesses-PT-10-ReachabilityFireability-08 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 8) seen :0
Loading property file /tmp/ReachabilityCardinality3862842439300744477.prop.
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 8) seen :1
SDD proceeding with computation,16 properties remain. new max is 4
FORMULA BusinessProcesses-PT-10-ReachabilityFireability-05 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
SDD size :1 after 5
SDD proceeding with computation,16 properties remain. new max is 8
SDD size :5 after 10
SDD proceeding with computation,16 properties remain. new max is 16
SDD size :10 after 19
SDD proceeding with computation,16 properties remain. new max is 32
SDD size :19 after 22
SDD proceeding with computation,16 properties remain. new max is 64
SDD size :22 after 197
SDD proceeding with computation,16 properties remain. new max is 128
SDD size :197 after 391
Incomplete Best-First random walk after 10000 steps, including 12 resets, run finished after 86 ms. (steps per millisecond=116 ) properties (out of 7) seen :0
SDD proceeding with computation,16 properties remain. new max is 256
SDD size :391 after 3.84528e+14
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 7) seen :1
FORMULA BusinessProcesses-PT-10-ReachabilityFireability-07 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
// Phase 1: matrix 471 rows 518 cols
[2023-03-09 11:36:35] [INFO ] Computed 85 place invariants in 25 ms
[2023-03-09 11:36:35] [INFO ] After 256ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-09 11:36:35] [INFO ] [Nat]Absence check using 48 positive place invariants in 13 ms returned sat
[2023-03-09 11:36:35] [INFO ] [Nat]Absence check using 48 positive and 37 generalized place invariants in 10 ms returned sat
[2023-03-09 11:36:36] [INFO ] After 390ms SMT Verify possible using state equation in natural domain returned unsat :3 sat :3
[2023-03-09 11:36:36] [INFO ] Deduced a trap composed of 10 places in 102 ms of which 4 ms to minimize.
[2023-03-09 11:36:36] [INFO ] Deduced a trap composed of 12 places in 55 ms of which 1 ms to minimize.
[2023-03-09 11:36:36] [INFO ] Deduced a trap composed of 15 places in 72 ms of which 1 ms to minimize.
[2023-03-09 11:36:36] [INFO ] Deduced a trap composed of 11 places in 75 ms of which 1 ms to minimize.
[2023-03-09 11:36:36] [INFO ] Deduced a trap composed of 14 places in 97 ms of which 1 ms to minimize.
[2023-03-09 11:36:36] [INFO ] Deduced a trap composed of 15 places in 87 ms of which 1 ms to minimize.
[2023-03-09 11:36:37] [INFO ] Deduced a trap composed of 32 places in 100 ms of which 1 ms to minimize.
[2023-03-09 11:36:37] [INFO ] Deduced a trap composed of 33 places in 62 ms of which 0 ms to minimize.
[2023-03-09 11:36:37] [INFO ] Deduced a trap composed of 23 places in 123 ms of which 1 ms to minimize.
[2023-03-09 11:36:37] [INFO ] Deduced a trap composed of 16 places in 86 ms of which 1 ms to minimize.
[2023-03-09 11:36:37] [INFO ] Deduced a trap composed of 26 places in 79 ms of which 1 ms to minimize.
[2023-03-09 11:36:37] [INFO ] Deduced a trap composed of 31 places in 113 ms of which 1 ms to minimize.
[2023-03-09 11:36:37] [INFO ] Deduced a trap composed of 25 places in 68 ms of which 1 ms to minimize.
[2023-03-09 11:36:37] [INFO ] Deduced a trap composed of 22 places in 68 ms of which 1 ms to minimize.
[2023-03-09 11:36:37] [INFO ] Deduced a trap composed of 21 places in 64 ms of which 1 ms to minimize.
[2023-03-09 11:36:37] [INFO ] Trap strengthening (SAT) tested/added 16/15 trap constraints in 1586 ms
[2023-03-09 11:36:38] [INFO ] Deduced a trap composed of 25 places in 91 ms of which 1 ms to minimize.
[2023-03-09 11:36:38] [INFO ] Deduced a trap composed of 23 places in 83 ms of which 1 ms to minimize.
[2023-03-09 11:36:38] [INFO ] Deduced a trap composed of 28 places in 74 ms of which 1 ms to minimize.
[2023-03-09 11:36:38] [INFO ] Deduced a trap composed of 45 places in 87 ms of which 0 ms to minimize.
[2023-03-09 11:36:38] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 564 ms
[2023-03-09 11:36:39] [INFO ] Deduced a trap composed of 113 places in 218 ms of which 1 ms to minimize.
[2023-03-09 11:36:39] [INFO ] Deduced a trap composed of 107 places in 137 ms of which 1 ms to minimize.
[2023-03-09 11:36:39] [INFO ] Deduced a trap composed of 116 places in 134 ms of which 1 ms to minimize.
[2023-03-09 11:36:39] [INFO ] Deduced a trap composed of 113 places in 167 ms of which 1 ms to minimize.
[2023-03-09 11:36:39] [INFO ] Deduced a trap composed of 117 places in 160 ms of which 1 ms to minimize.
[2023-03-09 11:36:40] [INFO ] Deduced a trap composed of 120 places in 133 ms of which 1 ms to minimize.
[2023-03-09 11:36:40] [INFO ] Deduced a trap composed of 115 places in 131 ms of which 1 ms to minimize.
[2023-03-09 11:36:40] [INFO ] Deduced a trap composed of 120 places in 130 ms of which 0 ms to minimize.
[2023-03-09 11:36:40] [INFO ] Deduced a trap composed of 125 places in 129 ms of which 0 ms to minimize.
[2023-03-09 11:36:40] [INFO ] Deduced a trap composed of 115 places in 186 ms of which 0 ms to minimize.
[2023-03-09 11:36:41] [INFO ] Deduced a trap composed of 120 places in 183 ms of which 1 ms to minimize.
[2023-03-09 11:36:41] [INFO ] Deduced a trap composed of 124 places in 172 ms of which 0 ms to minimize.
[2023-03-09 11:36:41] [INFO ] Deduced a trap composed of 129 places in 177 ms of which 1 ms to minimize.
[2023-03-09 11:36:41] [INFO ] Deduced a trap composed of 127 places in 140 ms of which 1 ms to minimize.
[2023-03-09 11:36:41] [INFO ] Deduced a trap composed of 112 places in 171 ms of which 1 ms to minimize.
[2023-03-09 11:36:42] [INFO ] Deduced a trap composed of 121 places in 159 ms of which 0 ms to minimize.
[2023-03-09 11:36:42] [INFO ] Deduced a trap composed of 116 places in 173 ms of which 0 ms to minimize.
[2023-03-09 11:36:42] [INFO ] Deduced a trap composed of 125 places in 167 ms of which 1 ms to minimize.
[2023-03-09 11:36:42] [INFO ] Deduced a trap composed of 114 places in 157 ms of which 1 ms to minimize.
[2023-03-09 11:36:42] [INFO ] Deduced a trap composed of 124 places in 141 ms of which 0 ms to minimize.
[2023-03-09 11:36:43] [INFO ] Deduced a trap composed of 121 places in 140 ms of which 1 ms to minimize.
[2023-03-09 11:36:43] [INFO ] Deduced a trap composed of 30 places in 175 ms of which 1 ms to minimize.
[2023-03-09 11:36:43] [INFO ] Deduced a trap composed of 25 places in 160 ms of which 0 ms to minimize.
[2023-03-09 11:36:43] [INFO ] Deduced a trap composed of 44 places in 142 ms of which 5 ms to minimize.
[2023-03-09 11:36:44] [INFO ] Deduced a trap composed of 24 places in 133 ms of which 0 ms to minimize.
[2023-03-09 11:36:44] [INFO ] Deduced a trap composed of 118 places in 147 ms of which 0 ms to minimize.
[2023-03-09 11:36:44] [INFO ] Deduced a trap composed of 53 places in 159 ms of which 1 ms to minimize.
[2023-03-09 11:36:44] [INFO ] Deduced a trap composed of 49 places in 148 ms of which 1 ms to minimize.
[2023-03-09 11:36:44] [INFO ] Deduced a trap composed of 8 places in 179 ms of which 1 ms to minimize.
[2023-03-09 11:36:45] [INFO ] Deduced a trap composed of 124 places in 180 ms of which 1 ms to minimize.
[2023-03-09 11:36:45] [INFO ] Deduced a trap composed of 124 places in 175 ms of which 1 ms to minimize.
[2023-03-09 11:36:45] [INFO ] Deduced a trap composed of 117 places in 180 ms of which 2 ms to minimize.
[2023-03-09 11:36:46] [INFO ] Deduced a trap composed of 130 places in 179 ms of which 2 ms to minimize.
[2023-03-09 11:36:46] [INFO ] Deduced a trap composed of 128 places in 181 ms of which 1 ms to minimize.
[2023-03-09 11:36:46] [INFO ] Deduced a trap composed of 127 places in 177 ms of which 1 ms to minimize.
[2023-03-09 11:36:47] [INFO ] Deduced a trap composed of 124 places in 176 ms of which 1 ms to minimize.
[2023-03-09 11:36:47] [INFO ] Deduced a trap composed of 111 places in 175 ms of which 1 ms to minimize.
[2023-03-09 11:36:47] [INFO ] Deduced a trap composed of 114 places in 171 ms of which 0 ms to minimize.
[2023-03-09 11:36:47] [INFO ] Deduced a trap composed of 27 places in 147 ms of which 1 ms to minimize.
[2023-03-09 11:36:48] [INFO ] Deduced a trap composed of 114 places in 161 ms of which 1 ms to minimize.
[2023-03-09 11:36:48] [INFO ] Deduced a trap composed of 122 places in 184 ms of which 4 ms to minimize.
[2023-03-09 11:36:48] [INFO ] Deduced a trap composed of 117 places in 137 ms of which 1 ms to minimize.
[2023-03-09 11:36:48] [INFO ] Deduced a trap composed of 113 places in 168 ms of which 0 ms to minimize.
[2023-03-09 11:36:49] [INFO ] Deduced a trap composed of 119 places in 166 ms of which 0 ms to minimize.
[2023-03-09 11:36:49] [INFO ] Deduced a trap composed of 133 places in 177 ms of which 2 ms to minimize.
[2023-03-09 11:36:49] [INFO ] Deduced a trap composed of 144 places in 180 ms of which 11 ms to minimize.
[2023-03-09 11:36:50] [INFO ] Deduced a trap composed of 137 places in 183 ms of which 3 ms to minimize.
[2023-03-09 11:36:50] [INFO ] Deduced a trap composed of 137 places in 164 ms of which 1 ms to minimize.
[2023-03-09 11:36:50] [INFO ] Deduced a trap composed of 22 places in 143 ms of which 3 ms to minimize.
[2023-03-09 11:36:50] [INFO ] Deduced a trap composed of 122 places in 179 ms of which 14 ms to minimize.
[2023-03-09 11:36:50] [INFO ] Deduced a trap composed of 112 places in 167 ms of which 1 ms to minimize.
[2023-03-09 11:36:51] [INFO ] Deduced a trap composed of 111 places in 148 ms of which 0 ms to minimize.
[2023-03-09 11:36:51] [INFO ] Deduced a trap composed of 120 places in 186 ms of which 1 ms to minimize.
[2023-03-09 11:36:51] [INFO ] Deduced a trap composed of 24 places in 187 ms of which 1 ms to minimize.
[2023-03-09 11:36:52] [INFO ] Deduced a trap composed of 27 places in 198 ms of which 0 ms to minimize.
[2023-03-09 11:36:52] [INFO ] Deduced a trap composed of 130 places in 176 ms of which 1 ms to minimize.
[2023-03-09 11:36:52] [INFO ] Deduced a trap composed of 35 places in 174 ms of which 1 ms to minimize.
[2023-03-09 11:36:52] [INFO ] Deduced a trap composed of 124 places in 182 ms of which 1 ms to minimize.
[2023-03-09 11:36:53] [INFO ] Deduced a trap composed of 117 places in 168 ms of which 1 ms to minimize.
[2023-03-09 11:36:53] [INFO ] Deduced a trap composed of 110 places in 175 ms of which 1 ms to minimize.
[2023-03-09 11:36:53] [INFO ] Deduced a trap composed of 114 places in 175 ms of which 0 ms to minimize.
[2023-03-09 11:36:54] [INFO ] Deduced a trap composed of 119 places in 179 ms of which 0 ms to minimize.
[2023-03-09 11:36:54] [INFO ] Deduced a trap composed of 115 places in 174 ms of which 1 ms to minimize.
[2023-03-09 11:36:54] [INFO ] Deduced a trap composed of 123 places in 168 ms of which 0 ms to minimize.
[2023-03-09 11:36:54] [INFO ] Deduced a trap composed of 122 places in 171 ms of which 1 ms to minimize.
[2023-03-09 11:36:55] [INFO ] Deduced a trap composed of 127 places in 186 ms of which 0 ms to minimize.
[2023-03-09 11:36:55] [INFO ] Deduced a trap composed of 127 places in 143 ms of which 0 ms to minimize.
[2023-03-09 11:36:56] [INFO ] Deduced a trap composed of 118 places in 181 ms of which 1 ms to minimize.
[2023-03-09 11:36:56] [INFO ] Deduced a trap composed of 117 places in 163 ms of which 0 ms to minimize.
[2023-03-09 11:36:56] [INFO ] Deduced a trap composed of 110 places in 170 ms of which 1 ms to minimize.
[2023-03-09 11:36:56] [INFO ] Deduced a trap composed of 117 places in 146 ms of which 1 ms to minimize.
[2023-03-09 11:36:56] [INFO ] Deduced a trap composed of 120 places in 149 ms of which 1 ms to minimize.
[2023-03-09 11:36:57] [INFO ] Deduced a trap composed of 133 places in 180 ms of which 1 ms to minimize.
[2023-03-09 11:36:57] [INFO ] Deduced a trap composed of 130 places in 167 ms of which 1 ms to minimize.
[2023-03-09 11:36:57] [INFO ] Deduced a trap composed of 117 places in 177 ms of which 1 ms to minimize.
[2023-03-09 11:36:58] [INFO ] Deduced a trap composed of 123 places in 174 ms of which 1 ms to minimize.
[2023-03-09 11:36:58] [INFO ] Deduced a trap composed of 120 places in 139 ms of which 1 ms to minimize.
[2023-03-09 11:36:59] [INFO ] Deduced a trap composed of 119 places in 181 ms of which 1 ms to minimize.
[2023-03-09 11:36:59] [INFO ] Deduced a trap composed of 118 places in 179 ms of which 1 ms to minimize.
[2023-03-09 11:37:00] [INFO ] Deduced a trap composed of 121 places in 162 ms of which 0 ms to minimize.
[2023-03-09 11:37:00] [INFO ] Deduced a trap composed of 117 places in 178 ms of which 1 ms to minimize.
[2023-03-09 11:37:00] [INFO ] Deduced a trap composed of 120 places in 142 ms of which 1 ms to minimize.
[2023-03-09 11:37:00] [INFO ] Trap strengthening (SAT) tested/added 82/82 trap constraints in 21984 ms
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:769)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:902)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-09 11:37:00] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-09 11:37:00] [INFO ] After 25020ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:6
FORMULA BusinessProcesses-PT-10-ReachabilityFireability-04 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BusinessProcesses-PT-10-ReachabilityFireability-01 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BusinessProcesses-PT-10-ReachabilityFireability-00 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 6 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 61 ms.
Support contains 85 out of 518 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 518/518 places, 471/471 transitions.
Graph (complete) has 1071 edges and 518 vertex of which 517 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 45 transitions
Trivial Post-agglo rules discarded 45 transitions
Performed 45 trivial Post agglomeration. Transition count delta: 45
Iterating post reduction 0 with 45 rules applied. Total rules applied 46 place count 517 transition count 426
Reduce places removed 45 places and 0 transitions.
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Iterating post reduction 1 with 59 rules applied. Total rules applied 105 place count 472 transition count 412
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 2 with 14 rules applied. Total rules applied 119 place count 458 transition count 412
Performed 83 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 83 Pre rules applied. Total rules applied 119 place count 458 transition count 329
Deduced a syphon composed of 83 places in 2 ms
Ensure Unique test removed 10 places
Reduce places removed 93 places and 0 transitions.
Iterating global reduction 3 with 176 rules applied. Total rules applied 295 place count 365 transition count 329
Discarding 45 places :
Symmetric choice reduction at 3 with 45 rule applications. Total rules 340 place count 320 transition count 284
Iterating global reduction 3 with 45 rules applied. Total rules applied 385 place count 320 transition count 284
Performed 66 Post agglomeration using F-continuation condition.Transition count delta: 66
Deduced a syphon composed of 66 places in 1 ms
Reduce places removed 66 places and 0 transitions.
Iterating global reduction 3 with 132 rules applied. Total rules applied 517 place count 254 transition count 218
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 518 place count 254 transition count 217
Partial Free-agglomeration rule applied 5 times.
Drop transitions removed 5 transitions
Iterating global reduction 3 with 5 rules applied. Total rules applied 523 place count 254 transition count 217
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 524 place count 253 transition count 216
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 525 place count 252 transition count 216
Applied a total of 525 rules in 153 ms. Remains 252 /518 variables (removed 266) and now considering 216/471 (removed 255) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 154 ms. Remains : 252/518 places, 216/471 transitions.
Incomplete random walk after 10000 steps, including 200 resets, run finished after 225 ms. (steps per millisecond=44 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 42 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 38 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 39 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 934195 steps, run timeout after 3001 ms. (steps per millisecond=311 ) properties seen :{1=1}
Probabilistic random walk after 934195 steps, saw 135386 distinct states, run finished after 3002 ms. (steps per millisecond=311 ) properties seen :1
FORMULA BusinessProcesses-PT-10-ReachabilityFireability-06 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
Running SMT prover for 2 properties.
// Phase 1: matrix 216 rows 252 cols
[2023-03-09 11:37:04] [INFO ] Computed 73 place invariants in 22 ms
[2023-03-09 11:37:04] [INFO ] After 57ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-09 11:37:04] [INFO ] [Nat]Absence check using 45 positive place invariants in 6 ms returned sat
[2023-03-09 11:37:04] [INFO ] [Nat]Absence check using 45 positive and 28 generalized place invariants in 7 ms returned sat
[2023-03-09 11:37:04] [INFO ] After 106ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-09 11:37:04] [INFO ] Deduced a trap composed of 5 places in 57 ms of which 0 ms to minimize.
[2023-03-09 11:37:04] [INFO ] Deduced a trap composed of 5 places in 59 ms of which 0 ms to minimize.
[2023-03-09 11:37:04] [INFO ] Deduced a trap composed of 12 places in 50 ms of which 0 ms to minimize.
[2023-03-09 11:37:04] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 207 ms
[2023-03-09 11:37:05] [INFO ] Deduced a trap composed of 5 places in 88 ms of which 0 ms to minimize.
[2023-03-09 11:37:05] [INFO ] Deduced a trap composed of 22 places in 65 ms of which 0 ms to minimize.
[2023-03-09 11:37:05] [INFO ] Deduced a trap composed of 9 places in 67 ms of which 1 ms to minimize.
[2023-03-09 11:37:05] [INFO ] Deduced a trap composed of 4 places in 78 ms of which 0 ms to minimize.
[2023-03-09 11:37:05] [INFO ] Deduced a trap composed of 46 places in 65 ms of which 1 ms to minimize.
[2023-03-09 11:37:05] [INFO ] Deduced a trap composed of 43 places in 66 ms of which 0 ms to minimize.
[2023-03-09 11:37:05] [INFO ] Deduced a trap composed of 42 places in 63 ms of which 0 ms to minimize.
[2023-03-09 11:37:05] [INFO ] Deduced a trap composed of 47 places in 62 ms of which 1 ms to minimize.
[2023-03-09 11:37:05] [INFO ] Deduced a trap composed of 45 places in 63 ms of which 0 ms to minimize.
[2023-03-09 11:37:05] [INFO ] Deduced a trap composed of 48 places in 62 ms of which 1 ms to minimize.
[2023-03-09 11:37:05] [INFO ] Deduced a trap composed of 46 places in 62 ms of which 0 ms to minimize.
[2023-03-09 11:37:05] [INFO ] Deduced a trap composed of 50 places in 65 ms of which 1 ms to minimize.
[2023-03-09 11:37:06] [INFO ] Deduced a trap composed of 5 places in 63 ms of which 0 ms to minimize.
[2023-03-09 11:37:06] [INFO ] Deduced a trap composed of 53 places in 61 ms of which 0 ms to minimize.
[2023-03-09 11:37:06] [INFO ] Deduced a trap composed of 45 places in 88 ms of which 0 ms to minimize.
[2023-03-09 11:37:06] [INFO ] Deduced a trap composed of 44 places in 76 ms of which 1 ms to minimize.
[2023-03-09 11:37:06] [INFO ] Deduced a trap composed of 47 places in 86 ms of which 0 ms to minimize.
[2023-03-09 11:37:06] [INFO ] Deduced a trap composed of 47 places in 69 ms of which 1 ms to minimize.
[2023-03-09 11:37:06] [INFO ] Deduced a trap composed of 47 places in 66 ms of which 0 ms to minimize.
[2023-03-09 11:37:06] [INFO ] Deduced a trap composed of 48 places in 59 ms of which 0 ms to minimize.
[2023-03-09 11:37:06] [INFO ] Deduced a trap composed of 47 places in 79 ms of which 0 ms to minimize.
[2023-03-09 11:37:06] [INFO ] Deduced a trap composed of 19 places in 76 ms of which 1 ms to minimize.
[2023-03-09 11:37:07] [INFO ] Deduced a trap composed of 48 places in 78 ms of which 1 ms to minimize.
[2023-03-09 11:37:07] [INFO ] Deduced a trap composed of 47 places in 110 ms of which 1 ms to minimize.
[2023-03-09 11:37:07] [INFO ] Deduced a trap composed of 47 places in 79 ms of which 1 ms to minimize.
[2023-03-09 11:37:07] [INFO ] Deduced a trap composed of 16 places in 53 ms of which 1 ms to minimize.
[2023-03-09 11:37:07] [INFO ] Trap strengthening (SAT) tested/added 27/26 trap constraints in 2392 ms
[2023-03-09 11:37:07] [INFO ] After 2791ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 121 ms.
[2023-03-09 11:37:07] [INFO ] After 2994ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 24 ms.
Support contains 42 out of 252 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 252/252 places, 216/216 transitions.
Graph (trivial) has 45 edges and 252 vertex of which 2 / 252 are part of one of the 1 SCC in 5 ms
Free SCC test removed 1 places
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 0 with 11 rules applied. Total rules applied 12 place count 251 transition count 203
Reduce places removed 11 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 12 rules applied. Total rules applied 24 place count 240 transition count 202
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 25 place count 239 transition count 202
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 8 Pre rules applied. Total rules applied 25 place count 239 transition count 194
Deduced a syphon composed of 8 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 3 with 17 rules applied. Total rules applied 42 place count 230 transition count 194
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 44 place count 228 transition count 192
Iterating global reduction 3 with 2 rules applied. Total rules applied 46 place count 228 transition count 192
Performed 21 Post agglomeration using F-continuation condition.Transition count delta: 21
Deduced a syphon composed of 21 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 3 with 43 rules applied. Total rules applied 89 place count 206 transition count 171
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 93 place count 204 transition count 172
Free-agglomeration rule applied 2 times.
Iterating global reduction 3 with 2 rules applied. Total rules applied 95 place count 204 transition count 170
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 97 place count 202 transition count 170
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 98 place count 201 transition count 169
Applied a total of 98 rules in 70 ms. Remains 201 /252 variables (removed 51) and now considering 169/216 (removed 47) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 70 ms. Remains : 201/252 places, 169/216 transitions.
Incomplete random walk after 10000 steps, including 176 resets, run finished after 136 ms. (steps per millisecond=73 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 38 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 2) seen :1
FORMULA BusinessProcesses-PT-10-ReachabilityFireability-03 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Finished Best-First random walk after 6865 steps, including 15 resets, run visited all 1 properties in 18 ms. (steps per millisecond=381 )
FORMULA BusinessProcesses-PT-10-ReachabilityFireability-09 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
ITS runner failed with exception null
java.lang.InterruptedException
at java.base/java.lang.Object.wait(Native Method)
at java.base/java.lang.Thread.join(Thread.java:1304)
at java.base/java.lang.Thread.join(Thread.java:1372)
at fr.lip6.move.gal.application.runner.AbstractRunner.join(AbstractRunner.java:27)
at fr.lip6.move.gal.application.runner.its.ITSRunner.join(ITSRunner.java:177)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.verifyWithSDD(GlobalPropertySolver.java:675)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.lambda$2(ReachabilitySolver.java:63)
at java.base/java.lang.Thread.run(Thread.java:833)
All properties solved without resorting to model-checking.
Total runtime 33686 ms.

BK_STOP 1678361828285

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ ReachabilityFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution ReachabilityFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ 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//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

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="BusinessProcesses-PT-10"
export BK_EXAMINATION="ReachabilityFireability"
export BK_TOOL="itstools"
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 itstools"
echo " Input is BusinessProcesses-PT-10, 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 r037-tajo-167813690500527"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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