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.r210-tajo-159033476601049.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 itstools
Input is ShieldRVt-PT-040A, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r210-tajo-159033476601049
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 280K
-rw-r--r-- 1 mcc users 4.0K May 14 02:50 CTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 14 02:50 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K May 13 20:28 CTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 13 20:28 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.2K May 14 10:05 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K May 14 10:05 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K May 14 10:05 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K May 14 10:05 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 May 12 20:42 NewModel
-rw-r--r-- 1 mcc users 3.4K May 13 14:49 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 18K May 13 14:49 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.4K May 13 09:46 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 13K May 13 09:46 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 109K 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 ShieldRVt-PT-040A-00
FORMULA_NAME ShieldRVt-PT-040A-01
FORMULA_NAME ShieldRVt-PT-040A-02
FORMULA_NAME ShieldRVt-PT-040A-03
FORMULA_NAME ShieldRVt-PT-040A-04
FORMULA_NAME ShieldRVt-PT-040A-05
FORMULA_NAME ShieldRVt-PT-040A-06
FORMULA_NAME ShieldRVt-PT-040A-07
FORMULA_NAME ShieldRVt-PT-040A-08
FORMULA_NAME ShieldRVt-PT-040A-09
FORMULA_NAME ShieldRVt-PT-040A-10
FORMULA_NAME ShieldRVt-PT-040A-11
FORMULA_NAME ShieldRVt-PT-040A-12
FORMULA_NAME ShieldRVt-PT-040A-13
FORMULA_NAME ShieldRVt-PT-040A-14
FORMULA_NAME ShieldRVt-PT-040A-15

=== Now, execution of the tool begins

BK_START 1590633612081

[2020-05-28 02:40:14] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -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]
[2020-05-28 02:40:14] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-05-28 02:40:15] [INFO ] Load time of PNML (sax parser for PT used): 110 ms
[2020-05-28 02:40:15] [INFO ] Transformed 323 places.
[2020-05-28 02:40:15] [INFO ] Transformed 323 transitions.
[2020-05-28 02:40:15] [INFO ] Found NUPN structural information;
[2020-05-28 02:40:15] [INFO ] Parsed PT model containing 323 places and 323 transitions in 268 ms.
Ensure Unique test removed 1 transitions
Reduce redundant transitions removed 1 transitions.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 41 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100000 steps, including 0 resets, run finished after 515 ms. (steps per millisecond=194 ) properties seen :[0, 0, 0, 0, 0, 0, 1, 1, 0, 1, 1, 0, 1, 1, 1, 0, 1, 0, 1, 0, 0, 1, 1, 1]
// Phase 1: matrix 322 rows 323 cols
[2020-05-28 02:40:15] [INFO ] Computed 161 place invariants in 9 ms
[2020-05-28 02:40:16] [INFO ] [Real]Absence check using 161 positive place invariants in 76 ms returned sat
[2020-05-28 02:40:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-28 02:40:16] [INFO ] [Real]Absence check using state equation in 262 ms returned sat
[2020-05-28 02:40:16] [INFO ] Computed and/alt/rep : 321/1399/321 causal constraints in 62 ms.
[2020-05-28 02:40:16] [INFO ] Solution in real domain found non-integer solution.
[2020-05-28 02:40:16] [INFO ] [Nat]Absence check using 161 positive place invariants in 80 ms returned sat
[2020-05-28 02:40:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-28 02:40:17] [INFO ] [Nat]Absence check using state equation in 288 ms returned sat
[2020-05-28 02:40:17] [INFO ] Computed and/alt/rep : 321/1399/321 causal constraints in 21 ms.
[2020-05-28 02:40:19] [INFO ] Added : 317 causal constraints over 64 iterations in 2427 ms. Result :sat
[2020-05-28 02:40:20] [INFO ] [Real]Absence check using 161 positive place invariants in 413 ms returned sat
[2020-05-28 02:40:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-28 02:40:20] [INFO ] [Real]Absence check using state equation in 453 ms returned sat
[2020-05-28 02:40:20] [INFO ] Computed and/alt/rep : 321/1399/321 causal constraints in 24 ms.
[2020-05-28 02:40:20] [INFO ] Solution in real domain found non-integer solution.
[2020-05-28 02:40:20] [INFO ] [Nat]Absence check using 161 positive place invariants in 56 ms returned sat
[2020-05-28 02:40:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-28 02:40:21] [INFO ] [Nat]Absence check using state equation in 304 ms returned sat
[2020-05-28 02:40:21] [INFO ] Computed and/alt/rep : 321/1399/321 causal constraints in 25 ms.
[2020-05-28 02:40:22] [INFO ] Added : 317 causal constraints over 64 iterations in 1689 ms. Result :sat
[2020-05-28 02:40:22] [INFO ] [Real]Absence check using 161 positive place invariants in 51 ms returned sat
[2020-05-28 02:40:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-28 02:40:23] [INFO ] [Real]Absence check using state equation in 447 ms returned sat
[2020-05-28 02:40:23] [INFO ] Solution in real domain found non-integer solution.
[2020-05-28 02:40:23] [INFO ] [Nat]Absence check using 161 positive place invariants in 63 ms returned sat
[2020-05-28 02:40:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-28 02:40:24] [INFO ] [Nat]Absence check using state equation in 447 ms returned sat
[2020-05-28 02:40:24] [INFO ] Computed and/alt/rep : 321/1399/321 causal constraints in 33 ms.
[2020-05-28 02:40:26] [INFO ] Added : 314 causal constraints over 63 iterations in 2230 ms. Result :sat
[2020-05-28 02:40:26] [INFO ] [Real]Absence check using 161 positive place invariants in 68 ms returned sat
[2020-05-28 02:40:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-28 02:40:26] [INFO ] [Real]Absence check using state equation in 326 ms returned sat
[2020-05-28 02:40:26] [INFO ] Solution in real domain found non-integer solution.
[2020-05-28 02:40:26] [INFO ] [Nat]Absence check using 161 positive place invariants in 34 ms returned unsat
[2020-05-28 02:40:27] [INFO ] [Real]Absence check using 161 positive place invariants in 44 ms returned sat
[2020-05-28 02:40:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-28 02:40:27] [INFO ] [Real]Absence check using state equation in 225 ms returned sat
[2020-05-28 02:40:27] [INFO ] Solution in real domain found non-integer solution.
[2020-05-28 02:40:27] [INFO ] [Nat]Absence check using 161 positive place invariants in 41 ms returned sat
[2020-05-28 02:40:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-28 02:40:27] [INFO ] [Nat]Absence check using state equation in 293 ms returned sat
[2020-05-28 02:40:27] [INFO ] Computed and/alt/rep : 321/1399/321 causal constraints in 17 ms.
[2020-05-28 02:40:29] [INFO ] Added : 317 causal constraints over 64 iterations in 1916 ms. Result :sat
[2020-05-28 02:40:29] [INFO ] [Real]Absence check using 161 positive place invariants in 76 ms returned sat
[2020-05-28 02:40:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-28 02:40:30] [INFO ] [Real]Absence check using state equation in 322 ms returned sat
[2020-05-28 02:40:30] [INFO ] Computed and/alt/rep : 321/1399/321 causal constraints in 39 ms.
[2020-05-28 02:40:30] [INFO ] Solution in real domain found non-integer solution.
[2020-05-28 02:40:30] [INFO ] [Nat]Absence check using 161 positive place invariants in 70 ms returned sat
[2020-05-28 02:40:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-28 02:40:30] [INFO ] [Nat]Absence check using state equation in 313 ms returned sat
[2020-05-28 02:40:30] [INFO ] Computed and/alt/rep : 321/1399/321 causal constraints in 17 ms.
[2020-05-28 02:40:32] [INFO ] Added : 317 causal constraints over 64 iterations in 1809 ms. Result :sat
[2020-05-28 02:40:32] [INFO ] [Real]Absence check using 161 positive place invariants in 66 ms returned sat
[2020-05-28 02:40:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-28 02:40:32] [INFO ] [Real]Absence check using state equation in 339 ms returned sat
[2020-05-28 02:40:32] [INFO ] Computed and/alt/rep : 321/1399/321 causal constraints in 29 ms.
[2020-05-28 02:40:33] [INFO ] Solution in real domain found non-integer solution.
[2020-05-28 02:40:33] [INFO ] [Nat]Absence check using 161 positive place invariants in 64 ms returned sat
[2020-05-28 02:40:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-28 02:40:33] [INFO ] [Nat]Absence check using state equation in 325 ms returned sat
[2020-05-28 02:40:33] [INFO ] Computed and/alt/rep : 321/1399/321 causal constraints in 24 ms.
[2020-05-28 02:40:35] [INFO ] Added : 317 causal constraints over 64 iterations in 1830 ms. Result :sat
[2020-05-28 02:40:35] [INFO ] [Real]Absence check using 161 positive place invariants in 83 ms returned sat
[2020-05-28 02:40:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-28 02:40:35] [INFO ] [Real]Absence check using state equation in 349 ms returned sat
[2020-05-28 02:40:35] [INFO ] Solution in real domain found non-integer solution.
[2020-05-28 02:40:36] [INFO ] [Nat]Absence check using 161 positive place invariants in 67 ms returned sat
[2020-05-28 02:40:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-28 02:40:36] [INFO ] [Nat]Absence check using state equation in 325 ms returned sat
[2020-05-28 02:40:36] [INFO ] Computed and/alt/rep : 321/1399/321 causal constraints in 21 ms.
[2020-05-28 02:40:38] [INFO ] Added : 317 causal constraints over 64 iterations in 1679 ms. Result :sat
[2020-05-28 02:40:38] [INFO ] [Real]Absence check using 161 positive place invariants in 68 ms returned sat
[2020-05-28 02:40:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-28 02:40:38] [INFO ] [Real]Absence check using state equation in 238 ms returned sat
[2020-05-28 02:40:38] [INFO ] Solution in real domain found non-integer solution.
[2020-05-28 02:40:38] [INFO ] [Nat]Absence check using 161 positive place invariants in 9 ms returned unsat
[2020-05-28 02:40:38] [INFO ] [Real]Absence check using 161 positive place invariants in 70 ms returned sat
[2020-05-28 02:40:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-28 02:40:38] [INFO ] [Real]Absence check using state equation in 228 ms returned sat
[2020-05-28 02:40:38] [INFO ] Solution in real domain found non-integer solution.
[2020-05-28 02:40:39] [INFO ] [Nat]Absence check using 161 positive place invariants in 74 ms returned sat
[2020-05-28 02:40:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-28 02:40:39] [INFO ] [Nat]Absence check using state equation in 453 ms returned sat
[2020-05-28 02:40:39] [INFO ] Computed and/alt/rep : 321/1399/321 causal constraints in 23 ms.
[2020-05-28 02:40:41] [INFO ] Added : 318 causal constraints over 64 iterations in 2401 ms. Result :sat
[2020-05-28 02:40:42] [INFO ] [Real]Absence check using 161 positive place invariants in 59 ms returned sat
[2020-05-28 02:40:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-28 02:40:42] [INFO ] [Real]Absence check using state equation in 263 ms returned sat
[2020-05-28 02:40:42] [INFO ] Computed and/alt/rep : 321/1399/321 causal constraints in 20 ms.
[2020-05-28 02:40:42] [INFO ] Solution in real domain found non-integer solution.
[2020-05-28 02:40:42] [INFO ] [Nat]Absence check using 161 positive place invariants in 58 ms returned sat
[2020-05-28 02:40:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-28 02:40:42] [INFO ] [Nat]Absence check using state equation in 285 ms returned sat
[2020-05-28 02:40:42] [INFO ] Computed and/alt/rep : 321/1399/321 causal constraints in 23 ms.
[2020-05-28 02:40:44] [INFO ] Added : 316 causal constraints over 64 iterations in 1754 ms. Result :sat
[2020-05-28 02:40:44] [INFO ] [Real]Absence check using 161 positive place invariants in 69 ms returned sat
[2020-05-28 02:40:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-28 02:40:45] [INFO ] [Real]Absence check using state equation in 286 ms returned sat
[2020-05-28 02:40:45] [INFO ] Solution in real domain found non-integer solution.
[2020-05-28 02:40:45] [INFO ] [Nat]Absence check using 161 positive place invariants in 45 ms returned sat
[2020-05-28 02:40:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-28 02:40:45] [INFO ] [Nat]Absence check using state equation in 233 ms returned sat
[2020-05-28 02:40:45] [INFO ] Computed and/alt/rep : 321/1399/321 causal constraints in 20 ms.
[2020-05-28 02:40:47] [INFO ] Added : 318 causal constraints over 64 iterations in 1837 ms. Result :sat
Successfully simplified 2 atomic propositions for a total of 2 simplifications.
[2020-05-28 02:40:47] [INFO ] Initial state reduction rules for CTL removed 6 formulas.
[2020-05-28 02:40:47] [INFO ] Flatten gal took : 155 ms
FORMULA ShieldRVt-PT-040A-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVt-PT-040A-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVt-PT-040A-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVt-PT-040A-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVt-PT-040A-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVt-PT-040A-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-05-28 02:40:47] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2020-05-28 02:40:47] [INFO ] Flatten gal took : 40 ms
[2020-05-28 02:40:47] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA ShieldRVt-PT-040A-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Using solver Z3 to compute partial order matrices.
Built C files in :
/home/mcc/execution
[2020-05-28 02:40:47] [INFO ] Applying decomposition
[2020-05-28 02:40:47] [INFO ] Flatten gal took : 76 ms
[2020-05-28 02:40:47] [INFO ] Input system was already deterministic with 322 transitions.
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
// Phase 1: matrix 322 rows 323 cols
[2020-05-28 02:40:48] [INFO ] Computed 161 place invariants in 6 ms
inv : p0 + p35 + p36 = 1
inv : p0 + p25 + p26 = 1
inv : p0 + p321 + p322 = 1
inv : p0 + p45 + p46 = 1
inv : p0 + p5 + p6 = 1
inv : p0 + p311 + p312 = 1
inv : p0 + p291 + p292 = 1
inv : p0 + p95 + p96 = 1
inv : p0 + p85 + p86 = 1
inv : p0 + p55 + p56 = 1
inv : p0 + p261 + p262 = 1
inv : p0 + p15 + p16 = 1
inv : p0 + p301 + p302 = 1
inv : p0 + p135 + p136 = 1
inv : p0 + p155 + p156 = 1
inv : p0 + p251 + p252 = 1
inv : p0 + p231 + p232 = 1
inv : p0 + p65 + p66 = 1
inv : p0 + p75 + p76 = 1
inv : p0 + p145 + p146 = 1
inv : p0 + p161 + p162 = 1
inv : p0 + p241 + p242 = 1
inv : p0 + p215 + p216 = 1
inv : p0 + p151 + p152 = 1
inv : p0 + p131 + p132 = 1
inv : p0 + p195 + p196 = 1
inv : p0 + p175 + p176 = 1
inv : p0 + p181 + p182 = 1
inv : p0 + p111 + p112 = 1
inv : p0 + p285 + p286 = 1
inv : p0 + p245 + p246 = 1
inv : p0 + p221 + p222 = 1
inv : p0 + p125 + p126 = 1
inv : p0 + p9 + p10 = 1
inv : p0 + p61 + p62 = 1
inv : p0 + p41 + p42 = 1
inv : p0 + p105 + p106 = 1
inv : p0 + p29 + p30 = 1
inv : p0 + p271 + p272 = 1
inv : p0 + p265 + p266 = 1
inv : p0 + p297 + p298 = 1
inv : p0 + p201 + p202 = 1
inv : p0 + p119 + p120 = 1
inv : p0 + p89 + p90 = 1
inv : p0 + p287 + p288 = 1
inv : p0 + p247 + p248 = 1
inv : p0 + p159 + p160 = 1
inv : p0 + p31 + p32 = 1
inv : p0 + p317 + p318 = 1
inv : p0 + p189 + p190 = 1
inv : p0 + p199 + p200 = 1
inv : p0 + p315 + p316 = 1
inv : p0 + p305 + p306 = 1
inv : p0 + p71 + p72 = 1
inv : p0 + p187 + p188 = 1
inv : p0 + p59 + p60 = 1
inv : p0 + p1 + p2 = 1
inv : p0 + p49 + p50 = 1
inv : p0 + p107 + p108 = 1
inv : p0 + p129 + p130 = 1
inv : p0 + p177 + p178 = 1
inv : p0 + p257 + p258 = 1
inv : p0 + p141 + p142 = 1
inv : p0 + p299 + p300 = 1
inv : p0 + p77 + p78 = 1
inv : p0 + p171 + p172 = 1
inv : p0 + p13 + p14 = 1
inv : p0 + p235 + p236 = 1
inv : p0 + p165 + p166 = 1
inv : p0 + p37 + p38 = 1
inv : p0 + p101 + p102 = 1
inv : p0 + p293 + p294 = 1
inv : p0 + p269 + p270 = 1
inv : p0 + p7 + p8 = 1
inv : p0 + p205 + p206 = 1
inv : p0 + p229 + p230 = 1
inv : p0 + p19 + p20 = 1
inv : p0 + p83 + p84 = 1
inv : p0 + p211 + p212 = 1
inv : p0 + p147 + p148 = 1
inv : p0 + p275 + p276 = 1
inv : p0 + p281 + p282 = 1
inv : p0 + p153 + p154 = 1
inv : p0 + p217 + p218 = 1
inv : p0 + p183 + p184 = 1
inv : p0 + p173 + p174 = 1
inv : p0 + p203 + p204 = 1
inv : p0 + p163 + p164 = 1
inv : p0 + p223 + p224 = 1
inv : p0 + p133 + p134 = 1
inv : p0 + p143 + p144 = 1
inv : p0 + p213 + p214 = 1
inv : p0 + p253 + p254 = 1
inv : p0 + p273 + p274 = 1
inv : p0 + p103 + p104 = 1
inv : p0 + p283 + p284 = 1
inv : p0 + p263 + p264 = 1
inv : p0 + p43 + p44 = 1
inv : p0 + p27 + p28 = 1
inv : p0 + p17 + p18 = 1
inv : p0 + p123 + p124 = 1
inv : p0 + p33 + p34 = 1
inv : p0 + p113 + p114 = 1
inv : p0 + p193 + p194 = 1
inv : p0 + p67 + p68 = 1
inv : p0 + p289 + p290 = 1
inv : p0 + p3 + p4 = 1
inv : p0 + p87 + p88 = 1
inv : p0 + p279 + p280 = 1
inv : p0 + p259 + p260 = 1
inv : p0 + p117 + p118 = 1
inv : p0 + p53 + p54 = 1
inv : p0 + p47 + p48 = 1
inv : p0 + p23 + p24 = 1
inv : p0 + p309 + p310 = 1
inv : p0 + p157 + p158 = 1
inv : p0 + p93 + p94 = 1
inv : p0 + p73 + p74 = 1
inv : p0 + p303 + p304 = 1
inv : p0 + p239 + p240 = 1
inv : p0 + p137 + p138 = 1
inv : p0 + p169 + p170 = 1
inv : p0 + p233 + p234 = 1
inv : p0 + p109 + p110 = 1
inv : p0 + p99 + p100 = 1
inv : p0 + p267 + p268 = 1
inv : p0 + p227 + p228 = 1
inv : p0 + p207 + p208 = 1
inv : p0 + p307 + p308 = 1
inv : p0 + p149 + p150 = 1
inv : p0 + p69 + p70 = 1
inv : p0 + p79 + p80 = 1
inv : p0 + p277 + p278 = 1
inv : p0 + p39 + p40 = 1
inv : p0 + p197 + p198 = 1
inv : p0 + p237 + p238 = 1
inv : p0 + p167 + p168 = 1
inv : p0 + p219 + p220 = 1
inv : p0 + p21 + p22 = 1
inv : p0 + p295 + p296 = 1
inv : p0 + p11 + p12 = 1
inv : p0 + p139 + p140 = 1
inv : p0 + p91 + p92 = 1
inv : p0 + p97 + p98 = 1
inv : p0 + p81 + p82 = 1
inv : p0 + p209 + p210 = 1
inv : p0 + p225 + p226 = 1
inv : p0 + p57 + p58 = 1
inv : p0 + p319 + p320 = 1
inv : p0 + p255 + p256 = 1
inv : p0 + p191 + p192 = 1
inv : p0 + p127 + p128 = 1
inv : p0 + p63 + p64 = 1
inv : p0 + p51 + p52 = 1
inv : p0 + p115 + p116 = 1
inv : p0 + p179 + p180 = 1
inv : p0 + p243 + p244 = 1
inv : p0 + p313 + p314 = 1
inv : p0 + p121 + p122 = 1
inv : p0 + p185 + p186 = 1
inv : p0 + p249 + p250 = 1
Total of 161 invariants.
[2020-05-28 02:40:48] [INFO ] Computed 161 place invariants in 20 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/graph9042379168212430603.txt, -o, /tmp/graph9042379168212430603.bin, -w, /tmp/graph9042379168212430603.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/graph9042379168212430603.bin, -l, -1, -v, -w, /tmp/graph9042379168212430603.weights, -q, 0, -e, 0.001], workingDir=null]
[2020-05-28 02:40:48] [INFO ] Decomposing Gal with order
[2020-05-28 02:40:48] [INFO ] Rewriting arrays to variables to allow decomposition.
[2020-05-28 02:40:49] [INFO ] Removed a total of 120 redundant transitions.
[2020-05-28 02:40:49] [INFO ] Flatten gal took : 212 ms
[2020-05-28 02:40:49] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 19 ms.
[2020-05-28 02:40:49] [INFO ] Time to serialize gal into /home/mcc/execution/LTLCardinality.pnml.gal : 11 ms
[2020-05-28 02:40:49] [INFO ] Time to serialize properties into /home/mcc/execution/LTLCardinality.ltl : 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-ltl-linux64, --gc-threshold, 2000000, -i, /home/mcc/execution/LTLCardinality.pnml.gal, -t, CGAL, -LTL, /home/mcc/execution/LTLCardinality.ltl, -c, -stutter-deadlock], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202005100927/bin/its-ltl-linux64 --gc-threshold 2000000 -i /home/mcc/execution/LTLCardinality.pnml.gal -t CGAL -LTL /home/mcc/execution/LTLCardinality.ltl -c -stutter-deadlock
Read 9 LTL properties
Checking formula 0 : !((X(!(G("((i7.i1.u65.p132!=0)&&(i7.i0.u62.p126!=1))")))))
Formula 0 simplified : !X!G"((i7.i1.u65.p132!=0)&&(i7.i0.u62.p126!=1))"
built 18 ordering constraints for composite.
built 13 ordering constraints for composite.
built 12 ordering constraints for composite.
built 11 ordering constraints for composite.
built 20 ordering constraints for composite.
built 11 ordering constraints for composite.
built 11 ordering constraints for composite.
built 11 ordering constraints for composite.
built 15 ordering constraints for composite.
built 11 ordering constraints for composite.
built 11 ordering constraints for composite.
built 15 ordering constraints for composite.
built 11 ordering constraints for composite.
built 11 ordering constraints for composite.
built 15 ordering constraints for composite.
built 11 ordering constraints for composite.
built 11 ordering constraints for composite.
built 15 ordering constraints for composite.
built 11 ordering constraints for composite.
built 11 ordering constraints for composite.
built 15 ordering constraints for composite.
built 11 ordering constraints for composite.
built 11 ordering constraints for composite.
built 20 ordering constraints for composite.
built 11 ordering constraints for composite.
built 11 ordering constraints for composite.
built 11 ordering constraints for composite.
built 15 ordering constraints for composite.
built 11 ordering constraints for composite.
built 11 ordering constraints for composite.
built 15 ordering constraints for composite.
built 11 ordering constraints for composite.
built 11 ordering constraints for composite.
built 20 ordering constraints for composite.
built 11 ordering constraints for composite.
built 11 ordering constraints for composite.
built 11 ordering constraints for composite.
built 15 ordering constraints for composite.
built 11 ordering constraints for composite.
built 11 ordering constraints for composite.
built 15 ordering constraints for composite.
built 11 ordering constraints for composite.
built 11 ordering constraints for composite.
built 15 ordering constraints for composite.
built 11 ordering constraints for composite.
built 11 ordering constraints for composite.
built 15 ordering constraints for composite.
built 11 ordering constraints for composite.
built 11 ordering constraints for composite.
built 20 ordering constraints for composite.
built 11 ordering constraints for composite.
built 11 ordering constraints for composite.
built 11 ordering constraints for composite.
built 15 ordering constraints for composite.
built 11 ordering constraints for composite.
built 11 ordering constraints for composite.
built 12 ordering constraints for composite.
built 11 ordering constraints for composite.
built 10 ordering constraints for composite.
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
2 unique states visited
0 strongly connected components in search stack
1 transitions explored
2 items max in DFS search stack
5 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.139644,20324,1,0,2240,84,861,3502,63,133,1333
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA ShieldRVt-PT-040A-00 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 1 : !((F((F(("(i0.i1.u7.p15!=1)")U("((i1.i0.u9.p20!=0)&&(i14.i0.u128.p257!=1))")))&&(G(("((i1.i0.u9.p20==0)||(i14.i0.u128.p257==1))")U((F("((i1.i0.u9.p20==0)||(i14.i0.u128.p257==1))"))||("(i0.i1.u7.p15==1)")))))))
Formula 1 simplified : !F(F("(i0.i1.u7.p15!=1)" U "((i1.i0.u9.p20!=0)&&(i14.i0.u128.p257!=1))") & G("((i1.i0.u9.p20==0)||(i14.i0.u128.p257==1))" U ("(i0.i1.u7.p15==1)" | F"((i1.i0.u9.p20==0)||(i14.i0.u128.p257==1))")))
[2020-05-28 02:40:49] [INFO ] Proved 323 variables to be positive in 1462 ms
[2020-05-28 02:40:49] [INFO ] Computing symmetric may disable matrix : 322 transitions.
[2020-05-28 02:40:49] [INFO ] Computation of disable matrix completed :0/322 took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
4 unique states visited
3 strongly connected components in search stack
4 transitions explored
3 items max in DFS search stack
6 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.21184,22208,1,0,8111,84,1253,16189,67,133,12771
an accepting run exists (use option '-e' to print it)
Formula 1 is FALSE accepting run found.
FORMULA ShieldRVt-PT-040A-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 2 : !((F(G("((i12.i1.u114.p229==0)||(i8.i0.u74.p149==1))"))))
Formula 2 simplified : !FG"((i12.i1.u114.p229==0)||(i8.i0.u74.p149==1))"
[2020-05-28 02:40:49] [INFO ] Computation of Complete disable matrix. took 52 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-28 02:40:49] [INFO ] Computing symmetric may enable matrix : 322 transitions.
[2020-05-28 02:40:49] [INFO ] Computation of Complete enable matrix. took 30 ms. Total solver calls (SAT/UNSAT): 0(0/0)
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
450 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,4.70364,165560,1,0,207941,84,1299,1.05573e+06,68,133,111103
an accepting run exists (use option '-e' to print it)
Formula 2 is FALSE accepting run found.
FORMULA ShieldRVt-PT-040A-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 3 : !((X(F((G("((i16.i1.u151.p303==0)||(i9.i0.u81.p163==1))"))||(F("((i7.i2.u70.p142==0)||(i4.i0.u39.p80==1))"))))))
Formula 3 simplified : !XF(G"((i16.i1.u151.p303==0)||(i9.i0.u81.p163==1))" | F"((i7.i2.u70.p142==0)||(i4.i0.u39.p80==1))")
2 unique states visited
0 strongly connected components in search stack
1 transitions explored
2 items max in DFS search stack
0 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,4.70577,166060,1,0,207941,84,1345,1.05573e+06,69,133,111161
no accepting run found
Formula 3 is TRUE no accepting run found.
FORMULA ShieldRVt-PT-040A-06 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 4 : !((G(((X(X(!(F("((i0.i1.u6.p14==0)||(i14.i0.u126.p253==1))")))))||("(i0.i1.u6.p14==0)"))||("(i14.i0.u126.p253==1)"))))
Formula 4 simplified : !G("(i0.i1.u6.p14==0)" | "(i14.i0.u126.p253==1)" | XX!F"((i0.i1.u6.p14==0)||(i14.i0.u126.p253==1))")
5 unique states visited
5 strongly connected components in search stack
5 transitions explored
5 items max in DFS search stack
64 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,5.35397,190024,1,0,249948,84,1418,1.1979e+06,69,133,146066
an accepting run exists (use option '-e' to print it)
Formula 4 is FALSE accepting run found.
FORMULA ShieldRVt-PT-040A-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 5 : !((X(G(X(X("((i9.i1.u87.p175==0)||(i13.i0.u119.p239==1))"))))))
Formula 5 simplified : !XGXX"((i9.i1.u87.p175==0)||(i13.i0.u119.p239==1))"
[2020-05-28 02:40:55] [INFO ] Computing symmetric co enabling matrix : 322 transitions.
6 unique states visited
6 strongly connected components in search stack
6 transitions explored
6 items max in DFS search stack
66 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,6.01492,212976,1,0,288356,84,1451,1.32644e+06,69,133,166412
an accepting run exists (use option '-e' to print it)
Formula 5 is FALSE accepting run found.
FORMULA ShieldRVt-PT-040A-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 6 : !((X(F("((i5.i1.u51.p103!=0)&&(i1.i2.u18.p38!=1))"))))
Formula 6 simplified : !XF"((i5.i1.u51.p103!=0)&&(i1.i2.u18.p38!=1))"
[2020-05-28 02:40:56] [INFO ] Computation of co-enabling matrix(0/322) took 1407 ms. Total solver calls (SAT/UNSAT): 321(0/321)
[2020-05-28 02:40:59] [INFO ] Computation of co-enabling matrix(61/322) took 4464 ms. Total solver calls (SAT/UNSAT): 489(61/428)
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
453 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,10.5476,328344,1,0,475305,84,1507,1.83213e+06,70,133,238596
an accepting run exists (use option '-e' to print it)
Formula 6 is FALSE accepting run found.
FORMULA ShieldRVt-PT-040A-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 7 : !((X(F(!(G(F(!(G(!(("(((i17.i1.u159.p320==0)||(i17.i1.u159.p320==1))&&((i13.i0.u118.p237==0)||(i12.i1.u114.p230==1)))")U(F("((i1.i2.u19.p39==0)||(i0.i0.u1.p4==1))"))))))))))))
Formula 7 simplified : !XF!GF!G!("(((i17.i1.u159.p320==0)||(i17.i1.u159.p320==1))&&((i13.i0.u118.p237==0)||(i12.i1.u114.p230==1)))" U F"((i1.i2.u19.p39==0)||(i0.i0.u1.p4==1))")
[2020-05-28 02:41:02] [INFO ] Computation of co-enabling matrix(163/322) took 7578 ms. Total solver calls (SAT/UNSAT): 776(165/611)
[2020-05-28 02:41:05] [INFO ] Computation of co-enabling matrix(222/322) took 10583 ms. Total solver calls (SAT/UNSAT): 1062(260/802)
[2020-05-28 02:41:08] [INFO ] Computation of Finished co-enabling matrix. took 13243 ms. Total solver calls (SAT/UNSAT): 1159(279/880)
[2020-05-28 02:41:08] [INFO ] Computing Do-Not-Accords matrix : 322 transitions.
[2020-05-28 02:41:08] [INFO ] Computation of Completed DNA matrix. took 52 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-28 02:41:08] [INFO ] Built C files in 20723ms conformant to PINS in folder :/home/mcc/execution
Running compilation step : CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit//lts_install_dir//include, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/home/mcc/execution]
Compilation finished in 3906 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/home/mcc/execution]
Link finished in 76 ms.
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit//lts_install_dir//bin/pins2lts-mc, ./gal.so, --threads=8, --when, --ltl, X(<>(!( [](<>(!( [](!( ((LTLAP13==true))U(<>((LTLAP14==true)))) )) ))) )), --buchi-type=spotba], workingDir=/home/mcc/execution]
/home/mcc/BenchKit//lts_install_dir//bin/pins2lts-mc: error while loading shared libraries: libltdl.so.7: cannot open shared object file: No such file or directory
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :CommandLine [args=[/home/mcc/BenchKit//lts_install_dir//bin/pins2lts-mc, ./gal.so, --threads=8, --when, --ltl, X(<>(!( [](<>(!( [](!( ((LTLAP13==true))U(<>((LTLAP14==true)))) )) ))) )), --buchi-type=spotba], workingDir=/home/mcc/execution]
127
java.lang.RuntimeException: Unexpected exception when executing ltsmin :CommandLine [args=[/home/mcc/BenchKit//lts_install_dir//bin/pins2lts-mc, ./gal.so, --threads=8, --when, --ltl, X(<>(!( [](<>(!( [](!( ((LTLAP13==true))U(<>((LTLAP14==true)))) )) ))) )), --buchi-type=spotba], workingDir=/home/mcc/execution]
127
at fr.lip6.move.gal.application.LTSminRunner.checkProperty(LTSminRunner.java:170)
at fr.lip6.move.gal.application.LTSminRunner.access$10(LTSminRunner.java:124)
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:834)
Detected timeout of ITS tools.
[2020-05-28 03:00:59] [INFO ] Applying decomposition
[2020-05-28 03:00:59] [INFO ] Flatten gal took : 54 ms
[2020-05-28 03:00:59] [INFO ] Decomposing Gal with order
[2020-05-28 03:00:59] [INFO ] Rewriting arrays to variables to allow decomposition.
[2020-05-28 03:00:59] [INFO ] Removed a total of 120 redundant transitions.
[2020-05-28 03:00:59] [INFO ] Flatten gal took : 43 ms
[2020-05-28 03:00:59] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 9 ms.
[2020-05-28 03:00:59] [INFO ] Time to serialize gal into /home/mcc/execution/LTLCardinality.pnml.gal : 6 ms
[2020-05-28 03:00:59] [INFO ] Time to serialize properties into /home/mcc/execution/LTLCardinality.ltl : 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-ltl-linux64, --gc-threshold, 2000000, -i, /home/mcc/execution/LTLCardinality.pnml.gal, -t, CGAL, -LTL, /home/mcc/execution/LTLCardinality.ltl, -c, -stutter-deadlock], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202005100927/bin/its-ltl-linux64 --gc-threshold 2000000 -i /home/mcc/execution/LTLCardinality.pnml.gal -t CGAL -LTL /home/mcc/execution/LTLCardinality.ltl -c -stutter-deadlock
Read 2 LTL properties
Checking formula 0 : !((X(F(!(G(F(!(G(!(("(((u160.p320==0)||(u160.p320==1))&&((u119.p237==0)||(u115.p230==1)))")U(F("((u20.p39==0)||(u2.p4==1))"))))))))))))
Formula 0 simplified : !XF!GF!G!("(((u160.p320==0)||(u160.p320==1))&&((u119.p237==0)||(u115.p230==1)))" U F"((u20.p39==0)||(u2.p4==1))")
built 162 ordering constraints for composite.
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Detected timeout of ITS tools.
[2020-05-28 03:21:10] [INFO ] Flatten gal took : 14 ms
[2020-05-28 03:21:10] [INFO ] Input system was already deterministic with 322 transitions.
[2020-05-28 03:21:10] [INFO ] Transformed 323 places.
[2020-05-28 03:21:10] [INFO ] Transformed 322 transitions.
Running greatSPN : CommandLine [args=[/home/mcc/BenchKit//greatspn//bin/pinvar, /home/mcc/execution/gspn], workingDir=/home/mcc/execution]
Run of greatSPN captured in /home/mcc/execution/outPut.txt
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
[2020-05-28 03:21:10] [INFO ] Time to serialize gal into /home/mcc/execution/LTLCardinality.pnml.gal : 4 ms
[2020-05-28 03:21:10] [INFO ] Time to serialize properties into /home/mcc/execution/LTLCardinality.ltl : 11 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-ltl-linux64, --gc-threshold, 2000000, -i, /home/mcc/execution/LTLCardinality.pnml.gal, -t, CGAL, -LTL, /home/mcc/execution/LTLCardinality.ltl, -c, -stutter-deadlock, --load-order, /home/mcc/execution/model.ord, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202005100927/bin/its-ltl-linux64 --gc-threshold 2000000 -i /home/mcc/execution/LTLCardinality.pnml.gal -t CGAL -LTL /home/mcc/execution/LTLCardinality.ltl -c -stutter-deadlock --load-order /home/mcc/execution/model.ord --gen-order FOLLOW
Read 2 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((X(F(!(G(F(!(G(!(("(((p320==0)||(p320==1))&&((p237==0)||(p230==1)))")U(F("((p39==0)||(p4==1))"))))))))))))
Formula 0 simplified : !XF!GF!G!("(((p320==0)||(p320==1))&&((p237==0)||(p230==1)))" U F"((p39==0)||(p4==1))")
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.

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
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit//runeclipse.sh /home/mcc/execution LTLCardinality -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 LTLCardinality -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="ShieldRVt-PT-040A"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="itstools"
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 itstools"
echo " Input is ShieldRVt-PT-040A, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r210-tajo-159033476601049"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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