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 188K
-rw-r--r-- 1 mcc users 3.4K 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 2.8K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 15K May 15 18:54 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K May 15 18:50 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 5.7K May 15 18:50 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 2.6K May 26 09:26 LTLCardinality.txt
-rw-r--r-- 1 mcc users 12K May 26 09:26 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 26 09:26 LTLFireability.txt
-rw-r--r-- 1 mcc users 9.7K May 26 09:26 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.9K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 20K May 15 18:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 115 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 353 May 15 18:54 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 3.7K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 19K 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.8K 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 17 May 15 18:50 instance
-rw-r--r-- 1 mcc users 6 May 15 18:50 iscolored
-rw-r--r-- 1 mcc users 21K May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool mcc4mcc-structural
Input is GPPP-PT-C1000N0000001000, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r251-blw7-152732553000101
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1528025436895


BK_STOP 1528025903201

--------------------
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 GPPP-PT-C1000N0000001000 as instance name.
Using GPPP as model name.
Using algorithm or tool bmdt.
Model characteristics are: {'Examination': 'LTLCardinality', 'Place/Transition': True, 'Colored': False, 'Relative-Time': 1, 'Relative-Memory': 1, 'Ordinary': False, 'Simple Free Choice': False, 'Extended Free Choice': False, 'State Machine': False, 'Marked Graph': False, 'Connected': True, 'Strongly Connected': True, 'Source Place': False, 'Sink Place': False, 'Source Transition': False, 'Sink Transition': False, 'Loop Free': True, 'Conservative': False, 'Sub-Conservative': False, 'Nested Units': False, 'Safe': False, 'Deadlock': None, 'Reversible': None, 'Quasi Live': True, 'Live': None}.
Known tools are: [{'Time': 533846, 'Memory': 15948.99, 'Tool': 'lola'}, {'Time': 540976, 'Memory': 15948.59, 'Tool': 'lola'}, {'Time': 878618, 'Memory': 15947.46, 'Tool': 'itstools'}, {'Time': 895536, 'Memory': 15936.52, 'Tool': 'itstools'}].
Learned tools are: [{'Tool': 'lola'}].
Learned tool lola is 1.0x far from the best tool lola.
LTLCardinality lola GPPP-PT-C1000N0000001000...

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


checking for too many tokens
===========================================================================================
GPPP-PT-C1000N0000001000: translating PT formula LTLCardinality into LoLA format
===========================================================================================
translating formula complete
touch formulae;
----- Start make result stdout -----
----- Start make result stderr -----
LTLCardinality @ GPPP-PT-C1000N0000001000 @ 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: 55/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: finding significant places
lola: 33 places, 22 transitions, 21 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 30 transition conflict sets
lola: TASK
lola: reading formula from GPPP-PT-C1000N0000001000-LTLCardinality.task
lola: A (F (G ((3 <= _3PG)))) : A (F (F (((Ru5P <= _2PG) U (2 <= GAP))))) : A (G (X ((NADPplus <= R5P)))) : A (F (X (G (G ((3 <= Lac)))))) : A (F (F (F (X ((2 <= _3PG)))))) : A ((((2 <= c1) U (GSSG <= a1)) U (3 <= _1_3_BPG))) : A (G (X (G ((F6P <= _3PG))))) : A ((2 <= a1)) : A (F (F (((3 <= _3PG) U (E4P <= start))))) : A ((3 <= GSSG)) : A (((2 <= GAP) U G (X ((a1 <= c2))))) : A (F (G (G (G ((GSSG <= Lac)))))) : A ((F (X ((b1 <= GSH))) U X (X ((NADplus <= _3PG))))) : A ((F ((2 <= E4P)) U F ((DHAP <= Gluc)))) : A ((G (F ((3 <= F6P))) U ((Xu5P <= DHAP) U (3 <= G6P)))) : A (X (F (G (X ((E4P <= _2PG))))))
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 (F (G ((3 <= _3PG))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F (G ((3 <= _3PG))))
lola: processed formula: A (F (G ((3 <= _3PG))))
lola: processed formula length: 23
lola: 0 rewrites
lola: formula mentions 0 of 33 places; total mentions: 0
lola: closed formula file GPPP-PT-C1000N0000001000-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 88 bytes per marking, with 30 unused bits
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method (--stubborn)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 24 markings, 25 edges
lola: ========================================
lola: subprocess 1 will run for 236 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (F (((Ru5P <= _2PG) U (2 <= GAP)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F (((Ru5P <= _2PG) U (2 <= GAP))))
lola: processed formula: A (F (((Ru5P <= _2PG) U (2 <= GAP))))
lola: processed formula length: 37
lola: 1 rewrites
lola: formula mentions 0 of 33 places; total mentions: 0
lola: closed formula file GPPP-PT-C1000N0000001000-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 88 bytes per marking, with 31 unused bits
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method (--stubborn)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 4006 markings, 4006 edges
lola: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (X ((NADPplus <= R5P))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (G (X ((NADPplus <= R5P))))
lola: processed formula: A (G (X ((NADPplus <= R5P))))
lola: processed formula length: 29
lola: 0 rewrites
lola: formula mentions 0 of 33 places; total mentions: 0
lola: closed formula file GPPP-PT-C1000N0000001000-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 88 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: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 4005 markings, 4005 edges
lola: ========================================
lola: subprocess 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (X (G (G ((3 <= Lac))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F (X (G (G ((3 <= Lac))))))
lola: processed formula: A (F (X (G (G ((3 <= Lac))))))
lola: processed formula length: 30
lola: 0 rewrites
lola: formula mentions 0 of 33 places; total mentions: 0
lola: closed formula file GPPP-PT-C1000N0000001000-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 88 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: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 4005 markings, 4005 edges
lola: ========================================
lola: subprocess 4 will run for 295 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (F (F (X ((2 <= _3PG))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F (X ((2 <= _3PG))))
lola: processed formula: A (F (X ((2 <= _3PG))))
lola: processed formula length: 23
lola: 2 rewrites
lola: formula mentions 0 of 33 places; total mentions: 0
lola: closed formula file GPPP-PT-C1000N0000001000-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 88 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: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 4005 markings, 4005 edges
lola: ========================================
lola: subprocess 5 will run for 321 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((((2 <= c1) U (GSSG <= a1)) U (3 <= _1_3_BPG)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A ((((2 <= c1) U (GSSG <= a1)) U (3 <= _1_3_BPG)))
lola: processed formula: A ((((2 <= c1) U (GSSG <= a1)) U (3 <= _1_3_BPG)))
lola: processed formula length: 50
lola: 0 rewrites
lola: formula mentions 0 of 33 places; total mentions: 0
lola: closed formula file GPPP-PT-C1000N0000001000-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 88 bytes per marking, with 30 unused bits
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method (--stubborn)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 23992 markings, 23992 edges
lola: ========================================
lola: subprocess 6 will run for 354 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (X (G ((F6P <= _3PG)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (G (X (G ((F6P <= _3PG)))))
lola: processed formula: A (G (X (G ((F6P <= _3PG)))))
lola: processed formula length: 29
lola: 0 rewrites
lola: formula mentions 0 of 33 places; total mentions: 0
lola: closed formula file GPPP-PT-C1000N0000001000-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 88 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: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 4005 markings, 4005 edges
lola: ========================================
lola: subprocess 7 will run for 393 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((2 <= a1))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (2 <= a1)
lola: processed formula length: 9
lola: 1 rewrites
lola: formula mentions 0 of 33 places; total mentions: 0
lola: closed formula file GPPP-PT-C1000N0000001000-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 8 will run for 442 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (F (((3 <= _3PG) U (E4P <= start)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F (((3 <= _3PG) U (E4P <= start))))
lola: processed formula: A (F (((3 <= _3PG) U (E4P <= start))))
lola: processed formula length: 38
lola: 1 rewrites
lola: formula mentions 0 of 33 places; total mentions: 0
lola: closed formula file GPPP-PT-C1000N0000001000-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 88 bytes per marking, with 31 unused bits
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method (--stubborn)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 1 markings, 0 edges
lola: ========================================
lola: subprocess 9 will run for 505 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((3 <= GSSG))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (3 <= GSSG)
lola: processed formula length: 11
lola: 1 rewrites
lola: formula mentions 0 of 33 places; total mentions: 0
lola: closed formula file GPPP-PT-C1000N0000001000-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 10 will run for 590 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (((2 <= GAP) U G (X ((a1 <= c2)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (((2 <= GAP) U G (X ((a1 <= c2)))))
lola: processed formula: A (((2 <= GAP) U G (X ((a1 <= c2)))))
lola: processed formula length: 37
lola: 0 rewrites
lola: formula mentions 0 of 33 places; total mentions: 0
lola: closed formula file GPPP-PT-C1000N0000001000-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 5 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 88 bytes per marking, with 29 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: 4005 markings, 4005 edges
lola: ========================================
lola: subprocess 11 will run for 708 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (G (G (G ((GSSG <= Lac))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F (G (G (G ((GSSG <= Lac))))))
lola: processed formula: A (F (G (G (G ((GSSG <= Lac))))))
lola: processed formula length: 33
lola: 0 rewrites
lola: formula mentions 0 of 33 places; total mentions: 0
lola: closed formula file GPPP-PT-C1000N0000001000-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 88 bytes per marking, with 30 unused bits
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method (--stubborn)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 16 markings, 17 edges
lola: ========================================
lola: subprocess 12 will run for 885 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((F (X ((b1 <= GSH))) U X (X ((NADplus <= _3PG)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A ((F (X ((b1 <= GSH))) U X (X ((NADplus <= _3PG)))))
lola: processed formula: A ((F (X ((b1 <= GSH))) U X (X ((NADplus <= _3PG)))))
lola: processed formula length: 53
lola: 0 rewrites
lola: formula mentions 0 of 33 places; total mentions: 0
lola: closed formula file GPPP-PT-C1000N0000001000-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 7 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 88 bytes per marking, with 29 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: 16011 markings, 16014 edges
lola: ========================================
lola: subprocess 13 will run for 1180 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((F ((2 <= E4P)) U F ((DHAP <= Gluc))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A ((F ((2 <= E4P)) U F ((DHAP <= Gluc))))
lola: processed formula: A ((F ((2 <= E4P)) U F ((DHAP <= Gluc))))
lola: processed formula length: 41
lola: 0 rewrites
lola: formula mentions 0 of 33 places; total mentions: 0
lola: closed formula file GPPP-PT-C1000N0000001000-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 88 bytes per marking, with 31 unused bits
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method (--stubborn)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 1 markings, 0 edges
lola: ========================================
lola: subprocess 14 will run for 1770 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((G (F ((3 <= F6P))) U ((Xu5P <= DHAP) U (3 <= G6P))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A ((G (F ((3 <= F6P))) U ((Xu5P <= DHAP) U (3 <= G6P))))
lola: processed formula: A ((G (F ((3 <= F6P))) U ((Xu5P <= DHAP) U (3 <= G6P))))
lola: processed formula length: 56
lola: 0 rewrites
lola: formula mentions 0 of 33 places; total mentions: 0
lola: closed formula file GPPP-PT-C1000N0000001000-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 5 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 88 bytes per marking, with 29 unused bits
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method (--stubborn)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: 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: subprocess 15 will run for 3540 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (F (G (X ((E4P <= _2PG))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (X (F (G (X ((E4P <= _2PG))))))
lola: processed formula: A (X (F (G (X ((E4P <= _2PG))))))
lola: processed formula length: 33
lola: 0 rewrites
lola: formula mentions 0 of 33 places; total mentions: 0
lola: closed formula file GPPP-PT-C1000N0000001000-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 88 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: 1434296 markings, 9027649 edges, 286859 markings/sec, 0 secs
lola: 2785408 markings, 18309687 edges, 270222 markings/sec, 5 secs
lola: 4117056 markings, 27481899 edges, 266330 markings/sec, 10 secs
lola: 5442929 markings, 36676972 edges, 265175 markings/sec, 15 secs
lola: 6769235 markings, 45784575 edges, 265261 markings/sec, 20 secs
lola: 8101712 markings, 54962477 edges, 266495 markings/sec, 25 secs
lola: 9405350 markings, 64004962 edges, 260728 markings/sec, 30 secs
lola: 10715293 markings, 73030653 edges, 261989 markings/sec, 35 secs
lola: 12033060 markings, 82069986 edges, 263553 markings/sec, 40 secs
lola: 13306582 markings, 90881237 edges, 254704 markings/sec, 45 secs
lola: 14600086 markings, 99832509 edges, 258701 markings/sec, 50 secs
lola: 15899565 markings, 108740669 edges, 259896 markings/sec, 55 secs
lola: 17198750 markings, 117701892 edges, 259837 markings/sec, 60 secs
lola: 18505045 markings, 126760980 edges, 261259 markings/sec, 65 secs
lola: 19869078 markings, 136122858 edges, 272807 markings/sec, 70 secs
lola: 21207409 markings, 145345883 edges, 267666 markings/sec, 75 secs
lola: 22510996 markings, 154389169 edges, 260717 markings/sec, 80 secs
lola: 23869234 markings, 163703546 edges, 271648 markings/sec, 85 secs
lola: 25185413 markings, 172781419 edges, 263236 markings/sec, 90 secs
lola: 26475181 markings, 181733159 edges, 257954 markings/sec, 95 secs
lola: 27791945 markings, 190783273 edges, 263353 markings/sec, 100 secs
lola: 29100265 markings, 199779270 edges, 261664 markings/sec, 105 secs
lola: 30361055 markings, 208498217 edges, 252158 markings/sec, 110 secs
lola: 31624303 markings, 217247080 edges, 252650 markings/sec, 115 secs
lola: 32946272 markings, 226311511 edges, 264394 markings/sec, 120 secs
lola: 34254535 markings, 235330738 edges, 261653 markings/sec, 125 secs
lola: 35541091 markings, 244244873 edges, 257311 markings/sec, 130 secs
lola: 36864772 markings, 253386599 edges, 264736 markings/sec, 135 secs
lola: 38225013 markings, 262709658 edges, 272048 markings/sec, 140 secs
lola: 39540079 markings, 271829618 edges, 263013 markings/sec, 145 secs
lola: 40866950 markings, 280965414 edges, 265374 markings/sec, 150 secs
lola: 42219496 markings, 290263496 edges, 270509 markings/sec, 155 secs
lola: 43505799 markings, 299175312 edges, 257261 markings/sec, 160 secs
lola: 44791838 markings, 308065119 edges, 257208 markings/sec, 165 secs
lola: 46114399 markings, 317120682 edges, 264512 markings/sec, 170 secs
lola: 47376711 markings, 325825932 edges, 252462 markings/sec, 175 secs
lola: 48615775 markings, 334414146 edges, 247813 markings/sec, 180 secs
lola: 49896905 markings, 343274021 edges, 256226 markings/sec, 185 secs
lola: 51243373 markings, 352486699 edges, 269294 markings/sec, 190 secs
lola: 52532075 markings, 361393662 edges, 257740 markings/sec, 195 secs
lola: 53801443 markings, 370192548 edges, 253874 markings/sec, 200 secs
lola: 55126059 markings, 379278452 edges, 264923 markings/sec, 205 secs
lola: 56456351 markings, 388448259 edges, 266058 markings/sec, 210 secs
lola: 57751311 markings, 397427604 edges, 258992 markings/sec, 215 secs
lola: 59052013 markings, 406400950 edges, 260140 markings/sec, 220 secs
lola: 60378904 markings, 415492679 edges, 265378 markings/sec, 225 secs
lola: 61639067 markings, 424207056 edges, 252033 markings/sec, 230 secs
lola: 62870763 markings, 432734714 edges, 246339 markings/sec, 235 secs
lola: 64164611 markings, 441667260 edges, 258770 markings/sec, 240 secs
lola: 65485440 markings, 450707564 edges, 264166 markings/sec, 245 secs
lola: 66771298 markings, 459610752 edges, 257172 markings/sec, 250 secs
lola: 68036728 markings, 468373176 edges, 253086 markings/sec, 255 secs
lola: 69356923 markings, 477422664 edges, 264039 markings/sec, 260 secs
lola: 70645628 markings, 486301934 edges, 257741 markings/sec, 265 secs
lola: 71913416 markings, 495074202 edges, 253558 markings/sec, 270 secs
lola: 73211064 markings, 504063575 edges, 259530 markings/sec, 275 secs
lola: 74580615 markings, 513434235 edges, 273910 markings/sec, 280 secs
lola: 75881016 markings, 522432308 edges, 260080 markings/sec, 285 secs
lola: 77136396 markings, 531131280 edges, 251076 markings/sec, 290 secs
lola: 78392141 markings, 539782433 edges, 251149 markings/sec, 295 secs
lola: 79622617 markings, 548213751 edges, 246095 markings/sec, 300 secs
lola: 80840002 markings, 556602835 edges, 243477 markings/sec, 305 secs
lola: 82066100 markings, 565067083 edges, 245220 markings/sec, 310 secs
lola: 83279120 markings, 573455290 edges, 242604 markings/sec, 315 secs
lola: 84463893 markings, 581651444 edges, 236955 markings/sec, 320 secs
lola: 85639077 markings, 589761804 edges, 235037 markings/sec, 325 secs
lola: 86805578 markings, 597816502 edges, 233300 markings/sec, 330 secs
lola: 87964870 markings, 605802998 edges, 231858 markings/sec, 335 secs
lola: 89156263 markings, 614030436 edges, 238279 markings/sec, 340 secs
lola: 90364233 markings, 622318447 edges, 241594 markings/sec, 345 secs
lola: 91603553 markings, 630849447 edges, 247864 markings/sec, 350 secs
lola: 92864476 markings, 639544318 edges, 252185 markings/sec, 355 secs
lola: 94070398 markings, 647881987 edges, 241184 markings/sec, 360 secs
lola: 95272265 markings, 656192821 edges, 240373 markings/sec, 365 secs
lola: 96481354 markings, 664544284 edges, 241818 markings/sec, 370 secs
lola: 97657818 markings, 672656361 edges, 235293 markings/sec, 375 secs
lola: 98917385 markings, 681297672 edges, 251913 markings/sec, 380 secs
lola: 100132923 markings, 689673865 edges, 243108 markings/sec, 385 secs
lola: 101394705 markings, 698375432 edges, 252356 markings/sec, 390 secs
lola: 101550467 markings, 699495211 edges, 31152 markings/sec, 395 secs
lola: 101557228 markings, 699546528 edges, 1352 markings/sec, 400 secs
lola: 101563154 markings, 699586996 edges, 1185 markings/sec, 405 secs
lola: 101564742 markings, 699595957 edges, 318 markings/sec, 410 secs
lola: Child process aborted or communication problem between parent and child process
lola: RESULT
lola:
SUMMARY: no no no no no no no yes yes yes no no no yes no unknown
FORMULA GPPP-PT-C1000N0000001000-LTLCardinality-0 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GPPP-PT-C1000N0000001000-LTLCardinality-1 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GPPP-PT-C1000N0000001000-LTLCardinality-2 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GPPP-PT-C1000N0000001000-LTLCardinality-3 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GPPP-PT-C1000N0000001000-LTLCardinality-4 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GPPP-PT-C1000N0000001000-LTLCardinality-5 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GPPP-PT-C1000N0000001000-LTLCardinality-6 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GPPP-PT-C1000N0000001000-LTLCardinality-7 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GPPP-PT-C1000N0000001000-LTLCardinality-8 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GPPP-PT-C1000N0000001000-LTLCardinality-9 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GPPP-PT-C1000N0000001000-LTLCardinality-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GPPP-PT-C1000N0000001000-LTLCardinality-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GPPP-PT-C1000N0000001000-LTLCardinality-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GPPP-PT-C1000N0000001000-LTLCardinality-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GPPP-PT-C1000N0000001000-LTLCardinality-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GPPP-PT-C1000N0000001000-LTLCardinality-15 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stdout -----
----- Kill lola and sara stderr -----
----- Finished stderr -----
----- Finished stdout -----

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="GPPP-PT-C1000N0000001000"
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/GPPP-PT-C1000N0000001000.tgz
mv GPPP-PT-C1000N0000001000 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 GPPP-PT-C1000N0000001000, 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 r251-blw7-152732553000101"
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 ;