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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 508K
-rw-r--r-- 1 mcc users 13K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 119K May 10 09:42 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.1K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 73K 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.8K Mar 28 15:48 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K Mar 28 15:48 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Mar 28 15:48 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 28 15:48 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.2K Mar 23 03:00 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 15K Mar 23 03:00 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Mar 22 12:14 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 13K 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.8K Mar 22 09:10 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 5 16:51 equiv_col
-rw-r--r-- 1 mcc users 3 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 146K 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-12-CTLCardinality-00
FORMULA_NAME BusinessProcesses-PT-12-CTLCardinality-01
FORMULA_NAME BusinessProcesses-PT-12-CTLCardinality-02
FORMULA_NAME BusinessProcesses-PT-12-CTLCardinality-03
FORMULA_NAME BusinessProcesses-PT-12-CTLCardinality-04
FORMULA_NAME BusinessProcesses-PT-12-CTLCardinality-05
FORMULA_NAME BusinessProcesses-PT-12-CTLCardinality-06
FORMULA_NAME BusinessProcesses-PT-12-CTLCardinality-07
FORMULA_NAME BusinessProcesses-PT-12-CTLCardinality-08
FORMULA_NAME BusinessProcesses-PT-12-CTLCardinality-09
FORMULA_NAME BusinessProcesses-PT-12-CTLCardinality-10
FORMULA_NAME BusinessProcesses-PT-12-CTLCardinality-11
FORMULA_NAME BusinessProcesses-PT-12-CTLCardinality-12
FORMULA_NAME BusinessProcesses-PT-12-CTLCardinality-13
FORMULA_NAME BusinessProcesses-PT-12-CTLCardinality-14
FORMULA_NAME BusinessProcesses-PT-12-CTLCardinality-15

=== Now, execution of the tool begins

BK_START 1620904771547

[2021-05-13 11:19:33] [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:19:33] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-13 11:19:33] [INFO ] Load time of PNML (sax parser for PT used): 96 ms
[2021-05-13 11:19:33] [INFO ] Transformed 586 places.
[2021-05-13 11:19:33] [INFO ] Transformed 525 transitions.
[2021-05-13 11:19:33] [INFO ] Found NUPN structural information;
[2021-05-13 11:19:33] [INFO ] Parsed PT model containing 586 places and 525 transitions in 154 ms.
Deduced a syphon composed of 4 places in 13 ms
Reduce places removed 4 places and 4 transitions.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 59 ms.
Incomplete random walk after 100000 steps, including 722 resets, run finished after 1267 ms. (steps per millisecond=78 ) properties seen :[0, 1, 0, 1, 0, 0, 0, 0, 1, 0, 0, 0, 0, 1, 1, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 1, 0, 1, 0, 0, 0, 1, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 1, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 1, 0, 1]
// Phase 1: matrix 521 rows 582 cols
[2021-05-13 11:19:34] [INFO ] Computed 98 place invariants in 37 ms
[2021-05-13 11:19:35] [INFO ] [Real]Absence check using 55 positive place invariants in 28 ms returned unsat
[2021-05-13 11:19:35] [INFO ] [Real]Absence check using 55 positive place invariants in 26 ms returned unsat
[2021-05-13 11:19:35] [INFO ] [Real]Absence check using 55 positive place invariants in 21 ms returned unsat
[2021-05-13 11:19:35] [INFO ] [Real]Absence check using 55 positive place invariants in 14 ms returned unsat
[2021-05-13 11:19:35] [INFO ] [Real]Absence check using 55 positive place invariants in 34 ms returned sat
[2021-05-13 11:19:35] [INFO ] [Real]Absence check using 55 positive and 43 generalized place invariants in 21 ms returned sat
[2021-05-13 11:19:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 11:19:36] [INFO ] [Real]Absence check using state equation in 688 ms returned sat
[2021-05-13 11:19:36] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 11:19:36] [INFO ] [Nat]Absence check using 55 positive place invariants in 25 ms returned unsat
[2021-05-13 11:19:36] [INFO ] [Real]Absence check using 55 positive place invariants in 48 ms returned sat
[2021-05-13 11:19:36] [INFO ] [Real]Absence check using 55 positive and 43 generalized place invariants in 7 ms returned unsat
[2021-05-13 11:19:36] [INFO ] [Real]Absence check using 55 positive place invariants in 24 ms returned unsat
[2021-05-13 11:19:36] [INFO ] [Real]Absence check using 55 positive place invariants in 16 ms returned unsat
[2021-05-13 11:19:36] [INFO ] [Real]Absence check using 55 positive place invariants in 45 ms returned sat
[2021-05-13 11:19:37] [INFO ] [Real]Absence check using 55 positive and 43 generalized place invariants in 21 ms returned unsat
[2021-05-13 11:19:37] [INFO ] [Real]Absence check using 55 positive place invariants in 21 ms returned unsat
[2021-05-13 11:19:37] [INFO ] [Real]Absence check using 55 positive place invariants in 22 ms returned unsat
[2021-05-13 11:19:37] [INFO ] [Real]Absence check using 55 positive place invariants in 46 ms returned sat
[2021-05-13 11:19:37] [INFO ] [Real]Absence check using 55 positive and 43 generalized place invariants in 30 ms returned sat
[2021-05-13 11:19:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 11:19:38] [INFO ] [Real]Absence check using state equation in 709 ms returned sat
[2021-05-13 11:19:38] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 11:19:38] [INFO ] [Nat]Absence check using 55 positive place invariants in 49 ms returned sat
[2021-05-13 11:19:38] [INFO ] [Nat]Absence check using 55 positive and 43 generalized place invariants in 21 ms returned sat
[2021-05-13 11:19:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 11:19:39] [INFO ] [Nat]Absence check using state equation in 1081 ms returned sat
[2021-05-13 11:19:39] [INFO ] Deduced a trap composed of 13 places in 403 ms
[2021-05-13 11:19:40] [INFO ] Deduced a trap composed of 48 places in 278 ms
[2021-05-13 11:19:40] [INFO ] Deduced a trap composed of 12 places in 181 ms
[2021-05-13 11:19:40] [INFO ] Deduced a trap composed of 38 places in 159 ms
[2021-05-13 11:19:40] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1228 ms
[2021-05-13 11:19:40] [INFO ] Computed and/alt/rep : 520/2220/520 causal constraints in 46 ms.
[2021-05-13 11:19:42] [INFO ] Added : 206 causal constraints over 42 iterations in 2191 ms. Result :sat
[2021-05-13 11:19:42] [INFO ] [Real]Absence check using 55 positive place invariants in 22 ms returned unsat
[2021-05-13 11:19:43] [INFO ] [Real]Absence check using 55 positive place invariants in 22 ms returned unsat
[2021-05-13 11:19:43] [INFO ] [Real]Absence check using 55 positive place invariants in 25 ms returned unsat
[2021-05-13 11:19:43] [INFO ] [Real]Absence check using 55 positive place invariants in 45 ms returned sat
[2021-05-13 11:19:43] [INFO ] [Real]Absence check using 55 positive and 43 generalized place invariants in 29 ms returned sat
[2021-05-13 11:19:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 11:19:45] [INFO ] [Real]Absence check using state equation in 1623 ms returned sat
[2021-05-13 11:19:45] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 11:19:45] [INFO ] [Nat]Absence check using 55 positive place invariants in 15 ms returned unsat
[2021-05-13 11:19:45] [INFO ] [Real]Absence check using 55 positive place invariants in 16 ms returned unsat
[2021-05-13 11:19:45] [INFO ] [Real]Absence check using 55 positive place invariants in 22 ms returned unsat
[2021-05-13 11:19:45] [INFO ] [Real]Absence check using 55 positive place invariants in 21 ms returned unsat
[2021-05-13 11:19:45] [INFO ] [Real]Absence check using 55 positive place invariants in 49 ms returned sat
[2021-05-13 11:19:45] [INFO ] [Real]Absence check using 55 positive and 43 generalized place invariants in 29 ms returned sat
[2021-05-13 11:19:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 11:19:46] [INFO ] [Real]Absence check using state equation in 881 ms returned sat
[2021-05-13 11:19:46] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 11:19:46] [INFO ] [Nat]Absence check using 55 positive place invariants in 38 ms returned unsat
[2021-05-13 11:19:47] [INFO ] [Real]Absence check using 55 positive place invariants in 22 ms returned unsat
[2021-05-13 11:19:47] [INFO ] [Real]Absence check using 55 positive place invariants in 22 ms returned unsat
[2021-05-13 11:19:47] [INFO ] [Real]Absence check using 55 positive place invariants in 55 ms returned unsat
[2021-05-13 11:19:47] [INFO ] [Real]Absence check using 55 positive place invariants in 49 ms returned sat
[2021-05-13 11:19:47] [INFO ] [Real]Absence check using 55 positive and 43 generalized place invariants in 23 ms returned unsat
[2021-05-13 11:19:47] [INFO ] [Real]Absence check using 55 positive place invariants in 22 ms returned unsat
[2021-05-13 11:19:48] [INFO ] [Real]Absence check using 55 positive place invariants in 24 ms returned unsat
[2021-05-13 11:19:48] [INFO ] [Real]Absence check using 55 positive place invariants in 23 ms returned unsat
[2021-05-13 11:19:48] [INFO ] [Real]Absence check using 55 positive place invariants in 42 ms returned unsat
[2021-05-13 11:19:48] [INFO ] [Real]Absence check using 55 positive place invariants in 35 ms returned unsat
[2021-05-13 11:19:48] [INFO ] [Real]Absence check using 55 positive place invariants in 49 ms returned sat
[2021-05-13 11:19:48] [INFO ] [Real]Absence check using 55 positive and 43 generalized place invariants in 29 ms returned sat
[2021-05-13 11:19:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 11:19:49] [INFO ] [Real]Absence check using state equation in 901 ms returned sat
[2021-05-13 11:19:49] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 11:19:49] [INFO ] [Nat]Absence check using 55 positive place invariants in 24 ms returned unsat
[2021-05-13 11:19:49] [INFO ] [Real]Absence check using 55 positive place invariants in 25 ms returned unsat
[2021-05-13 11:19:50] [INFO ] [Real]Absence check using 55 positive place invariants in 21 ms returned unsat
[2021-05-13 11:19:50] [INFO ] [Real]Absence check using 55 positive place invariants in 23 ms returned unsat
[2021-05-13 11:19:50] [INFO ] [Real]Absence check using 55 positive place invariants in 22 ms returned unsat
[2021-05-13 11:19:50] [INFO ] [Real]Absence check using 55 positive place invariants in 22 ms returned unsat
[2021-05-13 11:19:50] [INFO ] [Real]Absence check using 55 positive place invariants in 22 ms returned unsat
[2021-05-13 11:19:50] [INFO ] [Real]Absence check using 55 positive place invariants in 48 ms returned sat
[2021-05-13 11:19:50] [INFO ] [Real]Absence check using 55 positive and 43 generalized place invariants in 29 ms returned sat
[2021-05-13 11:19:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 11:19:51] [INFO ] [Real]Absence check using state equation in 987 ms returned sat
[2021-05-13 11:19:51] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 11:19:52] [INFO ] [Nat]Absence check using 55 positive place invariants in 60 ms returned sat
[2021-05-13 11:19:52] [INFO ] [Nat]Absence check using 55 positive and 43 generalized place invariants in 29 ms returned sat
[2021-05-13 11:19:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 11:19:53] [INFO ] [Nat]Absence check using state equation in 1019 ms returned sat
[2021-05-13 11:19:53] [INFO ] Deduced a trap composed of 16 places in 258 ms
[2021-05-13 11:19:53] [INFO ] Deduced a trap composed of 16 places in 235 ms
[2021-05-13 11:19:53] [INFO ] Deduced a trap composed of 29 places in 214 ms
[2021-05-13 11:19:54] [INFO ] Deduced a trap composed of 24 places in 207 ms
[2021-05-13 11:19:54] [INFO ] Deduced a trap composed of 18 places in 252 ms
[2021-05-13 11:19:54] [INFO ] Deduced a trap composed of 49 places in 242 ms
[2021-05-13 11:19:54] [INFO ] Deduced a trap composed of 24 places in 223 ms
[2021-05-13 11:19:55] [INFO ] Deduced a trap composed of 128 places in 799 ms
[2021-05-13 11:19:56] [INFO ] Deduced a trap composed of 35 places in 237 ms
[2021-05-13 11:19:56] [INFO ] Deduced a trap composed of 24 places in 231 ms
[2021-05-13 11:19:56] [INFO ] Deduced a trap composed of 22 places in 197 ms
[2021-05-13 11:19:56] [INFO ] Deduced a trap composed of 129 places in 197 ms
[2021-05-13 11:19:56] [INFO ] Deduced a trap composed of 41 places in 192 ms
[2021-05-13 11:19:57] [INFO ] Deduced a trap composed of 25 places in 278 ms
[2021-05-13 11:19:57] [INFO ] Deduced a trap composed of 30 places in 309 ms
[2021-05-13 11:19:57] [INFO ] Deduced a trap composed of 55 places in 343 ms
[2021-05-13 11:19:58] [INFO ] Deduced a trap composed of 28 places in 244 ms
[2021-05-13 11:19:58] [INFO ] Deduced a trap composed of 45 places in 185 ms
[2021-05-13 11:19:58] [INFO ] Deduced a trap composed of 24 places in 313 ms
[2021-05-13 11:19:59] [INFO ] Deduced a trap composed of 30 places in 332 ms
[2021-05-13 11:19:59] [INFO ] Deduced a trap composed of 35 places in 270 ms
[2021-05-13 11:19:59] [INFO ] Deduced a trap composed of 55 places in 259 ms
[2021-05-13 11:19:59] [INFO ] Deduced a trap composed of 13 places in 207 ms
[2021-05-13 11:20:00] [INFO ] Deduced a trap composed of 28 places in 200 ms
[2021-05-13 11:20:00] [INFO ] Deduced a trap composed of 22 places in 218 ms
[2021-05-13 11:20:00] [INFO ] Deduced a trap composed of 48 places in 222 ms
[2021-05-13 11:20:00] [INFO ] Deduced a trap composed of 41 places in 170 ms
[2021-05-13 11:20:01] [INFO ] Deduced a trap composed of 51 places in 245 ms
[2021-05-13 11:20:01] [INFO ] Deduced a trap composed of 127 places in 247 ms
[2021-05-13 11:20:01] [INFO ] Deduced a trap composed of 64 places in 174 ms
[2021-05-13 11:20:01] [INFO ] Deduced a trap composed of 34 places in 174 ms
[2021-05-13 11:20:01] [INFO ] Deduced a trap composed of 43 places in 197 ms
[2021-05-13 11:20:02] [INFO ] Deduced a trap composed of 40 places in 169 ms
[2021-05-13 11:20:02] [INFO ] Deduced a trap composed of 59 places in 186 ms
[2021-05-13 11:20:02] [INFO ] Deduced a trap composed of 37 places in 211 ms
[2021-05-13 11:20:02] [INFO ] Deduced a trap composed of 128 places in 188 ms
[2021-05-13 11:20:03] [INFO ] Deduced a trap composed of 137 places in 192 ms
[2021-05-13 11:20:03] [INFO ] Deduced a trap composed of 130 places in 183 ms
[2021-05-13 11:20:03] [INFO ] Deduced a trap composed of 134 places in 183 ms
[2021-05-13 11:20:03] [INFO ] Deduced a trap composed of 140 places in 270 ms
[2021-05-13 11:20:04] [INFO ] Deduced a trap composed of 36 places in 206 ms
[2021-05-13 11:20:04] [INFO ] Deduced a trap composed of 140 places in 177 ms
[2021-05-13 11:20:04] [INFO ] Deduced a trap composed of 130 places in 202 ms
[2021-05-13 11:20:04] [INFO ] Deduced a trap composed of 127 places in 176 ms
[2021-05-13 11:20:04] [INFO ] Deduced a trap composed of 134 places in 217 ms
[2021-05-13 11:20:05] [INFO ] Deduced a trap composed of 130 places in 543 ms
[2021-05-13 11:20:05] [INFO ] Deduced a trap composed of 128 places in 194 ms
[2021-05-13 11:20:05] [INFO ] Deduced a trap composed of 136 places in 212 ms
[2021-05-13 11:20:06] [INFO ] Deduced a trap composed of 139 places in 386 ms
[2021-05-13 11:20:06] [INFO ] Deduced a trap composed of 123 places in 164 ms
[2021-05-13 11:20:06] [INFO ] Deduced a trap composed of 135 places in 206 ms
[2021-05-13 11:20:07] [INFO ] Deduced a trap composed of 133 places in 218 ms
[2021-05-13 11:20:07] [INFO ] Deduced a trap composed of 125 places in 189 ms
[2021-05-13 11:20:07] [INFO ] Deduced a trap composed of 30 places in 215 ms
[2021-05-13 11:20:07] [INFO ] Deduced a trap composed of 34 places in 200 ms
[2021-05-13 11:20:08] [INFO ] Deduced a trap composed of 126 places in 188 ms
[2021-05-13 11:20:08] [INFO ] Deduced a trap composed of 141 places in 206 ms
[2021-05-13 11:20:08] [INFO ] Deduced a trap composed of 125 places in 184 ms
[2021-05-13 11:20:08] [INFO ] Deduced a trap composed of 130 places in 225 ms
[2021-05-13 11:20:09] [INFO ] Deduced a trap composed of 136 places in 210 ms
[2021-05-13 11:20:09] [INFO ] Deduced a trap composed of 132 places in 207 ms
[2021-05-13 11:20:09] [INFO ] Deduced a trap composed of 127 places in 200 ms
[2021-05-13 11:20:09] [INFO ] Deduced a trap composed of 133 places in 190 ms
[2021-05-13 11:20:10] [INFO ] Deduced a trap composed of 133 places in 203 ms
[2021-05-13 11:20:10] [INFO ] Deduced a trap composed of 131 places in 205 ms
[2021-05-13 11:20:10] [INFO ] Deduced a trap composed of 135 places in 196 ms
[2021-05-13 11:20:10] [INFO ] Deduced a trap composed of 135 places in 172 ms
[2021-05-13 11:20:11] [INFO ] Deduced a trap composed of 131 places in 174 ms
[2021-05-13 11:20:11] [INFO ] Deduced a trap composed of 130 places in 181 ms
[2021-05-13 11:20:11] [INFO ] Deduced a trap composed of 131 places in 192 ms
[2021-05-13 11:20:11] [INFO ] Deduced a trap composed of 133 places in 170 ms
[2021-05-13 11:20:11] [INFO ] Trap strengthening (SAT) tested/added 72/71 trap constraints in 18662 ms
[2021-05-13 11:20:11] [INFO ] Computed and/alt/rep : 520/2220/520 causal constraints in 45 ms.
[2021-05-13 11:20:11] [INFO ] Added : 5 causal constraints over 1 iterations in 96 ms. Result :(error "Failed to check-sat")
[2021-05-13 11:20:11] [INFO ] [Real]Absence check using 55 positive place invariants in 22 ms returned unsat
[2021-05-13 11:20:12] [INFO ] [Real]Absence check using 55 positive place invariants in 37 ms returned sat
[2021-05-13 11:20:12] [INFO ] [Real]Absence check using 55 positive and 43 generalized place invariants in 25 ms returned sat
[2021-05-13 11:20:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 11:20:12] [INFO ] [Real]Absence check using state equation in 745 ms returned sat
[2021-05-13 11:20:12] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 11:20:13] [INFO ] [Nat]Absence check using 55 positive place invariants in 43 ms returned sat
[2021-05-13 11:20:13] [INFO ] [Nat]Absence check using 55 positive and 43 generalized place invariants in 21 ms returned sat
[2021-05-13 11:20:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 11:20:13] [INFO ] [Nat]Absence check using state equation in 704 ms returned sat
[2021-05-13 11:20:14] [INFO ] Deduced a trap composed of 11 places in 236 ms
[2021-05-13 11:20:14] [INFO ] Deduced a trap composed of 17 places in 197 ms
[2021-05-13 11:20:14] [INFO ] Deduced a trap composed of 24 places in 206 ms
[2021-05-13 11:20:14] [INFO ] Deduced a trap composed of 12 places in 195 ms
[2021-05-13 11:20:14] [INFO ] Deduced a trap composed of 20 places in 265 ms
[2021-05-13 11:20:15] [INFO ] Deduced a trap composed of 37 places in 259 ms
[2021-05-13 11:20:15] [INFO ] Deduced a trap composed of 43 places in 242 ms
[2021-05-13 11:20:15] [INFO ] Deduced a trap composed of 42 places in 273 ms
[2021-05-13 11:20:16] [INFO ] Deduced a trap composed of 125 places in 257 ms
[2021-05-13 11:20:16] [INFO ] Deduced a trap composed of 36 places in 223 ms
[2021-05-13 11:20:16] [INFO ] Deduced a trap composed of 22 places in 249 ms
[2021-05-13 11:20:16] [INFO ] Deduced a trap composed of 32 places in 211 ms
[2021-05-13 11:20:17] [INFO ] Deduced a trap composed of 37 places in 216 ms
[2021-05-13 11:20:17] [INFO ] Deduced a trap composed of 18 places in 249 ms
[2021-05-13 11:20:17] [INFO ] Deduced a trap composed of 21 places in 238 ms
[2021-05-13 11:20:17] [INFO ] Deduced a trap composed of 21 places in 235 ms
[2021-05-13 11:20:18] [INFO ] Deduced a trap composed of 29 places in 234 ms
[2021-05-13 11:20:18] [INFO ] Deduced a trap composed of 132 places in 201 ms
[2021-05-13 11:20:18] [INFO ] Deduced a trap composed of 24 places in 212 ms
[2021-05-13 11:20:18] [INFO ] Deduced a trap composed of 35 places in 203 ms
[2021-05-13 11:20:19] [INFO ] Deduced a trap composed of 28 places in 201 ms
[2021-05-13 11:20:19] [INFO ] Deduced a trap composed of 136 places in 204 ms
[2021-05-13 11:20:19] [INFO ] Deduced a trap composed of 136 places in 190 ms
[2021-05-13 11:20:19] [INFO ] Deduced a trap composed of 33 places in 229 ms
[2021-05-13 11:20:19] [INFO ] Deduced a trap composed of 38 places in 215 ms
[2021-05-13 11:20:20] [INFO ] Deduced a trap composed of 137 places in 198 ms
[2021-05-13 11:20:20] [INFO ] Deduced a trap composed of 43 places in 223 ms
[2021-05-13 11:20:20] [INFO ] Deduced a trap composed of 136 places in 194 ms
[2021-05-13 11:20:20] [INFO ] Deduced a trap composed of 122 places in 213 ms
[2021-05-13 11:20:21] [INFO ] Deduced a trap composed of 142 places in 196 ms
[2021-05-13 11:20:21] [INFO ] Deduced a trap composed of 128 places in 196 ms
[2021-05-13 11:20:21] [INFO ] Deduced a trap composed of 73 places in 203 ms
[2021-05-13 11:20:21] [INFO ] Deduced a trap composed of 140 places in 224 ms
[2021-05-13 11:20:22] [INFO ] Deduced a trap composed of 37 places in 209 ms
[2021-05-13 11:20:22] [INFO ] Deduced a trap composed of 129 places in 223 ms
[2021-05-13 11:20:22] [INFO ] Deduced a trap composed of 139 places in 204 ms
[2021-05-13 11:20:22] [INFO ] Deduced a trap composed of 128 places in 196 ms
[2021-05-13 11:20:22] [INFO ] Deduced a trap composed of 135 places in 191 ms
[2021-05-13 11:20:23] [INFO ] Deduced a trap composed of 128 places in 179 ms
[2021-05-13 11:20:23] [INFO ] Deduced a trap composed of 44 places in 215 ms
[2021-05-13 11:20:23] [INFO ] Deduced a trap composed of 143 places in 203 ms
[2021-05-13 11:20:23] [INFO ] Deduced a trap composed of 145 places in 193 ms
[2021-05-13 11:20:24] [INFO ] Deduced a trap composed of 137 places in 195 ms
[2021-05-13 11:20:24] [INFO ] Deduced a trap composed of 136 places in 198 ms
[2021-05-13 11:20:24] [INFO ] Deduced a trap composed of 142 places in 206 ms
[2021-05-13 11:20:24] [INFO ] Deduced a trap composed of 123 places in 197 ms
[2021-05-13 11:20:25] [INFO ] Deduced a trap composed of 152 places in 223 ms
[2021-05-13 11:20:25] [INFO ] Deduced a trap composed of 151 places in 197 ms
[2021-05-13 11:20:25] [INFO ] Deduced a trap composed of 33 places in 205 ms
[2021-05-13 11:20:25] [INFO ] Deduced a trap composed of 155 places in 241 ms
[2021-05-13 11:20:25] [INFO ] Deduced a trap composed of 135 places in 205 ms
[2021-05-13 11:20:26] [INFO ] Deduced a trap composed of 156 places in 211 ms
[2021-05-13 11:20:26] [INFO ] Deduced a trap composed of 143 places in 213 ms
[2021-05-13 11:20:26] [INFO ] Deduced a trap composed of 135 places in 241 ms
[2021-05-13 11:20:27] [INFO ] Deduced a trap composed of 121 places in 221 ms
[2021-05-13 11:20:27] [INFO ] Deduced a trap composed of 131 places in 220 ms
[2021-05-13 11:20:27] [INFO ] Deduced a trap composed of 123 places in 195 ms
[2021-05-13 11:20:27] [INFO ] Deduced a trap composed of 140 places in 234 ms
[2021-05-13 11:20:28] [INFO ] Deduced a trap composed of 121 places in 227 ms
[2021-05-13 11:20:28] [INFO ] Deduced a trap composed of 122 places in 206 ms
[2021-05-13 11:20:28] [INFO ] Deduced a trap composed of 127 places in 220 ms
[2021-05-13 11:20:29] [INFO ] Deduced a trap composed of 123 places in 201 ms
[2021-05-13 11:20:29] [INFO ] Deduced a trap composed of 35 places in 231 ms
[2021-05-13 11:20:29] [INFO ] Deduced a trap composed of 24 places in 191 ms
[2021-05-13 11:20:29] [INFO ] Deduced a trap composed of 48 places in 194 ms
[2021-05-13 11:20:30] [INFO ] Deduced a trap composed of 128 places in 193 ms
[2021-05-13 11:20:30] [INFO ] Deduced a trap composed of 128 places in 209 ms
[2021-05-13 11:20:30] [INFO ] Deduced a trap composed of 135 places in 229 ms
[2021-05-13 11:20:31] [INFO ] Deduced a trap composed of 140 places in 188 ms
[2021-05-13 11:20:31] [INFO ] Deduced a trap composed of 121 places in 204 ms
[2021-05-13 11:20:31] [INFO ] Deduced a trap composed of 151 places in 214 ms
[2021-05-13 11:20:31] [INFO ] Deduced a trap composed of 25 places in 233 ms
[2021-05-13 11:20:32] [INFO ] Deduced a trap composed of 17 places in 186 ms
[2021-05-13 11:20:32] [INFO ] Deduced a trap composed of 128 places in 198 ms
[2021-05-13 11:20:32] [INFO ] Deduced a trap composed of 39 places in 264 ms
[2021-05-13 11:20:32] [INFO ] Deduced a trap composed of 29 places in 182 ms
[2021-05-13 11:20:32] [INFO ] Deduced a trap composed of 129 places in 186 ms
[2021-05-13 11:20:32] [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 s42 s43 s46 s47 s48 s49 s50 s51 s52 s53 s71 s75 s80 s86 s87 s88 s96 s105 s126 s127 s128 s134 s135 s159 s160 s161 s165 s166 s167 s171 s172 s173 s191 s192 s193 s203 s204 s205 s223 s224 s236 s239 s275 s284 s289 s294 s299 s304 s309 s314 s324 s329 s334 s339 s349 s354 s369 s374 s379 s389 s394 s399 s413 s416 s417 s418 s419 s422 s423 s424 s425 s426 s427 s428 s429 s430 s431 s432 s433 s434 s435 s436 s437 s438 s447 s448 s451 s452 s456 s460 s466 s474 s475 s480 s481 s488 s489 s490 s491 s492 s493 s494 s495 s504 s505 s509 s510 s515 s516 s517 s518 s525 s526 s529 s530 s537 s538 s539 s540 s541 s542 s543 s554 s566 s572 s573) 0)") while checking expression at index 38
[2021-05-13 11:20:33] [INFO ] [Real]Absence check using 55 positive place invariants in 21 ms returned unsat
[2021-05-13 11:20:33] [INFO ] [Real]Absence check using 55 positive place invariants in 23 ms returned unsat
[2021-05-13 11:20:33] [INFO ] [Real]Absence check using 55 positive place invariants in 24 ms returned unsat
[2021-05-13 11:20:33] [INFO ] [Real]Absence check using 55 positive place invariants in 26 ms returned unsat
[2021-05-13 11:20:33] [INFO ] [Real]Absence check using 55 positive place invariants in 23 ms returned unsat
[2021-05-13 11:20:33] [INFO ] [Real]Absence check using 55 positive place invariants in 45 ms returned sat
[2021-05-13 11:20:33] [INFO ] [Real]Absence check using 55 positive and 43 generalized place invariants in 20 ms returned unsat
[2021-05-13 11:20:33] [INFO ] [Real]Absence check using 55 positive place invariants in 46 ms returned sat
[2021-05-13 11:20:33] [INFO ] [Real]Absence check using 55 positive and 43 generalized place invariants in 29 ms returned sat
[2021-05-13 11:20:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 11:20:34] [INFO ] [Real]Absence check using state equation in 805 ms returned sat
[2021-05-13 11:20:34] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 11:20:34] [INFO ] [Nat]Absence check using 55 positive place invariants in 22 ms returned unsat
[2021-05-13 11:20:35] [INFO ] [Real]Absence check using 55 positive place invariants in 23 ms returned unsat
[2021-05-13 11:20:35] [INFO ] [Real]Absence check using 55 positive place invariants in 22 ms returned unsat
[2021-05-13 11:20:35] [INFO ] [Real]Absence check using 55 positive place invariants in 23 ms returned unsat
[2021-05-13 11:20:35] [INFO ] [Real]Absence check using 55 positive place invariants in 43 ms returned unsat
[2021-05-13 11:20:35] [INFO ] [Real]Absence check using 55 positive place invariants in 23 ms returned unsat
[2021-05-13 11:20:35] [INFO ] [Real]Absence check using 55 positive place invariants in 24 ms returned unsat
[2021-05-13 11:20:35] [INFO ] [Real]Absence check using 55 positive place invariants in 23 ms returned unsat
[2021-05-13 11:20:36] [INFO ] [Real]Absence check using 55 positive place invariants in 21 ms returned unsat
[2021-05-13 11:20:36] [INFO ] [Real]Absence check using 55 positive place invariants in 23 ms returned unsat
[2021-05-13 11:20:36] [INFO ] [Real]Absence check using 55 positive place invariants in 23 ms returned unsat
[2021-05-13 11:20:36] [INFO ] [Real]Absence check using 55 positive place invariants in 23 ms returned unsat
[2021-05-13 11:20:36] [INFO ] [Real]Absence check using 55 positive place invariants in 37 ms returned unsat
[2021-05-13 11:20:36] [INFO ] [Real]Absence check using 55 positive place invariants in 23 ms returned unsat
[2021-05-13 11:20:36] [INFO ] [Real]Absence check using 55 positive place invariants in 47 ms returned sat
[2021-05-13 11:20:36] [INFO ] [Real]Absence check using 55 positive and 43 generalized place invariants in 29 ms returned sat
[2021-05-13 11:20:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 11:20:37] [INFO ] [Real]Absence check using state equation in 641 ms returned unsat
[2021-05-13 11:20:37] [INFO ] [Real]Absence check using 55 positive place invariants in 21 ms returned unsat
[2021-05-13 11:20:37] [INFO ] [Real]Absence check using 55 positive place invariants in 21 ms returned unsat
[2021-05-13 11:20:37] [INFO ] [Real]Absence check using 55 positive place invariants in 22 ms returned unsat
[2021-05-13 11:20:38] [INFO ] [Real]Absence check using 55 positive place invariants in 23 ms returned unsat
[2021-05-13 11:20:38] [INFO ] [Real]Absence check using 55 positive place invariants in 23 ms returned unsat
[2021-05-13 11:20:38] [INFO ] [Real]Absence check using 55 positive place invariants in 23 ms returned unsat
[2021-05-13 11:20:38] [INFO ] [Real]Absence check using 55 positive place invariants in 51 ms returned sat
[2021-05-13 11:20:38] [INFO ] [Real]Absence check using 55 positive and 43 generalized place invariants in 30 ms returned sat
[2021-05-13 11:20:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 11:20:39] [INFO ] [Real]Absence check using state equation in 897 ms returned sat
[2021-05-13 11:20:39] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 11:20:39] [INFO ] [Nat]Absence check using 55 positive place invariants in 59 ms returned sat
[2021-05-13 11:20:39] [INFO ] [Nat]Absence check using 55 positive and 43 generalized place invariants in 28 ms returned sat
[2021-05-13 11:20:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 11:20:40] [INFO ] [Nat]Absence check using state equation in 895 ms returned sat
[2021-05-13 11:20:40] [INFO ] Deduced a trap composed of 19 places in 157 ms
[2021-05-13 11:20:40] [INFO ] Deduced a trap composed of 39 places in 132 ms
[2021-05-13 11:20:41] [INFO ] Deduced a trap composed of 16 places in 154 ms
[2021-05-13 11:20:41] [INFO ] Deduced a trap composed of 11 places in 125 ms
[2021-05-13 11:20:41] [INFO ] Deduced a trap composed of 15 places in 127 ms
[2021-05-13 11:20:41] [INFO ] Deduced a trap composed of 39 places in 124 ms
[2021-05-13 11:20:41] [INFO ] Deduced a trap composed of 24 places in 127 ms
[2021-05-13 11:20:41] [INFO ] Deduced a trap composed of 18 places in 128 ms
[2021-05-13 11:20:42] [INFO ] Deduced a trap composed of 18 places in 150 ms
[2021-05-13 11:20:42] [INFO ] Deduced a trap composed of 21 places in 121 ms
[2021-05-13 11:20:42] [INFO ] Deduced a trap composed of 26 places in 135 ms
[2021-05-13 11:20:42] [INFO ] Deduced a trap composed of 29 places in 118 ms
[2021-05-13 11:20:42] [INFO ] Deduced a trap composed of 33 places in 118 ms
[2021-05-13 11:20:42] [INFO ] Deduced a trap composed of 24 places in 98 ms
[2021-05-13 11:20:42] [INFO ] Deduced a trap composed of 28 places in 118 ms
[2021-05-13 11:20:43] [INFO ] Deduced a trap composed of 30 places in 90 ms
[2021-05-13 11:20:43] [INFO ] Deduced a trap composed of 22 places in 87 ms
[2021-05-13 11:20:43] [INFO ] Deduced a trap composed of 50 places in 85 ms
[2021-05-13 11:20:43] [INFO ] Deduced a trap composed of 45 places in 77 ms
[2021-05-13 11:20:43] [INFO ] Deduced a trap composed of 48 places in 82 ms
[2021-05-13 11:20:43] [INFO ] Deduced a trap composed of 25 places in 105 ms
[2021-05-13 11:20:43] [INFO ] Deduced a trap composed of 48 places in 81 ms
[2021-05-13 11:20:43] [INFO ] Trap strengthening (SAT) tested/added 23/22 trap constraints in 3058 ms
[2021-05-13 11:20:43] [INFO ] Computed and/alt/rep : 520/2220/520 causal constraints in 31 ms.
[2021-05-13 11:20:46] [INFO ] Added : 299 causal constraints over 60 iterations in 2782 ms. Result :sat
[2021-05-13 11:20:46] [INFO ] [Real]Absence check using 55 positive place invariants in 21 ms returned unsat
Successfully simplified 64 atomic propositions for a total of 64 simplifications.
[2021-05-13 11:20:46] [INFO ] Initial state reduction rules for CTL removed 7 formulas.
[2021-05-13 11:20:46] [INFO ] Flatten gal took : 102 ms
[2021-05-13 11:20:47] [INFO ] Initial state reduction rules for CTL removed 7 formulas.
[2021-05-13 11:20:47] [INFO ] Flatten gal took : 41 ms
FORMULA BusinessProcesses-PT-12-CTLCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-12-CTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-12-CTLCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-12-CTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-12-CTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-12-CTLCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-12-CTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-13 11:20:47] [INFO ] Applying decomposition
[2021-05-13 11:20:47] [INFO ] Flatten gal took : 36 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/graph9903841302237254906.txt, -o, /tmp/graph9903841302237254906.bin, -w, /tmp/graph9903841302237254906.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/graph9903841302237254906.bin, -l, -1, -v, -w, /tmp/graph9903841302237254906.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-13 11:20:47] [INFO ] Decomposing Gal with order
[2021-05-13 11:20:47] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-13 11:20:47] [INFO ] Removed a total of 262 redundant transitions.
[2021-05-13 11:20:47] [INFO ] Flatten gal took : 116 ms
[2021-05-13 11:20:47] [INFO ] Fuse similar labels procedure discarded/fused a total of 5 labels/synchronizations in 18 ms.
[2021-05-13 11:20:47] [INFO ] Time to serialize gal into /home/mcc/execution/CTLCardinality.pnml.gal : 16 ms
[2021-05-13 11:20:47] [INFO ] Time to serialize properties into /home/mcc/execution/CTLCardinality.ctl : 1 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 9 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,6.14329e+23,497.121,6777952,2,1.98892e+06,5,1.86236e+07,6,0,2842,1.88221e+07,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2021-05-13 11:41:13] [INFO ] Applying decomposition
[2021-05-13 11:41:13] [INFO ] Flatten gal took : 496 ms
[2021-05-13 11:41:13] [INFO ] Decomposing Gal with order
[2021-05-13 11:41:14] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-13 11:41:14] [INFO ] Removed a total of 117 redundant transitions.
[2021-05-13 11:41:14] [INFO ] Flatten gal took : 471 ms
[2021-05-13 11:41:15] [INFO ] Fuse similar labels procedure discarded/fused a total of 47 labels/synchronizations in 364 ms.
[2021-05-13 11:41:16] [INFO ] Time to serialize gal into /home/mcc/execution/CTLCardinality.pnml.gal : 31 ms
[2021-05-13 11:41:16] [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 9 CTL formulae.
Detected timeout of ITS tools.
[2021-05-13 12:01:40] [INFO ] Flatten gal took : 41 ms
[2021-05-13 12:01:40] [INFO ] Input system was already deterministic with 521 transitions.
[2021-05-13 12:01:40] [INFO ] Transformed 582 places.
[2021-05-13 12:01:40] [INFO ] Transformed 521 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 12:02:10] [INFO ] Time to serialize gal into /home/mcc/execution/CTLCardinality.pnml.gal : 8 ms
[2021-05-13 12:02:10] [INFO ] Time to serialize properties into /home/mcc/execution/CTLCardinality.ctl : 9 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 9 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-12"
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-12, 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-162038167800103"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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