Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2020-input.r211-tajo-159033477300308.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2020-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 itslola
Input is ShieldIIPt-PT-010B, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r211-tajo-159033477300308
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 336K
-rw-r--r-- 1 mcc users 3.5K May 14 01:01 CTLCardinality.txt
-rw-r--r-- 1 mcc users 20K May 14 01:01 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K May 13 18:18 CTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 13 18:18 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K May 14 10:02 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 14 10:02 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K May 14 10:02 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 14 10:02 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 May 12 20:42 NewModel
-rw-r--r-- 1 mcc users 3.3K May 13 13:28 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 16K May 13 13:28 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.9K May 13 08:03 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 18K May 13 08:03 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 13 16:53 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 13 16:53 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 12 20:42 equiv_col
-rw-r--r-- 1 mcc users 5 May 12 20:42 instance
-rw-r--r-- 1 mcc users 6 May 12 20:42 iscolored
-rw-r--r-- 1 mcc users 167K May 12 20:42 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 ShieldIIPt-PT-010B-CTLFireability-00
FORMULA_NAME ShieldIIPt-PT-010B-CTLFireability-01
FORMULA_NAME ShieldIIPt-PT-010B-CTLFireability-02
FORMULA_NAME ShieldIIPt-PT-010B-CTLFireability-03
FORMULA_NAME ShieldIIPt-PT-010B-CTLFireability-04
FORMULA_NAME ShieldIIPt-PT-010B-CTLFireability-05
FORMULA_NAME ShieldIIPt-PT-010B-CTLFireability-06
FORMULA_NAME ShieldIIPt-PT-010B-CTLFireability-07
FORMULA_NAME ShieldIIPt-PT-010B-CTLFireability-08
FORMULA_NAME ShieldIIPt-PT-010B-CTLFireability-09
FORMULA_NAME ShieldIIPt-PT-010B-CTLFireability-10
FORMULA_NAME ShieldIIPt-PT-010B-CTLFireability-11
FORMULA_NAME ShieldIIPt-PT-010B-CTLFireability-12
FORMULA_NAME ShieldIIPt-PT-010B-CTLFireability-13
FORMULA_NAME ShieldIIPt-PT-010B-CTLFireability-14
FORMULA_NAME ShieldIIPt-PT-010B-CTLFireability-15

=== Now, execution of the tool begins

BK_START 1591298605543

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-04 19:23:27] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -timeout, 3600, -rebuildPNML]
[2020-06-04 19:23:27] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-04 19:23:27] [INFO ] Load time of PNML (sax parser for PT used): 92 ms
[2020-06-04 19:23:27] [INFO ] Transformed 703 places.
[2020-06-04 19:23:27] [INFO ] Transformed 653 transitions.
[2020-06-04 19:23:27] [INFO ] Found NUPN structural information;
[2020-06-04 19:23:27] [INFO ] Parsed PT model containing 703 places and 653 transitions in 137 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 28 ms.
Incomplete random walk after 100000 steps, including 0 resets, run finished after 310 ms. (steps per millisecond=322 ) properties seen :[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1]
// Phase 1: matrix 653 rows 703 cols
[2020-06-04 19:23:27] [INFO ] Computed 91 place invariants in 17 ms
[2020-06-04 19:23:28] [INFO ] [Real]Absence check using 91 positive place invariants in 63 ms returned sat
[2020-06-04 19:23:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 19:23:28] [INFO ] [Real]Absence check using state equation in 934 ms returned sat
[2020-06-04 19:23:29] [INFO ] Deduced a trap composed of 25 places in 249 ms
[2020-06-04 19:23:29] [INFO ] Deduced a trap composed of 17 places in 203 ms
[2020-06-04 19:23:29] [INFO ] Deduced a trap composed of 18 places in 186 ms
[2020-06-04 19:23:29] [INFO ] Deduced a trap composed of 21 places in 182 ms
[2020-06-04 19:23:30] [INFO ] Deduced a trap composed of 28 places in 183 ms
[2020-06-04 19:23:30] [INFO ] Deduced a trap composed of 21 places in 227 ms
[2020-06-04 19:23:30] [INFO ] Deduced a trap composed of 20 places in 176 ms
[2020-06-04 19:23:30] [INFO ] Deduced a trap composed of 31 places in 184 ms
[2020-06-04 19:23:31] [INFO ] Deduced a trap composed of 22 places in 205 ms
[2020-06-04 19:23:31] [INFO ] Deduced a trap composed of 19 places in 173 ms
[2020-06-04 19:23:31] [INFO ] Deduced a trap composed of 15 places in 159 ms
[2020-06-04 19:23:31] [INFO ] Deduced a trap composed of 21 places in 154 ms
[2020-06-04 19:23:31] [INFO ] Deduced a trap composed of 26 places in 133 ms
[2020-06-04 19:23:32] [INFO ] Deduced a trap composed of 24 places in 208 ms
[2020-06-04 19:23:32] [INFO ] Deduced a trap composed of 27 places in 169 ms
[2020-06-04 19:23:32] [INFO ] Deduced a trap composed of 21 places in 215 ms
[2020-06-04 19:23:32] [INFO ] Deduced a trap composed of 19 places in 226 ms
[2020-06-04 19:23:32] [INFO ] Deduced a trap composed of 21 places in 197 ms
[2020-06-04 19:23:33] [INFO ] Deduced a trap composed of 24 places in 193 ms
[2020-06-04 19:23:33] [INFO ] Deduced a trap composed of 20 places in 180 ms
[2020-06-04 19:23:33] [INFO ] Deduced a trap composed of 23 places in 149 ms
[2020-06-04 19:23:33] [INFO ] Deduced a trap composed of 20 places in 160 ms
[2020-06-04 19:23:34] [INFO ] Deduced a trap composed of 34 places in 170 ms
[2020-06-04 19:23:34] [INFO ] Deduced a trap composed of 46 places in 144 ms
[2020-06-04 19:23:34] [INFO ] Deduced a trap composed of 29 places in 226 ms
[2020-06-04 19:23:34] [INFO ] Deduced a trap composed of 23 places in 129 ms
[2020-06-04 19:23:34] [INFO ] Deduced a trap composed of 28 places in 128 ms
[2020-06-04 19:23:34] [INFO ] Deduced a trap composed of 30 places in 106 ms
[2020-06-04 19:23:34] [INFO ] Trap strengthening (SAT) tested/added 29/28 trap constraints in 5920 ms
[2020-06-04 19:23:34] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 19:23:35] [INFO ] [Nat]Absence check using 91 positive place invariants in 67 ms returned sat
[2020-06-04 19:23:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 19:23:36] [INFO ] [Nat]Absence check using state equation in 1042 ms returned sat
[2020-06-04 19:23:36] [INFO ] Deduced a trap composed of 19 places in 202 ms
[2020-06-04 19:23:36] [INFO ] Deduced a trap composed of 31 places in 171 ms
[2020-06-04 19:23:36] [INFO ] Deduced a trap composed of 24 places in 230 ms
[2020-06-04 19:23:37] [INFO ] Deduced a trap composed of 23 places in 212 ms
[2020-06-04 19:23:37] [INFO ] Deduced a trap composed of 24 places in 189 ms
[2020-06-04 19:23:37] [INFO ] Deduced a trap composed of 21 places in 214 ms
[2020-06-04 19:23:37] [INFO ] Deduced a trap composed of 25 places in 204 ms
[2020-06-04 19:23:37] [INFO ] Deduced a trap composed of 20 places in 177 ms
[2020-06-04 19:23:38] [INFO ] Deduced a trap composed of 15 places in 184 ms
[2020-06-04 19:23:38] [INFO ] Deduced a trap composed of 20 places in 158 ms
[2020-06-04 19:23:38] [INFO ] Deduced a trap composed of 19 places in 166 ms
[2020-06-04 19:23:38] [INFO ] Deduced a trap composed of 34 places in 143 ms
[2020-06-04 19:23:38] [INFO ] Deduced a trap composed of 23 places in 122 ms
[2020-06-04 19:23:39] [INFO ] Deduced a trap composed of 22 places in 111 ms
[2020-06-04 19:23:39] [INFO ] Deduced a trap composed of 17 places in 124 ms
[2020-06-04 19:23:39] [INFO ] Deduced a trap composed of 19 places in 100 ms
[2020-06-04 19:23:39] [INFO ] Deduced a trap composed of 23 places in 103 ms
[2020-06-04 19:23:39] [INFO ] Deduced a trap composed of 21 places in 90 ms
[2020-06-04 19:23:39] [INFO ] Deduced a trap composed of 23 places in 94 ms
[2020-06-04 19:23:39] [INFO ] Deduced a trap composed of 28 places in 79 ms
[2020-06-04 19:23:39] [INFO ] Deduced a trap composed of 20 places in 81 ms
[2020-06-04 19:23:39] [INFO ] Trap strengthening (SAT) tested/added 22/21 trap constraints in 3727 ms
[2020-06-04 19:23:39] [INFO ] Computed and/alt/rep : 652/983/652 causal constraints in 32 ms.
[2020-06-04 19:23:44] [INFO ] Added : 635 causal constraints over 127 iterations in 5096 ms. Result :sat
[2020-06-04 19:23:45] [INFO ] [Real]Absence check using 91 positive place invariants in 113 ms returned sat
[2020-06-04 19:23:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 19:23:46] [INFO ] [Real]Absence check using state equation in 918 ms returned sat
[2020-06-04 19:23:46] [INFO ] Deduced a trap composed of 21 places in 256 ms
[2020-06-04 19:23:46] [INFO ] Deduced a trap composed of 22 places in 212 ms
[2020-06-04 19:23:46] [INFO ] Deduced a trap composed of 19 places in 234 ms
[2020-06-04 19:23:47] [INFO ] Deduced a trap composed of 25 places in 224 ms
[2020-06-04 19:23:47] [INFO ] Deduced a trap composed of 21 places in 223 ms
[2020-06-04 19:23:47] [INFO ] Deduced a trap composed of 22 places in 159 ms
[2020-06-04 19:23:47] [INFO ] Deduced a trap composed of 31 places in 145 ms
[2020-06-04 19:23:48] [INFO ] Deduced a trap composed of 29 places in 141 ms
[2020-06-04 19:23:48] [INFO ] Deduced a trap composed of 17 places in 168 ms
[2020-06-04 19:23:48] [INFO ] Deduced a trap composed of 27 places in 203 ms
[2020-06-04 19:23:48] [INFO ] Deduced a trap composed of 37 places in 187 ms
[2020-06-04 19:23:48] [INFO ] Deduced a trap composed of 32 places in 189 ms
[2020-06-04 19:23:49] [INFO ] Deduced a trap composed of 24 places in 149 ms
[2020-06-04 19:23:49] [INFO ] Deduced a trap composed of 20 places in 173 ms
[2020-06-04 19:23:49] [INFO ] Deduced a trap composed of 15 places in 160 ms
[2020-06-04 19:23:49] [INFO ] Deduced a trap composed of 18 places in 144 ms
[2020-06-04 19:23:49] [INFO ] Deduced a trap composed of 19 places in 161 ms
[2020-06-04 19:23:49] [INFO ] Deduced a trap composed of 27 places in 121 ms
[2020-06-04 19:23:50] [INFO ] Deduced a trap composed of 25 places in 113 ms
[2020-06-04 19:23:50] [INFO ] Deduced a trap composed of 37 places in 84 ms
[2020-06-04 19:23:50] [INFO ] Deduced a trap composed of 26 places in 123 ms
[2020-06-04 19:23:50] [INFO ] Trap strengthening (SAT) tested/added 22/21 trap constraints in 4203 ms
[2020-06-04 19:23:50] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 19:23:50] [INFO ] [Nat]Absence check using 91 positive place invariants in 90 ms returned sat
[2020-06-04 19:23:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 19:23:51] [INFO ] [Nat]Absence check using state equation in 1063 ms returned sat
[2020-06-04 19:23:51] [INFO ] Deduced a trap composed of 26 places in 258 ms
[2020-06-04 19:23:52] [INFO ] Deduced a trap composed of 22 places in 200 ms
[2020-06-04 19:23:52] [INFO ] Deduced a trap composed of 19 places in 169 ms
[2020-06-04 19:23:52] [INFO ] Deduced a trap composed of 17 places in 156 ms
[2020-06-04 19:23:52] [INFO ] Deduced a trap composed of 19 places in 148 ms
[2020-06-04 19:23:52] [INFO ] Deduced a trap composed of 22 places in 237 ms
[2020-06-04 19:23:53] [INFO ] Deduced a trap composed of 23 places in 209 ms
[2020-06-04 19:23:53] [INFO ] Deduced a trap composed of 23 places in 205 ms
[2020-06-04 19:23:53] [INFO ] Deduced a trap composed of 23 places in 203 ms
[2020-06-04 19:23:53] [INFO ] Deduced a trap composed of 15 places in 203 ms
[2020-06-04 19:23:54] [INFO ] Deduced a trap composed of 30 places in 168 ms
[2020-06-04 19:23:54] [INFO ] Deduced a trap composed of 25 places in 199 ms
[2020-06-04 19:23:54] [INFO ] Deduced a trap composed of 19 places in 170 ms
[2020-06-04 19:23:54] [INFO ] Deduced a trap composed of 32 places in 143 ms
[2020-06-04 19:23:54] [INFO ] Deduced a trap composed of 24 places in 154 ms
[2020-06-04 19:23:55] [INFO ] Deduced a trap composed of 21 places in 172 ms
[2020-06-04 19:23:55] [INFO ] Deduced a trap composed of 30 places in 145 ms
[2020-06-04 19:23:55] [INFO ] Deduced a trap composed of 24 places in 189 ms
[2020-06-04 19:23:55] [INFO ] Deduced a trap composed of 21 places in 181 ms
[2020-06-04 19:23:55] [INFO ] Deduced a trap composed of 24 places in 141 ms
[2020-06-04 19:23:56] [INFO ] Deduced a trap composed of 18 places in 213 ms
[2020-06-04 19:23:56] [INFO ] Deduced a trap composed of 23 places in 124 ms
[2020-06-04 19:23:56] [INFO ] Deduced a trap composed of 26 places in 149 ms
[2020-06-04 19:23:56] [INFO ] Deduced a trap composed of 28 places in 148 ms
[2020-06-04 19:23:56] [INFO ] Deduced a trap composed of 34 places in 129 ms
[2020-06-04 19:23:56] [INFO ] Trap strengthening (SAT) tested/added 26/25 trap constraints in 5052 ms
[2020-06-04 19:23:56] [INFO ] Computed and/alt/rep : 652/983/652 causal constraints in 47 ms.
[2020-06-04 19:24:03] [INFO ] Added : 644 causal constraints over 129 iterations in 7188 ms. Result :sat
[2020-06-04 19:24:04] [INFO ] [Real]Absence check using 91 positive place invariants in 70 ms returned sat
[2020-06-04 19:24:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 19:24:05] [INFO ] [Real]Absence check using state equation in 1012 ms returned sat
[2020-06-04 19:24:05] [INFO ] Deduced a trap composed of 31 places in 281 ms
[2020-06-04 19:24:05] [INFO ] Deduced a trap composed of 29 places in 238 ms
[2020-06-04 19:24:06] [INFO ] Deduced a trap composed of 25 places in 250 ms
[2020-06-04 19:24:06] [INFO ] Deduced a trap composed of 19 places in 253 ms
[2020-06-04 19:24:06] [INFO ] Deduced a trap composed of 17 places in 208 ms
[2020-06-04 19:24:06] [INFO ] Deduced a trap composed of 18 places in 175 ms
[2020-06-04 19:24:07] [INFO ] Deduced a trap composed of 15 places in 167 ms
[2020-06-04 19:24:07] [INFO ] Deduced a trap composed of 35 places in 166 ms
[2020-06-04 19:24:07] [INFO ] Deduced a trap composed of 19 places in 154 ms
[2020-06-04 19:24:07] [INFO ] Deduced a trap composed of 23 places in 123 ms
[2020-06-04 19:24:07] [INFO ] Deduced a trap composed of 17 places in 118 ms
[2020-06-04 19:24:07] [INFO ] Deduced a trap composed of 23 places in 143 ms
[2020-06-04 19:24:07] [INFO ] Deduced a trap composed of 36 places in 133 ms
[2020-06-04 19:24:08] [INFO ] Deduced a trap composed of 24 places in 129 ms
[2020-06-04 19:24:08] [INFO ] Deduced a trap composed of 20 places in 112 ms
[2020-06-04 19:24:08] [INFO ] Deduced a trap composed of 20 places in 106 ms
[2020-06-04 19:24:08] [INFO ] Deduced a trap composed of 25 places in 112 ms
[2020-06-04 19:24:08] [INFO ] Deduced a trap composed of 29 places in 111 ms
[2020-06-04 19:24:08] [INFO ] Deduced a trap composed of 21 places in 93 ms
[2020-06-04 19:24:08] [INFO ] Deduced a trap composed of 22 places in 89 ms
[2020-06-04 19:24:08] [INFO ] Deduced a trap composed of 26 places in 74 ms
[2020-06-04 19:24:09] [INFO ] Deduced a trap composed of 33 places in 65 ms
[2020-06-04 19:24:09] [INFO ] Deduced a trap composed of 26 places in 79 ms
[2020-06-04 19:24:09] [INFO ] Deduced a trap composed of 20 places in 63 ms
[2020-06-04 19:24:09] [INFO ] Deduced a trap composed of 29 places in 58 ms
[2020-06-04 19:24:09] [INFO ] Deduced a trap composed of 37 places in 66 ms
[2020-06-04 19:24:09] [INFO ] Trap strengthening (SAT) tested/added 27/26 trap constraints in 4211 ms
[2020-06-04 19:24:09] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 19:24:09] [INFO ] [Nat]Absence check using 91 positive place invariants in 57 ms returned sat
[2020-06-04 19:24:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 19:24:10] [INFO ] [Nat]Absence check using state equation in 799 ms returned sat
[2020-06-04 19:24:10] [INFO ] Deduced a trap composed of 23 places in 199 ms
[2020-06-04 19:24:10] [INFO ] Deduced a trap composed of 21 places in 160 ms
[2020-06-04 19:24:10] [INFO ] Deduced a trap composed of 19 places in 164 ms
[2020-06-04 19:24:11] [INFO ] Deduced a trap composed of 15 places in 189 ms
[2020-06-04 19:24:11] [INFO ] Deduced a trap composed of 20 places in 141 ms
[2020-06-04 19:24:11] [INFO ] Deduced a trap composed of 31 places in 132 ms
[2020-06-04 19:24:11] [INFO ] Deduced a trap composed of 33 places in 127 ms
[2020-06-04 19:24:11] [INFO ] Deduced a trap composed of 23 places in 122 ms
[2020-06-04 19:24:11] [INFO ] Deduced a trap composed of 36 places in 146 ms
[2020-06-04 19:24:12] [INFO ] Deduced a trap composed of 25 places in 109 ms
[2020-06-04 19:24:12] [INFO ] Deduced a trap composed of 20 places in 102 ms
[2020-06-04 19:24:12] [INFO ] Deduced a trap composed of 35 places in 107 ms
[2020-06-04 19:24:12] [INFO ] Deduced a trap composed of 20 places in 107 ms
[2020-06-04 19:24:12] [INFO ] Deduced a trap composed of 22 places in 105 ms
[2020-06-04 19:24:12] [INFO ] Deduced a trap composed of 26 places in 96 ms
[2020-06-04 19:24:12] [INFO ] Deduced a trap composed of 21 places in 94 ms
[2020-06-04 19:24:12] [INFO ] Deduced a trap composed of 17 places in 89 ms
[2020-06-04 19:24:13] [INFO ] Deduced a trap composed of 18 places in 103 ms
[2020-06-04 19:24:13] [INFO ] Deduced a trap composed of 25 places in 99 ms
[2020-06-04 19:24:13] [INFO ] Deduced a trap composed of 23 places in 93 ms
[2020-06-04 19:24:13] [INFO ] Deduced a trap composed of 40 places in 78 ms
[2020-06-04 19:24:13] [INFO ] Deduced a trap composed of 34 places in 100 ms
[2020-06-04 19:24:13] [INFO ] Deduced a trap composed of 45 places in 73 ms
[2020-06-04 19:24:13] [INFO ] Deduced a trap composed of 33 places in 86 ms
[2020-06-04 19:24:13] [INFO ] Deduced a trap composed of 26 places in 83 ms
[2020-06-04 19:24:13] [INFO ] Trap strengthening (SAT) tested/added 26/25 trap constraints in 3442 ms
[2020-06-04 19:24:13] [INFO ] Computed and/alt/rep : 652/983/652 causal constraints in 32 ms.
[2020-06-04 19:24:19] [INFO ] Added : 644 causal constraints over 129 iterations in 5654 ms. Result :sat
[2020-06-04 19:24:19] [INFO ] Flatten gal took : 118 ms
[2020-06-04 19:24:19] [INFO ] Flatten gal took : 31 ms
[2020-06-04 19:24:19] [INFO ] Export to MCC properties in file /home/mcc/execution/CTLFireability.sr.xml took 4 ms.
[2020-06-04 19:24:19] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 8 ms.
info: Time: 3600 - MCC
vrfy: Checking CTLFireability @ ShieldIIPt-PT-010B @ 3570 seconds

FORMULA ShieldIIPt-PT-010B-CTLFireability-08 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldIIPt-PT-010B-CTLFireability-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldIIPt-PT-010B-CTLFireability-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldIIPt-PT-010B-CTLFireability-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldIIPt-PT-010B-CTLFireability-02 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldIIPt-PT-010B-CTLFireability-04 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldIIPt-PT-010B-CTLFireability-01 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldIIPt-PT-010B-CTLFireability-05 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldIIPt-PT-010B-CTLFireability-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldIIPt-PT-010B-CTLFireability-03 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldIIPt-PT-010B-CTLFireability-09 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldIIPt-PT-010B-CTLFireability-00 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldIIPt-PT-010B-CTLFireability-07 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16427456 kB
MemFree: 4774548 kB
After kill :
MemTotal: 16427456 kB
MemFree: 4795472 kB

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

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="ShieldIIPt-PT-010B"
export BK_EXAMINATION="CTLFireability"
export BK_TOOL="itslola"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"

# 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 itslola"
echo " Input is ShieldIIPt-PT-010B, examination is CTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r211-tajo-159033477300308"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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