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-162038177000220.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-15, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r037-tajo-162038177000220
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 536K
-rw-r--r-- 1 mcc users 15K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 141K May 10 09:42 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.5K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 79K 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.3K Mar 28 15:48 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K 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 15K Mar 28 15:48 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.3K Mar 23 03:00 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 16K Mar 23 03:00 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Mar 22 12:15 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 13K Mar 22 12:15 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 22 09:10 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K 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 157K 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-15-ReachabilityFireability-00
FORMULA_NAME BusinessProcesses-PT-15-ReachabilityFireability-01
FORMULA_NAME BusinessProcesses-PT-15-ReachabilityFireability-02
FORMULA_NAME BusinessProcesses-PT-15-ReachabilityFireability-03
FORMULA_NAME BusinessProcesses-PT-15-ReachabilityFireability-04
FORMULA_NAME BusinessProcesses-PT-15-ReachabilityFireability-05
FORMULA_NAME BusinessProcesses-PT-15-ReachabilityFireability-06
FORMULA_NAME BusinessProcesses-PT-15-ReachabilityFireability-07
FORMULA_NAME BusinessProcesses-PT-15-ReachabilityFireability-08
FORMULA_NAME BusinessProcesses-PT-15-ReachabilityFireability-09
FORMULA_NAME BusinessProcesses-PT-15-ReachabilityFireability-10
FORMULA_NAME BusinessProcesses-PT-15-ReachabilityFireability-11
FORMULA_NAME BusinessProcesses-PT-15-ReachabilityFireability-12
FORMULA_NAME BusinessProcesses-PT-15-ReachabilityFireability-13
FORMULA_NAME BusinessProcesses-PT-15-ReachabilityFireability-14
FORMULA_NAME BusinessProcesses-PT-15-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1620939091515

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2021-05-13 20:51:33] [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:51:33] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-13 20:51:33] [INFO ] Load time of PNML (sax parser for PT used): 68 ms
[2021-05-13 20:51:33] [INFO ] Transformed 630 places.
[2021-05-13 20:51:33] [INFO ] Transformed 566 transitions.
[2021-05-13 20:51:33] [INFO ] Found NUPN structural information;
[2021-05-13 20:51:33] [INFO ] Parsed PT model containing 630 places and 566 transitions in 109 ms.
Deduced a syphon composed of 4 places in 9 ms
Reduce places removed 4 places and 4 transitions.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 35 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 66 resets, run finished after 52 ms. (steps per millisecond=192 ) properties seen :[0, 0, 1, 1, 1, 0, 0, 1, 0, 1, 1, 0, 0, 0, 1, 1]
FORMULA BusinessProcesses-PT-15-ReachabilityFireability-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-15-ReachabilityFireability-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-15-ReachabilityFireability-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-15-ReachabilityFireability-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-15-ReachabilityFireability-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-15-ReachabilityFireability-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-15-ReachabilityFireability-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-15-ReachabilityFireability-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 18 ms. (steps per millisecond=555 ) properties seen :[1, 0, 0, 0, 0, 0, 0, 0]
FORMULA BusinessProcesses-PT-15-ReachabilityFireability-00 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 35 ms. (steps per millisecond=285 ) properties seen :[0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 17 ms. (steps per millisecond=588 ) properties seen :[0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 14 ms. (steps per millisecond=714 ) properties seen :[0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 12 ms. (steps per millisecond=833 ) properties seen :[0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 11 ms. (steps per millisecond=909 ) properties seen :[0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties seen :[0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 30 ms. (steps per millisecond=333 ) properties seen :[0, 0, 0, 0, 0, 0, 0]
// Phase 1: matrix 562 rows 626 cols
[2021-05-13 20:51:33] [INFO ] Computed 102 place invariants in 30 ms
[2021-05-13 20:51:33] [INFO ] [Real]Absence check using 61 positive place invariants in 62 ms returned sat
[2021-05-13 20:51:33] [INFO ] [Real]Absence check using 61 positive and 41 generalized place invariants in 32 ms returned sat
[2021-05-13 20:51:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 20:51:34] [INFO ] [Real]Absence check using state equation in 1039 ms returned sat
[2021-05-13 20:51:35] [INFO ] Deduced a trap composed of 24 places in 329 ms
[2021-05-13 20:51:35] [INFO ] Deduced a trap composed of 12 places in 251 ms
[2021-05-13 20:51:35] [INFO ] Deduced a trap composed of 11 places in 225 ms
[2021-05-13 20:51:36] [INFO ] Deduced a trap composed of 16 places in 287 ms
[2021-05-13 20:51:36] [INFO ] Deduced a trap composed of 17 places in 210 ms
[2021-05-13 20:51:36] [INFO ] Deduced a trap composed of 13 places in 302 ms
[2021-05-13 20:51:36] [INFO ] Deduced a trap composed of 22 places in 268 ms
[2021-05-13 20:51:37] [INFO ] Deduced a trap composed of 23 places in 258 ms
[2021-05-13 20:51:37] [INFO ] Deduced a trap composed of 34 places in 251 ms
[2021-05-13 20:51:37] [INFO ] Deduced a trap composed of 31 places in 299 ms
[2021-05-13 20:51:38] [INFO ] Deduced a trap composed of 131 places in 237 ms
[2021-05-13 20:51:38] [INFO ] Deduced a trap composed of 28 places in 214 ms
[2021-05-13 20:51:38] [INFO ] Deduced a trap composed of 34 places in 289 ms
[2021-05-13 20:51:38] [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 s50 s51 s54 s55 s218 s219 s220 s224 s225 s226 s238 s239 s251 s254 s318 s406 s407 s408 s412 s417 s422 s427 s432 s437 s442 s565 s566 s577 s578 s587 s588) 0)") while checking expression at index 0
[2021-05-13 20:51:38] [INFO ] [Real]Absence check using 61 positive place invariants in 56 ms returned sat
[2021-05-13 20:51:38] [INFO ] [Real]Absence check using 61 positive and 41 generalized place invariants in 34 ms returned sat
[2021-05-13 20:51:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 20:51:39] [INFO ] [Real]Absence check using state equation in 1033 ms returned sat
[2021-05-13 20:51:40] [INFO ] Deduced a trap composed of 8 places in 312 ms
[2021-05-13 20:51:40] [INFO ] Deduced a trap composed of 17 places in 285 ms
[2021-05-13 20:51:40] [INFO ] Deduced a trap composed of 11 places in 165 ms
[2021-05-13 20:51:41] [INFO ] Deduced a trap composed of 8 places in 159 ms
[2021-05-13 20:51:41] [INFO ] Deduced a trap composed of 17 places in 159 ms
[2021-05-13 20:51:41] [INFO ] Deduced a trap composed of 25 places in 131 ms
[2021-05-13 20:51:41] [INFO ] Deduced a trap composed of 16 places in 178 ms
[2021-05-13 20:51:41] [INFO ] Deduced a trap composed of 23 places in 146 ms
[2021-05-13 20:51:41] [INFO ] Deduced a trap composed of 38 places in 148 ms
[2021-05-13 20:51:42] [INFO ] Deduced a trap composed of 27 places in 173 ms
[2021-05-13 20:51:42] [INFO ] Deduced a trap composed of 24 places in 150 ms
[2021-05-13 20:51:42] [INFO ] Deduced a trap composed of 42 places in 166 ms
[2021-05-13 20:51:42] [INFO ] Deduced a trap composed of 20 places in 291 ms
[2021-05-13 20:51:43] [INFO ] Deduced a trap composed of 35 places in 254 ms
[2021-05-13 20:51:43] [INFO ] Deduced a trap composed of 32 places in 177 ms
[2021-05-13 20:51:43] [INFO ] Deduced a trap composed of 26 places in 177 ms
[2021-05-13 20:51:43] [INFO ] Deduced a trap composed of 36 places in 146 ms
[2021-05-13 20:51:43] [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 s29 s32 s33 s54 s55 s212 s213 s214 s218 s219 s220 s227 s230 s231 s232 s297 s298 s299 s303 s318 s407 s417 s422 s465 s466 s467 s561 s562) 0)") while checking expression at index 1
[2021-05-13 20:51:43] [INFO ] [Real]Absence check using 61 positive place invariants in 50 ms returned sat
[2021-05-13 20:51:43] [INFO ] [Real]Absence check using 61 positive and 41 generalized place invariants in 33 ms returned sat
[2021-05-13 20:51:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 20:51:44] [INFO ] [Real]Absence check using state equation in 957 ms returned sat
[2021-05-13 20:51:45] [INFO ] Deduced a trap composed of 8 places in 148 ms
[2021-05-13 20:51:45] [INFO ] Deduced a trap composed of 12 places in 129 ms
[2021-05-13 20:51:45] [INFO ] Deduced a trap composed of 21 places in 169 ms
[2021-05-13 20:51:45] [INFO ] Deduced a trap composed of 16 places in 140 ms
[2021-05-13 20:51:45] [INFO ] Deduced a trap composed of 28 places in 167 ms
[2021-05-13 20:51:46] [INFO ] Deduced a trap composed of 11 places in 169 ms
[2021-05-13 20:51:46] [INFO ] Deduced a trap composed of 24 places in 135 ms
[2021-05-13 20:51:46] [INFO ] Deduced a trap composed of 18 places in 136 ms
[2021-05-13 20:51:46] [INFO ] Deduced a trap composed of 41 places in 133 ms
[2021-05-13 20:51:46] [INFO ] Deduced a trap composed of 41 places in 112 ms
[2021-05-13 20:51:46] [INFO ] Deduced a trap composed of 47 places in 111 ms
[2021-05-13 20:51:46] [INFO ] Deduced a trap composed of 38 places in 143 ms
[2021-05-13 20:51:47] [INFO ] Deduced a trap composed of 36 places in 138 ms
[2021-05-13 20:51:47] [INFO ] Deduced a trap composed of 40 places in 110 ms
[2021-05-13 20:51:47] [INFO ] Deduced a trap composed of 16 places in 128 ms
[2021-05-13 20:51:47] [INFO ] Deduced a trap composed of 49 places in 136 ms
[2021-05-13 20:51:47] [INFO ] Deduced a trap composed of 16 places in 109 ms
[2021-05-13 20:51:47] [INFO ] Deduced a trap composed of 35 places in 134 ms
[2021-05-13 20:51:47] [INFO ] Deduced a trap composed of 31 places in 132 ms
[2021-05-13 20:51:48] [INFO ] Trap strengthening (SAT) tested/added 20/19 trap constraints in 3125 ms
[2021-05-13 20:51:48] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 20:51:48] [INFO ] [Nat]Absence check using 61 positive place invariants in 68 ms returned sat
[2021-05-13 20:51:48] [INFO ] [Nat]Absence check using 61 positive and 41 generalized place invariants in 31 ms returned sat
[2021-05-13 20:51:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 20:51:49] [INFO ] [Nat]Absence check using state equation in 966 ms returned sat
[2021-05-13 20:51:49] [INFO ] Deduced a trap composed of 8 places in 143 ms
[2021-05-13 20:51:49] [INFO ] Deduced a trap composed of 11 places in 108 ms
[2021-05-13 20:51:49] [INFO ] Deduced a trap composed of 22 places in 140 ms
[2021-05-13 20:51:49] [INFO ] Deduced a trap composed of 24 places in 145 ms
[2021-05-13 20:51:50] [INFO ] Deduced a trap composed of 34 places in 171 ms
[2021-05-13 20:51:50] [INFO ] Deduced a trap composed of 21 places in 124 ms
[2021-05-13 20:51:50] [INFO ] Deduced a trap composed of 50 places in 134 ms
[2021-05-13 20:51:50] [INFO ] Deduced a trap composed of 25 places in 128 ms
[2021-05-13 20:51:50] [INFO ] Deduced a trap composed of 23 places in 154 ms
[2021-05-13 20:51:50] [INFO ] Deduced a trap composed of 43 places in 124 ms
[2021-05-13 20:51:51] [INFO ] Deduced a trap composed of 50 places in 149 ms
[2021-05-13 20:51:51] [INFO ] Deduced a trap composed of 35 places in 104 ms
[2021-05-13 20:51:51] [INFO ] Deduced a trap composed of 23 places in 108 ms
[2021-05-13 20:51:51] [INFO ] Deduced a trap composed of 41 places in 127 ms
[2021-05-13 20:51:51] [INFO ] Deduced a trap composed of 17 places in 122 ms
[2021-05-13 20:51:51] [INFO ] Deduced a trap composed of 30 places in 116 ms
[2021-05-13 20:51:51] [INFO ] Trap strengthening (SAT) tested/added 17/16 trap constraints in 2543 ms
[2021-05-13 20:51:51] [INFO ] Computed and/alt/rep : 561/2502/561 causal constraints in 31 ms.
[2021-05-13 20:51:53] [INFO ] Added : 175 causal constraints over 35 iterations in 1269 ms. Result :(error "Solver has unexpectedly terminated")
[2021-05-13 20:51:53] [INFO ] [Real]Absence check using 61 positive place invariants in 55 ms returned sat
[2021-05-13 20:51:53] [INFO ] [Real]Absence check using 61 positive and 41 generalized place invariants in 31 ms returned sat
[2021-05-13 20:51:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 20:51:54] [INFO ] [Real]Absence check using state equation in 857 ms returned unsat
[2021-05-13 20:51:54] [INFO ] [Real]Absence check using 61 positive place invariants in 44 ms returned sat
[2021-05-13 20:51:54] [INFO ] [Real]Absence check using 61 positive and 41 generalized place invariants in 25 ms returned sat
[2021-05-13 20:51:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 20:51:55] [INFO ] [Real]Absence check using state equation in 778 ms returned sat
[2021-05-13 20:51:55] [INFO ] Deduced a trap composed of 27 places in 333 ms
[2021-05-13 20:51:55] [INFO ] Deduced a trap composed of 139 places in 307 ms
[2021-05-13 20:51:56] [INFO ] Deduced a trap composed of 30 places in 271 ms
[2021-05-13 20:51:56] [INFO ] Deduced a trap composed of 11 places in 306 ms
[2021-05-13 20:51:56] [INFO ] Deduced a trap composed of 25 places in 292 ms
[2021-05-13 20:51:57] [INFO ] Deduced a trap composed of 27 places in 283 ms
[2021-05-13 20:51:57] [INFO ] Deduced a trap composed of 150 places in 271 ms
[2021-05-13 20:51:57] [INFO ] Deduced a trap composed of 158 places in 246 ms
[2021-05-13 20:51:57] [INFO ] Deduced a trap composed of 17 places in 207 ms
[2021-05-13 20:51:58] [INFO ] Deduced a trap composed of 32 places in 217 ms
[2021-05-13 20:51:58] [INFO ] Deduced a trap composed of 12 places in 193 ms
[2021-05-13 20:51:58] [INFO ] Deduced a trap composed of 24 places in 187 ms
[2021-05-13 20:51:58] [INFO ] Deduced a trap composed of 40 places in 210 ms
[2021-05-13 20:51:58] [INFO ] Deduced a trap composed of 23 places in 194 ms
[2021-05-13 20:51:59] [INFO ] Deduced a trap composed of 24 places in 194 ms
[2021-05-13 20:51:59] [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 s168 s173 s174 s255 s256 s257 s258 s259 s260 s261 s262 s263 s381 s382 s383 s392 s400 s402 s403 s404 s550 s551) 0)") while checking expression at index 4
[2021-05-13 20:51:59] [INFO ] [Real]Absence check using 61 positive place invariants in 50 ms returned sat
[2021-05-13 20:51:59] [INFO ] [Real]Absence check using 61 positive and 41 generalized place invariants in 31 ms returned sat
[2021-05-13 20:51:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 20:52:00] [INFO ] [Real]Absence check using state equation in 867 ms returned sat
[2021-05-13 20:52:00] [INFO ] Deduced a trap composed of 12 places in 358 ms
[2021-05-13 20:52:00] [INFO ] Deduced a trap composed of 12 places in 303 ms
[2021-05-13 20:52:01] [INFO ] Deduced a trap composed of 116 places in 329 ms
[2021-05-13 20:52:01] [INFO ] Deduced a trap composed of 23 places in 301 ms
[2021-05-13 20:52:01] [INFO ] Deduced a trap composed of 18 places in 283 ms
[2021-05-13 20:52:02] [INFO ] Deduced a trap composed of 31 places in 276 ms
[2021-05-13 20:52:02] [INFO ] Deduced a trap composed of 125 places in 286 ms
[2021-05-13 20:52:02] [INFO ] Deduced a trap composed of 20 places in 154 ms
[2021-05-13 20:52:02] [INFO ] Deduced a trap composed of 21 places in 156 ms
[2021-05-13 20:52:03] [INFO ] Deduced a trap composed of 23 places in 140 ms
[2021-05-13 20:52:03] [INFO ] Deduced a trap composed of 32 places in 141 ms
[2021-05-13 20:52:03] [INFO ] Deduced a trap composed of 23 places in 266 ms
[2021-05-13 20:52:03] [INFO ] Deduced a trap composed of 17 places in 236 ms
[2021-05-13 20:52:04] [INFO ] Deduced a trap composed of 31 places in 241 ms
[2021-05-13 20:52:04] [INFO ] Deduced a trap composed of 20 places in 293 ms
[2021-05-13 20:52: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 s1 s2 s3 s4 s5 s6 s7 s8 s9 s10 s54 s55 s209 s317 s318 s319 s417 s565 s566) 0)") while checking expression at index 5
[2021-05-13 20:52:04] [INFO ] [Real]Absence check using 61 positive place invariants in 55 ms returned sat
[2021-05-13 20:52:04] [INFO ] [Real]Absence check using 61 positive and 41 generalized place invariants in 35 ms returned sat
[2021-05-13 20:52:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 20:52:05] [INFO ] [Real]Absence check using state equation in 845 ms returned sat
[2021-05-13 20:52:05] [INFO ] Deduced a trap composed of 31 places in 191 ms
[2021-05-13 20:52:05] [INFO ] Deduced a trap composed of 18 places in 148 ms
[2021-05-13 20:52:06] [INFO ] Deduced a trap composed of 26 places in 140 ms
[2021-05-13 20:52:06] [INFO ] Deduced a trap composed of 21 places in 142 ms
[2021-05-13 20:52:06] [INFO ] Deduced a trap composed of 17 places in 140 ms
[2021-05-13 20:52:06] [INFO ] Deduced a trap composed of 32 places in 127 ms
[2021-05-13 20:52:06] [INFO ] Deduced a trap composed of 31 places in 127 ms
[2021-05-13 20:52:06] [INFO ] Deduced a trap composed of 25 places in 124 ms
[2021-05-13 20:52:07] [INFO ] Deduced a trap composed of 32 places in 143 ms
[2021-05-13 20:52:07] [INFO ] Deduced a trap composed of 25 places in 137 ms
[2021-05-13 20:52:07] [INFO ] Deduced a trap composed of 24 places in 170 ms
[2021-05-13 20:52:07] [INFO ] Deduced a trap composed of 16 places in 143 ms
[2021-05-13 20:52:07] [INFO ] Deduced a trap composed of 20 places in 145 ms
[2021-05-13 20:52:07] [INFO ] Deduced a trap composed of 27 places in 137 ms
[2021-05-13 20:52:08] [INFO ] Deduced a trap composed of 23 places in 169 ms
[2021-05-13 20:52:08] [INFO ] Deduced a trap composed of 32 places in 142 ms
[2021-05-13 20:52:08] [INFO ] Deduced a trap composed of 19 places in 173 ms
[2021-05-13 20:52:08] [INFO ] Deduced a trap composed of 21 places in 149 ms
[2021-05-13 20:52:08] [INFO ] Deduced a trap composed of 32 places in 137 ms
[2021-05-13 20:52:08] [INFO ] Deduced a trap composed of 58 places in 134 ms
[2021-05-13 20:52:09] [INFO ] Deduced a trap composed of 24 places in 135 ms
[2021-05-13 20:52:09] [INFO ] Deduced a trap composed of 25 places in 128 ms
[2021-05-13 20:52:09] [INFO ] Deduced a trap composed of 73 places in 147 ms
[2021-05-13 20:52:09] [INFO ] Deduced a trap composed of 28 places in 147 ms
[2021-05-13 20:52: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 s54 s55 s209 s212 s213 s214 s218 s219 s220 s302 s303 s304 s318 s407 s417 s561 s562) 0)") while checking expression at index 6
FORMULA BusinessProcesses-PT-15-ReachabilityFireability-08 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Support contains 29 out of 626 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 626/626 places, 562/562 transitions.
Discarding 4 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Graph (complete) has 1275 edges and 626 vertex of which 622 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.14 ms
Performed 92 Post agglomeration using F-continuation condition.Transition count delta: 92
Iterating post reduction 0 with 92 rules applied. Total rules applied 93 place count 622 transition count 469
Reduce places removed 92 places and 0 transitions.
Iterating post reduction 1 with 92 rules applied. Total rules applied 185 place count 530 transition count 469
Performed 129 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 129 Pre rules applied. Total rules applied 185 place count 530 transition count 340
Deduced a syphon composed of 129 places in 2 ms
Ensure Unique test removed 16 places
Reduce places removed 145 places and 0 transitions.
Iterating global reduction 2 with 274 rules applied. Total rules applied 459 place count 385 transition count 340
Symmetric choice reduction at 2 with 78 rule applications. Total rules 537 place count 385 transition count 340
Deduced a syphon composed of 78 places in 1 ms
Reduce places removed 78 places and 78 transitions.
Iterating global reduction 2 with 156 rules applied. Total rules applied 693 place count 307 transition count 262
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 7 Pre rules applied. Total rules applied 693 place count 307 transition count 255
Deduced a syphon composed of 7 places in 1 ms
Ensure Unique test removed 2 places
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 709 place count 298 transition count 255
Performed 87 Post agglomeration using F-continuation condition.Transition count delta: 87
Deduced a syphon composed of 87 places in 1 ms
Ensure Unique test removed 2 places
Reduce places removed 89 places and 0 transitions.
Iterating global reduction 2 with 176 rules applied. Total rules applied 885 place count 209 transition count 168
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 886 place count 209 transition count 167
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 888 place count 208 transition count 171
Partial Free-agglomeration rule applied 4 times.
Drop transitions removed 4 transitions
Iterating global reduction 3 with 4 rules applied. Total rules applied 892 place count 208 transition count 171
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 893 place count 207 transition count 170
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 894 place count 206 transition count 170
Applied a total of 894 rules in 175 ms. Remains 206 /626 variables (removed 420) and now considering 170/562 (removed 392) transitions.
Finished structural reductions, in 1 iterations. Remains : 206/626 places, 170/562 transitions.
Incomplete random walk after 1000000 steps, including 44980 resets, run finished after 2051 ms. (steps per millisecond=487 ) properties seen :[0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 10354 resets, run finished after 1271 ms. (steps per millisecond=786 ) properties seen :[0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 9543 resets, run finished after 928 ms. (steps per millisecond=1077 ) properties seen :[0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 7044 resets, run finished after 1056 ms. (steps per millisecond=946 ) properties seen :[0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 10340 resets, run finished after 1218 ms. (steps per millisecond=821 ) properties seen :[0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000000 steps, including 10302 resets, run finished after 943 ms. (steps per millisecond=1060 ) properties seen :[0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000000 steps, including 13212 resets, run finished after 1102 ms. (steps per millisecond=907 ) properties seen :[0, 0, 0, 0, 0, 0]
Probably explored full state space saw : 1173267 states, properties seen :[1, 0, 1, 1, 1, 1]
Probabilistic random walk after 7179619 steps, saw 1173267 distinct states, run finished after 12241 ms. (steps per millisecond=586 ) properties seen :[1, 0, 1, 1, 1, 1]
FORMULA BusinessProcesses-PT-15-ReachabilityFireability-13 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA BusinessProcesses-PT-15-ReachabilityFireability-12 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA BusinessProcesses-PT-15-ReachabilityFireability-11 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA BusinessProcesses-PT-15-ReachabilityFireability-06 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA BusinessProcesses-PT-15-ReachabilityFireability-01 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
Explored full state space saw : 1173464 states, properties seen :[0]
Exhaustive walk after 7180879 steps, saw 1173464 distinct states, run finished after 13835 ms. (steps per millisecond=519 ) properties seen :[0]
FORMULA BusinessProcesses-PT-15-ReachabilityFireability-05 FALSE TECHNIQUES TOPOLOGICAL EXHAUSTIVE_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-15"
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-15, 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-162038177000220"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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