Execution Chart

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

Trace from the execution

Waiting for the VM to be ready (probing ssh)
........................
/home/mcc/execution
total 416K
-rw-r--r-- 1 mcc users 3.7K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 22K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 15 18:54 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K May 15 18:50 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 5.8K May 15 18:50 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 2.3K May 26 09:27 LTLCardinality.txt
-rw-r--r-- 1 mcc users 12K May 26 09:27 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.8K May 26 09:27 LTLFireability.txt
-rw-r--r-- 1 mcc users 9.3K May 26 09:27 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 18K May 15 18:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 101 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 339 May 15 18:54 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 2.7K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 18K May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K May 15 18:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.5K May 15 18:54 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 15 18:50 equiv_col
-rw-r--r-- 1 mcc users 3 May 15 18:50 instance
-rw-r--r-- 1 mcc users 6 May 15 18:50 iscolored
-rw-r--r-- 1 mcc users 241K May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool itstools
Input is Raft-PT-10, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r188-qhx2-152732140200085
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1528288143794

Using solver Z3 to compute partial order matrices.
Built C files in :
/home/mcc/execution
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.201805151631/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.201805151631/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 16 LTL properties
Checking formula 0 : !(("((u7.p35==0)||(u33.p164==1))"))
Formula 0 simplified : !"((u7.p35==0)||(u33.p164==1))"
built 202 ordering constraints for composite.
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
Normalized transition count is 780
// Phase 1: matrix 780 rows 508 cols
invariant :u48:p236 + u48:p237 + u48:p238 + u48:p239 + u48:p240 + u103:p0 = 1
invariant :u53:p261 + u53:p262 + u53:p263 + u53:p264 + u53:p265 + u103:p0 = 1
invariant :u72:p356 + u72:p357 + u72:p358 + u72:p359 + u72:p360 + u103:p0 = 1
invariant :u25:p121 + u25:p122 + u25:p123 + u25:p124 + u25:p125 + u103:p0 = 1
invariant :u11:p51 + u11:p52 + u11:p53 + u11:p54 + u11:p55 + u103:p0 = 1
invariant :u54:p266 + u54:p267 + u54:p268 + u54:p269 + u54:p270 + u103:p0 = 1
invariant :u60:p296 + u60:p297 + u60:p298 + u60:p299 + u60:p300 + u103:p0 = 1
invariant :u88:p436 + u88:p437 + u88:p438 + u88:p439 + u88:p440 + u103:p0 = 1
invariant :u1:p1 + u1:p2 + u1:p3 + u1:p4 + u1:p5 + u103:p0 = 1
invariant :u21:p101 + u21:p102 + u21:p103 + u21:p104 + u21:p105 + u103:p0 = 1
invariant :u36:p176 + u36:p177 + u36:p178 + u36:p179 + u36:p180 + u103:p0 = 1
invariant :u44:p216 + u44:p217 + u44:p218 + u44:p219 + u44:p220 + u103:p0 = 1
invariant :u55:p271 + u55:p272 + u55:p273 + u55:p274 + u55:p275 + u103:p0 = 1
invariant :u90:p446 + u90:p447 + u90:p448 + u90:p449 + u90:p450 + u103:p0 = 1
invariant :u52:p256 + u52:p257 + u52:p258 + u52:p259 + u52:p260 + u103:p0 = 1
invariant :u75:p371 + u75:p372 + u75:p373 + u75:p374 + u75:p375 + u103:p0 = 1
invariant :u49:p241 + u49:p242 + u49:p243 + u49:p244 + u49:p245 + u103:p0 = 1
invariant :u26:p126 + u26:p127 + u26:p128 + u26:p129 + u26:p130 + u103:p0 = 1
invariant :u30:p146 + u30:p147 + u30:p148 + u30:p149 + u30:p150 + u103:p0 = 1
invariant :u59:p291 + u59:p292 + u59:p293 + u59:p294 + u59:p295 + u103:p0 = 1
invariant :u69:p341 + u69:p342 + u69:p343 + u69:p344 + u69:p345 + u103:p0 = 1
invariant :u7:p31 + u7:p32 + u7:p33 + u7:p34 + u7:p35 + u103:p0 = 1
invariant :u82:p406 + u82:p407 + u82:p408 + u82:p409 + u82:p410 + u103:p0 = 1
invariant :u77:p381 + u77:p382 + u77:p383 + u77:p384 + u77:p385 + u103:p0 = 1
invariant :u89:p441 + u89:p442 + u89:p443 + u89:p444 + u89:p445 + u103:p0 = 1
invariant :u38:p186 + u38:p187 + u38:p188 + u38:p189 + u38:p190 + u103:p0 = 1
invariant :u64:p316 + u64:p317 + u64:p318 + u64:p319 + u64:p320 + u103:p0 = 1
invariant :u6:p26 + u6:p27 + u6:p28 + u6:p29 + u6:p30 + u103:p0 = 1
invariant :u5:p21 + u5:p22 + u5:p23 + u5:p24 + u5:p25 + u103:p0 = 1
invariant :u61:p301 + u61:p302 + u61:p303 + u61:p304 + u61:p305 + u103:p0 = 1
invariant :u22:p106 + u22:p107 + u22:p108 + u22:p109 + u22:p110 + u103:p0 = 1
invariant :u57:p281 + u57:p282 + u57:p283 + u57:p284 + u57:p285 + u103:p0 = 1
invariant :u51:p251 + u51:p252 + u51:p253 + u51:p254 + u51:p255 + u103:p0 = 1
invariant :u84:p416 + u84:p417 + u84:p418 + u84:p419 + u84:p420 + u103:p0 = 1
invariant :u8:p36 + u8:p37 + u8:p38 + u8:p39 + u8:p40 + u103:p0 = 1
invariant :u12:p56 + u12:p57 + u12:p58 + u12:p59 + u12:p60 + u103:p0 = 1
invariant :u73:p361 + u73:p362 + u73:p363 + u73:p364 + u73:p365 + u103:p0 = 1
invariant :u3:p11 + u3:p12 + u3:p13 + u3:p14 + u3:p15 + u103:p0 = 1
invariant :u65:p321 + u65:p322 + u65:p323 + u65:p324 + u65:p325 + u103:p0 = 1
invariant :u86:p426 + u86:p427 + u86:p428 + u86:p429 + u86:p430 + u103:p0 = 1
invariant :u56:p276 + u56:p277 + u56:p278 + u56:p279 + u56:p280 + u103:p0 = 1
invariant :u91:p451 + u91:p452 + u91:p453 + u91:p454 + u91:p455 + u103:p0 = 1
invariant :u19:p91 + u19:p92 + u19:p93 + u19:p94 + u19:p95 + u103:p0 = 1
invariant :u63:p311 + u63:p312 + u63:p313 + u63:p314 + u63:p315 + u103:p0 = 1
invariant :u76:p376 + u76:p377 + u76:p378 + u76:p379 + u76:p380 + u103:p0 = 1
invariant :u20:p96 + u20:p97 + u20:p98 + u20:p99 + u20:p100 + u103:p0 = 1
invariant :u47:p231 + u47:p232 + u47:p233 + u47:p234 + u47:p235 + u103:p0 = 1
invariant :u67:p331 + u67:p332 + u67:p333 + u67:p334 + u67:p335 + u103:p0 = 1
invariant :u45:p221 + u45:p222 + u45:p223 + u45:p224 + u45:p225 + u103:p0 = 1
invariant :u81:p401 + u81:p402 + u81:p403 + u81:p404 + u81:p405 + u103:p0 = 1
invariant :u28:p136 + u28:p137 + u28:p138 + u28:p139 + u28:p140 + u103:p0 = 1
invariant :u93:p461 + u93:p462 + u93:p463 + u93:p464 + u93:p465 + u103:p0 = 1
invariant :u68:p336 + u68:p337 + u68:p338 + u68:p339 + u68:p340 + u103:p0 = 1
invariant :u46:p226 + u46:p227 + u46:p228 + u46:p229 + u46:p230 + u103:p0 = 1
invariant :u35:p171 + u35:p172 + u35:p173 + u35:p174 + u35:p175 + u103:p0 = 1
invariant :u42:p206 + u42:p207 + u42:p208 + u42:p209 + u42:p210 + u103:p0 = 1
invariant :u66:p326 + u66:p327 + u66:p328 + u66:p329 + u66:p330 + u103:p0 = 1
invariant :u15:p71 + u15:p72 + u15:p73 + u15:p74 + u15:p75 + u103:p0 = 1
invariant :u10:p46 + u10:p47 + u10:p48 + u10:p49 + u10:p50 + u103:p0 = 1
invariant :u40:p196 + u40:p197 + u40:p198 + u40:p199 + u40:p200 + u103:p0 = 1
invariant :u85:p421 + u85:p422 + u85:p423 + u85:p424 + u85:p425 + u103:p0 = 1
invariant :u92:p456 + u92:p457 + u92:p458 + u92:p459 + u92:p460 + u103:p0 = 1
invariant :u14:p66 + u14:p67 + u14:p68 + u14:p69 + u14:p70 + u103:p0 = 1
invariant :u39:p191 + u39:p192 + u39:p193 + u39:p194 + u39:p195 + u103:p0 = 1
invariant :u95:p471 + u95:p472 + u95:p473 + u95:p474 + u95:p475 + u103:p0 = 1
invariant :u4:p16 + u4:p17 + u4:p18 + u4:p19 + u4:p20 + u103:p0 = 1
invariant :u98:p486 + u98:p487 + u98:p488 + u98:p489 + u98:p490 + u103:p0 = 1
invariant :u17:p81 + u17:p82 + u17:p83 + u17:p84 + u17:p85 + u103:p0 = 1
invariant :u32:p156 + u32:p157 + u32:p158 + u32:p159 + u32:p160 + u103:p0 = 1
invariant :u33:p161 + u33:p162 + u33:p163 + u33:p164 + u33:p165 + u103:p0 = 1
invariant :u70:p346 + u70:p347 + u70:p348 + u70:p349 + u70:p350 + u103:p0 = 1
invariant :u96:p476 + u96:p477 + u96:p478 + u96:p479 + u96:p480 + u103:p0 = 1
invariant :u62:p306 + u62:p307 + u62:p308 + u62:p309 + u62:p310 + u103:p0 = 1
invariant :u24:p116 + u24:p117 + u24:p118 + u24:p119 + u24:p120 + u103:p0 = 1
invariant :u80:p396 + u80:p397 + u80:p398 + u80:p399 + u80:p400 + u103:p0 = 1
invariant :u31:p151 + u31:p152 + u31:p153 + u31:p154 + u31:p155 + u103:p0 = 1
invariant :u58:p286 + u58:p287 + u58:p288 + u58:p289 + u58:p290 + u103:p0 = 1
invariant :u9:p41 + u9:p42 + u9:p43 + u9:p44 + u9:p45 + u103:p0 = 1
invariant :u16:p76 + u16:p77 + u16:p78 + u16:p79 + u16:p80 + u103:p0 = 1
invariant :u50:p246 + u50:p247 + u50:p248 + u50:p249 + u50:p250 + u103:p0 = 1
invariant :u13:p61 + u13:p62 + u13:p63 + u13:p64 + u13:p65 + u103:p0 = 1
invariant :u43:p211 + u43:p212 + u43:p213 + u43:p214 + u43:p215 + u103:p0 = 1
invariant :u41:p201 + u41:p202 + u41:p203 + u41:p204 + u41:p205 + u103:p0 = 1
invariant :u23:p111 + u23:p112 + u23:p113 + u23:p114 + u23:p115 + u103:p0 = 1
invariant :u71:p351 + u71:p352 + u71:p353 + u71:p354 + u71:p355 + u103:p0 = 1
invariant :u27:p131 + u27:p132 + u27:p133 + u27:p134 + u27:p135 + u103:p0 = 1
invariant :u97:p481 + u97:p482 + u97:p483 + u97:p484 + u97:p485 + u103:p0 = 1
invariant :u83:p411 + u83:p412 + u83:p413 + u83:p414 + u83:p415 + u103:p0 = 1
invariant :u78:p386 + u78:p387 + u78:p388 + u78:p389 + u78:p390 + u103:p0 = 1
invariant :u2:p6 + u2:p7 + u2:p8 + u2:p9 + u2:p10 + u103:p0 = 1
invariant :u29:p141 + u29:p142 + u29:p143 + u29:p144 + u29:p145 + u103:p0 = 1
invariant :u34:p166 + u34:p167 + u34:p168 + u34:p169 + u34:p170 + u103:p0 = 1
invariant :u79:p391 + u79:p392 + u79:p393 + u79:p394 + u79:p395 + u103:p0 = 1
invariant :u94:p466 + u94:p467 + u94:p468 + u94:p469 + u94:p470 + u103:p0 = 1
invariant :u37:p181 + u37:p182 + u37:p183 + u37:p184 + u37:p185 + u103:p0 = 1
invariant :u74:p366 + u74:p367 + u74:p368 + u74:p369 + u74:p370 + u103:p0 = 1
invariant :u18:p86 + u18:p87 + u18:p88 + u18:p89 + u18:p90 + u103:p0 = 1
invariant :u87:p431 + u87:p432 + u87:p433 + u87:p434 + u87:p435 + u103:p0 = 1
invariant :u99:p491 + u99:p492 + u99:p493 + u99:p494 + u99:p495 + u103:p0 = 1
invariant :u100:p496 + u100:p497 + u100:p498 + u100:p499 + u100:p500 + u103:p0 = 1
Reverse transition relation is NOT exact ! Due to transitions t867, u91.t59, u91.t60, u91.t61, u91.t62, u91.t64, u92.t53, u92.t54, u92.t55, u92.t56, u92.t58, u93.t47, u93.t48, u93.t49, u93.t50, u93.t52, u94.t41, u94.t42, u94.t43, u94.t44, u94.t46, u95.t35, u95.t36, u95.t37, u95.t38, u95.t40, u96.t29, u96.t30, u96.t31, u96.t32, u96.t34, u97.t23, u97.t24, u97.t25, u97.t26, u97.t28, u98.t17, u98.t18, u98.t19, u98.t20, u98.t22, u99.t11, u99.t12, u99.t13, u99.t14, u99.t16, u100.t5, u100.t6, u100.t7, u100.t8, u100.t10, u102.t865, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :42/784/42/868
1 unique states visited
0 strongly connected components in search stack
0 transitions explored
1 items max in DFS search stack
345 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,3.77853,67316,1,0,86360,515,6849,202145,188,878,242005
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA Raft-PT-10-LTLCardinality-00 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 1 : !((X(F(G(F("((u32.p158==0)||(u94.p468==1))"))))))
Formula 1 simplified : !XFGF"((u32.p158==0)||(u94.p468==1))"
4 unique states visited
4 strongly connected components in search stack
5 transitions explored
4 items max in DFS search stack
162 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.39994,84484,1,0,136482,515,8303,202145,209,1073,401089
an accepting run exists (use option '-e' to print it)
Formula 1 is FALSE accepting run found.
FORMULA Raft-PT-10-LTLCardinality-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 2 : !(((F(G("(u90.p447>=3)")))U(("(u87.p431>=1)")U("((u69.p345==0)||(u18.p87==1))"))))
Formula 2 simplified : !(FG"(u90.p447>=3)" U ("(u87.p431>=1)" U "((u69.p345==0)||(u18.p87==1))"))
1 unique states visited
0 strongly connected components in search stack
0 transitions explored
1 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,5.41532,85628,1,0,136482,515,8315,202145,211,1073,401168
no accepting run found
Formula 2 is TRUE no accepting run found.
FORMULA Raft-PT-10-LTLCardinality-02 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 3 : !((X(F(G("(u10.p48>=1)")))))
Formula 3 simplified : !XFG"(u10.p48>=1)"
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
6365 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,69.0693,1185084,1,0,2.37195e+06,515,8339,4.88018e+06,212,1259,2885093
an accepting run exists (use option '-e' to print it)
Formula 3 is FALSE accepting run found.
FORMULA Raft-PT-10-LTLCardinality-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 4 : !((G(G(X(F("(u47.p234>=2)"))))))
Formula 4 simplified : !GXF"(u47.p234>=2)"
4 unique states visited
4 strongly connected components in search stack
5 transitions explored
4 items max in DFS search stack
11 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,69.1778,1185084,1,0,2.37223e+06,515,8515,4.88085e+06,214,1269,2886304
an accepting run exists (use option '-e' to print it)
Formula 4 is FALSE accepting run found.
FORMULA Raft-PT-10-LTLCardinality-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 5 : !(((F("((u80.p399==0)||(u5.p25==1))"))U(X("(u98.p488>=3)"))))
Formula 5 simplified : !(F"((u80.p399==0)||(u5.p25==1))" U X"(u98.p488>=3)")
5 unique states visited
5 strongly connected components in search stack
5 transitions explored
5 items max in DFS search stack
101 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,70.1822,1197972,1,0,2.40794e+06,515,8750,4.95302e+06,218,1278,2969238
an accepting run exists (use option '-e' to print it)
Formula 5 is FALSE accepting run found.
FORMULA Raft-PT-10-LTLCardinality-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 6 : !(((("(u45.p221>=1)")U("(u82.p408>=3)"))U(("((u56.p277==0)||(u54.p270==1))")U("((u1.p3==0)||(u82.p410==1))"))))
Formula 6 simplified : !(("(u45.p221>=1)" U "(u82.p408>=3)") U ("((u56.p277==0)||(u54.p270==1))" U "((u1.p3==0)||(u82.p410==1))"))
1 unique states visited
0 strongly connected components in search stack
0 transitions explored
1 items max in DFS search stack
2 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,70.2045,1198772,1,0,2.40794e+06,515,8805,4.95302e+06,219,1278,2969507
no accepting run found
Formula 6 is TRUE no accepting run found.
FORMULA Raft-PT-10-LTLCardinality-06 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 7 : !(("((u19.p92==0)||(u66.p326==1))"))
Formula 7 simplified : !"((u19.p92==0)||(u66.p326==1))"
1 unique states visited
0 strongly connected components in search stack
0 transitions explored
1 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,70.2082,1198772,1,0,2.40794e+06,515,8811,4.95302e+06,220,1278,2969610
no accepting run found
Formula 7 is TRUE no accepting run found.
FORMULA Raft-PT-10-LTLCardinality-07 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 8 : !(((X("((u61.p301==0)||(u41.p204==1))"))U(F(F("(u60.p297>=2)")))))
Formula 8 simplified : !(X"((u61.p301==0)||(u41.p204==1))" U F"(u60.p297>=2)")
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
33 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,70.5408,1204316,1,0,2.41762e+06,515,8876,4.97491e+06,222,1278,2998609
an accepting run exists (use option '-e' to print it)
Formula 8 is FALSE accepting run found.
FORMULA Raft-PT-10-LTLCardinality-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 9 : !((F(X(G(F("((u33.p163==0)||(u14.p70==1))"))))))
Formula 9 simplified : !FXGF"((u33.p163==0)||(u14.p70==1))"
4 unique states visited
4 strongly connected components in search stack
5 transitions explored
4 items max in DFS search stack
23 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,70.7606,1208532,1,0,2.42343e+06,515,9102,4.98711e+06,222,1280,3005362
an accepting run exists (use option '-e' to print it)
Formula 9 is FALSE accepting run found.
FORMULA Raft-PT-10-LTLCardinality-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 10 : !(((X("(u87.p434>=3)"))U(F(F("((u100.p497==0)||(u44.p216==1))")))))
Formula 10 simplified : !(X"(u87.p434>=3)" U F"((u100.p497==0)||(u44.p216==1))")
1 unique states visited
0 strongly connected components in search stack
0 transitions explored
1 items max in DFS search stack
1 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,70.773,1208796,1,0,2.42343e+06,515,9122,4.98711e+06,222,1280,3005399
no accepting run found
Formula 10 is TRUE no accepting run found.
FORMULA Raft-PT-10-LTLCardinality-10 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 11 : !(("(u78.p388>=2)"))
Formula 11 simplified : !"(u78.p388>=2)"
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 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,70.7745,1208796,1,0,2.42343e+06,515,9129,4.98711e+06,224,1280,3005420
an accepting run exists (use option '-e' to print it)
Formula 11 is FALSE accepting run found.
FORMULA Raft-PT-10-LTLCardinality-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 12 : !(("(u42.p206>=2)"))
Formula 12 simplified : !"(u42.p206>=2)"
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 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,70.7754,1209060,1,0,2.42343e+06,515,9134,4.98711e+06,226,1280,3005457
an accepting run exists (use option '-e' to print it)
Formula 12 is FALSE accepting run found.
FORMULA Raft-PT-10-LTLCardinality-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 13 : !((F(G(F(G("((u51.p255==0)||(u41.p205==1))"))))))
Formula 13 simplified : !FGFG"((u51.p255==0)||(u41.p205==1))"
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
465 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,75.4324,1283492,1,0,2.52137e+06,515,9278,5.26826e+06,226,1288,3389582
an accepting run exists (use option '-e' to print it)
Formula 13 is FALSE accepting run found.
FORMULA Raft-PT-10-LTLCardinality-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 14 : !((X((G("(u102.p507>=1)"))U(F("(u52.p258>=2)")))))
Formula 14 simplified : !X(G"(u102.p507>=1)" U F"(u52.p258>=2)")
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
38 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,75.8054,1283748,1,0,2.53576e+06,515,9355,5.29586e+06,226,1288,3425644
an accepting run exists (use option '-e' to print it)
Formula 14 is FALSE accepting run found.
FORMULA Raft-PT-10-LTLCardinality-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 15 : !((G(F(G(X("(u69.p345>=3)"))))))
Formula 15 simplified : !GFGX"(u69.p345>=3)"
3 unique states visited
2 strongly connected components in search stack
4 transitions explored
3 items max in DFS search stack
4 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,75.8549,1284536,1,0,2.53582e+06,515,9414,5.29594e+06,228,1288,3425841
an accepting run exists (use option '-e' to print it)
Formula 15 is FALSE accepting run found.
FORMULA Raft-PT-10-LTLCardinality-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Running compilation step : CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit//lts_install_dir//include, -I., -std=c99, -fPIC, -O3, model.c], workingDir=/home/mcc/execution]
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.

BK_STOP 1528288252410

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

+ export BINDIR=/home/mcc/BenchKit/
+ BINDIR=/home/mcc/BenchKit/
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ /home/mcc/BenchKit//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsminpath /home/mcc/BenchKit//lts_install_dir/ -smt
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ /home/mcc/BenchKit//itstools/its-tools -consoleLog -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/ -smt -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=/tmp/.eclipse -Xss8m -Xms40m -Xmx8192m -Dfile.encoding=UTF-8 -Dosgi.requiredJavaVersion=1.6
Jun 06, 2018 12:29:07 PM fr.lip6.move.gal.application.Application start
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/, -smt]
Jun 06, 2018 12:29:07 PM fr.lip6.move.gal.application.MccTranslator transformPNML
INFO: Parsing pnml file : /home/mcc/execution/model.pnml
Jun 06, 2018 12:29:07 PM fr.lip6.move.gal.nupn.PTNetReader loadFromXML
INFO: Load time of PNML (sax parser for PT used): 201 ms
Jun 06, 2018 12:29:07 PM fr.lip6.move.gal.pnml.togal.PTGALTransformer handlePage
INFO: Transformed 508 places.
Jun 06, 2018 12:29:07 PM fr.lip6.move.gal.pnml.togal.PTGALTransformer handlePage
INFO: Transformed 868 transitions.
Jun 06, 2018 12:29:07 PM fr.lip6.move.gal.pnml.togal.PnmlToGalTransformer transform
INFO: Found NUPN structural information;
Jun 06, 2018 12:29:07 PM fr.lip6.move.serialization.SerializationUtil systemToFile
INFO: Time to serialize gal into /home/mcc/execution/model.pnml.img.gal : 54 ms
Jun 06, 2018 12:29:08 PM fr.lip6.move.gal.application.MccTranslator applyOrder
INFO: Applying decomposition
Jun 06, 2018 12:29:08 PM fr.lip6.move.gal.instantiate.CompositeBuilder decomposeWithOrder
INFO: Decomposing Gal with order
Jun 06, 2018 12:29:08 PM fr.lip6.move.gal.instantiate.GALRewriter flatten
INFO: Flatten gal took : 422 ms
Jun 06, 2018 12:29:08 PM fr.lip6.move.gal.instantiate.CompositeBuilder rewriteArraysToAllowPartition
INFO: Rewriting arrays to variables to allow decomposition.
Jun 06, 2018 12:29:09 PM fr.lip6.move.gal.instantiate.Instantiator fuseIsomorphicEffects
INFO: Removed a total of 738 redundant transitions.
Jun 06, 2018 12:29:09 PM fr.lip6.move.serialization.SerializationUtil systemToFile
INFO: Time to serialize gal into /home/mcc/execution/LTLCardinality.pnml.gal : 36 ms
Jun 06, 2018 12:29:09 PM fr.lip6.move.serialization.SerializationUtil serializePropertiesForITSLTLTools
INFO: Time to serialize properties into /home/mcc/execution/LTLCardinality.ltl : 1 ms
Jun 06, 2018 12:29:10 PM fr.lip6.move.gal.semantics.CompositeNextBuilder getNextForLabel
INFO: Semantic construction discarded 42 identical transitions.
Jun 06, 2018 12:29:10 PM fr.lip6.move.gal.semantics.DeterministicNextBuilder getDeterministicNext
INFO: Input system was already deterministic with 826 transitions.
Jun 06, 2018 12:29:11 PM fr.lip6.move.gal.gal2smt.bmc.KInductionSolver computeAndDeclareInvariants
INFO: Computed 100 place invariants in 319 ms
Jun 06, 2018 12:29:13 PM fr.lip6.move.gal.gal2smt.bmc.KInductionSolver init
INFO: Proved 508 variables to be positive in 2574 ms
Jun 06, 2018 12:29:13 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver computeAblingMatrix
INFO: Computing symmetric may disable matrix : 826 transitions.
Jun 06, 2018 12:29:13 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of disable matrix completed :0/826 took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
Jun 06, 2018 12:29:13 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of Complete disable matrix. took 192 ms. Total solver calls (SAT/UNSAT): 0(0/0)
Jun 06, 2018 12:29:13 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver computeAblingMatrix
INFO: Computing symmetric may enable matrix : 826 transitions.
Jun 06, 2018 12:29:13 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of Complete enable matrix. took 42 ms. Total solver calls (SAT/UNSAT): 0(0/0)
Jun 06, 2018 12:29:18 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver computeCoEnablingMatrix
INFO: Computing symmetric co enabling matrix : 826 transitions.
Jun 06, 2018 12:29:19 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of co-enabling matrix(0/826) took 658 ms. Total solver calls (SAT/UNSAT): 820(0/820)
Jun 06, 2018 12:29:22 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of co-enabling matrix(30/826) took 3713 ms. Total solver calls (SAT/UNSAT): 3445(985/2460)
Jun 06, 2018 12:29:25 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of co-enabling matrix(49/826) took 6795 ms. Total solver calls (SAT/UNSAT): 4963(2345/2618)
Jun 06, 2018 12:29:28 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of co-enabling matrix(64/826) took 9846 ms. Total solver calls (SAT/UNSAT): 5938(3161/2777)
Jun 06, 2018 12:29:31 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of co-enabling matrix(79/826) took 13038 ms. Total solver calls (SAT/UNSAT): 6688(3773/2915)
Jun 06, 2018 12:29:34 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of co-enabling matrix(95/826) took 16145 ms. Total solver calls (SAT/UNSAT): 7240(4181/3059)
Jun 06, 2018 12:29:37 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of co-enabling matrix(116/826) took 19339 ms. Total solver calls (SAT/UNSAT): 7860(4604/3256)
Jun 06, 2018 12:29:41 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of co-enabling matrix(131/826) took 22556 ms. Total solver calls (SAT/UNSAT): 8902(5485/3417)
Jun 06, 2018 12:29:44 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of co-enabling matrix(146/826) took 25617 ms. Total solver calls (SAT/UNSAT): 9723(6167/3556)
Jun 06, 2018 12:29:47 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of co-enabling matrix(164/826) took 28791 ms. Total solver calls (SAT/UNSAT): 10412(6698/3714)
Jun 06, 2018 12:29:50 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of co-enabling matrix(187/826) took 31816 ms. Total solver calls (SAT/UNSAT): 11022(7112/3910)
Jun 06, 2018 12:29:54 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of co-enabling matrix(204/826) took 35467 ms. Total solver calls (SAT/UNSAT): 12196(8111/4085)
Jun 06, 2018 12:29:57 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of co-enabling matrix(216/826) took 38517 ms. Total solver calls (SAT/UNSAT): 12854(8662/4192)
Jun 06, 2018 12:30:00 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of co-enabling matrix(237/826) took 41610 ms. Total solver calls (SAT/UNSAT): 13661(9292/4369)
Jun 06, 2018 12:30:03 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of co-enabling matrix(264/826) took 44712 ms. Total solver calls (SAT/UNSAT): 14610(10006/4604)
Jun 06, 2018 12:30:06 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of co-enabling matrix(289/826) took 47735 ms. Total solver calls (SAT/UNSAT): 16099(11276/4823)
Jun 06, 2018 12:30:09 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of co-enabling matrix(310/826) took 50831 ms. Total solver calls (SAT/UNSAT): 16873(11885/4988)
Jun 06, 2018 12:30:12 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of co-enabling matrix(331/826) took 53942 ms. Total solver calls (SAT/UNSAT): 17422(12269/5153)
Jun 06, 2018 12:30:16 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of co-enabling matrix(346/826) took 57511 ms. Total solver calls (SAT/UNSAT): 18455(13199/5256)
Jun 06, 2018 12:30:19 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of co-enabling matrix(359/826) took 60737 ms. Total solver calls (SAT/UNSAT): 19180(13823/5357)
Jun 06, 2018 12:30:22 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of co-enabling matrix(376/826) took 63837 ms. Total solver calls (SAT/UNSAT): 19850(14351/5499)
Jun 06, 2018 12:30:25 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of co-enabling matrix(405/826) took 66877 ms. Total solver calls (SAT/UNSAT): 20705(14980/5725)
Jun 06, 2018 12:30:28 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of co-enabling matrix(415/826) took 70099 ms. Total solver calls (SAT/UNSAT): 21400(15605/5795)
Jun 06, 2018 12:30:31 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of co-enabling matrix(429/826) took 73275 ms. Total solver calls (SAT/UNSAT): 22205(16312/5893)
Jun 06, 2018 12:30:34 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of co-enabling matrix(463/826) took 76309 ms. Total solver calls (SAT/UNSAT): 23340(17159/6181)
Jun 06, 2018 12:30:37 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of co-enabling matrix(489/826) took 79350 ms. Total solver calls (SAT/UNSAT): 24639(18292/6347)
Jun 06, 2018 12:30:41 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of co-enabling matrix(505/826) took 82500 ms. Total solver calls (SAT/UNSAT): 25495(19052/6443)
Jun 06, 2018 12:30:44 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of co-enabling matrix(527/826) took 85571 ms. Total solver calls (SAT/UNSAT): 26272(19633/6639)
Jun 06, 2018 12:30:47 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of co-enabling matrix(549/826) took 88606 ms. Total solver calls (SAT/UNSAT): 26905(20128/6777)
Jun 06, 2018 12:30:50 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of co-enabling matrix(563/826) took 91827 ms. Total solver calls (SAT/UNSAT): 27838(20975/6863)
Skipping mayMatrices nes/nds SMT solver raised an exception or timeout.
java.lang.RuntimeException: SMT solver raised an exception or timeout.
at fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver.computeCoEnablingMatrix(NecessaryEnablingsolver.java:480)
at fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext.printLabels(Gal2PinsTransformerNext.java:530)
at fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext.printDependencyMatrix(Gal2PinsTransformerNext.java:209)
at fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext.buildBodyFile(Gal2PinsTransformerNext.java:85)
at fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext.transform(Gal2PinsTransformerNext.java:830)
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:71)
at java.lang.Thread.run(Thread.java:748)
Jun 06, 2018 12:30:50 PM fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext transform
INFO: Built C files in 101209ms conformant to PINS in folder :/home/mcc/execution

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="Raft-PT-10"
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

tar xzf /home/mcc/BenchKit/INPUTS/Raft-PT-10.tgz
mv Raft-PT-10 execution
cd execution
pwd
ls -lh

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-3637"
echo " Executing tool itstools"
echo " Input is Raft-PT-10, 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 r188-qhx2-152732140200085"
echo "====================================================================="
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
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 ;