Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2022-input.r035-tall-165252016300243.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2022-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
......................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is BusinessProcesses-PT-09, examination is StableMarking
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r035-tall-165252016300243
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 296K
-rw-r--r-- 1 mcc users 5.7K Apr 30 00:05 CTLCardinality.txt
-rw-r--r-- 1 mcc users 58K Apr 30 00:05 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.4K Apr 30 00:04 CTLFireability.txt
-rw-r--r-- 1 mcc users 36K Apr 30 00:04 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:33 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.6K May 9 07:09 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 9 07:09 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 9 07:09 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 9 07:09 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 9 07:09 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 9 07:09 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:33 equiv_col
-rw-r--r-- 1 mcc users 3 May 10 09:33 instance
-rw-r--r-- 1 mcc users 6 May 10 09:33 iscolored
-rw-r--r-- 1 mcc users 104K May 10 09:33 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

FORMULA_NAME StableMarking

=== Now, execution of the tool begins

BK_START 1652542952713

Running Version 202205111006
[2022-05-14 15:42:33] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, StableMarking, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 1800]
[2022-05-14 15:42:33] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-14 15:42:34] [INFO ] Load time of PNML (sax parser for PT used): 105 ms
[2022-05-14 15:42:34] [INFO ] Transformed 403 places.
[2022-05-14 15:42:34] [INFO ] Transformed 374 transitions.
[2022-05-14 15:42:34] [INFO ] Found NUPN structural information;
[2022-05-14 15:42:34] [INFO ] Parsed PT model containing 403 places and 374 transitions in 212 ms.
Graph (trivial) has 227 edges and 403 vertex of which 7 / 403 are part of one of the 1 SCC in 4 ms
Free SCC test removed 6 places
Structural test allowed to assert that 124 places are NOT stable. Took 14 ms.
Ensure Unique test removed 7 transitions
Reduce redundant transitions removed 7 transitions.
Incomplete random walk after 10000 steps, including 115 resets, run finished after 696 ms. (steps per millisecond=14 ) properties (out of 279) seen :124
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 155) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 155) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 155) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 155) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 155) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 155) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 155) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 155) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 155) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 155) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 155) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 155) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 155) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 155) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 155) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 155) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 155) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 155) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 155) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 155) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 155) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 155) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 155) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 155) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 155) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 155) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 155) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 155) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 155) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 155) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 155) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 155) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 155) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 155) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 155) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 155) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 155) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 155) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 155) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 155) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 155) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 155) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 155) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 155) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 155) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 155) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 155) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 155) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 155) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 155) seen :0
Running SMT prover for 155 properties.
// Phase 1: matrix 367 rows 397 cols
[2022-05-14 15:42:35] [INFO ] Computed 65 place invariants in 32 ms
[2022-05-14 15:42:36] [INFO ] After 1490ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:155
[2022-05-14 15:42:37] [INFO ] [Nat]Absence check using 35 positive place invariants in 15 ms returned sat
[2022-05-14 15:42:37] [INFO ] [Nat]Absence check using 35 positive and 30 generalized place invariants in 11 ms returned sat
[2022-05-14 15:42:41] [INFO ] After 2485ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :155
[2022-05-14 15:42:41] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-14 15:42:43] [INFO ] After 2369ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :155
[2022-05-14 15:42:43] [INFO ] Deduced a trap composed of 9 places in 126 ms of which 6 ms to minimize.
[2022-05-14 15:42:43] [INFO ] Deduced a trap composed of 100 places in 139 ms of which 2 ms to minimize.
[2022-05-14 15:42:43] [INFO ] Deduced a trap composed of 8 places in 121 ms of which 1 ms to minimize.
[2022-05-14 15:42:44] [INFO ] Deduced a trap composed of 11 places in 106 ms of which 1 ms to minimize.
[2022-05-14 15:42:44] [INFO ] Deduced a trap composed of 39 places in 170 ms of which 0 ms to minimize.
[2022-05-14 15:42:44] [INFO ] Deduced a trap composed of 90 places in 85 ms of which 1 ms to minimize.
[2022-05-14 15:42:44] [INFO ] Deduced a trap composed of 90 places in 102 ms of which 1 ms to minimize.
[2022-05-14 15:42:44] [INFO ] Deduced a trap composed of 83 places in 98 ms of which 1 ms to minimize.
[2022-05-14 15:42:44] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 1129 ms
[2022-05-14 15:42:45] [INFO ] Deduced a trap composed of 37 places in 51 ms of which 0 ms to minimize.
[2022-05-14 15:42:45] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 84 ms
[2022-05-14 15:42:45] [INFO ] Deduced a trap composed of 96 places in 96 ms of which 0 ms to minimize.
[2022-05-14 15:42:45] [INFO ] Deduced a trap composed of 90 places in 92 ms of which 0 ms to minimize.
[2022-05-14 15:42:45] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 244 ms
[2022-05-14 15:42:46] [INFO ] Deduced a trap composed of 92 places in 101 ms of which 0 ms to minimize.
[2022-05-14 15:42:46] [INFO ] Deduced a trap composed of 96 places in 95 ms of which 0 ms to minimize.
[2022-05-14 15:42:46] [INFO ] Deduced a trap composed of 94 places in 95 ms of which 0 ms to minimize.
[2022-05-14 15:42:46] [INFO ] Deduced a trap composed of 84 places in 93 ms of which 0 ms to minimize.
[2022-05-14 15:42:46] [INFO ] Deduced a trap composed of 86 places in 90 ms of which 0 ms to minimize.
[2022-05-14 15:42:46] [INFO ] Deduced a trap composed of 89 places in 83 ms of which 1 ms to minimize.
[2022-05-14 15:42:46] [INFO ] Deduced a trap composed of 87 places in 81 ms of which 1 ms to minimize.
[2022-05-14 15:42:46] [INFO ] Deduced a trap composed of 88 places in 85 ms of which 1 ms to minimize.
[2022-05-14 15:42:47] [INFO ] Deduced a trap composed of 93 places in 81 ms of which 0 ms to minimize.
[2022-05-14 15:42:47] [INFO ] Deduced a trap composed of 90 places in 83 ms of which 1 ms to minimize.
[2022-05-14 15:42:47] [INFO ] Deduced a trap composed of 103 places in 86 ms of which 1 ms to minimize.
[2022-05-14 15:42:47] [INFO ] Deduced a trap composed of 15 places in 106 ms of which 0 ms to minimize.
[2022-05-14 15:42:47] [INFO ] Deduced a trap composed of 11 places in 100 ms of which 1 ms to minimize.
[2022-05-14 15:42:47] [INFO ] Deduced a trap composed of 21 places in 105 ms of which 0 ms to minimize.
[2022-05-14 15:42:47] [INFO ] Deduced a trap composed of 89 places in 109 ms of which 0 ms to minimize.
[2022-05-14 15:42:47] [INFO ] Deduced a trap composed of 37 places in 106 ms of which 1 ms to minimize.
[2022-05-14 15:42:47] [INFO ] Deduced a trap composed of 36 places in 108 ms of which 0 ms to minimize.
[2022-05-14 15:42:48] [INFO ] Deduced a trap composed of 82 places in 105 ms of which 1 ms to minimize.
[2022-05-14 15:42:48] [INFO ] Deduced a trap composed of 89 places in 100 ms of which 1 ms to minimize.
[2022-05-14 15:42:48] [INFO ] Deduced a trap composed of 98 places in 98 ms of which 1 ms to minimize.
[2022-05-14 15:42:48] [INFO ] Deduced a trap composed of 91 places in 104 ms of which 1 ms to minimize.
[2022-05-14 15:42:48] [INFO ] Deduced a trap composed of 83 places in 104 ms of which 0 ms to minimize.
[2022-05-14 15:42:48] [INFO ] Deduced a trap composed of 93 places in 112 ms of which 1 ms to minimize.
[2022-05-14 15:42:48] [INFO ] Deduced a trap composed of 85 places in 104 ms of which 3 ms to minimize.
[2022-05-14 15:42:48] [INFO ] Deduced a trap composed of 98 places in 111 ms of which 0 ms to minimize.
[2022-05-14 15:42:49] [INFO ] Deduced a trap composed of 86 places in 98 ms of which 0 ms to minimize.
[2022-05-14 15:42:49] [INFO ] Deduced a trap composed of 20 places in 96 ms of which 1 ms to minimize.
[2022-05-14 15:42:49] [INFO ] Deduced a trap composed of 95 places in 93 ms of which 0 ms to minimize.
[2022-05-14 15:42:49] [INFO ] Deduced a trap composed of 31 places in 94 ms of which 0 ms to minimize.
[2022-05-14 15:42:49] [INFO ] Deduced a trap composed of 84 places in 90 ms of which 0 ms to minimize.
[2022-05-14 15:42:49] [INFO ] Deduced a trap composed of 93 places in 91 ms of which 0 ms to minimize.
[2022-05-14 15:42:49] [INFO ] Deduced a trap composed of 81 places in 92 ms of which 0 ms to minimize.
[2022-05-14 15:42:49] [INFO ] Deduced a trap composed of 92 places in 86 ms of which 1 ms to minimize.
[2022-05-14 15:42:49] [INFO ] Deduced a trap composed of 85 places in 86 ms of which 0 ms to minimize.
[2022-05-14 15:42:50] [INFO ] Deduced a trap composed of 109 places in 87 ms of which 0 ms to minimize.
[2022-05-14 15:42:50] [INFO ] Deduced a trap composed of 84 places in 89 ms of which 1 ms to minimize.
[2022-05-14 15:42:50] [INFO ] Deduced a trap composed of 92 places in 96 ms of which 1 ms to minimize.
[2022-05-14 15:42:50] [INFO ] Deduced a trap composed of 95 places in 92 ms of which 1 ms to minimize.
[2022-05-14 15:42:50] [INFO ] Deduced a trap composed of 70 places in 99 ms of which 1 ms to minimize.
[2022-05-14 15:42:50] [INFO ] Deduced a trap composed of 14 places in 94 ms of which 1 ms to minimize.
[2022-05-14 15:42:50] [INFO ] Deduced a trap composed of 18 places in 91 ms of which 1 ms to minimize.
[2022-05-14 15:42:50] [INFO ] Deduced a trap composed of 12 places in 46 ms of which 0 ms to minimize.
[2022-05-14 15:42:50] [INFO ] Trap strengthening (SAT) tested/added 43/42 trap constraints in 4844 ms
[2022-05-14 15:42:51] [INFO ] Deduced a trap composed of 13 places in 65 ms of which 1 ms to minimize.
[2022-05-14 15:42:51] [INFO ] Deduced a trap composed of 8 places in 61 ms of which 0 ms to minimize.
[2022-05-14 15:42:51] [INFO ] Deduced a trap composed of 32 places in 52 ms of which 0 ms to minimize.
[2022-05-14 15:42:52] [INFO ] Deduced a trap composed of 32 places in 53 ms of which 4 ms to minimize.
[2022-05-14 15:42:52] [INFO ] Deduced a trap composed of 33 places in 49 ms of which 0 ms to minimize.
[2022-05-14 15:42:52] [INFO ] Deduced a trap composed of 36 places in 45 ms of which 0 ms to minimize.
[2022-05-14 15:42:52] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 443 ms
[2022-05-14 15:42:52] [INFO ] Deduced a trap composed of 18 places in 46 ms of which 0 ms to minimize.
[2022-05-14 15:42:52] [INFO ] Deduced a trap composed of 29 places in 41 ms of which 0 ms to minimize.
[2022-05-14 15:42:52] [INFO ] Deduced a trap composed of 24 places in 38 ms of which 0 ms to minimize.
[2022-05-14 15:42:52] [INFO ] Deduced a trap composed of 20 places in 41 ms of which 0 ms to minimize.
[2022-05-14 15:42:52] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 248 ms
[2022-05-14 15:42:52] [INFO ] Deduced a trap composed of 32 places in 44 ms of which 1 ms to minimize.
[2022-05-14 15:42:53] [INFO ] Deduced a trap composed of 35 places in 43 ms of which 0 ms to minimize.
[2022-05-14 15:42:53] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 147 ms
[2022-05-14 15:42:53] [INFO ] Deduced a trap composed of 107 places in 104 ms of which 0 ms to minimize.
[2022-05-14 15:42:53] [INFO ] Deduced a trap composed of 87 places in 104 ms of which 2 ms to minimize.
[2022-05-14 15:42:53] [INFO ] Deduced a trap composed of 91 places in 102 ms of which 0 ms to minimize.
[2022-05-14 15:42:54] [INFO ] Deduced a trap composed of 99 places in 100 ms of which 1 ms to minimize.
[2022-05-14 15:42:54] [INFO ] Deduced a trap composed of 96 places in 98 ms of which 1 ms to minimize.
[2022-05-14 15:42:54] [INFO ] Deduced a trap composed of 90 places in 97 ms of which 0 ms to minimize.
[2022-05-14 15:42:54] [INFO ] Deduced a trap composed of 107 places in 94 ms of which 0 ms to minimize.
[2022-05-14 15:42:54] [INFO ] Deduced a trap composed of 93 places in 90 ms of which 1 ms to minimize.
[2022-05-14 15:42:54] [INFO ] Deduced a trap composed of 99 places in 93 ms of which 0 ms to minimize.
[2022-05-14 15:42:54] [INFO ] Deduced a trap composed of 81 places in 93 ms of which 0 ms to minimize.
[2022-05-14 15:42:54] [INFO ] Deduced a trap composed of 49 places in 102 ms of which 1 ms to minimize.
[2022-05-14 15:42:54] [INFO ] Deduced a trap composed of 39 places in 105 ms of which 0 ms to minimize.
[2022-05-14 15:42:55] [INFO ] Deduced a trap composed of 11 places in 111 ms of which 0 ms to minimize.
[2022-05-14 15:42:55] [INFO ] Deduced a trap composed of 105 places in 112 ms of which 0 ms to minimize.
[2022-05-14 15:42:55] [INFO ] Deduced a trap composed of 40 places in 108 ms of which 1 ms to minimize.
[2022-05-14 15:42:55] [INFO ] Deduced a trap composed of 89 places in 117 ms of which 0 ms to minimize.
[2022-05-14 15:42:55] [INFO ] Deduced a trap composed of 42 places in 117 ms of which 1 ms to minimize.
[2022-05-14 15:42:55] [INFO ] Deduced a trap composed of 91 places in 110 ms of which 1 ms to minimize.
[2022-05-14 15:42:55] [INFO ] Deduced a trap composed of 87 places in 110 ms of which 1 ms to minimize.
[2022-05-14 15:42:56] [INFO ] Deduced a trap composed of 95 places in 102 ms of which 1 ms to minimize.
[2022-05-14 15:42:56] [INFO ] Deduced a trap composed of 74 places in 100 ms of which 1 ms to minimize.
[2022-05-14 15:42:56] [INFO ] Deduced a trap composed of 72 places in 108 ms of which 0 ms to minimize.
[2022-05-14 15:42:56] [INFO ] Deduced a trap composed of 29 places in 106 ms of which 0 ms to minimize.
[2022-05-14 15:42:56] [INFO ] Deduced a trap composed of 81 places in 108 ms of which 0 ms to minimize.
[2022-05-14 15:42:56] [INFO ] Deduced a trap composed of 21 places in 106 ms of which 0 ms to minimize.
[2022-05-14 15:42:56] [INFO ] Deduced a trap composed of 75 places in 109 ms of which 0 ms to minimize.
[2022-05-14 15:42:56] [INFO ] Deduced a trap composed of 71 places in 107 ms of which 0 ms to minimize.
[2022-05-14 15:42:57] [INFO ] Deduced a trap composed of 23 places in 107 ms of which 1 ms to minimize.
[2022-05-14 15:42:57] [INFO ] Deduced a trap composed of 23 places in 105 ms of which 1 ms to minimize.
[2022-05-14 15:42:57] [INFO ] Deduced a trap composed of 86 places in 106 ms of which 0 ms to minimize.
[2022-05-14 15:42:57] [INFO ] Deduced a trap composed of 25 places in 114 ms of which 0 ms to minimize.
[2022-05-14 15:42:57] [INFO ] Deduced a trap composed of 90 places in 109 ms of which 0 ms to minimize.
[2022-05-14 15:42:57] [INFO ] Deduced a trap composed of 101 places in 108 ms of which 1 ms to minimize.
[2022-05-14 15:42:57] [INFO ] Deduced a trap composed of 78 places in 105 ms of which 0 ms to minimize.
[2022-05-14 15:42:57] [INFO ] Deduced a trap composed of 19 places in 106 ms of which 0 ms to minimize.
[2022-05-14 15:42:58] [INFO ] Deduced a trap composed of 22 places in 104 ms of which 0 ms to minimize.
[2022-05-14 15:42:58] [INFO ] Deduced a trap composed of 74 places in 96 ms of which 0 ms to minimize.
[2022-05-14 15:42:58] [INFO ] Deduced a trap composed of 73 places in 98 ms of which 1 ms to minimize.
[2022-05-14 15:42:58] [INFO ] Deduced a trap composed of 72 places in 100 ms of which 1 ms to minimize.
[2022-05-14 15:42:58] [INFO ] Deduced a trap composed of 24 places in 102 ms of which 0 ms to minimize.
[2022-05-14 15:42:58] [INFO ] Deduced a trap composed of 92 places in 109 ms of which 0 ms to minimize.
[2022-05-14 15:42:58] [INFO ] Deduced a trap composed of 95 places in 94 ms of which 1 ms to minimize.
[2022-05-14 15:42:58] [INFO ] Deduced a trap composed of 81 places in 90 ms of which 1 ms to minimize.
[2022-05-14 15:42:59] [INFO ] Deduced a trap composed of 27 places in 95 ms of which 1 ms to minimize.
[2022-05-14 15:42:59] [INFO ] Deduced a trap composed of 87 places in 92 ms of which 0 ms to minimize.
[2022-05-14 15:42:59] [INFO ] Deduced a trap composed of 98 places in 90 ms of which 0 ms to minimize.
[2022-05-14 15:42:59] [INFO ] Deduced a trap composed of 88 places in 94 ms of which 0 ms to minimize.
[2022-05-14 15:42:59] [INFO ] Deduced a trap composed of 88 places in 94 ms of which 1 ms to minimize.
[2022-05-14 15:42:59] [INFO ] Deduced a trap composed of 11 places in 85 ms of which 0 ms to minimize.
[2022-05-14 15:42:59] [INFO ] Deduced a trap composed of 92 places in 87 ms of which 0 ms to minimize.
[2022-05-14 15:43:00] [INFO ] Deduced a trap composed of 91 places in 98 ms of which 1 ms to minimize.
[2022-05-14 15:43:00] [INFO ] Deduced a trap composed of 104 places in 88 ms of which 0 ms to minimize.
[2022-05-14 15:43:00] [INFO ] Deduced a trap composed of 103 places in 90 ms of which 1 ms to minimize.
[2022-05-14 15:43:00] [INFO ] Deduced a trap composed of 98 places in 83 ms of which 1 ms to minimize.
[2022-05-14 15:43:00] [INFO ] Deduced a trap composed of 107 places in 93 ms of which 1 ms to minimize.
[2022-05-14 15:43:00] [INFO ] Deduced a trap composed of 95 places in 90 ms of which 1 ms to minimize.
[2022-05-14 15:43:00] [INFO ] Deduced a trap composed of 98 places in 89 ms of which 1 ms to minimize.
[2022-05-14 15:43:00] [INFO ] Deduced a trap composed of 97 places in 94 ms of which 0 ms to minimize.
[2022-05-14 15:43:00] [INFO ] Deduced a trap composed of 93 places in 81 ms of which 1 ms to minimize.
[2022-05-14 15:43:00] [INFO ] Deduced a trap composed of 92 places in 88 ms of which 1 ms to minimize.
[2022-05-14 15:43:01] [INFO ] Deduced a trap composed of 95 places in 82 ms of which 1 ms to minimize.
[2022-05-14 15:43:01] [INFO ] Deduced a trap composed of 104 places in 86 ms of which 1 ms to minimize.
[2022-05-14 15:43:01] [INFO ] Deduced a trap composed of 70 places in 85 ms of which 0 ms to minimize.
[2022-05-14 15:43:01] [INFO ] Deduced a trap composed of 74 places in 78 ms of which 0 ms to minimize.
[2022-05-14 15:43:01] [INFO ] Deduced a trap composed of 62 places in 78 ms of which 1 ms to minimize.
[2022-05-14 15:43:01] [INFO ] Deduced a trap composed of 89 places in 88 ms of which 1 ms to minimize.
[2022-05-14 15:43:01] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2022-05-14 15:43:01] [INFO ] After 25036ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:155
Fused 155 Parikh solutions to 153 different solutions.
Parikh walk visited 126 properties in 6310 ms.
Support contains 29 out of 397 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 397/397 places, 367/367 transitions.
Graph (complete) has 837 edges and 397 vertex of which 395 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.5 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 72 transitions
Trivial Post-agglo rules discarded 72 transitions
Performed 72 trivial Post agglomeration. Transition count delta: 72
Iterating post reduction 0 with 73 rules applied. Total rules applied 74 place count 395 transition count 293
Reduce places removed 72 places and 0 transitions.
Iterating post reduction 1 with 72 rules applied. Total rules applied 146 place count 323 transition count 293
Performed 57 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 57 Pre rules applied. Total rules applied 146 place count 323 transition count 236
Deduced a syphon composed of 57 places in 11 ms
Ensure Unique test removed 9 places
Reduce places removed 66 places and 0 transitions.
Iterating global reduction 2 with 123 rules applied. Total rules applied 269 place count 257 transition count 236
Discarding 36 places :
Symmetric choice reduction at 2 with 36 rule applications. Total rules 305 place count 221 transition count 200
Iterating global reduction 2 with 36 rules applied. Total rules applied 341 place count 221 transition count 200
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 341 place count 221 transition count 197
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 347 place count 218 transition count 197
Performed 62 Post agglomeration using F-continuation condition.Transition count delta: 62
Deduced a syphon composed of 62 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 64 places and 0 transitions.
Iterating global reduction 2 with 126 rules applied. Total rules applied 473 place count 154 transition count 135
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 475 place count 153 transition count 138
Free-agglomeration rule applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 477 place count 153 transition count 136
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 479 place count 151 transition count 136
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 480 place count 151 transition count 136
Applied a total of 480 rules in 125 ms. Remains 151 /397 variables (removed 246) and now considering 136/367 (removed 231) transitions.
Finished structural reductions, in 1 iterations. Remains : 151/397 places, 136/367 transitions.
Finished random walk after 1224 steps, including 44 resets, run visited all 29 properties in 17 ms. (steps per millisecond=72 )
Able to resolve query StableMarking after proving 281 properties.
FORMULA StableMarking FALSE TECHNIQUES RANDOM_WALK PARIKH_WALK MARKED_SUFFIX_TEST TRIVIAL_UNMARKED_SCC_TEST TOPOLOGICAL
Total runtime 34162 ms.

BK_STOP 1652542988201

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

+ export LANG=C
+ LANG=C
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ StableMarking = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution StableMarking -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 1800
+ ulimit -s 65536
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -pnfolder /home/mcc/execution -examination StableMarking -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 1800 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=@none -Xss128m -Xms40m -Xmx8192m

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="BusinessProcesses-PT-09"
export BK_EXAMINATION="StableMarking"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="1800"
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-4028"
echo " Executing tool itstools"
echo " Input is BusinessProcesses-PT-09, examination is StableMarking"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r035-tall-165252016300243"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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