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-167813712100323.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-09, examination is StableMarking
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r064-tajo-167813712100323
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 536K
-rw-r--r-- 1 mcc users 6.8K Feb 25 16:48 CTLCardinality.txt
-rw-r--r-- 1 mcc users 74K Feb 25 16:48 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.2K Feb 25 16:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 60K Feb 25 16:47 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.2K Feb 25 15:39 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 15:39 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 25 16:49 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 110K Feb 25 16:49 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.9K Feb 25 16:49 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 66K Feb 25 16:49 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 15:39 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 15:39 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 104K 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 1678218595720

Running Version 202205111006
[2023-03-07 19:49:56] [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:56] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-07 19:49:57] [INFO ] Load time of PNML (sax parser for PT used): 96 ms
[2023-03-07 19:49:57] [INFO ] Transformed 403 places.
[2023-03-07 19:49:57] [INFO ] Transformed 374 transitions.
[2023-03-07 19:49:57] [INFO ] Found NUPN structural information;
[2023-03-07 19:49:57] [INFO ] Parsed PT model containing 403 places and 374 transitions in 204 ms.
Graph (trivial) has 227 edges and 403 vertex of which 7 / 403 are part of one of the 1 SCC in 5 ms
Free SCC test removed 6 places
Structural test allowed to assert that 124 places are NOT stable. Took 13 ms.
Ensure Unique test removed 7 transitions
Reduce redundant transitions removed 7 transitions.
Incomplete random walk after 10000 steps, including 116 resets, run finished after 731 ms. (steps per millisecond=13 ) 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 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 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 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 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
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 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 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 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 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 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 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 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
[2023-03-07 19:49:58] [INFO ] Computed 65 place invariants in 24 ms
[2023-03-07 19:49:59] [INFO ] After 1205ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:155
[2023-03-07 19:50:00] [INFO ] [Nat]Absence check using 35 positive place invariants in 12 ms returned sat
[2023-03-07 19:50:00] [INFO ] [Nat]Absence check using 35 positive and 30 generalized place invariants in 9 ms returned sat
[2023-03-07 19:50:03] [INFO ] After 2088ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :155
[2023-03-07 19:50:03] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-07 19:50:05] [INFO ] After 1987ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :155
[2023-03-07 19:50:05] [INFO ] Deduced a trap composed of 35 places in 80 ms of which 6 ms to minimize.
[2023-03-07 19:50:05] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 118 ms
[2023-03-07 19:50:06] [INFO ] Deduced a trap composed of 98 places in 187 ms of which 2 ms to minimize.
[2023-03-07 19:50:06] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 261 ms
[2023-03-07 19:50:06] [INFO ] Deduced a trap composed of 92 places in 181 ms of which 2 ms to minimize.
[2023-03-07 19:50:06] [INFO ] Deduced a trap composed of 87 places in 175 ms of which 2 ms to minimize.
[2023-03-07 19:50:07] [INFO ] Deduced a trap composed of 99 places in 204 ms of which 1 ms to minimize.
[2023-03-07 19:50:07] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 638 ms
[2023-03-07 19:50:07] [INFO ] Deduced a trap composed of 103 places in 145 ms of which 1 ms to minimize.
[2023-03-07 19:50:07] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 179 ms
[2023-03-07 19:50:08] [INFO ] Deduced a trap composed of 99 places in 133 ms of which 1 ms to minimize.
[2023-03-07 19:50:08] [INFO ] Deduced a trap composed of 94 places in 135 ms of which 0 ms to minimize.
[2023-03-07 19:50:08] [INFO ] Deduced a trap composed of 95 places in 136 ms of which 1 ms to minimize.
[2023-03-07 19:50:08] [INFO ] Deduced a trap composed of 93 places in 142 ms of which 1 ms to minimize.
[2023-03-07 19:50:08] [INFO ] Deduced a trap composed of 92 places in 144 ms of which 1 ms to minimize.
[2023-03-07 19:50:09] [INFO ] Deduced a trap composed of 97 places in 149 ms of which 1 ms to minimize.
[2023-03-07 19:50:09] [INFO ] Deduced a trap composed of 96 places in 147 ms of which 1 ms to minimize.
[2023-03-07 19:50:09] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 1244 ms
[2023-03-07 19:50:10] [INFO ] Deduced a trap composed of 94 places in 160 ms of which 1 ms to minimize.
[2023-03-07 19:50:10] [INFO ] Deduced a trap composed of 92 places in 143 ms of which 0 ms to minimize.
[2023-03-07 19:50:10] [INFO ] Deduced a trap composed of 90 places in 157 ms of which 1 ms to minimize.
[2023-03-07 19:50:10] [INFO ] Deduced a trap composed of 91 places in 112 ms of which 1 ms to minimize.
[2023-03-07 19:50:10] [INFO ] Deduced a trap composed of 101 places in 131 ms of which 2 ms to minimize.
[2023-03-07 19:50:10] [INFO ] Deduced a trap composed of 98 places in 118 ms of which 0 ms to minimize.
[2023-03-07 19:50:10] [INFO ] Deduced a trap composed of 88 places in 148 ms of which 0 ms to minimize.
[2023-03-07 19:50:11] [INFO ] Deduced a trap composed of 94 places in 117 ms of which 1 ms to minimize.
[2023-03-07 19:50:11] [INFO ] Deduced a trap composed of 85 places in 112 ms of which 1 ms to minimize.
[2023-03-07 19:50:11] [INFO ] Deduced a trap composed of 86 places in 130 ms of which 1 ms to minimize.
[2023-03-07 19:50:11] [INFO ] Deduced a trap composed of 78 places in 133 ms of which 1 ms to minimize.
[2023-03-07 19:50:11] [INFO ] Deduced a trap composed of 69 places in 146 ms of which 1 ms to minimize.
[2023-03-07 19:50:11] [INFO ] Deduced a trap composed of 73 places in 152 ms of which 0 ms to minimize.
[2023-03-07 19:50:12] [INFO ] Deduced a trap composed of 14 places in 113 ms of which 1 ms to minimize.
[2023-03-07 19:50:12] [INFO ] Deduced a trap composed of 12 places in 138 ms of which 1 ms to minimize.
[2023-03-07 19:50:12] [INFO ] Deduced a trap composed of 91 places in 143 ms of which 0 ms to minimize.
[2023-03-07 19:50:12] [INFO ] Deduced a trap composed of 86 places in 144 ms of which 1 ms to minimize.
[2023-03-07 19:50:12] [INFO ] Deduced a trap composed of 99 places in 129 ms of which 0 ms to minimize.
[2023-03-07 19:50:12] [INFO ] Deduced a trap composed of 8 places in 97 ms of which 1 ms to minimize.
[2023-03-07 19:50:13] [INFO ] Deduced a trap composed of 82 places in 87 ms of which 0 ms to minimize.
[2023-03-07 19:50:13] [INFO ] Deduced a trap composed of 81 places in 108 ms of which 2 ms to minimize.
[2023-03-07 19:50:13] [INFO ] Deduced a trap composed of 92 places in 89 ms of which 2 ms to minimize.
[2023-03-07 19:50:13] [INFO ] Deduced a trap composed of 90 places in 121 ms of which 1 ms to minimize.
[2023-03-07 19:50:13] [INFO ] Deduced a trap composed of 84 places in 161 ms of which 1 ms to minimize.
[2023-03-07 19:50:13] [INFO ] Deduced a trap composed of 23 places in 149 ms of which 1 ms to minimize.
[2023-03-07 19:50:14] [INFO ] Deduced a trap composed of 84 places in 132 ms of which 1 ms to minimize.
[2023-03-07 19:50:14] [INFO ] Deduced a trap composed of 86 places in 113 ms of which 3 ms to minimize.
[2023-03-07 19:50:14] [INFO ] Deduced a trap composed of 97 places in 148 ms of which 1 ms to minimize.
[2023-03-07 19:50:14] [INFO ] Deduced a trap composed of 98 places in 150 ms of which 0 ms to minimize.
[2023-03-07 19:50:14] [INFO ] Deduced a trap composed of 79 places in 126 ms of which 1 ms to minimize.
[2023-03-07 19:50:14] [INFO ] Deduced a trap composed of 80 places in 94 ms of which 1 ms to minimize.
[2023-03-07 19:50:14] [INFO ] Deduced a trap composed of 80 places in 92 ms of which 1 ms to minimize.
[2023-03-07 19:50:15] [INFO ] Deduced a trap composed of 80 places in 106 ms of which 0 ms to minimize.
[2023-03-07 19:50:15] [INFO ] Deduced a trap composed of 82 places in 103 ms of which 0 ms to minimize.
[2023-03-07 19:50:15] [INFO ] Deduced a trap composed of 85 places in 113 ms of which 1 ms to minimize.
[2023-03-07 19:50:15] [INFO ] Deduced a trap composed of 87 places in 99 ms of which 0 ms to minimize.
[2023-03-07 19:50:15] [INFO ] Deduced a trap composed of 88 places in 99 ms of which 1 ms to minimize.
[2023-03-07 19:50:15] [INFO ] Deduced a trap composed of 87 places in 97 ms of which 1 ms to minimize.
[2023-03-07 19:50:15] [INFO ] Deduced a trap composed of 83 places in 89 ms of which 1 ms to minimize.
[2023-03-07 19:50:15] [INFO ] Deduced a trap composed of 89 places in 91 ms of which 1 ms to minimize.
[2023-03-07 19:50:15] [INFO ] Deduced a trap composed of 86 places in 97 ms of which 0 ms to minimize.
[2023-03-07 19:50:16] [INFO ] Deduced a trap composed of 84 places in 97 ms of which 0 ms to minimize.
[2023-03-07 19:50:16] [INFO ] Deduced a trap composed of 81 places in 93 ms of which 0 ms to minimize.
[2023-03-07 19:50:16] [INFO ] Deduced a trap composed of 88 places in 83 ms of which 1 ms to minimize.
[2023-03-07 19:50:16] [INFO ] Deduced a trap composed of 91 places in 90 ms of which 0 ms to minimize.
[2023-03-07 19:50:16] [INFO ] Deduced a trap composed of 96 places in 85 ms of which 0 ms to minimize.
[2023-03-07 19:50:16] [INFO ] Deduced a trap composed of 113 places in 88 ms of which 1 ms to minimize.
[2023-03-07 19:50:16] [INFO ] Deduced a trap composed of 99 places in 92 ms of which 1 ms to minimize.
[2023-03-07 19:50:16] [INFO ] Deduced a trap composed of 93 places in 92 ms of which 0 ms to minimize.
[2023-03-07 19:50:17] [INFO ] Deduced a trap composed of 88 places in 87 ms of which 0 ms to minimize.
[2023-03-07 19:50:17] [INFO ] Deduced a trap composed of 85 places in 76 ms of which 1 ms to minimize.
[2023-03-07 19:50:17] [INFO ] Deduced a trap composed of 92 places in 106 ms of which 0 ms to minimize.
[2023-03-07 19:50:17] [INFO ] Deduced a trap composed of 90 places in 89 ms of which 1 ms to minimize.
[2023-03-07 19:50:17] [INFO ] Deduced a trap composed of 85 places in 90 ms of which 3 ms to minimize.
[2023-03-07 19:50:17] [INFO ] Deduced a trap composed of 27 places in 106 ms of which 3 ms to minimize.
[2023-03-07 19:50:17] [INFO ] Deduced a trap composed of 93 places in 108 ms of which 2 ms to minimize.
[2023-03-07 19:50:17] [INFO ] Deduced a trap composed of 85 places in 99 ms of which 2 ms to minimize.
[2023-03-07 19:50:17] [INFO ] Deduced a trap composed of 85 places in 91 ms of which 0 ms to minimize.
[2023-03-07 19:50:18] [INFO ] Deduced a trap composed of 24 places in 91 ms of which 1 ms to minimize.
[2023-03-07 19:50:18] [INFO ] Deduced a trap composed of 83 places in 89 ms of which 1 ms to minimize.
[2023-03-07 19:50:18] [INFO ] Deduced a trap composed of 83 places in 96 ms of which 0 ms to minimize.
[2023-03-07 19:50:18] [INFO ] Deduced a trap composed of 89 places in 96 ms of which 1 ms to minimize.
[2023-03-07 19:50:18] [INFO ] Deduced a trap composed of 99 places in 90 ms of which 0 ms to minimize.
[2023-03-07 19:50:18] [INFO ] Deduced a trap composed of 88 places in 85 ms of which 0 ms to minimize.
[2023-03-07 19:50:18] [INFO ] Deduced a trap composed of 107 places in 139 ms of which 1 ms to minimize.
[2023-03-07 19:50:18] [INFO ] Deduced a trap composed of 88 places in 95 ms of which 0 ms to minimize.
[2023-03-07 19:50:19] [INFO ] Deduced a trap composed of 96 places in 120 ms of which 0 ms to minimize.
[2023-03-07 19:50:19] [INFO ] Deduced a trap composed of 27 places in 124 ms of which 1 ms to minimize.
[2023-03-07 19:50:19] [INFO ] Deduced a trap composed of 103 places in 95 ms of which 1 ms to minimize.
[2023-03-07 19:50:19] [INFO ] Deduced a trap composed of 90 places in 86 ms of which 0 ms to minimize.
[2023-03-07 19:50:19] [INFO ] Deduced a trap composed of 103 places in 86 ms of which 1 ms to minimize.
[2023-03-07 19:50:19] [INFO ] Deduced a trap composed of 101 places in 84 ms of which 0 ms to minimize.
[2023-03-07 19:50:19] [INFO ] Deduced a trap composed of 94 places in 121 ms of which 0 ms to minimize.
[2023-03-07 19:50:19] [INFO ] Deduced a trap composed of 113 places in 91 ms of which 0 ms to minimize.
[2023-03-07 19:50:19] [INFO ] Deduced a trap composed of 102 places in 84 ms of which 1 ms to minimize.
[2023-03-07 19:50:20] [INFO ] Deduced a trap composed of 93 places in 112 ms of which 0 ms to minimize.
[2023-03-07 19:50:20] [INFO ] Deduced a trap composed of 92 places in 94 ms of which 0 ms to minimize.
[2023-03-07 19:50:20] [INFO ] Deduced a trap composed of 91 places in 95 ms of which 1 ms to minimize.
[2023-03-07 19:50:20] [INFO ] Deduced a trap composed of 98 places in 94 ms of which 0 ms to minimize.
[2023-03-07 19:50:20] [INFO ] Deduced a trap composed of 90 places in 94 ms of which 1 ms to minimize.
[2023-03-07 19:50:20] [INFO ] Deduced a trap composed of 92 places in 84 ms of which 0 ms to minimize.
[2023-03-07 19:50:20] [INFO ] Deduced a trap composed of 98 places in 101 ms of which 0 ms to minimize.
[2023-03-07 19:50:20] [INFO ] Deduced a trap composed of 99 places in 90 ms of which 0 ms to minimize.
[2023-03-07 19:50:21] [INFO ] Deduced a trap composed of 91 places in 89 ms of which 1 ms to minimize.
[2023-03-07 19:50:21] [INFO ] Deduced a trap composed of 93 places in 89 ms of which 1 ms to minimize.
[2023-03-07 19:50:21] [INFO ] Deduced a trap composed of 90 places in 89 ms of which 1 ms to minimize.
[2023-03-07 19:50:21] [INFO ] Deduced a trap composed of 87 places in 86 ms of which 1 ms to minimize.
[2023-03-07 19:50:21] [INFO ] Deduced a trap composed of 90 places in 92 ms of which 0 ms to minimize.
[2023-03-07 19:50:21] [INFO ] Deduced a trap composed of 97 places in 124 ms of which 0 ms to minimize.
[2023-03-07 19:50:21] [INFO ] Deduced a trap composed of 103 places in 129 ms of which 1 ms to minimize.
[2023-03-07 19:50:21] [INFO ] Deduced a trap composed of 103 places in 90 ms of which 1 ms to minimize.
[2023-03-07 19:50:22] [INFO ] Deduced a trap composed of 100 places in 89 ms of which 1 ms to minimize.
[2023-03-07 19:50:22] [INFO ] Deduced a trap composed of 89 places in 132 ms of which 0 ms to minimize.
[2023-03-07 19:50:22] [INFO ] Deduced a trap composed of 91 places in 115 ms of which 1 ms to minimize.
[2023-03-07 19:50:22] [INFO ] Deduced a trap composed of 100 places in 100 ms of which 0 ms to minimize.
[2023-03-07 19:50:22] [INFO ] Deduced a trap composed of 16 places in 78 ms of which 0 ms to minimize.
[2023-03-07 19:50:22] [INFO ] Deduced a trap composed of 19 places in 87 ms of which 1 ms to minimize.
[2023-03-07 19:50:22] [INFO ] Deduced a trap composed of 88 places in 86 ms of which 1 ms to minimize.
[2023-03-07 19:50:23] [INFO ] Deduced a trap composed of 19 places in 83 ms of which 0 ms to minimize.
[2023-03-07 19:50:23] [INFO ] Deduced a trap composed of 23 places in 80 ms of which 1 ms to minimize.
[2023-03-07 19:50:23] [INFO ] Deduced a trap composed of 89 places in 108 ms of which 0 ms to minimize.
[2023-03-07 19:50:23] [INFO ] Deduced a trap composed of 8 places in 163 ms of which 0 ms to minimize.
[2023-03-07 19:50:23] [INFO ] Deduced a trap composed of 17 places in 121 ms of which 0 ms to minimize.
[2023-03-07 19:50:23] [INFO ] Deduced a trap composed of 93 places in 123 ms of which 1 ms to minimize.
[2023-03-07 19:50:24] [INFO ] Deduced a trap composed of 21 places in 101 ms of which 0 ms to minimize.
[2023-03-07 19:50:24] [INFO ] Deduced a trap composed of 86 places in 116 ms of which 0 ms to minimize.
[2023-03-07 19:50:24] [INFO ] Deduced a trap composed of 88 places in 109 ms of which 1 ms to minimize.
[2023-03-07 19:50:24] [INFO ] Deduced a trap composed of 25 places in 113 ms of which 0 ms to minimize.
[2023-03-07 19:50:24] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-07 19:50:24] [INFO ] After 25113ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:155
Fused 155 Parikh solutions to 146 different solutions.
Parikh walk visited 137 properties in 6422 ms.
Support contains 18 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.7 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 79 transitions
Trivial Post-agglo rules discarded 79 transitions
Performed 79 trivial Post agglomeration. Transition count delta: 79
Iterating post reduction 0 with 80 rules applied. Total rules applied 81 place count 395 transition count 286
Reduce places removed 79 places and 0 transitions.
Iterating post reduction 1 with 79 rules applied. Total rules applied 160 place count 316 transition count 286
Performed 58 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 58 Pre rules applied. Total rules applied 160 place count 316 transition count 228
Deduced a syphon composed of 58 places in 2 ms
Ensure Unique test removed 9 places
Reduce places removed 67 places and 0 transitions.
Iterating global reduction 2 with 125 rules applied. Total rules applied 285 place count 249 transition count 228
Discarding 40 places :
Symmetric choice reduction at 2 with 40 rule applications. Total rules 325 place count 209 transition count 188
Iterating global reduction 2 with 40 rules applied. Total rules applied 365 place count 209 transition count 188
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 365 place count 209 transition count 185
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 371 place count 206 transition count 185
Performed 64 Post agglomeration using F-continuation condition.Transition count delta: 64
Deduced a syphon composed of 64 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 66 places and 0 transitions.
Iterating global reduction 2 with 130 rules applied. Total rules applied 501 place count 140 transition count 121
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 503 place count 139 transition count 124
Free-agglomeration rule applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 505 place count 139 transition count 122
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 507 place count 137 transition count 122
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 508 place count 137 transition count 122
Applied a total of 508 rules in 97 ms. Remains 137 /397 variables (removed 260) and now considering 122/367 (removed 245) transitions.
Finished structural reductions, in 1 iterations. Remains : 137/397 places, 122/367 transitions.
Finished random walk after 13151 steps, including 816 resets, run visited all 18 properties in 167 ms. (steps per millisecond=78 )
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 34226 ms.

BK_STOP 1678218631206

--------------------
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="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-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 r064-tajo-167813712100323"
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 ;