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.r035-tajo-162038167700097.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-09, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r035-tajo-162038167700097
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 480K
-rw-r--r-- 1 mcc users 13K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 126K May 10 09:42 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.7K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 77K 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.6K Mar 28 15:48 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K 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 4.1K Mar 23 03:00 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 22K 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 15K 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 104K 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-09-CTLCardinality-00
FORMULA_NAME BusinessProcesses-PT-09-CTLCardinality-01
FORMULA_NAME BusinessProcesses-PT-09-CTLCardinality-02
FORMULA_NAME BusinessProcesses-PT-09-CTLCardinality-03
FORMULA_NAME BusinessProcesses-PT-09-CTLCardinality-04
FORMULA_NAME BusinessProcesses-PT-09-CTLCardinality-05
FORMULA_NAME BusinessProcesses-PT-09-CTLCardinality-06
FORMULA_NAME BusinessProcesses-PT-09-CTLCardinality-07
FORMULA_NAME BusinessProcesses-PT-09-CTLCardinality-08
FORMULA_NAME BusinessProcesses-PT-09-CTLCardinality-09
FORMULA_NAME BusinessProcesses-PT-09-CTLCardinality-10
FORMULA_NAME BusinessProcesses-PT-09-CTLCardinality-11
FORMULA_NAME BusinessProcesses-PT-09-CTLCardinality-12
FORMULA_NAME BusinessProcesses-PT-09-CTLCardinality-13
FORMULA_NAME BusinessProcesses-PT-09-CTLCardinality-14
FORMULA_NAME BusinessProcesses-PT-09-CTLCardinality-15

=== Now, execution of the tool begins

BK_START 1620904458109

[2021-05-13 11:14:21] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -its, -ltsminpath, /home/mcc/BenchKit//lts_install_dir/, -greatspnpath, /home/mcc/BenchKit//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2021-05-13 11:14:21] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-13 11:14:21] [INFO ] Load time of PNML (sax parser for PT used): 129 ms
[2021-05-13 11:14:21] [INFO ] Transformed 403 places.
[2021-05-13 11:14:21] [INFO ] Transformed 374 transitions.
[2021-05-13 11:14:21] [INFO ] Found NUPN structural information;
[2021-05-13 11:14:21] [INFO ] Parsed PT model containing 403 places and 374 transitions in 231 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 77 ms.
Incomplete random walk after 100000 steps, including 1042 resets, run finished after 1679 ms. (steps per millisecond=59 ) properties seen :[1, 0, 0, 1, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 1, 0, 1, 0, 0, 1, 0, 0, 0, 0, 1, 1, 0, 0, 0, 0, 1, 1, 1, 0, 1, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 1, 1, 1, 0, 0, 0, 0, 1, 0, 0, 1, 1, 1, 0, 0, 1, 0, 0, 0, 1, 0, 1, 0, 1, 1, 0, 1, 0, 1, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 0, 0, 0, 0, 1, 0]
// Phase 1: matrix 374 rows 403 cols
[2021-05-13 11:14:23] [INFO ] Computed 65 place invariants in 34 ms
[2021-05-13 11:14:23] [INFO ] [Real]Absence check using 36 positive place invariants in 63 ms returned sat
[2021-05-13 11:14:23] [INFO ] [Real]Absence check using 36 positive and 29 generalized place invariants in 10 ms returned unsat
[2021-05-13 11:14:23] [INFO ] [Real]Absence check using 36 positive place invariants in 23 ms returned unsat
[2021-05-13 11:14:23] [INFO ] [Real]Absence check using 36 positive place invariants in 22 ms returned unsat
[2021-05-13 11:14:24] [INFO ] [Real]Absence check using 36 positive place invariants in 18 ms returned unsat
[2021-05-13 11:14:24] [INFO ] [Real]Absence check using 36 positive place invariants in 16 ms returned unsat
[2021-05-13 11:14:24] [INFO ] [Real]Absence check using 36 positive place invariants in 15 ms returned unsat
[2021-05-13 11:14:24] [INFO ] [Real]Absence check using 36 positive place invariants in 36 ms returned unsat
[2021-05-13 11:14:24] [INFO ] [Real]Absence check using 36 positive place invariants in 36 ms returned unsat
[2021-05-13 11:14:24] [INFO ] [Real]Absence check using 36 positive place invariants in 31 ms returned sat
[2021-05-13 11:14:24] [INFO ] [Real]Absence check using 36 positive and 29 generalized place invariants in 21 ms returned sat
[2021-05-13 11:14:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 11:14:25] [INFO ] [Real]Absence check using state equation in 513 ms returned sat
[2021-05-13 11:14:25] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 11:14:25] [INFO ] [Nat]Absence check using 36 positive place invariants in 49 ms returned sat
[2021-05-13 11:14:25] [INFO ] [Nat]Absence check using 36 positive and 29 generalized place invariants in 15 ms returned sat
[2021-05-13 11:14:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 11:14:26] [INFO ] [Nat]Absence check using state equation in 1070 ms returned sat
[2021-05-13 11:14:27] [INFO ] Deduced a trap composed of 15 places in 563 ms
[2021-05-13 11:14:27] [INFO ] Deduced a trap composed of 11 places in 199 ms
[2021-05-13 11:14:27] [INFO ] Deduced a trap composed of 25 places in 167 ms
[2021-05-13 11:14:27] [INFO ] Deduced a trap composed of 42 places in 254 ms
[2021-05-13 11:14:28] [INFO ] Deduced a trap composed of 47 places in 194 ms
[2021-05-13 11:14:28] [INFO ] Deduced a trap composed of 102 places in 181 ms
[2021-05-13 11:14:28] [INFO ] Deduced a trap composed of 25 places in 180 ms
[2021-05-13 11:14:28] [INFO ] Deduced a trap composed of 116 places in 166 ms
[2021-05-13 11:14:29] [INFO ] Deduced a trap composed of 26 places in 338 ms
[2021-05-13 11:14:29] [INFO ] Deduced a trap composed of 103 places in 162 ms
[2021-05-13 11:14:29] [INFO ] Deduced a trap composed of 19 places in 151 ms
[2021-05-13 11:14:29] [INFO ] Deduced a trap composed of 22 places in 153 ms
[2021-05-13 11:14:29] [INFO ] Deduced a trap composed of 102 places in 162 ms
[2021-05-13 11:14:30] [INFO ] Deduced a trap composed of 20 places in 163 ms
[2021-05-13 11:14:30] [INFO ] Deduced a trap composed of 108 places in 202 ms
[2021-05-13 11:14:30] [INFO ] Deduced a trap composed of 101 places in 267 ms
[2021-05-13 11:14:30] [INFO ] Deduced a trap composed of 98 places in 159 ms
[2021-05-13 11:14:30] [INFO ] Deduced a trap composed of 100 places in 126 ms
[2021-05-13 11:14:31] [INFO ] Deduced a trap composed of 8 places in 146 ms
[2021-05-13 11:14:31] [INFO ] Deduced a trap composed of 51 places in 176 ms
[2021-05-13 11:14:31] [INFO ] Deduced a trap composed of 26 places in 142 ms
[2021-05-13 11:14:31] [INFO ] Deduced a trap composed of 27 places in 33 ms
[2021-05-13 11:14:31] [INFO ] Trap strengthening (SAT) tested/added 23/22 trap constraints in 4908 ms
[2021-05-13 11:14:31] [INFO ] Computed and/alt/rep : 373/1354/373 causal constraints in 48 ms.
[2021-05-13 11:14:33] [INFO ] Added : 255 causal constraints over 51 iterations in 1963 ms. Result :unsat
[2021-05-13 11:14:33] [INFO ] [Real]Absence check using 36 positive place invariants in 15 ms returned unsat
[2021-05-13 11:14:33] [INFO ] [Real]Absence check using 36 positive place invariants in 12 ms returned unsat
[2021-05-13 11:14:33] [INFO ] [Real]Absence check using 36 positive place invariants in 20 ms returned unsat
[2021-05-13 11:14:33] [INFO ] [Real]Absence check using 36 positive place invariants in 33 ms returned unsat
[2021-05-13 11:14:33] [INFO ] [Real]Absence check using 36 positive place invariants in 29 ms returned unsat
[2021-05-13 11:14:34] [INFO ] [Real]Absence check using 36 positive place invariants in 19 ms returned unsat
[2021-05-13 11:14:34] [INFO ] [Real]Absence check using 36 positive place invariants in 19 ms returned unsat
[2021-05-13 11:14:34] [INFO ] [Real]Absence check using 36 positive place invariants in 24 ms returned unsat
[2021-05-13 11:14:34] [INFO ] [Real]Absence check using 36 positive place invariants in 16 ms returned unsat
[2021-05-13 11:14:34] [INFO ] [Real]Absence check using 36 positive place invariants in 16 ms returned unsat
[2021-05-13 11:14:34] [INFO ] [Real]Absence check using 36 positive place invariants in 18 ms returned unsat
[2021-05-13 11:14:34] [INFO ] [Real]Absence check using 36 positive place invariants in 20 ms returned unsat
[2021-05-13 11:14:34] [INFO ] [Real]Absence check using 36 positive place invariants in 15 ms returned unsat
[2021-05-13 11:14:34] [INFO ] [Real]Absence check using 36 positive place invariants in 19 ms returned unsat
[2021-05-13 11:14:34] [INFO ] [Real]Absence check using 36 positive place invariants in 20 ms returned unsat
[2021-05-13 11:14:35] [INFO ] [Real]Absence check using 36 positive place invariants in 19 ms returned unsat
[2021-05-13 11:14:35] [INFO ] [Real]Absence check using 36 positive place invariants in 19 ms returned unsat
[2021-05-13 11:14:35] [INFO ] [Real]Absence check using 36 positive place invariants in 20 ms returned unsat
[2021-05-13 11:14:35] [INFO ] [Real]Absence check using 36 positive place invariants in 19 ms returned unsat
[2021-05-13 11:14:35] [INFO ] [Real]Absence check using 36 positive place invariants in 19 ms returned unsat
[2021-05-13 11:14:35] [INFO ] [Real]Absence check using 36 positive place invariants in 19 ms returned unsat
[2021-05-13 11:14:35] [INFO ] [Real]Absence check using 36 positive place invariants in 33 ms returned sat
[2021-05-13 11:14:35] [INFO ] [Real]Absence check using 36 positive and 29 generalized place invariants in 19 ms returned sat
[2021-05-13 11:14:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 11:14:36] [INFO ] [Real]Absence check using state equation in 467 ms returned sat
[2021-05-13 11:14:36] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 11:14:36] [INFO ] [Nat]Absence check using 36 positive place invariants in 19 ms returned unsat
[2021-05-13 11:14:36] [INFO ] [Real]Absence check using 36 positive place invariants in 11 ms returned unsat
[2021-05-13 11:14:36] [INFO ] [Real]Absence check using 36 positive place invariants in 19 ms returned unsat
[2021-05-13 11:14:36] [INFO ] [Real]Absence check using 36 positive place invariants in 15 ms returned unsat
[2021-05-13 11:14:36] [INFO ] [Real]Absence check using 36 positive place invariants in 19 ms returned unsat
[2021-05-13 11:14:36] [INFO ] [Real]Absence check using 36 positive place invariants in 19 ms returned unsat
[2021-05-13 11:14:36] [INFO ] [Real]Absence check using 36 positive place invariants in 16 ms returned unsat
[2021-05-13 11:14:36] [INFO ] [Real]Absence check using 36 positive place invariants in 18 ms returned unsat
[2021-05-13 11:14:37] [INFO ] [Real]Absence check using 36 positive place invariants in 19 ms returned unsat
[2021-05-13 11:14:37] [INFO ] [Real]Absence check using 36 positive place invariants in 20 ms returned unsat
[2021-05-13 11:14:37] [INFO ] [Real]Absence check using 36 positive place invariants in 17 ms returned unsat
[2021-05-13 11:14:37] [INFO ] [Real]Absence check using 36 positive place invariants in 19 ms returned unsat
[2021-05-13 11:14:37] [INFO ] [Real]Absence check using 36 positive place invariants in 19 ms returned unsat
[2021-05-13 11:14:37] [INFO ] [Real]Absence check using 36 positive place invariants in 20 ms returned unsat
[2021-05-13 11:14:37] [INFO ] [Real]Absence check using 36 positive place invariants in 31 ms returned unsat
[2021-05-13 11:14:37] [INFO ] [Real]Absence check using 36 positive place invariants in 20 ms returned unsat
[2021-05-13 11:14:37] [INFO ] [Real]Absence check using 36 positive place invariants in 19 ms returned unsat
[2021-05-13 11:14:38] [INFO ] [Real]Absence check using 36 positive place invariants in 34 ms returned sat
[2021-05-13 11:14:38] [INFO ] [Real]Absence check using 36 positive and 29 generalized place invariants in 27 ms returned sat
[2021-05-13 11:14:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 11:14:38] [INFO ] [Real]Absence check using state equation in 516 ms returned sat
[2021-05-13 11:14:38] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 11:14:38] [INFO ] [Nat]Absence check using 36 positive place invariants in 42 ms returned sat
[2021-05-13 11:14:38] [INFO ] [Nat]Absence check using 36 positive and 29 generalized place invariants in 17 ms returned sat
[2021-05-13 11:14:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 11:14:39] [INFO ] [Nat]Absence check using state equation in 515 ms returned sat
[2021-05-13 11:14:39] [INFO ] Deduced a trap composed of 8 places in 178 ms
[2021-05-13 11:14:39] [INFO ] Deduced a trap composed of 23 places in 117 ms
[2021-05-13 11:14:39] [INFO ] Deduced a trap composed of 11 places in 117 ms
[2021-05-13 11:14:39] [INFO ] Deduced a trap composed of 8 places in 99 ms
[2021-05-13 11:14:39] [INFO ] Deduced a trap composed of 11 places in 95 ms
[2021-05-13 11:14:40] [INFO ] Deduced a trap composed of 11 places in 97 ms
[2021-05-13 11:14:40] [INFO ] Deduced a trap composed of 10 places in 112 ms
[2021-05-13 11:14:40] [INFO ] Deduced a trap composed of 29 places in 102 ms
[2021-05-13 11:14:40] [INFO ] Deduced a trap composed of 22 places in 76 ms
[2021-05-13 11:14:40] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 1183 ms
[2021-05-13 11:14:40] [INFO ] Computed and/alt/rep : 373/1354/373 causal constraints in 22 ms.
[2021-05-13 11:14:42] [INFO ] Added : 252 causal constraints over 51 iterations in 1910 ms. Result :sat
[2021-05-13 11:14:42] [INFO ] Deduced a trap composed of 102 places in 159 ms
[2021-05-13 11:14:42] [INFO ] Deduced a trap composed of 97 places in 163 ms
[2021-05-13 11:14:43] [INFO ] Deduced a trap composed of 86 places in 173 ms
[2021-05-13 11:14:43] [INFO ] Deduced a trap composed of 84 places in 155 ms
[2021-05-13 11:14:43] [INFO ] Deduced a trap composed of 96 places in 154 ms
[2021-05-13 11:14:43] [INFO ] Deduced a trap composed of 103 places in 155 ms
[2021-05-13 11:14:44] [INFO ] Deduced a trap composed of 102 places in 165 ms
[2021-05-13 11:14:44] [INFO ] Deduced a trap composed of 99 places in 182 ms
[2021-05-13 11:14:44] [INFO ] Deduced a trap composed of 80 places in 171 ms
[2021-05-13 11:14:44] [INFO ] Deduced a trap composed of 85 places in 153 ms
[2021-05-13 11:14:44] [INFO ] Deduced a trap composed of 90 places in 172 ms
[2021-05-13 11:14:45] [INFO ] Deduced a trap composed of 97 places in 175 ms
[2021-05-13 11:14:45] [INFO ] Deduced a trap composed of 98 places in 188 ms
[2021-05-13 11:14:45] [INFO ] Deduced a trap composed of 105 places in 150 ms
[2021-05-13 11:14:46] [INFO ] Deduced a trap composed of 88 places in 176 ms
[2021-05-13 11:14:46] [INFO ] Deduced a trap composed of 94 places in 160 ms
[2021-05-13 11:14:46] [INFO ] Deduced a trap composed of 102 places in 177 ms
[2021-05-13 11:14:47] [INFO ] Deduced a trap composed of 84 places in 174 ms
[2021-05-13 11:14:47] [INFO ] Deduced a trap composed of 106 places in 160 ms
[2021-05-13 11:14:47] [INFO ] Deduced a trap composed of 93 places in 168 ms
[2021-05-13 11:14:48] [INFO ] Deduced a trap composed of 93 places in 169 ms
[2021-05-13 11:14:48] [INFO ] Deduced a trap composed of 88 places in 140 ms
[2021-05-13 11:14:48] [INFO ] Deduced a trap composed of 112 places in 154 ms
[2021-05-13 11:14:49] [INFO ] Deduced a trap composed of 99 places in 175 ms
[2021-05-13 11:14:49] [INFO ] Deduced a trap composed of 93 places in 219 ms
[2021-05-13 11:14:49] [INFO ] Deduced a trap composed of 101 places in 150 ms
[2021-05-13 11:14:49] [INFO ] Deduced a trap composed of 106 places in 167 ms
[2021-05-13 11:14:50] [INFO ] Deduced a trap composed of 96 places in 174 ms
[2021-05-13 11:14:50] [INFO ] Deduced a trap composed of 109 places in 171 ms
[2021-05-13 11:14:51] [INFO ] Deduced a trap composed of 100 places in 141 ms
[2021-05-13 11:14:51] [INFO ] Deduced a trap composed of 94 places in 179 ms
[2021-05-13 11:14:51] [INFO ] Deduced a trap composed of 108 places in 175 ms
[2021-05-13 11:14:51] [INFO ] Deduced a trap composed of 94 places in 173 ms
[2021-05-13 11:14:52] [INFO ] Deduced a trap composed of 123 places in 170 ms
[2021-05-13 11:14:52] [INFO ] Deduced a trap composed of 98 places in 169 ms
[2021-05-13 11:14:53] [INFO ] Deduced a trap composed of 92 places in 181 ms
[2021-05-13 11:14:53] [INFO ] Deduced a trap composed of 91 places in 185 ms
[2021-05-13 11:14:53] [INFO ] Deduced a trap composed of 97 places in 171 ms
[2021-05-13 11:14:54] [INFO ] Deduced a trap composed of 91 places in 172 ms
[2021-05-13 11:14:54] [INFO ] Deduced a trap composed of 93 places in 141 ms
[2021-05-13 11:14:54] [INFO ] Deduced a trap composed of 91 places in 172 ms
[2021-05-13 11:14:54] [INFO ] Deduced a trap composed of 105 places in 181 ms
[2021-05-13 11:14:55] [INFO ] Deduced a trap composed of 88 places in 179 ms
[2021-05-13 11:14:55] [INFO ] Deduced a trap composed of 107 places in 176 ms
[2021-05-13 11:14:55] [INFO ] Deduced a trap composed of 88 places in 174 ms
[2021-05-13 11:14:56] [INFO ] Deduced a trap composed of 102 places in 176 ms
[2021-05-13 11:14:56] [INFO ] Deduced a trap composed of 100 places in 178 ms
[2021-05-13 11:14:56] [INFO ] Deduced a trap composed of 94 places in 161 ms
[2021-05-13 11:14:56] [INFO ] Deduced a trap composed of 116 places in 167 ms
[2021-05-13 11:14:57] [INFO ] Deduced a trap composed of 97 places in 185 ms
[2021-05-13 11:14:57] [INFO ] Deduced a trap composed of 99 places in 197 ms
[2021-05-13 11:14:57] [INFO ] Deduced a trap composed of 102 places in 169 ms
[2021-05-13 11:14:57] [INFO ] Deduced a trap composed of 104 places in 180 ms
[2021-05-13 11:14:58] [INFO ] Deduced a trap composed of 102 places in 168 ms
[2021-05-13 11:14:58] [INFO ] Deduced a trap composed of 106 places in 178 ms
[2021-05-13 11:14:58] [INFO ] Deduced a trap composed of 90 places in 134 ms
[2021-05-13 11:14:58] [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 s48 s49 s53 s78 s79 s80 s82 s89 s90 s91 s92 s93 s96 s97 s105 s106 s107 s108 s166 s169 s193 s195 s208 s210 s218 s220 s228 s230 s243 s244 s245 s249 s254 s264 s269 s274 s278 s279 s280 s281 s282 s283 s284 s285 s286 s287 s288 s289 s290 s291 s292 s297 s298 s299 s300 s301 s302 s303 s308 s309 s312 s315 s316 s317 s318 s319 s320 s321 s322 s328 s330 s339 s342 s343 s344 s345 s356 s357 s360 s361 s364 s365 s368 s373 s374 s391 s400) 0)") while checking expression at index 47
[2021-05-13 11:14:58] [INFO ] [Real]Absence check using 36 positive place invariants in 13 ms returned unsat
[2021-05-13 11:14:58] [INFO ] [Real]Absence check using 36 positive place invariants in 19 ms returned unsat
[2021-05-13 11:14:59] [INFO ] [Real]Absence check using 36 positive place invariants in 14 ms returned unsat
[2021-05-13 11:14:59] [INFO ] [Real]Absence check using 36 positive place invariants in 14 ms returned unsat
[2021-05-13 11:14:59] [INFO ] [Real]Absence check using 36 positive place invariants in 20 ms returned unsat
[2021-05-13 11:14:59] [INFO ] [Real]Absence check using 36 positive place invariants in 13 ms returned unsat
[2021-05-13 11:14:59] [INFO ] [Real]Absence check using 36 positive place invariants in 19 ms returned unsat
[2021-05-13 11:14:59] [INFO ] [Real]Absence check using 36 positive place invariants in 17 ms returned unsat
[2021-05-13 11:14:59] [INFO ] [Real]Absence check using 36 positive place invariants in 28 ms returned unsat
[2021-05-13 11:14:59] [INFO ] [Real]Absence check using 36 positive place invariants in 12 ms returned unsat
[2021-05-13 11:14:59] [INFO ] [Real]Absence check using 36 positive place invariants in 193 ms returned sat
[2021-05-13 11:15:00] [INFO ] [Real]Absence check using 36 positive and 29 generalized place invariants in 105 ms returned sat
[2021-05-13 11:15:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 11:15:00] [INFO ] [Real]Absence check using state equation in 646 ms returned sat
[2021-05-13 11:15:00] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 11:15:00] [INFO ] [Nat]Absence check using 36 positive place invariants in 219 ms returned sat
[2021-05-13 11:15:01] [INFO ] [Nat]Absence check using 36 positive and 29 generalized place invariants in 52 ms returned sat
[2021-05-13 11:15:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 11:15:01] [INFO ] [Nat]Absence check using state equation in 432 ms returned sat
[2021-05-13 11:15:01] [INFO ] Deduced a trap composed of 11 places in 167 ms
[2021-05-13 11:15:01] [INFO ] Deduced a trap composed of 13 places in 130 ms
[2021-05-13 11:15:01] [INFO ] Deduced a trap composed of 8 places in 117 ms
[2021-05-13 11:15:02] [INFO ] Deduced a trap composed of 12 places in 130 ms
[2021-05-13 11:15:02] [INFO ] Deduced a trap composed of 19 places in 58 ms
[2021-05-13 11:15:02] [INFO ] Deduced a trap composed of 17 places in 57 ms
[2021-05-13 11:15:02] [INFO ] Deduced a trap composed of 33 places in 80 ms
[2021-05-13 11:15:02] [INFO ] Deduced a trap composed of 52 places in 65 ms
[2021-05-13 11:15:02] [INFO ] Deduced a trap composed of 20 places in 150 ms
[2021-05-13 11:15:02] [INFO ] Deduced a trap composed of 92 places in 149 ms
[2021-05-13 11:15:02] [INFO ] Deduced a trap composed of 14 places in 150 ms
[2021-05-13 11:15:03] [INFO ] Deduced a trap composed of 95 places in 119 ms
[2021-05-13 11:15:03] [INFO ] Deduced a trap composed of 27 places in 173 ms
[2021-05-13 11:15:03] [INFO ] Deduced a trap composed of 103 places in 142 ms
[2021-05-13 11:15:03] [INFO ] Deduced a trap composed of 17 places in 79 ms
[2021-05-13 11:15:03] [INFO ] Deduced a trap composed of 35 places in 135 ms
[2021-05-13 11:15:03] [INFO ] Deduced a trap composed of 91 places in 139 ms
[2021-05-13 11:15:03] [INFO ] Deduced a trap composed of 106 places in 138 ms
[2021-05-13 11:15:03] [INFO ] Deduced a trap composed of 22 places in 37 ms
[2021-05-13 11:15:04] [INFO ] Deduced a trap composed of 96 places in 127 ms
[2021-05-13 11:15:04] [INFO ] Deduced a trap composed of 21 places in 127 ms
[2021-05-13 11:15:04] [INFO ] Deduced a trap composed of 22 places in 35 ms
[2021-05-13 11:15:04] [INFO ] Deduced a trap composed of 23 places in 35 ms
[2021-05-13 11:15:04] [INFO ] Deduced a trap composed of 95 places in 128 ms
[2021-05-13 11:15:04] [INFO ] Deduced a trap composed of 33 places in 33 ms
[2021-05-13 11:15:04] [INFO ] Deduced a trap composed of 20 places in 28 ms
[2021-05-13 11:15:04] [INFO ] Deduced a trap composed of 24 places in 33 ms
[2021-05-13 11:15:04] [INFO ] Trap strengthening (SAT) tested/added 28/27 trap constraints in 3198 ms
[2021-05-13 11:15:04] [INFO ] Computed and/alt/rep : 373/1354/373 causal constraints in 24 ms.
[2021-05-13 11:15:06] [INFO ] Added : 267 causal constraints over 54 iterations in 1914 ms. Result :sat
[2021-05-13 11:15:06] [INFO ] Deduced a trap composed of 108 places in 170 ms
[2021-05-13 11:15:06] [INFO ] Deduced a trap composed of 109 places in 150 ms
[2021-05-13 11:15:07] [INFO ] Deduced a trap composed of 103 places in 152 ms
[2021-05-13 11:15:07] [INFO ] Deduced a trap composed of 104 places in 142 ms
[2021-05-13 11:15:07] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 943 ms
[2021-05-13 11:15:07] [INFO ] [Real]Absence check using 36 positive place invariants in 17 ms returned unsat
[2021-05-13 11:15:07] [INFO ] [Real]Absence check using 36 positive place invariants in 13 ms returned unsat
[2021-05-13 11:15:07] [INFO ] [Real]Absence check using 36 positive place invariants in 12 ms returned unsat
[2021-05-13 11:15:07] [INFO ] [Real]Absence check using 36 positive place invariants in 12 ms returned unsat
[2021-05-13 11:15:07] [INFO ] [Real]Absence check using 36 positive place invariants in 15 ms returned unsat
[2021-05-13 11:15:08] [INFO ] [Real]Absence check using 36 positive place invariants in 15 ms returned unsat
[2021-05-13 11:15:08] [INFO ] [Real]Absence check using 36 positive place invariants in 29 ms returned unsat
[2021-05-13 11:15:08] [INFO ] [Real]Absence check using 36 positive place invariants in 13 ms returned unsat
[2021-05-13 11:15:08] [INFO ] [Real]Absence check using 36 positive place invariants in 12 ms returned unsat
Successfully simplified 66 atomic propositions for a total of 66 simplifications.
[2021-05-13 11:15:08] [INFO ] Initial state reduction rules for CTL removed 5 formulas.
[2021-05-13 11:15:08] [INFO ] Flatten gal took : 86 ms
[2021-05-13 11:15:08] [INFO ] Initial state reduction rules for CTL removed 9 formulas.
[2021-05-13 11:15:08] [INFO ] Flatten gal took : 25 ms
FORMULA BusinessProcesses-PT-09-CTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-09-CTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-09-CTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-09-CTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-09-CTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-09-CTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-09-CTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-09-CTLCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-09-CTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-13 11:15:08] [INFO ] Applying decomposition
[2021-05-13 11:15:08] [INFO ] Flatten gal took : 22 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202005100927/bin/convert-linux64, -i, /tmp/graph16939483085185242242.txt, -o, /tmp/graph16939483085185242242.bin, -w, /tmp/graph16939483085185242242.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202005100927/bin/louvain-linux64, /tmp/graph16939483085185242242.bin, -l, -1, -v, -w, /tmp/graph16939483085185242242.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-13 11:15:08] [INFO ] Decomposing Gal with order
[2021-05-13 11:15:08] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-13 11:15:08] [INFO ] Removed a total of 209 redundant transitions.
[2021-05-13 11:15:09] [INFO ] Flatten gal took : 124 ms
[2021-05-13 11:15:09] [INFO ] Fuse similar labels procedure discarded/fused a total of 6 labels/synchronizations in 18 ms.
[2021-05-13 11:15:09] [INFO ] Time to serialize gal into /home/mcc/execution/CTLCardinality.pnml.gal : 12 ms
[2021-05-13 11:15:09] [INFO ] Time to serialize properties into /home/mcc/execution/CTLCardinality.ctl : 2 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202005100927/bin/its-ctl-linux64, --gc-threshold, 2000000, --quiet, -i, /home/mcc/execution/CTLCardinality.pnml.gal, -t, CGAL, -ctl, /home/mcc/execution/CTLCardinality.ctl, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202005100927/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /home/mcc/execution/CTLCardinality.pnml.gal -t CGAL -ctl /home/mcc/execution/CTLCardinality.ctl --gen-order FOLLOW
No direction supplied, using forward translation only.
Parsed 7 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,7.52257e+18,196.999,2920012,2,823323,5,1.07154e+07,6,0,1987,1.14077e+07,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2021-05-13 11:35:26] [INFO ] Applying decomposition
[2021-05-13 11:35:26] [INFO ] Flatten gal took : 209 ms
[2021-05-13 11:35:26] [INFO ] Decomposing Gal with order
[2021-05-13 11:35:26] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-13 11:35:26] [INFO ] Removed a total of 117 redundant transitions.
[2021-05-13 11:35:26] [INFO ] Flatten gal took : 235 ms
[2021-05-13 11:35:27] [INFO ] Fuse similar labels procedure discarded/fused a total of 72 labels/synchronizations in 315 ms.
[2021-05-13 11:35:27] [INFO ] Time to serialize gal into /home/mcc/execution/CTLCardinality.pnml.gal : 48 ms
[2021-05-13 11:35:27] [INFO ] Time to serialize properties into /home/mcc/execution/CTLCardinality.ctl : 4 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202005100927/bin/its-ctl-linux64, --gc-threshold, 2000000, --quiet, -i, /home/mcc/execution/CTLCardinality.pnml.gal, -t, CGAL, -ctl, /home/mcc/execution/CTLCardinality.ctl, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202005100927/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /home/mcc/execution/CTLCardinality.pnml.gal -t CGAL -ctl /home/mcc/execution/CTLCardinality.ctl --gen-order FOLLOW
No direction supplied, using forward translation only.
Parsed 7 CTL formulae.
Detected timeout of ITS tools.
[2021-05-13 11:55:44] [INFO ] Flatten gal took : 184 ms
[2021-05-13 11:55:45] [INFO ] Input system was already deterministic with 374 transitions.
[2021-05-13 11:55:45] [INFO ] Transformed 403 places.
[2021-05-13 11:55:45] [INFO ] Transformed 374 transitions.
Running greatSPN : CommandLine [args=[/home/mcc/BenchKit//greatspn//bin/pinvar, /home/mcc/execution/gspn], workingDir=/home/mcc/execution]
P-invariant computation with GreatSPN timed out. Skipping.
Running greatSPN : CommandLine [args=[/home/mcc/BenchKit//greatspn//bin/RGMEDD2, /home/mcc/execution/gspn, -META, -varord-only], workingDir=/home/mcc/execution]
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2021-05-13 11:56:15] [INFO ] Time to serialize gal into /home/mcc/execution/CTLCardinality.pnml.gal : 3 ms
[2021-05-13 11:56:15] [INFO ] Time to serialize properties into /home/mcc/execution/CTLCardinality.ctl : 3 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202005100927/bin/its-ctl-linux64, --gc-threshold, 2000000, --quiet, -i, /home/mcc/execution/CTLCardinality.pnml.gal, -t, CGAL, -ctl, /home/mcc/execution/CTLCardinality.ctl, --load-order, /home/mcc/execution/model.ord, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202005100927/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /home/mcc/execution/CTLCardinality.pnml.gal -t CGAL -ctl /home/mcc/execution/CTLCardinality.ctl --load-order /home/mcc/execution/model.ord --gen-order FOLLOW
Successfully loaded order from file /home/mcc/execution/model.ord
No direction supplied, using forward translation only.
Parsed 7 CTL formulae.

BK_TIME_CONFINEMENT_REACHED

--------------------
content from stderr:

+ export BINDIR=/home/mcc/BenchKit/
+ BINDIR=/home/mcc/BenchKit/
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ CTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit//runeclipse.sh /home/mcc/execution CTLCardinality -its -ltsminpath /home/mcc/BenchKit//lts_install_dir/ -greatspnpath /home/mcc/BenchKit//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ /home/mcc/BenchKit//itstools/its-tools -data /home/mcc/execution/workspace -pnfolder /home/mcc/execution -examination CTLCardinality -z3path /home/mcc/BenchKit//z3/bin/z3 -yices2path /home/mcc/BenchKit//yices/bin/yices -its -ltsminpath /home/mcc/BenchKit//lts_install_dir/ -greatspnpath /home/mcc/BenchKit//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m -Dfile.encoding=UTF-8 -Dosgi.requiredJavaVersion=1.6

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-09"
export BK_EXAMINATION="CTLCardinality"
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-09, examination is CTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r035-tajo-162038167700097"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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