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 216K
-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.7K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 16K 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 6.0K May 15 18:50 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 2.5K 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 2.0K May 26 09:26 LTLFireability.txt
-rw-r--r-- 1 mcc users 8.1K May 26 09:26 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 19K May 15 18:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 115 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 353 May 15 18:54 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 2.7K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 13K May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 15 18:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 15 18:54 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 15 18:50 equiv_pt
-rw-r--r-- 1 mcc users 3 May 15 18:50 instance
-rw-r--r-- 1 mcc users 5 May 15 18:50 iscolored
-rw-r--r-- 1 mcc users 54K May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool lola
Input is PermAdmissibility-COL-50, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r256-csrt-152732582900133
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1527433595712

info: Time: 3600 - MCC
===========================================================================================
prep: translating PermAdmissibility-COL-50 Petri net model.pnml into LoLA format
===========================================================================================
prep: translating COL Petri net complete
prep: check for too many tokens
===========================================================================================
prep: translating PermAdmissibility-COL-50 formula LTLCardinality into LoLA format
===========================================================================================
prep: translating COL formula complete
vrfy: Checking LTLCardinality @ PermAdmissibility-COL-50 @ 3570 seconds
lola: LoLA will run for 3570 seconds at most (--timelimit)
lola: NET
lola: reading net from model.pnml.lola
lola: finished parsing
lola: closed net file model.pnml.lola
lola: 1232/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 6656
lola: finding significant places
lola: 208 places, 1024 transitions, 177 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 1460 transition conflict sets
lola: TASK
lola: reading formula from PermAdmissibility-COL-50-LTLCardinality.task
lola: place invariant simplifies atomic proposition
lola: before: (p175 + p176 + p177 + p178 + p179 + p180 + p181 + p182 <= p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16)
lola: after: (0 <= 0)
lola: always true
lola: LP says that atomic proposition is always true: (p114 <= p26 + p27 + p28 + p29 + p30 + p31 + p32 + p33)
lola: A (((p45 + p46 + p47 + p48 + p49 + p50 + p51 + p52 <= p167 + p168 + p169 + p170 + p171 + p172 + p173 + p174) U G ((p123 + p124 + p125 + p126 + p127 + p128 + p129 + p130 <= p53 + p54 + p55 + p56 + p57 + p58 + p59 + p60)))) : A ((p85 + p84 + p83 + p82 + p81 + p80 + p79 + p86 <= p0)) : A (F (F (F ((2 <= p191))))) : A ((p45 + p46 + p47 + p48 + p49 + p50 + p51 + p52 <= p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16)) : A ((X ((p140 <= p131)) U X (F ((1 <= p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8))))) : A (F ((X (TRUE) U G ((3 <= p166))))) : A ((1 <= p132 + p133 + p134 + p135 + p136 + p137 + p138 + p139)) : A (X ((3 <= p78))) : A (((3 <= p166) U X (F ((p123 + p124 + p125 + p126 + p127 + p128 + p129 + p130 <= p167 + p168 + p169 + p170 + p171 + p172 + p173 + p174))))) : A (X ((F ((3 <= p114)) U X ((3 <= p150 + p151 + p152 + p153 + p154 + p155 + p156 + p157))))) : A ((p123 + p124 + p125 + p126 + p127 + p128 + p129 + p130 <= p53 + p54 + p55 + p56 + p57 + p58 + p59 + p60)) : A (TRUE) : A (G (F (((p103 + p104 + p105 + p106 + p107 + p108 + p109 + p110 <= p85 + p84 + p83 + p82 + p81 + p80 + p79 + p86) U (p75 + p74 + p73 + p72 + p71 + p70 + p69 + p76 <= p34))))) : A (G (((2 <= p103 + p104 + p105 + p106 + p107 + p108 + p109 + p110) U X ((2 <= p166))))) : A ((G ((3 <= p183 + p184 + p185 + p186 + p187 + p188 + p189 + p190)) U G ((p77 <= p166)))) : A ((X (G ((p192 + p193 + p194 + p195 + p196 + p197 + p198 + p199 <= p191))) U G ((2 <= p140))))
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:410
lola: rewrite Frontend/Parser/formula_rewrite.k:422
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:434
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:434
lola: rewrite Frontend/Parser/formula_rewrite.k:437
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:522
lola: rewrite Frontend/Parser/formula_rewrite.k:545
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 219 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (p85 + p84 + p83 + p82 + p81 + p80 + p79 + p86 <= p0)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p85 + p84 + p83 + p82 + p81 + p80 + p79 + p86 <= p0)
lola: processed formula length: 53
lola: 20 rewrites
lola: closed formula file PermAdmissibility-COL-50-LTLCardinality.task
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================

FORMULA PermAdmissibility-COL-50-LTLCardinality-1 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 1 will run for 233 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (p45 + p46 + p47 + p48 + p49 + p50 + p51 + p52 <= p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p45 + p46 + p47 + p48 + p49 + p50 + p51 + p52 <= p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16)
lola: processed formula length: 95
lola: 20 rewrites
lola: closed formula file PermAdmissibility-COL-50-LTLCardinality.task
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================

FORMULA PermAdmissibility-COL-50-LTLCardinality-3 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 2 will run for 250 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (1 <= p132 + p133 + p134 + p135 + p136 + p137 + p138 + p139)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (1 <= p132 + p133 + p134 + p135 + p136 + p137 + p138 + p139)
lola: processed formula length: 60
lola: 20 rewrites
lola: closed formula file PermAdmissibility-COL-50-LTLCardinality.task
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges

FORMULA PermAdmissibility-COL-50-LTLCardinality-6 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 3 will run for 269 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (p123 + p124 + p125 + p126 + p127 + p128 + p129 + p130 <= p53 + p54 + p55 + p56 + p57 + p58 + p59 + p60)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p123 + p124 + p125 + p126 + p127 + p128 + p129 + p130 <= p53 + p54 + p55 + p56 + p57 + p58 + p59 + p60)
lola: processed formula length: 104
lola: 20 rewrites
lola: closed formula file PermAdmissibility-COL-50-LTLCardinality.task
lola: processed formula with 1 atomic propositions
lola: ========================================
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================

FORMULA PermAdmissibility-COL-50-LTLCardinality-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 4 will run for 292 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: TRUE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: TRUE
lola: processed formula length: 4
lola: 20 rewrites
lola: closed formula file PermAdmissibility-COL-50-LTLCardinality.task
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================

FORMULA PermAdmissibility-COL-50-LTLCardinality-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 5 will run for 318 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (((3 <= p166) U X (F ((p123 + p124 + p125 + p126 + p127 + p128 + p129 + p130 <= p167 + p168 + p169 + p170 + p171 + p172 + p173 + p174)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (((3 <= p166) U X (F ((p123 + p124 + p125 + p126 + p127 + p128 + p129 + p130 <= p167 + p168 + p169 + p170 + p171 + p172 + p173 + p174)))))
lola: processed formula length: 140
lola: 20 rewrites
lola: closed formula file PermAdmissibility-COL-50-LTLCardinality.task
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 9 markings, 8 edges
lola: ========================================

FORMULA PermAdmissibility-COL-50-LTLCardinality-8 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 6 will run for 350 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X ((F ((3 <= p114)) U X ((3 <= p150 + p151 + p152 + p153 + p154 + p155 + p156 + p157)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X ((F ((3 <= p114)) U X ((3 <= p150 + p151 + p152 + p153 + p154 + p155 + p156 + p157)))))
lola: processed formula length: 92
lola: 20 rewrites
lola: closed formula file PermAdmissibility-COL-50-LTLCardinality.task
lola: the resulting Büchi automaton has 5 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 801 markings, 801 edges
lola: ========================================

FORMULA PermAdmissibility-COL-50-LTLCardinality-9 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 7 will run for 389 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (F ((1 <= p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (F ((1 <= p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8))))
lola: processed formula length: 56
lola: 20 rewrites
lola: closed formula file PermAdmissibility-COL-50-LTLCardinality.task
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: 1237156 markings, 1363172 edges, 247431 markings/sec, 0 secs
lola: 2467482 markings, 2729908 edges, 246065 markings/sec, 5 secs
lola: 3683395 markings, 4097655 edges, 243183 markings/sec, 10 secs
lola: 4919411 markings, 5491147 edges, 247203 markings/sec, 15 secs
lola: 6096201 markings, 6851939 edges, 235358 markings/sec, 20 secs
lola: 7183243 markings, 8132749 edges, 217408 markings/sec, 25 secs
lola: 8118365 markings, 9457208 edges, 187024 markings/sec, 30 secs
lola: 9061826 markings, 10817156 edges, 188692 markings/sec, 35 secs
lola: 10012517 markings, 12104616 edges, 190138 markings/sec, 40 secs
lola: 11044874 markings, 13364696 edges, 206471 markings/sec, 45 secs
lola: 12064056 markings, 14606802 edges, 203836 markings/sec, 50 secs
lola: 13064723 markings, 15835683 edges, 200133 markings/sec, 55 secs
lola: 14069573 markings, 17039382 edges, 200970 markings/sec, 60 secs
lola: 15156310 markings, 18291094 edges, 217347 markings/sec, 65 secs
lola: 16335793 markings, 19597707 edges, 235897 markings/sec, 70 secs
lola: 17540483 markings, 20951187 edges, 240938 markings/sec, 75 secs
lola: 18683964 markings, 22273463 edges, 228696 markings/sec, 80 secs
lola: 19691857 markings, 23627222 edges, 201579 markings/sec, 85 secs
lola: 20639489 markings, 24919924 edges, 189526 markings/sec, 90 secs
lola: 21638580 markings, 26141255 edges, 199818 markings/sec, 95 secs
lola: 22786400 markings, 27422998 edges, 229564 markings/sec, 100 secs
lola: 24006687 markings, 28759827 edges, 244057 markings/sec, 105 secs
lola: 25185323 markings, 30068802 edges, 235727 markings/sec, 110 secs
lola: 26377431 markings, 31397225 edges, 238422 markings/sec, 115 secs
lola: 27588059 markings, 32769201 edges, 242126 markings/sec, 120 secs
lola: 28761154 markings, 34132218 edges, 234619 markings/sec, 125 secs
lola: 29869456 markings, 35604102 edges, 221660 markings/sec, 130 secs
lola: 30829364 markings, 36986043 edges, 191982 markings/sec, 135 secs
lola: 31699921 markings, 38153583 edges, 174111 markings/sec, 140 secs
lola: 32673804 markings, 39319585 edges, 194777 markings/sec, 145 secs
lola: 33642209 markings, 40492662 edges, 193681 markings/sec, 150 secs
lola: 34597881 markings, 41643794 edges, 191134 markings/sec, 155 secs
lola: 35582297 markings, 42832506 edges, 196883 markings/sec, 160 secs
lola: 36611521 markings, 44069689 edges, 205845 markings/sec, 165 secs
lola: 37567666 markings, 45222286 edges, 191229 markings/sec, 170 secs
lola: 38523732 markings, 46359891 edges, 191213 markings/sec, 175 secs
lola: 39551538 markings, 47552017 edges, 205561 markings/sec, 180 secs
lola: 40760288 markings, 48878353 edges, 241750 markings/sec, 185 secs
lola: 41973458 markings, 50226323 edges, 242634 markings/sec, 190 secs
lola: 43166313 markings, 51592014 edges, 238571 markings/sec, 195 secs
lola: 44221272 markings, 53019857 edges, 210992 markings/sec, 200 secs
lola: 45262706 markings, 54354434 edges, 208287 markings/sec, 205 secs
lola: 46373657 markings, 55709092 edges, 222190 markings/sec, 210 secs
lola: 47453369 markings, 57005998 edges, 215942 markings/sec, 215 secs
lola: 48610318 markings, 58438587 edges, 231390 markings/sec, 220 secs
lola: 49765297 markings, 59839507 edges, 230996 markings/sec, 225 secs
lola: 50895389 markings, 61184918 edges, 226018 markings/sec, 230 secs
lola: 51985092 markings, 62503254 edges, 217941 markings/sec, 235 secs
lola: 53079394 markings, 63797796 edges, 218860 markings/sec, 240 secs
lola: 54166363 markings, 65094038 edges, 217394 markings/sec, 245 secs
lola: 54202323 markings, 65137257 edges, 7192 markings/sec, 250 secs
lola: 54233119 markings, 65171782 edges, 6159 markings/sec, 255 secs
lola: 54238540 markings, 65177702 edges, 1084 markings/sec, 260 secs
lola: lola: Child process aborted or communication problem between parent and child process
lola: subprocess 8 will run for 404 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X ((3 <= p78)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X ((3 <= p78)))
lola: processed formula length: 18
lola: 20 rewrites
lola: closed formula file PermAdmissibility-COL-50-LTLCardinality.task
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 801 markings, 801 edges
lola: ========================================

FORMULA PermAdmissibility-COL-50-LTLCardinality-7 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 9 will run for 462 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (G (F ((2 <= p166)))) AND A (G (((2 <= p103 + p104 + p105 + p106 + p107 + p108 + p109 + p110) OR X ((2 <= p166))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: local time limit reached - aborting
lola:
preliminary result: unknown no unknown yes unknown unknown no no yes no yes yes unknown unknown unknown unknown
lola: caught signal User defined signal 1 - aborting LoLA
lola: memory consumption: 18128 KB
lola: time consumption: 798 seconds
lola: time limit reached - aborting
lola:
preliminary result: unknown no unknown yes unknown unknown no no yes no yes yes unknown unknown unknown unknown
lola:
preliminary result: unknown no unknown yes unknown unknown no no yes no yes yes unknown unknown unknown unknown
lola: memory consumption: 17448 KB
lola: time consumption: 3570 seconds

BK_TIME_CONFINEMENT_REACHED

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

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="PermAdmissibility-COL-50"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="lola"
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/PermAdmissibility-COL-50.tgz
mv PermAdmissibility-COL-50 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 lola"
echo " Input is PermAdmissibility-COL-50, 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 r256-csrt-152732582900133"
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 ;