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-165252016300248.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-10, examination is StableMarking
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r035-tall-165252016300248
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 328K
-rw-r--r-- 1 mcc users 5.5K Apr 30 00:02 CTLCardinality.txt
-rw-r--r-- 1 mcc users 57K Apr 30 00:02 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.3K Apr 30 00:02 CTLFireability.txt
-rw-r--r-- 1 mcc users 34K Apr 30 00:02 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:33 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 4.0K May 9 07:09 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K May 9 07:09 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 9 07:09 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K 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 131K 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 1652542982676

Running Version 202205111006
[2022-05-14 15:43:03] [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:43:03] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-14 15:43:04] [INFO ] Load time of PNML (sax parser for PT used): 112 ms
[2022-05-14 15:43:04] [INFO ] Transformed 518 places.
[2022-05-14 15:43:04] [INFO ] Transformed 471 transitions.
[2022-05-14 15:43:04] [INFO ] Found NUPN structural information;
[2022-05-14 15:43:04] [INFO ] Parsed PT model containing 518 places and 471 transitions in 231 ms.
Graph (trivial) has 296 edges and 518 vertex of which 7 / 518 are part of one of the 1 SCC in 12 ms
Free SCC test removed 6 places
Structural test allowed to assert that 162 places are NOT stable. Took 22 ms.
Ensure Unique test removed 7 transitions
Reduce redundant transitions removed 7 transitions.
Incomplete random walk after 10000 steps, including 91 resets, run finished after 788 ms. (steps per millisecond=12 ) properties (out of 356) seen :24
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=25 ) properties (out of 332) 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 332) 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 332) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=25 ) properties (out of 332) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=25 ) properties (out of 332) 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 332) 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 332) 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 332) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=8 ) properties (out of 332) 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 332) 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 332) 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 332) 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 332) 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 332) 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 332) 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 332) 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 332) 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 332) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=25 ) properties (out of 332) 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 332) 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 332) 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 332) 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 332) 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 332) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=25 ) properties (out of 332) 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 332) 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 332) 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 332) 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 332) 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 332) 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 332) 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 332) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=25 ) properties (out of 332) 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 332) 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 332) 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 332) 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 332) 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 332) 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 332) 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 332) 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 332) 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 332) 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 332) 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 332) 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 332) 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 332) 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 332) 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 332) 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 332) 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 332) seen :0
Probabilistic random walk after 100001 steps, saw 17214 distinct states, run finished after 1023 ms. (steps per millisecond=97 ) properties seen :217
Running SMT prover for 115 properties.
// Phase 1: matrix 464 rows 512 cols
[2022-05-14 15:43:06] [INFO ] Computed 85 place invariants in 25 ms
[2022-05-14 15:43:07] [INFO ] After 1540ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:115
[2022-05-14 15:43:08] [INFO ] [Nat]Absence check using 46 positive place invariants in 22 ms returned sat
[2022-05-14 15:43:08] [INFO ] [Nat]Absence check using 46 positive and 39 generalized place invariants in 16 ms returned sat
[2022-05-14 15:43:12] [INFO ] After 2476ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :115
[2022-05-14 15:43:12] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-14 15:43:14] [INFO ] After 2306ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :115
[2022-05-14 15:43:14] [INFO ] Deduced a trap composed of 18 places in 76 ms of which 4 ms to minimize.
[2022-05-14 15:43:14] [INFO ] Deduced a trap composed of 23 places in 72 ms of which 1 ms to minimize.
[2022-05-14 15:43:14] [INFO ] Deduced a trap composed of 35 places in 75 ms of which 1 ms to minimize.
[2022-05-14 15:43:14] [INFO ] Deduced a trap composed of 33 places in 59 ms of which 1 ms to minimize.
[2022-05-14 15:43:14] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 381 ms
[2022-05-14 15:43:15] [INFO ] Deduced a trap composed of 15 places in 68 ms of which 1 ms to minimize.
[2022-05-14 15:43:15] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 109 ms
[2022-05-14 15:43:15] [INFO ] Deduced a trap composed of 120 places in 132 ms of which 0 ms to minimize.
[2022-05-14 15:43:15] [INFO ] Deduced a trap composed of 31 places in 125 ms of which 0 ms to minimize.
[2022-05-14 15:43:16] [INFO ] Deduced a trap composed of 108 places in 246 ms of which 1 ms to minimize.
[2022-05-14 15:43:16] [INFO ] Deduced a trap composed of 109 places in 140 ms of which 0 ms to minimize.
[2022-05-14 15:43:16] [INFO ] Deduced a trap composed of 34 places in 132 ms of which 0 ms to minimize.
[2022-05-14 15:43:16] [INFO ] Deduced a trap composed of 119 places in 137 ms of which 1 ms to minimize.
[2022-05-14 15:43:16] [INFO ] Deduced a trap composed of 118 places in 123 ms of which 0 ms to minimize.
[2022-05-14 15:43:17] [INFO ] Deduced a trap composed of 116 places in 197 ms of which 1 ms to minimize.
[2022-05-14 15:43:17] [INFO ] Deduced a trap composed of 111 places in 127 ms of which 1 ms to minimize.
[2022-05-14 15:43:17] [INFO ] Deduced a trap composed of 124 places in 128 ms of which 0 ms to minimize.
[2022-05-14 15:43:17] [INFO ] Deduced a trap composed of 112 places in 128 ms of which 0 ms to minimize.
[2022-05-14 15:43:17] [INFO ] Deduced a trap composed of 114 places in 131 ms of which 1 ms to minimize.
[2022-05-14 15:43:17] [INFO ] Deduced a trap composed of 115 places in 115 ms of which 0 ms to minimize.
[2022-05-14 15:43:17] [INFO ] Deduced a trap composed of 123 places in 122 ms of which 0 ms to minimize.
[2022-05-14 15:43:18] [INFO ] Deduced a trap composed of 115 places in 112 ms of which 2 ms to minimize.
[2022-05-14 15:43:18] [INFO ] Deduced a trap composed of 116 places in 108 ms of which 0 ms to minimize.
[2022-05-14 15:43:18] [INFO ] Deduced a trap composed of 13 places in 112 ms of which 1 ms to minimize.
[2022-05-14 15:43:18] [INFO ] Deduced a trap composed of 110 places in 119 ms of which 0 ms to minimize.
[2022-05-14 15:43:18] [INFO ] Deduced a trap composed of 107 places in 122 ms of which 0 ms to minimize.
[2022-05-14 15:43:18] [INFO ] Deduced a trap composed of 111 places in 101 ms of which 1 ms to minimize.
[2022-05-14 15:43:18] [INFO ] Deduced a trap composed of 113 places in 103 ms of which 0 ms to minimize.
[2022-05-14 15:43:19] [INFO ] Deduced a trap composed of 117 places in 110 ms of which 0 ms to minimize.
[2022-05-14 15:43:19] [INFO ] Deduced a trap composed of 112 places in 108 ms of which 1 ms to minimize.
[2022-05-14 15:43:19] [INFO ] Deduced a trap composed of 118 places in 103 ms of which 0 ms to minimize.
[2022-05-14 15:43:19] [INFO ] Deduced a trap composed of 122 places in 102 ms of which 1 ms to minimize.
[2022-05-14 15:43:19] [INFO ] Deduced a trap composed of 120 places in 104 ms of which 1 ms to minimize.
[2022-05-14 15:43:19] [INFO ] Deduced a trap composed of 126 places in 104 ms of which 0 ms to minimize.
[2022-05-14 15:43:19] [INFO ] Deduced a trap composed of 113 places in 104 ms of which 1 ms to minimize.
[2022-05-14 15:43:19] [INFO ] Deduced a trap composed of 127 places in 98 ms of which 0 ms to minimize.
[2022-05-14 15:43:20] [INFO ] Deduced a trap composed of 124 places in 107 ms of which 1 ms to minimize.
[2022-05-14 15:43:20] [INFO ] Deduced a trap composed of 108 places in 107 ms of which 0 ms to minimize.
[2022-05-14 15:43:20] [INFO ] Deduced a trap composed of 120 places in 105 ms of which 0 ms to minimize.
[2022-05-14 15:43:20] [INFO ] Deduced a trap composed of 119 places in 110 ms of which 1 ms to minimize.
[2022-05-14 15:43:20] [INFO ] Deduced a trap composed of 104 places in 109 ms of which 3 ms to minimize.
[2022-05-14 15:43:20] [INFO ] Deduced a trap composed of 111 places in 100 ms of which 1 ms to minimize.
[2022-05-14 15:43:20] [INFO ] Deduced a trap composed of 115 places in 107 ms of which 0 ms to minimize.
[2022-05-14 15:43:20] [INFO ] Deduced a trap composed of 113 places in 102 ms of which 0 ms to minimize.
[2022-05-14 15:43:21] [INFO ] Deduced a trap composed of 114 places in 103 ms of which 1 ms to minimize.
[2022-05-14 15:43:21] [INFO ] Deduced a trap composed of 123 places in 104 ms of which 1 ms to minimize.
[2022-05-14 15:43:21] [INFO ] Deduced a trap composed of 114 places in 110 ms of which 1 ms to minimize.
[2022-05-14 15:43:21] [INFO ] Deduced a trap composed of 114 places in 104 ms of which 1 ms to minimize.
[2022-05-14 15:43:21] [INFO ] Deduced a trap composed of 113 places in 108 ms of which 0 ms to minimize.
[2022-05-14 15:43:21] [INFO ] Deduced a trap composed of 116 places in 103 ms of which 1 ms to minimize.
[2022-05-14 15:43:21] [INFO ] Deduced a trap composed of 131 places in 101 ms of which 0 ms to minimize.
[2022-05-14 15:43:22] [INFO ] Deduced a trap composed of 129 places in 104 ms of which 1 ms to minimize.
[2022-05-14 15:43:22] [INFO ] Deduced a trap composed of 115 places in 109 ms of which 1 ms to minimize.
[2022-05-14 15:43:22] [INFO ] Deduced a trap composed of 123 places in 102 ms of which 1 ms to minimize.
[2022-05-14 15:43:22] [INFO ] Deduced a trap composed of 140 places in 100 ms of which 1 ms to minimize.
[2022-05-14 15:43:22] [INFO ] Deduced a trap composed of 131 places in 106 ms of which 0 ms to minimize.
[2022-05-14 15:43:22] [INFO ] Deduced a trap composed of 121 places in 124 ms of which 0 ms to minimize.
[2022-05-14 15:43:22] [INFO ] Deduced a trap composed of 116 places in 106 ms of which 4 ms to minimize.
[2022-05-14 15:43:22] [INFO ] Deduced a trap composed of 127 places in 107 ms of which 1 ms to minimize.
[2022-05-14 15:43:23] [INFO ] Deduced a trap composed of 121 places in 105 ms of which 2 ms to minimize.
[2022-05-14 15:43:23] [INFO ] Deduced a trap composed of 12 places in 114 ms of which 1 ms to minimize.
[2022-05-14 15:43:23] [INFO ] Deduced a trap composed of 8 places in 107 ms of which 1 ms to minimize.
[2022-05-14 15:43:23] [INFO ] Deduced a trap composed of 21 places in 109 ms of which 0 ms to minimize.
[2022-05-14 15:43:23] [INFO ] Deduced a trap composed of 112 places in 115 ms of which 0 ms to minimize.
[2022-05-14 15:43:23] [INFO ] Deduced a trap composed of 16 places in 110 ms of which 0 ms to minimize.
[2022-05-14 15:43:23] [INFO ] Deduced a trap composed of 28 places in 113 ms of which 1 ms to minimize.
[2022-05-14 15:43:24] [INFO ] Deduced a trap composed of 118 places in 109 ms of which 1 ms to minimize.
[2022-05-14 15:43:24] [INFO ] Deduced a trap composed of 26 places in 110 ms of which 2 ms to minimize.
[2022-05-14 15:43:24] [INFO ] Deduced a trap composed of 34 places in 104 ms of which 0 ms to minimize.
[2022-05-14 15:43:24] [INFO ] Deduced a trap composed of 26 places in 113 ms of which 3 ms to minimize.
[2022-05-14 15:43:24] [INFO ] Deduced a trap composed of 30 places in 112 ms of which 2 ms to minimize.
[2022-05-14 15:43:24] [INFO ] Deduced a trap composed of 132 places in 108 ms of which 0 ms to minimize.
[2022-05-14 15:43:24] [INFO ] Deduced a trap composed of 128 places in 113 ms of which 0 ms to minimize.
[2022-05-14 15:43:25] [INFO ] Deduced a trap composed of 117 places in 108 ms of which 0 ms to minimize.
[2022-05-14 15:43:25] [INFO ] Deduced a trap composed of 117 places in 108 ms of which 0 ms to minimize.
[2022-05-14 15:43:25] [INFO ] Deduced a trap composed of 109 places in 105 ms of which 0 ms to minimize.
[2022-05-14 15:43:25] [INFO ] Deduced a trap composed of 22 places in 105 ms of which 0 ms to minimize.
[2022-05-14 15:43:25] [INFO ] Deduced a trap composed of 110 places in 108 ms of which 1 ms to minimize.
[2022-05-14 15:43:25] [INFO ] Deduced a trap composed of 115 places in 107 ms of which 0 ms to minimize.
[2022-05-14 15:43:25] [INFO ] Deduced a trap composed of 111 places in 102 ms of which 1 ms to minimize.
[2022-05-14 15:43:25] [INFO ] Deduced a trap composed of 22 places in 104 ms of which 1 ms to minimize.
[2022-05-14 15:43:26] [INFO ] Deduced a trap composed of 21 places in 106 ms of which 0 ms to minimize.
[2022-05-14 15:43:26] [INFO ] Deduced a trap composed of 32 places in 35 ms of which 0 ms to minimize.
[2022-05-14 15:43:26] [INFO ] Trap strengthening (SAT) tested/added 77/76 trap constraints in 10444 ms
[2022-05-14 15:43:26] [INFO ] Deduced a trap composed of 14 places in 48 ms of which 0 ms to minimize.
[2022-05-14 15:43:26] [INFO ] Deduced a trap composed of 38 places in 49 ms of which 0 ms to minimize.
[2022-05-14 15:43:26] [INFO ] Deduced a trap composed of 31 places in 46 ms of which 0 ms to minimize.
[2022-05-14 15:43:26] [INFO ] Deduced a trap composed of 33 places in 46 ms of which 0 ms to minimize.
[2022-05-14 15:43:26] [INFO ] Deduced a trap composed of 15 places in 45 ms of which 0 ms to minimize.
[2022-05-14 15:43:26] [INFO ] Deduced a trap composed of 24 places in 49 ms of which 0 ms to minimize.
[2022-05-14 15:43:26] [INFO ] Deduced a trap composed of 27 places in 39 ms of which 0 ms to minimize.
[2022-05-14 15:43:26] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 485 ms
[2022-05-14 15:43:27] [INFO ] Deduced a trap composed of 113 places in 131 ms of which 0 ms to minimize.
[2022-05-14 15:43:27] [INFO ] Deduced a trap composed of 128 places in 111 ms of which 1 ms to minimize.
[2022-05-14 15:43:27] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 310 ms
[2022-05-14 15:43:27] [INFO ] Deduced a trap composed of 26 places in 45 ms of which 1 ms to minimize.
[2022-05-14 15:43:27] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 86 ms
[2022-05-14 15:43:27] [INFO ] Deduced a trap composed of 113 places in 108 ms of which 1 ms to minimize.
[2022-05-14 15:43:27] [INFO ] Deduced a trap composed of 118 places in 108 ms of which 1 ms to minimize.
[2022-05-14 15:43:27] [INFO ] Deduced a trap composed of 122 places in 102 ms of which 0 ms to minimize.
[2022-05-14 15:43:28] [INFO ] Deduced a trap composed of 122 places in 103 ms of which 1 ms to minimize.
[2022-05-14 15:43:28] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 543 ms
[2022-05-14 15:43:28] [INFO ] Deduced a trap composed of 111 places in 109 ms of which 1 ms to minimize.
[2022-05-14 15:43:28] [INFO ] Deduced a trap composed of 116 places in 109 ms of which 0 ms to minimize.
[2022-05-14 15:43:29] [INFO ] Deduced a trap composed of 112 places in 107 ms of which 1 ms to minimize.
[2022-05-14 15:43:29] [INFO ] Deduced a trap composed of 119 places in 103 ms of which 0 ms to minimize.
[2022-05-14 15:43:29] [INFO ] Deduced a trap composed of 129 places in 111 ms of which 0 ms to minimize.
[2022-05-14 15:43:29] [INFO ] Deduced a trap composed of 44 places in 105 ms of which 0 ms to minimize.
[2022-05-14 15:43:29] [INFO ] Deduced a trap composed of 118 places in 111 ms of which 1 ms to minimize.
[2022-05-14 15:43:29] [INFO ] Deduced a trap composed of 129 places in 103 ms of which 0 ms to minimize.
[2022-05-14 15:43:29] [INFO ] Deduced a trap composed of 114 places in 104 ms of which 1 ms to minimize.
[2022-05-14 15:43:29] [INFO ] Deduced a trap composed of 108 places in 102 ms of which 1 ms to minimize.
[2022-05-14 15:43:29] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 1372 ms
[2022-05-14 15:43:30] [INFO ] Deduced a trap composed of 26 places in 41 ms of which 0 ms to minimize.
[2022-05-14 15:43:30] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 90 ms
[2022-05-14 15:43:30] [INFO ] Deduced a trap composed of 119 places in 97 ms of which 0 ms to minimize.
[2022-05-14 15:43:30] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 155 ms
[2022-05-14 15:43:31] [INFO ] Deduced a trap composed of 108 places in 103 ms of which 1 ms to minimize.
[2022-05-14 15:43:31] [INFO ] Deduced a trap composed of 114 places in 116 ms of which 0 ms to minimize.
[2022-05-14 15:43:31] [INFO ] Deduced a trap composed of 119 places in 101 ms of which 0 ms to minimize.
[2022-05-14 15:43:31] [INFO ] Deduced a trap composed of 121 places in 109 ms of which 0 ms to minimize.
[2022-05-14 15:43:31] [INFO ] Deduced a trap composed of 139 places in 97 ms of which 1 ms to minimize.
[2022-05-14 15:43:31] [INFO ] Deduced a trap composed of 121 places in 102 ms of which 0 ms to minimize.
[2022-05-14 15:43:31] [INFO ] Deduced a trap composed of 124 places in 93 ms of which 0 ms to minimize.
[2022-05-14 15:43:31] [INFO ] Deduced a trap composed of 129 places in 99 ms of which 0 ms to minimize.
[2022-05-14 15:43:32] [INFO ] Deduced a trap composed of 124 places in 93 ms of which 1 ms to minimize.
[2022-05-14 15:43:32] [INFO ] Deduced a trap composed of 114 places in 94 ms of which 0 ms to minimize.
[2022-05-14 15:43:32] [INFO ] Deduced a trap composed of 113 places in 93 ms of which 1 ms to minimize.
[2022-05-14 15:43:32] [INFO ] Deduced a trap composed of 125 places in 98 ms of which 1 ms to minimize.
[2022-05-14 15:43:32] [INFO ] Deduced a trap composed of 127 places in 96 ms of which 0 ms to minimize.
[2022-05-14 15:43:32] [INFO ] Deduced a trap composed of 131 places in 115 ms of which 0 ms to minimize.
[2022-05-14 15:43:32] [INFO ] Deduced a trap composed of 127 places in 101 ms of which 0 ms to minimize.
[2022-05-14 15:43:32] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2022-05-14 15:43:32] [INFO ] After 25076ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:115
Fused 115 Parikh solutions to 112 different solutions.
Parikh walk visited 65 properties in 7986 ms.
Support contains 50 out of 512 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 512/512 places, 464/464 transitions.
Graph (complete) has 1063 edges and 512 vertex of which 510 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.4 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 92 transitions
Trivial Post-agglo rules discarded 92 transitions
Performed 92 trivial Post agglomeration. Transition count delta: 92
Iterating post reduction 0 with 93 rules applied. Total rules applied 94 place count 510 transition count 370
Reduce places removed 92 places and 0 transitions.
Iterating post reduction 1 with 92 rules applied. Total rules applied 186 place count 418 transition count 370
Performed 65 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 65 Pre rules applied. Total rules applied 186 place count 418 transition count 305
Deduced a syphon composed of 65 places in 3 ms
Ensure Unique test removed 11 places
Reduce places removed 76 places and 0 transitions.
Iterating global reduction 2 with 141 rules applied. Total rules applied 327 place count 342 transition count 305
Discarding 48 places :
Symmetric choice reduction at 2 with 48 rule applications. Total rules 375 place count 294 transition count 257
Iterating global reduction 2 with 48 rules applied. Total rules applied 423 place count 294 transition count 257
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 423 place count 294 transition count 252
Deduced a syphon composed of 5 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 11 rules applied. Total rules applied 434 place count 288 transition count 252
Performed 85 Post agglomeration using F-continuation condition.Transition count delta: 85
Deduced a syphon composed of 85 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 88 places and 0 transitions.
Iterating global reduction 2 with 173 rules applied. Total rules applied 607 place count 200 transition count 167
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 609 place count 199 transition count 170
Free-agglomeration rule applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 611 place count 199 transition count 168
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 613 place count 197 transition count 168
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 614 place count 197 transition count 168
Applied a total of 614 rules in 122 ms. Remains 197 /512 variables (removed 315) and now considering 168/464 (removed 296) transitions.
Finished structural reductions, in 1 iterations. Remains : 197/512 places, 168/464 transitions.
Finished random walk after 5698 steps, including 221 resets, run visited all 50 properties in 112 ms. (steps per millisecond=50 )
Able to resolve query StableMarking after proving 358 properties.
FORMULA StableMarking FALSE TECHNIQUES RANDOM_WALK PROBABILISTIC_WALK PARIKH_WALK MARKED_SUFFIX_TEST TRIVIAL_UNMARKED_SCC_TEST TOPOLOGICAL
Total runtime 37222 ms.

BK_STOP 1652543021195

--------------------
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-10"
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-10, 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-165252016300248"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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