About the Execution of Irma.struct for DLCround-PT-13a
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
1228.460 | 36766.00 | 63481.00 | 855.20 | FTTFFTTFFFFTTTTF | normal |
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 1.2M
-rw-r--r-- 1 mcc users 3.5K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 20K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 15K 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.9K May 15 18:50 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 2.2K May 26 09:26 LTLCardinality.txt
-rw-r--r-- 1 mcc users 9.2K May 26 09:26 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K May 26 09:26 LTLFireability.txt
-rw-r--r-- 1 mcc users 9.6K May 26 09:26 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 17K May 15 18:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 106 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 344 May 15 18:54 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 3.1K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 21K May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 15 18:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K 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 4 May 15 18:50 instance
-rw-r--r-- 1 mcc users 6 May 15 18:50 iscolored
-rw-r--r-- 1 mcc users 987K May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool irma4mcc-structural
Input is DLCround-PT-13a, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r211-smll-152732261700203
=====================================================================
--------------------
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 DLCround-PT-13a-LTLCardinality-00
FORMULA_NAME DLCround-PT-13a-LTLCardinality-01
FORMULA_NAME DLCround-PT-13a-LTLCardinality-02
FORMULA_NAME DLCround-PT-13a-LTLCardinality-03
FORMULA_NAME DLCround-PT-13a-LTLCardinality-04
FORMULA_NAME DLCround-PT-13a-LTLCardinality-05
FORMULA_NAME DLCround-PT-13a-LTLCardinality-06
FORMULA_NAME DLCround-PT-13a-LTLCardinality-07
FORMULA_NAME DLCround-PT-13a-LTLCardinality-08
FORMULA_NAME DLCround-PT-13a-LTLCardinality-09
FORMULA_NAME DLCround-PT-13a-LTLCardinality-10
FORMULA_NAME DLCround-PT-13a-LTLCardinality-11
FORMULA_NAME DLCround-PT-13a-LTLCardinality-12
FORMULA_NAME DLCround-PT-13a-LTLCardinality-13
FORMULA_NAME DLCround-PT-13a-LTLCardinality-14
FORMULA_NAME DLCround-PT-13a-LTLCardinality-15
=== Now, execution of the tool begins
BK_START 1527409780731
BK_STOP 1527409817497
--------------------
content from stderr:
Prefix is 75f5f979.
Reading known information in /usr/share/mcc4mcc/75f5f979-known.json.
Reading learned information in /usr/share/mcc4mcc/75f5f979-learned.json.
Reading value translations in /usr/share/mcc4mcc/75f5f979-values.json.
Using directory /home/mcc/execution for input, as it contains a model.pnml file.
Using DLCround-PT-13a as instance name.
Using DLCround as model name.
Using algorithm or tool bmdt.
Model characteristics are: {'Examination': 'LTLCardinality', 'Place/Transition': True, 'Colored': False, 'Relative-Time': 1, 'Relative-Memory': 1, 'Ordinary': True, 'Simple Free Choice': False, 'Extended Free Choice': False, 'State Machine': False, 'Marked Graph': False, 'Connected': True, 'Strongly Connected': False, 'Source Place': True, 'Sink Place': False, 'Source Transition': False, 'Sink Transition': False, 'Loop Free': None, 'Conservative': False, 'Sub-Conservative': False, 'Nested Units': True, 'Safe': True, 'Deadlock': None, 'Reversible': None, 'Quasi Live': None, 'Live': None}.
Known tools are: [{'Time': 39024, 'Memory': 1197.19, 'Tool': 'itstools'}, {'Time': 1625183, 'Memory': 7509.79, 'Tool': 'lola'}].
Learned tools are: [{'Tool': 'lola'}].
Learned tool lola is 41.645730832308324x far from the best tool itstools.
LTLCardinality itstools DLCround-PT-13a...
May 27, 2018 8:29:51 AM fr.lip6.move.gal.application.Application start
INFO: Running its-tools with arguments : [-z3path, /usr/bin/z3, -yices2path, /usr/bin/yices, -ltsminpath, /usr/bin, -smt, -its, -pnfolder, /mcc-data, -examination, LTLCardinality]
May 27, 2018 8:29:51 AM fr.lip6.move.gal.application.MccTranslator transformPNML
INFO: Parsing pnml file : /mcc-data/model.pnml
May 27, 2018 8:29:51 AM fr.lip6.move.gal.nupn.PTNetReader loadFromXML
INFO: Load time of PNML (sax parser for PT used): 406 ms
May 27, 2018 8:29:52 AM fr.lip6.move.gal.pnml.togal.PTGALTransformer handlePage
INFO: Transformed 463 places.
May 27, 2018 8:29:52 AM fr.lip6.move.gal.pnml.togal.PTGALTransformer handlePage
INFO: Transformed 3847 transitions.
May 27, 2018 8:29:52 AM fr.lip6.move.gal.pnml.togal.PnmlToGalTransformer transform
INFO: Found NUPN structural information;
May 27, 2018 8:29:52 AM fr.lip6.move.gal.application.MccTranslator applyOrder
INFO: Applying decomposition
May 27, 2018 8:29:52 AM fr.lip6.move.gal.instantiate.CompositeBuilder decomposeWithOrder
INFO: Decomposing Gal with order
May 27, 2018 8:29:53 AM fr.lip6.move.gal.instantiate.GALRewriter flatten
INFO: Flatten gal took : 840 ms
May 27, 2018 8:29:53 AM fr.lip6.move.gal.instantiate.CompositeBuilder rewriteArraysToAllowPartition
INFO: Rewriting arrays to variables to allow decomposition.
May 27, 2018 8:29:54 AM fr.lip6.move.gal.instantiate.Instantiator fuseIsomorphicEffects
INFO: Removed a total of 6598 redundant transitions.
Using solver Z3 to compute partial order matrices.
Built C files in :
/mcc-data
May 27, 2018 8:29:54 AM fr.lip6.move.serialization.SerializationUtil systemToFile
INFO: Time to serialize gal into /mcc-data/LTLCardinality.pnml.gal : 106 ms
May 27, 2018 8:29:54 AM fr.lip6.move.serialization.SerializationUtil serializePropertiesForITSLTLTools
INFO: Time to serialize properties into /mcc-data/LTLCardinality.ltl : 2 ms
Invoking ITS tools like this :CommandLine [args=[/usr/share/itscl/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.201804131302/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /mcc-data/LTLCardinality.pnml.gal, -t, CGAL, -LTL, /mcc-data/LTLCardinality.ltl, -c, -stutter-deadlock], workingDir=/mcc-data]
its-ltl command run as :
/usr/share/itscl/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.201804131302/bin/its-ltl-linux64 --gc-threshold 2000000 -i /mcc-data/LTLCardinality.pnml.gal -t CGAL -LTL /mcc-data/LTLCardinality.ltl -c -stutter-deadlock
Read 16 LTL properties
Checking formula 0 : !(("(u258.p408>=3)"))
Formula 0 simplified : !"(u258.p408>=3)"
built 589 ordering constraints for composite.
May 27, 2018 8:29:55 AM fr.lip6.move.gal.semantics.CompositeNextBuilder getNextForLabel
INFO: Semantic construction discarded 352 identical transitions.
May 27, 2018 8:29:55 AM fr.lip6.move.gal.semantics.DeterministicNextBuilder getDeterministicNext
INFO: Input system was already deterministic with 3495 transitions.
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
Normalized transition count is 266
// Phase 1: matrix 266 rows 463 cols
invariant :u174:p324 + u313:p0 = 1
invariant :u204:p354 + u313:p0 = 1
invariant :u36:p186 + u313:p0 = 1
invariant :u126:p276 + u313:p0 = 1
invariant :u215:p365 + u313:p0 = 1
invariant :u47:p197 + u313:p0 = 1
invariant :u187:p337 + u313:p0 = 1
invariant :u147:p297 + u313:p0 = 1
invariant :u288:p438 + u313:p0 = 1
invariant :u69:p219 + u313:p0 = 1
invariant :u186:p336 + u313:p0 = 1
invariant :u25:p175 + u313:p0 = 1
invariant :u105:p255 + u313:p0 = 1
invariant :u160:p310 + u313:p0 = 1
invariant :u122:p272 + u313:p0 = 1
invariant :u133:p283 + u313:p0 = 1
invariant :u254:p404 + u313:p0 = 1
invariant :u297:p447 + u313:p0 = 1
invariant :u45:p195 + u313:p0 = 1
invariant :u267:p417 + u313:p0 = 1
invariant :u148:p298 + u313:p0 = 1
invariant :u111:p261 + u313:p0 = 1
invariant :u129:p279 + u313:p0 = 1
invariant :u306:p456 + u313:p0 = 1
invariant :u169:p319 + u313:p0 = 1
invariant :u205:p355 + u313:p0 = 1
invariant :u196:p346 + u313:p0 = 1
invariant :u296:p446 + u313:p0 = 1
invariant :u168:p318 + u313:p0 = 1
invariant :u279:p429 + u313:p0 = 1
invariant :u88:p238 + u313:p0 = 1
invariant :u151:p301 + u313:p0 = 1
invariant :u93:p243 + u313:p0 = 1
invariant :u20:p170 + u313:p0 = 1
invariant :u236:p386 + u313:p0 = 1
invariant :u58:p208 + u313:p0 = 1
invariant :u258:p408 + u313:p0 = 1
invariant :u97:p247 + u313:p0 = 1
invariant :u233:p383 + u313:p0 = 1
invariant :u44:p194 + u313:p0 = 1
invariant :u48:p198 + u313:p0 = 1
invariant :u91:p241 + u313:p0 = 1
invariant :u272:p422 + u313:p0 = 1
invariant :u271:p421 + u313:p0 = 1
invariant :u274:p424 + u313:p0 = 1
invariant :u251:p401 + u313:p0 = 1
invariant :u181:p331 + u313:p0 = 1
invariant :u113:p263 + u313:p0 = 1
invariant :u180:p330 + u313:p0 = 1
invariant :u155:p305 + u313:p0 = 1
invariant :u310:p460 + u313:p0 = 1
invariant :u11:p89 + u11:p90 + u11:p91 + u11:p92 + u11:p93 + u11:p94 + u11:p95 + u11:p96 + u11:p97 + u11:p98 + u313:p0 = 1
invariant :u78:p228 + u313:p0 = 1
invariant :u125:p275 + u313:p0 = 1
invariant :u149:p299 + u313:p0 = 1
invariant :u197:p347 + u313:p0 = 1
invariant :u22:p172 + u313:p0 = 1
invariant :u144:p294 + u313:p0 = 1
invariant :u146:p296 + u313:p0 = 1
invariant :u21:p171 + u313:p0 = 1
invariant :u248:p398 + u313:p0 = 1
invariant :u130:p280 + u313:p0 = 1
invariant :u159:p309 + u313:p0 = 1
invariant :u228:p378 + u313:p0 = 1
invariant :u250:p400 + u313:p0 = 1
invariant :u262:p412 + u313:p0 = 1
invariant :u156:p306 + u313:p0 = 1
invariant :u70:p220 + u313:p0 = 1
invariant :u6:p39 + u6:p40 + u6:p41 + u6:p42 + u6:p43 + u6:p44 + u6:p45 + u6:p46 + u6:p47 + u6:p48 + u313:p0 = 1
invariant :u293:p443 + u313:p0 = 1
invariant :u73:p223 + u313:p0 = 1
invariant :u53:p203 + u313:p0 = 1
invariant :u299:p449 + u313:p0 = 1
invariant :u27:p177 + u313:p0 = 1
invariant :u37:p187 + u313:p0 = 1
invariant :u278:p428 + u313:p0 = 1
invariant :u158:p308 + u313:p0 = 1
invariant :u135:p285 + u313:p0 = 1
invariant :u142:p292 + u313:p0 = 1
invariant :u54:p204 + u313:p0 = 1
invariant :u255:p405 + u313:p0 = 1
invariant :u175:p325 + u313:p0 = 1
invariant :u1:p1 + u1:p2 + u1:p3 + u1:p4 + u1:p5 + u1:p6 + u1:p7 + u313:p0 = 1
invariant :u79:p229 + u313:p0 = 1
invariant :u121:p271 + u313:p0 = 1
invariant :u165:p315 + u313:p0 = 1
invariant :u192:p342 + u313:p0 = 1
invariant :u301:p451 + u313:p0 = 1
invariant :u15:p129 + u15:p130 + u15:p131 + u15:p132 + u15:p133 + u15:p134 + u15:p135 + u15:p136 + u15:p137 + u15:p138 + u313:p0 = 1
invariant :u212:p362 + u313:p0 = 1
invariant :u263:p413 + u313:p0 = 1
invariant :u198:p348 + u313:p0 = 1
invariant :u101:p251 + u313:p0 = 1
invariant :u134:p284 + u313:p0 = 1
invariant :u245:p395 + u313:p0 = 1
invariant :u153:p303 + u313:p0 = 1
invariant :u120:p270 + u313:p0 = 1
invariant :u68:p218 + u313:p0 = 1
invariant :u281:p431 + u313:p0 = 1
invariant :u163:p313 + u313:p0 = 1
invariant :u95:p245 + u313:p0 = 1
invariant :u109:p259 + u313:p0 = 1
invariant :u137:p287 + u313:p0 = 1
invariant :u140:p290 + u313:p0 = 1
invariant :u80:p230 + u313:p0 = 1
invariant :u145:p295 + u313:p0 = 1
invariant :u67:p217 + u313:p0 = 1
invariant :u246:p396 + u313:p0 = 1
invariant :u200:p350 + u313:p0 = 1
invariant :u29:p179 + u313:p0 = 1
invariant :u86:p236 + u313:p0 = 1
invariant :u92:p242 + u313:p0 = 1
invariant :u249:p399 + u313:p0 = 1
invariant :u75:p225 + u313:p0 = 1
invariant :u219:p369 + u313:p0 = 1
invariant :u213:p363 + u313:p0 = 1
invariant :u260:p410 + u313:p0 = 1
invariant :u265:p415 + u313:p0 = 1
invariant :u40:p190 + u313:p0 = 1
invariant :u103:p253 + u313:p0 = 1
invariant :u229:p379 + u313:p0 = 1
invariant :u179:p329 + u313:p0 = 1
invariant :u302:p452 + u313:p0 = 1
invariant :u201:p351 + u313:p0 = 1
invariant :u124:p274 + u313:p0 = 1
invariant :u172:p322 + u313:p0 = 1
invariant :u52:p202 + u313:p0 = 1
invariant :u14:p119 + u14:p120 + u14:p121 + u14:p122 + u14:p123 + u14:p124 + u14:p125 + u14:p126 + u14:p127 + u14:p128 + u313:p0 = 1
invariant :u107:p257 + u313:p0 = 1
invariant :u244:p394 + u313:p0 = 1
invariant :u13:p109 + u13:p110 + u13:p111 + u13:p112 + u13:p113 + u13:p114 + u13:p115 + u13:p116 + u13:p117 + u13:p118 + u313:p0 = 1
invariant :u182:p332 + u313:p0 = 1
invariant :u150:p300 + u313:p0 = 1
invariant :u176:p326 + u313:p0 = 1
invariant :u12:p99 + u12:p100 + u12:p101 + u12:p102 + u12:p103 + u12:p104 + u12:p105 + u12:p106 + u12:p107 + u12:p108 + u313:p0 = 1
invariant :u214:p364 + u313:p0 = 1
invariant :u304:p454 + u313:p0 = 1
invariant :u118:p268 + u313:p0 = 1
invariant :u50:p200 + u313:p0 = 1
invariant :u283:p433 + u313:p0 = 1
invariant :u61:p211 + u313:p0 = 1
invariant :u203:p353 + u313:p0 = 1
invariant :u289:p439 + u313:p0 = 1
invariant :u99:p249 + u313:p0 = 1
invariant :u178:p328 + u313:p0 = 1
invariant :u231:p381 + u313:p0 = 1
invariant :u280:p430 + u313:p0 = 1
invariant :u226:p376 + u313:p0 = 1
invariant :u177:p327 + u313:p0 = 1
invariant :u64:p214 + u313:p0 = 1
invariant :u81:p231 + u313:p0 = 1
invariant :u98:p248 + u313:p0 = 1
invariant :u46:p196 + u313:p0 = 1
invariant :u269:p419 + u313:p0 = 1
invariant :u292:p442 + u313:p0 = 1
invariant :u77:p227 + u313:p0 = 1
invariant :u63:p213 + u313:p0 = 1
invariant :u112:p262 + u313:p0 = 1
invariant :u152:p302 + u313:p0 = 1
invariant :u235:p385 + u313:p0 = 1
invariant :u190:p340 + u313:p0 = 1
invariant :u191:p341 + u313:p0 = 1
invariant :u239:p389 + u313:p0 = 1
invariant :u291:p441 + u313:p0 = 1
invariant :u224:p374 + u313:p0 = 1
invariant :u8:p59 + u8:p60 + u8:p61 + u8:p62 + u8:p63 + u8:p64 + u8:p65 + u8:p66 + u8:p67 + u8:p68 + u313:p0 = 1
invariant :u72:p222 + u313:p0 = 1
invariant :u110:p260 + u313:p0 = 1
invariant :u55:p205 + u313:p0 = 1
invariant :u60:p210 + u313:p0 = 1
invariant :u238:p388 + u313:p0 = 1
invariant :u285:p435 + u313:p0 = 1
invariant :u154:p304 + u313:p0 = 1
invariant :u276:p426 + u313:p0 = 1
invariant :u19:p169 + u313:p0 = 1
invariant :u173:p323 + u313:p0 = 1
invariant :u290:p440 + u313:p0 = 1
invariant :u7:p49 + u7:p50 + u7:p51 + u7:p52 + u7:p53 + u7:p54 + u7:p55 + u7:p56 + u7:p57 + u7:p58 + u313:p0 = 1
invariant :u252:p402 + u313:p0 = 1
invariant :u18:p159 + u18:p160 + u18:p161 + u18:p162 + u18:p163 + u18:p164 + u18:p165 + u18:p166 + u18:p167 + u18:p168 + u313:p0 = 1
invariant :u115:p265 + u313:p0 = 1
invariant :u232:p382 + u313:p0 = 1
invariant :u10:p79 + u10:p80 + u10:p81 + u10:p82 + u10:p83 + u10:p84 + u10:p85 + u10:p86 + u10:p87 + u10:p88 + u313:p0 = 1
invariant :u131:p281 + u313:p0 = 1
invariant :u34:p184 + u313:p0 = 1
invariant :u209:p359 + u313:p0 = 1
invariant :u100:p250 + u313:p0 = 1
invariant :u309:p459 + u313:p0 = 1
invariant :u257:p407 + u313:p0 = 1
invariant :u82:p232 + u313:p0 = 1
invariant :u282:p432 + u313:p0 = 1
invariant :u208:p358 + u313:p0 = 1
invariant :u57:p207 + u313:p0 = 1
invariant :u30:p180 + u313:p0 = 1
invariant :u66:p216 + u313:p0 = 1
invariant :u119:p269 + u313:p0 = 1
invariant :u294:p444 + u313:p0 = 1
invariant :u227:p377 + u313:p0 = 1
invariant :u96:p246 + u313:p0 = 1
invariant :u5:p29 + u5:p30 + u5:p31 + u5:p32 + u5:p33 + u5:p34 + u5:p35 + u5:p36 + u5:p37 + u5:p38 + u313:p0 = 1
invariant :u38:p188 + u313:p0 = 1
invariant :u170:p320 + u313:p0 = 1
invariant :u132:p282 + u313:p0 = 1
invariant :u17:p149 + u17:p150 + u17:p151 + u17:p152 + u17:p153 + u17:p154 + u17:p155 + u17:p156 + u17:p157 + u17:p158 + u313:p0 = 1
invariant :u138:p288 + u313:p0 = 1
invariant :u202:p352 + u313:p0 = 1
invariant :u71:p221 + u313:p0 = 1
invariant :u218:p368 + u313:p0 = 1
invariant :u307:p457 + u313:p0 = 1
invariant :u230:p380 + u313:p0 = 1
invariant :u221:p371 + u313:p0 = 1
invariant :u102:p252 + u313:p0 = 1
invariant :u83:p233 + u313:p0 = 1
invariant :u39:p189 + u313:p0 = 1
invariant :u84:p234 + u313:p0 = 1
invariant :u308:p458 + u313:p0 = 1
invariant :u104:p254 + u313:p0 = 1
invariant :u89:p239 + u313:p0 = 1
invariant :u194:p344 + u313:p0 = 1
invariant :u141:p291 + u313:p0 = 1
invariant :u65:p215 + u313:p0 = 1
invariant :u284:p434 + u313:p0 = 1
invariant :u270:p420 + u313:p0 = 1
invariant :u210:p360 + u313:p0 = 1
invariant :u275:p425 + u313:p0 = 1
invariant :u90:p240 + u313:p0 = 1
invariant :u184:p334 + u313:p0 = 1
invariant :u225:p375 + u313:p0 = 1
invariant :u241:p391 + u313:p0 = 1
invariant :u33:p183 + u313:p0 = 1
invariant :u287:p437 + u313:p0 = 1
invariant :u85:p235 + u313:p0 = 1
invariant :u2:p8 + u2:p9 + u2:p10 + u2:p11 + u2:p12 + u2:p13 + u2:p14 + u313:p0 = 1
invariant :u143:p293 + u313:p0 = 1
invariant :u286:p436 + u313:p0 = 1
invariant :u117:p267 + u313:p0 = 1
invariant :u108:p258 + u313:p0 = 1
invariant :u312:p462 + u313:p0 = 1
invariant :u164:p314 + u313:p0 = 1
invariant :u295:p445 + u313:p0 = 1
invariant :u28:p178 + u313:p0 = 1
invariant :u243:p393 + u313:p0 = 1
invariant :u116:p266 + u313:p0 = 1
invariant :u268:p418 + u313:p0 = 1
invariant :u206:p356 + u313:p0 = 1
invariant :u253:p403 + u313:p0 = 1
invariant :u256:p406 + u313:p0 = 1
invariant :u222:p372 + u313:p0 = 1
invariant :u183:p333 + u313:p0 = 1
invariant :u247:p397 + u313:p0 = 1
invariant :u157:p307 + u313:p0 = 1
invariant :u24:p174 + u313:p0 = 1
invariant :u35:p185 + u313:p0 = 1
invariant :u166:p316 + u313:p0 = 1
invariant :u167:p317 + u313:p0 = 1
invariant :u42:p192 + u313:p0 = 1
invariant :u94:p244 + u313:p0 = 1
invariant :u298:p448 + u313:p0 = 1
invariant :u49:p199 + u313:p0 = 1
invariant :u303:p453 + u313:p0 = 1
invariant :u211:p361 + u313:p0 = 1
invariant :u127:p277 + u313:p0 = 1
invariant :u32:p182 + u313:p0 = 1
invariant :u106:p256 + u313:p0 = 1
invariant :u26:p176 + u313:p0 = 1
invariant :u234:p384 + u313:p0 = 1
invariant :u188:p338 + u313:p0 = 1
invariant :u217:p367 + u313:p0 = 1
invariant :u261:p411 + u313:p0 = 1
invariant :u51:p201 + u313:p0 = 1
invariant :u264:p414 + u313:p0 = 1
invariant :u185:p335 + u313:p0 = 1
invariant :u311:p461 + u313:p0 = 1
invariant :u128:p278 + u313:p0 = 1
invariant :u193:p343 + u313:p0 = 1
invariant :u259:p409 + u313:p0 = 1
invariant :u74:p224 + u313:p0 = 1
invariant :u9:p69 + u9:p70 + u9:p71 + u9:p72 + u9:p73 + u9:p74 + u9:p75 + u9:p76 + u9:p77 + u9:p78 + u313:p0 = 1
invariant :u266:p416 + u313:p0 = 1
invariant :u23:p173 + u313:p0 = 1
invariant :u273:p423 + u313:p0 = 1
invariant :u41:p191 + u313:p0 = 1
invariant :u207:p357 + u313:p0 = 1
invariant :u223:p373 + u313:p0 = 1
invariant :u189:p339 + u313:p0 = 1
invariant :u31:p181 + u313:p0 = 1
invariant :u240:p390 + u313:p0 = 1
invariant :u171:p321 + u313:p0 = 1
invariant :u87:p237 + u313:p0 = 1
invariant :u136:p286 + u313:p0 = 1
invariant :u305:p455 + u313:p0 = 1
invariant :u300:p450 + u313:p0 = 1
invariant :u4:p22 + u4:p23 + u4:p24 + u4:p25 + u4:p26 + u4:p27 + u4:p28 + u313:p0 = 1
invariant :u16:p139 + u16:p140 + u16:p141 + u16:p142 + u16:p143 + u16:p144 + u16:p145 + u16:p146 + u16:p147 + u16:p148 + u313:p0 = 1
invariant :u237:p387 + u313:p0 = 1
invariant :u43:p193 + u313:p0 = 1
invariant :u139:p289 + u313:p0 = 1
invariant :u76:p226 + u313:p0 = 1
invariant :u220:p370 + u313:p0 = 1
invariant :u56:p206 + u313:p0 = 1
invariant :u277:p427 + u313:p0 = 1
invariant :u162:p312 + u313:p0 = 1
invariant :u216:p366 + u313:p0 = 1
invariant :u199:p349 + u313:p0 = 1
invariant :u62:p212 + u313:p0 = 1
invariant :u3:p15 + u3:p16 + u3:p17 + u3:p18 + u3:p19 + u3:p20 + u3:p21 + u313:p0 = 1
invariant :u59:p209 + u313:p0 = 1
invariant :u114:p264 + u313:p0 = 1
invariant :u123:p273 + u313:p0 = 1
invariant :u195:p345 + u313:p0 = 1
invariant :u242:p392 + u313:p0 = 1
invariant :u161:p311 + u313:p0 = 1
May 27, 2018 8:29:57 AM fr.lip6.move.gal.gal2smt.bmc.KInductionSolver computeAndDeclareInvariants
INFO: Computed 312 place invariants in 196 ms
May 27, 2018 8:29:59 AM fr.lip6.move.gal.gal2smt.bmc.KInductionSolver init
INFO: Proved 463 variables to be positive in 2553 ms
May 27, 2018 8:29:59 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver computeAblingMatrix
INFO: Computing symmetric may disable matrix : 3495 transitions.
May 27, 2018 8:29:59 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of disable matrix completed :0/3495 took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
May 27, 2018 8:30:00 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of Complete disable matrix. took 442 ms. Total solver calls (SAT/UNSAT): 0(0/0)
May 27, 2018 8:30:00 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver computeAblingMatrix
INFO: Computing symmetric may enable matrix : 3495 transitions.
May 27, 2018 8:30:00 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of Complete enable matrix. took 526 ms. Total solver calls (SAT/UNSAT): 0(0/0)
Skipping mayMatrices nes/nds SMT solver raised an error :unknown
java.lang.RuntimeException: SMT solver raised an error :unknown
at fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver.computeAblingForPredicate(NecessaryEnablingsolver.java:766)
at fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext.printLabels(Gal2PinsTransformerNext.java:502)
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:827)
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:71)
at java.lang.Thread.run(Thread.java:748)
May 27, 2018 8:30:01 AM fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext transform
INFO: Built C files in 6889ms conformant to PINS in folder :/mcc-data
Running compilation step : CommandLine [args=[gcc, -c, -I/usr/bin/include, -I., -std=c99, -fPIC, -O3, model.c], workingDir=/mcc-data]
java.io.IOException: Cannot run program "gcc" (in directory "/mcc-data"): error=2, No such file or directory
at java.lang.ProcessBuilder.start(ProcessBuilder.java:1048)
at fr.lip6.move.gal.process.Runner.runTool(Runner.java:46)
at fr.lip6.move.gal.process.Runner.runTool(Runner.java:27)
at fr.lip6.move.gal.application.LTSminRunner.compilePINS(LTSminRunner.java:235)
at fr.lip6.move.gal.application.LTSminRunner.access$6(LTSminRunner.java:220)
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:75)
at java.lang.Thread.run(Thread.java:748)
Caused by: java.io.IOException: error=2, No such file or directory
at java.lang.UNIXProcess.forkAndExec(Native Method)
at java.lang.UNIXProcess.
at java.lang.ProcessImpl.start(ProcessImpl.java:134)
at java.lang.ProcessBuilder.start(ProcessBuilder.java:1029)
... 6 more
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
1045 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.7907,107212,1,0,31549,1402,14334,29638,437,1334,136985
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA DLCround-PT-13a-LTLCardinality-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 1 : !((X(X(("((u63.p213==0)||(u116.p266==1))")U("((u168.p318==0)||(u75.p225==1))")))))
Formula 1 simplified : !XX("((u63.p213==0)||(u116.p266==1))" U "((u168.p318==0)||(u75.p225==1))")
3 unique states visited
0 strongly connected components in search stack
2 transitions explored
3 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,10.8372,109640,1,0,33837,1402,14351,31837,439,1334,154542
no accepting run found
Formula 1 is TRUE no accepting run found.
FORMULA DLCround-PT-13a-LTLCardinality-01 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 2 : !((("(u10.p80>=2)")U(X(X("((u7.p50==0)||(u129.p279==1))")))))
Formula 2 simplified : !("(u10.p80>=2)" U XX"((u7.p50==0)||(u129.p279==1))")
3 unique states visited
0 strongly connected components in search stack
2 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,10.8463,109836,1,0,33838,1402,14363,31839,442,1334,155335
no accepting run found
Formula 2 is TRUE no accepting run found.
FORMULA DLCround-PT-13a-LTLCardinality-02 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 3 : !((G("(u24.p174>=1)")))
Formula 3 simplified : !G"(u24.p174>=1)"
3 unique states visited
3 strongly connected components in search stack
3 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,10.8725,110224,1,0,33838,1402,14379,31839,443,1334,155949
an accepting run exists (use option '-e' to print it)
Formula 3 is FALSE accepting run found.
FORMULA DLCround-PT-13a-LTLCardinality-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 4 : !((X("(u3.p16>=2)")))
Formula 4 simplified : !X"(u3.p16>=2)"
4 unique states visited
4 strongly connected components in search stack
4 transitions explored
4 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,10.8789,110224,1,0,33937,1402,14384,31912,445,1334,157052
an accepting run exists (use option '-e' to print it)
Formula 4 is FALSE accepting run found.
FORMULA DLCround-PT-13a-LTLCardinality-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 5 : !((F("((u23.p173==0)||(u202.p352==1))")))
Formula 5 simplified : !F"((u23.p173==0)||(u202.p352==1))"
1 unique states visited
0 strongly connected components in search stack
0 transitions explored
1 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,10.913,111016,1,0,33937,1402,14405,31912,445,1334,157368
no accepting run found
Formula 5 is TRUE no accepting run found.
FORMULA DLCround-PT-13a-LTLCardinality-05 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 6 : !((X("(u36.p186>=1)")))
Formula 6 simplified : !X"(u36.p186>=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,10.9156,111016,1,0,33937,1402,14407,31912,445,1334,157662
no accepting run found
Formula 6 is TRUE no accepting run found.
FORMULA DLCround-PT-13a-LTLCardinality-06 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 7 : !((F(X(F(G("(u245.p395>=3)"))))))
Formula 7 simplified : !FXFG"(u245.p395>=3)"
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
688 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,17.8031,383756,1,0,845076,1402,14430,938636,445,3106,1006842
an accepting run exists (use option '-e' to print it)
Formula 7 is FALSE accepting run found.
FORMULA DLCround-PT-13a-LTLCardinality-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 8 : !(((X(F("(u303.p453>=2)")))U("(u187.p337>=1)")))
Formula 8 simplified : !(XF"(u303.p453>=2)" U "(u187.p337>=1)")
4 unique states visited
3 strongly connected components in search stack
4 transitions explored
3 items max in DFS search stack
9 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,17.8991,386904,1,0,845087,1402,14479,938961,447,3116,1007191
an accepting run exists (use option '-e' to print it)
Formula 8 is FALSE accepting run found.
FORMULA DLCround-PT-13a-LTLCardinality-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 9 : !(("(u38.p188>=2)"))
Formula 9 simplified : !"(u38.p188>=2)"
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 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,17.9017,386904,1,0,845087,1402,14482,938961,447,3116,1007483
an accepting run exists (use option '-e' to print it)
Formula 9 is FALSE accepting run found.
FORMULA DLCround-PT-13a-LTLCardinality-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 10 : !((F("(u16.p145>=1)")))
Formula 10 simplified : !F"(u16.p145>=1)"
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 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,18.557,406968,1,0,855985,1402,14864,956772,448,3343,1022010
an accepting run exists (use option '-e' to print it)
Formula 10 is FALSE accepting run found.
FORMULA DLCround-PT-13a-LTLCardinality-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 11 : !((G(F(G(X("((u267.p417==0)||(u249.p399==1))"))))))
Formula 11 simplified : !GFGX"((u267.p417==0)||(u249.p399==1))"
3 unique states visited
0 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,18.5963,409024,1,0,856093,1402,14881,956882,448,3345,1022571
no accepting run found
Formula 11 is TRUE no accepting run found.
FORMULA DLCround-PT-13a-LTLCardinality-11 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 12 : !((X(F(G(F("((u111.p261==0)||(u112.p262==1))"))))))
Formula 12 simplified : !XFGF"((u111.p261==0)||(u112.p262==1))"
2 unique states visited
0 strongly connected components in search stack
2 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,18.6019,409024,1,0,856093,1402,14886,956882,448,3345,1022787
no accepting run found
Formula 12 is TRUE no accepting run found.
FORMULA DLCround-PT-13a-LTLCardinality-12 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 13 : !((X(F(F(F("((u237.p387==0)||(u239.p389==1))"))))))
Formula 13 simplified : !XF"((u237.p387==0)||(u239.p389==1))"
2 unique states visited
0 strongly connected components in search stack
1 transitions explored
2 items max in DFS search stack
3 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,18.6382,409320,1,0,856093,1402,14907,956882,448,3345,1022875
no accepting run found
Formula 13 is TRUE no accepting run found.
FORMULA DLCround-PT-13a-LTLCardinality-13 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 14 : !((F("((u84.p234==0)||(u128.p278==1))")))
Formula 14 simplified : !F"((u84.p234==0)||(u128.p278==1))"
1 unique states visited
0 strongly connected components in search stack
0 transitions explored
1 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,18.6705,409584,1,0,856093,1402,14928,956882,448,3345,1023126
no accepting run found
Formula 14 is TRUE no accepting run found.
FORMULA DLCround-PT-13a-LTLCardinality-14 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 15 : !((X(X(("(u42.p192>=3)")U("(u295.p445>=3)")))))
Formula 15 simplified : !XX("(u42.p192>=3)" U "(u295.p445>=3)")
5 unique states visited
5 strongly connected components in search stack
5 transitions explored
5 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,18.6819,409584,1,0,856161,1402,14939,956946,448,3415,1024819
an accepting run exists (use option '-e' to print it)
Formula 15 is FALSE accepting run found.
FORMULA DLCround-PT-13a-LTLCardinality-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
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="DLCround-PT-13a"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="irma4mcc-structural"
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/DLCround-PT-13a.tgz
mv DLCround-PT-13a 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 irma4mcc-structural"
echo " Input is DLCround-PT-13a, 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 r211-smll-152732261700203"
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 '
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 ;