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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 452K
-rw-r--r-- 1 mcc users 12K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 108K May 10 09:42 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.2K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 49K 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.7K Mar 28 15:48 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Mar 28 15:48 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K 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.6K Mar 22 12:14 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 14K 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.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 141K 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-11-ReachabilityFireability-00
FORMULA_NAME BusinessProcesses-PT-11-ReachabilityFireability-01
FORMULA_NAME BusinessProcesses-PT-11-ReachabilityFireability-02
FORMULA_NAME BusinessProcesses-PT-11-ReachabilityFireability-03
FORMULA_NAME BusinessProcesses-PT-11-ReachabilityFireability-04
FORMULA_NAME BusinessProcesses-PT-11-ReachabilityFireability-05
FORMULA_NAME BusinessProcesses-PT-11-ReachabilityFireability-06
FORMULA_NAME BusinessProcesses-PT-11-ReachabilityFireability-07
FORMULA_NAME BusinessProcesses-PT-11-ReachabilityFireability-08
FORMULA_NAME BusinessProcesses-PT-11-ReachabilityFireability-09
FORMULA_NAME BusinessProcesses-PT-11-ReachabilityFireability-10
FORMULA_NAME BusinessProcesses-PT-11-ReachabilityFireability-11
FORMULA_NAME BusinessProcesses-PT-11-ReachabilityFireability-12
FORMULA_NAME BusinessProcesses-PT-11-ReachabilityFireability-13
FORMULA_NAME BusinessProcesses-PT-11-ReachabilityFireability-14
FORMULA_NAME BusinessProcesses-PT-11-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1620938157927

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2021-05-13 20:35:59] [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:35:59] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-13 20:35:59] [INFO ] Load time of PNML (sax parser for PT used): 65 ms
[2021-05-13 20:35:59] [INFO ] Transformed 567 places.
[2021-05-13 20:35:59] [INFO ] Transformed 508 transitions.
[2021-05-13 20:35:59] [INFO ] Found NUPN structural information;
[2021-05-13 20:35:59] [INFO ] Parsed PT model containing 567 places and 508 transitions in 110 ms.
Deduced a syphon composed of 7 places in 6 ms
Reduce places removed 7 places and 7 transitions.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 26 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 76 resets, run finished after 72 ms. (steps per millisecond=138 ) properties seen :[1, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0]
FORMULA BusinessProcesses-PT-11-ReachabilityFireability-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-11-ReachabilityFireability-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-11-ReachabilityFireability-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-11-ReachabilityFireability-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 21 ms. (steps per millisecond=476 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 24 ms. (steps per millisecond=416 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 13 resets, run finished after 16 ms. (steps per millisecond=625 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 22 ms. (steps per millisecond=454 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0]
FORMULA BusinessProcesses-PT-11-ReachabilityFireability-10 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 20 ms. (steps per millisecond=500 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 13 resets, run finished after 14 ms. (steps per millisecond=714 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 12 ms. (steps per millisecond=833 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 11 ms. (steps per millisecond=909 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 11 ms. (steps per millisecond=909 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 14 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 13 ms. (steps per millisecond=769 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
// Phase 1: matrix 501 rows 560 cols
[2021-05-13 20:35:59] [INFO ] Computed 95 place invariants in 45 ms
[2021-05-13 20:36:00] [INFO ] [Real]Absence check using 53 positive place invariants in 50 ms returned sat
[2021-05-13 20:36:00] [INFO ] [Real]Absence check using 53 positive and 42 generalized place invariants in 24 ms returned sat
[2021-05-13 20:36:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 20:36:00] [INFO ] [Real]Absence check using state equation in 727 ms returned sat
[2021-05-13 20:36:01] [INFO ] Deduced a trap composed of 18 places in 240 ms
[2021-05-13 20:36:01] [INFO ] Deduced a trap composed of 12 places in 169 ms
[2021-05-13 20:36:01] [INFO ] Deduced a trap composed of 26 places in 163 ms
[2021-05-13 20:36:01] [INFO ] Deduced a trap composed of 17 places in 162 ms
[2021-05-13 20:36:02] [INFO ] Deduced a trap composed of 96 places in 207 ms
[2021-05-13 20:36:02] [INFO ] Deduced a trap composed of 15 places in 223 ms
[2021-05-13 20:36:02] [INFO ] Deduced a trap composed of 18 places in 209 ms
[2021-05-13 20:36:02] [INFO ] Deduced a trap composed of 19 places in 216 ms
[2021-05-13 20:36:03] [INFO ] Deduced a trap composed of 19 places in 209 ms
[2021-05-13 20:36:03] [INFO ] Deduced a trap composed of 23 places in 165 ms
[2021-05-13 20:36:03] [INFO ] Deduced a trap composed of 22 places in 199 ms
[2021-05-13 20:36:03] [INFO ] Deduced a trap composed of 17 places in 249 ms
[2021-05-13 20:36:03] [INFO ] Deduced a trap composed of 16 places in 151 ms
[2021-05-13 20:36:04] [INFO ] Deduced a trap composed of 18 places in 260 ms
[2021-05-13 20:36:04] [INFO ] Deduced a trap composed of 24 places in 198 ms
[2021-05-13 20:36:04] [INFO ] Deduced a trap composed of 21 places in 192 ms
[2021-05-13 20:36:04] [INFO ] Deduced a trap composed of 33 places in 150 ms
[2021-05-13 20:36:05] [INFO ] Deduced a trap composed of 23 places in 147 ms
[2021-05-13 20:36:05] [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 s157 s158 s159 s232 s233 s234 s235 s236 s237 s238 s239 s240 s241 s242 s334 s335 s336 s343 s345 s346 s347) 0)") while checking expression at index 0
[2021-05-13 20:36:05] [INFO ] [Real]Absence check using 53 positive place invariants in 48 ms returned sat
[2021-05-13 20:36:05] [INFO ] [Real]Absence check using 53 positive and 42 generalized place invariants in 35 ms returned sat
[2021-05-13 20:36:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 20:36:06] [INFO ] [Real]Absence check using state equation in 1008 ms returned sat
[2021-05-13 20:36:06] [INFO ] Deduced a trap composed of 17 places in 167 ms
[2021-05-13 20:36:06] [INFO ] Deduced a trap composed of 12 places in 130 ms
[2021-05-13 20:36:06] [INFO ] Deduced a trap composed of 18 places in 109 ms
[2021-05-13 20:36:06] [INFO ] Deduced a trap composed of 17 places in 138 ms
[2021-05-13 20:36:07] [INFO ] Deduced a trap composed of 12 places in 98 ms
[2021-05-13 20:36:07] [INFO ] Deduced a trap composed of 16 places in 133 ms
[2021-05-13 20:36:07] [INFO ] Deduced a trap composed of 26 places in 141 ms
[2021-05-13 20:36:07] [INFO ] Deduced a trap composed of 18 places in 110 ms
[2021-05-13 20:36:07] [INFO ] Deduced a trap composed of 15 places in 118 ms
[2021-05-13 20:36:07] [INFO ] Deduced a trap composed of 36 places in 109 ms
[2021-05-13 20:36:07] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 1605 ms
[2021-05-13 20:36:07] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 20:36:08] [INFO ] [Nat]Absence check using 53 positive place invariants in 70 ms returned sat
[2021-05-13 20:36:08] [INFO ] [Nat]Absence check using 53 positive and 42 generalized place invariants in 33 ms returned sat
[2021-05-13 20:36:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 20:36:09] [INFO ] [Nat]Absence check using state equation in 1038 ms returned sat
[2021-05-13 20:36:09] [INFO ] Deduced a trap composed of 12 places in 247 ms
[2021-05-13 20:36:09] [INFO ] Deduced a trap composed of 11 places in 289 ms
[2021-05-13 20:36:09] [INFO ] Deduced a trap composed of 11 places in 233 ms
[2021-05-13 20:36:10] [INFO ] Deduced a trap composed of 15 places in 467 ms
[2021-05-13 20:36:10] [INFO ] Deduced a trap composed of 17 places in 228 ms
[2021-05-13 20:36:10] [INFO ] Deduced a trap composed of 107 places in 192 ms
[2021-05-13 20:36:11] [INFO ] Deduced a trap composed of 15 places in 190 ms
[2021-05-13 20:36:11] [INFO ] Deduced a trap composed of 23 places in 234 ms
[2021-05-13 20:36:11] [INFO ] Deduced a trap composed of 23 places in 253 ms
[2021-05-13 20:36:12] [INFO ] Deduced a trap composed of 27 places in 239 ms
[2021-05-13 20:36:12] [INFO ] Deduced a trap composed of 20 places in 185 ms
[2021-05-13 20:36:12] [INFO ] Deduced a trap composed of 28 places in 249 ms
[2021-05-13 20:36:12] [INFO ] Deduced a trap composed of 125 places in 209 ms
[2021-05-13 20:36:12] [INFO ] Deduced a trap composed of 96 places in 201 ms
[2021-05-13 20:36:12] [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 s52 s53 s54 s163 s164 s165 s270 s274 s275 s276 s279 s280 s281 s294 s295 s296 s299 s300 s301 s304 s305 s306 s309 s310 s311 s319 s320 s321 s330 s335 s345 s373 s374 s375 s379 s389 s397 s398 s401 s402 s403 s404 s407 s408 s409 s410 s413 s414 s415 s416 s417 s418 s429 s430 s462 s463 s468 s469 s470 s471 s472 s473 s474 s475 s476 s477 s480 s481 s487 s488 s489 s490 s491 s492 s497 s498 s499 s500 s501 s502 s503 s504 s507 s508 s511 s512 s513 s514 s517 s518 s519 s520 s521 s550 s554) 0)") while checking expression at index 1
[2021-05-13 20:36:13] [INFO ] [Real]Absence check using 53 positive place invariants in 74 ms returned sat
[2021-05-13 20:36:13] [INFO ] [Real]Absence check using 53 positive and 42 generalized place invariants in 47 ms returned sat
[2021-05-13 20:36:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 20:36:14] [INFO ] [Real]Absence check using state equation in 954 ms returned sat
[2021-05-13 20:36:14] [INFO ] Deduced a trap composed of 18 places in 301 ms
[2021-05-13 20:36:14] [INFO ] Deduced a trap composed of 11 places in 220 ms
[2021-05-13 20:36:14] [INFO ] Deduced a trap composed of 11 places in 225 ms
[2021-05-13 20:36:15] [INFO ] Deduced a trap composed of 21 places in 219 ms
[2021-05-13 20:36:15] [INFO ] Deduced a trap composed of 12 places in 183 ms
[2021-05-13 20:36:15] [INFO ] Deduced a trap composed of 26 places in 172 ms
[2021-05-13 20:36:15] [INFO ] Deduced a trap composed of 31 places in 244 ms
[2021-05-13 20:36:16] [INFO ] Deduced a trap composed of 28 places in 145 ms
[2021-05-13 20:36:16] [INFO ] Deduced a trap composed of 130 places in 138 ms
[2021-05-13 20:36:16] [INFO ] Deduced a trap composed of 124 places in 168 ms
[2021-05-13 20:36:16] [INFO ] Deduced a trap composed of 22 places in 157 ms
[2021-05-13 20:36:16] [INFO ] Deduced a trap composed of 26 places in 140 ms
[2021-05-13 20:36:16] [INFO ] Deduced a trap composed of 23 places in 176 ms
[2021-05-13 20:36:17] [INFO ] Deduced a trap composed of 22 places in 179 ms
[2021-05-13 20:36:17] [INFO ] Deduced a trap composed of 21 places in 159 ms
[2021-05-13 20:36:17] [INFO ] Deduced a trap composed of 38 places in 165 ms
[2021-05-13 20:36:17] [INFO ] Deduced a trap composed of 113 places in 166 ms
[2021-05-13 20:36:17] [INFO ] Deduced a trap composed of 126 places in 199 ms
[2021-05-13 20:36:18] [INFO ] Deduced a trap composed of 154 places in 134 ms
[2021-05-13 20:36:18] [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 s28 s29 s30 s58 s59 s60 s61 s64 s65 s66 s67 s68 s69 s70 s71 s72 s73 s74 s75 s76 s77 s78 s79 s80 s94 s95 s96 s100 s101 s102 s103 s104 s105 s118 s119 s120 s126 s127 s131 s132 s133 s157 s158 s159 s189 s190 s191 s207 s208 s209 s215 s216 s232 s233 s234 s235 s236 s237 s238 s239 s240 s241 s242 s243 s244 s245 s246 s247 s248 s249 s250 s265 s270 s279 s280 s281 s295 s300 s303 s305 s306 s307 s320 s325 s329 s330 s331 s334 s336 s345 s355 s364 s369 s374 s384 s389 s394 s398 s401 s402 s403 s404 s407 s408 s409 s410 s411 s412 s417 s418 s419 s420 s423 s424 s425 s426 s431 s432 s452 s453 s460 s461 s464 s465 s468 s469 s476 s477 s478 s479 s484 s485 s487 s488 s491 s492 s497 s498 s499 s500 s503 s504 s509 s510 s517 s518 s521 s529 s530 s531 s550 s554) 0)") while checking expression at index 2
[2021-05-13 20:36:18] [INFO ] [Real]Absence check using 53 positive place invariants in 25 ms returned unsat
[2021-05-13 20:36:18] [INFO ] [Real]Absence check using 53 positive place invariants in 43 ms returned sat
[2021-05-13 20:36:18] [INFO ] [Real]Absence check using 53 positive and 42 generalized place invariants in 24 ms returned sat
[2021-05-13 20:36:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 20:36:19] [INFO ] [Real]Absence check using state equation in 753 ms returned sat
[2021-05-13 20:36:19] [INFO ] Deduced a trap composed of 8 places in 260 ms
[2021-05-13 20:36:19] [INFO ] Deduced a trap composed of 12 places in 239 ms
[2021-05-13 20:36:19] [INFO ] Deduced a trap composed of 16 places in 233 ms
[2021-05-13 20:36:20] [INFO ] Deduced a trap composed of 12 places in 243 ms
[2021-05-13 20:36:20] [INFO ] Deduced a trap composed of 23 places in 236 ms
[2021-05-13 20:36:20] [INFO ] Deduced a trap composed of 22 places in 217 ms
[2021-05-13 20:36:20] [INFO ] Deduced a trap composed of 31 places in 176 ms
[2021-05-13 20:36:21] [INFO ] Deduced a trap composed of 27 places in 179 ms
[2021-05-13 20:36:21] [INFO ] Deduced a trap composed of 29 places in 187 ms
[2021-05-13 20:36:21] [INFO ] Deduced a trap composed of 18 places in 167 ms
[2021-05-13 20:36:21] [INFO ] Deduced a trap composed of 120 places in 171 ms
[2021-05-13 20:36:21] [INFO ] Deduced a trap composed of 23 places in 167 ms
[2021-05-13 20:36:22] [INFO ] Deduced a trap composed of 26 places in 156 ms
[2021-05-13 20:36:22] [INFO ] Deduced a trap composed of 32 places in 145 ms
[2021-05-13 20:36:22] [INFO ] Deduced a trap composed of 22 places in 120 ms
[2021-05-13 20:36:22] [INFO ] Deduced a trap composed of 27 places in 156 ms
[2021-05-13 20:36:22] [INFO ] Deduced a trap composed of 38 places in 118 ms
[2021-05-13 20:36:22] [INFO ] Deduced a trap composed of 109 places in 108 ms
[2021-05-13 20:36:22] [INFO ] Trap strengthening (SAT) tested/added 19/18 trap constraints in 3669 ms
[2021-05-13 20:36:22] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 20:36:22] [INFO ] [Nat]Absence check using 53 positive place invariants in 44 ms returned sat
[2021-05-13 20:36:22] [INFO ] [Nat]Absence check using 53 positive and 42 generalized place invariants in 26 ms returned sat
[2021-05-13 20:36:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 20:36:23] [INFO ] [Nat]Absence check using state equation in 854 ms returned sat
[2021-05-13 20:36:23] [INFO ] Deduced a trap composed of 12 places in 155 ms
[2021-05-13 20:36:24] [INFO ] Deduced a trap composed of 11 places in 138 ms
[2021-05-13 20:36:24] [INFO ] Deduced a trap composed of 17 places in 163 ms
[2021-05-13 20:36:24] [INFO ] Deduced a trap composed of 14 places in 120 ms
[2021-05-13 20:36:24] [INFO ] Deduced a trap composed of 18 places in 162 ms
[2021-05-13 20:36:24] [INFO ] Deduced a trap composed of 20 places in 98 ms
[2021-05-13 20:36:24] [INFO ] Deduced a trap composed of 15 places in 147 ms
[2021-05-13 20:36:25] [INFO ] Deduced a trap composed of 16 places in 108 ms
[2021-05-13 20:36:25] [INFO ] Deduced a trap composed of 20 places in 86 ms
[2021-05-13 20:36:25] [INFO ] Deduced a trap composed of 25 places in 96 ms
[2021-05-13 20:36:25] [INFO ] Deduced a trap composed of 19 places in 93 ms
[2021-05-13 20:36:25] [INFO ] Deduced a trap composed of 22 places in 80 ms
[2021-05-13 20:36:25] [INFO ] Deduced a trap composed of 24 places in 97 ms
[2021-05-13 20:36:25] [INFO ] Deduced a trap composed of 20 places in 135 ms
[2021-05-13 20:36:25] [INFO ] Deduced a trap composed of 23 places in 120 ms
[2021-05-13 20:36:26] [INFO ] Deduced a trap composed of 31 places in 125 ms
[2021-05-13 20:36:26] [INFO ] Deduced a trap composed of 29 places in 83 ms
[2021-05-13 20:36:26] [INFO ] Deduced a trap composed of 32 places in 87 ms
[2021-05-13 20:36:26] [INFO ] Deduced a trap composed of 49 places in 86 ms
[2021-05-13 20:36:26] [INFO ] Deduced a trap composed of 34 places in 82 ms
[2021-05-13 20:36:26] [INFO ] Deduced a trap composed of 47 places in 142 ms
[2021-05-13 20:36:26] [INFO ] Trap strengthening (SAT) tested/added 22/21 trap constraints in 2891 ms
[2021-05-13 20:36:26] [INFO ] Computed and/alt/rep : 500/2079/500 causal constraints in 32 ms.
[2021-05-13 20:36:27] [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 (=> (> t210 0) (and (> t206 0) (< o206 o210)))") while checking expression at index 4
[2021-05-13 20:36:27] [INFO ] [Real]Absence check using 53 positive place invariants in 31 ms returned sat
[2021-05-13 20:36:27] [INFO ] [Real]Absence check using 53 positive and 42 generalized place invariants in 19 ms returned sat
[2021-05-13 20:36:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 20:36:28] [INFO ] [Real]Absence check using state equation in 430 ms returned unsat
[2021-05-13 20:36:28] [INFO ] [Real]Absence check using 53 positive place invariants in 66 ms returned sat
[2021-05-13 20:36:28] [INFO ] [Real]Absence check using 53 positive and 42 generalized place invariants in 28 ms returned sat
[2021-05-13 20:36:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 20:36:29] [INFO ] [Real]Absence check using state equation in 606 ms returned unsat
[2021-05-13 20:36:29] [INFO ] [Real]Absence check using 53 positive place invariants in 49 ms returned sat
[2021-05-13 20:36:29] [INFO ] [Real]Absence check using 53 positive and 42 generalized place invariants in 28 ms returned sat
[2021-05-13 20:36:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 20:36:30] [INFO ] [Real]Absence check using state equation in 662 ms returned sat
[2021-05-13 20:36:30] [INFO ] Deduced a trap composed of 13 places in 127 ms
[2021-05-13 20:36:30] [INFO ] Deduced a trap composed of 12 places in 101 ms
[2021-05-13 20:36:30] [INFO ] Deduced a trap composed of 29 places in 102 ms
[2021-05-13 20:36:30] [INFO ] Deduced a trap composed of 22 places in 98 ms
[2021-05-13 20:36:30] [INFO ] Deduced a trap composed of 14 places in 112 ms
[2021-05-13 20:36:30] [INFO ] Deduced a trap composed of 17 places in 125 ms
[2021-05-13 20:36:30] [INFO ] Deduced a trap composed of 22 places in 99 ms
[2021-05-13 20:36:31] [INFO ] Deduced a trap composed of 26 places in 104 ms
[2021-05-13 20:36:31] [INFO ] Deduced a trap composed of 40 places in 89 ms
[2021-05-13 20:36:31] [INFO ] Deduced a trap composed of 24 places in 77 ms
[2021-05-13 20:36:31] [INFO ] Deduced a trap composed of 28 places in 81 ms
[2021-05-13 20:36:31] [INFO ] Deduced a trap composed of 25 places in 139 ms
[2021-05-13 20:36:31] [INFO ] Deduced a trap composed of 30 places in 100 ms
[2021-05-13 20:36:31] [INFO ] Deduced a trap composed of 35 places in 97 ms
[2021-05-13 20:36:31] [INFO ] Trap strengthening (SAT) tested/added 15/14 trap constraints in 1701 ms
[2021-05-13 20:36:31] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 20:36:31] [INFO ] [Nat]Absence check using 53 positive place invariants in 59 ms returned sat
[2021-05-13 20:36:31] [INFO ] [Nat]Absence check using 53 positive and 42 generalized place invariants in 27 ms returned sat
[2021-05-13 20:36:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 20:36:32] [INFO ] [Nat]Absence check using state equation in 796 ms returned sat
[2021-05-13 20:36:32] [INFO ] Deduced a trap composed of 13 places in 187 ms
[2021-05-13 20:36:33] [INFO ] Deduced a trap composed of 12 places in 127 ms
[2021-05-13 20:36:33] [INFO ] Deduced a trap composed of 29 places in 144 ms
[2021-05-13 20:36:33] [INFO ] Deduced a trap composed of 22 places in 150 ms
[2021-05-13 20:36:33] [INFO ] Deduced a trap composed of 14 places in 147 ms
[2021-05-13 20:36:33] [INFO ] Deduced a trap composed of 17 places in 123 ms
[2021-05-13 20:36:33] [INFO ] Deduced a trap composed of 22 places in 113 ms
[2021-05-13 20:36:34] [INFO ] Deduced a trap composed of 26 places in 119 ms
[2021-05-13 20:36:34] [INFO ] Deduced a trap composed of 40 places in 131 ms
[2021-05-13 20:36:34] [INFO ] Deduced a trap composed of 28 places in 111 ms
[2021-05-13 20:36:34] [INFO ] Deduced a trap composed of 29 places in 93 ms
[2021-05-13 20:36:34] [INFO ] Deduced a trap composed of 17 places in 94 ms
[2021-05-13 20:36:34] [INFO ] Deduced a trap composed of 30 places in 99 ms
[2021-05-13 20:36:34] [INFO ] Deduced a trap composed of 29 places in 129 ms
[2021-05-13 20:36:34] [INFO ] Trap strengthening (SAT) tested/added 15/14 trap constraints in 2126 ms
[2021-05-13 20:36:34] [INFO ] Computed and/alt/rep : 500/2079/500 causal constraints in 48 ms.
[2021-05-13 20:36:36] [INFO ] Added : 252 causal constraints over 51 iterations in 1805 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 54 ms.
[2021-05-13 20:36:36] [INFO ] [Real]Absence check using 53 positive place invariants in 57 ms returned sat
[2021-05-13 20:36:36] [INFO ] [Real]Absence check using 53 positive and 42 generalized place invariants in 46 ms returned sat
[2021-05-13 20:36:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 20:36:37] [INFO ] [Real]Absence check using state equation in 916 ms returned sat
[2021-05-13 20:36:38] [INFO ] Deduced a trap composed of 12 places in 268 ms
[2021-05-13 20:36:38] [INFO ] Deduced a trap composed of 12 places in 244 ms
[2021-05-13 20:36:38] [INFO ] Deduced a trap composed of 23 places in 352 ms
[2021-05-13 20:36:39] [INFO ] Deduced a trap composed of 25 places in 266 ms
[2021-05-13 20:36:39] [INFO ] Deduced a trap composed of 23 places in 238 ms
[2021-05-13 20:36:39] [INFO ] Deduced a trap composed of 23 places in 234 ms
[2021-05-13 20:36:39] [INFO ] Deduced a trap composed of 22 places in 230 ms
[2021-05-13 20:36:40] [INFO ] Deduced a trap composed of 38 places in 230 ms
[2021-05-13 20:36:40] [INFO ] Deduced a trap composed of 25 places in 167 ms
[2021-05-13 20:36:40] [INFO ] Deduced a trap composed of 138 places in 229 ms
[2021-05-13 20:36:40] [INFO ] Deduced a trap composed of 35 places in 214 ms
[2021-05-13 20:36:41] [INFO ] Deduced a trap composed of 17 places in 195 ms
[2021-05-13 20:36:41] [INFO ] Deduced a trap composed of 140 places in 234 ms
[2021-05-13 20:36:41] [INFO ] Deduced a trap composed of 143 places in 225 ms
[2021-05-13 20:36:41] [INFO ] Deduced a trap composed of 16 places in 195 ms
[2021-05-13 20:36:41] [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 s232 s233 s234 s235 s236 s368 s369 s370 s372 s374 s375 s376 s495 s496) 0)") while checking expression at index 8
[2021-05-13 20:36:41] [INFO ] [Real]Absence check using 53 positive place invariants in 45 ms returned sat
[2021-05-13 20:36:41] [INFO ] [Real]Absence check using 53 positive and 42 generalized place invariants in 40 ms returned sat
[2021-05-13 20:36:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 20:36:42] [INFO ] [Real]Absence check using state equation in 787 ms returned sat
[2021-05-13 20:36:43] [INFO ] Deduced a trap composed of 8 places in 279 ms
[2021-05-13 20:36:43] [INFO ] Deduced a trap composed of 13 places in 261 ms
[2021-05-13 20:36:43] [INFO ] Deduced a trap composed of 15 places in 234 ms
[2021-05-13 20:36:43] [INFO ] Deduced a trap composed of 17 places in 234 ms
[2021-05-13 20:36:44] [INFO ] Deduced a trap composed of 19 places in 230 ms
[2021-05-13 20:36:44] [INFO ] Deduced a trap composed of 23 places in 174 ms
[2021-05-13 20:36:44] [INFO ] Deduced a trap composed of 97 places in 160 ms
[2021-05-13 20:36:44] [INFO ] Deduced a trap composed of 27 places in 255 ms
[2021-05-13 20:36:44] [INFO ] Deduced a trap composed of 16 places in 156 ms
[2021-05-13 20:36:45] [INFO ] Deduced a trap composed of 17 places in 261 ms
[2021-05-13 20:36:45] [INFO ] Deduced a trap composed of 24 places in 221 ms
[2021-05-13 20:36:45] [INFO ] Deduced a trap composed of 27 places in 226 ms
[2021-05-13 20:36:45] [INFO ] Deduced a trap composed of 133 places in 232 ms
[2021-05-13 20:36:46] [INFO ] Deduced a trap composed of 31 places in 219 ms
[2021-05-13 20:36:46] [INFO ] Deduced a trap composed of 32 places in 148 ms
[2021-05-13 20:36:46] [INFO ] Deduced a trap composed of 118 places in 154 ms
[2021-05-13 20:36:46] [INFO ] Deduced a trap composed of 20 places in 177 ms
[2021-05-13 20:36:47] [INFO ] Deduced a trap composed of 23 places in 250 ms
[2021-05-13 20:36:47] [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 s166 s329 s330 s331 s350 s484 s485 s487 s488 s557) 0)") while checking expression at index 9
[2021-05-13 20:36:47] [INFO ] [Real]Absence check using 53 positive place invariants in 23 ms returned unsat
FORMULA BusinessProcesses-PT-11-ReachabilityFireability-15 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BusinessProcesses-PT-11-ReachabilityFireability-09 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BusinessProcesses-PT-11-ReachabilityFireability-08 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BusinessProcesses-PT-11-ReachabilityFireability-06 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Incomplete Parikh walk after 24600 steps, including 187 resets, run finished after 73 ms. (steps per millisecond=336 ) properties seen :[0, 1, 0, 1, 1, 0, 0] could not realise parikh vector
FORMULA BusinessProcesses-PT-11-ReachabilityFireability-12 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA BusinessProcesses-PT-11-ReachabilityFireability-07 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA BusinessProcesses-PT-11-ReachabilityFireability-04 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Support contains 15 out of 560 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 560/560 places, 501/501 transitions.
Graph (trivial) has 297 edges and 560 vertex of which 7 / 560 are part of one of the 1 SCC in 17 ms
Free SCC test removed 6 places
Discarding 5 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Graph (complete) has 1132 edges and 554 vertex of which 549 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.12 ms
Drop transitions removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Performed 115 Post agglomeration using F-continuation condition.Transition count delta: 115
Iterating post reduction 0 with 123 rules applied. Total rules applied 125 place count 549 transition count 377
Reduce places removed 115 places and 0 transitions.
Iterating post reduction 1 with 115 rules applied. Total rules applied 240 place count 434 transition count 377
Performed 87 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 87 Pre rules applied. Total rules applied 240 place count 434 transition count 290
Deduced a syphon composed of 87 places in 1 ms
Ensure Unique test removed 16 places
Reduce places removed 103 places and 0 transitions.
Iterating global reduction 2 with 190 rules applied. Total rules applied 430 place count 331 transition count 290
Symmetric choice reduction at 2 with 62 rule applications. Total rules 492 place count 331 transition count 290
Deduced a syphon composed of 62 places in 1 ms
Reduce places removed 62 places and 62 transitions.
Iterating global reduction 2 with 124 rules applied. Total rules applied 616 place count 269 transition count 228
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 616 place count 269 transition count 225
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 622 place count 266 transition count 225
Performed 85 Post agglomeration using F-continuation condition.Transition count delta: 85
Deduced a syphon composed of 85 places in 1 ms
Ensure Unique test removed 3 places
Reduce places removed 88 places and 0 transitions.
Iterating global reduction 2 with 173 rules applied. Total rules applied 795 place count 178 transition count 140
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -4
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 797 place count 177 transition count 144
Free-agglomeration rule applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 799 place count 177 transition count 142
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 801 place count 175 transition count 142
Partial Free-agglomeration rule applied 5 times.
Drop transitions removed 5 transitions
Iterating global reduction 3 with 5 rules applied. Total rules applied 806 place count 175 transition count 142
Applied a total of 806 rules in 144 ms. Remains 175 /560 variables (removed 385) and now considering 142/501 (removed 359) transitions.
Finished structural reductions, in 1 iterations. Remains : 175/560 places, 142/501 transitions.
Incomplete random walk after 1000000 steps, including 43850 resets, run finished after 2377 ms. (steps per millisecond=420 ) properties seen :[0, 1, 1, 1]
FORMULA BusinessProcesses-PT-11-ReachabilityFireability-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-11-ReachabilityFireability-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-11-ReachabilityFireability-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Finished Best-First random walk after 130 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=130 )
FORMULA BusinessProcesses-PT-11-ReachabilityFireability-03 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_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-11"
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-11, 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-162038177000204"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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