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.r426-tajo-167905978500151.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 ShieldRVs-PT-050A, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r426-tajo-167905978500151
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 744K
-rw-r--r-- 1 mcc users 6.7K Feb 26 18:44 CTLCardinality.txt
-rw-r--r-- 1 mcc users 73K Feb 26 18:44 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K Feb 26 18:31 CTLFireability.txt
-rw-r--r-- 1 mcc users 54K Feb 26 18:31 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.8K Feb 25 17:03 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K Feb 25 17:03 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 17:03 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Feb 25 17:03 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.3K Feb 26 19:05 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 81K Feb 26 19:05 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.1K Feb 26 18:52 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 69K Feb 26 18:52 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 17:03 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 17:03 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 320K Mar 5 18:23 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 ShieldRVs-PT-050A-ReachabilityFireability-00
FORMULA_NAME ShieldRVs-PT-050A-ReachabilityFireability-01
FORMULA_NAME ShieldRVs-PT-050A-ReachabilityFireability-02
FORMULA_NAME ShieldRVs-PT-050A-ReachabilityFireability-03
FORMULA_NAME ShieldRVs-PT-050A-ReachabilityFireability-04
FORMULA_NAME ShieldRVs-PT-050A-ReachabilityFireability-05
FORMULA_NAME ShieldRVs-PT-050A-ReachabilityFireability-06
FORMULA_NAME ShieldRVs-PT-050A-ReachabilityFireability-07
FORMULA_NAME ShieldRVs-PT-050A-ReachabilityFireability-08
FORMULA_NAME ShieldRVs-PT-050A-ReachabilityFireability-09
FORMULA_NAME ShieldRVs-PT-050A-ReachabilityFireability-10
FORMULA_NAME ShieldRVs-PT-050A-ReachabilityFireability-11
FORMULA_NAME ShieldRVs-PT-050A-ReachabilityFireability-12
FORMULA_NAME ShieldRVs-PT-050A-ReachabilityFireability-13
FORMULA_NAME ShieldRVs-PT-050A-ReachabilityFireability-14
FORMULA_NAME ShieldRVs-PT-050A-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1679343963381

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=ShieldRVs-PT-050A
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-20 20:26:05] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2023-03-20 20:26:05] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-20 20:26:05] [INFO ] Load time of PNML (sax parser for PT used): 109 ms
[2023-03-20 20:26:05] [INFO ] Transformed 703 places.
[2023-03-20 20:26:05] [INFO ] Transformed 953 transitions.
[2023-03-20 20:26:05] [INFO ] Found NUPN structural information;
[2023-03-20 20:26:05] [INFO ] Parsed PT model containing 703 places and 953 transitions and 4600 arcs in 191 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 12 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 15 resets, run finished after 388 ms. (steps per millisecond=25 ) properties (out of 16) seen :10
FORMULA ShieldRVs-PT-050A-ReachabilityFireability-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-050A-ReachabilityFireability-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-050A-ReachabilityFireability-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-050A-ReachabilityFireability-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-050A-ReachabilityFireability-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-050A-ReachabilityFireability-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-050A-ReachabilityFireability-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-050A-ReachabilityFireability-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-050A-ReachabilityFireability-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-050A-ReachabilityFireability-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 6) seen :1
FORMULA ShieldRVs-PT-050A-ReachabilityFireability-14 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 81 ms. (steps per millisecond=123 ) properties (out of 5) seen :1
FORMULA ShieldRVs-PT-050A-ReachabilityFireability-05 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 73 ms. (steps per millisecond=137 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 953 rows 703 cols
[2023-03-20 20:26:06] [INFO ] Computed 201 place invariants in 27 ms
[2023-03-20 20:26:06] [INFO ] After 310ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-20 20:26:06] [INFO ] [Nat]Absence check using 201 positive place invariants in 26 ms returned sat
[2023-03-20 20:26:07] [INFO ] After 1202ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-20 20:26:08] [INFO ] Deduced a trap composed of 8 places in 220 ms of which 7 ms to minimize.
[2023-03-20 20:26:08] [INFO ] Deduced a trap composed of 7 places in 174 ms of which 1 ms to minimize.
[2023-03-20 20:26:08] [INFO ] Deduced a trap composed of 9 places in 137 ms of which 1 ms to minimize.
[2023-03-20 20:26:08] [INFO ] Deduced a trap composed of 8 places in 117 ms of which 1 ms to minimize.
[2023-03-20 20:26:08] [INFO ] Deduced a trap composed of 8 places in 128 ms of which 0 ms to minimize.
[2023-03-20 20:26:09] [INFO ] Deduced a trap composed of 8 places in 186 ms of which 1 ms to minimize.
[2023-03-20 20:26:09] [INFO ] Deduced a trap composed of 8 places in 158 ms of which 1 ms to minimize.
[2023-03-20 20:26:09] [INFO ] Deduced a trap composed of 11 places in 140 ms of which 1 ms to minimize.
[2023-03-20 20:26:09] [INFO ] Deduced a trap composed of 11 places in 171 ms of which 2 ms to minimize.
[2023-03-20 20:26:09] [INFO ] Deduced a trap composed of 15 places in 156 ms of which 1 ms to minimize.
[2023-03-20 20:26:10] [INFO ] Deduced a trap composed of 8 places in 174 ms of which 0 ms to minimize.
[2023-03-20 20:26:10] [INFO ] Deduced a trap composed of 23 places in 158 ms of which 0 ms to minimize.
[2023-03-20 20:26:10] [INFO ] Deduced a trap composed of 20 places in 160 ms of which 1 ms to minimize.
[2023-03-20 20:26:10] [INFO ] Deduced a trap composed of 20 places in 120 ms of which 0 ms to minimize.
[2023-03-20 20:26:10] [INFO ] Deduced a trap composed of 20 places in 136 ms of which 0 ms to minimize.
[2023-03-20 20:26:11] [INFO ] Deduced a trap composed of 11 places in 145 ms of which 1 ms to minimize.
[2023-03-20 20:26:11] [INFO ] Deduced a trap composed of 24 places in 149 ms of which 1 ms to minimize.
[2023-03-20 20:26:11] [INFO ] Deduced a trap composed of 8 places in 133 ms of which 0 ms to minimize.
[2023-03-20 20:26:11] [INFO ] Deduced a trap composed of 15 places in 144 ms of which 0 ms to minimize.
[2023-03-20 20:26:11] [INFO ] Deduced a trap composed of 12 places in 134 ms of which 1 ms to minimize.
[2023-03-20 20:26:12] [INFO ] Deduced a trap composed of 11 places in 160 ms of which 0 ms to minimize.
[2023-03-20 20:26:12] [INFO ] Deduced a trap composed of 15 places in 179 ms of which 1 ms to minimize.
[2023-03-20 20:26:12] [INFO ] Deduced a trap composed of 8 places in 149 ms of which 1 ms to minimize.
[2023-03-20 20:26:12] [INFO ] Deduced a trap composed of 11 places in 174 ms of which 1 ms to minimize.
[2023-03-20 20:26:12] [INFO ] Deduced a trap composed of 15 places in 136 ms of which 0 ms to minimize.
[2023-03-20 20:26:13] [INFO ] Deduced a trap composed of 11 places in 138 ms of which 1 ms to minimize.
[2023-03-20 20:26:13] [INFO ] Deduced a trap composed of 17 places in 116 ms of which 1 ms to minimize.
[2023-03-20 20:26:13] [INFO ] Deduced a trap composed of 12 places in 144 ms of which 0 ms to minimize.
[2023-03-20 20:26:13] [INFO ] Deduced a trap composed of 11 places in 138 ms of which 0 ms to minimize.
[2023-03-20 20:26:13] [INFO ] Deduced a trap composed of 15 places in 97 ms of which 0 ms to minimize.
[2023-03-20 20:26:13] [INFO ] Deduced a trap composed of 8 places in 101 ms of which 1 ms to minimize.
[2023-03-20 20:26:14] [INFO ] Deduced a trap composed of 16 places in 125 ms of which 1 ms to minimize.
[2023-03-20 20:26:14] [INFO ] Deduced a trap composed of 15 places in 115 ms of which 0 ms to minimize.
[2023-03-20 20:26:14] [INFO ] Deduced a trap composed of 16 places in 79 ms of which 0 ms to minimize.
[2023-03-20 20:26:14] [INFO ] Deduced a trap composed of 16 places in 90 ms of which 0 ms to minimize.
[2023-03-20 20:26:14] [INFO ] Deduced a trap composed of 15 places in 92 ms of which 1 ms to minimize.
[2023-03-20 20:26:14] [INFO ] Deduced a trap composed of 15 places in 82 ms of which 0 ms to minimize.
[2023-03-20 20:26:14] [INFO ] Deduced a trap composed of 18 places in 79 ms of which 0 ms to minimize.
[2023-03-20 20:26:15] [INFO ] Deduced a trap composed of 26 places in 93 ms of which 0 ms to minimize.
[2023-03-20 20:26:15] [INFO ] Deduced a trap composed of 24 places in 94 ms of which 0 ms to minimize.
[2023-03-20 20:26:15] [INFO ] Deduced a trap composed of 26 places in 101 ms of which 0 ms to minimize.
[2023-03-20 20:26:15] [INFO ] Deduced a trap composed of 24 places in 74 ms of which 0 ms to minimize.
[2023-03-20 20:26:15] [INFO ] Deduced a trap composed of 16 places in 76 ms of which 1 ms to minimize.
[2023-03-20 20:26:15] [INFO ] Deduced a trap composed of 26 places in 97 ms of which 1 ms to minimize.
[2023-03-20 20:26:15] [INFO ] Deduced a trap composed of 24 places in 81 ms of which 0 ms to minimize.
[2023-03-20 20:26:16] [INFO ] Deduced a trap composed of 26 places in 101 ms of which 1 ms to minimize.
[2023-03-20 20:26:16] [INFO ] Deduced a trap composed of 24 places in 83 ms of which 1 ms to minimize.
[2023-03-20 20:26:16] [INFO ] Deduced a trap composed of 13 places in 102 ms of which 1 ms to minimize.
[2023-03-20 20:26:16] [INFO ] Deduced a trap composed of 12 places in 98 ms of which 1 ms to minimize.
[2023-03-20 20:26:16] [INFO ] Deduced a trap composed of 12 places in 92 ms of which 0 ms to minimize.
[2023-03-20 20:26:16] [INFO ] Deduced a trap composed of 21 places in 95 ms of which 1 ms to minimize.
[2023-03-20 20:26:16] [INFO ] Deduced a trap composed of 21 places in 88 ms of which 0 ms to minimize.
[2023-03-20 20:26:17] [INFO ] Trap strengthening (SAT) tested/added 53/52 trap constraints in 9027 ms
[2023-03-20 20:26:17] [INFO ] Deduced a trap composed of 20 places in 124 ms of which 0 ms to minimize.
[2023-03-20 20:26:17] [INFO ] Deduced a trap composed of 9 places in 124 ms of which 1 ms to minimize.
[2023-03-20 20:26:18] [INFO ] Deduced a trap composed of 7 places in 115 ms of which 1 ms to minimize.
[2023-03-20 20:26:18] [INFO ] Deduced a trap composed of 7 places in 102 ms of which 0 ms to minimize.
[2023-03-20 20:26:18] [INFO ] Deduced a trap composed of 11 places in 143 ms of which 0 ms to minimize.
[2023-03-20 20:26:18] [INFO ] Deduced a trap composed of 8 places in 133 ms of which 1 ms to minimize.
[2023-03-20 20:26:18] [INFO ] Deduced a trap composed of 9 places in 137 ms of which 1 ms to minimize.
[2023-03-20 20:26:19] [INFO ] Deduced a trap composed of 8 places in 131 ms of which 0 ms to minimize.
[2023-03-20 20:26:19] [INFO ] Deduced a trap composed of 15 places in 126 ms of which 1 ms to minimize.
[2023-03-20 20:26:19] [INFO ] Deduced a trap composed of 11 places in 125 ms of which 0 ms to minimize.
[2023-03-20 20:26:19] [INFO ] Deduced a trap composed of 15 places in 138 ms of which 0 ms to minimize.
[2023-03-20 20:26:19] [INFO ] Deduced a trap composed of 7 places in 134 ms of which 0 ms to minimize.
[2023-03-20 20:26:20] [INFO ] Deduced a trap composed of 8 places in 82 ms of which 1 ms to minimize.
[2023-03-20 20:26:20] [INFO ] Deduced a trap composed of 11 places in 85 ms of which 2 ms to minimize.
[2023-03-20 20:26:20] [INFO ] Deduced a trap composed of 20 places in 87 ms of which 2 ms to minimize.
[2023-03-20 20:26:20] [INFO ] Deduced a trap composed of 9 places in 66 ms of which 11 ms to minimize.
[2023-03-20 20:26:20] [INFO ] Deduced a trap composed of 11 places in 55 ms of which 0 ms to minimize.
[2023-03-20 20:26:20] [INFO ] Trap strengthening (SAT) tested/added 18/17 trap constraints in 3335 ms
[2023-03-20 20:26:21] [INFO ] Deduced a trap composed of 15 places in 108 ms of which 1 ms to minimize.
[2023-03-20 20:26:21] [INFO ] Deduced a trap composed of 19 places in 94 ms of which 0 ms to minimize.
[2023-03-20 20:26:21] [INFO ] Deduced a trap composed of 11 places in 76 ms of which 0 ms to minimize.
[2023-03-20 20:26:21] [INFO ] Deduced a trap composed of 12 places in 59 ms of which 1 ms to minimize.
[2023-03-20 20:26:21] [INFO ] Deduced a trap composed of 11 places in 55 ms of which 0 ms to minimize.
[2023-03-20 20:26:21] [INFO ] Deduced a trap composed of 11 places in 51 ms of which 1 ms to minimize.
[2023-03-20 20:26:22] [INFO ] Deduced a trap composed of 11 places in 55 ms of which 1 ms to minimize.
[2023-03-20 20:26:22] [INFO ] Deduced a trap composed of 11 places in 53 ms of which 0 ms to minimize.
[2023-03-20 20:26:22] [INFO ] Deduced a trap composed of 17 places in 51 ms of which 1 ms to minimize.
[2023-03-20 20:26:22] [INFO ] Deduced a trap composed of 17 places in 44 ms of which 0 ms to minimize.
[2023-03-20 20:26:22] [INFO ] Deduced a trap composed of 17 places in 51 ms of which 1 ms to minimize.
[2023-03-20 20:26:22] [INFO ] Deduced a trap composed of 17 places in 56 ms of which 2 ms to minimize.
[2023-03-20 20:26:22] [INFO ] Deduced a trap composed of 23 places in 44 ms of which 0 ms to minimize.
[2023-03-20 20:26:22] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 1781 ms
[2023-03-20 20:26:23] [INFO ] Deduced a trap composed of 13 places in 44 ms of which 0 ms to minimize.
[2023-03-20 20:26:23] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 176 ms
[2023-03-20 20:26:23] [INFO ] After 16755ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 1685 ms.
[2023-03-20 20:26:25] [INFO ] After 18666ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 256 ms.
Support contains 193 out of 703 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 703/703 places, 953/953 transitions.
Partial Free-agglomeration rule applied 78 times.
Drop transitions removed 78 transitions
Iterating global reduction 0 with 78 rules applied. Total rules applied 78 place count 703 transition count 953
Applied a total of 78 rules in 128 ms. Remains 703 /703 variables (removed 0) and now considering 953/953 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 128 ms. Remains : 703/703 places, 953/953 transitions.
Incomplete random walk after 10000 steps, including 16 resets, run finished after 258 ms. (steps per millisecond=38 ) properties (out of 4) seen :2
FORMULA ShieldRVs-PT-050A-ReachabilityFireability-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-050A-ReachabilityFireability-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 953 rows 703 cols
[2023-03-20 20:26:25] [INFO ] Computed 201 place invariants in 12 ms
[2023-03-20 20:26:26] [INFO ] After 164ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-20 20:26:26] [INFO ] [Nat]Absence check using 201 positive place invariants in 23 ms returned sat
[2023-03-20 20:26:27] [INFO ] After 902ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-20 20:26:27] [INFO ] Deduced a trap composed of 7 places in 131 ms of which 1 ms to minimize.
[2023-03-20 20:26:27] [INFO ] Deduced a trap composed of 12 places in 111 ms of which 1 ms to minimize.
[2023-03-20 20:26:28] [INFO ] Deduced a trap composed of 11 places in 133 ms of which 1 ms to minimize.
[2023-03-20 20:26:28] [INFO ] Deduced a trap composed of 11 places in 112 ms of which 1 ms to minimize.
[2023-03-20 20:26:28] [INFO ] Deduced a trap composed of 7 places in 126 ms of which 0 ms to minimize.
[2023-03-20 20:26:28] [INFO ] Deduced a trap composed of 7 places in 135 ms of which 0 ms to minimize.
[2023-03-20 20:26:28] [INFO ] Deduced a trap composed of 11 places in 94 ms of which 0 ms to minimize.
[2023-03-20 20:26:29] [INFO ] Deduced a trap composed of 7 places in 107 ms of which 0 ms to minimize.
[2023-03-20 20:26:29] [INFO ] Deduced a trap composed of 11 places in 93 ms of which 0 ms to minimize.
[2023-03-20 20:26:29] [INFO ] Deduced a trap composed of 7 places in 97 ms of which 0 ms to minimize.
[2023-03-20 20:26:29] [INFO ] Deduced a trap composed of 7 places in 114 ms of which 0 ms to minimize.
[2023-03-20 20:26:29] [INFO ] Deduced a trap composed of 7 places in 153 ms of which 1 ms to minimize.
[2023-03-20 20:26:29] [INFO ] Deduced a trap composed of 7 places in 105 ms of which 0 ms to minimize.
[2023-03-20 20:26:30] [INFO ] Deduced a trap composed of 11 places in 88 ms of which 1 ms to minimize.
[2023-03-20 20:26:30] [INFO ] Deduced a trap composed of 7 places in 69 ms of which 1 ms to minimize.
[2023-03-20 20:26:30] [INFO ] Deduced a trap composed of 7 places in 57 ms of which 1 ms to minimize.
[2023-03-20 20:26:30] [INFO ] Deduced a trap composed of 11 places in 67 ms of which 0 ms to minimize.
[2023-03-20 20:26:30] [INFO ] Deduced a trap composed of 7 places in 66 ms of which 0 ms to minimize.
[2023-03-20 20:26:30] [INFO ] Deduced a trap composed of 7 places in 63 ms of which 1 ms to minimize.
[2023-03-20 20:26:30] [INFO ] Deduced a trap composed of 11 places in 60 ms of which 1 ms to minimize.
[2023-03-20 20:26:31] [INFO ] Deduced a trap composed of 20 places in 71 ms of which 0 ms to minimize.
[2023-03-20 20:26:31] [INFO ] Deduced a trap composed of 19 places in 47 ms of which 0 ms to minimize.
[2023-03-20 20:26:31] [INFO ] Deduced a trap composed of 23 places in 70 ms of which 1 ms to minimize.
[2023-03-20 20:26:31] [INFO ] Deduced a trap composed of 23 places in 62 ms of which 0 ms to minimize.
[2023-03-20 20:26:31] [INFO ] Trap strengthening (SAT) tested/added 25/24 trap constraints in 3894 ms
[2023-03-20 20:26:31] [INFO ] Deduced a trap composed of 12 places in 152 ms of which 0 ms to minimize.
[2023-03-20 20:26:32] [INFO ] Deduced a trap composed of 7 places in 131 ms of which 1 ms to minimize.
[2023-03-20 20:26:32] [INFO ] Deduced a trap composed of 7 places in 113 ms of which 0 ms to minimize.
[2023-03-20 20:26:32] [INFO ] Deduced a trap composed of 11 places in 101 ms of which 1 ms to minimize.
[2023-03-20 20:26:32] [INFO ] Deduced a trap composed of 11 places in 94 ms of which 1 ms to minimize.
[2023-03-20 20:26:32] [INFO ] Deduced a trap composed of 9 places in 95 ms of which 0 ms to minimize.
[2023-03-20 20:26:32] [INFO ] Deduced a trap composed of 11 places in 83 ms of which 0 ms to minimize.
[2023-03-20 20:26:33] [INFO ] Deduced a trap composed of 8 places in 77 ms of which 1 ms to minimize.
[2023-03-20 20:26:33] [INFO ] Deduced a trap composed of 7 places in 77 ms of which 1 ms to minimize.
[2023-03-20 20:26:33] [INFO ] Deduced a trap composed of 7 places in 73 ms of which 0 ms to minimize.
[2023-03-20 20:26:33] [INFO ] Deduced a trap composed of 11 places in 74 ms of which 1 ms to minimize.
[2023-03-20 20:26:33] [INFO ] Deduced a trap composed of 11 places in 59 ms of which 1 ms to minimize.
[2023-03-20 20:26:33] [INFO ] Deduced a trap composed of 12 places in 48 ms of which 1 ms to minimize.
[2023-03-20 20:26:33] [INFO ] Deduced a trap composed of 7 places in 25 ms of which 1 ms to minimize.
[2023-03-20 20:26:33] [INFO ] Trap strengthening (SAT) tested/added 15/14 trap constraints in 2012 ms
[2023-03-20 20:26:33] [INFO ] After 7460ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 578 ms.
[2023-03-20 20:26:34] [INFO ] After 8221ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 101 ms.
Support contains 123 out of 703 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 703/703 places, 953/953 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 702 transition count 952
Partial Free-agglomeration rule applied 8 times.
Drop transitions removed 8 transitions
Iterating global reduction 0 with 8 rules applied. Total rules applied 10 place count 702 transition count 952
Applied a total of 10 rules in 171 ms. Remains 702 /703 variables (removed 1) and now considering 952/953 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 171 ms. Remains : 702/703 places, 952/953 transitions.
Incomplete random walk after 10000 steps, including 16 resets, run finished after 164 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 61 ms. (steps per millisecond=163 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 202858 steps, run timeout after 3001 ms. (steps per millisecond=67 ) properties seen :{}
Probabilistic random walk after 202858 steps, saw 48331 distinct states, run finished after 3002 ms. (steps per millisecond=67 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 952 rows 702 cols
[2023-03-20 20:26:38] [INFO ] Computed 201 place invariants in 10 ms
[2023-03-20 20:26:38] [INFO ] After 150ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-20 20:26:38] [INFO ] [Nat]Absence check using 201 positive place invariants in 34 ms returned sat
[2023-03-20 20:26:39] [INFO ] After 782ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-20 20:26:39] [INFO ] Deduced a trap composed of 7 places in 165 ms of which 0 ms to minimize.
[2023-03-20 20:26:39] [INFO ] Deduced a trap composed of 7 places in 170 ms of which 0 ms to minimize.
[2023-03-20 20:26:40] [INFO ] Deduced a trap composed of 7 places in 147 ms of which 0 ms to minimize.
[2023-03-20 20:26:40] [INFO ] Deduced a trap composed of 7 places in 134 ms of which 0 ms to minimize.
[2023-03-20 20:26:40] [INFO ] Deduced a trap composed of 8 places in 150 ms of which 1 ms to minimize.
[2023-03-20 20:26:40] [INFO ] Deduced a trap composed of 7 places in 143 ms of which 0 ms to minimize.
[2023-03-20 20:26:40] [INFO ] Deduced a trap composed of 7 places in 140 ms of which 1 ms to minimize.
[2023-03-20 20:26:41] [INFO ] Deduced a trap composed of 7 places in 127 ms of which 0 ms to minimize.
[2023-03-20 20:26:41] [INFO ] Deduced a trap composed of 7 places in 132 ms of which 1 ms to minimize.
[2023-03-20 20:26:41] [INFO ] Deduced a trap composed of 13 places in 98 ms of which 1 ms to minimize.
[2023-03-20 20:26:41] [INFO ] Deduced a trap composed of 11 places in 97 ms of which 0 ms to minimize.
[2023-03-20 20:26:41] [INFO ] Deduced a trap composed of 11 places in 99 ms of which 0 ms to minimize.
[2023-03-20 20:26:41] [INFO ] Deduced a trap composed of 11 places in 103 ms of which 1 ms to minimize.
[2023-03-20 20:26:42] [INFO ] Deduced a trap composed of 11 places in 94 ms of which 1 ms to minimize.
[2023-03-20 20:26:42] [INFO ] Deduced a trap composed of 7 places in 86 ms of which 1 ms to minimize.
[2023-03-20 20:26:42] [INFO ] Deduced a trap composed of 12 places in 75 ms of which 0 ms to minimize.
[2023-03-20 20:26:42] [INFO ] Deduced a trap composed of 11 places in 74 ms of which 0 ms to minimize.
[2023-03-20 20:26:42] [INFO ] Deduced a trap composed of 16 places in 52 ms of which 0 ms to minimize.
[2023-03-20 20:26:42] [INFO ] Deduced a trap composed of 16 places in 57 ms of which 1 ms to minimize.
[2023-03-20 20:26:42] [INFO ] Deduced a trap composed of 7 places in 35 ms of which 2 ms to minimize.
[2023-03-20 20:26:43] [INFO ] Trap strengthening (SAT) tested/added 21/20 trap constraints in 3557 ms
[2023-03-20 20:26:43] [INFO ] Deduced a trap composed of 7 places in 97 ms of which 1 ms to minimize.
[2023-03-20 20:26:43] [INFO ] Deduced a trap composed of 7 places in 102 ms of which 1 ms to minimize.
[2023-03-20 20:26:43] [INFO ] Deduced a trap composed of 7 places in 86 ms of which 1 ms to minimize.
[2023-03-20 20:26:44] [INFO ] Deduced a trap composed of 12 places in 91 ms of which 1 ms to minimize.
[2023-03-20 20:26:44] [INFO ] Deduced a trap composed of 11 places in 104 ms of which 0 ms to minimize.
[2023-03-20 20:26:44] [INFO ] Deduced a trap composed of 11 places in 85 ms of which 0 ms to minimize.
[2023-03-20 20:26:44] [INFO ] Deduced a trap composed of 21 places in 79 ms of which 0 ms to minimize.
[2023-03-20 20:26:44] [INFO ] Deduced a trap composed of 11 places in 80 ms of which 1 ms to minimize.
[2023-03-20 20:26:44] [INFO ] Deduced a trap composed of 11 places in 81 ms of which 1 ms to minimize.
[2023-03-20 20:26:45] [INFO ] Deduced a trap composed of 12 places in 51 ms of which 0 ms to minimize.
[2023-03-20 20:26:45] [INFO ] Deduced a trap composed of 11 places in 55 ms of which 0 ms to minimize.
[2023-03-20 20:26:45] [INFO ] Deduced a trap composed of 11 places in 56 ms of which 0 ms to minimize.
[2023-03-20 20:26:45] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 1995 ms
[2023-03-20 20:26:45] [INFO ] After 6963ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 709 ms.
[2023-03-20 20:26:46] [INFO ] After 7909ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 80 ms.
Support contains 123 out of 702 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 702/702 places, 952/952 transitions.
Applied a total of 0 rules in 41 ms. Remains 702 /702 variables (removed 0) and now considering 952/952 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 41 ms. Remains : 702/702 places, 952/952 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 702/702 places, 952/952 transitions.
Applied a total of 0 rules in 30 ms. Remains 702 /702 variables (removed 0) and now considering 952/952 (removed 0) transitions.
[2023-03-20 20:26:46] [INFO ] Invariant cache hit.
[2023-03-20 20:26:46] [INFO ] Implicit Places using invariants in 358 ms returned []
[2023-03-20 20:26:46] [INFO ] Invariant cache hit.
[2023-03-20 20:26:47] [INFO ] Implicit Places using invariants and state equation in 951 ms returned []
Implicit Place search using SMT with State Equation took 1311 ms to find 0 implicit places.
[2023-03-20 20:26:47] [INFO ] Redundant transitions in 167 ms returned []
[2023-03-20 20:26:47] [INFO ] Invariant cache hit.
[2023-03-20 20:26:48] [INFO ] Dead Transitions using invariants and state equation in 485 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2004 ms. Remains : 702/702 places, 952/952 transitions.
Applied a total of 0 rules in 19 ms. Remains 702 /702 variables (removed 0) and now considering 952/952 (removed 0) transitions.
Running SMT prover for 2 properties.
[2023-03-20 20:26:48] [INFO ] Invariant cache hit.
[2023-03-20 20:26:48] [INFO ] After 107ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-20 20:26:48] [INFO ] [Nat]Absence check using 201 positive place invariants in 26 ms returned sat
[2023-03-20 20:26:49] [INFO ] After 668ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-20 20:26:49] [INFO ] Deduced a trap composed of 7 places in 165 ms of which 1 ms to minimize.
[2023-03-20 20:26:49] [INFO ] Deduced a trap composed of 7 places in 129 ms of which 0 ms to minimize.
[2023-03-20 20:26:50] [INFO ] Deduced a trap composed of 7 places in 143 ms of which 1 ms to minimize.
[2023-03-20 20:26:50] [INFO ] Deduced a trap composed of 11 places in 132 ms of which 1 ms to minimize.
[2023-03-20 20:26:50] [INFO ] Deduced a trap composed of 15 places in 120 ms of which 1 ms to minimize.
[2023-03-20 20:26:50] [INFO ] Deduced a trap composed of 7 places in 113 ms of which 0 ms to minimize.
[2023-03-20 20:26:50] [INFO ] Deduced a trap composed of 11 places in 138 ms of which 1 ms to minimize.
[2023-03-20 20:26:51] [INFO ] Deduced a trap composed of 11 places in 123 ms of which 0 ms to minimize.
[2023-03-20 20:26:51] [INFO ] Deduced a trap composed of 13 places in 131 ms of which 1 ms to minimize.
[2023-03-20 20:26:51] [INFO ] Deduced a trap composed of 12 places in 108 ms of which 1 ms to minimize.
[2023-03-20 20:26:51] [INFO ] Deduced a trap composed of 13 places in 116 ms of which 1 ms to minimize.
[2023-03-20 20:26:51] [INFO ] Deduced a trap composed of 11 places in 112 ms of which 1 ms to minimize.
[2023-03-20 20:26:51] [INFO ] Deduced a trap composed of 11 places in 107 ms of which 1 ms to minimize.
[2023-03-20 20:26:52] [INFO ] Deduced a trap composed of 18 places in 129 ms of which 0 ms to minimize.
[2023-03-20 20:26:52] [INFO ] Deduced a trap composed of 19 places in 118 ms of which 0 ms to minimize.
[2023-03-20 20:26:52] [INFO ] Deduced a trap composed of 16 places in 119 ms of which 1 ms to minimize.
[2023-03-20 20:26:52] [INFO ] Deduced a trap composed of 17 places in 123 ms of which 1 ms to minimize.
[2023-03-20 20:26:52] [INFO ] Deduced a trap composed of 15 places in 119 ms of which 0 ms to minimize.
[2023-03-20 20:26:53] [INFO ] Deduced a trap composed of 23 places in 131 ms of which 0 ms to minimize.
[2023-03-20 20:26:53] [INFO ] Deduced a trap composed of 7 places in 108 ms of which 0 ms to minimize.
[2023-03-20 20:26:53] [INFO ] Deduced a trap composed of 12 places in 107 ms of which 0 ms to minimize.
[2023-03-20 20:26:53] [INFO ] Deduced a trap composed of 12 places in 106 ms of which 1 ms to minimize.
[2023-03-20 20:26:53] [INFO ] Deduced a trap composed of 11 places in 123 ms of which 1 ms to minimize.
[2023-03-20 20:26:53] [INFO ] Deduced a trap composed of 12 places in 116 ms of which 0 ms to minimize.
[2023-03-20 20:26:54] [INFO ] Deduced a trap composed of 11 places in 112 ms of which 0 ms to minimize.
[2023-03-20 20:26:54] [INFO ] Deduced a trap composed of 6 places in 153 ms of which 1 ms to minimize.
[2023-03-20 20:26:54] [INFO ] Deduced a trap composed of 14 places in 133 ms of which 1 ms to minimize.
[2023-03-20 20:26:54] [INFO ] Deduced a trap composed of 16 places in 143 ms of which 0 ms to minimize.
[2023-03-20 20:26:54] [INFO ] Deduced a trap composed of 7 places in 144 ms of which 1 ms to minimize.
[2023-03-20 20:26:55] [INFO ] Deduced a trap composed of 7 places in 147 ms of which 1 ms to minimize.
[2023-03-20 20:26:55] [INFO ] Deduced a trap composed of 15 places in 140 ms of which 1 ms to minimize.
[2023-03-20 20:26:55] [INFO ] Deduced a trap composed of 23 places in 145 ms of which 0 ms to minimize.
[2023-03-20 20:26:55] [INFO ] Deduced a trap composed of 15 places in 127 ms of which 0 ms to minimize.
[2023-03-20 20:26:55] [INFO ] Deduced a trap composed of 11 places in 120 ms of which 0 ms to minimize.
[2023-03-20 20:26:56] [INFO ] Deduced a trap composed of 21 places in 136 ms of which 1 ms to minimize.
[2023-03-20 20:26:56] [INFO ] Deduced a trap composed of 23 places in 139 ms of which 1 ms to minimize.
[2023-03-20 20:26:56] [INFO ] Deduced a trap composed of 21 places in 113 ms of which 0 ms to minimize.
[2023-03-20 20:26:56] [INFO ] Deduced a trap composed of 21 places in 136 ms of which 1 ms to minimize.
[2023-03-20 20:26:56] [INFO ] Deduced a trap composed of 19 places in 146 ms of which 0 ms to minimize.
[2023-03-20 20:26:57] [INFO ] Deduced a trap composed of 19 places in 141 ms of which 1 ms to minimize.
[2023-03-20 20:26:57] [INFO ] Deduced a trap composed of 19 places in 107 ms of which 0 ms to minimize.
[2023-03-20 20:26:57] [INFO ] Deduced a trap composed of 19 places in 138 ms of which 0 ms to minimize.
[2023-03-20 20:26:57] [INFO ] Deduced a trap composed of 7 places in 138 ms of which 0 ms to minimize.
[2023-03-20 20:26:57] [INFO ] Deduced a trap composed of 17 places in 116 ms of which 0 ms to minimize.
[2023-03-20 20:26:58] [INFO ] Deduced a trap composed of 17 places in 122 ms of which 1 ms to minimize.
[2023-03-20 20:26:58] [INFO ] Deduced a trap composed of 16 places in 111 ms of which 0 ms to minimize.
[2023-03-20 20:26:58] [INFO ] Deduced a trap composed of 16 places in 131 ms of which 0 ms to minimize.
[2023-03-20 20:26:58] [INFO ] Deduced a trap composed of 16 places in 121 ms of which 1 ms to minimize.
[2023-03-20 20:26:58] [INFO ] Deduced a trap composed of 15 places in 146 ms of which 1 ms to minimize.
[2023-03-20 20:26:59] [INFO ] Deduced a trap composed of 19 places in 131 ms of which 1 ms to minimize.
[2023-03-20 20:26:59] [INFO ] Deduced a trap composed of 19 places in 126 ms of which 1 ms to minimize.
[2023-03-20 20:26:59] [INFO ] Deduced a trap composed of 10 places in 152 ms of which 0 ms to minimize.
[2023-03-20 20:26:59] [INFO ] Deduced a trap composed of 12 places in 152 ms of which 0 ms to minimize.
[2023-03-20 20:26:59] [INFO ] Deduced a trap composed of 11 places in 131 ms of which 0 ms to minimize.
[2023-03-20 20:27:00] [INFO ] Deduced a trap composed of 12 places in 149 ms of which 1 ms to minimize.
[2023-03-20 20:27:00] [INFO ] Deduced a trap composed of 13 places in 146 ms of which 1 ms to minimize.
[2023-03-20 20:27:00] [INFO ] Deduced a trap composed of 11 places in 133 ms of which 1 ms to minimize.
[2023-03-20 20:27:00] [INFO ] Deduced a trap composed of 16 places in 134 ms of which 1 ms to minimize.
[2023-03-20 20:27:00] [INFO ] Deduced a trap composed of 16 places in 142 ms of which 0 ms to minimize.
[2023-03-20 20:27:01] [INFO ] Deduced a trap composed of 17 places in 128 ms of which 0 ms to minimize.
[2023-03-20 20:27:01] [INFO ] Deduced a trap composed of 16 places in 137 ms of which 0 ms to minimize.
[2023-03-20 20:27:01] [INFO ] Deduced a trap composed of 15 places in 135 ms of which 0 ms to minimize.
[2023-03-20 20:27:01] [INFO ] Deduced a trap composed of 15 places in 140 ms of which 0 ms to minimize.
[2023-03-20 20:27:01] [INFO ] Deduced a trap composed of 16 places in 129 ms of which 0 ms to minimize.
[2023-03-20 20:27:02] [INFO ] Deduced a trap composed of 15 places in 136 ms of which 0 ms to minimize.
[2023-03-20 20:27:02] [INFO ] Deduced a trap composed of 16 places in 155 ms of which 0 ms to minimize.
[2023-03-20 20:27:02] [INFO ] Deduced a trap composed of 15 places in 138 ms of which 0 ms to minimize.
[2023-03-20 20:27:02] [INFO ] Deduced a trap composed of 20 places in 130 ms of which 0 ms to minimize.
[2023-03-20 20:27:03] [INFO ] Deduced a trap composed of 24 places in 128 ms of which 0 ms to minimize.
[2023-03-20 20:27:03] [INFO ] Deduced a trap composed of 19 places in 139 ms of which 1 ms to minimize.
[2023-03-20 20:27:03] [INFO ] Deduced a trap composed of 25 places in 140 ms of which 0 ms to minimize.
[2023-03-20 20:27:03] [INFO ] Deduced a trap composed of 20 places in 133 ms of which 1 ms to minimize.
[2023-03-20 20:27:03] [INFO ] Deduced a trap composed of 19 places in 128 ms of which 1 ms to minimize.
[2023-03-20 20:27:04] [INFO ] Deduced a trap composed of 21 places in 125 ms of which 1 ms to minimize.
[2023-03-20 20:27:04] [INFO ] Deduced a trap composed of 20 places in 132 ms of which 0 ms to minimize.
[2023-03-20 20:27:04] [INFO ] Deduced a trap composed of 7 places in 143 ms of which 2 ms to minimize.
[2023-03-20 20:27:04] [INFO ] Deduced a trap composed of 21 places in 131 ms of which 1 ms to minimize.
[2023-03-20 20:27:04] [INFO ] Deduced a trap composed of 20 places in 137 ms of which 1 ms to minimize.
[2023-03-20 20:27:05] [INFO ] Deduced a trap composed of 20 places in 148 ms of which 0 ms to minimize.
[2023-03-20 20:27:05] [INFO ] Deduced a trap composed of 24 places in 136 ms of which 1 ms to minimize.
[2023-03-20 20:27:05] [INFO ] Deduced a trap composed of 19 places in 145 ms of which 0 ms to minimize.
[2023-03-20 20:27:05] [INFO ] Deduced a trap composed of 24 places in 127 ms of which 1 ms to minimize.
[2023-03-20 20:27:05] [INFO ] Deduced a trap composed of 19 places in 135 ms of which 0 ms to minimize.
[2023-03-20 20:27:06] [INFO ] Deduced a trap composed of 21 places in 122 ms of which 1 ms to minimize.
[2023-03-20 20:27:06] [INFO ] Deduced a trap composed of 25 places in 143 ms of which 2 ms to minimize.
[2023-03-20 20:27:06] [INFO ] Deduced a trap composed of 20 places in 129 ms of which 1 ms to minimize.
[2023-03-20 20:27:06] [INFO ] Deduced a trap composed of 20 places in 142 ms of which 0 ms to minimize.
[2023-03-20 20:27:06] [INFO ] Deduced a trap composed of 24 places in 143 ms of which 0 ms to minimize.
[2023-03-20 20:27:07] [INFO ] Deduced a trap composed of 19 places in 135 ms of which 1 ms to minimize.
[2023-03-20 20:27:07] [INFO ] Deduced a trap composed of 11 places in 152 ms of which 1 ms to minimize.
[2023-03-20 20:27:07] [INFO ] Deduced a trap composed of 7 places in 135 ms of which 1 ms to minimize.
[2023-03-20 20:27:07] [INFO ] Deduced a trap composed of 7 places in 147 ms of which 0 ms to minimize.
[2023-03-20 20:27:08] [INFO ] Deduced a trap composed of 11 places in 143 ms of which 1 ms to minimize.
[2023-03-20 20:27:08] [INFO ] Deduced a trap composed of 7 places in 135 ms of which 0 ms to minimize.
[2023-03-20 20:27:08] [INFO ] Deduced a trap composed of 7 places in 134 ms of which 0 ms to minimize.
[2023-03-20 20:27:08] [INFO ] Deduced a trap composed of 7 places in 138 ms of which 1 ms to minimize.
[2023-03-20 20:27:08] [INFO ] Deduced a trap composed of 12 places in 134 ms of which 0 ms to minimize.
[2023-03-20 20:27:09] [INFO ] Deduced a trap composed of 25 places in 127 ms of which 0 ms to minimize.
[2023-03-20 20:27:09] [INFO ] Deduced a trap composed of 25 places in 127 ms of which 1 ms to minimize.
[2023-03-20 20:27:09] [INFO ] Deduced a trap composed of 7 places in 125 ms of which 1 ms to minimize.
[2023-03-20 20:27:09] [INFO ] Deduced a trap composed of 11 places in 132 ms of which 0 ms to minimize.
[2023-03-20 20:27:09] [INFO ] Deduced a trap composed of 25 places in 120 ms of which 0 ms to minimize.
[2023-03-20 20:27:10] [INFO ] Deduced a trap composed of 7 places in 155 ms of which 0 ms to minimize.
[2023-03-20 20:27:10] [INFO ] Deduced a trap composed of 13 places in 156 ms of which 0 ms to minimize.
[2023-03-20 20:27:10] [INFO ] Deduced a trap composed of 11 places in 150 ms of which 0 ms to minimize.
[2023-03-20 20:27:10] [INFO ] Deduced a trap composed of 11 places in 142 ms of which 0 ms to minimize.
[2023-03-20 20:27:11] [INFO ] Deduced a trap composed of 9 places in 152 ms of which 1 ms to minimize.
[2023-03-20 20:27:11] [INFO ] Deduced a trap composed of 12 places in 144 ms of which 0 ms to minimize.
[2023-03-20 20:27:11] [INFO ] Deduced a trap composed of 17 places in 151 ms of which 1 ms to minimize.
[2023-03-20 20:27:11] [INFO ] Deduced a trap composed of 15 places in 143 ms of which 0 ms to minimize.
[2023-03-20 20:27:11] [INFO ] Deduced a trap composed of 7 places in 103 ms of which 0 ms to minimize.
[2023-03-20 20:27:12] [INFO ] Deduced a trap composed of 28 places in 120 ms of which 0 ms to minimize.
[2023-03-20 20:27:12] [INFO ] Deduced a trap composed of 7 places in 120 ms of which 0 ms to minimize.
[2023-03-20 20:27:12] [INFO ] Deduced a trap composed of 16 places in 134 ms of which 1 ms to minimize.
[2023-03-20 20:27:12] [INFO ] Deduced a trap composed of 21 places in 124 ms of which 0 ms to minimize.
[2023-03-20 20:27:12] [INFO ] Deduced a trap composed of 20 places in 116 ms of which 1 ms to minimize.
[2023-03-20 20:27:13] [INFO ] Deduced a trap composed of 12 places in 146 ms of which 0 ms to minimize.
[2023-03-20 20:27:13] [INFO ] Deduced a trap composed of 12 places in 146 ms of which 0 ms to minimize.
[2023-03-20 20:27:13] [INFO ] Deduced a trap composed of 7 places in 114 ms of which 0 ms to minimize.
[2023-03-20 20:27:13] [INFO ] Deduced a trap composed of 7 places in 94 ms of which 1 ms to minimize.
[2023-03-20 20:27:14] [INFO ] Deduced a trap composed of 11 places in 80 ms of which 1 ms to minimize.
[2023-03-20 20:27:14] [INFO ] Deduced a trap composed of 24 places in 65 ms of which 1 ms to minimize.
[2023-03-20 20:27:14] [INFO ] Deduced a trap composed of 24 places in 65 ms of which 1 ms to minimize.
[2023-03-20 20:27:14] [INFO ] Deduced a trap composed of 24 places in 64 ms of which 0 ms to minimize.
[2023-03-20 20:27:14] [INFO ] Deduced a trap composed of 24 places in 60 ms of which 0 ms to minimize.
[2023-03-20 20:27:14] [INFO ] Deduced a trap composed of 25 places in 66 ms of which 1 ms to minimize.
[2023-03-20 20:27:14] [INFO ] Deduced a trap composed of 28 places in 65 ms of which 0 ms to minimize.
[2023-03-20 20:27:15] [INFO ] Deduced a trap composed of 23 places in 56 ms of which 0 ms to minimize.
[2023-03-20 20:27:15] [INFO ] Deduced a trap composed of 23 places in 60 ms of which 1 ms to minimize.
[2023-03-20 20:27:15] [INFO ] Deduced a trap composed of 25 places in 57 ms of which 0 ms to minimize.
[2023-03-20 20:27:15] [INFO ] Deduced a trap composed of 28 places in 56 ms of which 0 ms to minimize.
[2023-03-20 20:27:15] [INFO ] Deduced a trap composed of 23 places in 63 ms of which 0 ms to minimize.
[2023-03-20 20:27:15] [INFO ] Deduced a trap composed of 23 places in 56 ms of which 0 ms to minimize.
[2023-03-20 20:27:15] [INFO ] Deduced a trap composed of 24 places in 67 ms of which 0 ms to minimize.
[2023-03-20 20:27:15] [INFO ] Deduced a trap composed of 29 places in 66 ms of which 0 ms to minimize.
[2023-03-20 20:27:16] [INFO ] Deduced a trap composed of 24 places in 58 ms of which 1 ms to minimize.
[2023-03-20 20:27:16] [INFO ] Deduced a trap composed of 24 places in 56 ms of which 0 ms to minimize.
[2023-03-20 20:27:16] [INFO ] Deduced a trap composed of 25 places in 55 ms of which 1 ms to minimize.
[2023-03-20 20:27:16] [INFO ] Deduced a trap composed of 28 places in 56 ms of which 1 ms to minimize.
[2023-03-20 20:27:16] [INFO ] Deduced a trap composed of 25 places in 61 ms of which 0 ms to minimize.
[2023-03-20 20:27:16] [INFO ] Deduced a trap composed of 28 places in 63 ms of which 1 ms to minimize.
[2023-03-20 20:27:16] [INFO ] Deduced a trap composed of 23 places in 60 ms of which 0 ms to minimize.
[2023-03-20 20:27:17] [INFO ] Deduced a trap composed of 23 places in 64 ms of which 0 ms to minimize.
[2023-03-20 20:27:17] [INFO ] Deduced a trap composed of 23 places in 57 ms of which 0 ms to minimize.
[2023-03-20 20:27:17] [INFO ] Deduced a trap composed of 23 places in 64 ms of which 1 ms to minimize.
[2023-03-20 20:27:17] [INFO ] Deduced a trap composed of 7 places in 98 ms of which 1 ms to minimize.
[2023-03-20 20:27:17] [INFO ] Deduced a trap composed of 7 places in 84 ms of which 1 ms to minimize.
[2023-03-20 20:27:17] [INFO ] Deduced a trap composed of 11 places in 76 ms of which 0 ms to minimize.
[2023-03-20 20:27:18] [INFO ] Deduced a trap composed of 7 places in 80 ms of which 0 ms to minimize.
[2023-03-20 20:27:18] [INFO ] Deduced a trap composed of 28 places in 65 ms of which 0 ms to minimize.
[2023-03-20 20:27:18] [INFO ] Deduced a trap composed of 28 places in 56 ms of which 0 ms to minimize.
[2023-03-20 20:27:18] [INFO ] Deduced a trap composed of 28 places in 55 ms of which 0 ms to minimize.
[2023-03-20 20:27:18] [INFO ] Deduced a trap composed of 28 places in 61 ms of which 1 ms to minimize.
[2023-03-20 20:27:18] [INFO ] Deduced a trap composed of 28 places in 62 ms of which 1 ms to minimize.
[2023-03-20 20:27:19] [INFO ] Deduced a trap composed of 28 places in 55 ms of which 0 ms to minimize.
[2023-03-20 20:27:19] [INFO ] Deduced a trap composed of 28 places in 64 ms of which 0 ms to minimize.
[2023-03-20 20:27:19] [INFO ] Deduced a trap composed of 28 places in 62 ms of which 0 ms to minimize.
[2023-03-20 20:27:19] [INFO ] Deduced a trap composed of 28 places in 62 ms of which 0 ms to minimize.
[2023-03-20 20:27:19] [INFO ] Deduced a trap composed of 28 places in 61 ms of which 0 ms to minimize.
[2023-03-20 20:27:19] [INFO ] Deduced a trap composed of 28 places in 59 ms of which 0 ms to minimize.
[2023-03-20 20:27:19] [INFO ] Trap strengthening procedure interrupted after too many repetitions 30381 ms
[2023-03-20 20:27:19] [INFO ] Trap strengthening (SAT) tested/added 160/159 trap constraints in 30382 ms
[2023-03-20 20:27:20] [INFO ] Deduced a trap composed of 7 places in 139 ms of which 1 ms to minimize.
[2023-03-20 20:27:20] [INFO ] Deduced a trap composed of 7 places in 132 ms of which 0 ms to minimize.
[2023-03-20 20:27:20] [INFO ] Deduced a trap composed of 7 places in 120 ms of which 0 ms to minimize.
[2023-03-20 20:27:21] [INFO ] Deduced a trap composed of 11 places in 117 ms of which 1 ms to minimize.
[2023-03-20 20:27:21] [INFO ] Deduced a trap composed of 7 places in 111 ms of which 0 ms to minimize.
[2023-03-20 20:27:21] [INFO ] Deduced a trap composed of 11 places in 79 ms of which 1 ms to minimize.
[2023-03-20 20:27:21] [INFO ] Deduced a trap composed of 7 places in 73 ms of which 0 ms to minimize.
[2023-03-20 20:27:21] [INFO ] Deduced a trap composed of 11 places in 79 ms of which 0 ms to minimize.
[2023-03-20 20:27:21] [INFO ] Deduced a trap composed of 11 places in 74 ms of which 0 ms to minimize.
[2023-03-20 20:27:22] [INFO ] Deduced a trap composed of 7 places in 80 ms of which 1 ms to minimize.
[2023-03-20 20:27:22] [INFO ] Deduced a trap composed of 7 places in 67 ms of which 1 ms to minimize.
[2023-03-20 20:27:22] [INFO ] Deduced a trap composed of 11 places in 38 ms of which 0 ms to minimize.
[2023-03-20 20:27:22] [INFO ] Deduced a trap composed of 7 places in 38 ms of which 1 ms to minimize.
[2023-03-20 20:27:22] [INFO ] Deduced a trap composed of 11 places in 47 ms of which 0 ms to minimize.
[2023-03-20 20:27:22] [INFO ] Trap strengthening (SAT) tested/added 15/14 trap constraints in 2451 ms
[2023-03-20 20:27:22] [INFO ] After 34179ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 840 ms.
[2023-03-20 20:27:23] [INFO ] After 35208ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
[2023-03-20 20:27:23] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 8 ms.
[2023-03-20 20:27:23] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 702 places, 952 transitions and 4768 arcs took 7 ms.
[2023-03-20 20:27:23] [INFO ] Flatten gal took : 117 ms
Total runtime 78900 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: ShieldRVs_PT_050A
(NrP: 702 NrTr: 952 NrArc: 4768)

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

net check time: 0m 0.000sec

init dd package: 0m 2.970sec


before gc: list nodes free: 1039747

after gc: idd nodes used:12342, unused:63987658; list nodes free:283054899

before gc: list nodes free: 660136

after gc: idd nodes used:13370, unused:63986630; list nodes free:283049895

before gc: list nodes free: 298133

after gc: idd nodes used:14065, unused:63985935; list nodes free:283046639

before gc: list nodes free: 316803

after gc: idd nodes used:14500, unused:63985500; list nodes free:283044723

before gc: list nodes free: 341978

after gc: idd nodes used:15513, unused:63984487; list nodes free:283040152

before gc: list nodes free: 321410

after gc: idd nodes used:15777, unused:63984223; list nodes free:283039034

before gc: list nodes free: 415167

after gc: idd nodes used:15789, unused:63984211; list nodes free:283039144

before gc: list nodes free: 1768026

after gc: idd nodes used:18171, unused:63981829; list nodes free:285124319

before gc: list nodes free: 1887230

after gc: idd nodes used:18111, unused:63981889; list nodes free:285124892

before gc: list nodes free: 2480169

after gc: idd nodes used:19122, unused:63980878; list nodes free:285120248

before gc: list nodes free: 1831342

after gc: idd nodes used:18878, unused:63981122; list nodes free:285121352

before gc: list nodes free: 2031933

after gc: idd nodes used:18813, unused:63981187; list nodes free:285121820

before gc: list nodes free: 2035798

after gc: idd nodes used:19435, unused:63980565; list nodes free:285118868

before gc: list nodes free: 2021793

after gc: idd nodes used:19774, unused:63980226; list nodes free:285117307

before gc: list nodes free: 2125146

after gc: idd nodes used:19648, unused:63980352; list nodes free:285118350

before gc: list nodes free: 1843048

after gc: idd nodes used:19772, unused:63980228; list nodes free:285117009

before gc: list nodes free: 1960991

after gc: idd nodes used:19585, unused:63980415; list nodes free:285118025

before gc: list nodes free: 2605397

after gc: idd nodes used:19334, unused:63980666; list nodes free:285119689
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393340 kB
MemFree: 6258992 kB
After kill :
MemTotal: 16393340 kB
MemFree: 16098080 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.004sec

6092 7637 8377 8921 9083 10153 9674 10142 10822 12116 12280 12633 12665 12717 12771 12857 12872 12566 13365 13134 12642 12995 13306 13232 13255 14178 14364 14746 14421 14111 14045 14053 13907 14202 13579 13725 14035 14013 14000 14003 13887 14006 14530 14388 14443 14720 15515 15442 15884 14955 14669 15663 15904 15601 15591 15512 15656 15316 15552 15619 15501 15745 15424 15527 15575 16190 16085 15899 15662 15559 15743 16017 15686 15960 15849 15668 15705 15731 15786 16208 15522 16088 16635 16827 17387 16929 17394 17197 17846 17828 18334 18428 18917 17944 17928 18338 17875 18136 18131 18927 18823 18616 18386 18808 18204 18763 18775 18641 18739 18876 18860 18599 18763 18880 19491 19907 19366 19420 19615 19494 20198 19957 19224 18530 18854 18694 18929 18550 18717 18693 18748 18704 18620 19075 18675 18652 18589 18797 19959 19796 19422 18884 19046 19434 19120 19408 19637 19498 19554 19170 19258 18989 19006 19061 19117 19130 19214 19473 19201 19250 19225 19279 19219 19429 19202 19533 19100 19078 19083 19365 19408 19724 19115 18930 18786 19275 19150 18841 18971 18959 19374 19734 19753 19879 19949 19291 19070 19535 19096 19520 19044 20010 19741 19565 19086 20083 19800 19664 19804 19779 18877 19680 19482 19170 19379 19109 19901 19824 19417 19234

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="ShieldRVs-PT-050A"
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 ShieldRVs-PT-050A, 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 r426-tajo-167905978500151"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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