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 208K
-rw-r--r-- 1 mcc users 3.8K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 23K 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 17K 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.1K May 15 18:50 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 2.3K May 26 09:26 LTLCardinality.txt
-rw-r--r-- 1 mcc users 8.7K May 26 09:26 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K May 26 09:26 LTLFireability.txt
-rw-r--r-- 1 mcc users 9.0K May 26 09:26 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.2K 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 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 16K May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 15 18:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 15 18:54 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 15 18:50 equiv_col
-rw-r--r-- 1 mcc users 4 May 15 18:50 instance
-rw-r--r-- 1 mcc users 6 May 15 18:50 iscolored
-rw-r--r-- 1 mcc users 41K May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool mcc4mcc-structural
Input is FlexibleBarrier-PT-06a, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r095-blw7-152650007000115
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1527583695624


BK_STOP 1527584054952

--------------------
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 FlexibleBarrier-PT-06a as instance name.
Using FlexibleBarrier as model name.
Using algorithm or tool bmdt.
Model characteristics are: {'Examination': 'CTLCardinality', 'Place/Transition': True, 'Colored': False, 'Relative-Time': 1, 'Relative-Memory': 1, 'Ordinary': True, 'Simple Free Choice': False, 'Extended Free Choice': False, 'State Machine': False, 'Marked Graph': False, 'Connected': True, 'Strongly Connected': False, 'Source Place': True, 'Sink Place': False, 'Source Transition': False, 'Sink Transition': False, 'Loop Free': None, 'Conservative': False, 'Sub-Conservative': False, 'Nested Units': True, 'Safe': True, 'Deadlock': None, 'Reversible': None, 'Quasi Live': None, 'Live': None}.
Known tools are: [{'Time': 1785, 'Memory': 168.66, 'Tool': 'gspn'}, {'Time': 2261, 'Memory': 228.09, 'Tool': 'itstools'}, {'Time': 2343, 'Memory': 2206.46, 'Tool': 'marcie'}, {'Time': 140567, 'Memory': 787.19, 'Tool': 'lola'}].
Learned tools are: [{'Tool': 'lola'}].
Learned tool lola is 78.74901960784314x far from the best tool gspn.
CTLCardinality lola FlexibleBarrier-PT-06a...

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


checking for too many tokens
===========================================================================================
FlexibleBarrier-PT-06a: translating PT formula CTLCardinality into LoLA format
===========================================================================================
translating formula complete
touch formulae;
----- Start make result stderr -----
----- Start make result stdout -----
CTLCardinality @ FlexibleBarrier-PT-06a @ 3540 seconds
----- Start make result stderr -----
----- Start make result stdout -----
lola: LoLA will run for 3540 seconds at most (--timelimit)
lola: NET
lola: reading net from model.pnml.lola
lola: finished parsing
lola: closed net file model.pnml.lola
lola: 229/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: finding significant places
lola: 75 places, 154 transitions, 67 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 142 transition conflict sets
lola: TASK
lola: reading formula from FlexibleBarrier-PT-06a-CTLCardinality.task
lola: ((E (((p45 <= p26) U (3 <= p36))) OR NOT(A (F ((p28 <= p10))))) OR NOT(A (((p17 <= p41) U (p47 <= p5))))) : E (F (A (((p73 <= p48) U (3 <= p11))))) : NOT(E ((((p1 <= p64) OR (p55 <= p12)) U ((3 <= p70) OR (2 <= p31))))) : E (((((p25 <= p73) AND (p46 <= p49)) OR ((p71 <= p39) AND (p38 <= p67))) U ((p57 <= p20) AND (3 <= p23) AND (p9 + 1 <= p47)))) : A ((((p69 <= 2) OR (p50 <= 2)) U A (G ((p17 <= p74))))) : (E (((2 <= p26) U ((p3 <= p71) AND (2 <= p40)))) OR NOT((A (X ((p40 <= p2))) AND E (F ((3 <= p42)))))) : A (G (E (X ((p25 <= p19))))) : E (F (((p12 <= 2) AND (3 <= p35) AND (1 <= p62)))) : (E (((p65 <= p63) U ((3 <= p28) OR (3 <= p66)))) OR (3 <= p18)) : A (G (E (G (((p7 <= p39) OR (p29 <= p40)))))) : E (F ((A (G ((p3 <= p31))) AND ((p12 <= p46) AND ((2 <= p69) OR (3 <= p74)))))) : A (G ((((3 <= p20) OR (2 <= p54) OR (p14 <= 2)) OR A (F ((2 <= p36)))))) : E ((((1 <= p39) OR (p21 <= p39) OR (p54 <= 2)) U ((2 <= p22) AND (1 <= p24) AND (p41 + 1 <= p6)))) : A (F ((((3 <= p70) AND (1 <= p50) AND ((3 <= p3) OR (p50 <= p29))) OR E (F ((2 <= p23)))))) : E ((E (X ((p14 <= p71))) U (2 <= p70))) : A (X (E (F (((3 <= p12) AND (1 <= p3))))))
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 (((p45 <= p26) U (3 <= p36))) OR NOT(A (F ((p28 <= p10))))) OR NOT(A (((p17 <= p41) U (p47 <= p5)))))
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: E (((p45 <= p26) U (3 <= p36)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E((p45 <= p26) U (3 <= p36))
lola: processed formula length: 28
lola: 9 rewrites
lola: formula mentions 0 of 75 places; total mentions: 0
lola: closed formula file FlexibleBarrier-PT-06a-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 12 bytes per marking, with 29 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: 1372510 markings, 3442593 edges, 274502 markings/sec, 0 secs
lola: 2430815 markings, 7219873 edges, 211661 markings/sec, 5 secs
lola: 2549684 markings, 10585554 edges, 23774 markings/sec, 10 secs
lola: 2673556 markings, 13802209 edges, 24774 markings/sec, 15 secs
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 2752509 markings, 17173894 edges
lola: ========================================
lola: subprocess 1 will run for 234 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G ((p10 + 1 <= p28)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U (p28 <= p10)))
lola: processed formula length: 27
lola: 10 rewrites
lola: formula mentions 0 of 75 places; total mentions: 0
lola: closed formula file FlexibleBarrier-PT-06a-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 12 bytes per marking, with 29 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 2 will run for 251 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (((p41 + 1 <= p17) R (p5 + 1 <= p47)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A((p17 <= p41) U (p47 <= p5)))
lola: processed formula length: 34
lola: 11 rewrites
lola: formula mentions 0 of 75 places; total mentions: 0
lola: closed formula file FlexibleBarrier-PT-06a-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 12 bytes per marking, with 29 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 1 will run for 234 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (A (((p73 <= p48) U (3 <= p11)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(TRUE U A((p73 <= p48) U (3 <= p11)))
lola: processed formula length: 38
lola: 2 rewrites
lola: formula mentions 0 of 75 places; total mentions: 0
lola: closed formula file FlexibleBarrier-PT-06a-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 12 bytes per marking, with 29 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: 1292235 markings, 4801362 edges, 3689330178019819520 markings/sec, 0 secs
lola: 2289513 markings, 9124895 edges, 199456 markings/sec, 5 secs
lola: 2566039 markings, 12921310 edges, 55305 markings/sec, 10 secs
lola: 2677273 markings, 16190428 edges, 22247 markings/sec, 15 secs
lola: 2779878 markings, 19847702 edges, 20521 markings/sec, 20 secs
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 2811073 markings, 21667352 edges
lola: ========================================
lola: subprocess 2 will run for 249 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT(E ((((p1 <= p64) OR (p55 <= p12)) U ((3 <= p70) OR (2 <= p31)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A ((((p64 + 1 <= p1) AND (p12 + 1 <= p55)) R ((p70 <= 2) AND (p31 <= 1))))
lola: processed formula: A ((((p64 + 1 <= p1) AND (p12 + 1 <= p55)) R ((p70 <= 2) AND (p31 <= 1))))
lola: processed formula length: 74
lola: 4 rewrites
lola: formula mentions 0 of 75 places; total mentions: 0
lola: closed formula file FlexibleBarrier-PT-06a-CTLCardinality.task
lola: the resulting B\xfcchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 12 bytes per marking, with 27 unused bits
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method (--stubborn)
lola: SEARCH
lola: RUNNING
lola: 1069854 markings, 2931979 edges, 213971 markings/sec, 0 secs
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: 1479262 markings, 5643433 edges
lola: ========================================
lola: subprocess 3 will run for 267 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (((((p25 <= p73) AND (p46 <= p49)) OR ((p71 <= p39) AND (p38 <= p67))) U ((p57 <= p20) AND (3 <= p23) AND (p9 + 1 <= p47))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E((((p25 <= p73) AND (p46 <= p49)) OR ((p71 <= p39) AND (p38 <= p67))) U ((p57 <= p20) AND (3 <= p23) AND (p9 + 1 <= p47)))
lola: processed formula length: 124
lola: 1 rewrites
lola: formula mentions 0 of 75 places; total mentions: 0
lola: closed formula file FlexibleBarrier-PT-06a-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 12 bytes per marking, with 29 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: 1368300 markings, 3587006 edges, 273641 markings/sec, 0 secs
lola: 2405164 markings, 7067315 edges, 207373 markings/sec, 5 secs
lola: 2581238 markings, 10599751 edges, 35215 markings/sec, 10 secs
lola: 2695556 markings, 13886681 edges, 22864 markings/sec, 15 secs
lola: 2787316 markings, 17255876 edges, 18352 markings/sec, 20 secs
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 2807443 markings, 18474413 edges
lola: ========================================
lola: subprocess 4 will run for 287 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((((p69 <= 2) OR (p50 <= 2)) U A (G ((p17 <= p74)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A ((((p69 <= 2) OR (p50 <= 2)) U A (G ((p17 <= p74)))))
lola: processed formula: A ((((p69 <= 2) OR (p50 <= 2)) U A (G ((p17 <= p74)))))
lola: processed formula length: 56
lola: 0 rewrites
lola: formula mentions 0 of 75 places; total mentions: 0
lola: closed formula file FlexibleBarrier-PT-06a-CTLCardinality.task
lola: the resulting B\xfcchi automaton has 4 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 12 bytes per marking, with 26 unused bits
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method (--stubborn)
lola: SEARCH
lola: RUNNING
lola: 974598 markings, 2868920 edges, 194920 markings/sec, 0 secs
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: 1212417 markings, 4317185 edges
lola: ========================================
lola: subprocess 5 will run for 313 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (E (((2 <= p26) U ((p3 <= p71) AND (2 <= p40)))) OR NOT((A (X ((p40 <= p2))) AND E (F ((3 <= p42))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 5 will run for 313 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (((2 <= p26) U ((p3 <= p71) AND (2 <= p40))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E((2 <= p26) U ((p3 <= p71) AND (2 <= p40)))
lola: processed formula length: 44
lola: 8 rewrites
lola: formula mentions 0 of 75 places; total mentions: 0
lola: closed formula file FlexibleBarrier-PT-06a-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 12 bytes per marking, with 29 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 344 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (X ((p2 + 1 <= p40)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: EX((p2 + 1 <= p40))
lola: processed formula length: 19
lola: 8 rewrites
lola: formula mentions 0 of 75 places; total mentions: 0
lola: closed formula file FlexibleBarrier-PT-06a-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 12 bytes per marking, with 29 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 7 will run for 382 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((p42 <= 2)))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 12 bytes per marking, with 29 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to FlexibleBarrier-PT-06a-CTLCardinality-7.sara
lola: state equation: calling and running sara
sara: try reading problem file FlexibleBarrier-PT-06a-CTLCardinality-7.sara.
sara: place or transition ordering is non-deterministic

lola: state equation: solution impossible
lola: SUBRESULT
lola: result: yes
lola: produced by: state equation
lola: The predicate is invariant.
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 6 will run for 344 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (E (X ((p25 <= p19)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(E(TRUE U NOT(EX((p25 <= p19)))))
lola: processed formula length: 36
lola: 2 rewrites
lola: formula mentions 0 of 75 places; total mentions: 0
lola: closed formula file FlexibleBarrier-PT-06a-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 12 bytes per marking, with 29 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: 1201891 markings, 3664864 edges, 2864940273891278848 markings/sec, 0 secs
lola: 2155708 markings, 7282761 edges, 190763 markings/sec, 5 secs
lola: 2915011 markings, 10697518 edges, 151861 markings/sec, 10 secs
lola: 2977564 markings, 14260601 edges, 12511 markings/sec, 15 secs
lola: 2982391 markings, 17857171 edges, 965 markings/sec, 20 secs
lola: 2984741 markings, 21552299 edges, 470 markings/sec, 25 secs
lola: 2985957 markings, 25909132 edges, 243 markings/sec, 30 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 2985985 markings, 26666497 edges
lola: ========================================
lola: subprocess 7 will run for 378 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((p12 <= 2) AND (3 <= p35) AND (1 <= p62))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 12 bytes per marking, with 29 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 3 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to FlexibleBarrier-PT-06a-CTLCardinality-7.sara
lola: state equation: calling and running sara
sara: try reading problem file FlexibleBarrier-PT-06a-CTLCardinality-7.sara.
sara: place or transition ordering is non-deterministic

lola: state equation: solution impossible
lola: SUBRESULT
lola: result: no
lola: produced by: state equation
lola: The predicate is unreachable.
lola: ========================================
lola: subprocess 8 will run for 426 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (E (((p65 <= p63) U ((3 <= p28) OR (3 <= p66)))) OR (3 <= p18))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 8 will run for 426 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (((p65 <= p63) U ((3 <= p28) OR (3 <= p66))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E((p65 <= p63) U ((3 <= p28) OR (3 <= p66)))
lola: processed formula length: 45
lola: 1 rewrites
lola: formula mentions 0 of 75 places; total mentions: 0
lola: closed formula file FlexibleBarrier-PT-06a-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 12 bytes per marking, with 29 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: 1456923 markings, 5034057 edges, 291372 markings/sec, 0 secs
lola: 2268642 markings, 9129590 edges, 162344 markings/sec, 5 secs
lola: 2426006 markings, 12706282 edges, 31473 markings/sec, 10 secs
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 2503612 markings, 15539426 edges
lola: ========================================
lola: subprocess 9 will run for 484 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (3 <= p18)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (3 <= p18)
lola: processed formula length: 10
lola: 0 rewrites
lola: formula mentions 0 of 75 places; total mentions: 0
lola: closed formula file FlexibleBarrier-PT-06a-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: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 9 will run for 484 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (E (G (((p7 <= p39) OR (p29 <= p40))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(E(TRUE U A(TRUE U ((p39 + 1 <= p7) AND (p40 + 1 <= p29)))))
lola: processed formula length: 63
lola: 4 rewrites
lola: formula mentions 0 of 75 places; total mentions: 0
lola: closed formula file FlexibleBarrier-PT-06a-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 12 bytes per marking, with 29 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: 16146 markings, 61251 edges
lola: ========================================
lola: subprocess 10 will run for 565 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((A (G ((p3 <= p31))) AND ((p12 <= p46) AND ((2 <= p69) OR (3 <= p74))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(TRUE U (NOT(E(TRUE U (p31 + 1 <= p3))) AND ((p12 <= p46) AND ((2 <= p69) OR (3 <= p74)))))
lola: processed formula length: 93
lola: 3 rewrites
lola: formula mentions 0 of 75 places; total mentions: 0
lola: closed formula file FlexibleBarrier-PT-06a-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 12 bytes per marking, with 29 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: 1021636 markings, 4628626 edges, 204327 markings/sec, 0 secs
lola: 1824550 markings, 8622220 edges, 160583 markings/sec, 5 secs
lola: 2464712 markings, 12709068 edges, 128032 markings/sec, 10 secs
lola: 2593898 markings, 16217881 edges, 25837 markings/sec, 15 secs
lola: 2715594 markings, 19784794 edges, 24339 markings/sec, 20 secs
lola: 2806065 markings, 23717936 edges, 18094 markings/sec, 25 secs
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 2811073 markings, 24221299 edges
lola: ========================================
lola: subprocess 11 will run for 672 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((((3 <= p20) OR (2 <= p54) OR (p14 <= 2)) OR A (F ((2 <= p36))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(E(TRUE U (((p20 <= 2) AND (p54 <= 1) AND (3 <= p14)) AND NOT(A(TRUE U (2 <= p36))))))
lola: processed formula length: 89
lola: 4 rewrites
lola: formula mentions 0 of 75 places; total mentions: 0
lola: closed formula file FlexibleBarrier-PT-06a-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 12 bytes per marking, with 29 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: 1475656 markings, 3923084 edges, 3687031648961953792 markings/sec, 0 secs
lola: 2470327 markings, 7732627 edges, 198934 markings/sec, 5 secs
lola: 2605051 markings, 11291254 edges, 26945 markings/sec, 10 secs
lola: 2730683 markings, 14939634 edges, 25126 markings/sec, 15 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 2811073 markings, 18622022 edges
lola: ========================================
lola: subprocess 12 will run for 834 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E ((((1 <= p39) OR (p21 <= p39) OR (p54 <= 2)) U ((2 <= p22) AND (1 <= p24) AND (p41 + 1 <= p6))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(((1 <= p39) OR (p21 <= p39) OR (p54 <= 2)) U ((2 <= p22) AND (1 <= p24) AND (p41 + 1 <= p6)))
lola: processed formula length: 97
lola: 1 rewrites
lola: formula mentions 0 of 75 places; total mentions: 0
lola: closed formula file FlexibleBarrier-PT-06a-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 12 bytes per marking, with 29 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: 1535130 markings, 4216129 edges, 3689330178019819520 markings/sec, 0 secs
lola: 2587301 markings, 8275209 edges, 210434 markings/sec, 5 secs
lola: 2692757 markings, 11785942 edges, 21091 markings/sec, 10 secs
lola: 2797284 markings, 15567467 edges, 20905 markings/sec, 15 secs
lola: 2870634 markings, 19517421 edges, 14670 markings/sec, 20 secs
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 2874961 markings, 20017757 edges
lola: ========================================
lola: subprocess 13 will run for 1103 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((((3 <= p70) AND (1 <= p50) AND ((3 <= p3) OR (p50 <= p29))) OR E (F ((2 <= p23))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U (((3 <= p70) AND (1 <= p50) AND ((3 <= p3) OR (p50 <= p29))) OR E(TRUE U (2 <= p23))))
lola: processed formula length: 96
lola: 2 rewrites
lola: formula mentions 0 of 75 places; total mentions: 0
lola: closed formula file FlexibleBarrier-PT-06a-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 12 bytes per marking, with 29 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: 1518703 markings, 4018285 edges, 3689330178019819520 markings/sec, 0 secs
lola: 2486818 markings, 8363756 edges, 193623 markings/sec, 5 secs
lola: 2642274 markings, 12294893 edges, 31091 markings/sec, 10 secs
lola: 2775697 markings, 16492882 edges, 26685 markings/sec, 15 secs
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 2811073 markings, 18622032 edges
lola: ========================================
lola: subprocess 14 will run for 1644 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E ((E (X ((p14 <= p71))) U (2 <= p70)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(EX((p14 <= p71)) U (2 <= p70))
lola: processed formula length: 32
lola: 2 rewrites
lola: formula mentions 0 of 75 places; total mentions: 0
lola: closed formula file FlexibleBarrier-PT-06a-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 12 bytes per marking, with 29 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: 1329225 markings, 4117149 edges, 265845 markings/sec, 0 secs
lola: 2308053 markings, 7931004 edges, 195766 markings/sec, 5 secs
lola: 2972668 markings, 12168086 edges, 132923 markings/sec, 10 secs
lola: 2980645 markings, 16180611 edges, 1595 markings/sec, 15 secs
lola: 2983970 markings, 20136662 edges, 665 markings/sec, 20 secs
lola: 2985675 markings, 24267166 edges, 341 markings/sec, 25 secs
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 2985985 markings, 26666497 edges
lola: ========================================
lola: subprocess 15 will run for 3257 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (E (F (((3 <= p12) AND (1 <= p3))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: AX(E(TRUE U ((3 <= p12) AND (1 <= p3))))
lola: processed formula length: 40
lola: 2 rewrites
lola: formula mentions 0 of 75 places; total mentions: 0
lola: closed formula file FlexibleBarrier-PT-06a-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 12 bytes per marking, with 29 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: 1508955 markings, 4765361 edges, 3689330178019819520 markings/sec, 0 secs
lola: 2594539 markings, 9199798 edges, 217117 markings/sec, 5 secs
lola: 2974931 markings, 13178782 edges, 76078 markings/sec, 10 secs
lola: 2981450 markings, 16865642 edges, 1304 markings/sec, 15 secs
lola: 2984208 markings, 20541171 edges, 552 markings/sec, 20 secs
lola: 2985700 markings, 24409113 edges, 298 markings/sec, 25 secs
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 2985984 markings, 26666496 edges
lola: ========================================
lola: RESULT
lola:
SUMMARY: no no yes no yes yes yes no no no no yes no no no no
FORMULA FlexibleBarrier-PT-06a-CTLCardinality-0 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA FlexibleBarrier-PT-06a-CTLCardinality-1 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA FlexibleBarrier-PT-06a-CTLCardinality-2 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA FlexibleBarrier-PT-06a-CTLCardinality-3 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA FlexibleBarrier-PT-06a-CTLCardinality-4 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA FlexibleBarrier-PT-06a-CTLCardinality-5 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA FlexibleBarrier-PT-06a-CTLCardinality-6 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA FlexibleBarrier-PT-06a-CTLCardinality-7 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA FlexibleBarrier-PT-06a-CTLCardinality-8 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA FlexibleBarrier-PT-06a-CTLCardinality-9 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA FlexibleBarrier-PT-06a-CTLCardinality-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA FlexibleBarrier-PT-06a-CTLCardinality-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA FlexibleBarrier-PT-06a-CTLCardinality-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA FlexibleBarrier-PT-06a-CTLCardinality-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA FlexibleBarrier-PT-06a-CTLCardinality-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA FlexibleBarrier-PT-06a-CTLCardinality-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stderr -----
----- Kill lola and sara stdout -----
----- Finished stderr -----
----- Finished stdout -----

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="FlexibleBarrier-PT-06a"
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/FlexibleBarrier-PT-06a.tgz
mv FlexibleBarrier-PT-06a 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 FlexibleBarrier-PT-06a, 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 r095-blw7-152650007000115"
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 ;