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.r042-tajo-167813695900534.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 marciexred
Input is BusinessProcesses-PT-11, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r042-tajo-167813695900534
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 532K
-rw-r--r-- 1 mcc users 7.6K Feb 25 16:49 CTLCardinality.txt
-rw-r--r-- 1 mcc users 82K Feb 25 16:49 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.9K Feb 25 16:48 CTLFireability.txt
-rw-r--r-- 1 mcc users 43K Feb 25 16:48 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.6K 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 8.3K Feb 25 16:49 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 81K Feb 25 16:49 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.5K Feb 25 16:49 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 51K Feb 25 16:49 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 141K 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-11-ReachabilityCardinality-00
FORMULA_NAME BusinessProcesses-PT-11-ReachabilityCardinality-01
FORMULA_NAME BusinessProcesses-PT-11-ReachabilityCardinality-02
FORMULA_NAME BusinessProcesses-PT-11-ReachabilityCardinality-03
FORMULA_NAME BusinessProcesses-PT-11-ReachabilityCardinality-04
FORMULA_NAME BusinessProcesses-PT-11-ReachabilityCardinality-05
FORMULA_NAME BusinessProcesses-PT-11-ReachabilityCardinality-06
FORMULA_NAME BusinessProcesses-PT-11-ReachabilityCardinality-07
FORMULA_NAME BusinessProcesses-PT-11-ReachabilityCardinality-08
FORMULA_NAME BusinessProcesses-PT-11-ReachabilityCardinality-09
FORMULA_NAME BusinessProcesses-PT-11-ReachabilityCardinality-10
FORMULA_NAME BusinessProcesses-PT-11-ReachabilityCardinality-11
FORMULA_NAME BusinessProcesses-PT-11-ReachabilityCardinality-12
FORMULA_NAME BusinessProcesses-PT-11-ReachabilityCardinality-13
FORMULA_NAME BusinessProcesses-PT-11-ReachabilityCardinality-14
FORMULA_NAME BusinessProcesses-PT-11-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1678731247496

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=marciexred
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BusinessProcesses-PT-11
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-13 18:14:09] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-13 18:14:09] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-13 18:14:09] [INFO ] Load time of PNML (sax parser for PT used): 58 ms
[2023-03-13 18:14:09] [INFO ] Transformed 567 places.
[2023-03-13 18:14:09] [INFO ] Transformed 508 transitions.
[2023-03-13 18:14:09] [INFO ] Found NUPN structural information;
[2023-03-13 18:14:09] [INFO ] Parsed PT model containing 567 places and 508 transitions and 1512 arcs in 118 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 10 ms.
Working with output stream class java.io.PrintStream
Deduced a syphon composed of 7 places in 6 ms
Reduce places removed 7 places and 7 transitions.
FORMULA BusinessProcesses-PT-11-ReachabilityCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-11-ReachabilityCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 74 resets, run finished after 402 ms. (steps per millisecond=24 ) properties (out of 14) seen :7
FORMULA BusinessProcesses-PT-11-ReachabilityCardinality-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-11-ReachabilityCardinality-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-11-ReachabilityCardinality-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-11-ReachabilityCardinality-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-11-ReachabilityCardinality-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-11-ReachabilityCardinality-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-11-ReachabilityCardinality-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 17 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 87 ms. (steps per millisecond=114 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 17 resets, run finished after 80 ms. (steps per millisecond=125 ) properties (out of 7) seen :0
Running SMT prover for 7 properties.
// Phase 1: matrix 501 rows 560 cols
[2023-03-13 18:14:10] [INFO ] Computed 95 place invariants in 28 ms
[2023-03-13 18:14:10] [INFO ] [Real]Absence check using 53 positive place invariants in 15 ms returned sat
[2023-03-13 18:14:10] [INFO ] [Real]Absence check using 53 positive and 42 generalized place invariants in 11 ms returned sat
[2023-03-13 18:14:10] [INFO ] After 354ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2023-03-13 18:14:10] [INFO ] [Nat]Absence check using 53 positive place invariants in 19 ms returned sat
[2023-03-13 18:14:10] [INFO ] [Nat]Absence check using 53 positive and 42 generalized place invariants in 10 ms returned sat
[2023-03-13 18:14:11] [INFO ] After 340ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :5
[2023-03-13 18:14:11] [INFO ] Deduced a trap composed of 14 places in 187 ms of which 6 ms to minimize.
[2023-03-13 18:14:11] [INFO ] Deduced a trap composed of 8 places in 158 ms of which 1 ms to minimize.
[2023-03-13 18:14:11] [INFO ] Deduced a trap composed of 93 places in 151 ms of which 1 ms to minimize.
[2023-03-13 18:14:11] [INFO ] Deduced a trap composed of 101 places in 141 ms of which 1 ms to minimize.
[2023-03-13 18:14:12] [INFO ] Deduced a trap composed of 18 places in 171 ms of which 1 ms to minimize.
[2023-03-13 18:14:12] [INFO ] Deduced a trap composed of 98 places in 201 ms of which 1 ms to minimize.
[2023-03-13 18:14:12] [INFO ] Deduced a trap composed of 114 places in 186 ms of which 1 ms to minimize.
[2023-03-13 18:14:12] [INFO ] Deduced a trap composed of 13 places in 163 ms of which 2 ms to minimize.
[2023-03-13 18:14:12] [INFO ] Deduced a trap composed of 11 places in 179 ms of which 1 ms to minimize.
[2023-03-13 18:14:13] [INFO ] Deduced a trap composed of 24 places in 113 ms of which 1 ms to minimize.
[2023-03-13 18:14:13] [INFO ] Deduced a trap composed of 31 places in 111 ms of which 1 ms to minimize.
[2023-03-13 18:14:13] [INFO ] Deduced a trap composed of 23 places in 127 ms of which 1 ms to minimize.
[2023-03-13 18:14:13] [INFO ] Deduced a trap composed of 19 places in 201 ms of which 1 ms to minimize.
[2023-03-13 18:14:13] [INFO ] Deduced a trap composed of 20 places in 194 ms of which 0 ms to minimize.
[2023-03-13 18:14:13] [INFO ] Deduced a trap composed of 20 places in 191 ms of which 1 ms to minimize.
[2023-03-13 18:14:14] [INFO ] Deduced a trap composed of 20 places in 186 ms of which 0 ms to minimize.
[2023-03-13 18:14:14] [INFO ] Deduced a trap composed of 24 places in 145 ms of which 1 ms to minimize.
[2023-03-13 18:14:14] [INFO ] Deduced a trap composed of 100 places in 157 ms of which 0 ms to minimize.
[2023-03-13 18:14:14] [INFO ] Deduced a trap composed of 25 places in 149 ms of which 1 ms to minimize.
[2023-03-13 18:14:14] [INFO ] Deduced a trap composed of 109 places in 186 ms of which 1 ms to minimize.
[2023-03-13 18:14:15] [INFO ] Deduced a trap composed of 14 places in 167 ms of which 1 ms to minimize.
[2023-03-13 18:14:15] [INFO ] Deduced a trap composed of 28 places in 157 ms of which 1 ms to minimize.
[2023-03-13 18:14:15] [INFO ] Deduced a trap composed of 123 places in 174 ms of which 1 ms to minimize.
[2023-03-13 18:14:15] [INFO ] Deduced a trap composed of 21 places in 185 ms of which 1 ms to minimize.
[2023-03-13 18:14:15] [INFO ] Deduced a trap composed of 29 places in 151 ms of which 1 ms to minimize.
[2023-03-13 18:14:16] [INFO ] Deduced a trap composed of 97 places in 151 ms of which 1 ms to minimize.
[2023-03-13 18:14:16] [INFO ] Deduced a trap composed of 36 places in 178 ms of which 1 ms to minimize.
[2023-03-13 18:14:16] [INFO ] Deduced a trap composed of 26 places in 155 ms of which 1 ms to minimize.
[2023-03-13 18:14:16] [INFO ] Deduced a trap composed of 42 places in 179 ms of which 1 ms to minimize.
[2023-03-13 18:14:16] [INFO ] Deduced a trap composed of 27 places in 159 ms of which 1 ms to minimize.
[2023-03-13 18:14:17] [INFO ] Deduced a trap composed of 26 places in 170 ms of which 1 ms to minimize.
[2023-03-13 18:14:17] [INFO ] Deduced a trap composed of 24 places in 159 ms of which 1 ms to minimize.
[2023-03-13 18:14:17] [INFO ] Deduced a trap composed of 105 places in 180 ms of which 0 ms to minimize.
[2023-03-13 18:14:17] [INFO ] Deduced a trap composed of 41 places in 170 ms of which 1 ms to minimize.
[2023-03-13 18:14:17] [INFO ] Deduced a trap composed of 23 places in 176 ms of which 1 ms to minimize.
[2023-03-13 18:14:18] [INFO ] Deduced a trap composed of 26 places in 150 ms of which 1 ms to minimize.
[2023-03-13 18:14:18] [INFO ] Deduced a trap composed of 99 places in 150 ms of which 1 ms to minimize.
[2023-03-13 18:14:18] [INFO ] Deduced a trap composed of 32 places in 154 ms of which 0 ms to minimize.
[2023-03-13 18:14:18] [INFO ] Deduced a trap composed of 26 places in 185 ms of which 1 ms to minimize.
[2023-03-13 18:14:18] [INFO ] Deduced a trap composed of 104 places in 166 ms of which 2 ms to minimize.
[2023-03-13 18:14:19] [INFO ] Deduced a trap composed of 22 places in 173 ms of which 1 ms to minimize.
[2023-03-13 18:14:19] [INFO ] Deduced a trap composed of 35 places in 165 ms of which 1 ms to minimize.
[2023-03-13 18:14:19] [INFO ] Deduced a trap composed of 105 places in 160 ms of which 0 ms to minimize.
[2023-03-13 18:14:19] [INFO ] Deduced a trap composed of 41 places in 170 ms of which 0 ms to minimize.
[2023-03-13 18:14:19] [INFO ] Deduced a trap composed of 109 places in 182 ms of which 0 ms to minimize.
[2023-03-13 18:14:20] [INFO ] Deduced a trap composed of 27 places in 170 ms of which 0 ms to minimize.
[2023-03-13 18:14:20] [INFO ] Deduced a trap composed of 124 places in 165 ms of which 0 ms to minimize.
[2023-03-13 18:14:20] [INFO ] Deduced a trap composed of 35 places in 175 ms of which 1 ms to minimize.
[2023-03-13 18:14:20] [INFO ] Deduced a trap composed of 60 places in 179 ms of which 1 ms to minimize.
[2023-03-13 18:14:20] [INFO ] Deduced a trap composed of 61 places in 176 ms of which 1 ms to minimize.
[2023-03-13 18:14:21] [INFO ] Deduced a trap composed of 133 places in 175 ms of which 1 ms to minimize.
[2023-03-13 18:14:21] [INFO ] Deduced a trap composed of 120 places in 171 ms of which 1 ms to minimize.
[2023-03-13 18:14:21] [INFO ] Deduced a trap composed of 50 places in 164 ms of which 1 ms to minimize.
[2023-03-13 18:14:21] [INFO ] Deduced a trap composed of 122 places in 137 ms of which 0 ms to minimize.
[2023-03-13 18:14:21] [INFO ] Deduced a trap composed of 75 places in 132 ms of which 0 ms to minimize.
[2023-03-13 18:14:21] [INFO ] Deduced a trap composed of 120 places in 126 ms of which 1 ms to minimize.
[2023-03-13 18:14:22] [INFO ] Deduced a trap composed of 36 places in 168 ms of which 1 ms to minimize.
[2023-03-13 18:14:22] [INFO ] Deduced a trap composed of 125 places in 139 ms of which 1 ms to minimize.
[2023-03-13 18:14:22] [INFO ] Deduced a trap composed of 68 places in 165 ms of which 1 ms to minimize.
[2023-03-13 18:14:22] [INFO ] Deduced a trap composed of 66 places in 170 ms of which 0 ms to minimize.
[2023-03-13 18:14:22] [INFO ] Deduced a trap composed of 123 places in 151 ms of which 0 ms to minimize.
[2023-03-13 18:14:23] [INFO ] Deduced a trap composed of 62 places in 147 ms of which 1 ms to minimize.
[2023-03-13 18:14:23] [INFO ] Deduced a trap composed of 66 places in 171 ms of which 1 ms to minimize.
[2023-03-13 18:14:23] [INFO ] Deduced a trap composed of 51 places in 171 ms of which 1 ms to minimize.
[2023-03-13 18:14:23] [INFO ] Deduced a trap composed of 66 places in 152 ms of which 0 ms to minimize.
[2023-03-13 18:14:23] [INFO ] Deduced a trap composed of 57 places in 141 ms of which 0 ms to minimize.
[2023-03-13 18:14:24] [INFO ] Deduced a trap composed of 69 places in 288 ms of which 4 ms to minimize.
[2023-03-13 18:14:24] [INFO ] Deduced a trap composed of 53 places in 172 ms of which 1 ms to minimize.
[2023-03-13 18:14:24] [INFO ] Deduced a trap composed of 126 places in 162 ms of which 1 ms to minimize.
[2023-03-13 18:14:24] [INFO ] Deduced a trap composed of 87 places in 161 ms of which 0 ms to minimize.
[2023-03-13 18:14:24] [INFO ] Deduced a trap composed of 77 places in 151 ms of which 1 ms to minimize.
[2023-03-13 18:14:25] [INFO ] Deduced a trap composed of 128 places in 179 ms of which 1 ms to minimize.
[2023-03-13 18:14:25] [INFO ] Deduced a trap composed of 131 places in 155 ms of which 0 ms to minimize.
[2023-03-13 18:14:25] [INFO ] Deduced a trap composed of 129 places in 156 ms of which 0 ms to minimize.
[2023-03-13 18:14:25] [INFO ] Deduced a trap composed of 129 places in 147 ms of which 0 ms to minimize.
[2023-03-13 18:14:25] [INFO ] Deduced a trap composed of 26 places in 201 ms of which 0 ms to minimize.
[2023-03-13 18:14:26] [INFO ] Deduced a trap composed of 146 places in 170 ms of which 1 ms to minimize.
[2023-03-13 18:14:26] [INFO ] Deduced a trap composed of 121 places in 176 ms of which 1 ms to minimize.
[2023-03-13 18:14:26] [INFO ] Deduced a trap composed of 122 places in 180 ms of which 1 ms to minimize.
[2023-03-13 18:14:26] [INFO ] Deduced a trap composed of 51 places in 156 ms of which 1 ms to minimize.
[2023-03-13 18:14:26] [INFO ] Deduced a trap composed of 134 places in 183 ms of which 1 ms to minimize.
[2023-03-13 18:14:27] [INFO ] Deduced a trap composed of 29 places in 181 ms of which 1 ms to minimize.
[2023-03-13 18:14:27] [INFO ] Deduced a trap composed of 124 places in 151 ms of which 1 ms to minimize.
[2023-03-13 18:14:27] [INFO ] Deduced a trap composed of 29 places in 179 ms of which 1 ms to minimize.
[2023-03-13 18:14:27] [INFO ] Deduced a trap composed of 128 places in 176 ms of which 1 ms to minimize.
[2023-03-13 18:14:27] [INFO ] Deduced a trap composed of 135 places in 182 ms of which 0 ms to minimize.
[2023-03-13 18:14:28] [INFO ] Deduced a trap composed of 121 places in 146 ms of which 1 ms to minimize.
[2023-03-13 18:14:28] [INFO ] Deduced a trap composed of 116 places in 175 ms of which 1 ms to minimize.
[2023-03-13 18:14:28] [INFO ] Deduced a trap composed of 29 places in 185 ms of which 0 ms to minimize.
[2023-03-13 18:14:28] [INFO ] Deduced a trap composed of 128 places in 178 ms of which 0 ms to minimize.
[2023-03-13 18:14:29] [INFO ] Deduced a trap composed of 24 places in 159 ms of which 1 ms to minimize.
[2023-03-13 18:14:29] [INFO ] Deduced a trap composed of 140 places in 146 ms of which 1 ms to minimize.
[2023-03-13 18:14:29] [INFO ] Deduced a trap composed of 28 places in 144 ms of which 1 ms to minimize.
[2023-03-13 18:14:29] [INFO ] Deduced a trap composed of 119 places in 187 ms of which 1 ms to minimize.
[2023-03-13 18:14:29] [INFO ] Deduced a trap composed of 33 places in 163 ms of which 1 ms to minimize.
[2023-03-13 18:14:29] [INFO ] Deduced a trap composed of 46 places in 124 ms of which 0 ms to minimize.
[2023-03-13 18:14:30] [INFO ] Deduced a trap composed of 35 places in 142 ms of which 0 ms to minimize.
[2023-03-13 18:14:30] [INFO ] Deduced a trap composed of 37 places in 154 ms of which 0 ms to minimize.
[2023-03-13 18:14:30] [INFO ] Deduced a trap composed of 125 places in 133 ms of which 1 ms to minimize.
[2023-03-13 18:14:30] [INFO ] Deduced a trap composed of 26 places in 155 ms of which 1 ms to minimize.
[2023-03-13 18:14:30] [INFO ] Deduced a trap composed of 32 places in 130 ms of which 1 ms to minimize.
[2023-03-13 18:14:30] [INFO ] Deduced a trap composed of 29 places in 131 ms of which 0 ms to minimize.
[2023-03-13 18:14:31] [INFO ] Deduced a trap composed of 117 places in 143 ms of which 1 ms to minimize.
[2023-03-13 18:14:31] [INFO ] Deduced a trap composed of 128 places in 159 ms of which 1 ms to minimize.
[2023-03-13 18:14:31] [INFO ] Deduced a trap composed of 57 places in 163 ms of which 0 ms to minimize.
[2023-03-13 18:14:31] [INFO ] Deduced a trap composed of 43 places in 146 ms of which 1 ms to minimize.
[2023-03-13 18:14:31] [INFO ] Deduced a trap composed of 99 places in 139 ms of which 1 ms to minimize.
[2023-03-13 18:14:32] [INFO ] Deduced a trap composed of 104 places in 140 ms of which 0 ms to minimize.
[2023-03-13 18:14:32] [INFO ] Deduced a trap composed of 106 places in 139 ms of which 1 ms to minimize.
[2023-03-13 18:14:32] [INFO ] Deduced a trap composed of 108 places in 141 ms of which 1 ms to minimize.
[2023-03-13 18:14:32] [INFO ] Deduced a trap composed of 41 places in 117 ms of which 1 ms to minimize.
[2023-03-13 18:14:32] [INFO ] Deduced a trap composed of 45 places in 107 ms of which 1 ms to minimize.
[2023-03-13 18:14:32] [INFO ] Deduced a trap composed of 28 places in 88 ms of which 0 ms to minimize.
[2023-03-13 18:14:32] [INFO ] Deduced a trap composed of 51 places in 72 ms of which 1 ms to minimize.
[2023-03-13 18:14:33] [INFO ] Deduced a trap composed of 43 places in 107 ms of which 1 ms to minimize.
[2023-03-13 18:14:33] [INFO ] Deduced a trap composed of 44 places in 78 ms of which 0 ms to minimize.
[2023-03-13 18:14:33] [INFO ] Deduced a trap composed of 39 places in 165 ms of which 1 ms to minimize.
[2023-03-13 18:14:33] [INFO ] Deduced a trap composed of 105 places in 216 ms of which 0 ms to minimize.
[2023-03-13 18:14:33] [INFO ] Deduced a trap composed of 46 places in 132 ms of which 1 ms to minimize.
[2023-03-13 18:14:33] [INFO ] Deduced a trap composed of 101 places in 134 ms of which 1 ms to minimize.
[2023-03-13 18:14:34] [INFO ] Deduced a trap composed of 40 places in 88 ms of which 1 ms to minimize.
[2023-03-13 18:14:34] [INFO ] Deduced a trap composed of 45 places in 87 ms of which 0 ms to minimize.
[2023-03-13 18:14:34] [INFO ] Deduced a trap composed of 35 places in 81 ms of which 1 ms to minimize.
[2023-03-13 18:14:34] [INFO ] Deduced a trap composed of 52 places in 80 ms of which 1 ms to minimize.
[2023-03-13 18:14:34] [INFO ] Deduced a trap composed of 53 places in 169 ms of which 1 ms to minimize.
[2023-03-13 18:14:34] [INFO ] Deduced a trap composed of 53 places in 130 ms of which 1 ms to minimize.
[2023-03-13 18:14:34] [INFO ] Deduced a trap composed of 107 places in 113 ms of which 1 ms to minimize.
[2023-03-13 18:14:34] [INFO ] Deduced a trap composed of 110 places in 114 ms of which 0 ms to minimize.
[2023-03-13 18:14:35] [INFO ] Deduced a trap composed of 52 places in 84 ms of which 1 ms to minimize.
[2023-03-13 18:14:35] [INFO ] Trap strengthening (SAT) tested/added 130/129 trap constraints in 23964 ms
[2023-03-13 18:14:35] [INFO ] After 24636ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :5
Attempting to minimize the solution found.
Minimization took 123 ms.
[2023-03-13 18:14:35] [INFO ] After 25005ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :5
FORMULA BusinessProcesses-PT-11-ReachabilityCardinality-13 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BusinessProcesses-PT-11-ReachabilityCardinality-02 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 7 Parikh solutions to 5 different solutions.
FORMULA BusinessProcesses-PT-11-ReachabilityCardinality-05 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 1 properties in 58 ms.
Support contains 6 out of 560 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 560/560 places, 501/501 transitions.
Graph (trivial) has 310 edges and 560 vertex of which 7 / 560 are part of one of the 1 SCC in 3 ms
Free SCC test removed 6 places
Drop transitions removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Graph (complete) has 1132 edges and 554 vertex of which 549 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.2 ms
Discarding 5 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 118 transitions
Trivial Post-agglo rules discarded 118 transitions
Performed 118 trivial Post agglomeration. Transition count delta: 118
Iterating post reduction 0 with 118 rules applied. Total rules applied 120 place count 549 transition count 374
Reduce places removed 118 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 119 rules applied. Total rules applied 239 place count 431 transition count 373
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 240 place count 430 transition count 373
Performed 90 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 90 Pre rules applied. Total rules applied 240 place count 430 transition count 283
Deduced a syphon composed of 90 places in 1 ms
Ensure Unique test removed 17 places
Reduce places removed 107 places and 0 transitions.
Iterating global reduction 3 with 197 rules applied. Total rules applied 437 place count 323 transition count 283
Discarding 66 places :
Symmetric choice reduction at 3 with 66 rule applications. Total rules 503 place count 257 transition count 217
Iterating global reduction 3 with 66 rules applied. Total rules applied 569 place count 257 transition count 217
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 569 place count 257 transition count 213
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 577 place count 253 transition count 213
Performed 84 Post agglomeration using F-continuation condition.Transition count delta: 84
Deduced a syphon composed of 84 places in 0 ms
Reduce places removed 84 places and 0 transitions.
Iterating global reduction 3 with 168 rules applied. Total rules applied 745 place count 169 transition count 129
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 747 place count 168 transition count 133
Free-agglomeration rule applied 2 times.
Iterating global reduction 3 with 2 rules applied. Total rules applied 749 place count 168 transition count 131
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 751 place count 166 transition count 131
Partial Free-agglomeration rule applied 5 times.
Drop transitions removed 5 transitions
Iterating global reduction 4 with 5 rules applied. Total rules applied 756 place count 166 transition count 131
Applied a total of 756 rules in 123 ms. Remains 166 /560 variables (removed 394) and now considering 131/501 (removed 370) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 123 ms. Remains : 166/560 places, 131/501 transitions.
Finished random walk after 680 steps, including 36 resets, run visited all 4 properties in 16 ms. (steps per millisecond=42 )
FORMULA BusinessProcesses-PT-11-ReachabilityCardinality-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-11-ReachabilityCardinality-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-11-ReachabilityCardinality-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-11-ReachabilityCardinality-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 26673 ms.
timeout --kill-after=10s --signal=SIGINT 1m for testing only

Marcie built on Linux at 2019-11-18.
A model checker for Generalized Stochastic Petri nets

authors: Alex Tovchigrechko (IDD package and CTL model checking)

Martin Schwarick (Symbolic numerical analysis and CSL model checking)

Christian Rohr (Simulative and approximative numerical model checking)

marcie@informatik.tu-cottbus.de

called as: /home/mcc/BenchKit/bin//../reducer/bin//../../marcie/bin/marcie --net-file=model.pnml --mcc-file=ReachabilityCardinality.xml --memory=6 --mcc-mode

parse successfull
net created successfully

Net: BusinessProcesses_PT_11
(NrP: 567 NrTr: 508 NrArc: 1512)

parse formulas
formulas created successfully
place and transition orderings generation:0m 0.026sec

net check time: 0m 0.000sec

init dd package: 0m 3.119sec

TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393340 kB
MemFree: 7446704 kB
After kill :
MemTotal: 16393340 kB
MemFree: 16102552 kB

BK_TIME_CONFINEMENT_REACHED

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityCardinality -timeout 360 -rebuildPNML
check for maximal unmarked siphon
found
The net has a maximal unmarked siphon:
p227
p226
p193
p370
p194
p228
p270

The net has transition(s) that can never fire:
t272
t399
t158
t238
t248
t249
t273

check for constant places
ok
check if there are places and transitions
ok
check if there are transitions without pre-places
ok
check if at least one transition is enabled in m0
ok
check if there are transitions that can never fire
ok


initing FirstDep: 0m 0.001sec

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-11"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="marciexred"
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 marciexred"
echo " Input is BusinessProcesses-PT-11, 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 r042-tajo-167813695900534"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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