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 424K
-rw-r--r-- 1 mcc users 3.4K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 19K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 13K May 15 18:54 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K May 15 18:50 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 5.9K May 15 18:50 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 2.2K May 15 18:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 9.0K May 15 18:54 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.8K May 15 18:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 9.4K May 15 18:54 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.7K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 17K 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 259K May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool mcc4mcc-full
Input is DLCround-PT-05a, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r070-smll-152649742800031
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1526650228885


BK_STOP 1526650909201

--------------------
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-05a as instance name.
Using DLCround as model name.
Using algorithm or tool bmdt.
Model characteristics are: {'Examination': 'CTLCardinality', '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': 3211, 'Memory': 286.63, 'Tool': 'itstools'}, {'Time': 9919, 'Memory': 2209.27, 'Tool': 'marcie'}, {'Time': 16741, 'Memory': 476.54, 'Tool': 'gspn'}, {'Time': 2909314, 'Memory': 13971.88, 'Tool': 'lola'}].
Learned tools are: [{'Tool': 'lola'}].
Learned tool lola is 906.0460915602616x far from the best tool itstools.
CTLCardinality lola DLCround-PT-05a...

Time: 3600 - MCC
----- Start make prepare stdout -----
----- Start make prepare stderr -----
===========================================================================================
DLCround-PT-05a: translating PT Petri net model.pnml into LoLA format
===========================================================================================
translating PT Petri net complete


checking for too many tokens
===========================================================================================
DLCround-PT-05a: translating PT formula CTLCardinality into LoLA format
===========================================================================================
translating formula complete
touch formulae;
----- Start make result stderr -----
----- Start make result stdout -----
CTLCardinality @ DLCround-PT-05a @ 3539 seconds
Makefile:222: recipe for target 'verify' failed
----- Start make result stdout -----
make: [verify] Error 2 (ignored)
----- Start make result stderr -----
lola: LoLA will run for 3539 seconds at most (--timelimit)
lola: NET
lola: reading net from model.pnml.lola
lola: finished parsing
lola: closed net file model.pnml.lola
lola: 1222/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: finding significant places
lola: 167 places, 1055 transitions, 79 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 906 transition conflict sets
lola: TASK
lola: reading formula from DLCround-PT-05a-CTLCardinality.task
lola: NOT(E (F (((3 <= p115) AND (1 <= p147))))) : ((((p62 + 1 <= p130) OR ((p110 + 1 <= p67) AND (p21 <= 0))) OR A (((3 <= p0) U (p47 <= p116)))) AND E (F ((2 <= p151)))) : E (F (((p166 + 1 <= p138) AND (p79 <= p41) AND ((p39 + 1 <= p28) OR (p128 <= 2))))) : (((p45 <= p148) AND (p75 <= p63) AND (p86 + 1 <= p83)) OR E (F (A (G ((1 <= p71)))))) : E (F (((p63 + 1 <= p154) AND (p160 + 1 <= p94) AND (2 <= p135)))) : E (F (((2 <= p57) AND (1 <= p148) AND (3 <= p16) AND (p128 + 1 <= p68) AND (p38 <= 2)))) : E (F (A (G ((p34 <= p72))))) : E (F (((p50 <= 1) AND (p128 + 1 <= p56) AND ((p118 + 1 <= p116) OR (p113 + 1 <= p134))))) : (((p48 <= p133) OR (((1 <= p13) OR (2 <= p32) OR (3 <= p117) OR (1 <= p20)) AND A (X ((p38 <= p123))))) AND (E (F ((p1 <= 0))) AND E (F ((p155 + 1 <= p56))))) : E (F (E (((p139 <= p3) U (3 <= p143))))) : A (G (NOT(A (X ((2 <= p47)))))) : NOT(E (F (((p71 + 1 <= p52) AND (p161 <= 2))))) : A (X (A (G (((p1 <= p66) OR (p89 <= p104)))))) : E ((A (F ((1 <= p38))) U E (F ((3 <= p127))))) : NOT(A (G (A (X ((1 <= p131)))))) : E (F (E (F (((3 <= p68) AND (1 <= p14))))))
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 (((3 <= p115) AND (1 <= p147)))))
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 12 bytes per marking, with 17 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: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is invariant.
lola: 2 markings, 1 edges
lola: ========================================
lola: subprocess 1 will run for 235 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((((p62 + 1 <= p130) OR ((p110 + 1 <= p67) AND (p21 <= 0))) OR A (((3 <= p0) U (p47 <= p116)))) AND E (F ((2 <= p151))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 1 will run for 235 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((p62 + 1 <= p130) OR ((p110 + 1 <= p67) AND (p21 <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((p62 + 1 <= p130) OR ((p110 + 1 <= p67) AND (p21 <= 0)))
lola: processed formula length: 58
lola: 0 rewrites
lola: formula mentions 0 of 167 places; total mentions: 0
lola: closed formula file DLCround-PT-05a-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 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (((3 <= p0) U (p47 <= p116)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (((3 <= p0) U (p47 <= p116)))
lola: processed formula: A (((3 <= p0) U (p47 <= p116)))
lola: processed formula length: 31
lola: 0 rewrites
lola: formula mentions 0 of 167 places; total mentions: 0
lola: closed formula file DLCround-PT-05a-CTLCardinality.task
lola: the resulting B\xfcchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 12 bytes per marking, with 15 unused bits
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method (--stubborn)
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: 1 markings, 0 edges
lola: ========================================
lola: subprocess 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((2 <= p151)))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 12 bytes per marking, with 17 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: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to DLCround-PT-05a-CTLCardinality-3.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is unreachable.
lola: 2 markings, 1 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((p166 + 1 <= p138) AND (p79 <= p41) AND ((p39 + 1 <= p28) OR (p128 <= 2)))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 12 bytes per marking, with 17 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: state equation: Generated DNF with 6 literals and 2 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is unreachable.
lola: 1 markings, 0 edges
lola: state equation: write sara problem file to DLCround-PT-05a-CTLCardinality-2.sara
lola: ========================================
lola: subprocess 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (((p45 <= p148) AND (p75 <= p63) AND (p86 + 1 <= p83)) OR E (F (A (G ((1 <= p71))))))
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: ((p45 <= p148) AND (p75 <= p63) AND (p86 + 1 <= p83))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((p45 <= p148) AND (p75 <= p63) AND (p86 + 1 <= p83))
lola: processed formula length: 53
lola: 0 rewrites
lola: formula mentions 0 of 167 places; total mentions: 0
lola: closed formula file DLCround-PT-05a-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 4 will run for 294 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (A (G ((1 <= p71)))))
lola: ========================================
lola: SUBTASK
lola: checking possible invariance
lola: possible invariance not yet implemented, converting to CTL...
lola: processed formula: E(TRUE U NOT(E(TRUE U (p71 <= 0))))
lola: processed formula length: 35
lola: 3 rewrites
lola: formula mentions 0 of 167 places; total mentions: 0
lola: closed formula file DLCround-PT-05a-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 12 bytes per marking, with 17 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: 247463 markings, 7946867 edges, 49480 markings/sec, 0 secs
lola: 426703 markings, 15402333 edges, 35848 markings/sec, 5 secs
lola: 659131 markings, 22898365 edges, 46486 markings/sec, 10 secs
lola: 863837 markings, 29950565 edges, 40941 markings/sec, 15 secs
lola: 1101125 markings, 37491841 edges, 47458 markings/sec, 20 secs
lola: 1327866 markings, 44921450 edges, 45348 markings/sec, 25 secs
lola: 1531103 markings, 51807278 edges, 40647 markings/sec, 30 secs
lola: 1768957 markings, 59058403 edges, 47571 markings/sec, 35 secs
lola: 1975806 markings, 65847665 edges, 41370 markings/sec, 40 secs
lola: 2194136 markings, 73136764 edges, 43666 markings/sec, 45 secs
lola: 2407912 markings, 80322424 edges, 42755 markings/sec, 50 secs
lola: 2632289 markings, 87564302 edges, 44875 markings/sec, 55 secs
lola: 2857380 markings, 94826901 edges, 45018 markings/sec, 60 secs
lola: 3068232 markings, 102110368 edges, 42170 markings/sec, 65 secs
lola: 3278414 markings, 109348263 edges, 42036 markings/sec, 70 secs
lola: 3492424 markings, 116545441 edges, 42802 markings/sec, 75 secs
lola: 3724563 markings, 124024878 edges, 46428 markings/sec, 80 secs
lola: 3898365 markings, 131155585 edges, 34760 markings/sec, 85 secs
lola: 4117249 markings, 138384171 edges, 43777 markings/sec, 90 secs
lola: 4337361 markings, 145431901 edges, 44022 markings/sec, 95 secs
lola: 4546161 markings, 152417806 edges, 41760 markings/sec, 100 secs
lola: 4753540 markings, 159585606 edges, 41476 markings/sec, 105 secs
lola: 4958255 markings, 166573573 edges, 40943 markings/sec, 110 secs
lola: 5171648 markings, 173796424 edges, 42679 markings/sec, 115 secs
lola: 5391421 markings, 181017876 edges, 43955 markings/sec, 120 secs
lola: 5596292 markings, 188023758 edges, 40974 markings/sec, 125 secs
lola: 5802617 markings, 195230446 edges, 41265 markings/sec, 130 secs
lola: 6001634 markings, 202132695 edges, 39803 markings/sec, 135 secs
lola: 6195221 markings, 208971818 edges, 38717 markings/sec, 140 secs
lola: 6409834 markings, 216039806 edges, 42923 markings/sec, 145 secs
lola: 6618817 markings, 223156056 edges, 41797 markings/sec, 150 secs
lola: 6843180 markings, 230702157 edges, 44873 markings/sec, 155 secs
lola: 7049516 markings, 237867653 edges, 41267 markings/sec, 160 secs
lola: 7241170 markings, 244881758 edges, 38331 markings/sec, 165 secs
lola: 7406428 markings, 251852351 edges, 33052 markings/sec, 170 secs
lola: 7607646 markings, 258844460 edges, 40244 markings/sec, 175 secs
lola: 7811168 markings, 265757587 edges, 40704 markings/sec, 180 secs
lola: 7995101 markings, 272081525 edges, 36787 markings/sec, 185 secs
lola: 8189877 markings, 278972943 edges, 38955 markings/sec, 190 secs
lola: 8379217 markings, 285592026 edges, 37868 markings/sec, 195 secs
lola: 8576117 markings, 292305344 edges, 39380 markings/sec, 200 secs
lola: 8765591 markings, 299003019 edges, 37895 markings/sec, 205 secs
lola: 8984445 markings, 306235238 edges, 43771 markings/sec, 210 secs
lola: 9207132 markings, 313505206 edges, 44537 markings/sec, 215 secs
lola: 9429048 markings, 320719771 edges, 44383 markings/sec, 220 secs
lola: 9593780 markings, 327910759 edges, 32946 markings/sec, 225 secs
lola: 9783083 markings, 334618096 edges, 37861 markings/sec, 230 secs
lola: 9972570 markings, 341290957 edges, 37897 markings/sec, 235 secs
lola: 10165404 markings, 347996698 edges, 38567 markings/sec, 240 secs
lola: 10369586 markings, 354949949 edges, 40836 markings/sec, 245 secs
lola: 10567555 markings, 361663478 edges, 39594 markings/sec, 250 secs
lola: 10788523 markings, 368646341 edges, 44194 markings/sec, 255 secs
lola: 10981817 markings, 375428141 edges, 38659 markings/sec, 260 secs
lola: 11195684 markings, 382544707 edges, 42773 markings/sec, 265 secs
lola: local time limit reached - aborting
lola: caught signal User defined signal 1 - aborting LoLA
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 4 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((p63 + 1 <= p154) AND (p160 + 1 <= p94) AND (2 <= p135))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 12 bytes per marking, with 17 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: state equation: Generated DNF with 3 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to DLCround-PT-05a-CTLCardinality-4.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is unreachable.
lola: 2 markings, 1 edges
lola: ========================================
lola: subprocess 5 will run for 297 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((2 <= p57) AND (1 <= p148) AND (3 <= p16) AND (p128 + 1 <= p68) AND (p38 <= 2))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 12 bytes per marking, with 17 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: state equation: Generated DNF with 5 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to DLCround-PT-05a-CTLCardinality-5.sara
lola: state equation: calling and running sara
sara: try reading problem file DLCround-PT-05a-CTLCardinality-5.sara.
sara: place or transition ordering is non-deterministic

lola: state equation: solution impossible
lola: SUBRESULT
lola: result: no
lola: produced by: state equation
lola: The predicate is unreachable.
lola: ========================================
lola: subprocess 6 will run for 326 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (A (G ((p34 <= p72)))))
lola: ========================================
lola: SUBTASK
lola: checking possible invariance
lola: possible invariance not yet implemented, converting to CTL...
lola: processed formula: E(TRUE U NOT(E(TRUE U (p72 + 1 <= p34))))
lola: processed formula length: 41
lola: 3 rewrites
lola: formula mentions 0 of 167 places; total mentions: 0
lola: closed formula file DLCround-PT-05a-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 12 bytes per marking, with 17 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: 136545 markings, 8067166 edges, 3689329903141912576 markings/sec, 0 secs
lola: 267902 markings, 15922189 edges, 26271 markings/sec, 5 secs
lola: 421898 markings, 23517380 edges, 30799 markings/sec, 10 secs
lola: 567612 markings, 30771089 edges, 29143 markings/sec, 15 secs
lola: 713561 markings, 38120011 edges, 29190 markings/sec, 20 secs
lola: 859513 markings, 45177390 edges, 29190 markings/sec, 25 secs
lola: 1012487 markings, 52318633 edges, 30595 markings/sec, 30 secs
lola: 1165434 markings, 59670073 edges, 30589 markings/sec, 35 secs
lola: 1310666 markings, 66696561 edges, 29046 markings/sec, 40 secs
lola: 1456529 markings, 73793995 edges, 29173 markings/sec, 45 secs
lola: 1608973 markings, 80820736 edges, 30489 markings/sec, 50 secs
lola: 1759373 markings, 87724192 edges, 30080 markings/sec, 55 secs
lola: 1910551 markings, 94606889 edges, 30236 markings/sec, 60 secs
lola: 2053847 markings, 101871962 edges, 28659 markings/sec, 65 secs
lola: 2197423 markings, 108686163 edges, 28715 markings/sec, 70 secs
lola: 2344959 markings, 115877849 edges, 29507 markings/sec, 75 secs
lola: 2499413 markings, 122928037 edges, 30891 markings/sec, 80 secs
lola: 2659844 markings, 129793230 edges, 32086 markings/sec, 85 secs
lola: 2808920 markings, 136533412 edges, 29815 markings/sec, 90 secs
lola: 2954282 markings, 143639327 edges, 29072 markings/sec, 95 secs
lola: 3096614 markings, 150470839 edges, 28466 markings/sec, 100 secs
lola: 3238506 markings, 157329174 edges, 28378 markings/sec, 105 secs
lola: 3386189 markings, 164150301 edges, 29537 markings/sec, 110 secs
lola: 3528282 markings, 171006621 edges, 28419 markings/sec, 115 secs
lola: 3676542 markings, 178115598 edges, 29652 markings/sec, 120 secs
lola: 3823785 markings, 185197428 edges, 29449 markings/sec, 125 secs
lola: 3968800 markings, 192017779 edges, 29003 markings/sec, 130 secs
lola: 4117204 markings, 198836306 edges, 29681 markings/sec, 135 secs
lola: 4264723 markings, 205592472 edges, 29504 markings/sec, 140 secs
lola: 4414153 markings, 212061568 edges, 29886 markings/sec, 145 secs
lola: 4554647 markings, 218728841 edges, 28099 markings/sec, 150 secs
lola: 4697852 markings, 225586413 edges, 28641 markings/sec, 155 secs
lola: 4843752 markings, 232225698 edges, 29180 markings/sec, 160 secs
lola: 4985111 markings, 238913718 edges, 28272 markings/sec, 165 secs
lola: 5149383 markings, 245911669 edges, 32854 markings/sec, 170 secs
lola: 5291565 markings, 252585082 edges, 28436 markings/sec, 175 secs
lola: 5437843 markings, 259438876 edges, 29256 markings/sec, 180 secs
lola: 5575460 markings, 265844460 edges, 27523 markings/sec, 185 secs
lola: 5720459 markings, 272796463 edges, 29000 markings/sec, 190 secs
lola: 5866256 markings, 279618760 edges, 29159 markings/sec, 195 secs
lola: 6009231 markings, 286273875 edges, 28595 markings/sec, 200 secs
lola: 6154296 markings, 292956949 edges, 29013 markings/sec, 205 secs
lola: 6305801 markings, 299764942 edges, 30301 markings/sec, 210 secs
lola: 6459076 markings, 306609035 edges, 30655 markings/sec, 215 secs
lola: 6603336 markings, 313389189 edges, 28852 markings/sec, 220 secs
lola: 6730898 markings, 320773517 edges, 25512 markings/sec, 225 secs
lola: 6862018 markings, 327724115 edges, 26224 markings/sec, 230 secs
lola: 6996955 markings, 334493528 edges, 26987 markings/sec, 235 secs
lola: 7130954 markings, 341005046 edges, 26800 markings/sec, 240 secs
lola: 7274588 markings, 347495316 edges, 28727 markings/sec, 245 secs
lola: 7416607 markings, 354070770 edges, 28404 markings/sec, 250 secs
lola: 7552587 markings, 360421596 edges, 27196 markings/sec, 255 secs
lola: 7694308 markings, 366978605 edges, 28344 markings/sec, 260 secs
lola: 7829950 markings, 373280787 edges, 27128 markings/sec, 265 secs
lola: 7969603 markings, 379610032 edges, 27931 markings/sec, 270 secs
lola: 8111505 markings, 386359343 edges, 28380 markings/sec, 275 secs
lola: 8256115 markings, 393123846 edges, 28922 markings/sec, 280 secs
lola: 8397540 markings, 399723523 edges, 28285 markings/sec, 285 secs
lola: 8543373 markings, 406409841 edges, 29167 markings/sec, 290 secs
lola: 8683675 markings, 412955360 edges, 28060 markings/sec, 295 secs
lola: 8831497 markings, 419644899 edges, 29564 markings/sec, 300 secs
lola: 8973299 markings, 427063800 edges, 28360 markings/sec, 305 secs
lola: 9110464 markings, 434216694 edges, 27433 markings/sec, 310 secs
lola: 9257626 markings, 441270408 edges, 29432 markings/sec, 315 secs
lola: 9405461 markings, 448259621 edges, 29567 markings/sec, 320 secs
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: memory allocation failed
lola:
preliminary result: yes no no unknown no no unknown
FORMULA DLCround-PT-05a-CTLCardinality-0 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DLCround-PT-05a-CTLCardinality-1 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DLCround-PT-05a-CTLCardinality-2 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DLCround-PT-05a-CTLCardinality-3 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DLCround-PT-05a-CTLCardinality-4 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DLCround-PT-05a-CTLCardinality-5 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DLCround-PT-05a-CTLCardinality-6 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DLCround-PT-05a-CTLCardinality-7 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DLCround-PT-05a-CTLCardinality-8 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DLCround-PT-05a-CTLCardinality-9 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DLCround-PT-05a-CTLCardinality-10 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DLCround-PT-05a-CTLCardinality-11 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DLCround-PT-05a-CTLCardinality-12 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DLCround-PT-05a-CTLCardinality-13 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DLCround-PT-05a-CTLCardinality-14 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DLCround-PT-05a-CTLCardinality-15 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stderr -----
----- Kill lola and sara stdout -----
----- Finished stderr -----
----- 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="DLCround-PT-05a"
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/DLCround-PT-05a.tgz
mv DLCround-PT-05a 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 DLCround-PT-05a, 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 r070-smll-152649742800031"
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 ;