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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 492K
-rw-r--r-- 1 mcc users 9.4K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 85K May 10 09:42 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.1K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 70K 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 24K Mar 28 15:48 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Mar 28 15:48 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 28 15:48 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.3K Mar 23 03:01 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 16K Mar 23 03:01 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.7K Mar 22 12:15 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 16K 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 177K 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-18-ReachabilityCardinality-00
FORMULA_NAME BusinessProcesses-PT-18-ReachabilityCardinality-01
FORMULA_NAME BusinessProcesses-PT-18-ReachabilityCardinality-02
FORMULA_NAME BusinessProcesses-PT-18-ReachabilityCardinality-03
FORMULA_NAME BusinessProcesses-PT-18-ReachabilityCardinality-04
FORMULA_NAME BusinessProcesses-PT-18-ReachabilityCardinality-05
FORMULA_NAME BusinessProcesses-PT-18-ReachabilityCardinality-06
FORMULA_NAME BusinessProcesses-PT-18-ReachabilityCardinality-07
FORMULA_NAME BusinessProcesses-PT-18-ReachabilityCardinality-08
FORMULA_NAME BusinessProcesses-PT-18-ReachabilityCardinality-09
FORMULA_NAME BusinessProcesses-PT-18-ReachabilityCardinality-10
FORMULA_NAME BusinessProcesses-PT-18-ReachabilityCardinality-11
FORMULA_NAME BusinessProcesses-PT-18-ReachabilityCardinality-12
FORMULA_NAME BusinessProcesses-PT-18-ReachabilityCardinality-13
FORMULA_NAME BusinessProcesses-PT-18-ReachabilityCardinality-14
FORMULA_NAME BusinessProcesses-PT-18-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1620939788372

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2021-05-13 21:03:09] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -timeout, 3600, -rebuildPNML]
[2021-05-13 21:03:09] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-13 21:03:09] [INFO ] Load time of PNML (sax parser for PT used): 82 ms
[2021-05-13 21:03:09] [INFO ] Transformed 717 places.
[2021-05-13 21:03:09] [INFO ] Transformed 642 transitions.
[2021-05-13 21:03:09] [INFO ] Found NUPN structural information;
[2021-05-13 21:03:09] [INFO ] Parsed PT model containing 717 places and 642 transitions in 125 ms.
Deduced a syphon composed of 15 places in 22 ms
Reduce places removed 15 places and 15 transitions.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 42 ms.
Working with output stream class java.io.PrintStream
FORMULA BusinessProcesses-PT-18-ReachabilityCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-18-ReachabilityCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-18-ReachabilityCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-18-ReachabilityCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 53 resets, run finished after 55 ms. (steps per millisecond=181 ) properties seen :[1, 0, 1, 1, 1, 1, 1, 0, 0, 0, 0, 0]
FORMULA BusinessProcesses-PT-18-ReachabilityCardinality-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-18-ReachabilityCardinality-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-18-ReachabilityCardinality-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-18-ReachabilityCardinality-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-18-ReachabilityCardinality-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-18-ReachabilityCardinality-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10000 steps, including 0 resets, run finished after 26 ms. (steps per millisecond=384 ) properties seen :[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]
Incomplete Best-First random walk after 10000 steps, including 9 resets, run finished after 14 ms. (steps per millisecond=714 ) properties seen :[0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 19 ms. (steps per millisecond=526 ) properties seen :[0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 20 ms. (steps per millisecond=500 ) properties seen :[0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 37 ms. (steps per millisecond=270 ) properties seen :[0, 0, 0, 0, 0, 0]
// Phase 1: matrix 627 rows 702 cols
[2021-05-13 21:03:10] [INFO ] Computed 114 place invariants in 32 ms
[2021-05-13 21:03:10] [INFO ] [Real]Absence check using 73 positive place invariants in 63 ms returned sat
[2021-05-13 21:03:10] [INFO ] [Real]Absence check using 73 positive and 41 generalized place invariants in 24 ms returned sat
[2021-05-13 21:03:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 21:03:11] [INFO ] [Real]Absence check using state equation in 951 ms returned sat
[2021-05-13 21:03:11] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 21:03:11] [INFO ] [Nat]Absence check using 73 positive place invariants in 49 ms returned unsat
[2021-05-13 21:03:11] [INFO ] [Real]Absence check using 73 positive place invariants in 44 ms returned sat
[2021-05-13 21:03:11] [INFO ] [Real]Absence check using 73 positive and 41 generalized place invariants in 22 ms returned sat
[2021-05-13 21:03:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 21:03:12] [INFO ] [Real]Absence check using state equation in 945 ms returned sat
[2021-05-13 21:03:12] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 21:03:12] [INFO ] [Nat]Absence check using 73 positive place invariants in 56 ms returned sat
[2021-05-13 21:03:12] [INFO ] [Nat]Absence check using 73 positive and 41 generalized place invariants in 22 ms returned sat
[2021-05-13 21:03:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 21:03:13] [INFO ] [Nat]Absence check using state equation in 888 ms returned sat
[2021-05-13 21:03:14] [INFO ] Deduced a trap composed of 8 places in 403 ms
[2021-05-13 21:03:14] [INFO ] Deduced a trap composed of 12 places in 366 ms
[2021-05-13 21:03:15] [INFO ] Deduced a trap composed of 19 places in 338 ms
[2021-05-13 21:03:15] [INFO ] Deduced a trap composed of 8 places in 344 ms
[2021-05-13 21:03:15] [INFO ] Deduced a trap composed of 18 places in 349 ms
[2021-05-13 21:03:16] [INFO ] Deduced a trap composed of 16 places in 305 ms
[2021-05-13 21:03:16] [INFO ] Deduced a trap composed of 22 places in 365 ms
[2021-05-13 21:03:16] [INFO ] Deduced a trap composed of 24 places in 327 ms
[2021-05-13 21:03:17] [INFO ] Deduced a trap composed of 23 places in 331 ms
[2021-05-13 21:03:17] [INFO ] Deduced a trap composed of 18 places in 302 ms
[2021-05-13 21:03:17] [INFO ] Deduced a trap composed of 20 places in 301 ms
[2021-05-13 21:03:17] [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 s245 s250 s251 s481 s482 s483 s650 s651 s654) 0)") while checking expression at index 1
[2021-05-13 21:03:18] [INFO ] [Real]Absence check using 73 positive place invariants in 64 ms returned sat
[2021-05-13 21:03:18] [INFO ] [Real]Absence check using 73 positive and 41 generalized place invariants in 29 ms returned sat
[2021-05-13 21:03:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 21:03:19] [INFO ] [Real]Absence check using state equation in 939 ms returned sat
[2021-05-13 21:03:19] [INFO ] Deduced a trap composed of 17 places in 183 ms
[2021-05-13 21:03:19] [INFO ] Deduced a trap composed of 14 places in 134 ms
[2021-05-13 21:03:19] [INFO ] Deduced a trap composed of 18 places in 132 ms
[2021-05-13 21:03:19] [INFO ] Deduced a trap composed of 21 places in 182 ms
[2021-05-13 21:03:19] [INFO ] Deduced a trap composed of 30 places in 130 ms
[2021-05-13 21:03:20] [INFO ] Deduced a trap composed of 36 places in 173 ms
[2021-05-13 21:03:20] [INFO ] Deduced a trap composed of 39 places in 178 ms
[2021-05-13 21:03:20] [INFO ] Deduced a trap composed of 54 places in 141 ms
[2021-05-13 21:03:20] [INFO ] Deduced a trap composed of 60 places in 134 ms
[2021-05-13 21:03:20] [INFO ] Deduced a trap composed of 60 places in 111 ms
[2021-05-13 21:03:21] [INFO ] Deduced a trap composed of 57 places in 143 ms
[2021-05-13 21:03:21] [INFO ] Deduced a trap composed of 9 places in 119 ms
[2021-05-13 21:03:21] [INFO ] Deduced a trap composed of 66 places in 119 ms
[2021-05-13 21:03:21] [INFO ] Deduced a trap composed of 71 places in 115 ms
[2021-05-13 21:03:21] [INFO ] Deduced a trap composed of 70 places in 114 ms
[2021-05-13 21:03:21] [INFO ] Deduced a trap composed of 56 places in 145 ms
[2021-05-13 21:03:21] [INFO ] Deduced a trap composed of 63 places in 100 ms
[2021-05-13 21:03:22] [INFO ] Deduced a trap composed of 63 places in 131 ms
[2021-05-13 21:03:22] [INFO ] Deduced a trap composed of 64 places in 104 ms
[2021-05-13 21:03:22] [INFO ] Deduced a trap composed of 63 places in 95 ms
[2021-05-13 21:03:22] [INFO ] Deduced a trap composed of 72 places in 109 ms
[2021-05-13 21:03:22] [INFO ] Deduced a trap composed of 32 places in 96 ms
[2021-05-13 21:03:22] [INFO ] Deduced a trap composed of 48 places in 108 ms
[2021-05-13 21:03:22] [INFO ] Deduced a trap composed of 51 places in 112 ms
[2021-05-13 21:03:23] [INFO ] Deduced a trap composed of 29 places in 177 ms
[2021-05-13 21:03:23] [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 s13 s14 s15 s16 s17 s18 s19 s186 s416 s417 s418 s422 s598 s599 s606 s607) 0)") while checking expression at index 2
[2021-05-13 21:03:23] [INFO ] [Real]Absence check using 73 positive place invariants in 68 ms returned sat
[2021-05-13 21:03:23] [INFO ] [Real]Absence check using 73 positive and 41 generalized place invariants in 35 ms returned sat
[2021-05-13 21:03:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 21:03:24] [INFO ] [Real]Absence check using state equation in 1088 ms returned sat
[2021-05-13 21:03:24] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 21:03:24] [INFO ] [Nat]Absence check using 73 positive place invariants in 125 ms returned sat
[2021-05-13 21:03:24] [INFO ] [Nat]Absence check using 73 positive and 41 generalized place invariants in 34 ms returned sat
[2021-05-13 21:03:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 21:03:25] [INFO ] [Nat]Absence check using state equation in 1215 ms returned sat
[2021-05-13 21:03:26] [INFO ] Deduced a trap composed of 8 places in 322 ms
[2021-05-13 21:03:26] [INFO ] Deduced a trap composed of 13 places in 311 ms
[2021-05-13 21:03:26] [INFO ] Deduced a trap composed of 11 places in 318 ms
[2021-05-13 21:03:27] [INFO ] Deduced a trap composed of 22 places in 276 ms
[2021-05-13 21:03:27] [INFO ] Deduced a trap composed of 14 places in 259 ms
[2021-05-13 21:03:27] [INFO ] Deduced a trap composed of 18 places in 252 ms
[2021-05-13 21:03:28] [INFO ] Deduced a trap composed of 26 places in 312 ms
[2021-05-13 21:03:28] [INFO ] Deduced a trap composed of 17 places in 271 ms
[2021-05-13 21:03:28] [INFO ] Deduced a trap composed of 22 places in 296 ms
[2021-05-13 21:03:29] [INFO ] Deduced a trap composed of 21 places in 272 ms
[2021-05-13 21:03:29] [INFO ] Deduced a trap composed of 127 places in 289 ms
[2021-05-13 21:03:29] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-13 21:03:29] [INFO ] Deduced a trap composed of 7 places in 437 ms
[2021-05-13 21:03:29] [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 s278 s279 s280 s281) 0)") while checking expression at index 3
[2021-05-13 21:03:29] [INFO ] [Real]Absence check using 73 positive place invariants in 50 ms returned sat
[2021-05-13 21:03:29] [INFO ] [Real]Absence check using 73 positive and 41 generalized place invariants in 21 ms returned sat
[2021-05-13 21:03:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 21:03:30] [INFO ] [Real]Absence check using state equation in 904 ms returned sat
[2021-05-13 21:03:31] [INFO ] Deduced a trap composed of 11 places in 326 ms
[2021-05-13 21:03:31] [INFO ] Deduced a trap composed of 14 places in 278 ms
[2021-05-13 21:03:31] [INFO ] Deduced a trap composed of 8 places in 280 ms
[2021-05-13 21:03:32] [INFO ] Deduced a trap composed of 19 places in 289 ms
[2021-05-13 21:03:32] [INFO ] Deduced a trap composed of 18 places in 296 ms
[2021-05-13 21:03:32] [INFO ] Deduced a trap composed of 15 places in 307 ms
[2021-05-13 21:03:33] [INFO ] Deduced a trap composed of 21 places in 251 ms
[2021-05-13 21:03:33] [INFO ] Deduced a trap composed of 25 places in 285 ms
[2021-05-13 21:03:33] [INFO ] Deduced a trap composed of 28 places in 273 ms
[2021-05-13 21:03:34] [INFO ] Deduced a trap composed of 26 places in 228 ms
[2021-05-13 21:03:34] [INFO ] Deduced a trap composed of 32 places in 227 ms
[2021-05-13 21:03:34] [INFO ] Deduced a trap composed of 31 places in 228 ms
[2021-05-13 21:03:34] [INFO ] Deduced a trap composed of 33 places in 226 ms
[2021-05-13 21:03:35] [INFO ] Deduced a trap composed of 130 places in 282 ms
[2021-05-13 21:03:35] [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 s58 s59 s60 s71 s72 s73 s111 s112 s113 s177 s178 s179 s218 s219 s220 s230 s231 s232 s236 s237 s238 s242 s243 s244 s246 s247 s250 s251 s278 s281 s320 s339 s344 s348 s352 s371 s372 s373 s381 s382 s383 s406 s407 s408 s411 s412 s413 s416 s417 s418 s426 s428 s431 s432 s433 s446 s447 s448 s451 s452 s453 s457 s461 s463 s467 s472 s482 s492 s496 s497 s498 s502 s506 s507 s508 s509 s510 s513 s514 s515 s516 s517 s518 s521 s522 s523 s524 s525 s526 s527 s528 s533 s534 s535 s536 s555 s556 s557 s558 s559 s560 s563 s564 s565 s566 s600 s601 s602 s603 s610 s611 s612 s613 s614 s624 s625 s628 s629 s646 s647 s661 s662 s669 s670 s671 s672 s673) 0)") while checking expression at index 4
[2021-05-13 21:03:35] [INFO ] [Real]Absence check using 73 positive place invariants in 61 ms returned sat
[2021-05-13 21:03:35] [INFO ] [Real]Absence check using 73 positive and 41 generalized place invariants in 29 ms returned sat
[2021-05-13 21:03:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 21:03:36] [INFO ] [Real]Absence check using state equation in 1166 ms returned sat
[2021-05-13 21:03:36] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 21:03:36] [INFO ] [Nat]Absence check using 73 positive place invariants in 92 ms returned sat
[2021-05-13 21:03:36] [INFO ] [Nat]Absence check using 73 positive and 41 generalized place invariants in 27 ms returned sat
[2021-05-13 21:03:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 21:03:37] [INFO ] [Nat]Absence check using state equation in 891 ms returned sat
[2021-05-13 21:03:37] [INFO ] Deduced a trap composed of 8 places in 311 ms
[2021-05-13 21:03:38] [INFO ] Deduced a trap composed of 14 places in 277 ms
[2021-05-13 21:03:38] [INFO ] Deduced a trap composed of 13 places in 296 ms
[2021-05-13 21:03:38] [INFO ] Deduced a trap composed of 144 places in 265 ms
[2021-05-13 21:03:39] [INFO ] Deduced a trap composed of 144 places in 248 ms
[2021-05-13 21:03:39] [INFO ] Deduced a trap composed of 23 places in 279 ms
[2021-05-13 21:03:39] [INFO ] Deduced a trap composed of 145 places in 244 ms
[2021-05-13 21:03:39] [INFO ] Deduced a trap composed of 21 places in 235 ms
[2021-05-13 21:03:40] [INFO ] Deduced a trap composed of 11 places in 271 ms
[2021-05-13 21:03:40] [INFO ] Deduced a trap composed of 17 places in 279 ms
[2021-05-13 21:03:40] [INFO ] Deduced a trap composed of 45 places in 250 ms
[2021-05-13 21:03:41] [INFO ] Deduced a trap composed of 43 places in 269 ms
[2021-05-13 21:03:41] [INFO ] Deduced a trap composed of 34 places in 237 ms
[2021-05-13 21:03:41] [INFO ] Deduced a trap composed of 40 places in 263 ms
[2021-05-13 21:03: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 s2 s3 s4 s5 s6 s7 s8 s9 s10 s11 s12 s13 s14 s15 s16 s17 s18 s19 s20 s21 s22 s23 s24 s25 s26 s27 s28 s29 s74 s77 s78 s79 s371 s372 s373 s377 s547 s548) 0)") while checking expression at index 5
FORMULA BusinessProcesses-PT-18-ReachabilityCardinality-03 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Support contains 14 out of 702 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 702/702 places, 627/627 transitions.
Graph (trivial) has 394 edges and 702 vertex of which 8 / 702 are part of one of the 1 SCC in 4 ms
Free SCC test removed 7 places
Discarding 9 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Graph (complete) has 1408 edges and 695 vertex of which 686 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.6 ms
Drop transitions removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Performed 157 Post agglomeration using F-continuation condition.Transition count delta: 157
Iterating post reduction 0 with 167 rules applied. Total rules applied 169 place count 686 transition count 459
Reduce places removed 157 places and 0 transitions.
Iterating post reduction 1 with 157 rules applied. Total rules applied 326 place count 529 transition count 459
Performed 101 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 101 Pre rules applied. Total rules applied 326 place count 529 transition count 358
Deduced a syphon composed of 101 places in 2 ms
Ensure Unique test removed 23 places
Reduce places removed 124 places and 0 transitions.
Iterating global reduction 2 with 225 rules applied. Total rules applied 551 place count 405 transition count 358
Symmetric choice reduction at 2 with 87 rule applications. Total rules 638 place count 405 transition count 358
Deduced a syphon composed of 87 places in 1 ms
Reduce places removed 87 places and 87 transitions.
Iterating global reduction 2 with 174 rules applied. Total rules applied 812 place count 318 transition count 271
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 9 Pre rules applied. Total rules applied 812 place count 318 transition count 262
Deduced a syphon composed of 9 places in 1 ms
Ensure Unique test removed 3 places
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 21 rules applied. Total rules applied 833 place count 306 transition count 262
Symmetric choice reduction at 2 with 1 rule applications. Total rules 834 place count 306 transition count 262
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 836 place count 305 transition count 261
Performed 108 Post agglomeration using F-continuation condition.Transition count delta: 108
Deduced a syphon composed of 108 places in 0 ms
Reduce places removed 108 places and 0 transitions.
Iterating global reduction 2 with 216 rules applied. Total rules applied 1052 place count 197 transition count 153
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 1054 place count 196 transition count 156
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 1055 place count 196 transition count 155
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1056 place count 195 transition count 155
Applied a total of 1056 rules in 132 ms. Remains 195 /702 variables (removed 507) and now considering 155/627 (removed 472) transitions.
Finished structural reductions, in 1 iterations. Remains : 195/702 places, 155/627 transitions.
Finished random walk after 896 steps, including 53 resets, run visited all 5 properties in 8 ms. (steps per millisecond=112 )
FORMULA BusinessProcesses-PT-18-ReachabilityCardinality-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-18-ReachabilityCardinality-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-18-ReachabilityCardinality-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-18-ReachabilityCardinality-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-18-ReachabilityCardinality-11 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-18"
export BK_EXAMINATION="ReachabilityCardinality"
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-18, examination is ReachabilityCardinality"
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-162038177100231"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/BusinessProcesses-PT-18.tgz
mv BusinessProcesses-PT-18 execution
cd execution
if [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "UpperBounds" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] || [ "ReachabilityCardinality" = "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 [ "ReachabilityCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityCardinality" != "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 "ReachabilityCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityCardinality.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 '' ReachabilityCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityCardinality"
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 ;