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.r170-tall-167838856700086.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 Echo-PT-d03r03, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r170-tall-167838856700086
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 528K
-rw-r--r-- 1 mcc users 7.4K Feb 25 14:04 CTLCardinality.txt
-rw-r--r-- 1 mcc users 82K Feb 25 14:04 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.9K Feb 25 14:03 CTLFireability.txt
-rw-r--r-- 1 mcc users 60K Feb 25 14:03 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 5.9K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.3K Feb 25 16:03 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Feb 25 16:03 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Feb 25 16:03 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 16:03 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.3K Feb 25 14:05 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 85K Feb 25 14:05 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.7K Feb 25 14:04 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 55K Feb 25 14:04 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 16:03 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Feb 25 16:03 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 7 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 114K 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 Echo-PT-d03r03-ReachabilityCardinality-00
FORMULA_NAME Echo-PT-d03r03-ReachabilityCardinality-01
FORMULA_NAME Echo-PT-d03r03-ReachabilityCardinality-02
FORMULA_NAME Echo-PT-d03r03-ReachabilityCardinality-03
FORMULA_NAME Echo-PT-d03r03-ReachabilityCardinality-04
FORMULA_NAME Echo-PT-d03r03-ReachabilityCardinality-05
FORMULA_NAME Echo-PT-d03r03-ReachabilityCardinality-06
FORMULA_NAME Echo-PT-d03r03-ReachabilityCardinality-07
FORMULA_NAME Echo-PT-d03r03-ReachabilityCardinality-08
FORMULA_NAME Echo-PT-d03r03-ReachabilityCardinality-09
FORMULA_NAME Echo-PT-d03r03-ReachabilityCardinality-10
FORMULA_NAME Echo-PT-d03r03-ReachabilityCardinality-11
FORMULA_NAME Echo-PT-d03r03-ReachabilityCardinality-12
FORMULA_NAME Echo-PT-d03r03-ReachabilityCardinality-13
FORMULA_NAME Echo-PT-d03r03-ReachabilityCardinality-14
FORMULA_NAME Echo-PT-d03r03-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1678475840977

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=marciexred
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Echo-PT-d03r03
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-10 19:17:22] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-10 19:17:22] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-10 19:17:22] [INFO ] Load time of PNML (sax parser for PT used): 62 ms
[2023-03-10 19:17:22] [INFO ] Transformed 265 places.
[2023-03-10 19:17:22] [INFO ] Transformed 206 transitions.
[2023-03-10 19:17:22] [INFO ] Found NUPN structural information;
[2023-03-10 19:17:22] [INFO ] Parsed PT model containing 265 places and 206 transitions and 1252 arcs in 130 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 11 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA Echo-PT-d03r03-ReachabilityCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Echo-PT-d03r03-ReachabilityCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Echo-PT-d03r03-ReachabilityCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Echo-PT-d03r03-ReachabilityCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Echo-PT-d03r03-ReachabilityCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Echo-PT-d03r03-ReachabilityCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Echo-PT-d03r03-ReachabilityCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 181 resets, run finished after 219 ms. (steps per millisecond=45 ) properties (out of 9) seen :8
FORMULA Echo-PT-d03r03-ReachabilityCardinality-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Echo-PT-d03r03-ReachabilityCardinality-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Echo-PT-d03r03-ReachabilityCardinality-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Echo-PT-d03r03-ReachabilityCardinality-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Echo-PT-d03r03-ReachabilityCardinality-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Echo-PT-d03r03-ReachabilityCardinality-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Echo-PT-d03r03-ReachabilityCardinality-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Echo-PT-d03r03-ReachabilityCardinality-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 206 rows 265 cols
[2023-03-10 19:17:23] [INFO ] Computed 135 place invariants in 24 ms
[2023-03-10 19:17:23] [INFO ] After 215ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-10 19:17:23] [INFO ] [Nat]Absence check using 24 positive place invariants in 7 ms returned sat
[2023-03-10 19:17:23] [INFO ] [Nat]Absence check using 24 positive and 111 generalized place invariants in 26 ms returned sat
[2023-03-10 19:17:23] [INFO ] After 88ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-10 19:17:23] [INFO ] Deduced a trap composed of 11 places in 68 ms of which 5 ms to minimize.
[2023-03-10 19:17:23] [INFO ] Deduced a trap composed of 27 places in 64 ms of which 1 ms to minimize.
[2023-03-10 19:17:23] [INFO ] Deduced a trap composed of 31 places in 58 ms of which 1 ms to minimize.
[2023-03-10 19:17:23] [INFO ] Deduced a trap composed of 13 places in 51 ms of which 1 ms to minimize.
[2023-03-10 19:17:23] [INFO ] Deduced a trap composed of 10 places in 59 ms of which 1 ms to minimize.
[2023-03-10 19:17:23] [INFO ] Deduced a trap composed of 14 places in 48 ms of which 1 ms to minimize.
[2023-03-10 19:17:23] [INFO ] Deduced a trap composed of 20 places in 50 ms of which 0 ms to minimize.
[2023-03-10 19:17:24] [INFO ] Deduced a trap composed of 15 places in 54 ms of which 0 ms to minimize.
[2023-03-10 19:17:24] [INFO ] Deduced a trap composed of 17 places in 54 ms of which 0 ms to minimize.
[2023-03-10 19:17:24] [INFO ] Deduced a trap composed of 12 places in 64 ms of which 0 ms to minimize.
[2023-03-10 19:17:24] [INFO ] Deduced a trap composed of 10 places in 49 ms of which 0 ms to minimize.
[2023-03-10 19:17:24] [INFO ] Deduced a trap composed of 10 places in 49 ms of which 0 ms to minimize.
[2023-03-10 19:17:24] [INFO ] Deduced a trap composed of 10 places in 51 ms of which 0 ms to minimize.
[2023-03-10 19:17:24] [INFO ] Deduced a trap composed of 19 places in 71 ms of which 1 ms to minimize.
[2023-03-10 19:17:24] [INFO ] Deduced a trap composed of 24 places in 59 ms of which 1 ms to minimize.
[2023-03-10 19:17:24] [INFO ] Deduced a trap composed of 15 places in 58 ms of which 0 ms to minimize.
[2023-03-10 19:17:24] [INFO ] Deduced a trap composed of 26 places in 66 ms of which 1 ms to minimize.
[2023-03-10 19:17:24] [INFO ] Deduced a trap composed of 18 places in 55 ms of which 1 ms to minimize.
[2023-03-10 19:17:24] [INFO ] Deduced a trap composed of 27 places in 58 ms of which 1 ms to minimize.
[2023-03-10 19:17:24] [INFO ] Deduced a trap composed of 26 places in 66 ms of which 0 ms to minimize.
[2023-03-10 19:17:24] [INFO ] Deduced a trap composed of 31 places in 66 ms of which 0 ms to minimize.
[2023-03-10 19:17:25] [INFO ] Deduced a trap composed of 29 places in 57 ms of which 0 ms to minimize.
[2023-03-10 19:17:25] [INFO ] Deduced a trap composed of 10 places in 53 ms of which 0 ms to minimize.
[2023-03-10 19:17:25] [INFO ] Deduced a trap composed of 31 places in 60 ms of which 0 ms to minimize.
[2023-03-10 19:17:25] [INFO ] Deduced a trap composed of 26 places in 60 ms of which 0 ms to minimize.
[2023-03-10 19:17:25] [INFO ] Deduced a trap composed of 26 places in 59 ms of which 0 ms to minimize.
[2023-03-10 19:17:25] [INFO ] Deduced a trap composed of 11 places in 59 ms of which 0 ms to minimize.
[2023-03-10 19:17:25] [INFO ] Deduced a trap composed of 30 places in 59 ms of which 0 ms to minimize.
[2023-03-10 19:17:25] [INFO ] Deduced a trap composed of 10 places in 54 ms of which 0 ms to minimize.
[2023-03-10 19:17:25] [INFO ] Deduced a trap composed of 28 places in 56 ms of which 0 ms to minimize.
[2023-03-10 19:17:25] [INFO ] Deduced a trap composed of 20 places in 44 ms of which 0 ms to minimize.
[2023-03-10 19:17:25] [INFO ] Deduced a trap composed of 10 places in 49 ms of which 0 ms to minimize.
[2023-03-10 19:17:25] [INFO ] Deduced a trap composed of 31 places in 65 ms of which 1 ms to minimize.
[2023-03-10 19:17:25] [INFO ] Deduced a trap composed of 23 places in 56 ms of which 1 ms to minimize.
[2023-03-10 19:17:25] [INFO ] Deduced a trap composed of 24 places in 62 ms of which 4 ms to minimize.
[2023-03-10 19:17:26] [INFO ] Deduced a trap composed of 32 places in 66 ms of which 1 ms to minimize.
[2023-03-10 19:17:26] [INFO ] Deduced a trap composed of 38 places in 60 ms of which 1 ms to minimize.
[2023-03-10 19:17:26] [INFO ] Deduced a trap composed of 32 places in 62 ms of which 0 ms to minimize.
[2023-03-10 19:17:26] [INFO ] Deduced a trap composed of 11 places in 52 ms of which 0 ms to minimize.
[2023-03-10 19:17:26] [INFO ] Deduced a trap composed of 16 places in 52 ms of which 1 ms to minimize.
[2023-03-10 19:17:26] [INFO ] Deduced a trap composed of 10 places in 55 ms of which 0 ms to minimize.
[2023-03-10 19:17:26] [INFO ] Deduced a trap composed of 20 places in 55 ms of which 1 ms to minimize.
[2023-03-10 19:17:26] [INFO ] Deduced a trap composed of 23 places in 57 ms of which 0 ms to minimize.
[2023-03-10 19:17:26] [INFO ] Deduced a trap composed of 28 places in 49 ms of which 0 ms to minimize.
[2023-03-10 19:17:26] [INFO ] Deduced a trap composed of 10 places in 43 ms of which 0 ms to minimize.
[2023-03-10 19:17:26] [INFO ] Deduced a trap composed of 11 places in 48 ms of which 1 ms to minimize.
[2023-03-10 19:17:26] [INFO ] Deduced a trap composed of 16 places in 48 ms of which 1 ms to minimize.
[2023-03-10 19:17:26] [INFO ] Deduced a trap composed of 29 places in 53 ms of which 0 ms to minimize.
[2023-03-10 19:17:26] [INFO ] Deduced a trap composed of 11 places in 50 ms of which 1 ms to minimize.
[2023-03-10 19:17:27] [INFO ] Deduced a trap composed of 10 places in 51 ms of which 0 ms to minimize.
[2023-03-10 19:17:27] [INFO ] Deduced a trap composed of 18 places in 55 ms of which 1 ms to minimize.
[2023-03-10 19:17:27] [INFO ] Deduced a trap composed of 12 places in 42 ms of which 0 ms to minimize.
[2023-03-10 19:17:27] [INFO ] Deduced a trap composed of 21 places in 52 ms of which 0 ms to minimize.
[2023-03-10 19:17:27] [INFO ] Deduced a trap composed of 33 places in 54 ms of which 1 ms to minimize.
[2023-03-10 19:17:27] [INFO ] Deduced a trap composed of 31 places in 52 ms of which 0 ms to minimize.
[2023-03-10 19:17:27] [INFO ] Deduced a trap composed of 10 places in 45 ms of which 0 ms to minimize.
[2023-03-10 19:17:27] [INFO ] Deduced a trap composed of 10 places in 53 ms of which 0 ms to minimize.
[2023-03-10 19:17:27] [INFO ] Deduced a trap composed of 26 places in 54 ms of which 1 ms to minimize.
[2023-03-10 19:17:27] [INFO ] Deduced a trap composed of 22 places in 59 ms of which 0 ms to minimize.
[2023-03-10 19:17:27] [INFO ] Deduced a trap composed of 24 places in 52 ms of which 1 ms to minimize.
[2023-03-10 19:17:27] [INFO ] Deduced a trap composed of 12 places in 50 ms of which 1 ms to minimize.
[2023-03-10 19:17:27] [INFO ] Deduced a trap composed of 15 places in 54 ms of which 1 ms to minimize.
[2023-03-10 19:17:27] [INFO ] Deduced a trap composed of 25 places in 54 ms of which 0 ms to minimize.
[2023-03-10 19:17:28] [INFO ] Deduced a trap composed of 27 places in 62 ms of which 1 ms to minimize.
[2023-03-10 19:17:28] [INFO ] Deduced a trap composed of 10 places in 45 ms of which 0 ms to minimize.
[2023-03-10 19:17:28] [INFO ] Deduced a trap composed of 10 places in 54 ms of which 0 ms to minimize.
[2023-03-10 19:17:28] [INFO ] Deduced a trap composed of 14 places in 57 ms of which 0 ms to minimize.
[2023-03-10 19:17:28] [INFO ] Deduced a trap composed of 12 places in 57 ms of which 1 ms to minimize.
[2023-03-10 19:17:28] [INFO ] Deduced a trap composed of 18 places in 59 ms of which 0 ms to minimize.
[2023-03-10 19:17:28] [INFO ] Deduced a trap composed of 11 places in 52 ms of which 1 ms to minimize.
[2023-03-10 19:17:28] [INFO ] Deduced a trap composed of 18 places in 56 ms of which 1 ms to minimize.
[2023-03-10 19:17:28] [INFO ] Deduced a trap composed of 13 places in 53 ms of which 0 ms to minimize.
[2023-03-10 19:17:28] [INFO ] Deduced a trap composed of 28 places in 57 ms of which 1 ms to minimize.
[2023-03-10 19:17:28] [INFO ] Deduced a trap composed of 29 places in 60 ms of which 0 ms to minimize.
[2023-03-10 19:17:28] [INFO ] Deduced a trap composed of 14 places in 53 ms of which 0 ms to minimize.
[2023-03-10 19:17:29] [INFO ] Deduced a trap composed of 15 places in 53 ms of which 0 ms to minimize.
[2023-03-10 19:17:29] [INFO ] Deduced a trap composed of 15 places in 49 ms of which 0 ms to minimize.
[2023-03-10 19:17:29] [INFO ] Deduced a trap composed of 23 places in 46 ms of which 1 ms to minimize.
[2023-03-10 19:17:29] [INFO ] Deduced a trap composed of 23 places in 49 ms of which 0 ms to minimize.
[2023-03-10 19:17:29] [INFO ] Deduced a trap composed of 12 places in 45 ms of which 0 ms to minimize.
[2023-03-10 19:17:29] [INFO ] Deduced a trap composed of 21 places in 48 ms of which 0 ms to minimize.
[2023-03-10 19:17:29] [INFO ] Deduced a trap composed of 16 places in 50 ms of which 0 ms to minimize.
[2023-03-10 19:17:29] [INFO ] Deduced a trap composed of 11 places in 43 ms of which 1 ms to minimize.
[2023-03-10 19:17:29] [INFO ] Deduced a trap composed of 19 places in 50 ms of which 0 ms to minimize.
[2023-03-10 19:17:29] [INFO ] Deduced a trap composed of 18 places in 44 ms of which 1 ms to minimize.
[2023-03-10 19:17:29] [INFO ] Deduced a trap composed of 22 places in 51 ms of which 1 ms to minimize.
[2023-03-10 19:17:29] [INFO ] Deduced a trap composed of 12 places in 55 ms of which 0 ms to minimize.
[2023-03-10 19:17:29] [INFO ] Deduced a trap composed of 12 places in 50 ms of which 0 ms to minimize.
[2023-03-10 19:17:29] [INFO ] Deduced a trap composed of 10 places in 42 ms of which 0 ms to minimize.
[2023-03-10 19:17:29] [INFO ] Deduced a trap composed of 18 places in 54 ms of which 0 ms to minimize.
[2023-03-10 19:17:29] [INFO ] Deduced a trap composed of 24 places in 46 ms of which 0 ms to minimize.
[2023-03-10 19:17:30] [INFO ] Deduced a trap composed of 19 places in 55 ms of which 0 ms to minimize.
[2023-03-10 19:17:30] [INFO ] Deduced a trap composed of 26 places in 50 ms of which 0 ms to minimize.
[2023-03-10 19:17:30] [INFO ] Deduced a trap composed of 25 places in 44 ms of which 1 ms to minimize.
[2023-03-10 19:17:30] [INFO ] Deduced a trap composed of 28 places in 44 ms of which 1 ms to minimize.
[2023-03-10 19:17:30] [INFO ] Deduced a trap composed of 28 places in 45 ms of which 0 ms to minimize.
[2023-03-10 19:17:30] [INFO ] Deduced a trap composed of 26 places in 51 ms of which 0 ms to minimize.
[2023-03-10 19:17:30] [INFO ] Deduced a trap composed of 10 places in 43 ms of which 0 ms to minimize.
[2023-03-10 19:17:30] [INFO ] Deduced a trap composed of 31 places in 47 ms of which 1 ms to minimize.
[2023-03-10 19:17:30] [INFO ] Deduced a trap composed of 28 places in 50 ms of which 0 ms to minimize.
[2023-03-10 19:17:30] [INFO ] Deduced a trap composed of 27 places in 52 ms of which 0 ms to minimize.
[2023-03-10 19:17:30] [INFO ] Deduced a trap composed of 18 places in 54 ms of which 1 ms to minimize.
[2023-03-10 19:17:30] [INFO ] Deduced a trap composed of 31 places in 54 ms of which 0 ms to minimize.
[2023-03-10 19:17:30] [INFO ] Deduced a trap composed of 26 places in 58 ms of which 0 ms to minimize.
[2023-03-10 19:17:30] [INFO ] Deduced a trap composed of 10 places in 44 ms of which 0 ms to minimize.
[2023-03-10 19:17:30] [INFO ] Deduced a trap composed of 22 places in 45 ms of which 0 ms to minimize.
[2023-03-10 19:17:31] [INFO ] Deduced a trap composed of 23 places in 45 ms of which 1 ms to minimize.
[2023-03-10 19:17:31] [INFO ] Deduced a trap composed of 13 places in 44 ms of which 0 ms to minimize.
[2023-03-10 19:17:31] [INFO ] Deduced a trap composed of 22 places in 51 ms of which 0 ms to minimize.
[2023-03-10 19:17:31] [INFO ] Deduced a trap composed of 20 places in 43 ms of which 0 ms to minimize.
[2023-03-10 19:17:31] [INFO ] Deduced a trap composed of 36 places in 54 ms of which 0 ms to minimize.
[2023-03-10 19:17:31] [INFO ] Deduced a trap composed of 10 places in 52 ms of which 0 ms to minimize.
[2023-03-10 19:17:31] [INFO ] Deduced a trap composed of 32 places in 56 ms of which 0 ms to minimize.
[2023-03-10 19:17:31] [INFO ] Deduced a trap composed of 14 places in 54 ms of which 0 ms to minimize.
[2023-03-10 19:17:31] [INFO ] Deduced a trap composed of 13 places in 52 ms of which 0 ms to minimize.
[2023-03-10 19:17:31] [INFO ] Deduced a trap composed of 11 places in 51 ms of which 0 ms to minimize.
[2023-03-10 19:17:31] [INFO ] Deduced a trap composed of 22 places in 53 ms of which 0 ms to minimize.
[2023-03-10 19:17:31] [INFO ] Deduced a trap composed of 31 places in 50 ms of which 0 ms to minimize.
[2023-03-10 19:17:31] [INFO ] Deduced a trap composed of 11 places in 52 ms of which 1 ms to minimize.
[2023-03-10 19:17:32] [INFO ] Deduced a trap composed of 18 places in 55 ms of which 0 ms to minimize.
[2023-03-10 19:17:32] [INFO ] Deduced a trap composed of 16 places in 67 ms of which 0 ms to minimize.
[2023-03-10 19:17:32] [INFO ] Deduced a trap composed of 20 places in 54 ms of which 0 ms to minimize.
[2023-03-10 19:17:32] [INFO ] Deduced a trap composed of 25 places in 51 ms of which 1 ms to minimize.
[2023-03-10 19:17:32] [INFO ] Deduced a trap composed of 22 places in 53 ms of which 0 ms to minimize.
[2023-03-10 19:17:32] [INFO ] Deduced a trap composed of 27 places in 47 ms of which 1 ms to minimize.
[2023-03-10 19:17:32] [INFO ] Deduced a trap composed of 11 places in 55 ms of which 0 ms to minimize.
[2023-03-10 19:17:32] [INFO ] Deduced a trap composed of 16 places in 39 ms of which 0 ms to minimize.
[2023-03-10 19:17:32] [INFO ] Deduced a trap composed of 29 places in 55 ms of which 1 ms to minimize.
[2023-03-10 19:17:32] [INFO ] Deduced a trap composed of 23 places in 58 ms of which 0 ms to minimize.
[2023-03-10 19:17:32] [INFO ] Deduced a trap composed of 29 places in 51 ms of which 0 ms to minimize.
[2023-03-10 19:17:32] [INFO ] Deduced a trap composed of 30 places in 49 ms of which 0 ms to minimize.
[2023-03-10 19:17:32] [INFO ] Deduced a trap composed of 27 places in 48 ms of which 0 ms to minimize.
[2023-03-10 19:17:33] [INFO ] Deduced a trap composed of 29 places in 59 ms of which 1 ms to minimize.
[2023-03-10 19:17:33] [INFO ] Deduced a trap composed of 27 places in 53 ms of which 1 ms to minimize.
[2023-03-10 19:17:33] [INFO ] Deduced a trap composed of 10 places in 46 ms of which 1 ms to minimize.
[2023-03-10 19:17:33] [INFO ] Deduced a trap composed of 30 places in 56 ms of which 0 ms to minimize.
[2023-03-10 19:17:33] [INFO ] Deduced a trap composed of 35 places in 50 ms of which 0 ms to minimize.
[2023-03-10 19:17:33] [INFO ] Deduced a trap composed of 32 places in 51 ms of which 0 ms to minimize.
[2023-03-10 19:17:33] [INFO ] Deduced a trap composed of 31 places in 64 ms of which 1 ms to minimize.
[2023-03-10 19:17:33] [INFO ] Deduced a trap composed of 19 places in 55 ms of which 0 ms to minimize.
[2023-03-10 19:17:33] [INFO ] Deduced a trap composed of 10 places in 51 ms of which 1 ms to minimize.
[2023-03-10 19:17:33] [INFO ] Deduced a trap composed of 28 places in 57 ms of which 0 ms to minimize.
[2023-03-10 19:17:33] [INFO ] Deduced a trap composed of 16 places in 53 ms of which 2 ms to minimize.
[2023-03-10 19:17:33] [INFO ] Deduced a trap composed of 21 places in 52 ms of which 1 ms to minimize.
[2023-03-10 19:17:33] [INFO ] Deduced a trap composed of 15 places in 49 ms of which 1 ms to minimize.
[2023-03-10 19:17:33] [INFO ] Deduced a trap composed of 31 places in 56 ms of which 0 ms to minimize.
[2023-03-10 19:17:34] [INFO ] Deduced a trap composed of 10 places in 44 ms of which 0 ms to minimize.
[2023-03-10 19:17:34] [INFO ] Deduced a trap composed of 27 places in 59 ms of which 0 ms to minimize.
[2023-03-10 19:17:34] [INFO ] Deduced a trap composed of 27 places in 55 ms of which 0 ms to minimize.
[2023-03-10 19:17:34] [INFO ] Deduced a trap composed of 20 places in 58 ms of which 0 ms to minimize.
[2023-03-10 19:17:34] [INFO ] Deduced a trap composed of 26 places in 53 ms of which 0 ms to minimize.
[2023-03-10 19:17:34] [INFO ] Deduced a trap composed of 27 places in 62 ms of which 0 ms to minimize.
[2023-03-10 19:17:34] [INFO ] Deduced a trap composed of 14 places in 52 ms of which 0 ms to minimize.
[2023-03-10 19:17:34] [INFO ] Deduced a trap composed of 16 places in 48 ms of which 0 ms to minimize.
[2023-03-10 19:17:34] [INFO ] Deduced a trap composed of 15 places in 58 ms of which 0 ms to minimize.
[2023-03-10 19:17:34] [INFO ] Deduced a trap composed of 30 places in 63 ms of which 0 ms to minimize.
[2023-03-10 19:17:34] [INFO ] Deduced a trap composed of 26 places in 56 ms of which 1 ms to minimize.
[2023-03-10 19:17:34] [INFO ] Deduced a trap composed of 22 places in 61 ms of which 0 ms to minimize.
[2023-03-10 19:17:35] [INFO ] Deduced a trap composed of 20 places in 53 ms of which 0 ms to minimize.
[2023-03-10 19:17:35] [INFO ] Deduced a trap composed of 10 places in 51 ms of which 0 ms to minimize.
[2023-03-10 19:17:35] [INFO ] Deduced a trap composed of 25 places in 56 ms of which 1 ms to minimize.
[2023-03-10 19:17:35] [INFO ] Deduced a trap composed of 19 places in 57 ms of which 0 ms to minimize.
[2023-03-10 19:17:35] [INFO ] Deduced a trap composed of 27 places in 66 ms of which 0 ms to minimize.
[2023-03-10 19:17:35] [INFO ] Deduced a trap composed of 27 places in 66 ms of which 1 ms to minimize.
[2023-03-10 19:17:35] [INFO ] Deduced a trap composed of 30 places in 58 ms of which 0 ms to minimize.
[2023-03-10 19:17:35] [INFO ] Deduced a trap composed of 27 places in 52 ms of which 0 ms to minimize.
[2023-03-10 19:17:35] [INFO ] Deduced a trap composed of 19 places in 52 ms of which 0 ms to minimize.
[2023-03-10 19:17:35] [INFO ] Deduced a trap composed of 12 places in 42 ms of which 0 ms to minimize.
[2023-03-10 19:17:35] [INFO ] Deduced a trap composed of 24 places in 46 ms of which 0 ms to minimize.
[2023-03-10 19:17:35] [INFO ] Deduced a trap composed of 29 places in 50 ms of which 1 ms to minimize.
[2023-03-10 19:17:36] [INFO ] Deduced a trap composed of 33 places in 57 ms of which 0 ms to minimize.
[2023-03-10 19:17:36] [INFO ] Deduced a trap composed of 16 places in 45 ms of which 0 ms to minimize.
[2023-03-10 19:17:36] [INFO ] Deduced a trap composed of 15 places in 58 ms of which 0 ms to minimize.
[2023-03-10 19:17:36] [INFO ] Deduced a trap composed of 19 places in 56 ms of which 0 ms to minimize.
[2023-03-10 19:17:36] [INFO ] Deduced a trap composed of 33 places in 64 ms of which 0 ms to minimize.
[2023-03-10 19:17:36] [INFO ] Deduced a trap composed of 26 places in 57 ms of which 0 ms to minimize.
[2023-03-10 19:17:36] [INFO ] Deduced a trap composed of 24 places in 63 ms of which 0 ms to minimize.
[2023-03-10 19:17:36] [INFO ] Deduced a trap composed of 10 places in 54 ms of which 0 ms to minimize.
[2023-03-10 19:17:36] [INFO ] Deduced a trap composed of 30 places in 62 ms of which 1 ms to minimize.
[2023-03-10 19:17:36] [INFO ] Deduced a trap composed of 33 places in 62 ms of which 0 ms to minimize.
[2023-03-10 19:17:36] [INFO ] Deduced a trap composed of 25 places in 54 ms of which 0 ms to minimize.
[2023-03-10 19:17:37] [INFO ] Deduced a trap composed of 14 places in 50 ms of which 0 ms to minimize.
[2023-03-10 19:17:37] [INFO ] Deduced a trap composed of 19 places in 48 ms of which 1 ms to minimize.
[2023-03-10 19:17:37] [INFO ] Deduced a trap composed of 27 places in 47 ms of which 0 ms to minimize.
[2023-03-10 19:17:37] [INFO ] Deduced a trap composed of 34 places in 47 ms of which 0 ms to minimize.
[2023-03-10 19:17:37] [INFO ] Deduced a trap composed of 27 places in 50 ms of which 1 ms to minimize.
[2023-03-10 19:17:37] [INFO ] Deduced a trap composed of 35 places in 54 ms of which 0 ms to minimize.
[2023-03-10 19:17:37] [INFO ] Deduced a trap composed of 23 places in 49 ms of which 0 ms to minimize.
[2023-03-10 19:17:37] [INFO ] Deduced a trap composed of 24 places in 53 ms of which 0 ms to minimize.
[2023-03-10 19:17:37] [INFO ] Deduced a trap composed of 24 places in 43 ms of which 0 ms to minimize.
[2023-03-10 19:17:37] [INFO ] Deduced a trap composed of 28 places in 61 ms of which 0 ms to minimize.
[2023-03-10 19:17:37] [INFO ] Deduced a trap composed of 24 places in 57 ms of which 1 ms to minimize.
[2023-03-10 19:17:37] [INFO ] Deduced a trap composed of 19 places in 54 ms of which 0 ms to minimize.
[2023-03-10 19:17:38] [INFO ] Deduced a trap composed of 26 places in 56 ms of which 0 ms to minimize.
[2023-03-10 19:17:38] [INFO ] Deduced a trap composed of 28 places in 58 ms of which 1 ms to minimize.
[2023-03-10 19:17:38] [INFO ] Deduced a trap composed of 28 places in 57 ms of which 1 ms to minimize.
[2023-03-10 19:17:38] [INFO ] Deduced a trap composed of 22 places in 59 ms of which 0 ms to minimize.
[2023-03-10 19:17:38] [INFO ] Deduced a trap composed of 17 places in 60 ms of which 0 ms to minimize.
[2023-03-10 19:17:38] [INFO ] Deduced a trap composed of 32 places in 64 ms of which 0 ms to minimize.
[2023-03-10 19:17:38] [INFO ] Deduced a trap composed of 27 places in 61 ms of which 0 ms to minimize.
[2023-03-10 19:17:38] [INFO ] Deduced a trap composed of 26 places in 56 ms of which 1 ms to minimize.
[2023-03-10 19:17:38] [INFO ] Deduced a trap composed of 17 places in 54 ms of which 0 ms to minimize.
[2023-03-10 19:17:38] [INFO ] Deduced a trap composed of 18 places in 57 ms of which 0 ms to minimize.
[2023-03-10 19:17:38] [INFO ] Deduced a trap composed of 19 places in 60 ms of which 0 ms to minimize.
[2023-03-10 19:17:39] [INFO ] Deduced a trap composed of 11 places in 51 ms of which 1 ms to minimize.
[2023-03-10 19:17:39] [INFO ] Deduced a trap composed of 13 places in 46 ms of which 1 ms to minimize.
[2023-03-10 19:17:39] [INFO ] Deduced a trap composed of 15 places in 55 ms of which 0 ms to minimize.
[2023-03-10 19:17:39] [INFO ] Deduced a trap composed of 30 places in 66 ms of which 0 ms to minimize.
[2023-03-10 19:17:39] [INFO ] Deduced a trap composed of 31 places in 70 ms of which 1 ms to minimize.
[2023-03-10 19:17:39] [INFO ] Deduced a trap composed of 26 places in 64 ms of which 0 ms to minimize.
[2023-03-10 19:17:39] [INFO ] Deduced a trap composed of 34 places in 52 ms of which 0 ms to minimize.
[2023-03-10 19:17:39] [INFO ] Deduced a trap composed of 28 places in 56 ms of which 0 ms to minimize.
[2023-03-10 19:17:41] [INFO ] Deduced a trap composed of 16 places in 1236 ms of which 0 ms to minimize.
[2023-03-10 19:17:41] [INFO ] Deduced a trap composed of 21 places in 57 ms of which 0 ms to minimize.
[2023-03-10 19:17:41] [INFO ] Deduced a trap composed of 21 places in 51 ms of which 0 ms to minimize.
[2023-03-10 19:17:41] [INFO ] Deduced a trap composed of 20 places in 53 ms of which 0 ms to minimize.
[2023-03-10 19:17:41] [INFO ] Deduced a trap composed of 14 places in 46 ms of which 1 ms to minimize.
[2023-03-10 19:17:41] [INFO ] Deduced a trap composed of 14 places in 44 ms of which 1 ms to minimize.
[2023-03-10 19:17:41] [INFO ] Deduced a trap composed of 18 places in 49 ms of which 1 ms to minimize.
[2023-03-10 19:17:41] [INFO ] Deduced a trap composed of 19 places in 49 ms of which 0 ms to minimize.
[2023-03-10 19:17:41] [INFO ] Deduced a trap composed of 24 places in 48 ms of which 0 ms to minimize.
[2023-03-10 19:17:41] [INFO ] Deduced a trap composed of 30 places in 53 ms of which 0 ms to minimize.
[2023-03-10 19:17:41] [INFO ] Deduced a trap composed of 14 places in 51 ms of which 1 ms to minimize.
[2023-03-10 19:17:42] [INFO ] Deduced a trap composed of 14 places in 45 ms of which 0 ms to minimize.
[2023-03-10 19:17:42] [INFO ] Deduced a trap composed of 14 places in 51 ms of which 0 ms to minimize.
[2023-03-10 19:17:42] [INFO ] Deduced a trap composed of 27 places in 47 ms of which 0 ms to minimize.
[2023-03-10 19:17:42] [INFO ] Deduced a trap composed of 31 places in 50 ms of which 0 ms to minimize.
[2023-03-10 19:17:42] [INFO ] Deduced a trap composed of 35 places in 50 ms of which 0 ms to minimize.
[2023-03-10 19:17:42] [INFO ] Deduced a trap composed of 28 places in 48 ms of which 1 ms to minimize.
[2023-03-10 19:17:42] [INFO ] Deduced a trap composed of 30 places in 59 ms of which 0 ms to minimize.
[2023-03-10 19:17:42] [INFO ] Deduced a trap composed of 28 places in 49 ms of which 0 ms to minimize.
[2023-03-10 19:17:42] [INFO ] Deduced a trap composed of 30 places in 49 ms of which 1 ms to minimize.
[2023-03-10 19:17:43] [INFO ] Deduced a trap composed of 31 places in 46 ms of which 1 ms to minimize.
[2023-03-10 19:17:43] [INFO ] Deduced a trap composed of 31 places in 49 ms of which 0 ms to minimize.
[2023-03-10 19:17:43] [INFO ] Deduced a trap composed of 34 places in 52 ms of which 0 ms to minimize.
[2023-03-10 19:17:43] [INFO ] Deduced a trap composed of 19 places in 56 ms of which 2 ms to minimize.
[2023-03-10 19:17:43] [INFO ] Deduced a trap composed of 19 places in 50 ms of which 0 ms to minimize.
[2023-03-10 19:17:43] [INFO ] Deduced a trap composed of 21 places in 46 ms of which 1 ms to minimize.
[2023-03-10 19:17:43] [INFO ] Deduced a trap composed of 15 places in 47 ms of which 0 ms to minimize.
[2023-03-10 19:17:43] [INFO ] Deduced a trap composed of 14 places in 53 ms of which 0 ms to minimize.
[2023-03-10 19:17:43] [INFO ] Deduced a trap composed of 18 places in 51 ms of which 1 ms to minimize.
[2023-03-10 19:17:43] [INFO ] Deduced a trap composed of 14 places in 47 ms of which 0 ms to minimize.
[2023-03-10 19:17:43] [INFO ] Deduced a trap composed of 18 places in 46 ms of which 0 ms to minimize.
[2023-03-10 19:17:43] [INFO ] Deduced a trap composed of 19 places in 51 ms of which 2 ms to minimize.
[2023-03-10 19:17:44] [INFO ] Deduced a trap composed of 18 places in 53 ms of which 0 ms to minimize.
[2023-03-10 19:17:44] [INFO ] Deduced a trap composed of 23 places in 54 ms of which 0 ms to minimize.
[2023-03-10 19:17:44] [INFO ] Deduced a trap composed of 34 places in 56 ms of which 0 ms to minimize.
[2023-03-10 19:17:44] [INFO ] Deduced a trap composed of 34 places in 56 ms of which 0 ms to minimize.
[2023-03-10 19:17:44] [INFO ] Deduced a trap composed of 18 places in 54 ms of which 1 ms to minimize.
[2023-03-10 19:17:44] [INFO ] Deduced a trap composed of 31 places in 57 ms of which 0 ms to minimize.
[2023-03-10 19:17:44] [INFO ] Deduced a trap composed of 22 places in 49 ms of which 0 ms to minimize.
[2023-03-10 19:17:44] [INFO ] Deduced a trap composed of 28 places in 51 ms of which 0 ms to minimize.
[2023-03-10 19:17:44] [INFO ] Deduced a trap composed of 27 places in 52 ms of which 1 ms to minimize.
[2023-03-10 19:17:44] [INFO ] Deduced a trap composed of 32 places in 60 ms of which 0 ms to minimize.
[2023-03-10 19:17:44] [INFO ] Deduced a trap composed of 18 places in 42 ms of which 1 ms to minimize.
[2023-03-10 19:17:45] [INFO ] Deduced a trap composed of 26 places in 54 ms of which 1 ms to minimize.
[2023-03-10 19:17:45] [INFO ] Deduced a trap composed of 31 places in 53 ms of which 1 ms to minimize.
[2023-03-10 19:17:45] [INFO ] Deduced a trap composed of 15 places in 48 ms of which 0 ms to minimize.
[2023-03-10 19:17:45] [INFO ] Deduced a trap composed of 19 places in 50 ms of which 1 ms to minimize.
[2023-03-10 19:17:45] [INFO ] Deduced a trap composed of 27 places in 54 ms of which 0 ms to minimize.
[2023-03-10 19:17:45] [INFO ] Deduced a trap composed of 21 places in 48 ms of which 0 ms to minimize.
[2023-03-10 19:17:45] [INFO ] Deduced a trap composed of 33 places in 53 ms of which 0 ms to minimize.
[2023-03-10 19:17:45] [INFO ] Deduced a trap composed of 20 places in 53 ms of which 0 ms to minimize.
[2023-03-10 19:17:45] [INFO ] Deduced a trap composed of 16 places in 49 ms of which 0 ms to minimize.
[2023-03-10 19:17:45] [INFO ] Deduced a trap composed of 21 places in 46 ms of which 0 ms to minimize.
[2023-03-10 19:17:45] [INFO ] Deduced a trap composed of 19 places in 49 ms of which 0 ms to minimize.
[2023-03-10 19:17:46] [INFO ] Deduced a trap composed of 16 places in 45 ms of which 1 ms to minimize.
[2023-03-10 19:17:46] [INFO ] Deduced a trap composed of 23 places in 46 ms of which 0 ms to minimize.
[2023-03-10 19:17:46] [INFO ] Deduced a trap composed of 18 places in 41 ms of which 0 ms to minimize.
[2023-03-10 19:17:46] [INFO ] Deduced a trap composed of 19 places in 39 ms of which 0 ms to minimize.
[2023-03-10 19:17:46] [INFO ] Deduced a trap composed of 18 places in 44 ms of which 0 ms to minimize.
[2023-03-10 19:17:46] [INFO ] Deduced a trap composed of 39 places in 57 ms of which 0 ms to minimize.
[2023-03-10 19:17:46] [INFO ] Deduced a trap composed of 16 places in 48 ms of which 0 ms to minimize.
[2023-03-10 19:17:46] [INFO ] Deduced a trap composed of 33 places in 54 ms of which 0 ms to minimize.
[2023-03-10 19:17:46] [INFO ] Deduced a trap composed of 14 places in 50 ms of which 0 ms to minimize.
[2023-03-10 19:17:46] [INFO ] Deduced a trap composed of 32 places in 56 ms of which 1 ms to minimize.
[2023-03-10 19:17:46] [INFO ] Deduced a trap composed of 16 places in 49 ms of which 1 ms to minimize.
[2023-03-10 19:17:47] [INFO ] Deduced a trap composed of 14 places in 53 ms of which 0 ms to minimize.
[2023-03-10 19:17:47] [INFO ] Deduced a trap composed of 18 places in 47 ms of which 0 ms to minimize.
[2023-03-10 19:17:47] [INFO ] Deduced a trap composed of 27 places in 53 ms of which 0 ms to minimize.
[2023-03-10 19:17:47] [INFO ] Deduced a trap composed of 32 places in 58 ms of which 0 ms to minimize.
[2023-03-10 19:17:47] [INFO ] Deduced a trap composed of 32 places in 51 ms of which 0 ms to minimize.
[2023-03-10 19:17:47] [INFO ] Deduced a trap composed of 27 places in 56 ms of which 0 ms to minimize.
[2023-03-10 19:17:47] [INFO ] Deduced a trap composed of 27 places in 50 ms of which 1 ms to minimize.
[2023-03-10 19:17:47] [INFO ] Deduced a trap composed of 27 places in 53 ms of which 0 ms to minimize.
[2023-03-10 19:17:47] [INFO ] Deduced a trap composed of 27 places in 56 ms of which 0 ms to minimize.
[2023-03-10 19:17:47] [INFO ] Deduced a trap composed of 29 places in 55 ms of which 1 ms to minimize.
[2023-03-10 19:17:47] [INFO ] Deduced a trap composed of 18 places in 50 ms of which 0 ms to minimize.
[2023-03-10 19:17:48] [INFO ] Deduced a trap composed of 27 places in 61 ms of which 3 ms to minimize.
[2023-03-10 19:17:48] [INFO ] Deduced a trap composed of 22 places in 50 ms of which 1 ms to minimize.
[2023-03-10 19:17:48] [INFO ] Deduced a trap composed of 19 places in 49 ms of which 0 ms to minimize.
[2023-03-10 19:17:48] [INFO ] Trap strengthening (SAT) tested/added 291/291 trap constraints in 24804 ms
[2023-03-10 19:17:48] [INFO ] After 24897ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :0
[2023-03-10 19:17:48] [INFO ] After 25011ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 4 ms.
Support contains 2 out of 265 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 265/265 places, 206/206 transitions.
Graph (complete) has 938 edges and 265 vertex of which 240 are kept as prefixes of interest. Removing 25 places using SCC suffix rule.2 ms
Discarding 25 places :
Also discarding 0 output transitions
Partial Free-agglomeration rule applied 6 times.
Drop transitions removed 6 transitions
Iterating global reduction 0 with 6 rules applied. Total rules applied 7 place count 240 transition count 206
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 239 transition count 205
Applied a total of 8 rules in 55 ms. Remains 239 /265 variables (removed 26) and now considering 205/206 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 56 ms. Remains : 239/265 places, 205/206 transitions.
Incomplete random walk after 10000 steps, including 204 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 16 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1254021 steps, run timeout after 3001 ms. (steps per millisecond=417 ) properties seen :{}
Probabilistic random walk after 1254021 steps, saw 166073 distinct states, run finished after 3002 ms. (steps per millisecond=417 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 205 rows 239 cols
[2023-03-10 19:17:51] [INFO ] Computed 110 place invariants in 44 ms
[2023-03-10 19:17:51] [INFO ] After 51ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-10 19:17:51] [INFO ] [Nat]Absence check using 11 positive place invariants in 5 ms returned sat
[2023-03-10 19:17:51] [INFO ] [Nat]Absence check using 11 positive and 99 generalized place invariants in 88 ms returned sat
[2023-03-10 19:17:51] [INFO ] After 80ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-10 19:17:51] [INFO ] After 157ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 17 ms.
[2023-03-10 19:17:51] [INFO ] After 327ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 3 ms.
Support contains 2 out of 239 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 239/239 places, 205/205 transitions.
Applied a total of 0 rules in 13 ms. Remains 239 /239 variables (removed 0) and now considering 205/205 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13 ms. Remains : 239/239 places, 205/205 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 239/239 places, 205/205 transitions.
Applied a total of 0 rules in 8 ms. Remains 239 /239 variables (removed 0) and now considering 205/205 (removed 0) transitions.
[2023-03-10 19:17:51] [INFO ] Invariant cache hit.
[2023-03-10 19:17:52] [INFO ] Implicit Places using invariants in 454 ms returned [16, 164, 184, 206, 214, 225, 233]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 457 ms to find 7 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 232/239 places, 205/205 transitions.
Applied a total of 0 rules in 13 ms. Remains 232 /232 variables (removed 0) and now considering 205/205 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 479 ms. Remains : 232/239 places, 205/205 transitions.
Incomplete random walk after 10000 steps, including 204 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 16 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1208594 steps, run timeout after 3001 ms. (steps per millisecond=402 ) properties seen :{}
Probabilistic random walk after 1208594 steps, saw 160041 distinct states, run finished after 3001 ms. (steps per millisecond=402 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 205 rows 232 cols
[2023-03-10 19:17:55] [INFO ] Computed 103 place invariants in 19 ms
[2023-03-10 19:17:55] [INFO ] After 51ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-10 19:17:55] [INFO ] [Nat]Absence check using 9 positive place invariants in 3 ms returned sat
[2023-03-10 19:17:55] [INFO ] [Nat]Absence check using 9 positive and 94 generalized place invariants in 82 ms returned sat
[2023-03-10 19:17:55] [INFO ] After 85ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-10 19:17:55] [INFO ] After 102ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 11 ms.
[2023-03-10 19:17:55] [INFO ] After 253ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 2 out of 232 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 232/232 places, 205/205 transitions.
Applied a total of 0 rules in 12 ms. Remains 232 /232 variables (removed 0) and now considering 205/205 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 232/232 places, 205/205 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 232/232 places, 205/205 transitions.
Applied a total of 0 rules in 8 ms. Remains 232 /232 variables (removed 0) and now considering 205/205 (removed 0) transitions.
[2023-03-10 19:17:55] [INFO ] Invariant cache hit.
[2023-03-10 19:17:56] [INFO ] Implicit Places using invariants in 437 ms returned []
[2023-03-10 19:17:56] [INFO ] Invariant cache hit.
[2023-03-10 19:17:56] [INFO ] Implicit Places using invariants and state equation in 407 ms returned []
Implicit Place search using SMT with State Equation took 848 ms to find 0 implicit places.
[2023-03-10 19:17:56] [INFO ] Redundant transitions in 10 ms returned []
[2023-03-10 19:17:56] [INFO ] Invariant cache hit.
[2023-03-10 19:17:56] [INFO ] Dead Transitions using invariants and state equation in 274 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1152 ms. Remains : 232/232 places, 205/205 transitions.
Applied a total of 0 rules in 10 ms. Remains 232 /232 variables (removed 0) and now considering 205/205 (removed 0) transitions.
Running SMT prover for 1 properties.
[2023-03-10 19:17:56] [INFO ] Invariant cache hit.
[2023-03-10 19:17:56] [INFO ] After 54ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-10 19:17:57] [INFO ] [Nat]Absence check using 9 positive place invariants in 5 ms returned sat
[2023-03-10 19:17:57] [INFO ] [Nat]Absence check using 9 positive and 94 generalized place invariants in 74 ms returned sat
[2023-03-10 19:17:57] [INFO ] After 71ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-10 19:17:57] [INFO ] After 112ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 14 ms.
[2023-03-10 19:17:57] [INFO ] After 269ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2023-03-10 19:17:57] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 2 ms.
[2023-03-10 19:17:57] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 232 places, 205 transitions and 1144 arcs took 2 ms.
[2023-03-10 19:17:57] [INFO ] Flatten gal took : 60 ms
Total runtime 35141 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=ReachabilityCardinality.xml --memory=6 --mcc-mode

parse successfull
net created successfully

Net: Echo_PT_d03r03
(NrP: 232 NrTr: 205 NrArc: 1144)

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

net check time: 0m 0.000sec

init dd package: 0m 2.668sec

TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 6820260 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16098344 kB

BK_TIME_CONFINEMENT_REACHED

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

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

2225577 2385781 5308932

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="Echo-PT-d03r03"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="marciexred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool marciexred"
echo " Input is Echo-PT-d03r03, examination is ReachabilityCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r170-tall-167838856700086"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/Echo-PT-d03r03.tgz
mv Echo-PT-d03r03 execution
cd execution
if [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "UpperBounds" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] || [ "ReachabilityCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "ReachabilityCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "ReachabilityCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' ReachabilityCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityCardinality"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;