fond
Model Checking Contest 2018
8th edition, Bratislava, Slovakia, June 26, 2018
Execution of r118-csrt-152666478500458
Last Updated
June 26, 2018

About the Execution of M4M.full for PermAdmissibility-COL-20

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
15919.180 217416.00 132492.00 1381.30 ???????????????? 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 220K
-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.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.4K May 15 18:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 9.7K May 15 18:54 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K May 15 18:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 8.1K May 15 18:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.1K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 22K 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.6K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 12K 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 mcc4mcc-full
Input is PermAdmissibility-COL-20, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r118-csrt-152666478500458
=====================================================================


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

=== Now, execution of the tool begins

BK_START 1527295429411


BK_STOP 1527295646827

--------------------
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 PermAdmissibility-COL-20 as instance name.
Using PermAdmissibility as model name.
Using algorithm or tool bmdt.
Model characteristics are: {'Examination': 'CTLCardinality', 'Place/Transition': True, 'Colored': True, 'Relative-Time': 1, 'Relative-Memory': 1, 'Ordinary': False, 'Simple Free Choice': False, 'Extended Free Choice': False, 'State Machine': False, 'Marked Graph': False, 'Connected': True, 'Strongly Connected': False, 'Source Place': True, 'Sink Place': True, 'Source Transition': False, 'Sink Transition': False, 'Loop Free': True, 'Conservative': False, 'Sub-Conservative': False, 'Nested Units': False, 'Safe': False, 'Deadlock': True, 'Reversible': False, 'Quasi Live': None, 'Live': None}.
Known tools are: [{'Time': 1679100, 'Memory': 15949.55, 'Tool': 'lola'}, {'Time': 1731033, 'Memory': 15946.95, 'Tool': 'lola'}].
Learned tools are: [{'Tool': 'lola'}].
Learned tool lola is 1.0x far from the best tool lola.
CTLCardinality lola PermAdmissibility-COL-20...
----- Start make prepare stderr -----

Time: 3600 - MCC
----- Start make prepare stdout -----
===========================================================================================
PermAdmissibility-COL-20: translating COL Petri net model.pnml into LoLA format
===========================================================================================
translating COL Petri net complete
checking for too many tokens
===========================================================================================
PermAdmissibility-COL-20: translating COL formula CTLCardinality into LoLA format
===========================================================================================
translating formula complete
----- Start make result stdout -----
----- Start make result stderr -----
CTLCardinality @ PermAdmissibility-COL-20 @ 3540 seconds
make: [verify] Error 134 (ignored)
----- Start make result stderr -----
----- Kill lola and sara stderr -----
----- Finished stderr -----
Makefile:222: recipe for target 'verify' failed
----- Start make result stdout -----
lola: LoLA will run for 3540 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: 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-20-CTLCardinality.task
lola: NOT(E (F (E (G ((p139 + p140 + p141 + p142 + p143 + p144 + p145 + p146 <= p138)))))) : E (G ((E (F ((p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 <= p34 + p35 + p36 + p37 + p38 + p39 + p40 + p41))) OR TRUE))) : E (X ((A (G ((p9 <= p188 + p189 + p190 + p191 + p192 + p193 + p194 + p195))) OR (p108 + p109 + p110 + p111 + p112 + p113 + p114 + p115 <= p42 + p43 + p44 + p45 + p46 + p47 + p48 + p49)))) : (A (G (((p81 + p80 + p79 + p78 + p77 + p76 + p75 + p82 <= 0) OR (p163 <= 0)))) OR ((E (X ((p116 <= p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8))) AND (3 <= p50)) AND ((p0 <= p118 + p119 + p120 + p121 + p122 + p123 + p124 + p125) AND (p197 <= p135)))) : (((((p59 + p60 + p61 + p62 + p63 + p64 + p65 + p66 <= p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17) AND (p59 + p60 + p61 + p62 + p63 + p64 + p65 + p66 <= p207) AND (p135 <= p196)) AND E (X ((p137 <= p136)))) OR (((p117 <= p116) OR (1 <= p107)) AND (p206 <= p42 + p43 + p44 + p45 + p46 + p47 + p48 + p49))) AND (E (G (((3 <= p18 + p19 + p20 + p21 + p22 + p23 + p24 + p25) OR (p155 + p156 + p157 + p158 + p159 + p160 + p161 + p162 <= p81 + p80 + p79 + p78 + p77 + p76 + p75 + p82)))) AND NOT(E (G ((p108 + p109 + p110 + p111 + p112 + p113 + p114 + p115 <= p51 + p52 + p53 + p54 + p55 + p56 + p57 + p58)))))) : A (F (NOT(E (F ((3 <= p107)))))) : A (G ((p118 + p119 + p120 + p121 + p122 + p123 + p124 + p125 <= p0))) : A (X (A (((p116 <= p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17) U (1 <= p91 + p92 + p93 + p94 + p95 + p96 + p97 + p98))))) : (E (F ((1 <= p18 + p19 + p20 + p21 + p22 + p23 + p24 + p25))) AND A (F ((((p59 + p60 + p61 + p62 + p63 + p64 + p65 + p66 <= p206) OR (p197 <= p126 + p127 + p128 + p129 + p130 + p131 + p132 + p133)) AND (p42 + p43 + p44 + p45 + p46 + p47 + p48 + p49 <= p139 + p140 + p141 + p142 + p143 + p144 + p145 + p146))))) : NOT(E (X (A (F ((2 <= p9)))))) : E (((p147 + p148 + p149 + p150 + p151 + p152 + p153 + p154 <= p180 + p181 + p182 + p183 + p184 + p185 + p186 + p187) U E (F ((3 <= p0))))) : E (G ((E (F ((3 <= p139 + p140 + p141 + p142 + p143 + p144 + p145 + p146))) OR (2 <= p207)))) : A (X (NOT(A (F ((1 <= p196)))))) : E (F (((p108 + p109 + p110 + p111 + p112 + p113 + p114 + p115 + 1 <= p136) AND (p0 + 1 <= p188 + p189 + p190 + p191 + p192 + p193 + p194 + p195) AND (1 <= p73 + p72 + p71 + p70 + p69 + p67 + p68 + p74)))) : E (((p196 <= 1) U E (F ((3 <= p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17))))) : E (G (E (X ((p172 + p173 + p174 + p175 + p176 + p177 + p178 + p179 <= p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8)))))
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT(E (F (E (G ((p139 + p140 + p141 + p142 + p143 + p144 + p145 + p146 <= p138))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(E(TRUE U NOT(A(TRUE U (p138 + 1 <= p139 + p140 + p141 + p142 + p143 + p144 + p145 + p146)))))
lola: processed formula length: 97
lola: 7 rewrites
lola: formula mentions 0 of 208 places; total mentions: 0
lola: closed formula file PermAdmissibility-COL-20-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 708 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 321 markings, 398 edges
lola: ========================================
lola: subprocess 1 will run for 236 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G ((E (F ((p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 <= p34 + p35 + p36 + p37 + p38 + p39 + p40 + p41))) OR TRUE)))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: TRUE
lola: processed formula length: 4
lola: 4 rewrites
lola: formula mentions 0 of 208 places; total mentions: 0
lola: closed formula file PermAdmissibility-COL-20-CTLCardinality.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: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (X ((A (G ((p9 <= p188 + p189 + p190 + p191 + p192 + p193 + p194 + p195))) OR (p108 + p109 + p110 + p111 + p112 + p113 + p114 + p115 <= p42 + p43 + p44 + p45 + p46 + p47 + p48 + p49))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (X (A (G ((p9 <= p188 + p189 + p190 + p191 + p192 + p193 + p194 + p195)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: EX(NOT(E(TRUE U (p188 + p189 + p190 + p191 + p192 + p193 + p194 + p195 + 1 <= p9))))
lola: processed formula length: 84
lola: 4 rewrites
lola: formula mentions 0 of 208 places; total mentions: 0
lola: closed formula file PermAdmissibility-COL-20-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 708 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains EX or AX operators, stubborn sets not applicable
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 267 markings, 269 edges
lola: ========================================
lola: subprocess 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (X ((p108 + p109 + p110 + p111 + p112 + p113 + p114 + p115 <= p42 + p43 + p44 + p45 + p46 + p47 + p48 + p49)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: EX((p108 + p109 + p110 + p111 + p112 + p113 + p114 + p115 <= p42 + p43 + p44 + p45 + p46 + p47 + p48 + p49))
lola: processed formula length: 108
lola: 2 rewrites
lola: formula mentions 0 of 208 places; total mentions: 0
lola: closed formula file PermAdmissibility-COL-20-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 708 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains EX or AX operators, stubborn sets not applicable
lola: RUNNING
lola: CTL formula contains 0 significant temporal operators and needs 0 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 0 markings, 0 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (A (G (((p81 + p80 + p79 + p78 + p77 + p76 + p75 + p82 <= 0) OR (p163 <= 0)))) OR ((E (X ((p116 <= p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8))) AND (3 <= p50)) AND ((p0 <= p118 + p119 + p120 + p121 + p122 + p123 + p124 + p125) AND (p197 <= p135))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((p81 + p80 + p79 + p78 + p77 + p76 + p75 + p82 <= 0) OR (p163 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 708 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: 25 markings, 24 edges
lola: ========================================
lola: subprocess 4 will run for 295 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (X ((p116 <= p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: EX((p116 <= p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8))
lola: processed formula length: 51
lola: 2 rewrites
lola: formula mentions 0 of 208 places; total mentions: 0
lola: closed formula file PermAdmissibility-COL-20-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 708 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains EX or AX operators, stubborn sets not applicable
lola: RUNNING
lola: CTL formula contains 0 significant temporal operators and needs 0 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 5 will run for 321 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((3 <= p50) AND ((p0 <= p118 + p119 + p120 + p121 + p122 + p123 + p124 + p125) AND (p197 <= p135)))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((3 <= p50) AND ((p0 <= p118 + p119 + p120 + p121 + p122 + p123 + p124 + p125) AND (p197 <= p135)))
lola: processed formula length: 99
lola: 2 rewrites
lola: formula mentions 0 of 208 places; total mentions: 0
lola: closed formula file PermAdmissibility-COL-20-CTLCardinality.task
lola: processed formula with 3 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: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 4 will run for 295 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (((((p59 + p60 + p61 + p62 + p63 + p64 + p65 + p66 <= p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17) AND (p59 + p60 + p61 + p62 + p63 + p64 + p65 + p66 <= p207) AND (p135 <= p196)) AND E (X ((p137 <= p136)))) OR (((p117 <= p116) OR (1 <= p107)) AND (p206 <= p42 + p43 + p44 + p45 + p46 + p47 + p48 + p49))) AND (E (G (((3 <= p18 + p19 + p20 + p21 + p22 + p23 + p24 + p25) OR (p155 + p156 + p157 + p... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 4 will run for 295 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((p59 + p60 + p61 + p62 + p63 + p64 + p65 + p66 <= p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17) AND (p59 + p60 + p61 + p62 + p63 + p64 + p65 + p66 <= p207) AND (p135 <= p196))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((p59 + p60 + p61 + p62 + p63 + p64 + p65 + p66 <= p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17) AND (p59 + p60 + p61 + p62 + p63 + p64 + p65 + p66 <= p207) AND (p135 <= p196))
lola: processed formula length: 177
lola: 3 rewrites
lola: formula mentions 0 of 208 places; total mentions: 0
lola: closed formula file PermAdmissibility-COL-20-CTLCardinality.task
lola: processed formula with 3 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: ========================================
lola: subprocess 5 will run for 321 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (((p117 <= p116) OR (1 <= p107)) AND (p206 <= p42 + p43 + p44 + p45 + p46 + p47 + p48 + p49))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (((p117 <= p116) OR (1 <= p107)) AND (p206 <= p42 + p43 + p44 + p45 + p46 + p47 + p48 + p49))
lola: processed formula length: 94
lola: 3 rewrites
lola: formula mentions 0 of 208 places; total mentions: 0
lola: closed formula file PermAdmissibility-COL-20-CTLCardinality.task
lola: processed formula with 3 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: ========================================
lola: subprocess 6 will run for 354 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G (((3 <= p18 + p19 + p20 + p21 + p22 + p23 + p24 + p25) OR (p155 + p156 + p157 + p158 + p159 + p160 + p161 + p162 <= p81 + p80 + p79 + p78 + p77 + p76 + p75 + p82))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U ((p18 + p19 + p20 + p21 + p22 + p23 + p24 + p25 <= 2) AND (p81 + p80 + p79 + p78 + p77 + p76 + p75 + p82 + 1 <= p155 + p156 + p157 + p158 + p159 + p160 + p161 + p162))))
lola: processed formula length: 182
lola: 5 rewrites
lola: formula mentions 0 of 208 places; total mentions: 0
lola: closed formula file PermAdmissibility-COL-20-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 708 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: 1376996 markings, 1912314 edges, 3225752436249460736 markings/sec, 0 secs
lola: 2658394 markings, 3780611 edges, 256280 markings/sec, 5 secs
lola: 3970623 markings, 5734093 edges, 262446 markings/sec, 10 secs
lola: 5213107 markings, 7605987 edges, 248497 markings/sec, 15 secs
lola: 6506729 markings, 9594573 edges, 258724 markings/sec, 20 secs
lola: 7681184 markings, 11375513 edges, 234891 markings/sec, 25 secs
lola: 8890684 markings, 13208953 edges, 241900 markings/sec, 30 secs
lola: 10089872 markings, 15067849 edges, 239838 markings/sec, 35 secs
lola: 11280417 markings, 16994961 edges, 238109 markings/sec, 40 secs
lola: 12537172 markings, 18956656 edges, 251351 markings/sec, 45 secs
lola: 13828761 markings, 20788186 edges, 258318 markings/sec, 50 secs
lola: 15109041 markings, 22630605 edges, 256056 markings/sec, 55 secs
lola: 16357083 markings, 24476635 edges, 249608 markings/sec, 60 secs
lola: 17627978 markings, 26378401 edges, 254179 markings/sec, 65 secs
lola: 18857901 markings, 28205430 edges, 245985 markings/sec, 70 secs
lola: 19992558 markings, 29962737 edges, 226931 markings/sec, 75 secs
lola: 21250478 markings, 31900317 edges, 251584 markings/sec, 80 secs
lola: 22522924 markings, 33808207 edges, 254489 markings/sec, 85 secs
lola: 23734152 markings, 35685882 edges, 242246 markings/sec, 90 secs
lola: 24923549 markings, 37485303 edges, 237879 markings/sec, 95 secs
lola: 26080423 markings, 39291111 edges, 231375 markings/sec, 100 secs
lola: 27215254 markings, 41121627 edges, 226966 markings/sec, 105 secs
lola: 28221146 markings, 42692444 edges, 201178 markings/sec, 110 secs
lola: 28223449 markings, 42696052 edges, 461 markings/sec, 115 secs
lola: 28224805 markings, 42698185 edges, 271 markings/sec, 120 secs
lola: 28224864 markings, 42698267 edges, 12 markings/sec, 125 secs
lola: 28224910 markings, 42698361 edges, 9 markings/sec, 130 secs
lola: 28225037 markings, 42698560 edges, 25 markings/sec, 135 secs
lola: 28225152 markings, 42698774 edges, 23 markings/sec, 140 secs
lola: 28225172 markings, 42698794 edges, 4 markings/sec, 145 secs
lola: Child process aborted or communication problem between parent and child process
terminate called after throwing an instance of 'std::runtime_error'
what(): parse error at position 0: unexpected character, last read: '\ufffd'
lola: Child process aborted or communication problem between parent and child process
terminate called after throwing an instance of 'std::runtime_error'
what(): parse error at position 0: unexpected character, last read: '
'
Aborted (core dumped)
FORMULA PermAdmissibility-COL-20-CTLCardinality-0 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-20-CTLCardinality-1 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-20-CTLCardinality-2 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-20-CTLCardinality-3 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-20-CTLCardinality-4 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-20-CTLCardinality-5 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-20-CTLCardinality-6 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-20-CTLCardinality-7 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-20-CTLCardinality-8 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-20-CTLCardinality-9 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-20-CTLCardinality-10 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-20-CTLCardinality-11 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-20-CTLCardinality-12 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-20-CTLCardinality-13 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-20-CTLCardinality-14 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-20-CTLCardinality-15 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stdout -----
----- Finished stdout -----

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-20"
export BK_EXAMINATION="CTLCardinality"
export BK_TOOL="mcc4mcc-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/PermAdmissibility-COL-20.tgz
mv PermAdmissibility-COL-20 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 mcc4mcc-full"
echo " Input is PermAdmissibility-COL-20, examination is CTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r118-csrt-152666478500458"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "CTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLCardinality" != "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 "CTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLCardinality.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 '' CTLCardinality.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 ;