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

--------------------
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-ReachabilityFireability-00
FORMULA_NAME BusinessProcesses-PT-02-ReachabilityFireability-01
FORMULA_NAME BusinessProcesses-PT-02-ReachabilityFireability-02
FORMULA_NAME BusinessProcesses-PT-02-ReachabilityFireability-03
FORMULA_NAME BusinessProcesses-PT-02-ReachabilityFireability-04
FORMULA_NAME BusinessProcesses-PT-02-ReachabilityFireability-05
FORMULA_NAME BusinessProcesses-PT-02-ReachabilityFireability-06
FORMULA_NAME BusinessProcesses-PT-02-ReachabilityFireability-07
FORMULA_NAME BusinessProcesses-PT-02-ReachabilityFireability-08
FORMULA_NAME BusinessProcesses-PT-02-ReachabilityFireability-09
FORMULA_NAME BusinessProcesses-PT-02-ReachabilityFireability-10
FORMULA_NAME BusinessProcesses-PT-02-ReachabilityFireability-11
FORMULA_NAME BusinessProcesses-PT-02-ReachabilityFireability-12
FORMULA_NAME BusinessProcesses-PT-02-ReachabilityFireability-13
FORMULA_NAME BusinessProcesses-PT-02-ReachabilityFireability-14
FORMULA_NAME BusinessProcesses-PT-02-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1620936054315

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2021-05-13 20:00:56] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -timeout, 3600, -rebuildPNML]
[2021-05-13 20:00:56] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-13 20:00:56] [INFO ] Load time of PNML (sax parser for PT used): 57 ms
[2021-05-13 20:00:56] [INFO ] Transformed 262 places.
[2021-05-13 20:00:56] [INFO ] Transformed 219 transitions.
[2021-05-13 20:00:56] [INFO ] Found NUPN structural information;
[2021-05-13 20:00:56] [INFO ] Parsed PT model containing 262 places and 219 transitions in 99 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/ReachabilityFireability.xml in 21 ms.
Working with output stream class java.io.PrintStream
FORMULA BusinessProcesses-PT-02-ReachabilityFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 136 resets, run finished after 52 ms. (steps per millisecond=192 ) properties seen :[0, 0, 1, 0, 1, 1, 1, 1, 0, 0, 0, 0, 0, 1, 1]
FORMULA BusinessProcesses-PT-02-ReachabilityFireability-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-02-ReachabilityFireability-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-02-ReachabilityFireability-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-02-ReachabilityFireability-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-02-ReachabilityFireability-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-02-ReachabilityFireability-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-02-ReachabilityFireability-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 27 resets, run finished after 19 ms. (steps per millisecond=526 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 22 resets, run finished after 14 ms. (steps per millisecond=714 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 27 resets, run finished after 16 ms. (steps per millisecond=625 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 28 resets, run finished after 13 ms. (steps per millisecond=769 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 25 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 26 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 30 resets, run finished after 25 ms. (steps per millisecond=400 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 20 resets, run finished after 31 ms. (steps per millisecond=322 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0]
// Phase 1: matrix 204 rows 245 cols
[2021-05-13 20:00:56] [INFO ] Computed 43 place invariants in 13 ms
[2021-05-13 20:00:56] [INFO ] [Real]Absence check using 30 positive place invariants in 43 ms returned sat
[2021-05-13 20:00:56] [INFO ] [Real]Absence check using 30 positive and 13 generalized place invariants in 7 ms returned sat
[2021-05-13 20:00:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 20:00:56] [INFO ] [Real]Absence check using state equation in 147 ms returned sat
[2021-05-13 20:00:57] [INFO ] Deduced a trap composed of 8 places in 140 ms
[2021-05-13 20:00:57] [INFO ] Deduced a trap composed of 12 places in 77 ms
[2021-05-13 20:00:57] [INFO ] Deduced a trap composed of 16 places in 72 ms
[2021-05-13 20:00:57] [INFO ] Deduced a trap composed of 16 places in 74 ms
[2021-05-13 20:00:57] [INFO ] Deduced a trap composed of 20 places in 68 ms
[2021-05-13 20:00:57] [INFO ] Deduced a trap composed of 31 places in 80 ms
[2021-05-13 20:00:57] [INFO ] Deduced a trap composed of 16 places in 74 ms
[2021-05-13 20:00:57] [INFO ] Deduced a trap composed of 31 places in 61 ms
[2021-05-13 20:00:57] [INFO ] Deduced a trap composed of 32 places in 58 ms
[2021-05-13 20:00:57] [INFO ] Deduced a trap composed of 69 places in 56 ms
[2021-05-13 20:00:57] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 911 ms
[2021-05-13 20:00:57] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 20:00:57] [INFO ] [Nat]Absence check using 30 positive place invariants in 23 ms returned sat
[2021-05-13 20:00:57] [INFO ] [Nat]Absence check using 30 positive and 13 generalized place invariants in 5 ms returned sat
[2021-05-13 20:00:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 20:00:58] [INFO ] [Nat]Absence check using state equation in 148 ms returned sat
[2021-05-13 20:00:58] [INFO ] Deduced a trap composed of 57 places in 81 ms
[2021-05-13 20:00:58] [INFO ] Deduced a trap composed of 12 places in 104 ms
[2021-05-13 20:00:58] [INFO ] Deduced a trap composed of 14 places in 77 ms
[2021-05-13 20:00:58] [INFO ] Deduced a trap composed of 8 places in 69 ms
[2021-05-13 20:00:58] [INFO ] Deduced a trap composed of 12 places in 98 ms
[2021-05-13 20:00:58] [INFO ] Deduced a trap composed of 15 places in 85 ms
[2021-05-13 20:00:58] [INFO ] Deduced a trap composed of 14 places in 73 ms
[2021-05-13 20:00:58] [INFO ] Deduced a trap composed of 16 places in 71 ms
[2021-05-13 20:00:58] [INFO ] Deduced a trap composed of 28 places in 74 ms
[2021-05-13 20:00:58] [INFO ] Deduced a trap composed of 33 places in 79 ms
[2021-05-13 20:00:59] [INFO ] Deduced a trap composed of 12 places in 26 ms
[2021-05-13 20:00:59] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 965 ms
[2021-05-13 20:00:59] [INFO ] Computed and/alt/rep : 203/553/203 causal constraints in 11 ms.
[2021-05-13 20:00:59] [INFO ] Added : 146 causal constraints over 30 iterations in 423 ms. Result :sat
[2021-05-13 20:00:59] [INFO ] Deduced a trap composed of 53 places in 76 ms
[2021-05-13 20:00:59] [INFO ] Deduced a trap composed of 61 places in 63 ms
[2021-05-13 20:00:59] [INFO ] Deduced a trap composed of 56 places in 61 ms
[2021-05-13 20:00:59] [INFO ] Deduced a trap composed of 58 places in 58 ms
[2021-05-13 20:00:59] [INFO ] Deduced a trap composed of 62 places in 69 ms
[2021-05-13 20:00:59] [INFO ] Deduced a trap composed of 58 places in 64 ms
[2021-05-13 20:01:00] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 552 ms
Attempting to minimize the solution found.
Minimization took 19 ms.
[2021-05-13 20:01:00] [INFO ] [Real]Absence check using 30 positive place invariants in 26 ms returned sat
[2021-05-13 20:01:00] [INFO ] [Real]Absence check using 30 positive and 13 generalized place invariants in 8 ms returned sat
[2021-05-13 20:01:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 20:01:00] [INFO ] [Real]Absence check using state equation in 236 ms returned sat
[2021-05-13 20:01:00] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 20:01:00] [INFO ] [Nat]Absence check using 30 positive place invariants in 25 ms returned sat
[2021-05-13 20:01:00] [INFO ] [Nat]Absence check using 30 positive and 13 generalized place invariants in 5 ms returned sat
[2021-05-13 20:01:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 20:01:00] [INFO ] [Nat]Absence check using state equation in 174 ms returned sat
[2021-05-13 20:01:00] [INFO ] Deduced a trap composed of 8 places in 80 ms
[2021-05-13 20:01:00] [INFO ] Deduced a trap composed of 10 places in 77 ms
[2021-05-13 20:01:00] [INFO ] Deduced a trap composed of 17 places in 83 ms
[2021-05-13 20:01:01] [INFO ] Deduced a trap composed of 15 places in 74 ms
[2021-05-13 20:01:01] [INFO ] Deduced a trap composed of 18 places in 65 ms
[2021-05-13 20:01:01] [INFO ] Deduced a trap composed of 11 places in 64 ms
[2021-05-13 20:01:01] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 6 trap constraints in 545 ms
[2021-05-13 20:01:01] [INFO ] [Real]Absence check using 30 positive place invariants in 15 ms returned sat
[2021-05-13 20:01:01] [INFO ] [Real]Absence check using 30 positive and 13 generalized place invariants in 5 ms returned sat
[2021-05-13 20:01:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 20:01:01] [INFO ] [Real]Absence check using state equation in 149 ms returned sat
[2021-05-13 20:01:01] [INFO ] Deduced a trap composed of 11 places in 42 ms
[2021-05-13 20:01:01] [INFO ] Deduced a trap composed of 9 places in 38 ms
[2021-05-13 20:01:01] [INFO ] Deduced a trap composed of 8 places in 33 ms
[2021-05-13 20:01:01] [INFO ] Deduced a trap composed of 19 places in 32 ms
[2021-05-13 20:01:01] [INFO ] Deduced a trap composed of 16 places in 37 ms
[2021-05-13 20:01:01] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 256 ms
[2021-05-13 20:01:01] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 20:01:01] [INFO ] [Nat]Absence check using 30 positive place invariants in 32 ms returned sat
[2021-05-13 20:01:01] [INFO ] [Nat]Absence check using 30 positive and 13 generalized place invariants in 7 ms returned sat
[2021-05-13 20:01:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 20:01:01] [INFO ] [Nat]Absence check using state equation in 185 ms returned sat
[2021-05-13 20:01:02] [INFO ] Deduced a trap composed of 11 places in 29 ms
[2021-05-13 20:01:02] [INFO ] Deduced a trap composed of 9 places in 29 ms
[2021-05-13 20:01:02] [INFO ] Deduced a trap composed of 8 places in 29 ms
[2021-05-13 20:01:02] [INFO ] Deduced a trap composed of 19 places in 26 ms
[2021-05-13 20:01:02] [INFO ] Deduced a trap composed of 16 places in 25 ms
[2021-05-13 20:01:02] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 189 ms
[2021-05-13 20:01:02] [INFO ] Computed and/alt/rep : 203/553/203 causal constraints in 14 ms.
[2021-05-13 20:01:02] [INFO ] Added : 134 causal constraints over 27 iterations in 418 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 10 ms.
[2021-05-13 20:01:02] [INFO ] [Real]Absence check using 30 positive place invariants in 22 ms returned unsat
[2021-05-13 20:01:02] [INFO ] [Real]Absence check using 30 positive place invariants in 22 ms returned sat
[2021-05-13 20:01:02] [INFO ] [Real]Absence check using 30 positive and 13 generalized place invariants in 6 ms returned sat
[2021-05-13 20:01:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 20:01:02] [INFO ] [Real]Absence check using state equation in 188 ms returned sat
[2021-05-13 20:01:03] [INFO ] Deduced a trap composed of 14 places in 62 ms
[2021-05-13 20:01:03] [INFO ] Deduced a trap composed of 15 places in 65 ms
[2021-05-13 20:01:03] [INFO ] Deduced a trap composed of 21 places in 69 ms
[2021-05-13 20:01:03] [INFO ] Deduced a trap composed of 17 places in 60 ms
[2021-05-13 20:01:03] [INFO ] Deduced a trap composed of 59 places in 60 ms
[2021-05-13 20:01:03] [INFO ] Deduced a trap composed of 13 places in 68 ms
[2021-05-13 20:01:03] [INFO ] Deduced a trap composed of 8 places in 49 ms
[2021-05-13 20:01:03] [INFO ] Deduced a trap composed of 20 places in 47 ms
[2021-05-13 20:01:03] [INFO ] Deduced a trap composed of 69 places in 48 ms
[2021-05-13 20:01:03] [INFO ] Deduced a trap composed of 62 places in 66 ms
[2021-05-13 20:01:03] [INFO ] Deduced a trap composed of 60 places in 59 ms
[2021-05-13 20:01:03] [INFO ] Deduced a trap composed of 56 places in 57 ms
[2021-05-13 20:01:03] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 883 ms
[2021-05-13 20:01:03] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 20:01:03] [INFO ] [Nat]Absence check using 30 positive place invariants in 25 ms returned sat
[2021-05-13 20:01:03] [INFO ] [Nat]Absence check using 30 positive and 13 generalized place invariants in 5 ms returned sat
[2021-05-13 20:01:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 20:01:04] [INFO ] [Nat]Absence check using state equation in 153 ms returned sat
[2021-05-13 20:01:04] [INFO ] Deduced a trap composed of 14 places in 75 ms
[2021-05-13 20:01:04] [INFO ] Deduced a trap composed of 15 places in 101 ms
[2021-05-13 20:01:04] [INFO ] Deduced a trap composed of 17 places in 98 ms
[2021-05-13 20:01:04] [INFO ] Deduced a trap composed of 59 places in 63 ms
[2021-05-13 20:01:04] [INFO ] Deduced a trap composed of 59 places in 59 ms
[2021-05-13 20:01:04] [INFO ] Deduced a trap composed of 69 places in 58 ms
[2021-05-13 20:01:04] [INFO ] Deduced a trap composed of 20 places in 59 ms
[2021-05-13 20:01:04] [INFO ] Deduced a trap composed of 17 places in 58 ms
[2021-05-13 20:01:04] [INFO ] Deduced a trap composed of 59 places in 57 ms
[2021-05-13 20:01:04] [INFO ] Deduced a trap composed of 8 places in 59 ms
[2021-05-13 20:01:04] [INFO ] Deduced a trap composed of 20 places in 57 ms
[2021-05-13 20:01:05] [INFO ] Deduced a trap composed of 66 places in 56 ms
[2021-05-13 20:01:05] [INFO ] Deduced a trap composed of 60 places in 57 ms
[2021-05-13 20:01:05] [INFO ] Deduced a trap composed of 56 places in 54 ms
[2021-05-13 20:01:05] [INFO ] Deduced a trap composed of 62 places in 54 ms
[2021-05-13 20:01:05] [INFO ] Deduced a trap composed of 56 places in 54 ms
[2021-05-13 20:01:05] [INFO ] Deduced a trap composed of 65 places in 53 ms
[2021-05-13 20:01:05] [INFO ] Deduced a trap composed of 68 places in 54 ms
[2021-05-13 20:01:05] [INFO ] Deduced a trap composed of 69 places in 51 ms
[2021-05-13 20:01:05] [INFO ] Trap strengthening (SAT) tested/added 20/19 trap constraints in 1445 ms
[2021-05-13 20:01:05] [INFO ] Computed and/alt/rep : 203/553/203 causal constraints in 12 ms.
[2021-05-13 20:01:06] [INFO ] Added : 150 causal constraints over 31 iterations in 666 ms. Result :sat
[2021-05-13 20:01:06] [INFO ] Deduced a trap composed of 56 places in 82 ms
[2021-05-13 20:01:06] [INFO ] Deduced a trap composed of 60 places in 64 ms
[2021-05-13 20:01:06] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 215 ms
Attempting to minimize the solution found.
Minimization took 11 ms.
[2021-05-13 20:01:06] [INFO ] [Real]Absence check using 30 positive place invariants in 24 ms returned sat
[2021-05-13 20:01:06] [INFO ] [Real]Absence check using 30 positive and 13 generalized place invariants in 10 ms returned sat
[2021-05-13 20:01:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 20:01:06] [INFO ] [Real]Absence check using state equation in 150 ms returned sat
[2021-05-13 20:01:06] [INFO ] Deduced a trap composed of 11 places in 112 ms
[2021-05-13 20:01:06] [INFO ] Deduced a trap composed of 20 places in 76 ms
[2021-05-13 20:01:06] [INFO ] Deduced a trap composed of 10 places in 63 ms
[2021-05-13 20:01:07] [INFO ] Deduced a trap composed of 20 places in 55 ms
[2021-05-13 20:01:07] [INFO ] Deduced a trap composed of 15 places in 53 ms
[2021-05-13 20:01:07] [INFO ] Deduced a trap composed of 30 places in 55 ms
[2021-05-13 20:01:07] [INFO ] Deduced a trap composed of 63 places in 61 ms
[2021-05-13 20:01:07] [INFO ] Deduced a trap composed of 20 places in 55 ms
[2021-05-13 20:01:07] [INFO ] Deduced a trap composed of 35 places in 55 ms
[2021-05-13 20:01:07] [INFO ] Deduced a trap composed of 40 places in 54 ms
[2021-05-13 20:01:07] [INFO ] Deduced a trap composed of 61 places in 54 ms
[2021-05-13 20:01:07] [INFO ] Deduced a trap composed of 68 places in 52 ms
[2021-05-13 20:01:07] [INFO ] Deduced a trap composed of 62 places in 59 ms
[2021-05-13 20:01:07] [INFO ] Deduced a trap composed of 36 places in 49 ms
[2021-05-13 20:01:07] [INFO ] Deduced a trap composed of 63 places in 53 ms
[2021-05-13 20:01:07] [INFO ] Deduced a trap composed of 27 places in 51 ms
[2021-05-13 20:01:07] [INFO ] Deduced a trap composed of 31 places in 63 ms
[2021-05-13 20:01:07] [INFO ] Deduced a trap composed of 67 places in 57 ms
[2021-05-13 20:01:08] [INFO ] Deduced a trap composed of 36 places in 53 ms
[2021-05-13 20:01:08] [INFO ] Deduced a trap composed of 57 places in 55 ms
[2021-05-13 20:01:08] [INFO ] Deduced a trap composed of 59 places in 87 ms
[2021-05-13 20:01:08] [INFO ] Deduced a trap composed of 63 places in 65 ms
[2021-05-13 20:01:08] [INFO ] Deduced a trap composed of 57 places in 60 ms
[2021-05-13 20:01:08] [INFO ] Deduced a trap composed of 59 places in 62 ms
[2021-05-13 20:01:08] [INFO ] Deduced a trap composed of 56 places in 70 ms
[2021-05-13 20:01:08] [INFO ] Deduced a trap composed of 59 places in 75 ms
[2021-05-13 20:01:08] [INFO ] Deduced a trap composed of 63 places in 97 ms
[2021-05-13 20:01:08] [INFO ] Deduced a trap composed of 60 places in 66 ms
[2021-05-13 20:01:08] [INFO ] Deduced a trap composed of 62 places in 60 ms
[2021-05-13 20:01:08] [INFO ] Deduced a trap composed of 61 places in 58 ms
[2021-05-13 20:01:09] [INFO ] Deduced a trap composed of 59 places in 86 ms
[2021-05-13 20:01:09] [INFO ] Deduced a trap composed of 65 places in 59 ms
[2021-05-13 20:01:09] [INFO ] Deduced a trap composed of 55 places in 56 ms
[2021-05-13 20:01:09] [INFO ] Deduced a trap composed of 75 places in 57 ms
[2021-05-13 20:01:09] [INFO ] Deduced a trap composed of 55 places in 83 ms
[2021-05-13 20:01:09] [INFO ] Deduced a trap composed of 62 places in 81 ms
[2021-05-13 20:01:09] [INFO ] Deduced a trap composed of 61 places in 56 ms
[2021-05-13 20:01:09] [INFO ] Deduced a trap composed of 60 places in 54 ms
[2021-05-13 20:01:09] [INFO ] Deduced a trap composed of 61 places in 62 ms
[2021-05-13 20:01:09] [INFO ] Deduced a trap composed of 58 places in 56 ms
[2021-05-13 20:01:09] [INFO ] Trap strengthening (SAT) tested/added 41/40 trap constraints in 3069 ms
[2021-05-13 20:01:09] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 20:01:09] [INFO ] [Nat]Absence check using 30 positive place invariants in 28 ms returned sat
[2021-05-13 20:01:09] [INFO ] [Nat]Absence check using 30 positive and 13 generalized place invariants in 5 ms returned sat
[2021-05-13 20:01:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 20:01:09] [INFO ] [Nat]Absence check using state equation in 177 ms returned sat
[2021-05-13 20:01:10] [INFO ] Deduced a trap composed of 11 places in 91 ms
[2021-05-13 20:01:10] [INFO ] Deduced a trap composed of 20 places in 76 ms
[2021-05-13 20:01:10] [INFO ] Deduced a trap composed of 10 places in 107 ms
[2021-05-13 20:01:10] [INFO ] Deduced a trap composed of 20 places in 140 ms
[2021-05-13 20:01:10] [INFO ] Deduced a trap composed of 15 places in 102 ms
[2021-05-13 20:01:10] [INFO ] Deduced a trap composed of 30 places in 392 ms
[2021-05-13 20:01:11] [INFO ] Deduced a trap composed of 63 places in 142 ms
[2021-05-13 20:01:11] [INFO ] Deduced a trap composed of 33 places in 107 ms
[2021-05-13 20:01:11] [INFO ] Deduced a trap composed of 16 places in 103 ms
[2021-05-13 20:01:11] [INFO ] Deduced a trap composed of 19 places in 100 ms
[2021-05-13 20:01:11] [INFO ] Deduced a trap composed of 29 places in 75 ms
[2021-05-13 20:01:11] [INFO ] Deduced a trap composed of 37 places in 80 ms
[2021-05-13 20:01:11] [INFO ] Deduced a trap composed of 40 places in 50 ms
[2021-05-13 20:01:11] [INFO ] Deduced a trap composed of 40 places in 66 ms
[2021-05-13 20:01:11] [INFO ] Deduced a trap composed of 64 places in 56 ms
[2021-05-13 20:01:11] [INFO ] Deduced a trap composed of 36 places in 61 ms
[2021-05-13 20:01:12] [INFO ] Deduced a trap composed of 32 places in 62 ms
[2021-05-13 20:01:12] [INFO ] Deduced a trap composed of 36 places in 74 ms
[2021-05-13 20:01:12] [INFO ] Deduced a trap composed of 36 places in 70 ms
[2021-05-13 20:01:12] [INFO ] Deduced a trap composed of 35 places in 66 ms
[2021-05-13 20:01:12] [INFO ] Deduced a trap composed of 58 places in 77 ms
[2021-05-13 20:01:12] [INFO ] Deduced a trap composed of 59 places in 87 ms
[2021-05-13 20:01:12] [INFO ] Deduced a trap composed of 56 places in 93 ms
[2021-05-13 20:01:12] [INFO ] Trap strengthening (SAT) tested/added 24/23 trap constraints in 2581 ms
[2021-05-13 20:01:12] [INFO ] Computed and/alt/rep : 203/553/203 causal constraints in 18 ms.
[2021-05-13 20:01:13] [INFO ] Added : 158 causal constraints over 33 iterations in 517 ms. Result :sat
[2021-05-13 20:01:13] [INFO ] Deduced a trap composed of 62 places in 169 ms
[2021-05-13 20:01:13] [INFO ] Deduced a trap composed of 58 places in 175 ms
[2021-05-13 20:01:13] [INFO ] Deduced a trap composed of 58 places in 87 ms
[2021-05-13 20:01:13] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 528 ms
Attempting to minimize the solution found.
Minimization took 10 ms.
[2021-05-13 20:01:13] [INFO ] [Real]Absence check using 30 positive place invariants in 12 ms returned unsat
[2021-05-13 20:01:13] [INFO ] [Real]Absence check using 30 positive place invariants in 15 ms returned unsat
FORMULA BusinessProcesses-PT-02-ReachabilityFireability-13 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BusinessProcesses-PT-02-ReachabilityFireability-12 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BusinessProcesses-PT-02-ReachabilityFireability-09 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BusinessProcesses-PT-02-ReachabilityFireability-01 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Incomplete Parikh walk after 14900 steps, including 221 resets, run finished after 38 ms. (steps per millisecond=392 ) properties seen :[0, 1, 0, 0] could not realise parikh vector
FORMULA BusinessProcesses-PT-02-ReachabilityFireability-03 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Incomplete Parikh walk after 13900 steps, including 221 resets, run finished after 29 ms. (steps per millisecond=479 ) properties seen :[0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 13100 steps, including 198 resets, run finished after 24 ms. (steps per millisecond=545 ) properties seen :[0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 13400 steps, including 203 resets, run finished after 22 ms. (steps per millisecond=609 ) 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 128 edges and 245 vertex of which 7 / 245 are part of one of the 1 SCC in 6 ms
Free SCC test removed 6 places
Discarding 12 places :
Also discarding 6 output transitions
Drop transitions removed 6 transitions
Graph (complete) has 438 edges and 239 vertex of which 227 are kept as prefixes of interest. Removing 12 places using SCC suffix rule.11 ms
Drop transitions removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Performed 47 Post agglomeration using F-continuation condition.Transition count delta: 47
Iterating post reduction 0 with 56 rules applied. Total rules applied 58 place count 227 transition count 142
Reduce places removed 47 places and 0 transitions.
Iterating post reduction 1 with 47 rules applied. Total rules applied 105 place count 180 transition count 142
Performed 36 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 36 Pre rules applied. Total rules applied 105 place count 180 transition count 106
Deduced a syphon composed of 36 places in 1 ms
Ensure Unique test removed 7 places
Reduce places removed 43 places and 0 transitions.
Iterating global reduction 2 with 79 rules applied. Total rules applied 184 place count 137 transition count 106
Symmetric choice reduction at 2 with 24 rule applications. Total rules 208 place count 137 transition count 106
Deduced a syphon composed of 24 places in 1 ms
Reduce places removed 24 places and 24 transitions.
Iterating global reduction 2 with 48 rules applied. Total rules applied 256 place count 113 transition count 82
Performed 36 Post agglomeration using F-continuation condition.Transition count delta: 36
Deduced a syphon composed of 36 places in 1 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 330 place count 75 transition count 46
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 331 place count 75 transition count 45
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 332 place count 74 transition count 45
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 333 place count 74 transition count 45
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 334 place count 73 transition count 44
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 335 place count 72 transition count 44
Applied a total of 335 rules in 97 ms. Remains 72 /245 variables (removed 173) and now considering 44/204 (removed 160) transitions.
Finished structural reductions, in 1 iterations. Remains : 72/245 places, 44/204 transitions.
Finished random walk after 384 steps, including 11 resets, run visited all 3 properties in 3 ms. (steps per millisecond=128 )
FORMULA BusinessProcesses-PT-02-ReachabilityFireability-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-02-ReachabilityFireability-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-02-ReachabilityFireability-00 TRUE 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-02"
export BK_EXAMINATION="ReachabilityFireability"
export BK_TOOL="gold2020"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool gold2020"
echo " Input is BusinessProcesses-PT-02, examination is ReachabilityFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r037-tajo-162038177000168"
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 [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "UpperBounds" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] || [ "ReachabilityFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "ReachabilityFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "ReachabilityFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' ReachabilityFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;