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 240K
-rw-r--r-- 1 mcc users 3.9K 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.1K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 14K 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.2K May 15 18:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 9.3K May 15 18:54 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.7K May 15 18:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 8.8K May 15 18:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 21K May 15 18:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 101 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 339 May 15 18:54 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 2.4K 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.5K May 15 18:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.5K 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 70K May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool irma4mcc-structural
Input is DES-PT-30a, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r055-smll-152646382900241
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1526501149689


BK_STOP 1526501939973

--------------------
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 DES-PT-30a as instance name.
Using DES 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': None, 'Source Transition': False, 'Sink Transition': None, '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': 3539338, 'Memory': 8428.68, 'Tool': 'lola'}, {'Time': 3540182, 'Memory': 8447.92, 'Tool': 'lola'}].
Learned tools are: [{'Tool': 'lola'}].
Learned tool lola is 1.0x far from the best tool lola.
CTLCardinality lola DES-PT-30a...
----- Start make prepare stderr -----

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


checking for too many tokens
===========================================================================================
DES-PT-30a: translating PT formula CTLCardinality into LoLA format
===========================================================================================
translating formula complete
touch formulae;
----- Start make result stdout -----
----- Start make result stderr -----
CTLCardinality @ DES-PT-30a @ 3540 seconds
Makefile:222: recipe for target 'verify' failed
make: [verify] Error 2 (ignored)
----- 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: 425/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: finding significant places
lola: 234 places, 191 transitions, 175 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 216 transition conflict sets
lola: TASK
lola: reading formula from DES-PT-30a-CTLCardinality.task
lola: ((((p171 <= p184) AND (p113 <= p103)) AND (E (G ((p116 <= p138))) OR (1 <= p98))) OR (p55 + 1 <= p54)) : E (F (((p138 <= p43) AND (3 <= p228) AND ((1 <= p44) OR (p96 <= p183)) AND (((1 <= p56) AND (p67 <= p200)) OR (1 <= p17))))) : ((E (F ((p76 + 1 <= p84))) AND (((2 <= p63) AND (p84 <= p197)) OR (2 <= p179) OR (p122 <= 1))) AND (A (X ((p35 <= p60))) AND (p22 <= p120))) : E (X (A (F (((3 <= p87) AND (3 <= p155)))))) : E (G ((p65 <= p141))) : (((2 <= p145) AND E (X (((3 <= p131) AND (1 <= p169))))) OR NOT(E (G (((1 <= p117) OR (p112 <= p22)))))) : E (G (((p174 + 1 <= p172) OR (p94 <= 0)))) : E (F ((1 <= p160))) : A ((((p87 <= p205) OR (p12 <= p40) OR (2 <= p143)) U ((p215 <= 2) AND (p18 + 1 <= p195)))) : A (F (A (((3 <= p187) U (2 <= p203))))) : E (G ((((1 <= p231) OR (p32 <= p217) OR (p158 <= 0)) AND A (F ((p221 <= p46)))))) : A (X ((A (G ((p81 <= p152))) OR (((3 <= p69) OR (2 <= p201)) AND (2 <= p67))))) : NOT(((A (F ((p185 <= p32))) AND E (G ((p156 <= p181)))) OR A (X (((3 <= p61) AND (p178 <= p181)))))) : (A (F (((p20 <= p205) AND (2 <= p59) AND (2 <= p166)))) AND (E (G ((p42 <= p206))) OR ((2 <= p37) AND E (F ((p95 <= p174)))))) : NOT(A (G ((p45 <= p48)))) : ((((p233 <= 2) AND (p76 + 1 <= p69) AND (1 <= p154)) OR NOT(A (F ((3 <= p17))))) AND (((1 <= p162) AND (3 <= p195)) OR A (X ((p42 <= p171)))))
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((((p171 <= p184) AND (p113 <= p103)) AND (E (G ((p116 <= p138))) OR (1 <= p98))) OR (p55 + 1 <= p54))
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: ((p171 <= p184) AND (p113 <= p103))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((p171 <= p184) AND (p113 <= p103))
lola: processed formula length: 35
lola: 0 rewrites
lola: formula mentions 0 of 234 places; total mentions: 0
lola: closed formula file DES-PT-30a-CTLCardinality.task
lola: processed formula with 2 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: E (G ((p116 <= p138)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U (p138 + 1 <= p116)))
lola: processed formula length: 33
lola: 2 rewrites
lola: formula mentions 0 of 234 places; total mentions: 0
lola: closed formula file DES-PT-30a-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 24 bytes per marking, with 17 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 114 markings, 229 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 1 will run for 236 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((p138 <= p43) AND (3 <= p228) AND ((1 <= p44) OR (p96 <= p183)) AND (((1 <= p56) AND (p67 <= p200)) OR (1 <= p17)))))
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 24 bytes per marking, with 17 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 18 literals and 4 conjunctive subformulas
lola: state equation: write sara problem file to DES-PT-30a-CTLCardinality.sara
lola: state equation: calling and running sara
sara: try reading problem file DES-PT-30a-CTLCardinality.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 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((E (F ((p76 + 1 <= p84))) AND (((2 <= p63) AND (p84 <= p197)) OR (2 <= p179) OR (p122 <= 1))) AND (A (X ((p35 <= p60))) AND (p22 <= p120)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((p76 + 1 <= p84)))
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 24 bytes per marking, with 17 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 DES-PT-30a-CTLCardinality-2.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 141 markings, 141 edges
lola: ========================================
lola: subprocess 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (((2 <= p63) AND (p84 <= p197)) OR (2 <= p179) OR (p122 <= 1))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (((2 <= p63) AND (p84 <= p197)) OR (2 <= p179) OR (p122 <= 1))
lola: processed formula length: 64
lola: 1 rewrites
lola: formula mentions 0 of 234 places; total mentions: 0
lola: closed formula file DES-PT-30a-CTLCardinality.task
lola: processed formula with 4 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 4 will run for 295 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X ((p35 <= p60)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (X ((p35 <= p60)))
lola: processed formula: A (X ((p35 <= p60)))
lola: processed formula length: 20
lola: 1 rewrites
lola: formula mentions 0 of 234 places; total mentions: 0
lola: closed formula file DES-PT-30a-CTLCardinality.task
lola: the resulting B\xfcchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 24 bytes per marking, with 15 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: 2 markings, 1 edges
lola: ========================================
lola: subprocess 5 will run for 321 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (p22 <= p120)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p22 <= p120)
lola: processed formula length: 13
lola: 1 rewrites
lola: formula mentions 0 of 234 places; total mentions: 0
lola: closed formula file DES-PT-30a-CTLCardinality.task
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (X (A (F (((3 <= p87) AND (3 <= p155))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: EX(A(TRUE U ((3 <= p87) AND (3 <= p155))))
lola: processed formula length: 42
lola: 2 rewrites
lola: formula mentions 0 of 234 places; total mentions: 0
lola: closed formula file DES-PT-30a-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 24 bytes per marking, with 17 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains EX or AX operators, stubborn sets not applicable
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 44 markings, 43 edges
lola: ========================================
lola: subprocess 4 will run for 295 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G ((p65 <= p141)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U (p141 + 1 <= p65)))
lola: processed formula length: 32
lola: 2 rewrites
lola: formula mentions 0 of 234 places; total mentions: 0
lola: closed formula file DES-PT-30a-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 24 bytes per marking, with 17 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 45 markings, 44 edges
lola: ========================================
lola: subprocess 5 will run for 321 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (((2 <= p145) AND E (X (((3 <= p131) AND (1 <= p169))))) OR NOT(E (G (((1 <= p117) OR (p112 <= p22))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 5 will run for 321 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (2 <= p145)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (2 <= p145)
lola: processed formula length: 11
lola: 3 rewrites
lola: formula mentions 0 of 234 places; total mentions: 0
lola: closed formula file DES-PT-30a-CTLCardinality.task
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 6 will run for 354 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (((p117 <= 0) AND (p22 + 1 <= p112))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F (((p117 <= 0) AND (p22 + 1 <= p112))))
lola: processed formula: A (F (((p117 <= 0) AND (p22 + 1 <= p112))))
lola: processed formula length: 43
lola: 3 rewrites
lola: formula mentions 0 of 234 places; total mentions: 0
lola: closed formula file DES-PT-30a-CTLCardinality.task
lola: the resulting B\xfcchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 24 bytes per marking, with 16 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: 45 markings, 45 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 6 will run for 354 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G (((p174 + 1 <= p172) OR (p94 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U ((p172 <= p174) AND (1 <= p94))))
lola: processed formula length: 46
lola: 2 rewrites
lola: formula mentions 0 of 234 places; total mentions: 0
lola: closed formula file DES-PT-30a-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 24 bytes per marking, with 17 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 45 markings, 44 edges
lola: ========================================
lola: subprocess 7 will run for 393 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((1 <= p160)))
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 24 bytes per marking, with 17 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 DES-PT-30a-CTLCardinality-7.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 21 markings, 20 edges
lola: ========================================
lola: subprocess 8 will run for 442 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((((p87 <= p205) OR (p12 <= p40) OR (2 <= p143)) U ((p215 <= 2) AND (p18 + 1 <= p195))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A ((((p87 <= p205) OR (p12 <= p40) OR (2 <= p143)) U ((p215 <= 2) AND (p18 + 1 <= p195))))
lola: processed formula: A ((((p87 <= p205) OR (p12 <= p40) OR (2 <= p143)) U ((p215 <= 2) AND (p18 + 1 <= p195))))
lola: processed formula length: 92
lola: 0 rewrites
lola: formula mentions 0 of 234 places; total mentions: 0
lola: closed formula file DES-PT-30a-CTLCardinality.task
lola: the resulting B\xfcchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 24 bytes per marking, with 15 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: 26 markings, 26 edges
lola: ========================================
lola: subprocess 9 will run for 505 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (A (((3 <= p187) U (2 <= p203)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U A((3 <= p187) U (2 <= p203)))
lola: processed formula length: 38
lola: 2 rewrites
lola: formula mentions 0 of 234 places; total mentions: 0
lola: closed formula file DES-PT-30a-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 24 bytes per marking, with 17 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: 45 markings, 89 edges
lola: ========================================
lola: subprocess 10 will run for 590 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G ((((1 <= p231) OR (p32 <= p217) OR (p158 <= 0)) AND A (F ((p221 <= p46))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U (((p231 <= 0) AND (p217 + 1 <= p32) AND (1 <= p158)) OR NOT(A(TRUE U (p221 <= p46))))))
lola: processed formula length: 100
lola: 4 rewrites
lola: formula mentions 0 of 234 places; total mentions: 0
lola: closed formula file DES-PT-30a-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 24 bytes per marking, with 17 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: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 126 markings, 216 edges
lola: ========================================
lola: subprocess 11 will run for 708 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X ((A (G ((p81 <= p152))) OR (((3 <= p69) OR (2 <= p201)) AND (2 <= p67)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (X ((A (G ((p81 <= p152))) OR (((3 <= p69) OR (2 <= p201)) AND (2 <= p67)))))
lola: processed formula: A (X ((A (G ((p81 <= p152))) OR (((3 <= p69) OR (2 <= p201)) AND (2 <= p67)))))
lola: processed formula length: 80
lola: 0 rewrites
lola: formula mentions 0 of 234 places; total mentions: 0
lola: closed formula file DES-PT-30a-CTLCardinality.task
lola: the resulting B\xfcchi automaton has 4 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 24 bytes per marking, with 14 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: 581773 markings, 4199008 edges, 116355 markings/sec, 0 secs
lola: 1121908 markings, 8587601 edges, 108027 markings/sec, 5 secs
lola: 1607685 markings, 12934854 edges, 97155 markings/sec, 10 secs
lola: 2054014 markings, 17386387 edges, 89266 markings/sec, 15 secs
lola: 2525924 markings, 21721940 edges, 94382 markings/sec, 20 secs
lola: 3031356 markings, 26123215 edges, 101086 markings/sec, 25 secs
lola: 3601561 markings, 30562639 edges, 114041 markings/sec, 30 secs
lola: 4072020 markings, 34627254 edges, 94092 markings/sec, 35 secs
lola: 4549147 markings, 38397438 edges, 95425 markings/sec, 40 secs
lola: 5078058 markings, 42636808 edges, 105782 markings/sec, 45 secs
lola: 5548750 markings, 46885732 edges, 94138 markings/sec, 50 secs
lola: 5970107 markings, 50884273 edges, 84271 markings/sec, 55 secs
lola: 6388064 markings, 55141578 edges, 83591 markings/sec, 60 secs
lola: 6772568 markings, 59511703 edges, 76901 markings/sec, 65 secs
lola: 7189453 markings, 63629852 edges, 83377 markings/sec, 70 secs
lola: 7615834 markings, 67815962 edges, 85276 markings/sec, 75 secs
lola: 8116185 markings, 72191016 edges, 100070 markings/sec, 80 secs
lola: 8538909 markings, 76101625 edges, 84545 markings/sec, 85 secs
lola: 8940792 markings, 79886026 edges, 80377 markings/sec, 90 secs
lola: 9356659 markings, 83624657 edges, 83173 markings/sec, 95 secs
lola: 9936393 markings, 88155390 edges, 115947 markings/sec, 100 secs
lola: 10329050 markings, 92705630 edges, 78531 markings/sec, 105 secs
lola: 10821264 markings, 97065366 edges, 98443 markings/sec, 110 secs
lola: 11156206 markings, 101503042 edges, 66988 markings/sec, 115 secs
lola: 11544956 markings, 106000382 edges, 77750 markings/sec, 120 secs
lola: 11967794 markings, 110315143 edges, 84568 markings/sec, 125 secs
lola: 12424076 markings, 114681282 edges, 91256 markings/sec, 130 secs
lola: 12884510 markings, 119060149 edges, 92087 markings/sec, 135 secs
lola: 13296574 markings, 123183836 edges, 82413 markings/sec, 140 secs
lola: 13728122 markings, 127121905 edges, 86310 markings/sec, 145 secs
lola: 14188511 markings, 131309651 edges, 92078 markings/sec, 150 secs
lola: 14656983 markings, 135654915 edges, 93694 markings/sec, 155 secs
lola: 14990577 markings, 140293862 edges, 66719 markings/sec, 160 secs
lola: 15391868 markings, 144594523 edges, 80258 markings/sec, 165 secs
lola: 15853375 markings, 148882037 edges, 92301 markings/sec, 170 secs
lola: 16197705 markings, 153379570 edges, 68866 markings/sec, 175 secs
lola: 16627734 markings, 157613140 edges, 86006 markings/sec, 180 secs
lola: 16928774 markings, 161939341 edges, 60208 markings/sec, 185 secs
lola: 17258971 markings, 166329539 edges, 66039 markings/sec, 190 secs
lola: 17640420 markings, 170476650 edges, 76290 markings/sec, 195 secs
lola: 18012304 markings, 174794262 edges, 74377 markings/sec, 200 secs
lola: 18447149 markings, 179130605 edges, 86969 markings/sec, 205 secs
lola: 18849477 markings, 183198806 edges, 80466 markings/sec, 210 secs
lola: 19198492 markings, 187183456 edges, 69803 markings/sec, 215 secs
lola: 19565716 markings, 190950104 edges, 73445 markings/sec, 220 secs
lola: 19934664 markings, 194594865 edges, 73790 markings/sec, 225 secs
lola: 20342833 markings, 198618264 edges, 81634 markings/sec, 230 secs
lola: 20672399 markings, 203131941 edges, 65913 markings/sec, 235 secs
lola: 20948356 markings, 207219049 edges, 55191 markings/sec, 240 secs
lola: 21531637 markings, 211630384 edges, 116656 markings/sec, 245 secs
lola: 21992102 markings, 215902363 edges, 92093 markings/sec, 250 secs
lola: 22457046 markings, 220388279 edges, 92989 markings/sec, 255 secs
lola: 23021424 markings, 224529330 edges, 112876 markings/sec, 260 secs
lola: 23549574 markings, 228730448 edges, 105630 markings/sec, 265 secs
lola: 24042644 markings, 232781915 edges, 98614 markings/sec, 270 secs
lola: 24514696 markings, 236853663 edges, 94410 markings/sec, 275 secs
lola: 24953031 markings, 241180412 edges, 87667 markings/sec, 280 secs
lola: 25383581 markings, 245561101 edges, 86110 markings/sec, 285 secs
lola: 25798086 markings, 249570855 edges, 82901 markings/sec, 290 secs
lola: 26209599 markings, 254033204 edges, 82303 markings/sec, 295 secs
lola: 26659109 markings, 258413219 edges, 89902 markings/sec, 300 secs
lola: 27132913 markings, 262635471 edges, 94761 markings/sec, 305 secs
lola: 27603123 markings, 266842359 edges, 94042 markings/sec, 310 secs
lola: 28007674 markings, 271171312 edges, 80910 markings/sec, 315 secs
lola: 28391674 markings, 275480581 edges, 76800 markings/sec, 320 secs
lola: 28752229 markings, 279693974 edges, 72111 markings/sec, 325 secs
lola: 29117982 markings, 283977764 edges, 73151 markings/sec, 330 secs
lola: 29547348 markings, 288180044 edges, 85873 markings/sec, 335 secs
lola: 29972946 markings, 292318859 edges, 85120 markings/sec, 340 secs
lola: 30333795 markings, 296591372 edges, 72170 markings/sec, 345 secs
lola: 30716659 markings, 300916789 edges, 76573 markings/sec, 350 secs
lola: 31210292 markings, 305220907 edges, 98727 markings/sec, 355 secs
lola: 31703072 markings, 309554509 edges, 98556 markings/sec, 360 secs
lola: 32110268 markings, 313843098 edges, 81439 markings/sec, 365 secs
lola: 32490750 markings, 318211510 edges, 76096 markings/sec, 370 secs
lola: 32874335 markings, 322450186 edges, 76717 markings/sec, 375 secs
lola: 33210689 markings, 326968039 edges, 67271 markings/sec, 380 secs
lola: 33618305 markings, 331603197 edges, 81523 markings/sec, 385 secs
lola: 33985241 markings, 336176159 edges, 73387 markings/sec, 390 secs
lola: 34320465 markings, 340692705 edges, 67045 markings/sec, 395 secs
lola: 34672786 markings, 345151753 edges, 70464 markings/sec, 400 secs
lola: 35071300 markings, 349400628 edges, 79703 markings/sec, 405 secs
lola: 35446071 markings, 353372764 edges, 74954 markings/sec, 410 secs
lola: 35756180 markings, 357424046 edges, 62022 markings/sec, 415 secs
lola: 36256987 markings, 361979934 edges, 100161 markings/sec, 420 secs
lola: 36693096 markings, 366496837 edges, 87222 markings/sec, 425 secs
lola: 37079218 markings, 370930352 edges, 77224 markings/sec, 430 secs
lola: 37505086 markings, 375461616 edges, 85174 markings/sec, 435 secs
lola: 37896398 markings, 379635540 edges, 78262 markings/sec, 440 secs
lola: 38305940 markings, 383684452 edges, 81908 markings/sec, 445 secs
lola: 38777742 markings, 387995520 edges, 94360 markings/sec, 450 secs
lola: 39312536 markings, 392600573 edges, 106959 markings/sec, 455 secs
lola: 39765526 markings, 397072740 edges, 90598 markings/sec, 460 secs
lola: 40228204 markings, 401579599 edges, 92536 markings/sec, 465 secs
lola: 40660710 markings, 405763469 edges, 86501 markings/sec, 470 secs
lola: 41060133 markings, 409521358 edges, 79885 markings/sec, 475 secs
lola: 41495429 markings, 413574676 edges, 87059 markings/sec, 480 secs
lola: 41934697 markings, 417768686 edges, 87854 markings/sec, 485 secs
lola: 42317936 markings, 421859137 edges, 76648 markings/sec, 490 secs
lola: 42671497 markings, 425828831 edges, 70712 markings/sec, 495 secs
lola: 43059283 markings, 429912607 edges, 77557 markings/sec, 500 secs
lola: 43424436 markings, 433776275 edges, 73031 markings/sec, 505 secs
lola: 43786272 markings, 437351772 edges, 72367 markings/sec, 510 secs
lola: 44228366 markings, 441157498 edges, 88419 markings/sec, 515 secs
lola: 44604043 markings, 444723909 edges, 75135 markings/sec, 520 secs
lola: 44962909 markings, 448447047 edges, 71773 markings/sec, 525 secs
lola: 45369359 markings, 452280948 edges, 81290 markings/sec, 530 secs
lola: 45751286 markings, 456032402 edges, 76385 markings/sec, 535 secs
lola: 46209936 markings, 459965432 edges, 91730 markings/sec, 540 secs
lola: 46714541 markings, 464269345 edges, 100921 markings/sec, 545 secs
lola: 47128166 markings, 468638408 edges, 82725 markings/sec, 550 secs
lola: 47526984 markings, 473006400 edges, 79764 markings/sec, 555 secs
lola: 47977304 markings, 477202591 edges, 90064 markings/sec, 560 secs
lola: 48364502 markings, 481296972 edges, 77440 markings/sec, 565 secs
lola: 48730935 markings, 485543517 edges, 73287 markings/sec, 570 secs
lola: 49125387 markings, 489857902 edges, 78890 markings/sec, 575 secs
lola: 49544513 markings, 494048477 edges, 83825 markings/sec, 580 secs
lola: 49970933 markings, 498179586 edges, 85284 markings/sec, 585 secs
lola: 50332605 markings, 502223047 edges, 72334 markings/sec, 590 secs
lola: 50633330 markings, 506307096 edges, 60145 markings/sec, 595 secs
lola: 51003883 markings, 510367499 edges, 74111 markings/sec, 600 secs
lola: 51285847 markings, 514645413 edges, 56393 markings/sec, 605 secs
lola: 51645124 markings, 519181300 edges, 71855 markings/sec, 610 secs
lola: 51985261 markings, 523610304 edges, 68027 markings/sec, 615 secs
lola: 52308140 markings, 527937371 edges, 64576 markings/sec, 620 secs
lola: 52632733 markings, 531768304 edges, 64919 markings/sec, 625 secs
lola: 53026474 markings, 536065126 edges, 78748 markings/sec, 630 secs
lola: 53419537 markings, 540529545 edges, 78613 markings/sec, 635 secs
lola: 53775096 markings, 544768809 edges, 71112 markings/sec, 640 secs
lola: 54127478 markings, 548634962 edges, 70476 markings/sec, 645 secs
lola: 54602551 markings, 553131914 edges, 95015 markings/sec, 650 secs
lola: 55023984 markings, 557543017 edges, 84287 markings/sec, 655 secs
lola: 55400967 markings, 561546841 edges, 75397 markings/sec, 660 secs
lola: 55790789 markings, 565509864 edges, 77964 markings/sec, 665 secs
lola: 56152983 markings, 569509808 edges, 72439 markings/sec, 670 secs
lola: 56491218 markings, 573413499 edges, 67647 markings/sec, 675 secs
lola: 56804262 markings, 577122271 edges, 62609 markings/sec, 680 secs
lola: 57205827 markings, 580952145 edges, 80313 markings/sec, 685 secs
lola: 57568941 markings, 584741199 edges, 72623 markings/sec, 690 secs
lola: 57911776 markings, 588393461 edges, 68567 markings/sec, 695 secs
lola: 58383403 markings, 592423039 edges, 94325 markings/sec, 700 secs
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: memory allocation failed
lola:
preliminary result: yes no yes no yes no yes yes no no yes unknown
FORMULA DES-PT-30a-CTLCardinality-0 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-30a-CTLCardinality-1 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-30a-CTLCardinality-2 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-30a-CTLCardinality-3 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-30a-CTLCardinality-4 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-30a-CTLCardinality-5 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-30a-CTLCardinality-6 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-30a-CTLCardinality-7 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-30a-CTLCardinality-8 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-30a-CTLCardinality-9 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-30a-CTLCardinality-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-30a-CTLCardinality-11 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-30a-CTLCardinality-12 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-30a-CTLCardinality-13 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-30a-CTLCardinality-14 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-30a-CTLCardinality-15 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stderr -----
----- Kill lola and sara stdout -----
----- Finished stdout -----
----- Finished stderr -----

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="DES-PT-30a"
export BK_EXAMINATION="CTLCardinality"
export BK_TOOL="irma4mcc-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/DES-PT-30a.tgz
mv DES-PT-30a execution
cd execution
pwd
ls -lh

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-3637"
echo " Executing tool irma4mcc-structural"
echo " Input is DES-PT-30a, 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 r055-smll-152646382900241"
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 ;