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 180K
-rw-r--r-- 1 mcc users 4.0K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 20K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 3.5K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 21K 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:27 LTLCardinality.txt
-rw-r--r-- 1 mcc users 8.7K May 26 09:27 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 26 09:27 LTLFireability.txt
-rw-r--r-- 1 mcc users 9.3K May 26 09:27 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K 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 114 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 352 May 15 18:54 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 3.1K 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.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 7 May 15 18:50 instance
-rw-r--r-- 1 mcc users 5 May 15 18:50 iscolored
-rw-r--r-- 1 mcc users 12K May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool mcc4mcc-structural
Input is SharedMemory-COL-000005, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r215-smll-152732266900539
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1527503019409


BK_STOP 1527503065614

--------------------
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 SharedMemory-COL-000005 as instance name.
Using SharedMemory as model name.
Using algorithm or tool bmdt.
Model characteristics are: {'Examination': 'LTLCardinality', 'Place/Transition': True, 'Colored': True, 'Relative-Time': 1, 'Relative-Memory': 1, 'Ordinary': True, 'Simple Free Choice': False, 'Extended Free Choice': False, 'State Machine': False, 'Marked Graph': False, 'Connected': True, 'Strongly Connected': True, 'Source Place': False, 'Sink Place': False, 'Source Transition': False, 'Sink Transition': False, 'Loop Free': False, 'Conservative': False, 'Sub-Conservative': False, 'Nested Units': False, 'Safe': True, 'Deadlock': None, 'Reversible': None, 'Quasi Live': None, 'Live': None}.
Known tools are: [{'Time': 154, 'Memory': 111.83, 'Tool': 'lola'}, {'Time': 193, 'Memory': 110.62, 'Tool': 'lola'}, {'Time': 3800, 'Memory': 262.93, 'Tool': 'itstools'}, {'Time': 4130, 'Memory': 310.7, 'Tool': 'itstools'}].
Learned tools are: [{'Tool': 'lola'}].
Learned tool lola is 1.0x far from the best tool lola.
LTLCardinality lola SharedMemory-COL-000005...
----- Start make prepare stderr -----

Time: 3600 - MCC
----- Start make prepare stdout -----
===========================================================================================
SharedMemory-COL-000005: translating COL Petri net model.pnml into LoLA format
===========================================================================================
translating COL Petri net complete
checking for too many tokens
===========================================================================================
SharedMemory-COL-000005: translating COL formula LTLCardinality into LoLA format
===========================================================================================
translating formula complete
----- Start make result stderr -----
----- Start make result stdout -----
LTLCardinality @ SharedMemory-COL-000005 @ 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: 106/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: finding significant places
lola: 46 places, 60 transitions, 35 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 80 transition conflict sets
lola: TASK
lola: reading formula from SharedMemory-COL-000005-LTLCardinality.task
lola: A ((2 <= p10 + p11 + p12 + p13 + p14)) : A (X (G (G (G ((2 <= p10 + p11 + p12 + p13 + p14)))))) : A (G (F (G (G ((p45 <= p38 + p20 + p21 + p22 + p23 + p37 + p25 + p26 + p27 + p28 + p36 + p30 + p31 + p32 + p33 + p35 + p34 + p29 + p24 + p39 + p40 + p41 + p42 + p43 + p44)))))) : A (G ((p38 + p20 + p21 + p22 + p23 + p37 + p25 + p26 + p27 + p28 + p36 + p30 + p31 + p32 + p33 + p35 + p34 + p29 + p24 + p39 + p40 + p41 + p42 + p43 + p44 <= p15 + p16 + p17 + p18 + p19))) : A ((p0 + p1 + p2 + p3 + p4 <= p5 + p6 + p7 + p8 + p9)) : A (G (X (G (X ((1 <= p45)))))) : A ((1 <= p0 + p1 + p2 + p3 + p4)) : A (X (G (G (F ((p5 + p6 + p7 + p8 + p9 <= p38 + p20 + p21 + p22 + p23 + p37 + p25 + p26 + p27 + p28 + p36 + p30 + p31 + p32 + p33 + p35 + p34 + p29 + p24 + p39 + p40 + p41 + p42 + p43 + p44)))))) : A (F (X (G (X ((2 <= p38 + p20 + p21 + p22 + p23 + p37 + p25 + p26 + p27 + p28 + p36 + p30 + p31 + p32 + p33 + p35 + p34 + p29 + p24 + p39 + p40 + p41 + p42 + p43 + p44)))))) : A (X (F (F (F ((2 <= p38 + p20 + p21 + p22 + p23 + p37 + p25 + p26 + p27 + p28 + p36 + p30 + p31 + p32 + p33 + p35 + p34 + p29 + p24 + p39 + p40 + p41 + p42 + p43 + p44)))))) : A (F (G (X ((3 <= p10 + p11 + p12 + p13 + p14))))) : A (F (X (F (F ((2 <= p10 + p11 + p12 + p13 + p14)))))) : A (F (F ((p45 <= p38 + p20 + p21 + p22 + p23 + p37 + p25 + p26 + p27 + p28 + p36 + p30 + p31 + p32 + p33 + p35 + p34 + p29 + p24 + p39 + p40 + p41 + p42 + p43 + p44)))) : A ((p0 + p1 + p2 + p3 + p4 <= p38 + p20 + p21 + p22 + p23 + p37 + p25 + p26 + p27 + p28 + p36 + p30 + p31 + p32 + p33 + p35 + p34 + p29 + p24 + p39 + p40 + p41 + p42 + p43 + p44)) : A (G ((2 <= p10 + p11 + p12 + p13 + p14))) : A ((F (X ((p5 + p6 + p7 + p8 + p9 <= p38 + p20 + p21 + p22 + p23 + p37 + p25 + p26 + p27 + p28 + p36 + p30 + p31 + p32 + p33 + p35 + p34 + p29 + p24 + p39 + p40 + p41 + p42 + p43 + p44))) U (p45 <= p0 + p1 + p2 + p3 + p4)))
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((2 <= p10 + p11 + p12 + p13 + p14))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (2 <= p10 + p11 + p12 + p13 + p14)
lola: processed formula length: 34
lola: 1 rewrites
lola: formula mentions 0 of 46 places; total mentions: 0
lola: closed formula file SharedMemory-COL-000005-LTLCardinality.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 1 will run for 236 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (G (G (G ((2 <= p10 + p11 + p12 + p13 + p14))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (X (G (G (G ((2 <= p10 + p11 + p12 + p13 + p14))))))
lola: processed formula: A (X (G (G (G ((2 <= p10 + p11 + p12 + p13 + p14))))))
lola: processed formula length: 54
lola: 0 rewrites
lola: formula mentions 0 of 46 places; total mentions: 0
lola: closed formula file SharedMemory-COL-000005-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 8 bytes per marking, with 27 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: 1864 markings, 10405 edges
lola: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (F (G (G ((p45 <= p38 + p20 + p21 + p22 + p23 + p37 + p25 + p26 + p27 + p28 + p36 + p30 + p31 + p32 + p33 + p35 + p34 + p29 + p24 + p39 + p40 + p41 + p42 + p43 + p44))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F (G (G ((p45 <= p38 + p20 + p21 + p22 + p23 + p37 + p25 + p26 + p27 + p28 + p36 + p30 + p31 + p32 + p33 + p35 + p34 + p29 + p24 + p39 + p40 + p41 + p42 + p43 + p44)))))
lola: processed formula: A (F (G (G ((p45 <= p38 + p20 + p21 + p22 + p23 + p37 + p25 + p26 + p27 + p28 + p36 + p30 + p31 + p32 + p33 + p35 + p34 + p29 + p24 + p39 + p40 + p41 + p42 + p43 + p44)))))
lola: processed formula length: 172
lola: 1 rewrites
lola: formula mentions 0 of 46 places; total mentions: 0
lola: closed formula file SharedMemory-COL-000005-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 8 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: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 8 markings, 9 edges
lola: ========================================
lola: subprocess 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((p38 + p20 + p21 + p22 + p23 + p37 + p25 + p26 + p27 + p28 + p36 + p30 + p31 + p32 + p33 + p35 + p34 + p29 + p24 + p39 + p40 + p41 + p42 + p43 + p44 <= p15 + p16 + p17 + p18 + p19)))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 8 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: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 9 markings, 9 edges
lola: ========================================
lola: subprocess 4 will run for 295 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((p0 + p1 + p2 + p3 + p4 <= p5 + p6 + p7 + p8 + p9))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p0 + p1 + p2 + p3 + p4 <= p5 + p6 + p7 + p8 + p9)
lola: processed formula length: 50
lola: 1 rewrites
lola: formula mentions 0 of 46 places; total mentions: 0
lola: closed formula file SharedMemory-COL-000005-LTLCardinality.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 5 will run for 321 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (X (G (X ((1 <= p45))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (G (X (G (X ((1 <= p45))))))
lola: processed formula: A (G (X (G (X ((1 <= p45))))))
lola: processed formula length: 30
lola: 0 rewrites
lola: formula mentions 0 of 46 places; total mentions: 0
lola: closed formula file SharedMemory-COL-000005-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 4 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 8 bytes per marking, with 26 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: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 6 markings, 6 edges
lola: ========================================
lola: subprocess 6 will run for 354 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((1 <= p0 + p1 + p2 + p3 + p4))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (1 <= p0 + p1 + p2 + p3 + p4)
lola: processed formula length: 29
lola: 1 rewrites
lola: formula mentions 0 of 46 places; total mentions: 0
lola: closed formula file SharedMemory-COL-000005-LTLCardinality.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 7 will run for 393 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (G (G (F ((p5 + p6 + p7 + p8 + p9 <= p38 + p20 + p21 + p22 + p23 + p37 + p25 + p26 + p27 + p28 + p36 + p30 + p31 + p32 + p33 + p35 + p34 + p29 + p24 + p39 + p40 + p41 + p42 + p43 + p44))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (X (G (G (F ((p5 + p6 + p7 + p8 + p9 <= p38 + p20 + p21 + p22 + p23 + p37 + p25 + p26 + p27 + p28 + p36 + p30 + p31 + p32 + p33 + p35 + p34 + p29 + p24 + p39 + p40 + p41 + p42 + p43 + p44))))))
lola: processed formula: A (X (G (G (F ((p5 + p6 + p7 + p8 + p9 <= p38 + p20 + p21 + p22 + p23 + p37 + p25 + p26 + p27 + p28 + p36 + p30 + p31 + p32 + p33 + p35 + p34 + p29 + p24 + p39 + p40 + p41 + p42 + p43 + p44))))))
lola: processed formula length: 195
lola: 0 rewrites
lola: formula mentions 0 of 46 places; total mentions: 0
lola: closed formula file SharedMemory-COL-000005-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 8 bytes per marking, with 27 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: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 18 markings, 21 edges
lola: ========================================
lola: subprocess 8 will run for 442 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (X (G (X ((2 <= p38 + p20 + p21 + p22 + p23 + p37 + p25 + p26 + p27 + p28 + p36 + p30 + p31 + p32 + p33 + p35 + p34 + p29 + p24 + p39 + p40 + p41 + p42 + p43 + p44))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F (X (G (X ((2 <= p38 + p20 + p21 + p22 + p23 + p37 + p25 + p26 + p27 + p28 + p36 + p30 + p31 + p32 + p33 + p35 + p34 + p29 + p24 + p39 + p40 + p41 + p42 + p43 + p44))))))
lola: processed formula: A (F (X (G (X ((2 <= p38 + p20 + p21 + p22 + p23 + p37 + p25 + p26 + p27 + p28 + p36 + p30 + p31 + p32 + p33 + p35 + p34 + p29 + p24 + p39 + p40 + p41 + p42 + p43 + p44))))))
lola: processed formula length: 174
lola: 0 rewrites
lola: formula mentions 0 of 46 places; total mentions: 0
lola: closed formula file SharedMemory-COL-000005-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 8 bytes per marking, with 27 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: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 5 markings, 5 edges
lola: ========================================
lola: subprocess 9 will run for 505 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (F (F (F ((2 <= p38 + p20 + p21 + p22 + p23 + p37 + p25 + p26 + p27 + p28 + p36 + p30 + p31 + p32 + p33 + p35 + p34 + p29 + p24 + p39 + p40 + p41 + p42 + p43 + p44))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (X (F ((2 <= p38 + p20 + p21 + p22 + p23 + p37 + p25 + p26 + p27 + p28 + p36 + p30 + p31 + p32 + p33 + p35 + p34 + p29 + p24 + p39 + p40 + p41 + p42 + p43 + p44))))
lola: processed formula: A (X (F ((2 <= p38 + p20 + p21 + p22 + p23 + p37 + p25 + p26 + p27 + p28 + p36 + p30 + p31 + p32 + p33 + p35 + p34 + p29 + p24 + p39 + p40 + p41 + p42 + p43 + p44))))
lola: processed formula length: 166
lola: 2 rewrites
lola: formula mentions 0 of 46 places; total mentions: 0
lola: closed formula file SharedMemory-COL-000005-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 8 bytes per marking, with 27 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: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 4 markings, 4 edges
lola: ========================================
lola: subprocess 10 will run for 590 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (G (X ((3 <= p10 + p11 + p12 + p13 + p14)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F (G (X ((3 <= p10 + p11 + p12 + p13 + p14)))))
lola: processed formula: A (F (G (X ((3 <= p10 + p11 + p12 + p13 + p14)))))
lola: processed formula length: 50
lola: 0 rewrites
lola: formula mentions 0 of 46 places; total mentions: 0
lola: closed formula file SharedMemory-COL-000005-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 8 bytes per marking, with 27 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: 3726 markings, 20790 edges
lola: ========================================
lola: subprocess 11 will run for 708 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (X (F (F ((2 <= p10 + p11 + p12 + p13 + p14))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F (X (F ((2 <= p10 + p11 + p12 + p13 + p14)))))
lola: processed formula: A (F (X (F ((2 <= p10 + p11 + p12 + p13 + p14)))))
lola: processed formula length: 50
lola: 1 rewrites
lola: formula mentions 0 of 46 places; total mentions: 0
lola: closed formula file SharedMemory-COL-000005-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 8 bytes per marking, with 27 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: 11 markings, 10 edges
lola: ========================================
lola: subprocess 12 will run for 885 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (F ((p45 <= p38 + p20 + p21 + p22 + p23 + p37 + p25 + p26 + p27 + p28 + p36 + p30 + p31 + p32 + p33 + p35 + p34 + p29 + p24 + p39 + p40 + p41 + p42 + p43 + p44))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F ((p45 <= p38 + p20 + p21 + p22 + p23 + p37 + p25 + p26 + p27 + p28 + p36 + p30 + p31 + p32 + p33 + p35 + p34 + p29 + p24 + p39 + p40 + p41 + p42 + p43 + p44)))
lola: processed formula: A (F ((p45 <= p38 + p20 + p21 + p22 + p23 + p37 + p25 + p26 + p27 + p28 + p36 + p30 + p31 + p32 + p33 + p35 + p34 + p29 + p24 + p39 + p40 + p41 + p42 + p43 + p44)))
lola: processed formula length: 164
lola: 1 rewrites
lola: formula mentions 0 of 46 places; total mentions: 0
lola: closed formula file SharedMemory-COL-000005-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 8 bytes per marking, with 28 unused bits
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method (--stubborn)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 7 markings, 7 edges
lola: ========================================
lola: subprocess 13 will run for 1180 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((p0 + p1 + p2 + p3 + p4 <= p38 + p20 + p21 + p22 + p23 + p37 + p25 + p26 + p27 + p28 + p36 + p30 + p31 + p32 + p33 + p35 + p34 + p29 + p24 + p39 + p40 + p41 + p42 + p43 + p44))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p0 + p1 + p2 + p3 + p4 <= p38 + p20 + p21 + p22 + p23 + p37 + p25 + p26 + p27 + p28 + p36 + p30 + p31 + p32 + p33 + p35 + p34 + p29 + p24 + p39 + p40 + p41 + p42 + p43 + p44)
lola: processed formula length: 175
lola: 1 rewrites
lola: formula mentions 0 of 46 places; total mentions: 0
lola: closed formula file SharedMemory-COL-000005-LTLCardinality.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: A (G ((2 <= p10 + p11 + p12 + p13 + p14)))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 8 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: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is invariant.
lola: 1863 markings, 4455 edges
lola: ========================================
lola: subprocess 15 will run for 3540 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((F (X ((p5 + p6 + p7 + p8 + p9 <= p38 + p20 + p21 + p22 + p23 + p37 + p25 + p26 + p27 + p28 + p36 + p30 + p31 + p32 + p33 + p35 + p34 + p29 + p24 + p39 + p40 + p41 + p42 + p43 + p44))) U (p45 <= p0 + p1 + p2 + p3 + p4)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A ((F (X ((p5 + p6 + p7 + p8 + p9 <= p38 + p20 + p21 + p22 + p23 + p37 + p25 + p26 + p27 + p28 + p36 + p30 + p31 + p32 + p33 + p35 + p34 + p29 + p24 + p39 + p40 + p41 + p42 + p43 + p44))) U (p45 <= p0 + p1 + p2 + p3 + p4)))
lola: processed formula: A ((F (X ((p5 + p6 + p7 + p8 + p9 <= p38 + p20 + p21 + p22 + p23 + p37 + p25 + p26 + p27 + p28 + p36 + p30 + p31 + p32 + p33 + p35 + p34 + p29 + p24 + p39 + p40 + p41 + p42 + p43 + p44))) U (p45 <= p0 + p1 + p2 + p3 + p4)))
lola: processed formula length: 223
lola: 0 rewrites
lola: formula mentions 0 of 46 places; total mentions: 0
lola: closed formula file SharedMemory-COL-000005-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 8 bytes per marking, with 27 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: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 11 markings, 11 edges
lola: ========================================
lola: RESULT
lola:
SUMMARY: yes yes no no yes no no no no no yes yes no yes yes no
FORMULA SharedMemory-COL-000005-LTLCardinality-0 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SharedMemory-COL-000005-LTLCardinality-1 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SharedMemory-COL-000005-LTLCardinality-2 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SharedMemory-COL-000005-LTLCardinality-3 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SharedMemory-COL-000005-LTLCardinality-4 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SharedMemory-COL-000005-LTLCardinality-5 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SharedMemory-COL-000005-LTLCardinality-6 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SharedMemory-COL-000005-LTLCardinality-7 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SharedMemory-COL-000005-LTLCardinality-8 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SharedMemory-COL-000005-LTLCardinality-9 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SharedMemory-COL-000005-LTLCardinality-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SharedMemory-COL-000005-LTLCardinality-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SharedMemory-COL-000005-LTLCardinality-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SharedMemory-COL-000005-LTLCardinality-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SharedMemory-COL-000005-LTLCardinality-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SharedMemory-COL-000005-LTLCardinality-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stdout -----
----- Kill lola and sara stderr -----
----- Finished stderr -----
----- Finished stdout -----

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="SharedMemory-COL-000005"
export BK_EXAMINATION="LTLCardinality"
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/SharedMemory-COL-000005.tgz
mv SharedMemory-COL-000005 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 SharedMemory-COL-000005, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r215-smll-152732266900539"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "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 "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.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 '' LTLCardinality.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 ;