Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2023-input.r064-tajo-167813712100313.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2023-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
....................
=====================================================================
Generated by BenchKit 2-5348
Executing tool gold2022
Input is BusinessProcesses-PT-07, examination is StableMarking
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r064-tajo-167813712100313
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 532K
-rw-r--r-- 1 mcc users 8.4K Feb 25 16:44 CTLCardinality.txt
-rw-r--r-- 1 mcc users 96K Feb 25 16:44 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.5K Feb 25 16:42 CTLFireability.txt
-rw-r--r-- 1 mcc users 39K Feb 25 16:42 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.8K Feb 25 15:38 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 15:38 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 15:38 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 15:38 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.9K Feb 25 16:44 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 106K Feb 25 16:44 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.4K Feb 25 16:44 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 62K Feb 25 16:44 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 15:38 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 15:38 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 100K 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

FORMULA_NAME StableMarking

=== Now, execution of the tool begins

BK_START 1678218587912

Running Version 202205111006
[2023-03-07 19:49:49] [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]
[2023-03-07 19:49:49] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-07 19:49:49] [INFO ] Load time of PNML (sax parser for PT used): 122 ms
[2023-03-07 19:49:49] [INFO ] Transformed 386 places.
[2023-03-07 19:49:49] [INFO ] Transformed 360 transitions.
[2023-03-07 19:49:49] [INFO ] Found NUPN structural information;
[2023-03-07 19:49:49] [INFO ] Parsed PT model containing 386 places and 360 transitions in 252 ms.
Graph (trivial) has 217 edges and 386 vertex of which 7 / 386 are part of one of the 1 SCC in 5 ms
Free SCC test removed 6 places
Structural test allowed to assert that 118 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 124 resets, run finished after 697 ms. (steps per millisecond=14 ) properties (out of 268) seen :112
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 156) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=16 ) properties (out of 156) 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 156) 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 156) 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 156) 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 156) 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 156) 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 156) 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 156) 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 156) 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 156) 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 156) 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 156) 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 156) 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 156) 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 156) 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 156) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=25 ) properties (out of 156) 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 156) 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 156) 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 156) 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 156) 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 156) 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 156) 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 156) 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 156) 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 156) 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 156) 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 156) 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 156) 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 156) 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 156) 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 156) 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 156) 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 156) 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 156) 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 156) 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 156) 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 156) 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 156) 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 156) 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 156) 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 156) 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 156) 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 156) 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 156) 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 156) 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 156) 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 156) 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 156) seen :0
Running SMT prover for 156 properties.
// Phase 1: matrix 353 rows 380 cols
[2023-03-07 19:49:50] [INFO ] Computed 62 place invariants in 29 ms
[2023-03-07 19:49:51] [INFO ] After 1186ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:156
[2023-03-07 19:49:52] [INFO ] [Nat]Absence check using 33 positive place invariants in 13 ms returned sat
[2023-03-07 19:49:52] [INFO ] [Nat]Absence check using 33 positive and 29 generalized place invariants in 12 ms returned sat
[2023-03-07 19:49:55] [INFO ] After 1828ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :156
[2023-03-07 19:49:55] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-07 19:49:57] [INFO ] After 1916ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :156
[2023-03-07 19:49:57] [INFO ] Deduced a trap composed of 17 places in 61 ms of which 6 ms to minimize.
[2023-03-07 19:49:57] [INFO ] Deduced a trap composed of 14 places in 44 ms of which 0 ms to minimize.
[2023-03-07 19:49:57] [INFO ] Deduced a trap composed of 18 places in 34 ms of which 2 ms to minimize.
[2023-03-07 19:49:57] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 198 ms
[2023-03-07 19:49:57] [INFO ] Deduced a trap composed of 87 places in 104 ms of which 2 ms to minimize.
[2023-03-07 19:49:57] [INFO ] Deduced a trap composed of 97 places in 138 ms of which 1 ms to minimize.
[2023-03-07 19:49:57] [INFO ] Deduced a trap composed of 94 places in 106 ms of which 1 ms to minimize.
[2023-03-07 19:49:57] [INFO ] Deduced a trap composed of 98 places in 103 ms of which 0 ms to minimize.
[2023-03-07 19:49:58] [INFO ] Deduced a trap composed of 91 places in 91 ms of which 1 ms to minimize.
[2023-03-07 19:49:58] [INFO ] Deduced a trap composed of 88 places in 127 ms of which 0 ms to minimize.
[2023-03-07 19:49:58] [INFO ] Deduced a trap composed of 93 places in 72 ms of which 1 ms to minimize.
[2023-03-07 19:49:58] [INFO ] Deduced a trap composed of 88 places in 111 ms of which 0 ms to minimize.
[2023-03-07 19:49:58] [INFO ] Deduced a trap composed of 9 places in 122 ms of which 1 ms to minimize.
[2023-03-07 19:49:58] [INFO ] Deduced a trap composed of 8 places in 113 ms of which 0 ms to minimize.
[2023-03-07 19:49:58] [INFO ] Deduced a trap composed of 77 places in 122 ms of which 0 ms to minimize.
[2023-03-07 19:49:59] [INFO ] Deduced a trap composed of 11 places in 137 ms of which 1 ms to minimize.
[2023-03-07 19:49:59] [INFO ] Deduced a trap composed of 22 places in 64 ms of which 1 ms to minimize.
[2023-03-07 19:49:59] [INFO ] Deduced a trap composed of 21 places in 57 ms of which 0 ms to minimize.
[2023-03-07 19:49:59] [INFO ] Deduced a trap composed of 24 places in 50 ms of which 1 ms to minimize.
[2023-03-07 19:49:59] [INFO ] Deduced a trap composed of 28 places in 42 ms of which 1 ms to minimize.
[2023-03-07 19:49:59] [INFO ] Deduced a trap composed of 28 places in 43 ms of which 1 ms to minimize.
[2023-03-07 19:49:59] [INFO ] Deduced a trap composed of 29 places in 42 ms of which 1 ms to minimize.
[2023-03-07 19:49:59] [INFO ] Trap strengthening (SAT) tested/added 19/18 trap constraints in 2023 ms
[2023-03-07 19:49:59] [INFO ] Deduced a trap composed of 13 places in 54 ms of which 1 ms to minimize.
[2023-03-07 19:49:59] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 90 ms
[2023-03-07 19:50:00] [INFO ] Deduced a trap composed of 44 places in 68 ms of which 1 ms to minimize.
[2023-03-07 19:50:00] [INFO ] Deduced a trap composed of 42 places in 55 ms of which 1 ms to minimize.
[2023-03-07 19:50:00] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 183 ms
[2023-03-07 19:50:00] [INFO ] Deduced a trap composed of 102 places in 104 ms of which 0 ms to minimize.
[2023-03-07 19:50:00] [INFO ] Deduced a trap composed of 96 places in 101 ms of which 1 ms to minimize.
[2023-03-07 19:50:00] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 268 ms
[2023-03-07 19:50:00] [INFO ] Deduced a trap composed of 86 places in 141 ms of which 0 ms to minimize.
[2023-03-07 19:50:00] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 176 ms
[2023-03-07 19:50:00] [INFO ] Deduced a trap composed of 79 places in 103 ms of which 0 ms to minimize.
[2023-03-07 19:50:01] [INFO ] Deduced a trap composed of 78 places in 107 ms of which 0 ms to minimize.
[2023-03-07 19:50:01] [INFO ] Deduced a trap composed of 94 places in 87 ms of which 0 ms to minimize.
[2023-03-07 19:50:01] [INFO ] Deduced a trap composed of 80 places in 85 ms of which 1 ms to minimize.
[2023-03-07 19:50:01] [INFO ] Deduced a trap composed of 76 places in 110 ms of which 0 ms to minimize.
[2023-03-07 19:50:01] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 612 ms
[2023-03-07 19:50:02] [INFO ] Deduced a trap composed of 96 places in 109 ms of which 1 ms to minimize.
[2023-03-07 19:50:02] [INFO ] Deduced a trap composed of 79 places in 92 ms of which 1 ms to minimize.
[2023-03-07 19:50:02] [INFO ] Deduced a trap composed of 82 places in 85 ms of which 6 ms to minimize.
[2023-03-07 19:50:02] [INFO ] Deduced a trap composed of 104 places in 121 ms of which 1 ms to minimize.
[2023-03-07 19:50:02] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 503 ms
[2023-03-07 19:50:03] [INFO ] Deduced a trap composed of 48 places in 147 ms of which 1 ms to minimize.
[2023-03-07 19:50:03] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 176 ms
[2023-03-07 19:50:03] [INFO ] Deduced a trap composed of 89 places in 95 ms of which 0 ms to minimize.
[2023-03-07 19:50:03] [INFO ] Deduced a trap composed of 85 places in 98 ms of which 1 ms to minimize.
[2023-03-07 19:50:03] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 262 ms
[2023-03-07 19:50:04] [INFO ] Deduced a trap composed of 89 places in 101 ms of which 1 ms to minimize.
[2023-03-07 19:50:04] [INFO ] Deduced a trap composed of 46 places in 149 ms of which 1 ms to minimize.
[2023-03-07 19:50:04] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 320 ms
[2023-03-07 19:50:04] [INFO ] Deduced a trap composed of 92 places in 139 ms of which 1 ms to minimize.
[2023-03-07 19:50:04] [INFO ] Deduced a trap composed of 87 places in 133 ms of which 0 ms to minimize.
[2023-03-07 19:50:04] [INFO ] Deduced a trap composed of 100 places in 111 ms of which 2 ms to minimize.
[2023-03-07 19:50:04] [INFO ] Deduced a trap composed of 92 places in 103 ms of which 0 ms to minimize.
[2023-03-07 19:50:05] [INFO ] Deduced a trap composed of 86 places in 90 ms of which 0 ms to minimize.
[2023-03-07 19:50:05] [INFO ] Deduced a trap composed of 91 places in 89 ms of which 0 ms to minimize.
[2023-03-07 19:50:05] [INFO ] Deduced a trap composed of 95 places in 121 ms of which 1 ms to minimize.
[2023-03-07 19:50:05] [INFO ] Deduced a trap composed of 85 places in 92 ms of which 0 ms to minimize.
[2023-03-07 19:50:05] [INFO ] Deduced a trap composed of 79 places in 106 ms of which 1 ms to minimize.
[2023-03-07 19:50:05] [INFO ] Deduced a trap composed of 84 places in 95 ms of which 1 ms to minimize.
[2023-03-07 19:50:05] [INFO ] Deduced a trap composed of 85 places in 118 ms of which 1 ms to minimize.
[2023-03-07 19:50:05] [INFO ] Deduced a trap composed of 88 places in 79 ms of which 1 ms to minimize.
[2023-03-07 19:50:06] [INFO ] Deduced a trap composed of 92 places in 105 ms of which 1 ms to minimize.
[2023-03-07 19:50:06] [INFO ] Deduced a trap composed of 12 places in 174 ms of which 1 ms to minimize.
[2023-03-07 19:50:06] [INFO ] Deduced a trap composed of 38 places in 132 ms of which 0 ms to minimize.
[2023-03-07 19:50:06] [INFO ] Deduced a trap composed of 37 places in 145 ms of which 4 ms to minimize.
[2023-03-07 19:50:06] [INFO ] Deduced a trap composed of 44 places in 165 ms of which 1 ms to minimize.
[2023-03-07 19:50:07] [INFO ] Deduced a trap composed of 43 places in 116 ms of which 1 ms to minimize.
[2023-03-07 19:50:07] [INFO ] Deduced a trap composed of 22 places in 148 ms of which 0 ms to minimize.
[2023-03-07 19:50:07] [INFO ] Deduced a trap composed of 24 places in 135 ms of which 1 ms to minimize.
[2023-03-07 19:50:07] [INFO ] Deduced a trap composed of 19 places in 133 ms of which 0 ms to minimize.
[2023-03-07 19:50:07] [INFO ] Deduced a trap composed of 85 places in 150 ms of which 1 ms to minimize.
[2023-03-07 19:50:07] [INFO ] Deduced a trap composed of 93 places in 130 ms of which 1 ms to minimize.
[2023-03-07 19:50:07] [INFO ] Deduced a trap composed of 94 places in 101 ms of which 0 ms to minimize.
[2023-03-07 19:50:08] [INFO ] Deduced a trap composed of 70 places in 142 ms of which 1 ms to minimize.
[2023-03-07 19:50:08] [INFO ] Deduced a trap composed of 93 places in 134 ms of which 1 ms to minimize.
[2023-03-07 19:50:08] [INFO ] Deduced a trap composed of 102 places in 114 ms of which 0 ms to minimize.
[2023-03-07 19:50:08] [INFO ] Deduced a trap composed of 92 places in 113 ms of which 1 ms to minimize.
[2023-03-07 19:50:08] [INFO ] Deduced a trap composed of 22 places in 137 ms of which 0 ms to minimize.
[2023-03-07 19:50:08] [INFO ] Deduced a trap composed of 29 places in 108 ms of which 1 ms to minimize.
[2023-03-07 19:50:08] [INFO ] Deduced a trap composed of 96 places in 100 ms of which 0 ms to minimize.
[2023-03-07 19:50:09] [INFO ] Deduced a trap composed of 19 places in 99 ms of which 1 ms to minimize.
[2023-03-07 19:50:09] [INFO ] Deduced a trap composed of 26 places in 98 ms of which 1 ms to minimize.
[2023-03-07 19:50:09] [INFO ] Deduced a trap composed of 25 places in 98 ms of which 1 ms to minimize.
[2023-03-07 19:50:09] [INFO ] Deduced a trap composed of 8 places in 98 ms of which 1 ms to minimize.
[2023-03-07 19:50:09] [INFO ] Deduced a trap composed of 91 places in 97 ms of which 0 ms to minimize.
[2023-03-07 19:50:09] [INFO ] Deduced a trap composed of 22 places in 85 ms of which 1 ms to minimize.
[2023-03-07 19:50:09] [INFO ] Deduced a trap composed of 91 places in 95 ms of which 0 ms to minimize.
[2023-03-07 19:50:09] [INFO ] Deduced a trap composed of 90 places in 118 ms of which 0 ms to minimize.
[2023-03-07 19:50:10] [INFO ] Deduced a trap composed of 27 places in 102 ms of which 1 ms to minimize.
[2023-03-07 19:50:10] [INFO ] Deduced a trap composed of 106 places in 90 ms of which 0 ms to minimize.
[2023-03-07 19:50:10] [INFO ] Deduced a trap composed of 87 places in 113 ms of which 1 ms to minimize.
[2023-03-07 19:50:10] [INFO ] Deduced a trap composed of 90 places in 134 ms of which 1 ms to minimize.
[2023-03-07 19:50:10] [INFO ] Deduced a trap composed of 80 places in 107 ms of which 0 ms to minimize.
[2023-03-07 19:50:10] [INFO ] Deduced a trap composed of 83 places in 146 ms of which 1 ms to minimize.
[2023-03-07 19:50:10] [INFO ] Deduced a trap composed of 89 places in 112 ms of which 1 ms to minimize.
[2023-03-07 19:50:11] [INFO ] Deduced a trap composed of 23 places in 121 ms of which 0 ms to minimize.
[2023-03-07 19:50:11] [INFO ] Deduced a trap composed of 97 places in 140 ms of which 0 ms to minimize.
[2023-03-07 19:50:11] [INFO ] Deduced a trap composed of 26 places in 119 ms of which 1 ms to minimize.
[2023-03-07 19:50:11] [INFO ] Deduced a trap composed of 100 places in 114 ms of which 0 ms to minimize.
[2023-03-07 19:50:11] [INFO ] Deduced a trap composed of 98 places in 128 ms of which 0 ms to minimize.
[2023-03-07 19:50:11] [INFO ] Deduced a trap composed of 81 places in 115 ms of which 1 ms to minimize.
[2023-03-07 19:50:11] [INFO ] Deduced a trap composed of 85 places in 104 ms of which 0 ms to minimize.
[2023-03-07 19:50:12] [INFO ] Deduced a trap composed of 97 places in 98 ms of which 0 ms to minimize.
[2023-03-07 19:50:12] [INFO ] Deduced a trap composed of 102 places in 117 ms of which 0 ms to minimize.
[2023-03-07 19:50:12] [INFO ] Deduced a trap composed of 104 places in 99 ms of which 0 ms to minimize.
[2023-03-07 19:50:12] [INFO ] Deduced a trap composed of 106 places in 110 ms of which 0 ms to minimize.
[2023-03-07 19:50:12] [INFO ] Deduced a trap composed of 20 places in 147 ms of which 0 ms to minimize.
[2023-03-07 19:50:12] [INFO ] Deduced a trap composed of 76 places in 107 ms of which 0 ms to minimize.
[2023-03-07 19:50:13] [INFO ] Deduced a trap composed of 78 places in 140 ms of which 0 ms to minimize.
[2023-03-07 19:50:13] [INFO ] Deduced a trap composed of 82 places in 134 ms of which 0 ms to minimize.
[2023-03-07 19:50:13] [INFO ] Deduced a trap composed of 98 places in 152 ms of which 0 ms to minimize.
[2023-03-07 19:50:14] [INFO ] Deduced a trap composed of 11 places in 123 ms of which 1 ms to minimize.
[2023-03-07 19:50:14] [INFO ] Deduced a trap composed of 46 places in 108 ms of which 1 ms to minimize.
[2023-03-07 19:50:14] [INFO ] Deduced a trap composed of 98 places in 121 ms of which 1 ms to minimize.
[2023-03-07 19:50:14] [INFO ] Deduced a trap composed of 109 places in 118 ms of which 1 ms to minimize.
[2023-03-07 19:50:14] [INFO ] Deduced a trap composed of 88 places in 115 ms of which 1 ms to minimize.
[2023-03-07 19:50:14] [INFO ] Deduced a trap composed of 88 places in 118 ms of which 1 ms to minimize.
[2023-03-07 19:50:14] [INFO ] Deduced a trap composed of 94 places in 104 ms of which 1 ms to minimize.
[2023-03-07 19:50:14] [INFO ] Deduced a trap composed of 88 places in 101 ms of which 1 ms to minimize.
[2023-03-07 19:50:15] [INFO ] Deduced a trap composed of 77 places in 104 ms of which 0 ms to minimize.
[2023-03-07 19:50:15] [INFO ] Deduced a trap composed of 80 places in 129 ms of which 0 ms to minimize.
[2023-03-07 19:50:15] [INFO ] Deduced a trap composed of 95 places in 158 ms of which 0 ms to minimize.
[2023-03-07 19:50:15] [INFO ] Deduced a trap composed of 101 places in 109 ms of which 1 ms to minimize.
[2023-03-07 19:50:15] [INFO ] Deduced a trap composed of 80 places in 122 ms of which 1 ms to minimize.
[2023-03-07 19:50:15] [INFO ] Deduced a trap composed of 108 places in 140 ms of which 0 ms to minimize.
[2023-03-07 19:50:16] [INFO ] Deduced a trap composed of 16 places in 92 ms of which 1 ms to minimize.
[2023-03-07 19:50:16] [INFO ] Deduced a trap composed of 20 places in 73 ms of which 1 ms to minimize.
[2023-03-07 19:50:16] [INFO ] Deduced a trap composed of 28 places in 60 ms of which 0 ms to minimize.
[2023-03-07 19:50:16] [INFO ] Deduced a trap composed of 28 places in 53 ms of which 1 ms to minimize.
[2023-03-07 19:50:16] [INFO ] Deduced a trap composed of 27 places in 53 ms of which 1 ms to minimize.
[2023-03-07 19:50:16] [INFO ] Trap strengthening (SAT) tested/added 82/81 trap constraints in 12139 ms
[2023-03-07 19:50:16] [INFO ] Deduced a trap composed of 98 places in 125 ms of which 0 ms to minimize.
[2023-03-07 19:50:16] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-07 19:50:16] [INFO ] After 25090ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:156
Fused 156 Parikh solutions to 150 different solutions.
Parikh walk visited 88 properties in 10114 ms.
Support contains 68 out of 380 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 380/380 places, 353/353 transitions.
Graph (complete) has 805 edges and 380 vertex of which 378 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.8 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 62 transitions
Trivial Post-agglo rules discarded 62 transitions
Performed 62 trivial Post agglomeration. Transition count delta: 62
Iterating post reduction 0 with 63 rules applied. Total rules applied 64 place count 378 transition count 289
Reduce places removed 62 places and 0 transitions.
Iterating post reduction 1 with 62 rules applied. Total rules applied 126 place count 316 transition count 289
Performed 45 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 45 Pre rules applied. Total rules applied 126 place count 316 transition count 244
Deduced a syphon composed of 45 places in 1 ms
Ensure Unique test removed 8 places
Reduce places removed 53 places and 0 transitions.
Iterating global reduction 2 with 98 rules applied. Total rules applied 224 place count 263 transition count 244
Discarding 27 places :
Symmetric choice reduction at 2 with 27 rule applications. Total rules 251 place count 236 transition count 217
Iterating global reduction 2 with 27 rules applied. Total rules applied 278 place count 236 transition count 217
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 278 place count 236 transition count 214
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 284 place count 233 transition count 214
Performed 59 Post agglomeration using F-continuation condition.Transition count delta: 59
Deduced a syphon composed of 59 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 61 places and 0 transitions.
Iterating global reduction 2 with 120 rules applied. Total rules applied 404 place count 172 transition count 155
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 406 place count 171 transition count 158
Free-agglomeration rule applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 408 place count 171 transition count 156
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 410 place count 169 transition count 156
Partial Free-agglomeration rule applied 4 times.
Drop transitions removed 4 transitions
Iterating global reduction 3 with 4 rules applied. Total rules applied 414 place count 169 transition count 156
Applied a total of 414 rules in 101 ms. Remains 169 /380 variables (removed 211) and now considering 156/353 (removed 197) transitions.
Finished structural reductions, in 1 iterations. Remains : 169/380 places, 156/353 transitions.
Finished random walk after 13527 steps, including 677 resets, run visited all 68 properties in 469 ms. (steps per millisecond=28 )
Able to resolve query StableMarking after proving 270 properties.
FORMULA StableMarking FALSE TECHNIQUES RANDOM_WALK PARIKH_WALK MARKED_SUFFIX_TEST TRIVIAL_UNMARKED_SCC_TEST TOPOLOGICAL
Total runtime 38276 ms.

BK_STOP 1678218627575

--------------------
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-07"
export BK_EXAMINATION="StableMarking"
export BK_TOOL="gold2022"
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-5348"
echo " Executing tool gold2022"
echo " Input is BusinessProcesses-PT-07, 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 r064-tajo-167813712100313"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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