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 4.3K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K 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.2K May 15 18:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 8.9K 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 8.3K May 15 18:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.3K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 16K May 15 18:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 105 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 343 May 15 18:54 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 3.4K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 23K 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 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 42K May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool mcc4mcc-structural
Input is SafeBus-COL-03, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r155-smll-152685553000178
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1526995796528


BK_STOP 1526995842235

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

Prefix is 75f5f979.
Reading known information in /usr/share/mcc4mcc/75f5f979-known.json.
Reading learned information in /usr/share/mcc4mcc/75f5f979-learned.json.
Reading value translations in /usr/share/mcc4mcc/75f5f979-values.json.
Using directory /home/mcc/execution for input, as it contains a model.pnml file.
Using SafeBus-COL-03 as instance name.
Using SafeBus 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': True, 'Simple Free Choice': False, 'Extended Free Choice': False, 'State Machine': False, 'Marked Graph': False, 'Connected': True, 'Strongly Connected': True, 'Source Place': False, 'Sink Place': False, 'Source Transition': False, 'Sink Transition': False, 'Loop Free': False, 'Conservative': False, 'Sub-Conservative': False, 'Nested Units': False, 'Safe': None, 'Deadlock': None, 'Reversible': None, 'Quasi Live': None, 'Live': None}.
Known tools are: [{'Time': 312, 'Memory': 112.26, 'Tool': 'lola'}, {'Time': 415, 'Memory': 110.79, 'Tool': 'lola'}, {'Time': 855, 'Memory': 100.86, 'Tool': 'gspn'}, {'Time': 3044, 'Memory': 166.48, 'Tool': 'gspn'}, {'Time': 4638, 'Memory': 310.22, 'Tool': 'itstools'}, {'Time': 4814, 'Memory': 2229.09, 'Tool': 'marcie'}, {'Time': 5071, 'Memory': 2229.2, 'Tool': 'marcie'}, {'Time': 5884, 'Memory': 315.93, 'Tool': 'itstools'}].
Learned tools are: [{'Tool': 'lola'}].
Learned tool lola is 1.0x far from the best tool lola.
CTLCardinality lola SafeBus-COL-03...

Time: 3600 - MCC
----- Start make prepare stdout -----
----- Start make prepare stderr -----
===========================================================================================
SafeBus-COL-03: translating COL Petri net model.pnml into LoLA format
===========================================================================================
translating COL Petri net complete
checking for too many tokens
===========================================================================================
SafeBus-COL-03: translating COL formula CTLCardinality into LoLA format
===========================================================================================
translating formula complete
----- Start make result stdout -----
----- Start make result stderr -----
CTLCardinality @ SafeBus-COL-03 @ 3540 seconds
----- Start make result stdout -----
----- Start make result stderr -----
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: 157/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: finding significant places
lola: 60 places, 97 transitions, 40 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 117 transition conflict sets
lola: TASK
lola: reading formula from SafeBus-COL-03-CTLCardinality.task
lola: (NOT((((p35 <= 0) AND (p34 <= 1)) AND A (F ((1 <= p30 + p29 + p28))))) AND ((p36 + p37 + p38 + 1 <= p25 + p26 + p27) OR (p31 + p32 + p33 <= p42))) : NOT(((p9 + p10 + p11 + 1 <= p53 + p52 + p50 + p49 + p47 + p46 + p48 + p51 + p54) OR (A (G (TRUE)) AND ((p9 + p10 + p11 + 1 <= p59))))) : E (X (A (F ((p12 <= 0))))) : ((3 <= p56 + p57 + p58) OR A (F (A (F ((2 <= p56 + p57 + p58)))))) : ((NOT(A (F ((1 <= p41 + p40 + p39)))) AND E (G ((p55 <= 2)))) AND (E (F ((p59 + 1 <= p45 + p44 + p43))) AND (((p45 + p44 + p43 <= p0 + p1 + p2) OR (1 <= p45 + p44 + p43) OR (p25 + p26 + p27 <= p41 + p40 + p39)) OR E (X ((p42 <= p34)))))) : A (F (NOT(A (F ((p31 + p32 + p33 <= p13 + p14 + p15 + p16 + p17 + p18 + p19 + p21 + p20)))))) : ((A (F ((p45 + p44 + p43 <= 2))) AND A (F (((2 <= p55) AND (p55 <= p22 + p23 + p24))))) AND (A (((2 <= p45 + p44 + p43) U (p9 + p10 + p11 <= p36 + p37 + p38))) OR A (G (((2 <= p0 + p1 + p2) OR (p55 <= p59)))))) : (E (G (((p30 + p29 + p28 <= 2) AND (p35 <= 0)))) AND (((p42 <= p8 + p7 + p6) OR ((p12 <= 0) AND (p25 + p26 + p27 <= 0))) OR A (F ((p53 + p52 + p50 + p49 + p47 + p46 + p48 + p51 + p54 <= 2))))) : A (F (E (G (((2 <= p56 + p57 + p58) OR (p0 + p1 + p2 <= p3 + p4 + p5)))))) : A ((A (F ((2 <= p9 + p10 + p11))) U (((3 <= p31 + p32 + p33) OR (p8 + p7 + p6 <= p41 + p40 + p39)) AND (p35 <= 0)))) : NOT(E (((2 <= p8 + p7 + p6) U ((3 <= p56 + p57 + p58) AND (2 <= p25 + p26 + p27))))) : E (X (NOT(E (G ((p34 <= p35)))))) : ((A (F ((2 <= p3 + p4 + p5))) OR (E (X ((p0 + p1 + p2 <= p45 + p44 + p43))) AND ((p25 + p26 + p27 + 1 <= p13 + p14 + p15 + p16 + p17 + p18 + p19 + p21 + p20) OR (p45 + p44 + p43 + 1 <= p8 + p7 + p6)))) OR E ((((p9 + p10 + p11 <= p36 + p37 + p38) AND (1 <= p9 + p10 + p11)) U ((3 <= p42) AND (2 <= p53 + p52 + p50 + p49 + p47 + p46 + p48 + p51 + p54))))) : E ((((p41 + p40 + p39 <= p12) OR (p31 + p32 + p33 <= p25 + p26 + p27) OR (p3 + p4 + p5 + 1 <= p13 + p14 + p15 + p16 + p17 + p18 + p19 + p21 + p20)) U A (G ((3 <= p34))))) : A (((p31 + p32 + p33 + 1 <= p13 + p14 + p15 + p16 + p17 + p18 + p19 + p21 + p20) U A (G ((p9 + p10 + p11 <= p0 + p1 + p2))))) : (E (G ((((p8 + p7 + p6 <= p41 + p40 + p39) AND (p55 <= p36 + p37 + p38))))) OR (A (F (((p34 <= p56 + p57 + p58) AND (3 <= p9 + p10 + p11)))) AND A (F (((2 <= p25 + p26 + p27) OR (1 <= p30 + p29 + p28))))))
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((((p35 <= 0) AND (p34 <= 1)) AND A (F ((1 <= p30 + p29 + p28))))) AND ((p36 + p37 + p38 + 1 <= p25 + p26 + p27) OR (p31 + p32 + p33 <= p42)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((1 <= p35) OR (2 <= p34))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((1 <= p35) OR (2 <= p34))
lola: processed formula length: 27
lola: 5 rewrites
lola: formula mentions 0 of 60 places; total mentions: 0
lola: closed formula file SafeBus-COL-03-CTLCardinality.task
lola: processed formula with 2 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 1 will run for 236 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G ((p30 + p29 + p28 <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U (1 <= p30 + p29 + p28)))
lola: processed formula length: 37
lola: 7 rewrites
lola: formula mentions 0 of 60 places; total mentions: 0
lola: closed formula file SafeBus-COL-03-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 160 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: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 107 markings, 137 edges
lola: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((p36 + p37 + p38 + 1 <= p25 + p26 + p27) OR (p31 + p32 + p33 <= p42))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((p36 + p37 + p38 + 1 <= p25 + p26 + p27) OR (p31 + p32 + p33 <= p42))
lola: processed formula length: 71
lola: 5 rewrites
lola: formula mentions 0 of 60 places; total mentions: 0
lola: closed formula file SafeBus-COL-03-CTLCardinality.task
lola: processed formula with 2 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: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 1 will run for 236 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT(((p9 + p10 + p11 + 1 <= p53 + p52 + p50 + p49 + p47 + p46 + p48 + p51 + p54) OR (A (G (TRUE)) AND ((p9 + p10 + p11 + 1 <= p59)))))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((p53 + p52 + p50 + p49 + p47 + p46 + p48 + p51 + p54 <= p9 + p10 + p11) AND ((p59 <= p9 + p10 + p11)))
lola: processed formula length: 103
lola: 8 rewrites
lola: formula mentions 0 of 60 places; total mentions: 0
lola: closed formula file SafeBus-COL-03-CTLCardinality.task
lola: processed formula with 2 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: E (X (A (F ((p12 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: EX(A(TRUE U (p12 <= 0)))
lola: processed formula length: 24
lola: 2 rewrites
lola: formula mentions 0 of 60 places; total mentions: 0
lola: closed formula file SafeBus-COL-03-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 160 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: 202 markings, 209 edges
lola: ========================================
lola: subprocess 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((3 <= p56 + p57 + p58) OR A (F (A (F ((2 <= p56 + p57 + p58))))))
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: (3 <= p56 + p57 + p58)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (3 <= p56 + p57 + p58)
lola: processed formula length: 22
lola: 1 rewrites
lola: formula mentions 0 of 60 places; total mentions: 0
lola: closed formula file SafeBus-COL-03-CTLCardinality.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: ========================================
lola: subprocess 4 will run for 295 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((2 <= p56 + p57 + p58)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F ((2 <= p56 + p57 + p58)))
lola: processed formula: A (F ((2 <= p56 + p57 + p58)))
lola: processed formula length: 30
lola: 1 rewrites
lola: formula mentions 0 of 60 places; total mentions: 0
lola: closed formula file SafeBus-COL-03-CTLCardinality.task
lola: the resulting B\xfcchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 164 bytes per marking, with 31 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: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 44 markings, 44 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: ((NOT(A (F ((1 <= p41 + p40 + p39)))) AND E (G ((p55 <= 2)))) AND (E (F ((p59 + 1 <= p45 + p44 + p43))) AND (((p45 + p44 + p43 <= p0 + p1 + p2) OR (1 <= p45 + p44 + p43) OR (p25 + p26 + p27 <= p41 + p40 + p39)) OR E (X ((p42 <= p34))))))
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: E (G ((p41 + p40 + p39 <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U (1 <= p41 + p40 + p39)))
lola: processed formula length: 37
lola: 6 rewrites
lola: formula mentions 0 of 60 places; total mentions: 0
lola: closed formula file SafeBus-COL-03-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 160 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: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 705 markings, 1392 edges
lola: ========================================
lola: subprocess 5 will run for 321 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G ((p55 <= 2)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U (3 <= p55)))
lola: processed formula length: 25
lola: 6 rewrites
lola: formula mentions 0 of 60 places; total mentions: 0
lola: closed formula file SafeBus-COL-03-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 160 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: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 74 markings, 74 edges
lola: ========================================
lola: subprocess 6 will run for 354 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((p59 + 1 <= p45 + p44 + p43)))
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 160 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: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 6 markings, 5 edges
lola: ========================================
lola: subprocess 7 will run for 393 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((p45 + p44 + p43 <= p0 + p1 + p2) OR (1 <= p45 + p44 + p43) OR (p25 + p26 + p27 <= p41 + p40 + p39))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((p45 + p44 + p43 <= p0 + p1 + p2) OR (1 <= p45 + p44 + p43) OR (p25 + p26 + p27 <= p41 + p40 + p39))
lola: processed formula length: 103
lola: 4 rewrites
lola: formula mentions 0 of 60 places; total mentions: 0
lola: closed formula file SafeBus-COL-03-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: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 5 will run for 321 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (NOT(A (F ((p31 + p32 + p33 <= p13 + p14 + p15 + p16 + p17 + p18 + p19 + p21 + p20))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U NOT(A(TRUE U (p31 + p32 + p33 <= p13 + p14 + p15 + p16 + p17 + p18 + p19 + p21 + p20))))
lola: processed formula length: 97
lola: 6 rewrites
lola: formula mentions 0 of 60 places; total mentions: 0
lola: closed formula file SafeBus-COL-03-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 160 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: 84 markings, 169 edges
lola: ========================================
lola: subprocess 6 will run for 354 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((A (F ((p45 + p44 + p43 <= 2))) AND A (F (((2 <= p55) AND (p55 <= p22 + p23 + p24))))) AND (A (((2 <= p45 + p44 + p43) U (p9 + p10 + p11 <= p36 + p37 + p38))) OR A (G (((2 <= p0 + p1 + p2) OR (p55 <= p59))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 6 will run for 354 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((p45 + p44 + p43 <= 2)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F ((p45 + p44 + p43 <= 2)))
lola: processed formula: A (F ((p45 + p44 + p43 <= 2)))
lola: processed formula length: 30
lola: 1 rewrites
lola: formula mentions 0 of 60 places; total mentions: 0
lola: closed formula file SafeBus-COL-03-CTLCardinality.task
lola: the resulting B\xfcchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 164 bytes per marking, with 31 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 7 will run for 393 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (((2 <= p55) AND (p55 <= p22 + p23 + p24))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F (((2 <= p55) AND (p55 <= p22 + p23 + p24))))
lola: processed formula: A (F (((2 <= p55) AND (p55 <= p22 + p23 + p24))))
lola: processed formula length: 49
lola: 1 rewrites
lola: formula mentions 0 of 60 places; total mentions: 0
lola: closed formula file SafeBus-COL-03-CTLCardinality.task
lola: the resulting B\xfcchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 164 bytes per marking, with 31 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: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 74 markings, 74 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 7 will run for 393 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (E (G (((p30 + p29 + p28 <= 2) AND (p35 <= 0)))) AND (((p42 <= p8 + p7 + p6) OR ((p12 <= 0) AND (p25 + p26 + p27 <= 0))) OR A (F ((p53 + p52 + p50 + p49 + p47 + p46 + p48 + p51 + p54 <= 2)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 7 will run for 393 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G (((p30 + p29 + p28 <= 2) AND (p35 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U ((3 <= p30 + p29 + p28) OR (1 <= p35))))
lola: processed formula length: 54
lola: 2 rewrites
lola: formula mentions 0 of 60 places; total mentions: 0
lola: closed formula file SafeBus-COL-03-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 160 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: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 82 markings, 83 edges
lola: ========================================
lola: subprocess 8 will run for 442 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((p42 <= p8 + p7 + p6) OR ((p12 <= 0) AND (p25 + p26 + p27 <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((p42 <= p8 + p7 + p6) OR ((p12 <= 0) AND (p25 + p26 + p27 <= 0)))
lola: processed formula length: 67
lola: 0 rewrites
lola: formula mentions 0 of 60 places; total mentions: 0
lola: closed formula file SafeBus-COL-03-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: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 8 will run for 442 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (E (G (((2 <= p56 + p57 + p58) OR (p0 + p1 + p2 <= p3 + p4 + p5))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U NOT(A(TRUE U ((p56 + p57 + p58 <= 1) AND (p3 + p4 + p5 + 1 <= p0 + p1 + p2)))))
lola: processed formula length: 88
lola: 3 rewrites
lola: formula mentions 0 of 60 places; total mentions: 0
lola: closed formula file SafeBus-COL-03-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 160 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: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 74 markings, 75 edges
lola: ========================================
lola: subprocess 9 will run for 505 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((A (F ((2 <= p9 + p10 + p11))) U (((3 <= p31 + p32 + p33) OR (p8 + p7 + p6 <= p41 + p40 + p39)) AND (p35 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(A(TRUE U (2 <= p9 + p10 + p11)) U (((3 <= p31 + p32 + p33) OR (p8 + p7 + p6 <= p41 + p40 + p39)) AND (p35 <= 0)))
lola: processed formula length: 116
lola: 2 rewrites
lola: formula mentions 0 of 60 places; total mentions: 0
lola: closed formula file SafeBus-COL-03-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 160 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: 74 markings, 75 edges
lola: ========================================
lola: subprocess 10 will run for 590 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT(E (((2 <= p8 + p7 + p6) U ((3 <= p56 + p57 + p58) AND (2 <= p25 + p26 + p27)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (((p8 + p7 + p6 <= 1) R ((p56 + p57 + p58 <= 2) OR (p25 + p26 + p27 <= 1))))
lola: processed formula: A (((p8 + p7 + p6 <= 1) R ((p56 + p57 + p58 <= 2) OR (p25 + p26 + p27 <= 1))))
lola: processed formula length: 79
lola: 4 rewrites
lola: formula mentions 0 of 60 places; total mentions: 0
lola: closed formula file SafeBus-COL-03-CTLCardinality.task
lola: the resulting B\xfcchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 164 bytes per marking, with 30 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: 4301 markings, 11189 edges
lola: ========================================
lola: subprocess 11 will run for 708 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (X (NOT(E (G ((p34 <= p35))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: EX(A(TRUE U (p35 + 1 <= p34)))
lola: processed formula length: 30
lola: 5 rewrites
lola: formula mentions 0 of 60 places; total mentions: 0
lola: closed formula file SafeBus-COL-03-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 160 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: 160 markings, 162 edges
lola: ========================================
lola: subprocess 12 will run for 885 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((A (F ((2 <= p3 + p4 + p5))) OR (E (X ((p0 + p1 + p2 <= p45 + p44 + p43))) AND ((p25 + p26 + p27 + 1 <= p13 + p14 + p15 + p16 + p17 + p18 + p19 + p21 + p20) OR (p45 + p44 + p43 + 1 <= p8 + p7 + p6)))) OR E ((((p9 + p10 + p11 <= p36 + p37 + p38) AND (1 <= p9 + p10 + p11)) U ((3 <= p42) AND (2 <= p53 + p52 + p50 + p49 + p47 + p46 + p48 + p51 + p54)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 12 will run for 885 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((2 <= p3 + p4 + p5)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F ((2 <= p3 + p4 + p5)))
lola: processed formula: A (F ((2 <= p3 + p4 + p5)))
lola: processed formula length: 27
lola: 1 rewrites
lola: formula mentions 0 of 60 places; total mentions: 0
lola: closed formula file SafeBus-COL-03-CTLCardinality.task
lola: the resulting B\xfcchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 164 bytes per marking, with 31 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: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 46 markings, 46 edges
lola: ========================================
lola: subprocess 13 will run for 1180 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (X ((p0 + p1 + p2 <= p45 + p44 + p43)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: EX((p0 + p1 + p2 <= p45 + p44 + p43))
lola: processed formula length: 37
lola: 2 rewrites
lola: formula mentions 0 of 60 places; total mentions: 0
lola: closed formula file SafeBus-COL-03-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 160 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: subprocess 14 will run for 1770 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E ((((p9 + p10 + p11 <= p36 + p37 + p38) AND (1 <= p9 + p10 + p11)) U ((3 <= p42) AND (2 <= p53 + p52 + p50 + p49 + p47 + p46 + p48 + p51 + p54))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(((p9 + p10 + p11 <= p36 + p37 + p38) AND (1 <= p9 + p10 + p11)) U ((3 <= p42) AND (2 <= p53 + p52 + p50 + p49 + p47 + p46 + p48 + p51 + p54)))
lola: processed formula length: 144
lola: 2 rewrites
lola: formula mentions 0 of 60 places; total mentions: 0
lola: closed formula file SafeBus-COL-03-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 160 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: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 1 markings, 0 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 13 will run for 1180 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E ((((p41 + p40 + p39 <= p12) OR (p31 + p32 + p33 <= p25 + p26 + p27) OR (p3 + p4 + p5 + 1 <= p13 + p14 + p15 + p16 + p17 + p18 + p19 + p21 + p20)) U A (G ((3 <= p34)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(((p41 + p40 + p39 <= p12) OR (p31 + p32 + p33 <= p25 + p26 + p27) OR (p3 + p4 + p5 + 1 <= p13 + p14 + p15 + p16 + p17 + p18 + p19 + p21 + p20)) U NOT(E(TRUE U (p34 <= 2))))
lola: processed formula length: 176
lola: 3 rewrites
lola: formula mentions 0 of 60 places; total mentions: 0
lola: closed formula file SafeBus-COL-03-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 160 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: 4587 markings, 16962 edges
lola: ========================================
lola: subprocess 14 will run for 1769 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (((p31 + p32 + p33 + 1 <= p13 + p14 + p15 + p16 + p17 + p18 + p19 + p21 + p20) U A (G ((p9 + p10 + p11 <= p0 + p1 + p2)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (((p31 + p32 + p33 + 1 <= p13 + p14 + p15 + p16 + p17 + p18 + p19 + p21 + p20) U A (G ((p9 + p10 + p11 <= p0 + p1 + p2)))))
lola: processed formula: A (((p31 + p32 + p33 + 1 <= p13 + p14 + p15 + p16 + p17 + p18 + p19 + p21 + p20) U A (G ((p9 + p10 + p11 <= p0 + p1 + p2)))))
lola: processed formula length: 125
lola: 0 rewrites
lola: formula mentions 0 of 60 places; total mentions: 0
lola: closed formula file SafeBus-COL-03-CTLCardinality.task
lola: the resulting B\xfcchi automaton has 4 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 164 bytes per marking, with 29 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: 8616 markings, 29628 edges
lola: ========================================
lola: subprocess 15 will run for 3539 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (E (G ((((p8 + p7 + p6 <= p41 + p40 + p39) AND (p55 <= p36 + p37 + p38))))) OR (A (F (((p34 <= p56 + p57 + p58) AND (3 <= p9 + p10 + p11)))) AND A (F (((2 <= p25 + p26 + p27) OR (1 <= p30 + p29 + p28))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 15 will run for 3539 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G ((((p8 + p7 + p6 <= p41 + p40 + p39) AND (p55 <= p36 + p37 + p38)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U (((p41 + p40 + p39 + 1 <= p8 + p7 + p6) OR (p36 + p37 + p38 + 1 <= p55)))))
lola: processed formula length: 89
lola: 2 rewrites
lola: formula mentions 0 of 60 places; total mentions: 0
lola: closed formula file SafeBus-COL-03-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 160 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: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 1 markings, 0 edges
lola: ========================================
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 17 will run for 1 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (((2 <= p25 + p26 + p27) OR (1 <= p30 + p29 + p28))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F (((2 <= p25 + p26 + p27) OR (1 <= p30 + p29 + p28))))
lola: processed formula: A (F (((2 <= p25 + p26 + p27) OR (1 <= p30 + p29 + p28))))
lola: processed formula length: 59
lola: 0 rewrites
lola: formula mentions 0 of 60 places; total mentions: 0
lola: closed formula file SafeBus-COL-03-CTLCardinality.task
lola: the resulting B\xfcchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 164 bytes per marking, with 31 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: SUBRESULT
lola: result: unknown
lola: The Boolean predicate may be true or false.
lola: ========================================
lola: RESULT
lola:
SUMMARY: yes no no no yes no no yes yes no yes no no no yes unknown
FORMULA SafeBus-COL-03-CTLCardinality-0 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SafeBus-COL-03-CTLCardinality-1 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SafeBus-COL-03-CTLCardinality-2 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SafeBus-COL-03-CTLCardinality-3 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SafeBus-COL-03-CTLCardinality-4 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SafeBus-COL-03-CTLCardinality-5 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SafeBus-COL-03-CTLCardinality-6 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SafeBus-COL-03-CTLCardinality-7 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SafeBus-COL-03-CTLCardinality-8 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SafeBus-COL-03-CTLCardinality-9 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SafeBus-COL-03-CTLCardinality-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SafeBus-COL-03-CTLCardinality-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SafeBus-COL-03-CTLCardinality-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SafeBus-COL-03-CTLCardinality-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SafeBus-COL-03-CTLCardinality-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SafeBus-COL-03-CTLCardinality-15 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stdout -----
----- Kill lola and sara stderr -----
----- 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="SafeBus-COL-03"
export BK_EXAMINATION="CTLCardinality"
export BK_TOOL="mcc4mcc-structural"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

tar xzf /home/mcc/BenchKit/INPUTS/SafeBus-COL-03.tgz
mv SafeBus-COL-03 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-structural"
echo " Input is SafeBus-COL-03, 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 r155-smll-152685553000178"
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 ;