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 924K
-rw-r--r-- 1 mcc users 3.3K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 18K 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.3K May 26 09:26 LTLCardinality.txt
-rw-r--r-- 1 mcc users 10K May 26 09:26 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.7K May 26 09:26 LTLFireability.txt
-rw-r--r-- 1 mcc users 7.2K 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 18K 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 2.8K 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.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 762K May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool irma4mcc-structural
Input is DLCround-PT-11a, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r211-smll-152732261700195
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1527409308916


BK_STOP 1527409351492

--------------------
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-11a 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': 9618, 'Memory': 526.63, 'Tool': 'itstools'}, {'Time': 3539808, 'Memory': 7450.64, 'Tool': 'lola'}].
Learned tools are: [{'Tool': 'lola'}].
Learned tool lola is 368.03992514036185x far from the best tool itstools.
LTLCardinality itstools DLCround-PT-11a...
May 27, 2018 8:22:00 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:22:00 AM fr.lip6.move.gal.application.MccTranslator transformPNML
INFO: Parsing pnml file : /mcc-data/model.pnml
May 27, 2018 8:22:01 AM fr.lip6.move.gal.nupn.PTNetReader loadFromXML
INFO: Load time of PNML (sax parser for PT used): 307 ms
May 27, 2018 8:22:01 AM fr.lip6.move.gal.pnml.togal.PTGALTransformer handlePage
INFO: Transformed 377 places.
May 27, 2018 8:22:01 AM fr.lip6.move.gal.pnml.togal.PTGALTransformer handlePage
INFO: Transformed 2993 transitions.
May 27, 2018 8:22:01 AM fr.lip6.move.gal.pnml.togal.PnmlToGalTransformer transform
INFO: Found NUPN structural information;
May 27, 2018 8:22:02 AM fr.lip6.move.serialization.SerializationUtil systemToFile
INFO: Time to serialize gal into /mcc-data/model.pnml.img.gal : 108 ms
May 27, 2018 8:22:02 AM fr.lip6.move.gal.application.MccTranslator applyOrder
INFO: Applying decomposition
May 27, 2018 8:22:02 AM fr.lip6.move.gal.instantiate.CompositeBuilder decomposeWithOrder
INFO: Decomposing Gal with order
May 27, 2018 8:22:03 AM fr.lip6.move.gal.instantiate.GALRewriter flatten
INFO: Flatten gal took : 886 ms
May 27, 2018 8:22:03 AM fr.lip6.move.gal.instantiate.CompositeBuilder rewriteArraysToAllowPartition
INFO: Rewriting arrays to variables to allow decomposition.
May 27, 2018 8:22:03 AM fr.lip6.move.gal.instantiate.Instantiator fuseIsomorphicEffects
INFO: Removed a total of 5052 redundant transitions.
Using solver Z3 to compute partial order matrices.
Built C files in :
/mcc-data
May 27, 2018 8:22:03 AM fr.lip6.move.serialization.SerializationUtil systemToFile
INFO: Time to serialize gal into /mcc-data/LTLCardinality.pnml.gal : 34 ms
May 27, 2018 8:22:03 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 : !((G(F(X(G("((u10.p86==0)||(u3.p18==1))"))))))
Formula 0 simplified : !GFXG"((u10.p86==0)||(u3.p18==1))"
built 457 ordering constraints for composite.
May 27, 2018 8:22:04 AM fr.lip6.move.gal.semantics.CompositeNextBuilder getNextForLabel
INFO: Semantic construction discarded 280 identical transitions.
May 27, 2018 8:22:04 AM fr.lip6.move.gal.semantics.DeterministicNextBuilder getDeterministicNext
INFO: Input system was already deterministic with 2713 transitions.
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
Normalized transition count is 234
// Phase 1: matrix 234 rows 377 cols
invariant :u106:p238 + u245:p0 = 1
invariant :u136:p268 + u245:p0 = 1
invariant :u122:p254 + u245:p0 = 1
invariant :u65:p197 + u245:p0 = 1
invariant :u167:p299 + u245:p0 = 1
invariant :u156:p288 + u245:p0 = 1
invariant :u58:p190 + u245:p0 = 1
invariant :u171:p303 + u245:p0 = 1
invariant :u123:p255 + u245:p0 = 1
invariant :u223:p355 + u245:p0 = 1
invariant :u42:p174 + u245:p0 = 1
invariant :u147:p279 + u245:p0 = 1
invariant :u220:p352 + u245:p0 = 1
invariant :u61:p193 + u245:p0 = 1
invariant :u170:p302 + u245:p0 = 1
invariant :u86:p218 + u245:p0 = 1
invariant :u118:p250 + u245:p0 = 1
invariant :u208:p340 + u245:p0 = 1
invariant :u119:p251 + u245:p0 = 1
invariant :u79:p211 + u245:p0 = 1
invariant :u217:p349 + u245:p0 = 1
invariant :u92:p224 + u245:p0 = 1
invariant :u54:p186 + u245:p0 = 1
invariant :u186:p318 + u245:p0 = 1
invariant :u37:p169 + u245:p0 = 1
invariant :u150:p282 + u245:p0 = 1
invariant :u105:p237 + u245:p0 = 1
invariant :u184:p316 + u245:p0 = 1
invariant :u93:p225 + u245:p0 = 1
invariant :u240:p372 + u245:p0 = 1
invariant :u215:p347 + u245:p0 = 1
invariant :u135:p267 + u245:p0 = 1
invariant :u78:p210 + u245:p0 = 1
invariant :u126:p258 + u245:p0 = 1
invariant :u148:p280 + u245:p0 = 1
invariant :u57:p189 + u245:p0 = 1
invariant :u153:p285 + u245:p0 = 1
invariant :u81:p213 + u245:p0 = 1
invariant :u216:p348 + u245:p0 = 1
invariant :u129:p261 + u245:p0 = 1
invariant :u221:p353 + u245:p0 = 1
invariant :u62:p194 + u245:p0 = 1
invariant :u31:p163 + u245:p0 = 1
invariant :u142:p274 + u245:p0 = 1
invariant :u22:p154 + u245:p0 = 1
invariant :u73:p205 + u245:p0 = 1
invariant :u160:p292 + u245:p0 = 1
invariant :u182:p314 + u245:p0 = 1
invariant :u14:p119 + u14:p120 + u14:p121 + u14:p122 + u14:p123 + u14:p124 + u14:p125 + u14:p126 + u14:p127 + u14:p128 + u245:p0 = 1
invariant :u212:p344 + u245:p0 = 1
invariant :u6:p39 + u6:p40 + u6:p41 + u6:p42 + u6:p43 + u6:p44 + u6:p45 + u6:p46 + u6:p47 + u6:p48 + u245:p0 = 1
invariant :u203:p335 + u245:p0 = 1
invariant :u91:p223 + u245:p0 = 1
invariant :u88:p220 + u245:p0 = 1
invariant :u55:p187 + u245:p0 = 1
invariant :u127:p259 + u245:p0 = 1
invariant :u1:p1 + u1:p2 + u1:p3 + u1:p4 + u1:p5 + u1:p6 + u1:p7 + u245:p0 = 1
invariant :u219:p351 + u245:p0 = 1
invariant :u40:p172 + u245:p0 = 1
invariant :u17:p149 + u245:p0 = 1
invariant :u75:p207 + u245:p0 = 1
invariant :u109:p241 + u245:p0 = 1
invariant :u49:p181 + u245:p0 = 1
invariant :u225:p357 + u245:p0 = 1
invariant :u44:p176 + u245:p0 = 1
invariant :u84:p216 + u245:p0 = 1
invariant :u190:p322 + u245:p0 = 1
invariant :u172:p304 + u245:p0 = 1
invariant :u214:p346 + u245:p0 = 1
invariant :u161:p293 + u245:p0 = 1
invariant :u121:p253 + u245:p0 = 1
invariant :u68:p200 + u245:p0 = 1
invariant :u56:p188 + u245:p0 = 1
invariant :u104:p236 + u245:p0 = 1
invariant :u133:p265 + u245:p0 = 1
invariant :u226:p358 + u245:p0 = 1
invariant :u176:p308 + u245:p0 = 1
invariant :u206:p338 + u245:p0 = 1
invariant :u232:p364 + u245:p0 = 1
invariant :u63:p195 + u245:p0 = 1
invariant :u243:p375 + u245:p0 = 1
invariant :u108:p240 + u245:p0 = 1
invariant :u51:p183 + u245:p0 = 1
invariant :u237:p369 + u245:p0 = 1
invariant :u102:p234 + u245:p0 = 1
invariant :u159:p291 + u245:p0 = 1
invariant :u70:p202 + u245:p0 = 1
invariant :u169:p301 + u245:p0 = 1
invariant :u9:p69 + u9:p70 + u9:p71 + u9:p72 + u9:p73 + u9:p74 + u9:p75 + u9:p76 + u9:p77 + u9:p78 + u245:p0 = 1
invariant :u134:p266 + u245:p0 = 1
invariant :u183:p315 + u245:p0 = 1
invariant :u236:p368 + u245:p0 = 1
invariant :u12:p99 + u12:p100 + u12:p101 + u12:p102 + u12:p103 + u12:p104 + u12:p105 + u12:p106 + u12:p107 + u12:p108 + u245:p0 = 1
invariant :u152:p284 + u245:p0 = 1
invariant :u35:p167 + u245:p0 = 1
invariant :u205:p337 + u245:p0 = 1
invariant :u25:p157 + u245:p0 = 1
invariant :u38:p170 + u245:p0 = 1
invariant :u235:p367 + u245:p0 = 1
invariant :u13:p109 + u13:p110 + u13:p111 + u13:p112 + u13:p113 + u13:p114 + u13:p115 + u13:p116 + u13:p117 + u13:p118 + u245:p0 = 1
invariant :u166:p298 + u245:p0 = 1
invariant :u59:p191 + u245:p0 = 1
invariant :u69:p201 + u245:p0 = 1
invariant :u77:p209 + u245:p0 = 1
invariant :u80:p212 + u245:p0 = 1
invariant :u196:p328 + u245:p0 = 1
invariant :u132:p264 + u245:p0 = 1
invariant :u47:p179 + u245:p0 = 1
invariant :u149:p281 + u245:p0 = 1
invariant :u199:p331 + u245:p0 = 1
invariant :u60:p192 + u245:p0 = 1
invariant :u32:p164 + u245:p0 = 1
invariant :u115:p247 + u245:p0 = 1
invariant :u4:p22 + u4:p23 + u4:p24 + u4:p25 + u4:p26 + u4:p27 + u4:p28 + u245:p0 = 1
invariant :u179:p311 + u245:p0 = 1
invariant :u128:p260 + u245:p0 = 1
invariant :u197:p329 + u245:p0 = 1
invariant :u125:p257 + u245:p0 = 1
invariant :u137:p269 + u245:p0 = 1
invariant :u241:p373 + u245:p0 = 1
invariant :u198:p330 + u245:p0 = 1
invariant :u5:p29 + u5:p30 + u5:p31 + u5:p32 + u5:p33 + u5:p34 + u5:p35 + u5:p36 + u5:p37 + u5:p38 + u245:p0 = 1
invariant :u96:p228 + u245:p0 = 1
invariant :u27:p159 + u245:p0 = 1
invariant :u90:p222 + u245:p0 = 1
invariant :u2:p8 + u2:p9 + u2:p10 + u2:p11 + u2:p12 + u2:p13 + u2:p14 + u245:p0 = 1
invariant :u48:p180 + u245:p0 = 1
invariant :u74:p206 + u245:p0 = 1
invariant :u200:p332 + u245:p0 = 1
invariant :u138:p270 + u245:p0 = 1
invariant :u227:p359 + u245:p0 = 1
invariant :u175:p307 + u245:p0 = 1
invariant :u188:p320 + u245:p0 = 1
invariant :u67:p199 + u245:p0 = 1
invariant :u154:p286 + u245:p0 = 1
invariant :u16:p139 + u16:p140 + u16:p141 + u16:p142 + u16:p143 + u16:p144 + u16:p145 + u16:p146 + u16:p147 + u16:p148 + u245:p0 = 1
invariant :u124:p256 + u245:p0 = 1
invariant :u185:p317 + u245:p0 = 1
invariant :u187:p319 + u245:p0 = 1
invariant :u107:p239 + u245:p0 = 1
invariant :u144:p276 + u245:p0 = 1
invariant :u98:p230 + u245:p0 = 1
invariant :u117:p249 + u245:p0 = 1
invariant :u207:p339 + u245:p0 = 1
invariant :u181:p313 + u245:p0 = 1
invariant :u130:p262 + u245:p0 = 1
invariant :u89:p221 + u245:p0 = 1
invariant :u66:p198 + u245:p0 = 1
invariant :u26:p158 + u245:p0 = 1
invariant :u230:p362 + u245:p0 = 1
invariant :u195:p327 + u245:p0 = 1
invariant :u10:p79 + u10:p80 + u10:p81 + u10:p82 + u10:p83 + u10:p84 + u10:p85 + u10:p86 + u10:p87 + u10:p88 + u245:p0 = 1
invariant :u52:p184 + u245:p0 = 1
invariant :u99:p231 + u245:p0 = 1
invariant :u177:p309 + u245:p0 = 1
invariant :u33:p165 + u245:p0 = 1
invariant :u85:p217 + u245:p0 = 1
invariant :u213:p345 + u245:p0 = 1
invariant :u242:p374 + u245:p0 = 1
invariant :u162:p294 + u245:p0 = 1
invariant :u72:p204 + u245:p0 = 1
invariant :u95:p227 + u245:p0 = 1
invariant :u34:p166 + u245:p0 = 1
invariant :u201:p333 + u245:p0 = 1
invariant :u87:p219 + u245:p0 = 1
invariant :u76:p208 + u245:p0 = 1
invariant :u94:p226 + u245:p0 = 1
invariant :u110:p242 + u245:p0 = 1
invariant :u239:p371 + u245:p0 = 1
invariant :u209:p341 + u245:p0 = 1
invariant :u36:p168 + u245:p0 = 1
invariant :u180:p312 + u245:p0 = 1
invariant :u202:p334 + u245:p0 = 1
invariant :u21:p153 + u245:p0 = 1
invariant :u116:p248 + u245:p0 = 1
invariant :u131:p263 + u245:p0 = 1
invariant :u46:p178 + u245:p0 = 1
invariant :u163:p295 + u245:p0 = 1
invariant :u53:p185 + u245:p0 = 1
invariant :u23:p155 + u245:p0 = 1
invariant :u158:p290 + u245:p0 = 1
invariant :u97:p229 + u245:p0 = 1
invariant :u194:p326 + u245:p0 = 1
invariant :u233:p365 + u245:p0 = 1
invariant :u157:p289 + u245:p0 = 1
invariant :u218:p350 + u245:p0 = 1
invariant :u30:p162 + u245:p0 = 1
invariant :u173:p305 + u245:p0 = 1
invariant :u174:p306 + u245:p0 = 1
invariant :u224:p356 + u245:p0 = 1
invariant :u244:p376 + u245:p0 = 1
invariant :u231:p363 + u245:p0 = 1
invariant :u234:p366 + u245:p0 = 1
May 27, 2018 8:22:06 AM fr.lip6.move.gal.gal2smt.bmc.KInductionSolver computeAndDeclareInvariants
INFO: Computed 244 place invariants in 195 ms
invariant :u139:p271 + u245:p0 = 1
invariant :u155:p287 + u245:p0 = 1
invariant :u140:p272 + u245:p0 = 1
invariant :u111:p243 + u245:p0 = 1
invariant :u29:p161 + u245:p0 = 1
invariant :u103:p235 + u245:p0 = 1
invariant :u204:p336 + u245:p0 = 1
invariant :u28:p160 + u245:p0 = 1
invariant :u165:p297 + u245:p0 = 1
invariant :u19:p151 + u245:p0 = 1
invariant :u114:p246 + u245:p0 = 1
invariant :u43:p175 + u245:p0 = 1
invariant :u82:p214 + u245:p0 = 1
invariant :u39:p171 + u245:p0 = 1
invariant :u64:p196 + u245:p0 = 1
invariant :u146:p278 + u245:p0 = 1
invariant :u11:p89 + u11:p90 + u11:p91 + u11:p92 + u11:p93 + u11:p94 + u11:p95 + u11:p96 + u11:p97 + u11:p98 + u245:p0 = 1
invariant :u112:p244 + u245:p0 = 1
invariant :u3:p15 + u3:p16 + u3:p17 + u3:p18 + u3:p19 + u3:p20 + u3:p21 + u245:p0 = 1
invariant :u50:p182 + u245:p0 = 1
invariant :u71:p203 + u245:p0 = 1
invariant :u113:p245 + u245:p0 = 1
invariant :u8:p59 + u8:p60 + u8:p61 + u8:p62 + u8:p63 + u8:p64 + u8:p65 + u8:p66 + u8:p67 + u8:p68 + u245:p0 = 1
invariant :u222:p354 + u245:p0 = 1
invariant :u45:p177 + u245:p0 = 1
invariant :u143:p275 + u245:p0 = 1
invariant :u41:p173 + u245:p0 = 1
invariant :u7:p49 + u7:p50 + u7:p51 + u7:p52 + u7:p53 + u7:p54 + u7:p55 + u7:p56 + u7:p57 + u7:p58 + u245:p0 = 1
invariant :u120:p252 + u245:p0 = 1
invariant :u164:p296 + u245:p0 = 1
invariant :u229:p361 + u245:p0 = 1
invariant :u178:p310 + u245:p0 = 1
invariant :u18:p150 + u245:p0 = 1
invariant :u24:p156 + u245:p0 = 1
invariant :u193:p325 + u245:p0 = 1
invariant :u238:p370 + u245:p0 = 1
invariant :u192:p324 + u245:p0 = 1
invariant :u151:p283 + u245:p0 = 1
invariant :u101:p233 + u245:p0 = 1
invariant :u141:p273 + u245:p0 = 1
invariant :u228:p360 + u245:p0 = 1
invariant :u100:p232 + u245:p0 = 1
invariant :u20:p152 + u245:p0 = 1
invariant :u145:p277 + u245:p0 = 1
invariant :u191:p323 + u245:p0 = 1
invariant :u189:p321 + u245:p0 = 1
invariant :u15:p129 + u15:p130 + u15:p131 + u15:p132 + u15:p133 + u15:p134 + u15:p135 + u15:p136 + u15:p137 + u15:p138 + u245:p0 = 1
invariant :u211:p343 + u245:p0 = 1
invariant :u168:p300 + u245:p0 = 1
invariant :u210:p342 + u245:p0 = 1
invariant :u83:p215 + u245:p0 = 1
May 27, 2018 8:22:08 AM fr.lip6.move.gal.gal2smt.bmc.KInductionSolver init
INFO: Proved 377 variables to be positive in 1840 ms
May 27, 2018 8:22:08 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver computeAblingMatrix
INFO: Computing symmetric may disable matrix : 2713 transitions.
May 27, 2018 8:22:08 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of disable matrix completed :0/2713 took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
May 27, 2018 8:22:08 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of Complete disable matrix. took 306 ms. Total solver calls (SAT/UNSAT): 0(0/0)
May 27, 2018 8:22:08 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver computeAblingMatrix
INFO: Computing symmetric may enable matrix : 2713 transitions.
May 27, 2018 8:22:08 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of Complete enable matrix. took 255 ms. Total solver calls (SAT/UNSAT): 0(0/0)
4 unique states visited
4 strongly connected components in search stack
5 transitions explored
4 items max in DFS search stack
708 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,7.2896,101428,1,0,68728,1134,11749,82114,445,2102,145398
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA DLCround-PT-11a-LTLCardinality-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 1 : !((X(X(F(X("((u16.p146==0)||(u76.p208==1))"))))))
Formula 1 simplified : !XXFX"((u16.p146==0)||(u76.p208==1))"
4 unique states visited
0 strongly connected components in search stack
3 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,7.40132,106812,1,0,80269,1134,11775,94241,446,2517,167686
no accepting run found
Formula 1 is TRUE no accepting run found.
FORMULA DLCround-PT-11a-LTLCardinality-01 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 2 : !((G(G("(u5.p29>=3)"))))
Formula 2 simplified : !G"(u5.p29>=3)"
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 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,7.43331,107076,1,0,80269,1134,11795,94241,448,2517,168102
an accepting run exists (use option '-e' to print it)
Formula 2 is FALSE accepting run found.
FORMULA DLCround-PT-11a-LTLCardinality-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 3 : !(((("((u73.p205==0)||(u40.p172==1))")U("(u91.p223>=1)"))U("(u10.p82>=2)")))
Formula 3 simplified : !(("((u73.p205==0)||(u40.p172==1))" U "(u91.p223>=1)") U "(u10.p82>=2)")
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:512)
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:22:12 AM fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext transform
INFO: Built C files in 8004ms 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.(UNIXProcess.java:247)
at java.lang.ProcessImpl.start(ProcessImpl.java:134)
at java.lang.ProcessBuilder.start(ProcessBuilder.java:1029)
... 6 more
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
89 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,8.32444,123424,1,0,88047,1134,12340,102871,452,2868,181940
an accepting run exists (use option '-e' to print it)
Formula 3 is FALSE accepting run found.
FORMULA DLCround-PT-11a-LTLCardinality-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 4 : !((F((X("(u16.p141>=3)"))U(G("(u202.p334>=2)")))))
Formula 4 simplified : !F(X"(u16.p141>=3)" U G"(u202.p334>=2)")
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
335 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,11.6772,267484,1,0,509432,1134,12363,586679,452,4379,625853
an accepting run exists (use option '-e' to print it)
Formula 4 is FALSE accepting run found.
FORMULA DLCround-PT-11a-LTLCardinality-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 5 : !(("(u67.p199>=1)"))
Formula 5 simplified : !"(u67.p199>=1)"
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,11.6789,267484,1,0,509432,1134,12365,586679,452,4379,626043
an accepting run exists (use option '-e' to print it)
Formula 5 is FALSE accepting run found.
FORMULA DLCround-PT-11a-LTLCardinality-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 6 : !(("(u20.p152>=2)"))
Formula 6 simplified : !"(u20.p152>=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,11.6804,267748,1,0,509432,1134,12368,586679,452,4379,626282
an accepting run exists (use option '-e' to print it)
Formula 6 is FALSE accepting run found.
FORMULA DLCround-PT-11a-LTLCardinality-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 7 : !(("((u4.p27==0)||(u69.p201==1))"))
Formula 7 simplified : !"((u4.p27==0)||(u69.p201==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,11.6836,267748,1,0,509432,1134,12374,586679,453,4379,626529
no accepting run found
Formula 7 is TRUE no accepting run found.
FORMULA DLCround-PT-11a-LTLCardinality-07 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 8 : !((F("(u21.p153>=2)")))
Formula 8 simplified : !F"(u21.p153>=2)"
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
74 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,12.4194,282268,1,0,509635,1134,12868,587134,453,4395,629484
an accepting run exists (use option '-e' to print it)
Formula 8 is FALSE accepting run found.
FORMULA DLCround-PT-11a-LTLCardinality-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 9 : !((G(X(X("(u3.p16>=2)")))))
Formula 9 simplified : !GXX"(u3.p16>=2)"
5 unique states visited
5 strongly connected components in search stack
5 transitions explored
5 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,12.4466,283032,1,0,509792,1134,12886,587256,455,4468,631400
an accepting run exists (use option '-e' to print it)
Formula 9 is FALSE accepting run found.
FORMULA DLCround-PT-11a-LTLCardinality-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 10 : !((G(F("(u87.p219>=2)"))))
Formula 10 simplified : !GF"(u87.p219>=2)"
4 unique states visited
4 strongly connected components in search stack
5 transitions explored
4 items max in DFS search stack
57 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,13.0237,296808,1,0,509931,1134,13241,587395,455,4468,632357
an accepting run exists (use option '-e' to print it)
Formula 10 is FALSE accepting run found.
FORMULA DLCround-PT-11a-LTLCardinality-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 11 : !(((("(u205.p337>=3)")U("((u213.p345==0)||(u87.p219==1))"))U(F(G("((u16.p145==0)||(u32.p164==1))")))))
Formula 11 simplified : !(("(u205.p337>=3)" U "((u213.p345==0)||(u87.p219==1))") U FG"((u16.p145==0)||(u32.p164==1))")
1 unique states visited
0 strongly connected components in search stack
0 transitions explored
1 items max in DFS search stack
75 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,13.7701,311488,1,0,512847,1134,13793,591556,456,4581,640741
no accepting run found
Formula 11 is TRUE no accepting run found.
FORMULA DLCround-PT-11a-LTLCardinality-11 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 12 : !((G(F(G("((u242.p374==0)||(u13.p109==1))")))))
Formula 12 simplified : !GFG"((u242.p374==0)||(u13.p109==1))"
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
552 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,19.2939,528228,1,0,1.12248e+06,1134,14118,1.3032e+06,457,5875,1290573
an accepting run exists (use option '-e' to print it)
Formula 12 is FALSE accepting run found.
FORMULA DLCround-PT-11a-LTLCardinality-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 13 : !((G(G(("(u189.p321>=1)")U("((u16.p142==0)||(u1.p4==1))")))))
Formula 13 simplified : !G("(u189.p321>=1)" U "((u16.p142==0)||(u1.p4==1))")
3 unique states visited
3 strongly connected components in search stack
4 transitions explored
3 items max in DFS search stack
97 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,20.2579,546644,1,0,1.135e+06,1134,14629,1.32577e+06,457,5959,1312371
an accepting run exists (use option '-e' to print it)
Formula 13 is FALSE accepting run found.
FORMULA DLCround-PT-11a-LTLCardinality-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 14 : !((X(X(F(F("(u6.p45>=3)"))))))
Formula 14 simplified : !XXF"(u6.p45>=3)"
4 unique states visited
4 strongly connected components in search stack
4 transitions explored
4 items max in DFS search stack
267 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,22.9297,562748,1,0,1.14557e+06,1134,15093,1.33734e+06,459,5986,1329115
an accepting run exists (use option '-e' to print it)
Formula 14 is FALSE accepting run found.
FORMULA DLCround-PT-11a-LTLCardinality-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 15 : !(("((u174.p306==0)||(u176.p308==1))"))
Formula 15 simplified : !"((u174.p306==0)||(u176.p308==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,22.9323,563012,1,0,1.14557e+06,1134,15098,1.33734e+06,459,5986,1329191
no accepting run found
Formula 15 is TRUE no accepting run found.
FORMULA DLCround-PT-11a-LTLCardinality-15 TRUE 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-11a"
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-11a.tgz
mv DLCround-PT-11a 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-11a, 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-152732261700195"
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 ;