Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r138-smll-167819419300031.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool marciexred
Input is Dekker-PT-050, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r138-smll-167819419300031
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.0M
-rw-r--r-- 1 mcc users 7.3K Feb 26 01:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 79K Feb 26 01:58 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.9K Feb 26 01:49 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K Feb 26 01:49 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K Feb 25 15:56 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 25 15:56 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.7K Feb 25 15:56 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 15:56 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Feb 26 02:05 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 128K Feb 26 02:05 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 14K Feb 26 02:01 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 98K Feb 26 02:01 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 15:56 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Feb 25 15:56 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 1.5M 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 Dekker-PT-050-ReachabilityFireability-00
FORMULA_NAME Dekker-PT-050-ReachabilityFireability-01
FORMULA_NAME Dekker-PT-050-ReachabilityFireability-02
FORMULA_NAME Dekker-PT-050-ReachabilityFireability-03
FORMULA_NAME Dekker-PT-050-ReachabilityFireability-04
FORMULA_NAME Dekker-PT-050-ReachabilityFireability-05
FORMULA_NAME Dekker-PT-050-ReachabilityFireability-06
FORMULA_NAME Dekker-PT-050-ReachabilityFireability-07
FORMULA_NAME Dekker-PT-050-ReachabilityFireability-08
FORMULA_NAME Dekker-PT-050-ReachabilityFireability-09
FORMULA_NAME Dekker-PT-050-ReachabilityFireability-10
FORMULA_NAME Dekker-PT-050-ReachabilityFireability-11
FORMULA_NAME Dekker-PT-050-ReachabilityFireability-12
FORMULA_NAME Dekker-PT-050-ReachabilityFireability-13
FORMULA_NAME Dekker-PT-050-ReachabilityFireability-14
FORMULA_NAME Dekker-PT-050-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1678535363191

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=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Dekker-PT-050
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-11 11:49:26] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2023-03-11 11:49:26] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-11 11:49:27] [INFO ] Load time of PNML (sax parser for PT used): 444 ms
[2023-03-11 11:49:27] [INFO ] Transformed 250 places.
[2023-03-11 11:49:27] [INFO ] Transformed 2600 transitions.
[2023-03-11 11:49:27] [INFO ] Found NUPN structural information;
[2023-03-11 11:49:27] [INFO ] Parsed PT model containing 250 places and 2600 transitions and 20100 arcs in 696 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 34 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 6 formulas.
FORMULA Dekker-PT-050-ReachabilityFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Dekker-PT-050-ReachabilityFireability-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Dekker-PT-050-ReachabilityFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Dekker-PT-050-ReachabilityFireability-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Dekker-PT-050-ReachabilityFireability-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Dekker-PT-050-ReachabilityFireability-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 2 resets, run finished after 828 ms. (steps per millisecond=12 ) properties (out of 10) seen :8
FORMULA Dekker-PT-050-ReachabilityFireability-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Dekker-PT-050-ReachabilityFireability-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Dekker-PT-050-ReachabilityFireability-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Dekker-PT-050-ReachabilityFireability-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Dekker-PT-050-ReachabilityFireability-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Dekker-PT-050-ReachabilityFireability-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Dekker-PT-050-ReachabilityFireability-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Dekker-PT-050-ReachabilityFireability-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 208 ms. (steps per millisecond=48 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 204 ms. (steps per millisecond=49 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-11 11:49:29] [INFO ] Flow matrix only has 200 transitions (discarded 2400 similar events)
// Phase 1: matrix 200 rows 250 cols
[2023-03-11 11:49:29] [INFO ] Computed 150 place invariants in 45 ms
[2023-03-11 11:49:29] [INFO ] After 510ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-11 11:49:30] [INFO ] [Nat]Absence check using 100 positive place invariants in 53 ms returned sat
[2023-03-11 11:49:30] [INFO ] [Nat]Absence check using 100 positive and 50 generalized place invariants in 23 ms returned sat
[2023-03-11 11:49:30] [INFO ] After 768ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-11 11:49:30] [INFO ] State equation strengthened by 50 read => feed constraints.
[2023-03-11 11:49:31] [INFO ] After 370ms SMT Verify possible using 50 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-11 11:49:31] [INFO ] Deduced a trap composed of 4 places in 234 ms of which 9 ms to minimize.
[2023-03-11 11:49:31] [INFO ] Deduced a trap composed of 4 places in 193 ms of which 1 ms to minimize.
[2023-03-11 11:49:32] [INFO ] Deduced a trap composed of 5 places in 170 ms of which 2 ms to minimize.
[2023-03-11 11:49:32] [INFO ] Deduced a trap composed of 4 places in 154 ms of which 2 ms to minimize.
[2023-03-11 11:49:32] [INFO ] Deduced a trap composed of 4 places in 176 ms of which 1 ms to minimize.
[2023-03-11 11:49:32] [INFO ] Deduced a trap composed of 4 places in 176 ms of which 1 ms to minimize.
[2023-03-11 11:49:32] [INFO ] Deduced a trap composed of 4 places in 149 ms of which 2 ms to minimize.
[2023-03-11 11:49:32] [INFO ] Deduced a trap composed of 4 places in 97 ms of which 1 ms to minimize.
[2023-03-11 11:49:33] [INFO ] Deduced a trap composed of 4 places in 91 ms of which 1 ms to minimize.
[2023-03-11 11:49:33] [INFO ] Deduced a trap composed of 4 places in 110 ms of which 1 ms to minimize.
[2023-03-11 11:49:33] [INFO ] Deduced a trap composed of 4 places in 99 ms of which 1 ms to minimize.
[2023-03-11 11:49:33] [INFO ] Deduced a trap composed of 6 places in 67 ms of which 1 ms to minimize.
[2023-03-11 11:49:33] [INFO ] Deduced a trap composed of 4 places in 55 ms of which 1 ms to minimize.
[2023-03-11 11:49:33] [INFO ] Deduced a trap composed of 4 places in 106 ms of which 1 ms to minimize.
[2023-03-11 11:49:33] [INFO ] Deduced a trap composed of 6 places in 103 ms of which 1 ms to minimize.
[2023-03-11 11:49:33] [INFO ] Deduced a trap composed of 4 places in 84 ms of which 0 ms to minimize.
[2023-03-11 11:49:33] [INFO ] Deduced a trap composed of 6 places in 94 ms of which 1 ms to minimize.
[2023-03-11 11:49:34] [INFO ] Deduced a trap composed of 4 places in 71 ms of which 1 ms to minimize.
[2023-03-11 11:49:34] [INFO ] Deduced a trap composed of 4 places in 64 ms of which 1 ms to minimize.
[2023-03-11 11:49:34] [INFO ] Deduced a trap composed of 6 places in 98 ms of which 0 ms to minimize.
[2023-03-11 11:49:34] [INFO ] Deduced a trap composed of 4 places in 76 ms of which 1 ms to minimize.
[2023-03-11 11:49:34] [INFO ] Deduced a trap composed of 4 places in 104 ms of which 1 ms to minimize.
[2023-03-11 11:49:34] [INFO ] Deduced a trap composed of 4 places in 118 ms of which 1 ms to minimize.
[2023-03-11 11:49:34] [INFO ] Deduced a trap composed of 4 places in 100 ms of which 1 ms to minimize.
[2023-03-11 11:49:34] [INFO ] Deduced a trap composed of 4 places in 91 ms of which 1 ms to minimize.
[2023-03-11 11:49:34] [INFO ] Deduced a trap composed of 4 places in 83 ms of which 1 ms to minimize.
[2023-03-11 11:49:35] [INFO ] Deduced a trap composed of 6 places in 87 ms of which 1 ms to minimize.
[2023-03-11 11:49:35] [INFO ] Deduced a trap composed of 5 places in 71 ms of which 0 ms to minimize.
[2023-03-11 11:49:35] [INFO ] Deduced a trap composed of 5 places in 64 ms of which 0 ms to minimize.
[2023-03-11 11:49:35] [INFO ] Deduced a trap composed of 4 places in 58 ms of which 0 ms to minimize.
[2023-03-11 11:49:35] [INFO ] Deduced a trap composed of 4 places in 49 ms of which 0 ms to minimize.
[2023-03-11 11:49:35] [INFO ] Deduced a trap composed of 4 places in 50 ms of which 1 ms to minimize.
[2023-03-11 11:49:35] [INFO ] Deduced a trap composed of 4 places in 44 ms of which 0 ms to minimize.
[2023-03-11 11:49:35] [INFO ] Deduced a trap composed of 4 places in 51 ms of which 1 ms to minimize.
[2023-03-11 11:49:35] [INFO ] Deduced a trap composed of 4 places in 45 ms of which 7 ms to minimize.
[2023-03-11 11:49:35] [INFO ] Trap strengthening (SAT) tested/added 36/35 trap constraints in 4269 ms
[2023-03-11 11:49:36] [INFO ] Deduced a trap composed of 4 places in 212 ms of which 1 ms to minimize.
[2023-03-11 11:49:36] [INFO ] Deduced a trap composed of 4 places in 202 ms of which 1 ms to minimize.
[2023-03-11 11:49:36] [INFO ] Deduced a trap composed of 4 places in 292 ms of which 1 ms to minimize.
[2023-03-11 11:49:37] [INFO ] Deduced a trap composed of 4 places in 315 ms of which 1 ms to minimize.
[2023-03-11 11:49:37] [INFO ] Deduced a trap composed of 4 places in 286 ms of which 3 ms to minimize.
[2023-03-11 11:49:37] [INFO ] Deduced a trap composed of 5 places in 277 ms of which 1 ms to minimize.
[2023-03-11 11:49:37] [INFO ] Deduced a trap composed of 4 places in 257 ms of which 1 ms to minimize.
[2023-03-11 11:49:38] [INFO ] Deduced a trap composed of 4 places in 240 ms of which 1 ms to minimize.
[2023-03-11 11:49:38] [INFO ] Deduced a trap composed of 6 places in 260 ms of which 1 ms to minimize.
[2023-03-11 11:49:38] [INFO ] Deduced a trap composed of 4 places in 238 ms of which 1 ms to minimize.
[2023-03-11 11:49:39] [INFO ] Deduced a trap composed of 4 places in 221 ms of which 1 ms to minimize.
[2023-03-11 11:49:39] [INFO ] Deduced a trap composed of 6 places in 217 ms of which 0 ms to minimize.
[2023-03-11 11:49:39] [INFO ] Deduced a trap composed of 4 places in 219 ms of which 1 ms to minimize.
[2023-03-11 11:49:39] [INFO ] Deduced a trap composed of 4 places in 204 ms of which 1 ms to minimize.
[2023-03-11 11:49:40] [INFO ] Deduced a trap composed of 4 places in 203 ms of which 1 ms to minimize.
[2023-03-11 11:49:40] [INFO ] Deduced a trap composed of 4 places in 200 ms of which 3 ms to minimize.
[2023-03-11 11:49:40] [INFO ] Deduced a trap composed of 4 places in 222 ms of which 1 ms to minimize.
[2023-03-11 11:49:40] [INFO ] Deduced a trap composed of 4 places in 172 ms of which 1 ms to minimize.
[2023-03-11 11:49:40] [INFO ] Deduced a trap composed of 4 places in 175 ms of which 1 ms to minimize.
[2023-03-11 11:49:41] [INFO ] Deduced a trap composed of 4 places in 168 ms of which 1 ms to minimize.
[2023-03-11 11:49:41] [INFO ] Deduced a trap composed of 5 places in 148 ms of which 1 ms to minimize.
[2023-03-11 11:49:41] [INFO ] Deduced a trap composed of 4 places in 151 ms of which 1 ms to minimize.
[2023-03-11 11:49:41] [INFO ] Deduced a trap composed of 4 places in 138 ms of which 1 ms to minimize.
[2023-03-11 11:49:41] [INFO ] Deduced a trap composed of 4 places in 127 ms of which 0 ms to minimize.
[2023-03-11 11:49:41] [INFO ] Deduced a trap composed of 4 places in 120 ms of which 1 ms to minimize.
[2023-03-11 11:49:42] [INFO ] Deduced a trap composed of 4 places in 120 ms of which 1 ms to minimize.
[2023-03-11 11:49:42] [INFO ] Deduced a trap composed of 4 places in 95 ms of which 1 ms to minimize.
[2023-03-11 11:49:42] [INFO ] Deduced a trap composed of 4 places in 93 ms of which 0 ms to minimize.
[2023-03-11 11:49:42] [INFO ] Deduced a trap composed of 6 places in 91 ms of which 2 ms to minimize.
[2023-03-11 11:49:42] [INFO ] Deduced a trap composed of 4 places in 82 ms of which 1 ms to minimize.
[2023-03-11 11:49:42] [INFO ] Deduced a trap composed of 6 places in 73 ms of which 1 ms to minimize.
[2023-03-11 11:49:42] [INFO ] Deduced a trap composed of 4 places in 63 ms of which 1 ms to minimize.
[2023-03-11 11:49:42] [INFO ] Deduced a trap composed of 4 places in 56 ms of which 1 ms to minimize.
[2023-03-11 11:49:42] [INFO ] Deduced a trap composed of 4 places in 48 ms of which 1 ms to minimize.
[2023-03-11 11:49:42] [INFO ] Deduced a trap composed of 4 places in 41 ms of which 1 ms to minimize.
[2023-03-11 11:49:42] [INFO ] Trap strengthening (SAT) tested/added 36/35 trap constraints in 6929 ms
[2023-03-11 11:49:42] [INFO ] After 12023ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 469 ms.
[2023-03-11 11:49:43] [INFO ] After 13632ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 8 ms.
Support contains 134 out of 250 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 250/250 places, 2600/2600 transitions.
Applied a total of 0 rules in 195 ms. Remains 250 /250 variables (removed 0) and now considering 2600/2600 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 200 ms. Remains : 250/250 places, 2600/2600 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 324 ms. (steps per millisecond=30 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 165 ms. (steps per millisecond=60 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 137 ms. (steps per millisecond=73 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 179265 steps, run timeout after 3001 ms. (steps per millisecond=59 ) properties seen :{}
Probabilistic random walk after 179265 steps, saw 148523 distinct states, run finished after 3005 ms. (steps per millisecond=59 ) properties seen :0
Running SMT prover for 2 properties.
[2023-03-11 11:49:47] [INFO ] Flow matrix only has 200 transitions (discarded 2400 similar events)
[2023-03-11 11:49:47] [INFO ] Invariant cache hit.
[2023-03-11 11:49:47] [INFO ] After 136ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-11 11:49:47] [INFO ] [Nat]Absence check using 100 positive place invariants in 36 ms returned sat
[2023-03-11 11:49:47] [INFO ] [Nat]Absence check using 100 positive and 50 generalized place invariants in 16 ms returned sat
[2023-03-11 11:49:48] [INFO ] After 530ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-11 11:49:48] [INFO ] State equation strengthened by 50 read => feed constraints.
[2023-03-11 11:49:48] [INFO ] After 392ms SMT Verify possible using 50 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-11 11:49:49] [INFO ] Deduced a trap composed of 4 places in 175 ms of which 1 ms to minimize.
[2023-03-11 11:49:49] [INFO ] Deduced a trap composed of 4 places in 157 ms of which 1 ms to minimize.
[2023-03-11 11:49:49] [INFO ] Deduced a trap composed of 4 places in 171 ms of which 1 ms to minimize.
[2023-03-11 11:49:49] [INFO ] Deduced a trap composed of 4 places in 131 ms of which 1 ms to minimize.
[2023-03-11 11:49:49] [INFO ] Deduced a trap composed of 6 places in 85 ms of which 1 ms to minimize.
[2023-03-11 11:49:49] [INFO ] Deduced a trap composed of 6 places in 84 ms of which 1 ms to minimize.
[2023-03-11 11:49:49] [INFO ] Deduced a trap composed of 5 places in 70 ms of which 0 ms to minimize.
[2023-03-11 11:49:49] [INFO ] Deduced a trap composed of 5 places in 65 ms of which 1 ms to minimize.
[2023-03-11 11:49:50] [INFO ] Deduced a trap composed of 4 places in 59 ms of which 1 ms to minimize.
[2023-03-11 11:49:50] [INFO ] Deduced a trap composed of 4 places in 55 ms of which 1 ms to minimize.
[2023-03-11 11:49:50] [INFO ] Deduced a trap composed of 4 places in 54 ms of which 1 ms to minimize.
[2023-03-11 11:49:50] [INFO ] Deduced a trap composed of 6 places in 48 ms of which 1 ms to minimize.
[2023-03-11 11:49:50] [INFO ] Deduced a trap composed of 4 places in 43 ms of which 0 ms to minimize.
[2023-03-11 11:49:50] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 1461 ms
[2023-03-11 11:49:50] [INFO ] Deduced a trap composed of 5 places in 230 ms of which 0 ms to minimize.
[2023-03-11 11:49:51] [INFO ] Deduced a trap composed of 6 places in 182 ms of which 0 ms to minimize.
[2023-03-11 11:49:51] [INFO ] Deduced a trap composed of 4 places in 225 ms of which 1 ms to minimize.
[2023-03-11 11:49:51] [INFO ] Deduced a trap composed of 4 places in 228 ms of which 0 ms to minimize.
[2023-03-11 11:49:51] [INFO ] Deduced a trap composed of 4 places in 240 ms of which 1 ms to minimize.
[2023-03-11 11:49:52] [INFO ] Deduced a trap composed of 5 places in 271 ms of which 1 ms to minimize.
[2023-03-11 11:49:52] [INFO ] Deduced a trap composed of 6 places in 214 ms of which 1 ms to minimize.
[2023-03-11 11:49:52] [INFO ] Deduced a trap composed of 6 places in 207 ms of which 1 ms to minimize.
[2023-03-11 11:49:52] [INFO ] Deduced a trap composed of 4 places in 141 ms of which 1 ms to minimize.
[2023-03-11 11:49:52] [INFO ] Deduced a trap composed of 4 places in 137 ms of which 0 ms to minimize.
[2023-03-11 11:49:53] [INFO ] Deduced a trap composed of 4 places in 225 ms of which 0 ms to minimize.
[2023-03-11 11:49:53] [INFO ] Deduced a trap composed of 6 places in 217 ms of which 1 ms to minimize.
[2023-03-11 11:49:53] [INFO ] Deduced a trap composed of 4 places in 203 ms of which 1 ms to minimize.
[2023-03-11 11:49:53] [INFO ] Deduced a trap composed of 4 places in 158 ms of which 0 ms to minimize.
[2023-03-11 11:49:53] [INFO ] Deduced a trap composed of 4 places in 104 ms of which 0 ms to minimize.
[2023-03-11 11:49:53] [INFO ] Deduced a trap composed of 6 places in 156 ms of which 1 ms to minimize.
[2023-03-11 11:49:54] [INFO ] Deduced a trap composed of 4 places in 145 ms of which 1 ms to minimize.
[2023-03-11 11:49:54] [INFO ] Deduced a trap composed of 6 places in 170 ms of which 1 ms to minimize.
[2023-03-11 11:49:54] [INFO ] Deduced a trap composed of 4 places in 159 ms of which 1 ms to minimize.
[2023-03-11 11:49:54] [INFO ] Deduced a trap composed of 4 places in 151 ms of which 1 ms to minimize.
[2023-03-11 11:49:54] [INFO ] Deduced a trap composed of 4 places in 117 ms of which 1 ms to minimize.
[2023-03-11 11:49:54] [INFO ] Deduced a trap composed of 6 places in 131 ms of which 1 ms to minimize.
[2023-03-11 11:49:55] [INFO ] Deduced a trap composed of 4 places in 106 ms of which 0 ms to minimize.
[2023-03-11 11:49:55] [INFO ] Deduced a trap composed of 4 places in 98 ms of which 1 ms to minimize.
[2023-03-11 11:49:55] [INFO ] Deduced a trap composed of 4 places in 91 ms of which 1 ms to minimize.
[2023-03-11 11:49:55] [INFO ] Deduced a trap composed of 4 places in 86 ms of which 1 ms to minimize.
[2023-03-11 11:49:55] [INFO ] Deduced a trap composed of 4 places in 84 ms of which 0 ms to minimize.
[2023-03-11 11:49:55] [INFO ] Deduced a trap composed of 5 places in 70 ms of which 1 ms to minimize.
[2023-03-11 11:49:55] [INFO ] Deduced a trap composed of 4 places in 64 ms of which 1 ms to minimize.
[2023-03-11 11:49:55] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 1 ms to minimize.
[2023-03-11 11:49:55] [INFO ] Trap strengthening (SAT) tested/added 31/30 trap constraints in 5213 ms
[2023-03-11 11:49:55] [INFO ] After 7492ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 342 ms.
[2023-03-11 11:49:56] [INFO ] After 8605ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 4 ms.
Support contains 134 out of 250 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 250/250 places, 2600/2600 transitions.
Applied a total of 0 rules in 152 ms. Remains 250 /250 variables (removed 0) and now considering 2600/2600 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 154 ms. Remains : 250/250 places, 2600/2600 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 250/250 places, 2600/2600 transitions.
Applied a total of 0 rules in 183 ms. Remains 250 /250 variables (removed 0) and now considering 2600/2600 (removed 0) transitions.
[2023-03-11 11:49:56] [INFO ] Flow matrix only has 200 transitions (discarded 2400 similar events)
[2023-03-11 11:49:56] [INFO ] Invariant cache hit.
[2023-03-11 11:49:56] [INFO ] Implicit Places using invariants in 445 ms returned [100, 103, 106, 109, 112, 115, 118, 121, 124, 127, 130, 133, 136, 139, 142, 145, 148, 151, 154, 157, 160, 163, 166, 169, 172, 175, 178, 181, 184, 187, 190, 193, 196, 199, 202, 205, 208, 211, 214, 217, 220, 223, 226, 229, 232, 235, 238, 241, 244, 247]
Discarding 50 places :
Implicit Place search using SMT only with invariants took 453 ms to find 50 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 200/250 places, 2600/2600 transitions.
Applied a total of 0 rules in 108 ms. Remains 200 /200 variables (removed 0) and now considering 2600/2600 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 751 ms. Remains : 200/250 places, 2600/2600 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 402 ms. (steps per millisecond=24 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 151 ms. (steps per millisecond=66 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 103 ms. (steps per millisecond=97 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 218484 steps, run timeout after 3001 ms. (steps per millisecond=72 ) properties seen :{}
Probabilistic random walk after 218484 steps, saw 180939 distinct states, run finished after 3001 ms. (steps per millisecond=72 ) properties seen :0
Running SMT prover for 2 properties.
[2023-03-11 11:50:00] [INFO ] Flow matrix only has 200 transitions (discarded 2400 similar events)
// Phase 1: matrix 200 rows 200 cols
[2023-03-11 11:50:00] [INFO ] Computed 100 place invariants in 3 ms
[2023-03-11 11:50:00] [INFO ] After 110ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-11 11:50:01] [INFO ] [Nat]Absence check using 100 positive place invariants in 33 ms returned sat
[2023-03-11 11:50:01] [INFO ] After 589ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-11 11:50:01] [INFO ] State equation strengthened by 50 read => feed constraints.
[2023-03-11 11:50:02] [INFO ] After 539ms SMT Verify possible using 50 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-11 11:50:02] [INFO ] Deduced a trap composed of 4 places in 142 ms of which 0 ms to minimize.
[2023-03-11 11:50:02] [INFO ] Deduced a trap composed of 4 places in 133 ms of which 0 ms to minimize.
[2023-03-11 11:50:02] [INFO ] Deduced a trap composed of 4 places in 132 ms of which 1 ms to minimize.
[2023-03-11 11:50:03] [INFO ] Deduced a trap composed of 4 places in 156 ms of which 1 ms to minimize.
[2023-03-11 11:50:03] [INFO ] Deduced a trap composed of 4 places in 135 ms of which 1 ms to minimize.
[2023-03-11 11:50:03] [INFO ] Deduced a trap composed of 4 places in 91 ms of which 0 ms to minimize.
[2023-03-11 11:50:03] [INFO ] Deduced a trap composed of 4 places in 85 ms of which 0 ms to minimize.
[2023-03-11 11:50:03] [INFO ] Deduced a trap composed of 4 places in 81 ms of which 1 ms to minimize.
[2023-03-11 11:50:03] [INFO ] Deduced a trap composed of 4 places in 110 ms of which 1 ms to minimize.
[2023-03-11 11:50:03] [INFO ] Deduced a trap composed of 4 places in 92 ms of which 1 ms to minimize.
[2023-03-11 11:50:03] [INFO ] Deduced a trap composed of 4 places in 98 ms of which 1 ms to minimize.
[2023-03-11 11:50:03] [INFO ] Trap strengthening procedure interrupted after too many repetitions 1438 ms
[2023-03-11 11:50:03] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 1438 ms
[2023-03-11 11:50:04] [INFO ] Deduced a trap composed of 4 places in 259 ms of which 0 ms to minimize.
[2023-03-11 11:50:04] [INFO ] Deduced a trap composed of 4 places in 245 ms of which 0 ms to minimize.
[2023-03-11 11:50:04] [INFO ] Deduced a trap composed of 4 places in 258 ms of which 1 ms to minimize.
[2023-03-11 11:50:05] [INFO ] Deduced a trap composed of 4 places in 241 ms of which 1 ms to minimize.
[2023-03-11 11:50:05] [INFO ] Deduced a trap composed of 4 places in 249 ms of which 1 ms to minimize.
[2023-03-11 11:50:05] [INFO ] Deduced a trap composed of 4 places in 225 ms of which 1 ms to minimize.
[2023-03-11 11:50:05] [INFO ] Deduced a trap composed of 4 places in 258 ms of which 1 ms to minimize.
[2023-03-11 11:50:06] [INFO ] Deduced a trap composed of 4 places in 228 ms of which 1 ms to minimize.
[2023-03-11 11:50:06] [INFO ] Deduced a trap composed of 4 places in 210 ms of which 0 ms to minimize.
[2023-03-11 11:50:06] [INFO ] Deduced a trap composed of 4 places in 198 ms of which 1 ms to minimize.
[2023-03-11 11:50:06] [INFO ] Deduced a trap composed of 4 places in 197 ms of which 1 ms to minimize.
[2023-03-11 11:50:06] [INFO ] Trap strengthening procedure interrupted after too many repetitions 2741 ms
[2023-03-11 11:50:06] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 2742 ms
[2023-03-11 11:50:06] [INFO ] After 5117ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 295 ms.
[2023-03-11 11:50:07] [INFO ] After 6194ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 1 ms.
Support contains 134 out of 200 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 200/200 places, 2600/2600 transitions.
Applied a total of 0 rules in 58 ms. Remains 200 /200 variables (removed 0) and now considering 2600/2600 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 58 ms. Remains : 200/200 places, 2600/2600 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 200/200 places, 2600/2600 transitions.
Applied a total of 0 rules in 57 ms. Remains 200 /200 variables (removed 0) and now considering 2600/2600 (removed 0) transitions.
[2023-03-11 11:50:07] [INFO ] Flow matrix only has 200 transitions (discarded 2400 similar events)
[2023-03-11 11:50:07] [INFO ] Invariant cache hit.
[2023-03-11 11:50:07] [INFO ] Implicit Places using invariants in 208 ms returned []
[2023-03-11 11:50:07] [INFO ] Flow matrix only has 200 transitions (discarded 2400 similar events)
[2023-03-11 11:50:07] [INFO ] Invariant cache hit.
[2023-03-11 11:50:07] [INFO ] State equation strengthened by 50 read => feed constraints.
[2023-03-11 11:50:07] [INFO ] Implicit Places using invariants and state equation in 460 ms returned []
Implicit Place search using SMT with State Equation took 670 ms to find 0 implicit places.
[2023-03-11 11:50:08] [INFO ] Redundant transitions in 235 ms returned []
[2023-03-11 11:50:08] [INFO ] Flow matrix only has 200 transitions (discarded 2400 similar events)
[2023-03-11 11:50:08] [INFO ] Invariant cache hit.
[2023-03-11 11:50:10] [INFO ] Dead Transitions using invariants and state equation in 2116 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3089 ms. Remains : 200/200 places, 2600/2600 transitions.
Ensure Unique test removed 2400 transitions
Reduce isomorphic transitions removed 2400 transitions.
Iterating post reduction 0 with 2400 rules applied. Total rules applied 2400 place count 200 transition count 200
Free-agglomeration rule applied 12 times.
Iterating global reduction 1 with 12 rules applied. Total rules applied 2412 place count 200 transition count 188
Ensure Unique test removed 12 places
Reduce places removed 24 places and 0 transitions.
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 1 with 36 rules applied. Total rules applied 2448 place count 176 transition count 176
Applied a total of 2448 rules in 82 ms. Remains 176 /200 variables (removed 24) and now considering 176/2600 (removed 2424) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 176 rows 176 cols
[2023-03-11 11:50:10] [INFO ] Computed 88 place invariants in 6 ms
[2023-03-11 11:50:10] [INFO ] After 87ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-11 11:50:10] [INFO ] [Nat]Absence check using 88 positive place invariants in 20 ms returned sat
[2023-03-11 11:50:10] [INFO ] After 302ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-11 11:50:11] [INFO ] After 523ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 338 ms.
[2023-03-11 11:50:11] [INFO ] After 954ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
[2023-03-11 11:50:11] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 9 ms.
[2023-03-11 11:50:11] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 200 places, 2600 transitions and 17550 arcs took 25 ms.
[2023-03-11 11:50:12] [INFO ] Flatten gal took : 340 ms
Total runtime 45295 ms.
There are residual formulas that ITS could not solve within timeout
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=ReachabilityFireability.xml --memory=6 --mcc-mode

parse successfull
net created successfully

Net: Dekker_PT_050
(NrP: 200 NrTr: 2600 NrArc: 17550)

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

net check time: 0m 0.003sec

init dd package: 0m 3.672sec

TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 10517964 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16097052 kB

BK_TIME_CONFINEMENT_REACHED

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityFireability -timeout 360 -rebuildPNML
check for maximal unmarked siphon
ok
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.020sec

237521

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="Dekker-PT-050"
export BK_EXAMINATION="ReachabilityFireability"
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 Dekker-PT-050, 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 r138-smll-167819419300031"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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