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 736K
-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.6K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 18K 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.4K May 26 09:26 LTLCardinality.txt
-rw-r--r-- 1 mcc users 11K May 26 09:26 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.8K May 26 09:26 LTLFireability.txt
-rw-r--r-- 1 mcc users 8.4K 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 2.9K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 19K 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 566K May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool irma4mcc-full
Input is DLCround-PT-09a, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r210-smll-152732260500187
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1527392800620


BK_STOP 1527392821560

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

Prefix is 65b80f64.
Reading known information in /usr/share/mcc4mcc/65b80f64-known.json.
Reading learned information in /usr/share/mcc4mcc/65b80f64-learned.json.
Reading value translations in /usr/share/mcc4mcc/65b80f64-values.json.
Using directory /home/mcc/execution for input, as it contains a model.pnml file.
Using DLCround-PT-09a 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': 6609, 'Memory': 465.01, 'Tool': 'itstools'}, {'Time': 1536629, 'Memory': 13530.52, 'Tool': 'lola'}].
Learned tools are: [{'Tool': 'lola'}].
Learned tool lola is 232.5055227719776x far from the best tool itstools.
LTLCardinality itstools DLCround-PT-09a...
May 27, 2018 3:46: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 3:46:51 AM fr.lip6.move.gal.application.MccTranslator transformPNML
INFO: Parsing pnml file : /mcc-data/model.pnml
May 27, 2018 3:46:51 AM fr.lip6.move.gal.nupn.PTNetReader loadFromXML
INFO: Load time of PNML (sax parser for PT used): 183 ms
May 27, 2018 3:46:51 AM fr.lip6.move.gal.pnml.togal.PTGALTransformer handlePage
INFO: Transformed 299 places.
May 27, 2018 3:46:51 AM fr.lip6.move.gal.pnml.togal.PTGALTransformer handlePage
INFO: Transformed 2243 transitions.
May 27, 2018 3:46:51 AM fr.lip6.move.gal.pnml.togal.PnmlToGalTransformer transform
INFO: Found NUPN structural information;
May 27, 2018 3:46:51 AM fr.lip6.move.serialization.SerializationUtil systemToFile
INFO: Time to serialize gal into /mcc-data/model.pnml.img.gal : 76 ms
May 27, 2018 3:46:51 AM fr.lip6.move.gal.application.MccTranslator applyOrder
INFO: Applying decomposition
May 27, 2018 3:46:51 AM fr.lip6.move.gal.instantiate.CompositeBuilder decomposeWithOrder
INFO: Decomposing Gal with order
May 27, 2018 3:46:52 AM fr.lip6.move.gal.instantiate.GALRewriter flatten
INFO: Flatten gal took : 629 ms
May 27, 2018 3:46:52 AM fr.lip6.move.gal.instantiate.CompositeBuilder rewriteArraysToAllowPartition
INFO: Rewriting arrays to variables to allow decomposition.
May 27, 2018 3:46:53 AM fr.lip6.move.gal.instantiate.Instantiator fuseIsomorphicEffects
INFO: Removed a total of 3706 redundant transitions.
Using solver Z3 to compute partial order matrices.
Built C files in :
/mcc-data
May 27, 2018 3:46:53 AM fr.lip6.move.serialization.SerializationUtil systemToFile
INFO: Time to serialize gal into /mcc-data/LTLCardinality.pnml.gal : 41 ms
May 27, 2018 3:46:53 AM fr.lip6.move.serialization.SerializationUtil serializePropertiesForITSLTLTools
INFO: Time to serialize properties into /mcc-data/LTLCardinality.ltl : 1 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 : !((F(X(("(u103.p217>=3)")U("(u5.p30>=2)")))))
Formula 0 simplified : !FX("(u103.p217>=3)" U "(u5.p30>=2)")
built 341 ordering constraints for composite.
May 27, 2018 3:46:53 AM fr.lip6.move.gal.semantics.CompositeNextBuilder getNextForLabel
INFO: Semantic construction discarded 216 identical transitions.
May 27, 2018 3:46:53 AM fr.lip6.move.gal.semantics.DeterministicNextBuilder getDeterministicNext
INFO: Input system was already deterministic with 2027 transitions.
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
Normalized transition count is 202
// Phase 1: matrix 202 rows 299 cols
invariant :u46:p160 + u185:p0 = 1
invariant :u76:p190 + u185:p0 = 1
invariant :u62:p176 + u185:p0 = 1
invariant :u107:p221 + u185:p0 = 1
invariant :u96:p210 + u185:p0 = 1
invariant :u10:p79 + u10:p80 + u10:p81 + u10:p82 + u10:p83 + u10:p84 + u10:p85 + u10:p86 + u10:p87 + u10:p88 + u185:p0 = 1
invariant :u63:p177 + u185:p0 = 1
invariant :u111:p225 + u185:p0 = 1
invariant :u3:p15 + u3:p16 + u3:p17 + u3:p18 + u3:p19 + u3:p20 + u3:p21 + u185:p0 = 1
invariant :u163:p277 + u185:p0 = 1
invariant :u87:p201 + u185:p0 = 1
invariant :u160:p274 + u185:p0 = 1
invariant :u110:p224 + u185:p0 = 1
invariant :u26:p140 + u185:p0 = 1
invariant :u58:p172 + u185:p0 = 1
invariant :u148:p262 + u185:p0 = 1
invariant :u59:p173 + u185:p0 = 1
invariant :u19:p133 + u185:p0 = 1
invariant :u157:p271 + u185:p0 = 1
invariant :u32:p146 + u185:p0 = 1
invariant :u126:p240 + u185:p0 = 1
invariant :u90:p204 + u185:p0 = 1
invariant :u45:p159 + u185:p0 = 1
invariant :u124:p238 + u185:p0 = 1
invariant :u14:p119 + u14:p120 + u14:p121 + u14:p122 + u14:p123 + u14:p124 + u14:p125 + u14:p126 + u14:p127 + u14:p128 + u185:p0 = 1
invariant :u104:p218 + u185:p0 = 1
invariant :u169:p283 + u185:p0 = 1
invariant :u20:p134 + u185:p0 = 1
invariant :u178:p292 + u185:p0 = 1
invariant :u139:p253 + u185:p0 = 1
invariant :u12:p99 + u12:p100 + u12:p101 + u12:p102 + u12:p103 + u12:p104 + u12:p105 + u12:p106 + u12:p107 + u12:p108 + u185:p0 = 1
invariant :u68:p182 + u185:p0 = 1
invariant :u4:p22 + u4:p23 + u4:p24 + u4:p25 + u4:p26 + u4:p27 + u4:p28 + u185:p0 = 1
invariant :u41:p155 + u185:p0 = 1
invariant :u81:p195 + u185:p0 = 1
invariant :u168:p282 + u185:p0 = 1
invariant :u40:p154 + u185:p0 = 1
invariant :u77:p191 + u185:p0 = 1
invariant :u181:p295 + u185:p0 = 1
invariant :u11:p89 + u11:p90 + u11:p91 + u11:p92 + u11:p93 + u11:p94 + u11:p95 + u11:p96 + u11:p97 + u11:p98 + u185:p0 = 1
invariant :u129:p243 + u185:p0 = 1
invariant :u151:p265 + u185:p0 = 1
invariant :u23:p137 + u185:p0 = 1
invariant :u7:p49 + u7:p50 + u7:p51 + u7:p52 + u7:p53 + u7:p54 + u7:p55 + u7:p56 + u7:p57 + u7:p58 + u185:p0 = 1
invariant :u174:p288 + u185:p0 = 1
invariant :u79:p193 + u185:p0 = 1
invariant :u95:p209 + u185:p0 = 1
invariant :u112:p226 + u185:p0 = 1
invariant :u101:p215 + u185:p0 = 1
invariant :u51:p165 + u185:p0 = 1
invariant :u61:p175 + u185:p0 = 1
invariant :u44:p158 + u185:p0 = 1
invariant :u43:p157 + u185:p0 = 1
invariant :u73:p187 + u185:p0 = 1
invariant :u116:p230 + u185:p0 = 1
invariant :u172:p286 + u185:p0 = 1
invariant :u54:p168 + u185:p0 = 1
invariant :u22:p136 + u185:p0 = 1
invariant :u48:p162 + u185:p0 = 1
invariant :u177:p291 + u185:p0 = 1
invariant :u86:p200 + u185:p0 = 1
invariant :u109:p223 + u185:p0 = 1
invariant :u176:p290 + u185:p0 = 1
invariant :u162:p276 + u185:p0 = 1
invariant :u1:p1 + u1:p2 + u1:p3 + u1:p4 + u1:p5 + u1:p6 + u1:p7 + u185:p0 = 1
invariant :u92:p206 + u185:p0 = 1
invariant :u33:p147 + u185:p0 = 1
invariant :u141:p255 + u185:p0 = 1
invariant :u34:p148 + u185:p0 = 1
invariant :u50:p164 + u185:p0 = 1
invariant :u155:p269 + u185:p0 = 1
invariant :u75:p189 + u185:p0 = 1
invariant :u149:p263 + u185:p0 = 1
invariant :u88:p202 + u185:p0 = 1
invariant :u13:p109 + u13:p110 + u13:p111 + u13:p112 + u13:p113 + u13:p114 + u13:p115 + u13:p116 + u13:p117 + u13:p118 + u185:p0 = 1
invariant :u161:p275 + u185:p0 = 1
invariant :u152:p266 + u185:p0 = 1
invariant :u71:p185 + u185:p0 = 1
invariant :u103:p217 + u185:p0 = 1
invariant :u98:p212 + u185:p0 = 1
invariant :u37:p151 + u185:p0 = 1
invariant :u173:p287 + u185:p0 = 1
invariant :u67:p181 + u185:p0 = 1
invariant :u114:p228 + u185:p0 = 1
invariant :u49:p163 + u185:p0 = 1
invariant :u164:p278 + u185:p0 = 1
invariant :u24:p138 + u185:p0 = 1
invariant :u36:p150 + u185:p0 = 1
invariant :u30:p144 + u185:p0 = 1
invariant :u140:p254 + u185:p0 = 1
invariant :u2:p8 + u2:p9 + u2:p10 + u2:p11 + u2:p12 + u2:p13 + u2:p14 + u185:p0 = 1
invariant :u78:p192 + u185:p0 = 1
invariant :u167:p281 + u185:p0 = 1
invariant :u115:p229 + u185:p0 = 1
invariant :u128:p242 + u185:p0 = 1
invariant :u94:p208 + u185:p0 = 1
invariant :u64:p178 + u185:p0 = 1
invariant :u125:p239 + u185:p0 = 1
invariant :u127:p241 + u185:p0 = 1
invariant :u47:p161 + u185:p0 = 1
invariant :u84:p198 + u185:p0 = 1
invariant :u38:p152 + u185:p0 = 1
invariant :u57:p171 + u185:p0 = 1
invariant :u147:p261 + u185:p0 = 1
invariant :u121:p235 + u185:p0 = 1
May 27, 2018 3:46:55 AM fr.lip6.move.gal.gal2smt.bmc.KInductionSolver computeAndDeclareInvariants
INFO: Computed 184 place invariants in 135 ms
invariant :u70:p184 + u185:p0 = 1
invariant :u29:p143 + u185:p0 = 1
invariant :u170:p284 + u185:p0 = 1
invariant :u135:p249 + u185:p0 = 1
invariant :u39:p153 + u185:p0 = 1
invariant :u117:p231 + u185:p0 = 1
invariant :u25:p139 + u185:p0 = 1
invariant :u153:p267 + u185:p0 = 1
invariant :u182:p296 + u185:p0 = 1
invariant :u35:p149 + u185:p0 = 1
invariant :u102:p216 + u185:p0 = 1
invariant :u145:p259 + u185:p0 = 1
invariant :u175:p289 + u185:p0 = 1
invariant :u83:p197 + u185:p0 = 1
invariant :u106:p220 + u185:p0 = 1
invariant :u60:p174 + u185:p0 = 1
invariant :u118:p232 + u185:p0 = 1
invariant :u17:p131 + u185:p0 = 1
invariant :u136:p250 + u185:p0 = 1
invariant :u72:p186 + u185:p0 = 1
invariant :u89:p203 + u185:p0 = 1
invariant :u133:p247 + u185:p0 = 1
invariant :u132:p246 + u185:p0 = 1
invariant :u55:p169 + u185:p0 = 1
invariant :u119:p233 + u185:p0 = 1
invariant :u91:p205 + u185:p0 = 1
invariant :u85:p199 + u185:p0 = 1
invariant :u137:p251 + u185:p0 = 1
invariant :u65:p179 + u185:p0 = 1
invariant :u138:p252 + u185:p0 = 1
invariant :u131:p245 + u185:p0 = 1
invariant :u108:p222 + u185:p0 = 1
invariant :u150:p264 + u185:p0 = 1
invariant :u130:p244 + u185:p0 = 1
invariant :u154:p268 + u185:p0 = 1
invariant :u80:p194 + u185:p0 = 1
invariant :u144:p258 + u185:p0 = 1
invariant :u105:p219 + u185:p0 = 1
invariant :u166:p280 + u185:p0 = 1
invariant :u146:p260 + u185:p0 = 1
invariant :u183:p297 + u185:p0 = 1
invariant :u42:p156 + u185:p0 = 1
invariant :u99:p213 + u185:p0 = 1
invariant :u52:p166 + u185:p0 = 1
invariant :u74:p188 + u185:p0 = 1
invariant :u9:p69 + u9:p70 + u9:p71 + u9:p72 + u9:p73 + u9:p74 + u9:p75 + u9:p76 + u9:p77 + u9:p78 + u185:p0 = 1
invariant :u123:p237 + u185:p0 = 1
invariant :u53:p167 + u185:p0 = 1
invariant :u6:p39 + u6:p40 + u6:p41 + u6:p42 + u6:p43 + u6:p44 + u6:p45 + u6:p46 + u6:p47 + u6:p48 + u185:p0 = 1
invariant :u27:p141 + u185:p0 = 1
invariant :u180:p294 + u185:p0 = 1
invariant :u16:p130 + u185:p0 = 1
invariant :u179:p293 + u185:p0 = 1
invariant :u18:p132 + u185:p0 = 1
invariant :u93:p207 + u185:p0 = 1
invariant :u66:p180 + u185:p0 = 1
invariant :u120:p234 + u185:p0 = 1
invariant :u21:p135 + u185:p0 = 1
invariant :u156:p270 + u185:p0 = 1
invariant :u69:p183 + u185:p0 = 1
invariant :u142:p256 + u185:p0 = 1
invariant :u82:p196 + u185:p0 = 1
invariant :u8:p59 + u8:p60 + u8:p61 + u8:p62 + u8:p63 + u8:p64 + u8:p65 + u8:p66 + u8:p67 + u8:p68 + u185:p0 = 1
invariant :u100:p214 + u185:p0 = 1
invariant :u122:p236 + u185:p0 = 1
invariant :u56:p170 + u185:p0 = 1
invariant :u143:p257 + u185:p0 = 1
invariant :u134:p248 + u185:p0 = 1
invariant :u31:p145 + u185:p0 = 1
invariant :u28:p142 + u185:p0 = 1
invariant :u97:p211 + u185:p0 = 1
invariant :u158:p272 + u185:p0 = 1
invariant :u113:p227 + u185:p0 = 1
invariant :u159:p273 + u185:p0 = 1
invariant :u5:p29 + u5:p30 + u5:p31 + u5:p32 + u5:p33 + u5:p34 + u5:p35 + u5:p36 + u5:p37 + u5:p38 + u185:p0 = 1
invariant :u15:p129 + u185:p0 = 1
invariant :u165:p279 + u185:p0 = 1
invariant :u171:p285 + u185:p0 = 1
invariant :u184:p298 + u185:p0 = 1
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
May 27, 2018 3:46:56 AM fr.lip6.move.gal.gal2smt.bmc.KInductionSolver init
INFO: Proved 299 variables to be positive in 1528 ms
May 27, 2018 3:46:56 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver computeAblingMatrix
INFO: Computing symmetric may disable matrix : 2027 transitions.
May 27, 2018 3:46:56 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of disable matrix completed :0/2027 took 11 ms. Total solver calls (SAT/UNSAT): 0(0/0)
May 27, 2018 3:46:56 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of Complete disable matrix. took 222 ms. Total solver calls (SAT/UNSAT): 0(0/0)
May 27, 2018 3:46:56 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver computeAblingMatrix
INFO: Computing symmetric may enable matrix : 2027 transitions.
May 27, 2018 3:46:56 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of Complete enable matrix. took 195 ms. Total solver calls (SAT/UNSAT): 0(0/0)
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
321 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.33809,49052,1,0,16976,898,8432,16552,427,1145,58596
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA DLCround-PT-09a-LTLCardinality-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 1 : !((G(G("(u14.p123>=1)"))))
Formula 1 simplified : !G"(u14.p123>=1)"
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 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,3.66967,57532,1,0,16996,898,8757,16573,428,1145,59368
an accepting run exists (use option '-e' to print it)
Formula 1 is FALSE accepting run found.
FORMULA DLCround-PT-09a-LTLCardinality-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 2 : !(("((u185.p0==0)||(u165.p279==1))"))
Formula 2 simplified : !"((u185.p0==0)||(u165.p279==1))"
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,3.67445,57796,1,0,16996,898,8764,16573,430,1145,59393
an accepting run exists (use option '-e' to print it)
Formula 2 is FALSE accepting run found.
FORMULA DLCround-PT-09a-LTLCardinality-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 3 : !((G((G("((u10.p81==0)||(u14.p127==1))"))U("(u1.p7>=1)"))))
Formula 3 simplified : !G(G"((u10.p81==0)||(u14.p127==1))" U "(u1.p7>=1)")
4 unique states visited
4 strongly connected components in search stack
5 transitions explored
4 items max in DFS search stack
155 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.23055,80328,1,0,42981,898,9490,52919,433,4944,98762
an accepting run exists (use option '-e' to print it)
Formula 3 is FALSE accepting run found.
FORMULA DLCround-PT-09a-LTLCardinality-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 4 : !((G(G("(u175.p289>=2)"))))
Formula 4 simplified : !G"(u175.p289>=2)"
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 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,5.2555,80592,1,0,42981,898,9508,52919,435,4944,98786
an accepting run exists (use option '-e' to print it)
Formula 4 is FALSE accepting run found.
FORMULA DLCround-PT-09a-LTLCardinality-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 5 : !(((("(u63.p177>=1)")U("(u14.p128>=1)"))U(X("((u50.p164==0)||(u7.p54==1))"))))
Formula 5 simplified : !(("(u63.p177>=1)" U "(u14.p128>=1)") U X"((u50.p164==0)||(u7.p54==1))")
4 unique states visited
4 strongly connected components in search stack
4 transitions explored
4 items max in DFS search stack
7 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.32583,81608,1,0,44082,898,9531,54163,438,4949,105606
an accepting run exists (use option '-e' to print it)
Formula 5 is FALSE accepting run found.
FORMULA DLCround-PT-09a-LTLCardinality-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 6 : !(("((u76.p190==0)||(u129.p243==1))"))
Formula 6 simplified : !"((u76.p190==0)||(u129.p243==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,5.33087,81872,1,0,44082,898,9536,54163,438,4949,105727
no accepting run found
Formula 6 is TRUE no accepting run found.
FORMULA DLCround-PT-09a-LTLCardinality-06 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 7 : !(("(u4.p25>=2)"))
Formula 7 simplified : !"(u4.p25>=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,5.33332,81872,1,0,44082,898,9539,54163,438,4949,105911
an accepting run exists (use option '-e' to print it)
Formula 7 is FALSE accepting run found.
FORMULA DLCround-PT-09a-LTLCardinality-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 8 : !((F(X(X(G("((u10.p79==0)||(u146.p260==1))"))))))
Formula 8 simplified : !FXXG"((u10.p79==0)||(u146.p260==1))"
3 unique states visited
0 strongly connected components in search stack
2 transitions explored
3 items max in DFS search stack
30 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.63087,88208,1,0,48951,898,9697,59669,439,5102,113106
no accepting run found
Formula 8 is TRUE no accepting run found.
FORMULA DLCround-PT-09a-LTLCardinality-08 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 9 : !(("(u134.p248>=1)"))
Formula 9 simplified : !"(u134.p248>=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,5.63318,88208,1,0,48951,898,9699,59669,439,5102,113159
an accepting run exists (use option '-e' to print it)
Formula 9 is FALSE accepting run found.
FORMULA DLCround-PT-09a-LTLCardinality-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 10 : !(((F("(u134.p248>=1)"))U(F(X("(u152.p266>=1)")))))
Formula 10 simplified : !(F"(u134.p248>=1)" U FX"(u152.p266>=1)")
2 unique states visited
0 strongly connected components in search stack
1 transitions explored
2 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,5.65988,88456,1,0,48951,898,9717,59669,439,5102,113200
no accepting run found
Formula 10 is TRUE no accepting run found.
FORMULA DLCround-PT-09a-LTLCardinality-10 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 11 : !((F("(u3.p18>=3)")))
Formula 11 simplified : !F"(u3.p18>=3)"
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
48 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,6.14181,95320,1,0,49550,898,10076,60821,441,5103,116802
an accepting run exists (use option '-e' to print it)
Formula 11 is FALSE accepting run found.
FORMULA DLCround-PT-09a-LTLCardinality-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 12 : !(((("(u42.p156>=1)")U("(u144.p258>=2)"))U(("((u5.p35==0)||(u30.p144==1))")U("((u93.p207==0)||(u6.p41==1))"))))
Formula 12 simplified : !(("(u42.p156>=1)" U "(u144.p258>=2)") U ("((u5.p35==0)||(u30.p144==1))" U "((u93.p207==0)||(u6.p41==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,6.15931,96280,1,0,49550,898,10130,60821,443,5103,117191
no accepting run found
Formula 12 is TRUE no accepting run found.
FORMULA DLCround-PT-09a-LTLCardinality-12 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 13 : !(("((u47.p161==0)||(u9.p72==1))"))
Formula 13 simplified : !"((u47.p161==0)||(u9.p72==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,6.16208,96280,1,0,49550,898,10135,60821,443,5103,117345
no accepting run found
Formula 13 is TRUE no accepting run found.
FORMULA DLCround-PT-09a-LTLCardinality-13 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 14 : !((X(X(X(F("((u10.p84==0)||(u52.p166==1))"))))))
Formula 14 simplified : !XXXF"((u10.p84==0)||(u52.p166==1))"
4 unique states visited
0 strongly connected components in search stack
3 transitions explored
4 items max in DFS search stack
8 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,6.23479,98392,1,0,55281,898,10157,66986,444,5148,124366
no accepting run found
Formula 14 is TRUE no accepting run found.
FORMULA DLCround-PT-09a-LTLCardinality-14 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 15 : !(((F("(u5.p31>=3)"))U(G(X("((u172.p286==0)||(u179.p293==1))")))))
Formula 15 simplified : !(F"(u5.p31>=3)" U GX"((u172.p286==0)||(u179.p293==1))")
4 unique states visited
0 strongly connected components in search stack
6 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,6.27386,98892,1,0,55341,898,10182,67046,446,5150,125180
no accepting run found
Formula 15 is TRUE no accepting run found.
FORMULA DLCround-PT-09a-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-09a"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="irma4mcc-full"
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-09a.tgz
mv DLCround-PT-09a 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-full"
echo " Input is DLCround-PT-09a, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r210-smll-152732260500187"
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 ;