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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 424K
-rw-r--r-- 1 mcc users 13K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 115K May 10 09:42 CTLCardinality.xml
-rw-r--r-- 1 mcc users 9.6K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 89K 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:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Mar 28 15:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Mar 28 15:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Mar 28 15:47 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.7K Mar 22 12:14 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 16K 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 59K 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-02-ReachabilityCardinality-00
FORMULA_NAME BusinessProcesses-PT-02-ReachabilityCardinality-01
FORMULA_NAME BusinessProcesses-PT-02-ReachabilityCardinality-02
FORMULA_NAME BusinessProcesses-PT-02-ReachabilityCardinality-03
FORMULA_NAME BusinessProcesses-PT-02-ReachabilityCardinality-04
FORMULA_NAME BusinessProcesses-PT-02-ReachabilityCardinality-05
FORMULA_NAME BusinessProcesses-PT-02-ReachabilityCardinality-06
FORMULA_NAME BusinessProcesses-PT-02-ReachabilityCardinality-07
FORMULA_NAME BusinessProcesses-PT-02-ReachabilityCardinality-08
FORMULA_NAME BusinessProcesses-PT-02-ReachabilityCardinality-09
FORMULA_NAME BusinessProcesses-PT-02-ReachabilityCardinality-10
FORMULA_NAME BusinessProcesses-PT-02-ReachabilityCardinality-11
FORMULA_NAME BusinessProcesses-PT-02-ReachabilityCardinality-12
FORMULA_NAME BusinessProcesses-PT-02-ReachabilityCardinality-13
FORMULA_NAME BusinessProcesses-PT-02-ReachabilityCardinality-14
FORMULA_NAME BusinessProcesses-PT-02-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1620936020777

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2021-05-13 20:00:22] [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:00:22] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-13 20:00:22] [INFO ] Load time of PNML (sax parser for PT used): 55 ms
[2021-05-13 20:00:22] [INFO ] Transformed 262 places.
[2021-05-13 20:00:22] [INFO ] Transformed 219 transitions.
[2021-05-13 20:00:22] [INFO ] Found NUPN structural information;
[2021-05-13 20:00:22] [INFO ] Parsed PT model containing 262 places and 219 transitions in 92 ms.
Deduced a syphon composed of 17 places in 2 ms
Reduce places removed 17 places and 15 transitions.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 18 ms.
Working with output stream class java.io.PrintStream
FORMULA BusinessProcesses-PT-02-ReachabilityCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-02-ReachabilityCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-02-ReachabilityCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-02-ReachabilityCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-02-ReachabilityCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 136 resets, run finished after 47 ms. (steps per millisecond=212 ) properties seen :[0, 0, 1, 1, 0, 0, 0, 1, 1, 1, 0]
FORMULA BusinessProcesses-PT-02-ReachabilityCardinality-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-02-ReachabilityCardinality-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-02-ReachabilityCardinality-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-02-ReachabilityCardinality-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-02-ReachabilityCardinality-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 26 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 27 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties seen :[0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 24 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 28 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 31 resets, run finished after 12 ms. (steps per millisecond=833 ) properties seen :[0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 27 resets, run finished after 11 ms. (steps per millisecond=909 ) properties seen :[0, 0, 0, 0, 0, 0]
// Phase 1: matrix 204 rows 245 cols
[2021-05-13 20:00:22] [INFO ] Computed 43 place invariants in 10 ms
[2021-05-13 20:00:22] [INFO ] [Real]Absence check using 30 positive place invariants in 28 ms returned sat
[2021-05-13 20:00:22] [INFO ] [Real]Absence check using 30 positive and 13 generalized place invariants in 5 ms returned sat
[2021-05-13 20:00:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 20:00:22] [INFO ] [Real]Absence check using state equation in 140 ms returned sat
[2021-05-13 20:00:22] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 20:00:22] [INFO ] [Nat]Absence check using 30 positive place invariants in 12 ms returned unsat
[2021-05-13 20:00:23] [INFO ] [Real]Absence check using 30 positive place invariants in 20 ms returned sat
[2021-05-13 20:00:23] [INFO ] [Real]Absence check using 30 positive and 13 generalized place invariants in 4 ms returned sat
[2021-05-13 20:00:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 20:00:23] [INFO ] [Real]Absence check using state equation in 127 ms returned sat
[2021-05-13 20:00:23] [INFO ] Deduced a trap composed of 29 places in 76 ms
[2021-05-13 20:00:23] [INFO ] Deduced a trap composed of 16 places in 41 ms
[2021-05-13 20:00:23] [INFO ] Deduced a trap composed of 20 places in 35 ms
[2021-05-13 20:00:23] [INFO ] Deduced a trap composed of 34 places in 31 ms
[2021-05-13 20:00:23] [INFO ] Deduced a trap composed of 30 places in 30 ms
[2021-05-13 20:00:23] [INFO ] Deduced a trap composed of 37 places in 30 ms
[2021-05-13 20:00:23] [INFO ] Deduced a trap composed of 36 places in 28 ms
[2021-05-13 20:00:23] [INFO ] Deduced a trap composed of 30 places in 28 ms
[2021-05-13 20:00:23] [INFO ] Deduced a trap composed of 30 places in 27 ms
[2021-05-13 20:00:23] [INFO ] Deduced a trap composed of 34 places in 26 ms
[2021-05-13 20:00:23] [INFO ] Deduced a trap composed of 26 places in 26 ms
[2021-05-13 20:00:23] [INFO ] Deduced a trap composed of 22 places in 31 ms
[2021-05-13 20:00:23] [INFO ] Deduced a trap composed of 35 places in 26 ms
[2021-05-13 20:00:23] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 542 ms
[2021-05-13 20:00:23] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 20:00:23] [INFO ] [Nat]Absence check using 30 positive place invariants in 21 ms returned sat
[2021-05-13 20:00:23] [INFO ] [Nat]Absence check using 30 positive and 13 generalized place invariants in 4 ms returned sat
[2021-05-13 20:00:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 20:00:23] [INFO ] [Nat]Absence check using state equation in 122 ms returned sat
[2021-05-13 20:00:23] [INFO ] Deduced a trap composed of 29 places in 62 ms
[2021-05-13 20:00:24] [INFO ] Deduced a trap composed of 22 places in 40 ms
[2021-05-13 20:00:24] [INFO ] Deduced a trap composed of 11 places in 55 ms
[2021-05-13 20:00:24] [INFO ] Deduced a trap composed of 29 places in 37 ms
[2021-05-13 20:00:24] [INFO ] Deduced a trap composed of 22 places in 29 ms
[2021-05-13 20:00:24] [INFO ] Deduced a trap composed of 20 places in 28 ms
[2021-05-13 20:00:24] [INFO ] Deduced a trap composed of 34 places in 27 ms
[2021-05-13 20:00:24] [INFO ] Deduced a trap composed of 16 places in 33 ms
[2021-05-13 20:00:24] [INFO ] Deduced a trap composed of 20 places in 32 ms
[2021-05-13 20:00:24] [INFO ] Deduced a trap composed of 29 places in 41 ms
[2021-05-13 20:00:24] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 507 ms
[2021-05-13 20:00:24] [INFO ] Computed and/alt/rep : 203/553/203 causal constraints in 15 ms.
[2021-05-13 20:00:24] [INFO ] Added : 149 causal constraints over 31 iterations in 531 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 13 ms.
[2021-05-13 20:00:25] [INFO ] [Real]Absence check using 30 positive place invariants in 19 ms returned sat
[2021-05-13 20:00:25] [INFO ] [Real]Absence check using 30 positive and 13 generalized place invariants in 18 ms returned sat
[2021-05-13 20:00:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 20:00:25] [INFO ] [Real]Absence check using state equation in 199 ms returned sat
[2021-05-13 20:00:25] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 20:00:25] [INFO ] [Nat]Absence check using 30 positive place invariants in 31 ms returned sat
[2021-05-13 20:00:25] [INFO ] [Nat]Absence check using 30 positive and 13 generalized place invariants in 6 ms returned sat
[2021-05-13 20:00:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 20:00:25] [INFO ] [Nat]Absence check using state equation in 193 ms returned sat
[2021-05-13 20:00:25] [INFO ] Deduced a trap composed of 14 places in 75 ms
[2021-05-13 20:00:25] [INFO ] Deduced a trap composed of 19 places in 93 ms
[2021-05-13 20:00:25] [INFO ] Deduced a trap composed of 15 places in 70 ms
[2021-05-13 20:00:25] [INFO ] Deduced a trap composed of 8 places in 68 ms
[2021-05-13 20:00:25] [INFO ] Deduced a trap composed of 54 places in 64 ms
[2021-05-13 20:00:26] [INFO ] Deduced a trap composed of 19 places in 60 ms
[2021-05-13 20:00:26] [INFO ] Deduced a trap composed of 20 places in 61 ms
[2021-05-13 20:00:26] [INFO ] Deduced a trap composed of 22 places in 86 ms
[2021-05-13 20:00:26] [INFO ] Deduced a trap composed of 35 places in 65 ms
[2021-05-13 20:00:26] [INFO ] Deduced a trap composed of 12 places in 65 ms
[2021-05-13 20:00:26] [INFO ] Deduced a trap composed of 16 places in 63 ms
[2021-05-13 20:00:26] [INFO ] Deduced a trap composed of 19 places in 60 ms
[2021-05-13 20:00:26] [INFO ] Deduced a trap composed of 64 places in 80 ms
[2021-05-13 20:00:26] [INFO ] Deduced a trap composed of 66 places in 63 ms
[2021-05-13 20:00:26] [INFO ] Deduced a trap composed of 55 places in 69 ms
[2021-05-13 20:00:26] [INFO ] Deduced a trap composed of 68 places in 65 ms
[2021-05-13 20:00:26] [INFO ] Deduced a trap composed of 64 places in 66 ms
[2021-05-13 20:00:27] [INFO ] Deduced a trap composed of 64 places in 63 ms
[2021-05-13 20:00:27] [INFO ] Deduced a trap composed of 22 places in 76 ms
[2021-05-13 20:00:27] [INFO ] Deduced a trap composed of 59 places in 60 ms
[2021-05-13 20:00:27] [INFO ] Deduced a trap composed of 58 places in 59 ms
[2021-05-13 20:00:27] [INFO ] Deduced a trap composed of 63 places in 47 ms
[2021-05-13 20:00:27] [INFO ] Deduced a trap composed of 66 places in 43 ms
[2021-05-13 20:00:27] [INFO ] Deduced a trap composed of 18 places in 44 ms
[2021-05-13 20:00:27] [INFO ] Deduced a trap composed of 58 places in 42 ms
[2021-05-13 20:00:27] [INFO ] Deduced a trap composed of 59 places in 38 ms
[2021-05-13 20:00:27] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 26 trap constraints in 1964 ms
[2021-05-13 20:00:27] [INFO ] [Real]Absence check using 30 positive place invariants in 12 ms returned sat
[2021-05-13 20:00:27] [INFO ] [Real]Absence check using 30 positive and 13 generalized place invariants in 5 ms returned sat
[2021-05-13 20:00:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 20:00:27] [INFO ] [Real]Absence check using state equation in 143 ms returned sat
[2021-05-13 20:00:27] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 20:00:27] [INFO ] [Nat]Absence check using 30 positive place invariants in 31 ms returned sat
[2021-05-13 20:00:27] [INFO ] [Nat]Absence check using 30 positive and 13 generalized place invariants in 8 ms returned sat
[2021-05-13 20:00:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 20:00:27] [INFO ] [Nat]Absence check using state equation in 170 ms returned sat
[2021-05-13 20:00:28] [INFO ] Deduced a trap composed of 18 places in 57 ms
[2021-05-13 20:00:28] [INFO ] Deduced a trap composed of 8 places in 53 ms
[2021-05-13 20:00:28] [INFO ] Deduced a trap composed of 11 places in 53 ms
[2021-05-13 20:00:28] [INFO ] Deduced a trap composed of 10 places in 49 ms
[2021-05-13 20:00:28] [INFO ] Deduced a trap composed of 17 places in 45 ms
[2021-05-13 20:00:28] [INFO ] Deduced a trap composed of 26 places in 45 ms
[2021-05-13 20:00:28] [INFO ] Deduced a trap composed of 27 places in 42 ms
[2021-05-13 20:00:28] [INFO ] Deduced a trap composed of 37 places in 43 ms
[2021-05-13 20:00:28] [INFO ] Deduced a trap composed of 61 places in 40 ms
[2021-05-13 20:00:28] [INFO ] Deduced a trap composed of 63 places in 40 ms
[2021-05-13 20:00:28] [INFO ] Deduced a trap composed of 61 places in 43 ms
[2021-05-13 20:00:28] [INFO ] Deduced a trap composed of 53 places in 73 ms
[2021-05-13 20:00:28] [INFO ] Deduced a trap composed of 63 places in 58 ms
[2021-05-13 20:00:28] [INFO ] Deduced a trap composed of 57 places in 50 ms
[2021-05-13 20:00:28] [INFO ] Deduced a trap composed of 60 places in 41 ms
[2021-05-13 20:00:28] [INFO ] Deduced a trap composed of 58 places in 39 ms
[2021-05-13 20:00:28] [INFO ] Deduced a trap composed of 58 places in 36 ms
[2021-05-13 20:00:28] [INFO ] Deduced a trap composed of 58 places in 40 ms
[2021-05-13 20:00:29] [INFO ] Deduced a trap composed of 61 places in 51 ms
[2021-05-13 20:00:29] [INFO ] Deduced a trap composed of 63 places in 72 ms
[2021-05-13 20:00:29] [INFO ] Deduced a trap composed of 62 places in 67 ms
[2021-05-13 20:00:29] [INFO ] Trap strengthening (SAT) tested/added 22/21 trap constraints in 1279 ms
[2021-05-13 20:00:29] [INFO ] Computed and/alt/rep : 203/553/203 causal constraints in 10 ms.
[2021-05-13 20:00:29] [INFO ] Added : 159 causal constraints over 33 iterations in 417 ms. Result :sat
[2021-05-13 20:00:29] [INFO ] Deduced a trap composed of 57 places in 86 ms
[2021-05-13 20:00:29] [INFO ] Deduced a trap composed of 60 places in 65 ms
[2021-05-13 20:00:29] [INFO ] Deduced a trap composed of 60 places in 55 ms
[2021-05-13 20:00:29] [INFO ] Deduced a trap composed of 61 places in 57 ms
[2021-05-13 20:00:29] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 338 ms
Attempting to minimize the solution found.
Minimization took 6 ms.
[2021-05-13 20:00:30] [INFO ] [Real]Absence check using 30 positive place invariants in 22 ms returned sat
[2021-05-13 20:00:30] [INFO ] [Real]Absence check using 30 positive and 13 generalized place invariants in 5 ms returned sat
[2021-05-13 20:00:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 20:00:30] [INFO ] [Real]Absence check using state equation in 133 ms returned sat
[2021-05-13 20:00:30] [INFO ] Deduced a trap composed of 12 places in 49 ms
[2021-05-13 20:00:30] [INFO ] Deduced a trap composed of 9 places in 45 ms
[2021-05-13 20:00:30] [INFO ] Deduced a trap composed of 57 places in 44 ms
[2021-05-13 20:00:30] [INFO ] Deduced a trap composed of 8 places in 84 ms
[2021-05-13 20:00:30] [INFO ] Deduced a trap composed of 15 places in 61 ms
[2021-05-13 20:00:30] [INFO ] Deduced a trap composed of 21 places in 75 ms
[2021-05-13 20:00:30] [INFO ] Deduced a trap composed of 16 places in 46 ms
[2021-05-13 20:00:30] [INFO ] Deduced a trap composed of 23 places in 53 ms
[2021-05-13 20:00:30] [INFO ] Deduced a trap composed of 37 places in 50 ms
[2021-05-13 20:00:30] [INFO ] Deduced a trap composed of 23 places in 53 ms
[2021-05-13 20:00:30] [INFO ] Deduced a trap composed of 11 places in 40 ms
[2021-05-13 20:00:30] [INFO ] Deduced a trap composed of 61 places in 43 ms
[2021-05-13 20:00:31] [INFO ] Deduced a trap composed of 64 places in 52 ms
[2021-05-13 20:00:31] [INFO ] Deduced a trap composed of 58 places in 58 ms
[2021-05-13 20:00:31] [INFO ] Deduced a trap composed of 41 places in 49 ms
[2021-05-13 20:00:31] [INFO ] Deduced a trap composed of 31 places in 47 ms
[2021-05-13 20:00:31] [INFO ] Deduced a trap composed of 62 places in 42 ms
[2021-05-13 20:00:31] [INFO ] Deduced a trap composed of 26 places in 57 ms
[2021-05-13 20:00:31] [INFO ] Deduced a trap composed of 63 places in 43 ms
[2021-05-13 20:00:31] [INFO ] Deduced a trap composed of 66 places in 35 ms
[2021-05-13 20:00:31] [INFO ] Deduced a trap composed of 59 places in 58 ms
[2021-05-13 20:00:31] [INFO ] Deduced a trap composed of 62 places in 68 ms
[2021-05-13 20:00:31] [INFO ] Deduced a trap composed of 18 places in 68 ms
[2021-05-13 20:00:31] [INFO ] Deduced a trap composed of 59 places in 63 ms
[2021-05-13 20:00:31] [INFO ] Deduced a trap composed of 60 places in 34 ms
[2021-05-13 20:00:31] [INFO ] Deduced a trap composed of 60 places in 39 ms
[2021-05-13 20:00:31] [INFO ] Deduced a trap composed of 62 places in 36 ms
[2021-05-13 20:00:31] [INFO ] Deduced a trap composed of 60 places in 33 ms
[2021-05-13 20:00:31] [INFO ] Trap strengthening (SAT) tested/added 29/28 trap constraints in 1659 ms
[2021-05-13 20:00:31] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 20:00:31] [INFO ] [Nat]Absence check using 30 positive place invariants in 41 ms returned sat
[2021-05-13 20:00:31] [INFO ] [Nat]Absence check using 30 positive and 13 generalized place invariants in 4 ms returned sat
[2021-05-13 20:00:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 20:00:32] [INFO ] [Nat]Absence check using state equation in 125 ms returned sat
[2021-05-13 20:00:32] [INFO ] Deduced a trap composed of 21 places in 47 ms
[2021-05-13 20:00:32] [INFO ] Deduced a trap composed of 15 places in 60 ms
[2021-05-13 20:00:32] [INFO ] Deduced a trap composed of 8 places in 76 ms
[2021-05-13 20:00:32] [INFO ] Deduced a trap composed of 20 places in 46 ms
[2021-05-13 20:00:32] [INFO ] Deduced a trap composed of 12 places in 44 ms
[2021-05-13 20:00:32] [INFO ] Deduced a trap composed of 20 places in 54 ms
[2021-05-13 20:00:32] [INFO ] Deduced a trap composed of 47 places in 52 ms
[2021-05-13 20:00:32] [INFO ] Deduced a trap composed of 17 places in 58 ms
[2021-05-13 20:00:32] [INFO ] Deduced a trap composed of 17 places in 50 ms
[2021-05-13 20:00:32] [INFO ] Deduced a trap composed of 24 places in 46 ms
[2021-05-13 20:00:32] [INFO ] Deduced a trap composed of 37 places in 40 ms
[2021-05-13 20:00:32] [INFO ] Deduced a trap composed of 31 places in 44 ms
[2021-05-13 20:00:32] [INFO ] Deduced a trap composed of 67 places in 39 ms
[2021-05-13 20:00:32] [INFO ] Deduced a trap composed of 63 places in 38 ms
[2021-05-13 20:00:32] [INFO ] Deduced a trap composed of 28 places in 38 ms
[2021-05-13 20:00:32] [INFO ] Deduced a trap composed of 38 places in 37 ms
[2021-05-13 20:00:33] [INFO ] Deduced a trap composed of 21 places in 37 ms
[2021-05-13 20:00:33] [INFO ] Deduced a trap composed of 39 places in 38 ms
[2021-05-13 20:00:33] [INFO ] Deduced a trap composed of 39 places in 35 ms
[2021-05-13 20:00:33] [INFO ] Deduced a trap composed of 63 places in 36 ms
[2021-05-13 20:00:33] [INFO ] Deduced a trap composed of 56 places in 36 ms
[2021-05-13 20:00:33] [INFO ] Deduced a trap composed of 59 places in 35 ms
[2021-05-13 20:00:33] [INFO ] Trap strengthening (SAT) tested/added 23/22 trap constraints in 1154 ms
[2021-05-13 20:00:33] [INFO ] Computed and/alt/rep : 203/553/203 causal constraints in 8 ms.
[2021-05-13 20:00:33] [INFO ] Added : 158 causal constraints over 32 iterations in 328 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 5 ms.
[2021-05-13 20:00:33] [INFO ] [Real]Absence check using 30 positive place invariants in 12 ms returned sat
[2021-05-13 20:00:33] [INFO ] [Real]Absence check using 30 positive and 13 generalized place invariants in 4 ms returned sat
[2021-05-13 20:00:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 20:00:33] [INFO ] [Real]Absence check using state equation in 125 ms returned sat
[2021-05-13 20:00:33] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 20:00:33] [INFO ] [Nat]Absence check using 30 positive place invariants in 16 ms returned sat
[2021-05-13 20:00:33] [INFO ] [Nat]Absence check using 30 positive and 13 generalized place invariants in 3 ms returned sat
[2021-05-13 20:00:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 20:00:33] [INFO ] [Nat]Absence check using state equation in 122 ms returned sat
[2021-05-13 20:00:33] [INFO ] Deduced a trap composed of 8 places in 31 ms
[2021-05-13 20:00:33] [INFO ] Deduced a trap composed of 14 places in 32 ms
[2021-05-13 20:00:34] [INFO ] Deduced a trap composed of 15 places in 30 ms
[2021-05-13 20:00:34] [INFO ] Deduced a trap composed of 21 places in 29 ms
[2021-05-13 20:00:34] [INFO ] Deduced a trap composed of 20 places in 15 ms
[2021-05-13 20:00:34] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 172 ms
[2021-05-13 20:00:34] [INFO ] Computed and/alt/rep : 203/553/203 causal constraints in 8 ms.
[2021-05-13 20:00:34] [INFO ] Added : 157 causal constraints over 33 iterations in 366 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 5 ms.
FORMULA BusinessProcesses-PT-02-ReachabilityCardinality-08 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BusinessProcesses-PT-02-ReachabilityCardinality-00 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Incomplete Parikh walk after 15000 steps, including 228 resets, run finished after 28 ms. (steps per millisecond=535 ) properties seen :[0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 15300 steps, including 242 resets, run finished after 25 ms. (steps per millisecond=612 ) properties seen :[0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 13700 steps, including 197 resets, run finished after 25 ms. (steps per millisecond=548 ) properties seen :[0, 1, 0, 0] could not realise parikh vector
FORMULA BusinessProcesses-PT-02-ReachabilityCardinality-09 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Incomplete Parikh walk after 14300 steps, including 219 resets, run finished after 17 ms. (steps per millisecond=841 ) properties seen :[0, 0, 0] could not realise parikh vector
Support contains 11 out of 245 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 245/245 places, 204/204 transitions.
Graph (trivial) has 132 edges and 245 vertex of which 7 / 245 are part of one of the 1 SCC in 12 ms
Free SCC test removed 6 places
Discarding 11 places :
Also discarding 6 output transitions
Drop transitions removed 6 transitions
Graph (complete) has 438 edges and 239 vertex of which 228 are kept as prefixes of interest. Removing 11 places using SCC suffix rule.5 ms
Drop transitions removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Performed 50 Post agglomeration using F-continuation condition.Transition count delta: 50
Iterating post reduction 0 with 58 rules applied. Total rules applied 60 place count 228 transition count 140
Reduce places removed 50 places and 0 transitions.
Iterating post reduction 1 with 50 rules applied. Total rules applied 110 place count 178 transition count 140
Performed 33 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 33 Pre rules applied. Total rules applied 110 place count 178 transition count 107
Deduced a syphon composed of 33 places in 1 ms
Ensure Unique test removed 5 places
Reduce places removed 38 places and 0 transitions.
Iterating global reduction 2 with 71 rules applied. Total rules applied 181 place count 140 transition count 107
Symmetric choice reduction at 2 with 26 rule applications. Total rules 207 place count 140 transition count 107
Deduced a syphon composed of 26 places in 0 ms
Reduce places removed 26 places and 26 transitions.
Iterating global reduction 2 with 52 rules applied. Total rules applied 259 place count 114 transition count 81
Performed 36 Post agglomeration using F-continuation condition.Transition count delta: 36
Deduced a syphon composed of 36 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 38 places and 0 transitions.
Iterating global reduction 2 with 74 rules applied. Total rules applied 333 place count 76 transition count 45
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 334 place count 76 transition count 44
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 335 place count 75 transition count 44
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 336 place count 75 transition count 44
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 337 place count 74 transition count 43
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 338 place count 73 transition count 43
Applied a total of 338 rules in 71 ms. Remains 73 /245 variables (removed 172) and now considering 43/204 (removed 161) transitions.
Finished structural reductions, in 1 iterations. Remains : 73/245 places, 43/204 transitions.
Incomplete random walk after 1000000 steps, including 105690 resets, run finished after 940 ms. (steps per millisecond=1063 ) properties seen :[1, 1, 0]
FORMULA BusinessProcesses-PT-02-ReachabilityCardinality-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-02-ReachabilityCardinality-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 1000000 steps, including 48779 resets, run finished after 498 ms. (steps per millisecond=2008 ) properties seen :[0]
// Phase 1: matrix 43 rows 73 cols
[2021-05-13 20:00:36] [INFO ] Computed 30 place invariants in 1 ms
[2021-05-13 20:00:36] [INFO ] [Real]Absence check using 24 positive place invariants in 11 ms returned sat
[2021-05-13 20:00:36] [INFO ] [Real]Absence check using 24 positive and 6 generalized place invariants in 2 ms returned sat
[2021-05-13 20:00:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 20:00:36] [INFO ] [Real]Absence check using state equation in 29 ms returned sat
[2021-05-13 20:00:36] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 20:00:36] [INFO ] [Nat]Absence check using 24 positive place invariants in 6 ms returned sat
[2021-05-13 20:00:36] [INFO ] [Nat]Absence check using 24 positive and 6 generalized place invariants in 1 ms returned sat
[2021-05-13 20:00:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 20:00:36] [INFO ] [Nat]Absence check using state equation in 20 ms returned sat
[2021-05-13 20:00:36] [INFO ] Deduced a trap composed of 6 places in 9 ms
[2021-05-13 20:00:36] [INFO ] Deduced a trap composed of 7 places in 9 ms
[2021-05-13 20:00:36] [INFO ] Deduced a trap composed of 8 places in 8 ms
[2021-05-13 20:00:36] [INFO ] Deduced a trap composed of 9 places in 15 ms
[2021-05-13 20:00:36] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 64 ms
[2021-05-13 20:00:36] [INFO ] Computed and/alt/rep : 39/72/39 causal constraints in 2 ms.
[2021-05-13 20:00:36] [INFO ] Added : 26 causal constraints over 6 iterations in 20 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 0 ms.
Incomplete Parikh walk after 3000 steps, including 332 resets, run finished after 4 ms. (steps per millisecond=750 ) properties seen :[0] could not realise parikh vector
Support contains 5 out of 73 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 73/73 places, 43/43 transitions.
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 3 Pre rules applied. Total rules applied 0 place count 73 transition count 40
Deduced a syphon composed of 3 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 8 place count 68 transition count 40
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 64 transition count 36
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 17 place count 63 transition count 35
Applied a total of 17 rules in 7 ms. Remains 63 /73 variables (removed 10) and now considering 35/43 (removed 8) transitions.
Finished structural reductions, in 1 iterations. Remains : 63/73 places, 35/43 transitions.
Incomplete random walk after 1000000 steps, including 187403 resets, run finished after 849 ms. (steps per millisecond=1177 ) properties seen :[0]
Incomplete Best-First random walk after 1000000 steps, including 166666 resets, run finished after 679 ms. (steps per millisecond=1472 ) properties seen :[0]
Finished probabilistic random walk after 276 steps, run visited all 1 properties in 6 ms. (steps per millisecond=46 )
Probabilistic random walk after 276 steps, saw 82 distinct states, run finished after 6 ms. (steps per millisecond=46 ) properties seen :[1]
FORMULA BusinessProcesses-PT-02-ReachabilityCardinality-15 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_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-02"
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-02, 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-162038177000167"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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