fond
Model Checking Contest 2021
11th edition, Paris, France, June 23, 2021
Execution of r037-tajo-162038177000179
Last Updated
Jun 28, 2021

About the Execution of 2020-gold for BusinessProcesses-PT-05

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
266.308 3600000.00 39104.00 93.90 TFTFFFTFFTFFTFTF normal

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 408K
-rw-r--r-- 1 mcc users 12K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 105K May 10 09:42 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.2K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 64K 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.1K 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 16K Mar 28 15:48 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K Mar 23 03:00 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 19K 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.7K Mar 22 09:10 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 5 16:51 equiv_col
-rw-r--r-- 1 mcc users 3 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 85K 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-05-ReachabilityCardinality-00
FORMULA_NAME BusinessProcesses-PT-05-ReachabilityCardinality-01
FORMULA_NAME BusinessProcesses-PT-05-ReachabilityCardinality-02
FORMULA_NAME BusinessProcesses-PT-05-ReachabilityCardinality-03
FORMULA_NAME BusinessProcesses-PT-05-ReachabilityCardinality-04
FORMULA_NAME BusinessProcesses-PT-05-ReachabilityCardinality-05
FORMULA_NAME BusinessProcesses-PT-05-ReachabilityCardinality-06
FORMULA_NAME BusinessProcesses-PT-05-ReachabilityCardinality-07
FORMULA_NAME BusinessProcesses-PT-05-ReachabilityCardinality-08
FORMULA_NAME BusinessProcesses-PT-05-ReachabilityCardinality-09
FORMULA_NAME BusinessProcesses-PT-05-ReachabilityCardinality-10
FORMULA_NAME BusinessProcesses-PT-05-ReachabilityCardinality-11
FORMULA_NAME BusinessProcesses-PT-05-ReachabilityCardinality-12
FORMULA_NAME BusinessProcesses-PT-05-ReachabilityCardinality-13
FORMULA_NAME BusinessProcesses-PT-05-ReachabilityCardinality-14
FORMULA_NAME BusinessProcesses-PT-05-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1620936297520

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2021-05-13 20:04:59] [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 20:04:59] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-13 20:04:59] [INFO ] Load time of PNML (sax parser for PT used): 63 ms
[2021-05-13 20:04:59] [INFO ] Transformed 368 places.
[2021-05-13 20:04:59] [INFO ] Transformed 319 transitions.
[2021-05-13 20:04:59] [INFO ] Found NUPN structural information;
[2021-05-13 20:04:59] [INFO ] Parsed PT model containing 368 places and 319 transitions in 99 ms.
[2021-05-13 20:04:59] [INFO ] Initial state test concluded for 1 properties.
Deduced a syphon composed of 1 places in 7 ms
Reduce places removed 1 places and 1 transitions.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 26 ms.
Working with output stream class java.io.PrintStream
FORMULA BusinessProcesses-PT-05-ReachabilityCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-05-ReachabilityCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-05-ReachabilityCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-05-ReachabilityCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-05-ReachabilityCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-05-ReachabilityCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-05-ReachabilityCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-05-ReachabilityCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-05-ReachabilityCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-05-ReachabilityCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 97 resets, run finished after 61 ms. (steps per millisecond=163 ) properties seen :[0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 14 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 15 resets, run finished after 17 ms. (steps per millisecond=588 ) properties seen :[0, 1, 0, 0, 0, 0]
FORMULA BusinessProcesses-PT-05-ReachabilityCardinality-02 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 17 resets, run finished after 23 ms. (steps per millisecond=434 ) properties seen :[0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 17 resets, run finished after 24 ms. (steps per millisecond=416 ) properties seen :[0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 16 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties seen :[0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 15 resets, run finished after 21 ms. (steps per millisecond=476 ) properties seen :[0, 0, 0, 0, 0]
// Phase 1: matrix 318 rows 367 cols
[2021-05-13 20:05:00] [INFO ] Computed 57 place invariants in 15 ms
[2021-05-13 20:05:00] [INFO ] [Real]Absence check using 41 positive place invariants in 38 ms returned sat
[2021-05-13 20:05:00] [INFO ] [Real]Absence check using 41 positive and 16 generalized place invariants in 12 ms returned sat
[2021-05-13 20:05:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 20:05:00] [INFO ] [Real]Absence check using state equation in 361 ms returned sat
[2021-05-13 20:05:00] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 20:05:00] [INFO ] [Nat]Absence check using 41 positive place invariants in 41 ms returned sat
[2021-05-13 20:05:00] [INFO ] [Nat]Absence check using 41 positive and 16 generalized place invariants in 5 ms returned sat
[2021-05-13 20:05:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 20:05:01] [INFO ] [Nat]Absence check using state equation in 279 ms returned unsat
[2021-05-13 20:05:01] [INFO ] [Real]Absence check using 41 positive place invariants in 38 ms returned sat
[2021-05-13 20:05:01] [INFO ] [Real]Absence check using 41 positive and 16 generalized place invariants in 5 ms returned sat
[2021-05-13 20:05:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 20:05:01] [INFO ] [Real]Absence check using state equation in 290 ms returned sat
[2021-05-13 20:05:01] [INFO ] Deduced a trap composed of 16 places in 166 ms
[2021-05-13 20:05:01] [INFO ] Deduced a trap composed of 19 places in 107 ms
[2021-05-13 20:05:01] [INFO ] Deduced a trap composed of 17 places in 92 ms
[2021-05-13 20:05:02] [INFO ] Deduced a trap composed of 23 places in 152 ms
[2021-05-13 20:05:02] [INFO ] Deduced a trap composed of 8 places in 136 ms
[2021-05-13 20:05:02] [INFO ] Deduced a trap composed of 15 places in 133 ms
[2021-05-13 20:05:02] [INFO ] Deduced a trap composed of 18 places in 121 ms
[2021-05-13 20:05:02] [INFO ] Deduced a trap composed of 97 places in 138 ms
[2021-05-13 20:05:02] [INFO ] Deduced a trap composed of 21 places in 115 ms
[2021-05-13 20:05:03] [INFO ] Deduced a trap composed of 15 places in 141 ms
[2021-05-13 20:05:03] [INFO ] Deduced a trap composed of 32 places in 121 ms
[2021-05-13 20:05:03] [INFO ] Deduced a trap composed of 18 places in 98 ms
[2021-05-13 20:05:03] [INFO ] Deduced a trap composed of 85 places in 99 ms
[2021-05-13 20:05:03] [INFO ] Deduced a trap composed of 90 places in 107 ms
[2021-05-13 20:05:03] [INFO ] Deduced a trap composed of 17 places in 90 ms
[2021-05-13 20:05:03] [INFO ] Deduced a trap composed of 97 places in 142 ms
[2021-05-13 20:05:03] [INFO ] Deduced a trap composed of 47 places in 136 ms
[2021-05-13 20:05:04] [INFO ] Deduced a trap composed of 93 places in 97 ms
[2021-05-13 20:05:04] [INFO ] Deduced a trap composed of 27 places in 115 ms
[2021-05-13 20:05:04] [INFO ] Deduced a trap composed of 36 places in 89 ms
[2021-05-13 20:05:04] [INFO ] Deduced a trap composed of 94 places in 78 ms
[2021-05-13 20:05:04] [INFO ] Deduced a trap composed of 19 places in 89 ms
[2021-05-13 20:05:04] [INFO ] Deduced a trap composed of 34 places in 79 ms
[2021-05-13 20:05:04] [INFO ] Deduced a trap composed of 93 places in 100 ms
[2021-05-13 20:05:04] [INFO ] Deduced a trap composed of 93 places in 80 ms
[2021-05-13 20:05:05] [INFO ] Deduced a trap composed of 93 places in 458 ms
[2021-05-13 20:05:05] [INFO ] Deduced a trap composed of 94 places in 84 ms
[2021-05-13 20:05:05] [INFO ] Deduced a trap composed of 88 places in 651 ms
[2021-05-13 20:05:06] [INFO ] Deduced a trap composed of 94 places in 91 ms
[2021-05-13 20:05:06] [INFO ] Deduced a trap composed of 90 places in 69 ms
[2021-05-13 20:05:06] [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 s30 s31 s33 s34 s37 s38 s47 s48 s51 s52 s60 s61 s62 s63 s64 s65 s68 s69 s73 s74 s75 s95 s96 s100 s101 s102 s106 s107 s108 s124 s125 s126 s131 s134 s163 s168 s173 s178 s183 s188 s198 s218 s233 s238 s252 s253 s254 s257 s259 s263 s267 s268 s269 s270 s271 s272 s273 s274 s275 s276 s277 s278 s279 s280 s298 s299 s307 s308 s309 s310 s322 s323 s330 s331 s338 s339 s340 s341 s344 s345 s348 s349 s358 s359 s364 s365 s366) 0)") while checking expression at index 1
[2021-05-13 20:05:06] [INFO ] [Real]Absence check using 41 positive place invariants in 18 ms returned sat
[2021-05-13 20:05:06] [INFO ] [Real]Absence check using 41 positive and 16 generalized place invariants in 5 ms returned sat
[2021-05-13 20:05:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 20:05:06] [INFO ] [Real]Absence check using state equation in 249 ms returned sat
[2021-05-13 20:05:06] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 20:05:06] [INFO ] [Nat]Absence check using 41 positive place invariants in 59 ms returned sat
[2021-05-13 20:05:06] [INFO ] [Nat]Absence check using 41 positive and 16 generalized place invariants in 4 ms returned sat
[2021-05-13 20:05:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 20:05:06] [INFO ] [Nat]Absence check using state equation in 241 ms returned sat
[2021-05-13 20:05:07] [INFO ] Deduced a trap composed of 8 places in 164 ms
[2021-05-13 20:05:07] [INFO ] Deduced a trap composed of 11 places in 210 ms
[2021-05-13 20:05:07] [INFO ] Deduced a trap composed of 10 places in 71 ms
[2021-05-13 20:05:07] [INFO ] Deduced a trap composed of 15 places in 81 ms
[2021-05-13 20:05:07] [INFO ] Deduced a trap composed of 11 places in 56 ms
[2021-05-13 20:05:07] [INFO ] Deduced a trap composed of 15 places in 66 ms
[2021-05-13 20:05:07] [INFO ] Deduced a trap composed of 21 places in 90 ms
[2021-05-13 20:05:07] [INFO ] Deduced a trap composed of 13 places in 84 ms
[2021-05-13 20:05:07] [INFO ] Deduced a trap composed of 15 places in 59 ms
[2021-05-13 20:05:07] [INFO ] Deduced a trap composed of 26 places in 49 ms
[2021-05-13 20:05:08] [INFO ] Deduced a trap composed of 21 places in 50 ms
[2021-05-13 20:05:08] [INFO ] Deduced a trap composed of 20 places in 47 ms
[2021-05-13 20:05:08] [INFO ] Deduced a trap composed of 32 places in 88 ms
[2021-05-13 20:05:08] [INFO ] Deduced a trap composed of 15 places in 45 ms
[2021-05-13 20:05:08] [INFO ] Deduced a trap composed of 36 places in 67 ms
[2021-05-13 20:05:08] [INFO ] Deduced a trap composed of 40 places in 54 ms
[2021-05-13 20:05:08] [INFO ] Deduced a trap composed of 45 places in 45 ms
[2021-05-13 20:05:08] [INFO ] Deduced a trap composed of 45 places in 37 ms
[2021-05-13 20:05:08] [INFO ] Deduced a trap composed of 41 places in 52 ms
[2021-05-13 20:05:08] [INFO ] Deduced a trap composed of 50 places in 38 ms
[2021-05-13 20:05:08] [INFO ] Deduced a trap composed of 11 places in 47 ms
[2021-05-13 20:05:08] [INFO ] Deduced a trap composed of 33 places in 33 ms
[2021-05-13 20:05:08] [INFO ] Deduced a trap composed of 27 places in 46 ms
[2021-05-13 20:05:08] [INFO ] Deduced a trap composed of 29 places in 39 ms
[2021-05-13 20:05:08] [INFO ] Deduced a trap composed of 52 places in 36 ms
[2021-05-13 20:05:08] [INFO ] Deduced a trap composed of 47 places in 38 ms
[2021-05-13 20:05:08] [INFO ] Deduced a trap composed of 46 places in 45 ms
[2021-05-13 20:05:09] [INFO ] Deduced a trap composed of 42 places in 33 ms
[2021-05-13 20:05:09] [INFO ] Trap strengthening (SAT) tested/added 29/28 trap constraints in 2225 ms
[2021-05-13 20:05:09] [INFO ] Computed and/alt/rep : 317/1114/317 causal constraints in 20 ms.
[2021-05-13 20:05:10] [INFO ] Added : 200 causal constraints over 41 iterations in 1305 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 28 ms.
[2021-05-13 20:05:10] [INFO ] [Real]Absence check using 41 positive place invariants in 23 ms returned sat
[2021-05-13 20:05:10] [INFO ] [Real]Absence check using 41 positive and 16 generalized place invariants in 5 ms returned sat
[2021-05-13 20:05:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 20:05:10] [INFO ] [Real]Absence check using state equation in 288 ms returned sat
[2021-05-13 20:05:10] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 20:05:11] [INFO ] [Nat]Absence check using 41 positive place invariants in 65 ms returned sat
[2021-05-13 20:05:11] [INFO ] [Nat]Absence check using 41 positive and 16 generalized place invariants in 5 ms returned sat
[2021-05-13 20:05:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 20:05:11] [INFO ] [Nat]Absence check using state equation in 240 ms returned sat
[2021-05-13 20:05:11] [INFO ] Deduced a trap composed of 12 places in 79 ms
[2021-05-13 20:05:11] [INFO ] Deduced a trap composed of 11 places in 75 ms
[2021-05-13 20:05:11] [INFO ] Deduced a trap composed of 8 places in 157 ms
[2021-05-13 20:05:11] [INFO ] Deduced a trap composed of 15 places in 83 ms
[2021-05-13 20:05:11] [INFO ] Deduced a trap composed of 14 places in 76 ms
[2021-05-13 20:05:11] [INFO ] Deduced a trap composed of 19 places in 79 ms
[2021-05-13 20:05:11] [INFO ] Deduced a trap composed of 19 places in 79 ms
[2021-05-13 20:05:12] [INFO ] Deduced a trap composed of 26 places in 81 ms
[2021-05-13 20:05:12] [INFO ] Deduced a trap composed of 96 places in 93 ms
[2021-05-13 20:05:12] [INFO ] Deduced a trap composed of 91 places in 92 ms
[2021-05-13 20:05:12] [INFO ] Deduced a trap composed of 95 places in 79 ms
[2021-05-13 20:05:12] [INFO ] Deduced a trap composed of 12 places in 74 ms
[2021-05-13 20:05:12] [INFO ] Deduced a trap composed of 18 places in 79 ms
[2021-05-13 20:05:12] [INFO ] Deduced a trap composed of 38 places in 86 ms
[2021-05-13 20:05:12] [INFO ] Deduced a trap composed of 83 places in 63 ms
[2021-05-13 20:05:12] [INFO ] Deduced a trap composed of 25 places in 65 ms
[2021-05-13 20:05:12] [INFO ] Deduced a trap composed of 24 places in 66 ms
[2021-05-13 20:05:12] [INFO ] Deduced a trap composed of 31 places in 72 ms
[2021-05-13 20:05:13] [INFO ] Deduced a trap composed of 93 places in 66 ms
[2021-05-13 20:05:13] [INFO ] Deduced a trap composed of 41 places in 413 ms
[2021-05-13 20:05:13] [INFO ] Deduced a trap composed of 30 places in 58 ms
[2021-05-13 20:05:13] [INFO ] Deduced a trap composed of 37 places in 74 ms
[2021-05-13 20:05:13] [INFO ] Deduced a trap composed of 37 places in 75 ms
[2021-05-13 20:05:13] [INFO ] Deduced a trap composed of 34 places in 80 ms
[2021-05-13 20:05:13] [INFO ] Deduced a trap composed of 92 places in 67 ms
[2021-05-13 20:05:13] [INFO ] Deduced a trap composed of 89 places in 75 ms
[2021-05-13 20:05:13] [INFO ] Deduced a trap composed of 91 places in 61 ms
[2021-05-13 20:05:14] [INFO ] Deduced a trap composed of 91 places in 62 ms
[2021-05-13 20:05:14] [INFO ] Deduced a trap composed of 48 places in 46 ms
[2021-05-13 20:05:14] [INFO ] Deduced a trap composed of 53 places in 45 ms
[2021-05-13 20:05:14] [INFO ] Deduced a trap composed of 40 places in 38 ms
[2021-05-13 20:05:14] [INFO ] Deduced a trap composed of 43 places in 231 ms
[2021-05-13 20:05:14] [INFO ] Deduced a trap composed of 41 places in 95 ms
[2021-05-13 20:05:14] [INFO ] Deduced a trap composed of 95 places in 70 ms
[2021-05-13 20:05:14] [INFO ] Deduced a trap composed of 89 places in 55 ms
[2021-05-13 20:05:14] [INFO ] Deduced a trap composed of 93 places in 73 ms
[2021-05-13 20:05:14] [INFO ] Deduced a trap composed of 89 places in 82 ms
[2021-05-13 20:05:14] [INFO ] Deduced a trap composed of 90 places in 92 ms
[2021-05-13 20:05:15] [INFO ] Deduced a trap composed of 92 places in 89 ms
[2021-05-13 20:05:15] [INFO ] Deduced a trap composed of 89 places in 68 ms
[2021-05-13 20:05:15] [INFO ] Deduced a trap composed of 90 places in 84 ms
[2021-05-13 20:05:15] [INFO ] Deduced a trap composed of 86 places in 74 ms
[2021-05-13 20:05:15] [INFO ] Deduced a trap composed of 94 places in 73 ms
[2021-05-13 20:05:15] [INFO ] Deduced a trap composed of 92 places in 69 ms
[2021-05-13 20:05:15] [INFO ] Deduced a trap composed of 38 places in 58 ms
[2021-05-13 20:05:15] [INFO ] Deduced a trap composed of 36 places in 53 ms
[2021-05-13 20:05:15] [INFO ] Deduced a trap composed of 45 places in 46 ms
[2021-05-13 20:05:15] [INFO ] Trap strengthening (SAT) tested/added 48/47 trap constraints in 4461 ms
[2021-05-13 20:05:15] [INFO ] Computed and/alt/rep : 317/1114/317 causal constraints in 13 ms.
[2021-05-13 20:05:15] [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 (=> (> t97 0) (and (> t93 0) (< o93 o97)))") while checking expression at index 3
[2021-05-13 20:05:15] [INFO ] [Real]Absence check using 41 positive place invariants in 19 ms returned sat
[2021-05-13 20:05:15] [INFO ] [Real]Absence check using 41 positive and 16 generalized place invariants in 4 ms returned sat
[2021-05-13 20:05:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 20:05:16] [INFO ] [Real]Absence check using state equation in 286 ms returned sat
[2021-05-13 20:05:16] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 20:05:16] [INFO ] [Nat]Absence check using 41 positive place invariants in 51 ms returned sat
[2021-05-13 20:05:16] [INFO ] [Nat]Absence check using 41 positive and 16 generalized place invariants in 20 ms returned sat
[2021-05-13 20:05:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 20:05:16] [INFO ] [Nat]Absence check using state equation in 309 ms returned sat
[2021-05-13 20:05:16] [INFO ] Deduced a trap composed of 9 places in 84 ms
[2021-05-13 20:05:16] [INFO ] Deduced a trap composed of 22 places in 97 ms
[2021-05-13 20:05:16] [INFO ] Deduced a trap composed of 11 places in 98 ms
[2021-05-13 20:05:17] [INFO ] Deduced a trap composed of 23 places in 105 ms
[2021-05-13 20:05:17] [INFO ] Deduced a trap composed of 19 places in 91 ms
[2021-05-13 20:05:17] [INFO ] Deduced a trap composed of 94 places in 87 ms
[2021-05-13 20:05:17] [INFO ] Deduced a trap composed of 91 places in 84 ms
[2021-05-13 20:05:17] [INFO ] Deduced a trap composed of 15 places in 77 ms
[2021-05-13 20:05:17] [INFO ] Deduced a trap composed of 17 places in 110 ms
[2021-05-13 20:05:17] [INFO ] Deduced a trap composed of 18 places in 77 ms
[2021-05-13 20:05:17] [INFO ] Deduced a trap composed of 93 places in 70 ms
[2021-05-13 20:05:17] [INFO ] Deduced a trap composed of 19 places in 64 ms
[2021-05-13 20:05:17] [INFO ] Deduced a trap composed of 27 places in 74 ms
[2021-05-13 20:05:18] [INFO ] Deduced a trap composed of 31 places in 86 ms
[2021-05-13 20:05:18] [INFO ] Deduced a trap composed of 89 places in 72 ms
[2021-05-13 20:05:18] [INFO ] Deduced a trap composed of 87 places in 93 ms
[2021-05-13 20:05:18] [INFO ] Deduced a trap composed of 88 places in 89 ms
[2021-05-13 20:05:18] [INFO ] Deduced a trap composed of 88 places in 81 ms
[2021-05-13 20:05:18] [INFO ] Deduced a trap composed of 30 places in 46 ms
[2021-05-13 20:05:18] [INFO ] Trap strengthening (SAT) tested/added 20/19 trap constraints in 1829 ms
[2021-05-13 20:05:18] [INFO ] Computed and/alt/rep : 317/1114/317 causal constraints in 13 ms.
[2021-05-13 20:05:19] [INFO ] Added : 226 causal constraints over 46 iterations in 918 ms. Result :sat
[2021-05-13 20:05:19] [INFO ] Deduced a trap composed of 94 places in 108 ms
[2021-05-13 20:05:19] [INFO ] Deduced a trap composed of 87 places in 86 ms
[2021-05-13 20:05:19] [INFO ] Deduced a trap composed of 95 places in 90 ms
[2021-05-13 20:05:19] [INFO ] Deduced a trap composed of 88 places in 85 ms
[2021-05-13 20:05:20] [INFO ] Deduced a trap composed of 92 places in 88 ms
[2021-05-13 20:05:20] [INFO ] Deduced a trap composed of 90 places in 123 ms
[2021-05-13 20:05:20] [INFO ] Deduced a trap composed of 93 places in 88 ms
[2021-05-13 20:05:20] [INFO ] Deduced a trap composed of 93 places in 91 ms
[2021-05-13 20:05:20] [INFO ] Deduced a trap composed of 92 places in 125 ms
[2021-05-13 20:05:20] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 1182 ms
Attempting to minimize the solution found.
Minimization took 13 ms.
FORMULA BusinessProcesses-PT-05-ReachabilityCardinality-00 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Incomplete Parikh walk after 20000 steps, including 111 resets, run finished after 65 ms. (steps per millisecond=307 ) properties seen :[0, 0, 0, 1] could not realise parikh vector
FORMULA BusinessProcesses-PT-05-ReachabilityCardinality-14 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Finished Parikh walk after 183 steps, including 0 resets, run visited all 3 properties in 1 ms. (steps per millisecond=183 )
FORMULA BusinessProcesses-PT-05-ReachabilityCardinality-13 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA BusinessProcesses-PT-05-ReachabilityCardinality-11 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA BusinessProcesses-PT-05-ReachabilityCardinality-07 FALSE TECHNIQUES TOPOLOGICAL PARIKH_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-05"
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-05, 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-162038177000179"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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