Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2021-input.r037-tajo-162038177000196.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2021-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
.................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool gold2020
Input is BusinessProcesses-PT-09, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r037-tajo-162038177000196
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 480K
-rw-r--r-- 1 mcc users 13K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 126K May 10 09:42 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.7K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 77K May 10 09:42 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K Mar 28 15:48 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Mar 28 15:48 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Mar 28 15:48 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Mar 28 15:48 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.1K Mar 23 03:00 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 22K Mar 23 03:00 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Mar 22 12:14 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 15K Mar 22 12:14 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 22 09:10 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Mar 22 09:10 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 5 16:51 equiv_col
-rw-r--r-- 1 mcc users 3 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 104K May 5 16:51 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME BusinessProcesses-PT-09-ReachabilityFireability-00
FORMULA_NAME BusinessProcesses-PT-09-ReachabilityFireability-01
FORMULA_NAME BusinessProcesses-PT-09-ReachabilityFireability-02
FORMULA_NAME BusinessProcesses-PT-09-ReachabilityFireability-03
FORMULA_NAME BusinessProcesses-PT-09-ReachabilityFireability-04
FORMULA_NAME BusinessProcesses-PT-09-ReachabilityFireability-05
FORMULA_NAME BusinessProcesses-PT-09-ReachabilityFireability-06
FORMULA_NAME BusinessProcesses-PT-09-ReachabilityFireability-07
FORMULA_NAME BusinessProcesses-PT-09-ReachabilityFireability-08
FORMULA_NAME BusinessProcesses-PT-09-ReachabilityFireability-09
FORMULA_NAME BusinessProcesses-PT-09-ReachabilityFireability-10
FORMULA_NAME BusinessProcesses-PT-09-ReachabilityFireability-11
FORMULA_NAME BusinessProcesses-PT-09-ReachabilityFireability-12
FORMULA_NAME BusinessProcesses-PT-09-ReachabilityFireability-13
FORMULA_NAME BusinessProcesses-PT-09-ReachabilityFireability-14
FORMULA_NAME BusinessProcesses-PT-09-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1620937016257

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2021-05-13 20:16:58] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -timeout, 3600, -rebuildPNML]
[2021-05-13 20:16:58] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-13 20:16:58] [INFO ] Load time of PNML (sax parser for PT used): 62 ms
[2021-05-13 20:16:58] [INFO ] Transformed 403 places.
[2021-05-13 20:16:58] [INFO ] Transformed 374 transitions.
[2021-05-13 20:16:58] [INFO ] Found NUPN structural information;
[2021-05-13 20:16:58] [INFO ] Parsed PT model containing 403 places and 374 transitions in 103 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 21 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 102 resets, run finished after 51 ms. (steps per millisecond=196 ) properties seen :[1, 0, 1, 0, 1, 0, 1, 0, 0, 1, 1, 1, 0, 1, 0, 1]
FORMULA BusinessProcesses-PT-09-ReachabilityFireability-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-09-ReachabilityFireability-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-09-ReachabilityFireability-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-09-ReachabilityFireability-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-09-ReachabilityFireability-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-09-ReachabilityFireability-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-09-ReachabilityFireability-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-09-ReachabilityFireability-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-09-ReachabilityFireability-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 15 ms. (steps per millisecond=666 ) properties seen :[0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 19 resets, run finished after 19 ms. (steps per millisecond=526 ) properties seen :[0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 19 ms. (steps per millisecond=526 ) properties seen :[0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 18 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties seen :[0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 13 ms. (steps per millisecond=769 ) properties seen :[0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 19 resets, run finished after 19 ms. (steps per millisecond=526 ) properties seen :[0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 25 resets, run finished after 13 ms. (steps per millisecond=769 ) properties seen :[0, 0, 0, 0, 0, 0, 0]
// Phase 1: matrix 374 rows 403 cols
[2021-05-13 20:16:58] [INFO ] Computed 65 place invariants in 16 ms
[2021-05-13 20:16:58] [INFO ] [Real]Absence check using 36 positive place invariants in 35 ms returned sat
[2021-05-13 20:16:58] [INFO ] [Real]Absence check using 36 positive and 29 generalized place invariants in 13 ms returned sat
[2021-05-13 20:16:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 20:16:58] [INFO ] [Real]Absence check using state equation in 328 ms returned unsat
[2021-05-13 20:16:59] [INFO ] [Real]Absence check using 36 positive place invariants in 25 ms returned sat
[2021-05-13 20:16:59] [INFO ] [Real]Absence check using 36 positive and 29 generalized place invariants in 14 ms returned sat
[2021-05-13 20:16:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 20:16:59] [INFO ] [Real]Absence check using state equation in 341 ms returned unsat
[2021-05-13 20:16:59] [INFO ] [Real]Absence check using 36 positive place invariants in 30 ms returned sat
[2021-05-13 20:16:59] [INFO ] [Real]Absence check using 36 positive and 29 generalized place invariants in 24 ms returned sat
[2021-05-13 20:16:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 20:17:00] [INFO ] [Real]Absence check using state equation in 598 ms returned sat
[2021-05-13 20:17:00] [INFO ] Deduced a trap composed of 16 places in 244 ms
[2021-05-13 20:17:00] [INFO ] Deduced a trap composed of 11 places in 173 ms
[2021-05-13 20:17:00] [INFO ] Deduced a trap composed of 17 places in 149 ms
[2021-05-13 20:17:01] [INFO ] Deduced a trap composed of 36 places in 223 ms
[2021-05-13 20:17:01] [INFO ] Deduced a trap composed of 43 places in 183 ms
[2021-05-13 20:17:01] [INFO ] Deduced a trap composed of 93 places in 186 ms
[2021-05-13 20:17:01] [INFO ] Deduced a trap composed of 107 places in 201 ms
[2021-05-13 20:17:01] [INFO ] Deduced a trap composed of 97 places in 141 ms
[2021-05-13 20:17:02] [INFO ] Deduced a trap composed of 117 places in 138 ms
[2021-05-13 20:17:02] [INFO ] Deduced a trap composed of 12 places in 126 ms
[2021-05-13 20:17:02] [INFO ] Deduced a trap composed of 89 places in 116 ms
[2021-05-13 20:17:02] [INFO ] Deduced a trap composed of 93 places in 165 ms
[2021-05-13 20:17:02] [INFO ] Deduced a trap composed of 95 places in 160 ms
[2021-05-13 20:17:02] [INFO ] Deduced a trap composed of 101 places in 135 ms
[2021-05-13 20:17:03] [INFO ] Deduced a trap composed of 106 places in 140 ms
[2021-05-13 20:17:03] [INFO ] Deduced a trap composed of 95 places in 150 ms
[2021-05-13 20:17:03] [INFO ] Deduced a trap composed of 85 places in 175 ms
[2021-05-13 20:17:03] [INFO ] Deduced a trap composed of 95 places in 127 ms
[2021-05-13 20:17:03] [INFO ] Deduced a trap composed of 86 places in 132 ms
[2021-05-13 20:17:03] [INFO ] Deduced a trap composed of 113 places in 131 ms
[2021-05-13 20:17:04] [INFO ] Deduced a trap composed of 101 places in 143 ms
[2021-05-13 20:17:04] [INFO ] Deduced a trap composed of 95 places in 148 ms
[2021-05-13 20:17:04] [INFO ] Deduced a trap composed of 85 places in 125 ms
[2021-05-13 20:17:04] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream closed (> (+ s0 s48 s49 s50 s80 s84 s86 s95 s96 s97 s98 s99 s117 s123 s159 s160 s161 s189 s198 s199 s200 s203 s204 s205 s208 s209 s210 s214 s223 s225 s244 s248 s250 s264 s274 s277 s278 s281 s282 s283 s284 s285 s286 s287 s288 s289 s290 s291 s292 s295 s296 s308 s309 s310 s311 s312 s315 s316 s317 s318 s321 s322 s326 s333 s334 s335 s336 s348 s349 s352 s353 s354 s355 s356 s357 s358 s359 s360 s361 s362 s363 s368 s370 s371 s385) 0)") while checking expression at index 2
[2021-05-13 20:17:04] [INFO ] [Real]Absence check using 36 positive place invariants in 13 ms returned unsat
[2021-05-13 20:17:04] [INFO ] [Real]Absence check using 36 positive place invariants in 29 ms returned sat
[2021-05-13 20:17:04] [INFO ] [Real]Absence check using 36 positive and 29 generalized place invariants in 17 ms returned sat
[2021-05-13 20:17:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 20:17:05] [INFO ] [Real]Absence check using state equation in 453 ms returned sat
[2021-05-13 20:17:05] [INFO ] Deduced a trap composed of 11 places in 173 ms
[2021-05-13 20:17:05] [INFO ] Deduced a trap composed of 14 places in 158 ms
[2021-05-13 20:17:05] [INFO ] Deduced a trap composed of 95 places in 186 ms
[2021-05-13 20:17:05] [INFO ] Deduced a trap composed of 8 places in 130 ms
[2021-05-13 20:17:05] [INFO ] Deduced a trap composed of 102 places in 133 ms
[2021-05-13 20:17:06] [INFO ] Deduced a trap composed of 74 places in 162 ms
[2021-05-13 20:17:06] [INFO ] Deduced a trap composed of 11 places in 148 ms
[2021-05-13 20:17:06] [INFO ] Deduced a trap composed of 13 places in 106 ms
[2021-05-13 20:17:06] [INFO ] Deduced a trap composed of 16 places in 112 ms
[2021-05-13 20:17:06] [INFO ] Deduced a trap composed of 30 places in 115 ms
[2021-05-13 20:17:06] [INFO ] Deduced a trap composed of 94 places in 106 ms
[2021-05-13 20:17:06] [INFO ] Deduced a trap composed of 103 places in 111 ms
[2021-05-13 20:17:07] [INFO ] Deduced a trap composed of 19 places in 108 ms
[2021-05-13 20:17:07] [INFO ] Deduced a trap composed of 99 places in 109 ms
[2021-05-13 20:17:07] [INFO ] Deduced a trap composed of 104 places in 108 ms
[2021-05-13 20:17:07] [INFO ] Deduced a trap composed of 26 places in 156 ms
[2021-05-13 20:17:07] [INFO ] Deduced a trap composed of 28 places in 174 ms
[2021-05-13 20:17:07] [INFO ] Deduced a trap composed of 98 places in 115 ms
[2021-05-13 20:17:07] [INFO ] Deduced a trap composed of 96 places in 150 ms
[2021-05-13 20:17:08] [INFO ] Deduced a trap composed of 110 places in 151 ms
[2021-05-13 20:17:08] [INFO ] Deduced a trap composed of 106 places in 114 ms
[2021-05-13 20:17:08] [INFO ] Deduced a trap composed of 17 places in 100 ms
[2021-05-13 20:17:08] [INFO ] Deduced a trap composed of 30 places in 139 ms
[2021-05-13 20:17:08] [INFO ] Deduced a trap composed of 93 places in 142 ms
[2021-05-13 20:17:08] [INFO ] Deduced a trap composed of 96 places in 129 ms
[2021-05-13 20:17:09] [INFO ] Deduced a trap composed of 111 places in 114 ms
[2021-05-13 20:17:09] [INFO ] Deduced a trap composed of 112 places in 106 ms
[2021-05-13 20:17:09] [INFO ] Deduced a trap composed of 99 places in 105 ms
[2021-05-13 20:17:09] [INFO ] Deduced a trap composed of 107 places in 115 ms
[2021-05-13 20:17:09] [INFO ] Deduced a trap composed of 102 places in 103 ms
[2021-05-13 20:17:09] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream closed (> (+ s0 s1 s2 s3 s4 s5 s6 s7 s8 s9 s10 s11 s12 s56 s80 s82 s86 s89 s95 s98 s99 s108 s120 s141 s142 s143 s199 s208 s210 s234 s239 s244 s253 s254 s255 s259 s264 s274 s278 s279 s280 s281 s282 s283 s284 s287 s288 s289 s290 s291 s292 s293 s294 s295 s296 s297 s298 s299 s300 s301 s302 s303 s308 s309 s310 s311 s312 s313 s314 s317 s318 s319 s320 s328 s334 s335 s336 s340 s341 s342 s343 s344 s345 s348 s349 s350 s351 s354 s355 s356 s357 s360 s361 s362 s363 s364 s365 s368 s372 s373 s374 s394) 0)") while checking expression at index 4
[2021-05-13 20:17:09] [INFO ] [Real]Absence check using 36 positive place invariants in 22 ms returned sat
[2021-05-13 20:17:09] [INFO ] [Real]Absence check using 36 positive and 29 generalized place invariants in 11 ms returned unsat
[2021-05-13 20:17:09] [INFO ] [Real]Absence check using 36 positive place invariants in 34 ms returned sat
[2021-05-13 20:17:09] [INFO ] [Real]Absence check using 36 positive and 29 generalized place invariants in 18 ms returned sat
[2021-05-13 20:17:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 20:17:10] [INFO ] [Real]Absence check using state equation in 460 ms returned sat
[2021-05-13 20:17:10] [INFO ] Deduced a trap composed of 72 places in 200 ms
[2021-05-13 20:17:10] [INFO ] Deduced a trap composed of 8 places in 171 ms
[2021-05-13 20:17:10] [INFO ] Deduced a trap composed of 8 places in 161 ms
[2021-05-13 20:17:10] [INFO ] Deduced a trap composed of 11 places in 165 ms
[2021-05-13 20:17:11] [INFO ] Deduced a trap composed of 33 places in 155 ms
[2021-05-13 20:17:11] [INFO ] Deduced a trap composed of 39 places in 172 ms
[2021-05-13 20:17:11] [INFO ] Deduced a trap composed of 96 places in 153 ms
[2021-05-13 20:17:11] [INFO ] Deduced a trap composed of 17 places in 158 ms
[2021-05-13 20:17:11] [INFO ] Deduced a trap composed of 11 places in 162 ms
[2021-05-13 20:17:12] [INFO ] Deduced a trap composed of 92 places in 166 ms
[2021-05-13 20:17:12] [INFO ] Deduced a trap composed of 88 places in 151 ms
[2021-05-13 20:17:12] [INFO ] Deduced a trap composed of 93 places in 170 ms
[2021-05-13 20:17:12] [INFO ] Deduced a trap composed of 90 places in 182 ms
[2021-05-13 20:17:12] [INFO ] Deduced a trap composed of 17 places in 55 ms
[2021-05-13 20:17:12] [INFO ] Deduced a trap composed of 28 places in 52 ms
[2021-05-13 20:17:12] [INFO ] Trap strengthening (SAT) tested/added 16/15 trap constraints in 2568 ms
[2021-05-13 20:17:12] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 20:17:12] [INFO ] [Nat]Absence check using 36 positive place invariants in 46 ms returned sat
[2021-05-13 20:17:12] [INFO ] [Nat]Absence check using 36 positive and 29 generalized place invariants in 16 ms returned sat
[2021-05-13 20:17:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 20:17:13] [INFO ] [Nat]Absence check using state equation in 499 ms returned sat
[2021-05-13 20:17:13] [INFO ] Deduced a trap composed of 8 places in 81 ms
[2021-05-13 20:17:13] [INFO ] Deduced a trap composed of 29 places in 89 ms
[2021-05-13 20:17:13] [INFO ] Deduced a trap composed of 8 places in 88 ms
[2021-05-13 20:17:13] [INFO ] Deduced a trap composed of 29 places in 92 ms
[2021-05-13 20:17:13] [INFO ] Deduced a trap composed of 17 places in 80 ms
[2021-05-13 20:17:14] [INFO ] Deduced a trap composed of 11 places in 82 ms
[2021-05-13 20:17:14] [INFO ] Deduced a trap composed of 37 places in 75 ms
[2021-05-13 20:17:14] [INFO ] Deduced a trap composed of 19 places in 86 ms
[2021-05-13 20:17:14] [INFO ] Deduced a trap composed of 40 places in 90 ms
[2021-05-13 20:17:14] [INFO ] Deduced a trap composed of 37 places in 83 ms
[2021-05-13 20:17:14] [INFO ] Deduced a trap composed of 52 places in 103 ms
[2021-05-13 20:17:14] [INFO ] Deduced a trap composed of 20 places in 84 ms
[2021-05-13 20:17:14] [INFO ] Deduced a trap composed of 32 places in 94 ms
[2021-05-13 20:17:14] [INFO ] Deduced a trap composed of 36 places in 103 ms
[2021-05-13 20:17:15] [INFO ] Deduced a trap composed of 52 places in 84 ms
[2021-05-13 20:17:15] [INFO ] Trap strengthening (SAT) tested/added 16/15 trap constraints in 1667 ms
[2021-05-13 20:17:15] [INFO ] Computed and/alt/rep : 373/1354/373 causal constraints in 34 ms.
[2021-05-13 20:17:17] [INFO ] Added : 256 causal constraints over 52 iterations in 2193 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 32 ms.
FORMULA BusinessProcesses-PT-09-ReachabilityFireability-12 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BusinessProcesses-PT-09-ReachabilityFireability-07 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BusinessProcesses-PT-09-ReachabilityFireability-03 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BusinessProcesses-PT-09-ReachabilityFireability-01 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Incomplete Parikh walk after 23900 steps, including 292 resets, run finished after 98 ms. (steps per millisecond=243 ) properties seen :[0, 0, 0] could not realise parikh vector
Support contains 21 out of 403 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 403/403 places, 374/374 transitions.
Graph (trivial) has 212 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
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions removed 1 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.9 ms
Drop transitions removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Performed 79 Post agglomeration using F-continuation condition.Transition count delta: 79
Iterating post reduction 0 with 87 rules applied. Total rules applied 89 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 168 place count 316 transition count 286
Performed 63 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 63 Pre rules applied. Total rules applied 168 place count 316 transition count 223
Deduced a syphon composed of 63 places in 3 ms
Ensure Unique test removed 9 places
Reduce places removed 72 places and 0 transitions.
Iterating global reduction 2 with 135 rules applied. Total rules applied 303 place count 244 transition count 223
Symmetric choice reduction at 2 with 45 rule applications. Total rules 348 place count 244 transition count 223
Deduced a syphon composed of 45 places in 1 ms
Reduce places removed 45 places and 45 transitions.
Iterating global reduction 2 with 90 rules applied. Total rules applied 438 place count 199 transition count 178
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 438 place count 199 transition count 175
Deduced a syphon composed of 3 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 7 rules applied. Total rules applied 445 place count 195 transition count 175
Performed 45 Post agglomeration using F-continuation condition.Transition count delta: 45
Deduced a syphon composed of 45 places in 1 ms
Ensure Unique test removed 2 places
Reduce places removed 47 places and 0 transitions.
Iterating global reduction 2 with 92 rules applied. Total rules applied 537 place count 148 transition count 130
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 539 place count 147 transition count 133
Free-agglomeration rule applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 541 place count 147 transition count 131
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 543 place count 145 transition count 131
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 544 place count 145 transition count 131
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 545 place count 144 transition count 130
Applied a total of 545 rules in 134 ms. Remains 144 /403 variables (removed 259) and now considering 130/374 (removed 244) transitions.
Finished structural reductions, in 1 iterations. Remains : 144/403 places, 130/374 transitions.
Finished random walk after 597 steps, including 19 resets, run visited all 3 properties in 3 ms. (steps per millisecond=199 )
FORMULA BusinessProcesses-PT-09-ReachabilityFireability-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-09-ReachabilityFireability-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-09-ReachabilityFireability-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
All properties solved without resorting to model-checking.

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

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="ReachabilityFireability"
export BK_TOOL="gold2020"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool gold2020"
echo " Input is BusinessProcesses-PT-09, examination is ReachabilityFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r037-tajo-162038177000196"
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 [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "UpperBounds" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] || [ "ReachabilityFireability" = "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 [ "ReachabilityFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityFireability" != "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 "ReachabilityFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityFireability.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 '' ReachabilityFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityFireability"
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 ;