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.r041-tajo-167813694900606.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 ltsminxred
Input is BusinessProcesses-PT-20, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r041-tajo-167813694900606
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 632K
-rw-r--r-- 1 mcc users 7.9K Feb 25 16:50 CTLCardinality.txt
-rw-r--r-- 1 mcc users 86K Feb 25 16:50 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.2K Feb 25 16:49 CTLFireability.txt
-rw-r--r-- 1 mcc users 45K Feb 25 16:49 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.5K Feb 25 15:39 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 25 15:39 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 15:39 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 15:39 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Feb 25 16:51 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 129K Feb 25 16:51 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.2K Feb 25 16:50 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 47K Feb 25 16:50 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 192K 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-20-ReachabilityCardinality-00
FORMULA_NAME BusinessProcesses-PT-20-ReachabilityCardinality-01
FORMULA_NAME BusinessProcesses-PT-20-ReachabilityCardinality-02
FORMULA_NAME BusinessProcesses-PT-20-ReachabilityCardinality-03
FORMULA_NAME BusinessProcesses-PT-20-ReachabilityCardinality-04
FORMULA_NAME BusinessProcesses-PT-20-ReachabilityCardinality-05
FORMULA_NAME BusinessProcesses-PT-20-ReachabilityCardinality-06
FORMULA_NAME BusinessProcesses-PT-20-ReachabilityCardinality-07
FORMULA_NAME BusinessProcesses-PT-20-ReachabilityCardinality-08
FORMULA_NAME BusinessProcesses-PT-20-ReachabilityCardinality-09
FORMULA_NAME BusinessProcesses-PT-20-ReachabilityCardinality-10
FORMULA_NAME BusinessProcesses-PT-20-ReachabilityCardinality-11
FORMULA_NAME BusinessProcesses-PT-20-ReachabilityCardinality-12
FORMULA_NAME BusinessProcesses-PT-20-ReachabilityCardinality-13
FORMULA_NAME BusinessProcesses-PT-20-ReachabilityCardinality-14
FORMULA_NAME BusinessProcesses-PT-20-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1678649963384

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=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BusinessProcesses-PT-20
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-12 19:39:24] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-12 19:39:25] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-12 19:39:25] [INFO ] Load time of PNML (sax parser for PT used): 109 ms
[2023-03-12 19:39:25] [INFO ] Transformed 782 places.
[2023-03-12 19:39:25] [INFO ] Transformed 697 transitions.
[2023-03-12 19:39:25] [INFO ] Found NUPN structural information;
[2023-03-12 19:39:25] [INFO ] Parsed PT model containing 782 places and 697 transitions and 2011 arcs in 229 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 25 ms.
Working with output stream class java.io.PrintStream
Deduced a syphon composed of 63 places in 29 ms
Reduce places removed 63 places and 59 transitions.
FORMULA BusinessProcesses-PT-20-ReachabilityCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-20-ReachabilityCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-20-ReachabilityCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-20-ReachabilityCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-20-ReachabilityCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-20-ReachabilityCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-20-ReachabilityCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 50 resets, run finished after 386 ms. (steps per millisecond=25 ) properties (out of 9) seen :3
FORMULA BusinessProcesses-PT-20-ReachabilityCardinality-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-20-ReachabilityCardinality-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-20-ReachabilityCardinality-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 102 ms. (steps per millisecond=98 ) properties (out of 6) seen :1
FORMULA BusinessProcesses-PT-20-ReachabilityCardinality-04 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 9 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
// Phase 1: matrix 638 rows 719 cols
[2023-03-12 19:39:26] [INFO ] Computed 121 place invariants in 34 ms
[2023-03-12 19:39:26] [INFO ] [Real]Absence check using 78 positive place invariants in 44 ms returned sat
[2023-03-12 19:39:26] [INFO ] [Real]Absence check using 78 positive and 43 generalized place invariants in 35 ms returned sat
[2023-03-12 19:39:26] [INFO ] After 475ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-12 19:39:26] [INFO ] [Nat]Absence check using 78 positive place invariants in 34 ms returned sat
[2023-03-12 19:39:26] [INFO ] [Nat]Absence check using 78 positive and 43 generalized place invariants in 12 ms returned sat
[2023-03-12 19:39:27] [INFO ] After 656ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-12 19:39:27] [INFO ] Deduced a trap composed of 8 places in 122 ms of which 7 ms to minimize.
[2023-03-12 19:39:27] [INFO ] Deduced a trap composed of 30 places in 100 ms of which 1 ms to minimize.
[2023-03-12 19:39:27] [INFO ] Deduced a trap composed of 40 places in 113 ms of which 0 ms to minimize.
[2023-03-12 19:39:28] [INFO ] Deduced a trap composed of 23 places in 85 ms of which 1 ms to minimize.
[2023-03-12 19:39:28] [INFO ] Deduced a trap composed of 44 places in 108 ms of which 1 ms to minimize.
[2023-03-12 19:39:28] [INFO ] Deduced a trap composed of 29 places in 86 ms of which 1 ms to minimize.
[2023-03-12 19:39:28] [INFO ] Deduced a trap composed of 37 places in 95 ms of which 0 ms to minimize.
[2023-03-12 19:39:28] [INFO ] Deduced a trap composed of 26 places in 86 ms of which 1 ms to minimize.
[2023-03-12 19:39:28] [INFO ] Deduced a trap composed of 39 places in 88 ms of which 0 ms to minimize.
[2023-03-12 19:39:28] [INFO ] Deduced a trap composed of 47 places in 83 ms of which 0 ms to minimize.
[2023-03-12 19:39:28] [INFO ] Deduced a trap composed of 38 places in 85 ms of which 1 ms to minimize.
[2023-03-12 19:39:28] [INFO ] Deduced a trap composed of 47 places in 88 ms of which 0 ms to minimize.
[2023-03-12 19:39:29] [INFO ] Deduced a trap composed of 61 places in 90 ms of which 0 ms to minimize.
[2023-03-12 19:39:29] [INFO ] Deduced a trap composed of 52 places in 85 ms of which 0 ms to minimize.
[2023-03-12 19:39:29] [INFO ] Deduced a trap composed of 31 places in 94 ms of which 1 ms to minimize.
[2023-03-12 19:39:29] [INFO ] Deduced a trap composed of 25 places in 95 ms of which 1 ms to minimize.
[2023-03-12 19:39:29] [INFO ] Deduced a trap composed of 56 places in 109 ms of which 1 ms to minimize.
[2023-03-12 19:39:29] [INFO ] Deduced a trap composed of 58 places in 151 ms of which 0 ms to minimize.
[2023-03-12 19:39:29] [INFO ] Deduced a trap composed of 60 places in 76 ms of which 1 ms to minimize.
[2023-03-12 19:39:29] [INFO ] Deduced a trap composed of 55 places in 85 ms of which 0 ms to minimize.
[2023-03-12 19:39:29] [INFO ] Trap strengthening (SAT) tested/added 21/20 trap constraints in 2372 ms
[2023-03-12 19:39:30] [INFO ] Deduced a trap composed of 126 places in 207 ms of which 0 ms to minimize.
[2023-03-12 19:39:30] [INFO ] Deduced a trap composed of 25 places in 161 ms of which 1 ms to minimize.
[2023-03-12 19:39:30] [INFO ] Deduced a trap composed of 20 places in 145 ms of which 0 ms to minimize.
[2023-03-12 19:39:30] [INFO ] Deduced a trap composed of 129 places in 143 ms of which 0 ms to minimize.
[2023-03-12 19:39:30] [INFO ] Deduced a trap composed of 130 places in 145 ms of which 1 ms to minimize.
[2023-03-12 19:39:31] [INFO ] Deduced a trap composed of 135 places in 141 ms of which 1 ms to minimize.
[2023-03-12 19:39:31] [INFO ] Deduced a trap composed of 129 places in 155 ms of which 1 ms to minimize.
[2023-03-12 19:39:31] [INFO ] Deduced a trap composed of 145 places in 187 ms of which 1 ms to minimize.
[2023-03-12 19:39:31] [INFO ] Deduced a trap composed of 31 places in 148 ms of which 0 ms to minimize.
[2023-03-12 19:39:32] [INFO ] Deduced a trap composed of 31 places in 156 ms of which 0 ms to minimize.
[2023-03-12 19:39:32] [INFO ] Deduced a trap composed of 128 places in 140 ms of which 0 ms to minimize.
[2023-03-12 19:39:32] [INFO ] Deduced a trap composed of 134 places in 143 ms of which 1 ms to minimize.
[2023-03-12 19:39:32] [INFO ] Deduced a trap composed of 133 places in 149 ms of which 1 ms to minimize.
[2023-03-12 19:39:32] [INFO ] Deduced a trap composed of 149 places in 154 ms of which 1 ms to minimize.
[2023-03-12 19:39:32] [INFO ] Deduced a trap composed of 144 places in 141 ms of which 2 ms to minimize.
[2023-03-12 19:39:33] [INFO ] Deduced a trap composed of 31 places in 144 ms of which 1 ms to minimize.
[2023-03-12 19:39:33] [INFO ] Deduced a trap composed of 138 places in 146 ms of which 0 ms to minimize.
[2023-03-12 19:39:33] [INFO ] Deduced a trap composed of 131 places in 146 ms of which 0 ms to minimize.
[2023-03-12 19:39:33] [INFO ] Deduced a trap composed of 132 places in 161 ms of which 1 ms to minimize.
[2023-03-12 19:39:33] [INFO ] Deduced a trap composed of 126 places in 140 ms of which 1 ms to minimize.
[2023-03-12 19:39:34] [INFO ] Deduced a trap composed of 131 places in 139 ms of which 1 ms to minimize.
[2023-03-12 19:39:34] [INFO ] Deduced a trap composed of 33 places in 176 ms of which 1 ms to minimize.
[2023-03-12 19:39:34] [INFO ] Deduced a trap composed of 47 places in 137 ms of which 0 ms to minimize.
[2023-03-12 19:39:34] [INFO ] Deduced a trap composed of 49 places in 126 ms of which 1 ms to minimize.
[2023-03-12 19:39:34] [INFO ] Deduced a trap composed of 152 places in 118 ms of which 0 ms to minimize.
[2023-03-12 19:39:35] [INFO ] Deduced a trap composed of 52 places in 117 ms of which 1 ms to minimize.
[2023-03-12 19:39:35] [INFO ] Deduced a trap composed of 143 places in 155 ms of which 0 ms to minimize.
[2023-03-12 19:39:35] [INFO ] Deduced a trap composed of 145 places in 127 ms of which 0 ms to minimize.
[2023-03-12 19:39:35] [INFO ] Deduced a trap composed of 144 places in 120 ms of which 0 ms to minimize.
[2023-03-12 19:39:35] [INFO ] Deduced a trap composed of 151 places in 119 ms of which 0 ms to minimize.
[2023-03-12 19:39:35] [INFO ] Deduced a trap composed of 154 places in 130 ms of which 1 ms to minimize.
[2023-03-12 19:39:36] [INFO ] Deduced a trap composed of 146 places in 120 ms of which 0 ms to minimize.
[2023-03-12 19:39:36] [INFO ] Deduced a trap composed of 147 places in 120 ms of which 0 ms to minimize.
[2023-03-12 19:39:36] [INFO ] Deduced a trap composed of 147 places in 118 ms of which 1 ms to minimize.
[2023-03-12 19:39:36] [INFO ] Deduced a trap composed of 152 places in 123 ms of which 0 ms to minimize.
[2023-03-12 19:39:36] [INFO ] Deduced a trap composed of 162 places in 146 ms of which 1 ms to minimize.
[2023-03-12 19:39:36] [INFO ] Deduced a trap composed of 150 places in 163 ms of which 2 ms to minimize.
[2023-03-12 19:39:37] [INFO ] Deduced a trap composed of 156 places in 122 ms of which 1 ms to minimize.
[2023-03-12 19:39:37] [INFO ] Deduced a trap composed of 145 places in 135 ms of which 1 ms to minimize.
[2023-03-12 19:39:37] [INFO ] Deduced a trap composed of 161 places in 131 ms of which 1 ms to minimize.
[2023-03-12 19:39:37] [INFO ] Deduced a trap composed of 156 places in 144 ms of which 1 ms to minimize.
[2023-03-12 19:39:37] [INFO ] Deduced a trap composed of 161 places in 122 ms of which 0 ms to minimize.
[2023-03-12 19:39:38] [INFO ] Deduced a trap composed of 16 places in 184 ms of which 1 ms to minimize.
[2023-03-12 19:39:38] [INFO ] Deduced a trap composed of 18 places in 132 ms of which 1 ms to minimize.
[2023-03-12 19:39:38] [INFO ] Deduced a trap composed of 15 places in 131 ms of which 1 ms to minimize.
[2023-03-12 19:39:38] [INFO ] Deduced a trap composed of 146 places in 151 ms of which 0 ms to minimize.
[2023-03-12 19:39:38] [INFO ] Deduced a trap composed of 19 places in 127 ms of which 0 ms to minimize.
[2023-03-12 19:39:38] [INFO ] Deduced a trap composed of 23 places in 162 ms of which 1 ms to minimize.
[2023-03-12 19:39:39] [INFO ] Deduced a trap composed of 156 places in 130 ms of which 3 ms to minimize.
[2023-03-12 19:39:39] [INFO ] Deduced a trap composed of 22 places in 128 ms of which 1 ms to minimize.
[2023-03-12 19:39:39] [INFO ] Deduced a trap composed of 167 places in 130 ms of which 1 ms to minimize.
[2023-03-12 19:39:39] [INFO ] Deduced a trap composed of 153 places in 127 ms of which 1 ms to minimize.
[2023-03-12 19:39:39] [INFO ] Deduced a trap composed of 155 places in 126 ms of which 1 ms to minimize.
[2023-03-12 19:39:39] [INFO ] Deduced a trap composed of 154 places in 158 ms of which 0 ms to minimize.
[2023-03-12 19:39:40] [INFO ] Deduced a trap composed of 13 places in 137 ms of which 1 ms to minimize.
[2023-03-12 19:39:40] [INFO ] Deduced a trap composed of 157 places in 141 ms of which 1 ms to minimize.
[2023-03-12 19:39:40] [INFO ] Deduced a trap composed of 162 places in 127 ms of which 0 ms to minimize.
[2023-03-12 19:39:40] [INFO ] Deduced a trap composed of 148 places in 182 ms of which 1 ms to minimize.
[2023-03-12 19:39:40] [INFO ] Deduced a trap composed of 153 places in 150 ms of which 1 ms to minimize.
[2023-03-12 19:39:41] [INFO ] Deduced a trap composed of 155 places in 135 ms of which 1 ms to minimize.
[2023-03-12 19:39:41] [INFO ] Deduced a trap composed of 153 places in 129 ms of which 0 ms to minimize.
[2023-03-12 19:39:41] [INFO ] Deduced a trap composed of 148 places in 128 ms of which 0 ms to minimize.
[2023-03-12 19:39:41] [INFO ] Deduced a trap composed of 21 places in 125 ms of which 1 ms to minimize.
[2023-03-12 19:39:41] [INFO ] Deduced a trap composed of 157 places in 123 ms of which 0 ms to minimize.
[2023-03-12 19:39:41] [INFO ] Deduced a trap composed of 152 places in 129 ms of which 0 ms to minimize.
[2023-03-12 19:39:42] [INFO ] Deduced a trap composed of 155 places in 125 ms of which 0 ms to minimize.
[2023-03-12 19:39:42] [INFO ] Deduced a trap composed of 151 places in 123 ms of which 1 ms to minimize.
[2023-03-12 19:39:42] [INFO ] Deduced a trap composed of 160 places in 130 ms of which 1 ms to minimize.
[2023-03-12 19:39:42] [INFO ] Deduced a trap composed of 150 places in 138 ms of which 0 ms to minimize.
[2023-03-12 19:39:42] [INFO ] Deduced a trap composed of 149 places in 124 ms of which 0 ms to minimize.
[2023-03-12 19:39:42] [INFO ] Deduced a trap composed of 154 places in 126 ms of which 1 ms to minimize.
[2023-03-12 19:39:43] [INFO ] Deduced a trap composed of 151 places in 126 ms of which 1 ms to minimize.
[2023-03-12 19:39:43] [INFO ] Deduced a trap composed of 15 places in 130 ms of which 1 ms to minimize.
[2023-03-12 19:39:43] [INFO ] Deduced a trap composed of 150 places in 127 ms of which 0 ms to minimize.
[2023-03-12 19:39:43] [INFO ] Deduced a trap composed of 153 places in 132 ms of which 0 ms to minimize.
[2023-03-12 19:39:43] [INFO ] Deduced a trap composed of 157 places in 131 ms of which 1 ms to minimize.
[2023-03-12 19:39:43] [INFO ] Deduced a trap composed of 153 places in 133 ms of which 0 ms to minimize.
[2023-03-12 19:39:44] [INFO ] Deduced a trap composed of 155 places in 131 ms of which 1 ms to minimize.
[2023-03-12 19:39:44] [INFO ] Deduced a trap composed of 155 places in 124 ms of which 0 ms to minimize.
[2023-03-12 19:39:44] [INFO ] Deduced a trap composed of 154 places in 136 ms of which 1 ms to minimize.
[2023-03-12 19:39:44] [INFO ] Deduced a trap composed of 152 places in 136 ms of which 1 ms to minimize.
[2023-03-12 19:39:44] [INFO ] Deduced a trap composed of 161 places in 129 ms of which 0 ms to minimize.
[2023-03-12 19:39:44] [INFO ] Deduced a trap composed of 159 places in 125 ms of which 1 ms to minimize.
[2023-03-12 19:39:45] [INFO ] Deduced a trap composed of 158 places in 132 ms of which 1 ms to minimize.
[2023-03-12 19:39:45] [INFO ] Deduced a trap composed of 152 places in 124 ms of which 1 ms to minimize.
[2023-03-12 19:39:45] [INFO ] Deduced a trap composed of 155 places in 130 ms of which 0 ms to minimize.
[2023-03-12 19:39:45] [INFO ] Deduced a trap composed of 155 places in 134 ms of which 0 ms to minimize.
[2023-03-12 19:39:45] [INFO ] Deduced a trap composed of 153 places in 127 ms of which 0 ms to minimize.
[2023-03-12 19:39:45] [INFO ] Deduced a trap composed of 157 places in 137 ms of which 1 ms to minimize.
[2023-03-12 19:39:46] [INFO ] Deduced a trap composed of 159 places in 133 ms of which 1 ms to minimize.
[2023-03-12 19:39:46] [INFO ] Deduced a trap composed of 161 places in 127 ms of which 0 ms to minimize.
[2023-03-12 19:39:46] [INFO ] Deduced a trap composed of 150 places in 180 ms of which 1 ms to minimize.
[2023-03-12 19:39:46] [INFO ] Deduced a trap composed of 148 places in 138 ms of which 1 ms to minimize.
[2023-03-12 19:39:46] [INFO ] Deduced a trap composed of 150 places in 184 ms of which 0 ms to minimize.
[2023-03-12 19:39:47] [INFO ] Deduced a trap composed of 149 places in 138 ms of which 0 ms to minimize.
[2023-03-12 19:39:47] [INFO ] Deduced a trap composed of 150 places in 160 ms of which 1 ms to minimize.
[2023-03-12 19:39:47] [INFO ] Deduced a trap composed of 158 places in 143 ms of which 0 ms to minimize.
[2023-03-12 19:39:47] [INFO ] Deduced a trap composed of 157 places in 175 ms of which 1 ms to minimize.
[2023-03-12 19:39:48] [INFO ] Deduced a trap composed of 11 places in 144 ms of which 1 ms to minimize.
[2023-03-12 19:39:48] [INFO ] Deduced a trap composed of 164 places in 132 ms of which 1 ms to minimize.
[2023-03-12 19:39:48] [INFO ] Deduced a trap composed of 168 places in 129 ms of which 0 ms to minimize.
[2023-03-12 19:39:48] [INFO ] Deduced a trap composed of 156 places in 123 ms of which 1 ms to minimize.
[2023-03-12 19:39:48] [INFO ] Deduced a trap composed of 157 places in 128 ms of which 1 ms to minimize.
[2023-03-12 19:39:49] [INFO ] Deduced a trap composed of 152 places in 130 ms of which 1 ms to minimize.
[2023-03-12 19:39:49] [INFO ] Deduced a trap composed of 154 places in 136 ms of which 0 ms to minimize.
[2023-03-12 19:39:49] [INFO ] Deduced a trap composed of 144 places in 174 ms of which 0 ms to minimize.
[2023-03-12 19:39:50] [INFO ] Deduced a trap composed of 149 places in 150 ms of which 0 ms to minimize.
[2023-03-12 19:39:50] [INFO ] Deduced a trap composed of 154 places in 121 ms of which 1 ms to minimize.
[2023-03-12 19:39:50] [INFO ] Deduced a trap composed of 158 places in 125 ms of which 0 ms to minimize.
[2023-03-12 19:39:51] [INFO ] Trap strengthening (SAT) tested/added 109/109 trap constraints in 21581 ms
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ...
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-12 19:39:51] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-12 19:39:51] [INFO ] After 25030ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:5
Parikh walk visited 0 properties in 84 ms.
Support contains 51 out of 719 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 719/719 places, 638/638 transitions.
Graph (trivial) has 361 edges and 719 vertex of which 7 / 719 are part of one of the 1 SCC in 5 ms
Free SCC test removed 6 places
Drop transitions removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Graph (complete) has 1410 edges and 713 vertex of which 692 are kept as prefixes of interest. Removing 21 places using SCC suffix rule.3 ms
Discarding 21 places :
Also discarding 8 output transitions
Drop transitions removed 8 transitions
Drop transitions removed 131 transitions
Trivial Post-agglo rules discarded 131 transitions
Performed 131 trivial Post agglomeration. Transition count delta: 131
Iterating post reduction 0 with 131 rules applied. Total rules applied 133 place count 692 transition count 491
Reduce places removed 131 places and 0 transitions.
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Iterating post reduction 1 with 151 rules applied. Total rules applied 284 place count 561 transition count 471
Reduce places removed 20 places and 0 transitions.
Iterating post reduction 2 with 20 rules applied. Total rules applied 304 place count 541 transition count 471
Performed 92 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 92 Pre rules applied. Total rules applied 304 place count 541 transition count 379
Deduced a syphon composed of 92 places in 2 ms
Ensure Unique test removed 19 places
Reduce places removed 111 places and 0 transitions.
Iterating global reduction 3 with 203 rules applied. Total rules applied 507 place count 430 transition count 379
Discarding 68 places :
Symmetric choice reduction at 3 with 68 rule applications. Total rules 575 place count 362 transition count 311
Iterating global reduction 3 with 68 rules applied. Total rules applied 643 place count 362 transition count 311
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 643 place count 362 transition count 307
Deduced a syphon composed of 4 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 9 rules applied. Total rules applied 652 place count 357 transition count 307
Performed 95 Post agglomeration using F-continuation condition.Transition count delta: 95
Deduced a syphon composed of 95 places in 1 ms
Reduce places removed 95 places and 0 transitions.
Iterating global reduction 3 with 190 rules applied. Total rules applied 842 place count 262 transition count 212
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 844 place count 261 transition count 215
Free-agglomeration rule applied 3 times.
Iterating global reduction 3 with 3 rules applied. Total rules applied 847 place count 261 transition count 212
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 850 place count 258 transition count 212
Partial Free-agglomeration rule applied 4 times.
Drop transitions removed 4 transitions
Iterating global reduction 4 with 4 rules applied. Total rules applied 854 place count 258 transition count 212
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 855 place count 257 transition count 211
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 856 place count 256 transition count 211
Applied a total of 856 rules in 175 ms. Remains 256 /719 variables (removed 463) and now considering 211/638 (removed 427) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 177 ms. Remains : 256/719 places, 211/638 transitions.
Incomplete random walk after 10000 steps, including 146 resets, run finished after 193 ms. (steps per millisecond=51 ) properties (out of 5) seen :2
FORMULA BusinessProcesses-PT-20-ReachabilityCardinality-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-20-ReachabilityCardinality-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 33 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 33 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 3) seen :1
FORMULA BusinessProcesses-PT-20-ReachabilityCardinality-05 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10000 steps, including 28 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 211 rows 256 cols
[2023-03-12 19:39:52] [INFO ] Computed 87 place invariants in 9 ms
[2023-03-12 19:39:52] [INFO ] [Real]Absence check using 67 positive place invariants in 63 ms returned sat
[2023-03-12 19:39:52] [INFO ] [Real]Absence check using 67 positive and 20 generalized place invariants in 3 ms returned sat
[2023-03-12 19:39:52] [INFO ] After 243ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-12 19:39:52] [INFO ] [Nat]Absence check using 67 positive place invariants in 11 ms returned sat
[2023-03-12 19:39:52] [INFO ] [Nat]Absence check using 67 positive and 20 generalized place invariants in 4 ms returned sat
[2023-03-12 19:39:52] [INFO ] After 88ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-12 19:39:52] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-03-12 19:39:52] [INFO ] After 18ms SMT Verify possible using 4 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-12 19:39:52] [INFO ] Deduced a trap composed of 5 places in 34 ms of which 0 ms to minimize.
[2023-03-12 19:39:52] [INFO ] Deduced a trap composed of 14 places in 27 ms of which 0 ms to minimize.
[2023-03-12 19:39:52] [INFO ] Deduced a trap composed of 15 places in 25 ms of which 1 ms to minimize.
[2023-03-12 19:39:52] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 115 ms
[2023-03-12 19:39:52] [INFO ] Deduced a trap composed of 60 places in 48 ms of which 1 ms to minimize.
[2023-03-12 19:39:52] [INFO ] Deduced a trap composed of 62 places in 49 ms of which 0 ms to minimize.
[2023-03-12 19:39:52] [INFO ] Deduced a trap composed of 57 places in 48 ms of which 0 ms to minimize.
[2023-03-12 19:39:52] [INFO ] Deduced a trap composed of 51 places in 50 ms of which 2 ms to minimize.
[2023-03-12 19:39:53] [INFO ] Deduced a trap composed of 46 places in 57 ms of which 0 ms to minimize.
[2023-03-12 19:39:53] [INFO ] Deduced a trap composed of 46 places in 50 ms of which 0 ms to minimize.
[2023-03-12 19:39:53] [INFO ] Deduced a trap composed of 52 places in 73 ms of which 1 ms to minimize.
[2023-03-12 19:39:53] [INFO ] Deduced a trap composed of 49 places in 62 ms of which 0 ms to minimize.
[2023-03-12 19:39:53] [INFO ] Deduced a trap composed of 48 places in 64 ms of which 1 ms to minimize.
[2023-03-12 19:39:53] [INFO ] Deduced a trap composed of 49 places in 51 ms of which 0 ms to minimize.
[2023-03-12 19:39:53] [INFO ] Deduced a trap composed of 54 places in 50 ms of which 1 ms to minimize.
[2023-03-12 19:39:53] [INFO ] Deduced a trap composed of 53 places in 50 ms of which 0 ms to minimize.
[2023-03-12 19:39:53] [INFO ] Deduced a trap composed of 24 places in 52 ms of which 1 ms to minimize.
[2023-03-12 19:39:53] [INFO ] Deduced a trap composed of 48 places in 57 ms of which 3 ms to minimize.
[2023-03-12 19:39:53] [INFO ] Deduced a trap composed of 30 places in 52 ms of which 1 ms to minimize.
[2023-03-12 19:39:53] [INFO ] Deduced a trap composed of 41 places in 51 ms of which 0 ms to minimize.
[2023-03-12 19:39:53] [INFO ] Deduced a trap composed of 53 places in 64 ms of which 0 ms to minimize.
[2023-03-12 19:39:53] [INFO ] Deduced a trap composed of 54 places in 64 ms of which 0 ms to minimize.
[2023-03-12 19:39:54] [INFO ] Deduced a trap composed of 48 places in 67 ms of which 1 ms to minimize.
[2023-03-12 19:39:54] [INFO ] Deduced a trap composed of 47 places in 64 ms of which 0 ms to minimize.
[2023-03-12 19:39:54] [INFO ] Deduced a trap composed of 11 places in 66 ms of which 0 ms to minimize.
[2023-03-12 19:39:54] [INFO ] Deduced a trap composed of 50 places in 62 ms of which 0 ms to minimize.
[2023-03-12 19:39:54] [INFO ] Deduced a trap composed of 47 places in 65 ms of which 0 ms to minimize.
[2023-03-12 19:39:54] [INFO ] Deduced a trap composed of 48 places in 49 ms of which 1 ms to minimize.
[2023-03-12 19:39:54] [INFO ] Deduced a trap composed of 53 places in 62 ms of which 0 ms to minimize.
[2023-03-12 19:39:54] [INFO ] Deduced a trap composed of 52 places in 47 ms of which 0 ms to minimize.
[2023-03-12 19:39:54] [INFO ] Deduced a trap composed of 51 places in 66 ms of which 0 ms to minimize.
[2023-03-12 19:39:54] [INFO ] Deduced a trap composed of 51 places in 62 ms of which 1 ms to minimize.
[2023-03-12 19:39:54] [INFO ] Deduced a trap composed of 58 places in 59 ms of which 0 ms to minimize.
[2023-03-12 19:39:54] [INFO ] Deduced a trap composed of 53 places in 64 ms of which 0 ms to minimize.
[2023-03-12 19:39:54] [INFO ] Deduced a trap composed of 44 places in 93 ms of which 0 ms to minimize.
[2023-03-12 19:39:55] [INFO ] Deduced a trap composed of 43 places in 74 ms of which 1 ms to minimize.
[2023-03-12 19:39:55] [INFO ] Deduced a trap composed of 48 places in 50 ms of which 1 ms to minimize.
[2023-03-12 19:39:55] [INFO ] Deduced a trap composed of 47 places in 50 ms of which 0 ms to minimize.
[2023-03-12 19:39:55] [INFO ] Deduced a trap composed of 49 places in 49 ms of which 1 ms to minimize.
[2023-03-12 19:39:55] [INFO ] Deduced a trap composed of 48 places in 56 ms of which 0 ms to minimize.
[2023-03-12 19:39:55] [INFO ] Deduced a trap composed of 54 places in 49 ms of which 0 ms to minimize.
[2023-03-12 19:39:55] [INFO ] Deduced a trap composed of 52 places in 47 ms of which 1 ms to minimize.
[2023-03-12 19:39:55] [INFO ] Deduced a trap composed of 52 places in 49 ms of which 0 ms to minimize.
[2023-03-12 19:39:55] [INFO ] Deduced a trap composed of 47 places in 59 ms of which 0 ms to minimize.
[2023-03-12 19:39:55] [INFO ] Deduced a trap composed of 47 places in 67 ms of which 0 ms to minimize.
[2023-03-12 19:39:55] [INFO ] Deduced a trap composed of 49 places in 48 ms of which 0 ms to minimize.
[2023-03-12 19:39:55] [INFO ] Deduced a trap composed of 52 places in 52 ms of which 0 ms to minimize.
[2023-03-12 19:39:55] [INFO ] Deduced a trap composed of 56 places in 63 ms of which 1 ms to minimize.
[2023-03-12 19:39:55] [INFO ] Deduced a trap composed of 49 places in 48 ms of which 1 ms to minimize.
[2023-03-12 19:39:56] [INFO ] Deduced a trap composed of 51 places in 48 ms of which 1 ms to minimize.
[2023-03-12 19:39:56] [INFO ] Deduced a trap composed of 52 places in 47 ms of which 1 ms to minimize.
[2023-03-12 19:39:56] [INFO ] Deduced a trap composed of 56 places in 47 ms of which 0 ms to minimize.
[2023-03-12 19:39:56] [INFO ] Deduced a trap composed of 47 places in 61 ms of which 1 ms to minimize.
[2023-03-12 19:39:56] [INFO ] Deduced a trap composed of 50 places in 48 ms of which 0 ms to minimize.
[2023-03-12 19:39:56] [INFO ] Deduced a trap composed of 50 places in 48 ms of which 1 ms to minimize.
[2023-03-12 19:39:56] [INFO ] Deduced a trap composed of 48 places in 60 ms of which 1 ms to minimize.
[2023-03-12 19:39:56] [INFO ] Deduced a trap composed of 53 places in 47 ms of which 1 ms to minimize.
[2023-03-12 19:39:56] [INFO ] Deduced a trap composed of 46 places in 49 ms of which 0 ms to minimize.
[2023-03-12 19:39:56] [INFO ] Deduced a trap composed of 51 places in 51 ms of which 1 ms to minimize.
[2023-03-12 19:39:56] [INFO ] Deduced a trap composed of 45 places in 60 ms of which 1 ms to minimize.
[2023-03-12 19:39:56] [INFO ] Deduced a trap composed of 51 places in 45 ms of which 0 ms to minimize.
[2023-03-12 19:39:56] [INFO ] Deduced a trap composed of 7 places in 46 ms of which 0 ms to minimize.
[2023-03-12 19:39:56] [INFO ] Deduced a trap composed of 56 places in 46 ms of which 1 ms to minimize.
[2023-03-12 19:39:56] [INFO ] Deduced a trap composed of 52 places in 48 ms of which 0 ms to minimize.
[2023-03-12 19:39:56] [INFO ] Deduced a trap composed of 50 places in 48 ms of which 0 ms to minimize.
[2023-03-12 19:39:56] [INFO ] Trap strengthening (SAT) tested/added 62/61 trap constraints in 4215 ms
[2023-03-12 19:39:56] [INFO ] After 4370ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 91 ms.
[2023-03-12 19:39:57] [INFO ] After 4620ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
FORMULA BusinessProcesses-PT-20-ReachabilityCardinality-03 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Finished Parikh walk after 79 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=39 )
FORMULA BusinessProcesses-PT-20-ReachabilityCardinality-15 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 2 properties in 4 ms.
All properties solved without resorting to model-checking.
Total runtime 32044 ms.
pnml2lts-sym model.pnml --lace-workers=4 --vset=lddmc --saturation=sat -rbs,w2W,ru,hf --sylvan-sizes=20,28,20,28 --invariant=/tmp/1058/inv_0_ --invariant=/tmp/1058/inv_1_ --invariant=/tmp/1058/inv_2_ --invariant=/tmp/1058/inv_3_ --invariant=/tmp/1058/inv_4_ --invariant=/tmp/1058/inv_5_ --invariant=/tmp/1058/inv_6_ --invariant=/tmp/1058/inv_7_ --invariant=/tmp/1058/inv_8_ --invariant=/tmp/1058/inv_9_ --invariant=/tmp/1058/inv_10_ --invariant=/tmp/1058/inv_11_ --invariant=/tmp/1058/inv_12_ --invariant=/tmp/1058/inv_13_ --invariant=/tmp/1058/inv_14_ --invariant=/tmp/1058/inv_15_ --inv-par
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393340 kB
MemFree: 8138628 kB
After kill :
MemTotal: 16393340 kB
MemFree: 16102968 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//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityCardinality -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="BusinessProcesses-PT-20"
export BK_EXAMINATION="ReachabilityCardinality"
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 BusinessProcesses-PT-20, examination is ReachabilityCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r041-tajo-167813694900606"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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