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 192K
-rw-r--r-- 1 mcc users 3.6K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 17K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 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 5.9K May 15 18:50 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 2.7K May 15 18:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 12K May 15 18:54 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K 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 3.7K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 18K May 15 18:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 113 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 351 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 14K May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K 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 31K May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool mcc4mcc-full
Input is PhilosophersDyn-COL-03, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r118-csrt-152666479000836
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1527301539362


BK_STOP 1527301582426

--------------------
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 PhilosophersDyn-COL-03 as instance name.
Using PhilosophersDyn 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': 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': True, 'Reversible': None, 'Quasi Live': None, 'Live': None}.
Known tools are: [{'Time': 155, 'Memory': 106.21, 'Tool': 'lola'}, {'Time': 200, 'Memory': 107.78, 'Tool': 'lola'}, {'Time': 1075, 'Memory': 132.62, 'Tool': 'gspn'}, {'Time': 3393, 'Memory': 160.68, 'Tool': 'gspn'}, {'Time': 9459, 'Memory': 7529.15, 'Tool': 'marcie'}, {'Time': 9600, 'Memory': 7529.19, 'Tool': 'marcie'}].
Learned tools are: [{'Tool': 'lola'}].
Learned tool lola is 1.0x far from the best tool lola.
CTLCardinality lola PhilosophersDyn-COL-03...

Time: 3600 - MCC
----- Start make prepare stdout -----
----- Start make prepare stderr -----
===========================================================================================
PhilosophersDyn-COL-03: translating COL Petri net model.pnml into LoLA format
===========================================================================================
translating COL Petri net complete
checking for too many tokens
===========================================================================================
PhilosophersDyn-COL-03: translating COL formula CTLCardinality into LoLA format
===========================================================================================
translating formula complete
----- Start make result stdout -----
----- Start make result stderr -----
CTLCardinality @ PhilosophersDyn-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: 114/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: finding significant places
lola: 30 places, 84 transitions, 19 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 145 transition conflict sets
lola: TASK
lola: reading formula from PhilosophersDyn-COL-03-CTLCardinality.task
lola: E (G (A (F (((p27 + p28 + p29 <= p20 + p19 + p18) AND (p24 + p25 + p26 <= p0 + p1 + p2)))))) : NOT(A (F ((1 <= p27 + p28 + p29)))) : (p20 + p19 + p18 <= p3 + p4 + p5 + p6 + p7 + p8 + p11 + p10 + p9) : E (X (((p3 + p4 + p5 + p6 + p7 + p8 + p11 + p10 + p9 <= 1) AND (p14 + p13 + p12 + 1 <= p27 + p28 + p29) AND ((3 <= p3 + p4 + p5 + p6 + p7 + p8 + p11 + p10 + p9) OR (3 <= p27 + p28 + p29) OR (3 <= p20 + p19 + p18))))) : (E (((p20 + p19 + p18 + 1 <= p15 + p16 + p17) U ((p24 + p25 + p26 <= p23 + p22 + p21) AND (p20 + p19 + p18 <= p15 + p16 + p17)))) OR ((p14 + p13 + p12 + 1 <= p27 + p28 + p29) OR E (G (((3 <= p20 + p19 + p18) OR (p24 + p25 + p26 <= p27 + p28 + p29)))))) : (2 <= p20 + p19 + p18) : NOT(((E (G ((2 <= p24 + p25 + p26))) AND E (F ((2 <= p14 + p13 + p12)))) AND A (X ((p0 + p1 + p2 <= 2))))) : NOT((((2 <= p3 + p4 + p5 + p6 + p7 + p8 + p11 + p10 + p9) OR ((p24 + p25 + p26 <= 2) AND (p0 + p1 + p2 <= 1))) AND (A (F ((p0 + p1 + p2 <= p24 + p25 + p26))) OR A (G ((1 <= p0 + p1 + p2)))))) : ((p3 + p4 + p5 + p6 + p7 + p8 + p11 + p10 + p9 <= p27 + p28 + p29) OR ((p24 + p25 + p26 + 1 <= p3 + p4 + p5 + p6 + p7 + p8 + p11 + p10 + p9) AND (p14 + p13 + p12 <= 0))) : E (F (((p15 + p16 + p17 <= 2) OR (p23 + p22 + p21 + 1 <= p24 + p25 + p26) OR (p14 + p13 + p12 <= p27 + p28 + p29) OR (1 <= p14 + p13 + p12) OR ((1 <= p23 + p22 + p21) AND (p14 + p13 + p12 <= p0 + p1 + p2))))) : E (F (TRUE)) : ((E (F ((p24 + p25 + p26 <= 0))) OR (p0 + p1 + p2 <= p14 + p13 + p12)) OR A (X ((((p0 + p1 + p2 <= p23 + p22 + p21) AND (p20 + p19 + p18 <= p27 + p28 + p29)) OR (p23 + p22 + p21 + 1 <= p24 + p25 + p26))))) : ((1 <= p23 + p22 + p21) OR (3 <= p20 + p19 + p18)) : (p15 + p16 + p17 <= p14 + p13 + p12) : (p3 + p4 + p5 + p6 + p7 + p8 + p11 + p10 + p9 <= p27 + p28 + p29) : A ((E (G (TRUE)) U (p0 + p1 + p2 <= p27 + p28 + p29)))
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G (A (F (((p27 + p28 + p29 <= p20 + p19 + p18) AND (p24 + p25 + p26 <= p0 + p1 + p2))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U NOT(A(TRUE U ((p27 + p28 + p29 <= p20 + p19 + p18) AND (p24 + p25 + p26 <= p0 + p1 + p2))))))
lola: processed formula length: 106
lola: 2 rewrites
lola: formula mentions 0 of 30 places; total mentions: 0
lola: closed formula file PhilosophersDyn-COL-03-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 76 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: 131 markings, 236 edges
lola: ========================================
lola: subprocess 1 will run for 236 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT(A (F ((1 <= p27 + p28 + p29))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U (1 <= p27 + p28 + p29)))
lola: processed formula length: 37
lola: 5 rewrites
lola: formula mentions 0 of 30 places; total mentions: 0
lola: closed formula file PhilosophersDyn-COL-03-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 76 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: 6 markings, 5 edges
lola: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (p20 + p19 + p18 <= p3 + p4 + p5 + p6 + p7 + p8 + p11 + p10 + p9)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p20 + p19 + p18 <= p3 + p4 + p5 + p6 + p7 + p8 + p11 + p10 + p9)
lola: processed formula length: 65
lola: 0 rewrites
lola: formula mentions 0 of 30 places; total mentions: 0
lola: closed formula file PhilosophersDyn-COL-03-CTLCardinality.task
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (X (((p3 + p4 + p5 + p6 + p7 + p8 + p11 + p10 + p9 <= 1) AND (p14 + p13 + p12 + 1 <= p27 + p28 + p29) AND ((3 <= p3 + p4 + p5 + p6 + p7 + p8 + p11 + p10 + p9) OR (3 <= p27 + p28 + p29) OR (3 <= p20 + p19 + p18)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: EX(((p3 + p4 + p5 + p6 + p7 + p8 + p11 + p10 + p9 <= 1) AND (p14 + p13 + p12 + 1 <= p27 + p28 + p29) AND ((3 <= p3 + p4 + p5 + p6 + p7 + p8 + p11 + p10 + p9) OR (3 <= p27 + p28 + p29) OR (3 <= p20 + p19 + p18))))
lola: processed formula length: 214
lola: 1 rewrites
lola: formula mentions 0 of 30 places; total mentions: 0
lola: closed formula file PhilosophersDyn-COL-03-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 76 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 4 will run for 295 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (E (((p20 + p19 + p18 + 1 <= p15 + p16 + p17) U ((p24 + p25 + p26 <= p23 + p22 + p21) AND (p20 + p19 + p18 <= p15 + p16 + p17)))) OR ((p14 + p13 + p12 + 1 <= p27 + p28 + p29) OR E (G (((3 <= p20 + p19 + p18) OR (p24 + p25 + p26 <= p27 + p28 + p29))))))
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 (((p20 + p19 + p18 + 1 <= p15 + p16 + p17) U ((p24 + p25 + p26 <= p23 + p22 + p21) AND (p20 + p19 + p18 <= p15 + p16 + p17))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E((p20 + p19 + p18 + 1 <= p15 + p16 + p17) U ((p24 + p25 + p26 <= p23 + p22 + p21) AND (p20 + p19 + p18 <= p15 + p16 + p17)))
lola: processed formula length: 125
lola: 1 rewrites
lola: formula mentions 0 of 30 places; total mentions: 0
lola: closed formula file PhilosophersDyn-COL-03-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 76 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: 1 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: (2 <= p20 + p19 + p18)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (2 <= p20 + p19 + p18)
lola: processed formula length: 22
lola: 0 rewrites
lola: formula mentions 0 of 30 places; total mentions: 0
lola: closed formula file PhilosophersDyn-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 6 will run for 354 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT(((E (G ((2 <= p24 + p25 + p26))) AND E (F ((2 <= p14 + p13 + p12)))) AND A (X ((p0 + p1 + p2 <= 2)))))
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 ((p24 + p25 + p26 <= 1)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F ((p24 + p25 + p26 <= 1)))
lola: processed formula: A (F ((p24 + p25 + p26 <= 1)))
lola: processed formula length: 30
lola: 12 rewrites
lola: formula mentions 0 of 30 places; total mentions: 0
lola: closed formula file PhilosophersDyn-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 80 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: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 7 will run for 393 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT((((2 <= p3 + p4 + p5 + p6 + p7 + p8 + p11 + p10 + p9) OR ((p24 + p25 + p26 <= 2) AND (p0 + p1 + p2 <= 1))) AND (A (F ((p0 + p1 + p2 <= p24 + p25 + p26))) OR A (G ((1 <= p0 + p1 + p2))))))
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: ((p3 + p4 + p5 + p6 + p7 + p8 + p11 + p10 + p9 <= 1) AND ((3 <= p24 + p25 + p26) OR (2 <= p0 + p1 + p2)))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((p3 + p4 + p5 + p6 + p7 + p8 + p11 + p10 + p9 <= 1) AND ((3 <= p24 + p25 + p26) OR (2 <= p0 + p1 + p2)))
lola: processed formula length: 106
lola: 9 rewrites
lola: formula mentions 0 of 30 places; total mentions: 0
lola: closed formula file PhilosophersDyn-COL-03-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 8 will run for 442 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G ((p24 + p25 + p26 + 1 <= p0 + p1 + p2)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U (p0 + p1 + p2 <= p24 + p25 + p26)))
lola: processed formula length: 48
lola: 11 rewrites
lola: formula mentions 0 of 30 places; total mentions: 0
lola: closed formula file PhilosophersDyn-COL-03-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 76 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 8 will run for 442 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((p3 + p4 + p5 + p6 + p7 + p8 + p11 + p10 + p9 <= p27 + p28 + p29) OR ((p24 + p25 + p26 + 1 <= p3 + p4 + p5 + p6 + p7 + p8 + p11 + p10 + p9) AND (p14 + p13 + p12 <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((p3 + p4 + p5 + p6 + p7 + p8 + p11 + p10 + p9 <= p27 + p28 + p29) OR ((p24 + p25 + p26 + 1 <= p3 + p4 + p5 + p6 + p7 + p8 + p11 + p10 + p9) AND (p14 + p13 + p12 <= 0)))
lola: processed formula length: 170
lola: 0 rewrites
lola: formula mentions 0 of 30 places; total mentions: 0
lola: closed formula file PhilosophersDyn-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: subprocess 9 will run for 505 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((p15 + p16 + p17 <= 2) OR (p23 + p22 + p21 + 1 <= p24 + p25 + p26) OR (p14 + p13 + p12 <= p27 + p28 + p29) OR (1 <= p14 + p13 + p12) OR ((1 <= p23 + p22 + p21) AND (p14 + p13 + p12 <= p0 + p1 + p2)))))
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 76 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 6 literals and 5 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 10 will run for 590 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (TRUE))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: TRUE
lola: processed formula length: 4
lola: 3 rewrites
lola: formula mentions 0 of 30 places; total mentions: 0
lola: closed formula file PhilosophersDyn-COL-03-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 11 will run for 708 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((E (F ((p24 + p25 + p26 <= 0))) OR (p0 + p1 + p2 <= p14 + p13 + p12)) OR A (X ((((p0 + p1 + p2 <= p23 + p22 + p21) AND (p20 + p19 + p18 <= p27 + p28 + p29)) OR (p23 + p22 + p21 + 1 <= p24 + p25 + p26)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 11 will run for 708 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((p24 + p25 + p26 <= 0)))
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 76 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: state equation: write sara problem file to PhilosophersDyn-COL-03-CTLCardinality-11.sara
lola: 0 markings, 0 edges
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: state equation: calling and running sara
lola: ========================================
lola: subprocess 12 will run for 885 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((1 <= p23 + p22 + p21) OR (3 <= p20 + p19 + p18))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((1 <= p23 + p22 + p21) OR (3 <= p20 + p19 + p18))
lola: processed formula length: 51
lola: 0 rewrites
lola: formula mentions 0 of 30 places; total mentions: 0
lola: closed formula file PhilosophersDyn-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 13 will run for 1180 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (p15 + p16 + p17 <= p14 + p13 + p12)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p15 + p16 + p17 <= p14 + p13 + p12)
lola: processed formula length: 36
lola: 0 rewrites
lola: formula mentions 0 of 30 places; total mentions: 0
lola: closed formula file PhilosophersDyn-COL-03-CTLCardinality.task
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 14 will run for 1770 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (p3 + p4 + p5 + p6 + p7 + p8 + p11 + p10 + p9 <= p27 + p28 + p29)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p3 + p4 + p5 + p6 + p7 + p8 + p11 + p10 + p9 <= p27 + p28 + p29)
lola: processed formula length: 65
lola: 0 rewrites
lola: formula mentions 0 of 30 places; total mentions: 0
lola: closed formula file PhilosophersDyn-COL-03-CTLCardinality.task
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 15 will run for 3540 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((E (G (TRUE)) U (p0 + p1 + p2 <= p27 + p28 + p29)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F ((p0 + p1 + p2 <= p27 + p28 + p29)))
lola: processed formula: A (F ((p0 + p1 + p2 <= p27 + p28 + p29)))
lola: processed formula length: 41
lola: 4 rewrites
lola: formula mentions 0 of 30 places; total mentions: 0
lola: closed formula file PhilosophersDyn-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 80 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: RESULT
lola:
SUMMARY: no yes yes no yes no yes no yes yes yes yes no yes yes yes
sara: try reading problem file PhilosophersDyn-COL-03-CTLCardinality-11.sara.
sara: place or transition ordering is non-deterministic

FORMULA PhilosophersDyn-COL-03-CTLCardinality-0 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PhilosophersDyn-COL-03-CTLCardinality-1 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PhilosophersDyn-COL-03-CTLCardinality-2 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PhilosophersDyn-COL-03-CTLCardinality-3 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PhilosophersDyn-COL-03-CTLCardinality-4 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PhilosophersDyn-COL-03-CTLCardinality-5 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PhilosophersDyn-COL-03-CTLCardinality-6 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PhilosophersDyn-COL-03-CTLCardinality-7 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PhilosophersDyn-COL-03-CTLCardinality-8 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PhilosophersDyn-COL-03-CTLCardinality-9 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PhilosophersDyn-COL-03-CTLCardinality-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PhilosophersDyn-COL-03-CTLCardinality-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PhilosophersDyn-COL-03-CTLCardinality-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PhilosophersDyn-COL-03-CTLCardinality-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PhilosophersDyn-COL-03-CTLCardinality-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PhilosophersDyn-COL-03-CTLCardinality-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stdout -----
----- Kill lola and sara stderr -----
----- Finished stdout -----
----- Finished stderr -----

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="PhilosophersDyn-COL-03"
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/PhilosophersDyn-COL-03.tgz
mv PhilosophersDyn-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-full"
echo " Input is PhilosophersDyn-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 r118-csrt-152666479000836"
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 ;