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 176K
-rw-r--r-- 1 mcc users 3.6K 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 3.2K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 19K 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.2K May 15 18:50 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 2.1K May 15 18:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 8.4K May 15 18:54 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K May 15 18:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 8.6K 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 19K May 15 18:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 108 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 346 May 15 18:54 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 3.0K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 15K 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.7K 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 4 May 15 18:50 instance
-rw-r--r-- 1 mcc users 5 May 15 18:50 iscolored
-rw-r--r-- 1 mcc users 11K May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool irma4mcc-full
Input is TokenRing-COL-005, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r174-smll-152708745000241
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1527164850387


BK_STOP 1527164895507

--------------------
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 TokenRing-COL-005 as instance name.
Using TokenRing 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': True, 'Sub-Conservative': True, 'Nested Units': False, 'Safe': None, 'Deadlock': False, 'Reversible': False, 'Quasi Live': True, 'Live': True}.
Known tools are: [{'Time': 286, 'Memory': 105.55, 'Tool': 'lola'}, {'Time': 321, 'Memory': 106.72, 'Tool': 'lola'}, {'Time': 686, 'Memory': 101.32, 'Tool': 'gspn'}, {'Time': 5574, 'Memory': 169.41, 'Tool': 'gspn'}].
Learned tools are: [{'Tool': 'lola'}].
Learned tool lola is 1.0x far from the best tool lola.
CTLCardinality lola TokenRing-COL-005...
----- Start make prepare stderr -----

Time: 3600 - MCC
----- Start make prepare stdout -----
===========================================================================================
TokenRing-COL-005: translating COL Petri net model.pnml into LoLA format
===========================================================================================
translating COL Petri net complete
checking for too many tokens
===========================================================================================
TokenRing-COL-005: translating COL formula CTLCardinality into LoLA format
===========================================================================================
translating formula complete
----- Start make result stderr -----
----- Start make result stdout -----
CTLCardinality @ TokenRing-COL-005 @ 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: 192/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: finding significant places
lola: 36 places, 156 transitions, 30 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 192 transition conflict sets
lola: TASK
lola: reading formula from TokenRing-COL-005-CTLCardinality.task
lola: ((p0 + p1 + p2 + p3 + p4 + p34 + p6 + p7 + p8 + p9 + p10 + p33 + p12 + p13 + p14 + p15 + p16 + p32 + p18 + p19 + p20 + p21 + p22 + p31 + p24 + p25 + p26 + p27 + p28 + p30 + p29 + p23 + p17 + p11 + p5 + p35 <= 0) OR (((1 <= p0 + p1 + p2 + p3 + p4 + p34 + p6 + p7 + p8 + p9 + p10 + p33 + p12 + p13 + p14 + p15 + p16 + p32 + p18 + p19 + p20 + p21 + p22 + p31 + p24 + p25 + p26 + p27 + p28 + p30 + p29 + p23 + p17 + p11 + p5 + p35)) AND (p0 + p1 + p2 + p3 + p4 + p34 + p6 + p7 + p8 + p9 + p10 + p33 + p12 + p13 + p14 + p15 + p16 + p32 + p18 + p19 + p20 + p21 + p22 + p31 + p24 + p25 + p26 + p27 + p28 + p30 + p29 + p23 + p17 + p11 + p5 + p35 <= 0))) : E (G (A (G (FALSE)))) : FALSE : (3 <= p0 + p1 + p2 + p3 + p4 + p34 + p6 + p7 + p8 + p9 + p10 + p33 + p12 + p13 + p14 + p15 + p16 + p32 + p18 + p19 + p20 + p21 + p22 + p31 + p24 + p25 + p26 + p27 + p28 + p30 + p29 + p23 + p17 + p11 + p5 + p35) : TRUE : NOT(A ((((1 <= p0 + p1 + p2 + p3 + p4 + p34 + p6 + p7 + p8 + p9 + p10 + p33 + p12 + p13 + p14 + p15 + p16 + p32 + p18 + p19 + p20 + p21 + p22 + p31 + p24 + p25 + p26 + p27 + p28 + p30 + p29 + p23 + p17 + p11 + p5 + p35) AND (1 <= p0 + p1 + p2 + p3 + p4 + p34 + p6 + p7 + p8 + p9 + p10 + p33 + p12 + p13 + p14 + p15 + p16 + p32 + p18 + p19 + p20 + p21 + p22 + p31 + p24 + p25 + p26 + p27 + p28 + p30 + p29 + p23 + p17 + p11 + p5 + p35)) U (2 <= p0 + p1 + p2 + p3 + p4 + p34 + p6 + p7 + p8 + p9 + p10 + p33 + p12 + p13 + p14 + p15 + p16 + p32 + p18 + p19 + p20 + p21 + p22 + p31 + p24 + p25 + p26 + p27 + p28 + p30 + p29 + p23 + p17 + p11 + p5 + p35)))) : (NOT(E (F (()))) OR A (X (((1 <= p0 + p1 + p2 + p3 + p4 + p34 + p6 + p7 + p8 + p9 + p10 + p33 + p12 + p13 + p14 + p15 + p16 + p32 + p18 + p19 + p20 + p21 + p22 + p31 + p24 + p25 + p26 + p27 + p28 + p30 + p29 + p23 + p17 + p11 + p5 + p35))))) : E ((E (F (TRUE)) U (1 <= p0 + p1 + p2 + p3 + p4 + p34 + p6 + p7 + p8 + p9 + p10 + p33 + p12 + p13 + p14 + p15 + p16 + p32 + p18 + p19 + p20 + p21 + p22 + p31 + p24 + p25 + p26 + p27 + p28 + p30 + p29 + p23 + p17 + p11 + p5 + p35))) : ((E (X (((3 <= p0 + p1 + p2 + p3 + p4 + p34 + p6 + p7 + p8 + p9 + p10 + p33 + p12 + p13 + p14 + p15 + p16 + p32 + p18 + p19 + p20 + p21 + p22 + p31 + p24 + p25 + p26 + p27 + p28 + p30 + p29 + p23 + p17 + p11 + p5 + p35)))) AND A (F (TRUE))) OR (E (X ((p0 + p1 + p2 + p3 + p4 + p34 + p6 + p7 + p8 + p9 + p10 + p33 + p12 + p13 + p14 + p15 + p16 + p32 + p18 + p19 + p20 + p21 + p22 + p31 + p24 + p25 + p26 + p27 + p28 + p30 + p29 + p23 + p17 + p11 + p5 + p35 <= 1))) OR A (F (())))) : ((((2 <= p0 + p1 + p2 + p3 + p4 + p34 + p6 + p7 + p8 + p9 + p10 + p33 + p12 + p13 + p14 + p15 + p16 + p32 + p18 + p19 + p20 + p21 + p22 + p31 + p24 + p25 + p26 + p27 + p28 + p30 + p29 + p23 + p17 + p11 + p5 + p35) OR E (G ((2 <= p0 + p1 + p2 + p3 + p4 + p34 + p6 + p7 + p8 + p9 + p10 + p33 + p12 + p13 + p14 + p15 + p16 + p32 + p18 + p19 + p20 + p21 + p22 + p31 + p24 + p25 + p26 + p27 + p28 + p30 + p29 + p23 + p17 + p11 + p5 + p35)))) OR E (X (FALSE))) OR TRUE) : NOT(A (G (()))) : NOT(A ((((1 <= p0 + p1 + p2 + p3 + p4 + p34 + p6 + p7 + p8 + p9 + p10 + p33 + p12 + p13 + p14 + p15 + p16 + p32 + p18 + p19 + p20 + p21 + p22 + p31 + p24 + p25 + p26 + p27 + p28 + p30 + p29 + p23 + p17 + p11 + p5 + p35)) U ()))) : A (F (E (X (TRUE)))) : (3 <= p0 + p1 + p2 + p3 + p4 + p34 + p6 + p7 + p8 + p9 + p10 + p33 + p12 + p13 + p14 + p15 + p16 + p32 + p18 + p19 + p20 + p21 + p22 + p31 + p24 + p25 + p26 + p27 + p28 + p30 + p29 + p23 + p17 + p11 + p5 + p35) : (((p0 + p1 + p2 + p3 + p4 + p34 + p6 + p7 + p8 + p9 + p10 + p33 + p12 + p13 + p14 + p15 + p16 + p32 + p18 + p19 + p20 + p21 + p22 + p31 + p24 + p25 + p26 + p27 + p28 + p30 + p29 + p23 + p17 + p11 + p5 + p35 <= 1) OR (E (G (TRUE)) AND ())) OR TRUE) : A (F ((E (X ((2 <= p0 + p1 + p2 + p3 + p4 + p34 + p6 + p7 + p8 + p9 + p10 + p33 + p12 + p13 + p14 + p15 + p16 + p32 + p18 + p19 + p20 + p21 + p22 + p31 + p24 + p25 + p26 + p27 + p28 + p30 + p29 + p23 + p17 + p11 + p5 + p35))) AND ())))
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((p0 + p1 + p2 + p3 + p4 + p34 + p6 + p7 + p8 + p9 + p10 + p33 + p12 + p13 + p14 + p15 + p16 + p32 + p18 + p19 + p20 + p21 + p22 + p31 + p24 + p25 + p26 + p27 + p28 + p30 + p29 + p23 + p17 + p11 + p5 + p35 <= 0) OR (((1 <= p0 + p1 + p2 + p3 + p4 + p34 + p6 + p7 + p8 + p9 + p10 + p33 + p12 + p13 + p14 + p15 + p16 + p32 + p18 + p19 + p20 + p21 + p22 + p31 + p24 + p25 + p26 + p27 + p28 + p30 + p29 +... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((p0 + p1 + p2 + p3 + p4 + p34 + p6 + p7 + p8 + p9 + p10 + p33 + p12 + p13 + p14 + p15 + p16 + p32 + p18 + p19 + p20 + p21 + p22 + p31 + p24 + p25 + p26 + p27 + p28 + p30 + p29 + p23 + p17 + p11 + p5 + p35 <= 0) OR (((1 <= p0 + p1 + p2 + p3 + p4 + p34 + p6 + p7 + p8 + p9 + p10 + p33 + p12 + p13 + p14 + p15 + p16 + p32 + p18 + p19 + p20 + p21 + p22 + p31 + p24 + p25 + p26 + p27 + p28 + p30 + p29 +... (shortened)
lola: processed formula length: 646
lola: 0 rewrites
lola: formula mentions 0 of 36 places; total mentions: 0
lola: closed formula file TokenRing-COL-005-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 1 will run for 236 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G (A (G (FALSE))))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FALSE
lola: processed formula length: 5
lola: 5 rewrites
lola: formula mentions 0 of 36 places; total mentions: 0
lola: closed formula file TokenRing-COL-005-CTLCardinality.task
lola: processed formula with 0 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: FALSE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FALSE
lola: processed formula length: 5
lola: 1 rewrites
lola: formula mentions 0 of 36 places; total mentions: 0
lola: closed formula file TokenRing-COL-005-CTLCardinality.task
lola: processed formula with 0 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 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (3 <= p0 + p1 + p2 + p3 + p4 + p34 + p6 + p7 + p8 + p9 + p10 + p33 + p12 + p13 + p14 + p15 + p16 + p32 + p18 + p19 + p20 + p21 + p22 + p31 + p24 + p25 + p26 + p27 + p28 + p30 + p29 + p23 + p17 + p11 + p5 + p35)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (3 <= p0 + p1 + p2 + p3 + p4 + p34 + p6 + p7 + p8 + p9 + p10 + p33 + p12 + p13 + p14 + p15 + p16 + p32 + p18 + p19 + p20 + p21 + p22 + p31 + p24 + p25 + p26 + p27 + p28 + p30 + p29 + p23 + p17 + p11 + p5 + p35)
lola: processed formula length: 210
lola: 0 rewrites
lola: formula mentions 0 of 36 places; total mentions: 0
lola: closed formula file TokenRing-COL-005-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 4 will run for 295 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: TRUE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: TRUE
lola: processed formula length: 4
lola: 1 rewrites
lola: formula mentions 0 of 36 places; total mentions: 0
lola: closed formula file TokenRing-COL-005-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 5 will run for 321 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT(A ((((1 <= p0 + p1 + p2 + p3 + p4 + p34 + p6 + p7 + p8 + p9 + p10 + p33 + p12 + p13 + p14 + p15 + p16 + p32 + p18 + p19 + p20 + p21 + p22 + p31 + p24 + p25 + p26 + p27 + p28 + p30 + p29 + p23 + p17 + p11 + p5 + p35) AND (1 <= p0 + p1 + p2 + p3 + p4 + p34 + p6 + p7 + p8 + p9 + p10 + p33 + p12 + p13 + p14 + p15 + p16 + p32 + p18 + p19 + p20 + p21 + p22 + p31 + p24 + p25 + p26 + p27 + p28 + p30 +... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(((1 <= p0 + p1 + p2 + p3 + p4 + p34 + p6 + p7 + p8 + p9 + p10 + p33 + p12 + p13 + p14 + p15 + p16 + p32 + p18 + p19 + p20 + p21 + p22 + p31 + p24 + p25 + p26 + p27 + p28 + p30 + p29 + p23 + p17 + p11 + p5 + p35) AND (1 <= p0 + p1 + p2 + p3 + p4 + p34 + p6 + p7 + p8 + p9 + p10 + p33 + p12 + p13 + p14 + p15 + p16 + p32 + p18 + p19 + p20 + p21 + p22 + p31 + p24 + p25 + p26 + p27 + p28 + p30 + p... (shortened)
lola: processed formula length: 648
lola: 7 rewrites
lola: formula mentions 0 of 36 places; total mentions: 0
lola: closed formula file TokenRing-COL-005-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 120 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: subprocess 6 will run for 354 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (NOT(E (F (()))) OR A (X (((1 <= p0 + p1 + p2 + p3 + p4 + p34 + p6 + p7 + p8 + p9 + p10 + p33 + p12 + p13 + p14 + p15 + p16 + p32 + p18 + p19 + p20 + p21 + p22 + p31 + p24 + p25 + p26 + p27 + p28 + p30 + p29 + p23 + p17 + p11 + p5 + p35)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (X (((1 <= p0 + p1 + p2 + p3 + p4 + p34 + p6 + p7 + p8 + p9 + p10 + p33 + p12 + p13 + p14 + p15 + p16 + p32 + p18 + p19 + p20 + p21 + p22 + p31 + p24 + p25 + p26 + p27 + p28 + p30 + p29 + p23 + p17 + p11 + p5 + p35))))
lola: processed formula: A (X (((1 <= p0 + p1 + p2 + p3 + p4 + p34 + p6 + p7 + p8 + p9 + p10 + p33 + p12 + p13 + p14 + p15 + p16 + p32 + p18 + p19 + p20 + p21 + p22 + p31 + p24 + p25 + p26 + p27 + p28 + p30 + p29 + p23 + p17 + p11 + p5 + p35))))
lola: processed formula length: 220
lola: 5 rewrites
lola: formula mentions 0 of 36 places; total mentions: 0
lola: closed formula file TokenRing-COL-005-CTLCardinality.task
lola: the resulting B\xfcchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 124 bytes per marking, with 30 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 6 markings, 5 edges
lola: ========================================
lola: subprocess 7 will run for 393 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E ((E (F (TRUE)) U (1 <= p0 + p1 + p2 + p3 + p4 + p34 + p6 + p7 + p8 + p9 + p10 + p33 + p12 + p13 + p14 + p15 + p16 + p32 + p18 + p19 + p20 + p21 + p22 + p31 + p24 + p25 + p26 + p27 + p28 + p30 + p29 + p23 + p17 + p11 + p5 + p35)))
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 120 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: 0 markings, 0 edges
lola: ========================================
lola: subprocess 8 will run for 442 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((E (X (((3 <= p0 + p1 + p2 + p3 + p4 + p34 + p6 + p7 + p8 + p9 + p10 + p33 + p12 + p13 + p14 + p15 + p16 + p32 + p18 + p19 + p20 + p21 + p22 + p31 + p24 + p25 + p26 + p27 + p28 + p30 + p29 + p23 + p17 + p11 + p5 + p35)))) AND A (F (TRUE))) OR (E (X ((p0 + p1 + p2 + p3 + p4 + p34 + p6 + p7 + p8 + p9 + p10 + p33 + p12 + p13 + p14 + p15 + p16 + p32 + p18 + p19 + p20 + p21 + p22 + p31 + p24 + p25 + p... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: TRUE
lola: processed formula length: 4
lola: 9 rewrites
lola: formula mentions 0 of 36 places; total mentions: 0
lola: closed formula file TokenRing-COL-005-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 9 will run for 505 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((((2 <= p0 + p1 + p2 + p3 + p4 + p34 + p6 + p7 + p8 + p9 + p10 + p33 + p12 + p13 + p14 + p15 + p16 + p32 + p18 + p19 + p20 + p21 + p22 + p31 + p24 + p25 + p26 + p27 + p28 + p30 + p29 + p23 + p17 + p11 + p5 + p35) OR E (G ((2 <= p0 + p1 + p2 + p3 + p4 + p34 + p6 + p7 + p8 + p9 + p10 + p33 + p12 + p13 + p14 + p15 + p16 + p32 + p18 + p19 + p20 + p21 + p22 + p31 + p24 + p25 + p26 + p27 + p28 + p30 + ... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: TRUE
lola: processed formula length: 4
lola: 9 rewrites
lola: formula mentions 0 of 36 places; total mentions: 0
lola: closed formula file TokenRing-COL-005-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 10 will run for 590 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT(A (G (())))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: TRUE
lola: processed formula length: 4
lola: 4 rewrites
lola: formula mentions 0 of 36 places; total mentions: 0
lola: closed formula file TokenRing-COL-005-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: NOT(A ((((1 <= p0 + p1 + p2 + p3 + p4 + p34 + p6 + p7 + p8 + p9 + p10 + p33 + p12 + p13 + p14 + p15 + p16 + p32 + p18 + p19 + p20 + p21 + p22 + p31 + p24 + p25 + p26 + p27 + p28 + p30 + p29 + p23 + p17 + p11 + p5 + p35)) U ())))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(((1 <= p0 + p1 + p2 + p3 + p4 + p34 + p6 + p7 + p8 + p9 + p10 + p33 + p12 + p13 + p14 + p15 + p16 + p32 + p18 + p19 + p20 + p21 + p22 + p31 + p24 + p25 + p26 + p27 + p28 + p30 + p29 + p23 + p17 + p11 + p5 + p35)) U ()))
lola: processed formula length: 225
lola: 7 rewrites
lola: formula mentions 0 of 36 places; total mentions: 0
lola: closed formula file TokenRing-COL-005-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 120 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: subprocess 12 will run for 885 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (E (X (TRUE))))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: TRUE
lola: processed formula length: 4
lola: 5 rewrites
lola: formula mentions 0 of 36 places; total mentions: 0
lola: closed formula file TokenRing-COL-005-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 13 will run for 1180 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (3 <= p0 + p1 + p2 + p3 + p4 + p34 + p6 + p7 + p8 + p9 + p10 + p33 + p12 + p13 + p14 + p15 + p16 + p32 + p18 + p19 + p20 + p21 + p22 + p31 + p24 + p25 + p26 + p27 + p28 + p30 + p29 + p23 + p17 + p11 + p5 + p35)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (3 <= p0 + p1 + p2 + p3 + p4 + p34 + p6 + p7 + p8 + p9 + p10 + p33 + p12 + p13 + p14 + p15 + p16 + p32 + p18 + p19 + p20 + p21 + p22 + p31 + p24 + p25 + p26 + p27 + p28 + p30 + p29 + p23 + p17 + p11 + p5 + p35)
lola: processed formula length: 210
lola: 0 rewrites
lola: formula mentions 0 of 36 places; total mentions: 0
lola: closed formula file TokenRing-COL-005-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: (((p0 + p1 + p2 + p3 + p4 + p34 + p6 + p7 + p8 + p9 + p10 + p33 + p12 + p13 + p14 + p15 + p16 + p32 + p18 + p19 + p20 + p21 + p22 + p31 + p24 + p25 + p26 + p27 + p28 + p30 + p29 + p23 + p17 + p11 + p5 + p35 <= 1) OR (E (G (TRUE)) AND ())) OR TRUE)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: TRUE
lola: processed formula length: 4
lola: 8 rewrites
lola: formula mentions 0 of 36 places; total mentions: 0
lola: closed formula file TokenRing-COL-005-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 15 will run for 3540 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((E (X ((2 <= p0 + p1 + p2 + p3 + p4 + p34 + p6 + p7 + p8 + p9 + p10 + p33 + p12 + p13 + p14 + p15 + p16 + p32 + p18 + p19 + p20 + p21 + p22 + p31 + p24 + p25 + p26 + p27 + p28 + p30 + p29 + p23 + p17 + p11 + p5 + p35))) AND ())))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U (EX((2 <= p0 + p1 + p2 + p3 + p4 + p34 + p6 + p7 + p8 + p9 + p10 + p33 + p12 + p13 + p14 + p15 + p16 + p32 + p18 + p19 + p20 + p21 + p22 + p31 + p24 + p25 + p26 + p27 + p28 + p30 + p29 + p23 + p17 + p11 + p5 + p35)) AND ()))
lola: processed formula length: 233
lola: 2 rewrites
lola: formula mentions 0 of 36 places; total mentions: 0
lola: closed formula file TokenRing-COL-005-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 120 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: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 1 markings, 0 edges
lola: ========================================
lola: RESULT
lola:
SUMMARY: no no no yes yes no yes yes yes yes yes no yes yes yes yes
FORMULA TokenRing-COL-005-CTLCardinality-0 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA TokenRing-COL-005-CTLCardinality-1 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA TokenRing-COL-005-CTLCardinality-2 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA TokenRing-COL-005-CTLCardinality-3 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA TokenRing-COL-005-CTLCardinality-4 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA TokenRing-COL-005-CTLCardinality-5 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA TokenRing-COL-005-CTLCardinality-6 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA TokenRing-COL-005-CTLCardinality-7 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA TokenRing-COL-005-CTLCardinality-8 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA TokenRing-COL-005-CTLCardinality-9 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA TokenRing-COL-005-CTLCardinality-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA TokenRing-COL-005-CTLCardinality-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA TokenRing-COL-005-CTLCardinality-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA TokenRing-COL-005-CTLCardinality-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA TokenRing-COL-005-CTLCardinality-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA TokenRing-COL-005-CTLCardinality-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stderr -----
----- Kill lola and sara stdout -----
----- 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="TokenRing-COL-005"
export BK_EXAMINATION="CTLCardinality"
export BK_TOOL="irma4mcc-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/TokenRing-COL-005.tgz
mv TokenRing-COL-005 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 irma4mcc-full"
echo " Input is TokenRing-COL-005, 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 r174-smll-152708745000241"
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 ;