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 1.5M
-rw-r--r-- 1 mcc users 3.8K 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 2.6K 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 6.0K May 15 18:50 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 2.7K May 15 18:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 12K May 15 18:54 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 15 18:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 11K May 15 18:54 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 106 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 344 May 15 18:54 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 2.8K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 14K May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 15 18:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 15 18:54 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 15 18:50 equiv_col
-rw-r--r-- 1 mcc users 4 May 15 18:50 instance
-rw-r--r-- 1 mcc users 6 May 15 18:50 iscolored
-rw-r--r-- 1 mcc users 1.4M May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool irma4mcc-full
Input is Railroad-PT-050, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r138-qhx2-152673580700192
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1527152011469


BK_STOP 1527152324217

--------------------
content from stderr:

Prefix is 65b80f64.
Reading known information in /usr/share/mcc4mcc/65b80f64-known.json.
Reading learned information in /usr/share/mcc4mcc/65b80f64-learned.json.
Reading value translations in /usr/share/mcc4mcc/65b80f64-values.json.
Using directory /home/mcc/execution for input, as it contains a model.pnml file.
Using Railroad-PT-050 as instance name.
Using Railroad 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': False, 'Strongly Connected': False, 'Source Place': True, 'Sink Place': True, 'Source Transition': False, 'Sink Transition': False, 'Loop Free': False, 'Conservative': False, 'Sub-Conservative': False, 'Nested Units': False, 'Safe': None, 'Deadlock': False, 'Reversible': None, 'Quasi Live': False, 'Live': False}.
Known tools are: [{'Time': 1617113, 'Memory': 15951.88, 'Tool': 'lola'}, {'Time': 1635038, 'Memory': 15951.71, 'Tool': 'lola'}].
Learned tools are: [{'Tool': 'lola'}].
Learned tool lola is 1.0x far from the best tool lola.
CTLCardinality lola Railroad-PT-050...

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


checking for too many tokens
===========================================================================================
Railroad-PT-050: translating PT formula CTLCardinality into LoLA format
===========================================================================================
translating formula complete
touch formulae;
----- Start make result stdout -----
----- Start make result stderr -----
CTLCardinality @ Railroad-PT-050 @ 3538 seconds
make: [verify] Error 134 (ignored)
Makefile:222: recipe for target 'verify' failed
----- Start make result stderr -----
----- Start make result stdout -----
lola: LoLA will run for 3538 seconds at most (--timelimit)
lola: NET
lola: reading net from model.pnml.lola
lola: finished parsing
lola: closed net file model.pnml.lola
lola: 3274/65536 symbol table entries, 223 collisions
lola: preprocessing...
lola: finding significant places
lola: 518 places, 2756 transitions, 207 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 312 transition conflict sets
lola: TASK
lola: reading formula from Railroad-PT-050-CTLCardinality.task
lola: NOT((A (G ((pl_P168_37 <= 2))) AND A (F (((pl_P168_44 <= pl_P260_1) OR (pl_P261_41 <= pl_P160_1)))))) : (A (X (A (F ((1 <= pl_P178_1))))) AND A (F (((3 <= pl_P233_28) AND ((3 <= pl_P35_1) OR (2 <= pl_P112_3)))))) : E (G (E (X ((pl_P168_33 + 1 <= pl_P233_9))))) : ((E (G ((pl_P16_40 + 1 <= pl_P128_1))) OR E (F (((2 <= pl_P261_10) AND (pl_P149_1 <= pl_P261_27))))) OR ((A (F ((pl_P125_1 <= pl_P242_1))) OR ((2 <= pl_P261_33) OR (pl_P6_1 <= pl_P8_1) OR ((pl_P77_1 <= pl_P112_27) AND (1 <= pl_P212_1)))) AND (E (F ((1 <= pl_P168_17))) OR ((2 <= pl_P168_34) OR (3 <= pl_P233_11) OR (3 <= pl_P261_31))))) : NOT(E (((pl_P261_44 <= pl_P16_6) U ((2 <= pl_P261_11) OR (1 <= pl_P168_18))))) : E (G (E (((2 <= pl_P10_1) U (pl_P112_9 <= pl_P112_48))))) : NOT(NOT(A (F ((2 <= pl_P158_1))))) : A (X (E (F (((2 <= pl_P38_1) AND (pl_P16_30 <= pl_P168_24)))))) : E (F (((2 <= pl_P21_1) AND (pl_P162_1 + 1 <= pl_P139_1)))) : (E (X (E (G ((2 <= pl_P18_1))))) OR A (((pl_P168_28 <= 1) U ((2 <= pl_P188_1) AND (pl_P261_18 <= pl_P240_1))))) : E (F (E (G (((pl_P233_22 <= pl_P112_49) OR (pl_P168_32 <= pl_P231_1)))))) : (E (G (A (F ((2 <= pl_P261_16))))) AND NOT((((pl_P233_38 + 1 <= pl_P233_1) OR (pl_P112_7 + 1 <= pl_P51_1)) AND A (G ((3 <= pl_P96_1)))))) : NOT(E ((((2 <= pl_P16_22) OR (pl_P16_2 <= pl_P168_16)) U ((pl_P106_1 <= pl_P89_1) AND (2 <= pl_P66_1))))) : NOT(NOT(E (F (((3 <= pl_P112_23) AND (2 <= pl_P31_1)))))) : E (F (A (X ((2 <= pl_P168_50))))) : E ((((3 <= pl_P89_1) OR (pl_P234_1 <= pl_P261_51)) U (pl_P240_1 + 1 <= pl_P261_38)))
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT((A (G ((pl_P168_37 <= 2))) AND A (F (((pl_P168_44 <= pl_P260_1) OR (pl_P261_41 <= pl_P160_1))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((3 <= pl_P168_37)))
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 828 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to Railroad-PT-050-CTLCardinality.sara
lola: state equation: calling and running sara
sara: try reading problem file Railroad-PT-050-CTLCardinality.sara.
sara: place or transition ordering is non-deterministic
lola: sara is running 0 secs || 11258 markings, 18097 edges, 2252 markings/sec, 0 secs

lola: state equation: solution impossible
lola: SUBRESULT
lola: result: no
lola: produced by: state equation
lola: The predicate is unreachable.
lola: ========================================
lola: subprocess 1 will run for 235 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G (((pl_P260_1 + 1 <= pl_P168_44) AND (pl_P160_1 + 1 <= pl_P261_41))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U ((pl_P168_44 <= pl_P260_1) OR (pl_P261_41 <= pl_P160_1))))
lola: processed formula length: 72
lola: 9 rewrites
lola: formula mentions 0 of 518 places; total mentions: 0
lola: closed formula file Railroad-PT-050-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 828 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 1 markings, 0 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 1 will run for 235 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (A (X (A (F ((1 <= pl_P178_1))))) AND A (F (((3 <= pl_P233_28) AND ((3 <= pl_P35_1) OR (2 <= pl_P112_3))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 1 will run for 235 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (A (F ((1 <= pl_P178_1)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: AX(A(TRUE U (1 <= pl_P178_1)))
lola: processed formula length: 30
lola: 2 rewrites
lola: formula mentions 0 of 518 places; total mentions: 0
lola: closed formula file Railroad-PT-050-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 828 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains EX or AX operators, stubborn sets not applicable
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 41 markings, 41 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G (E (X ((pl_P168_33 + 1 <= pl_P233_9)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U NOT(EX((pl_P168_33 + 1 <= pl_P233_9)))))
lola: processed formula length: 53
lola: 2 rewrites
lola: formula mentions 0 of 518 places; total mentions: 0
lola: closed formula file Railroad-PT-050-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 828 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains EX or AX operators, stubborn sets not applicable
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 42 markings, 42 edges
lola: ========================================
lola: subprocess 3 will run for 271 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((E (G ((pl_P16_40 + 1 <= pl_P128_1))) OR E (F (((2 <= pl_P261_10) AND (pl_P149_1 <= pl_P261_27))))) OR ((A (F ((pl_P125_1 <= pl_P242_1))) OR ((2 <= pl_P261_33) OR (pl_P6_1 <= pl_P8_1) OR ((pl_P77_1 <= pl_P112_27) AND (1 <= pl_P212_1)))) AND (E (F ((1 <= pl_P168_17))) OR ((2 <= pl_P168_34) OR (3 <= pl_P233_11) OR (3 <= pl_P261_31)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 3 will run for 271 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G ((pl_P16_40 + 1 <= pl_P128_1)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U (pl_P128_1 <= pl_P16_40)))
lola: processed formula length: 39
lola: 3 rewrites
lola: formula mentions 0 of 518 places; total mentions: 0
lola: closed formula file Railroad-PT-050-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 828 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 1 markings, 0 edges
lola: ========================================
lola: subprocess 4 will run for 294 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((2 <= pl_P261_10) AND (pl_P149_1 <= pl_P261_27))))
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 828 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is unreachable.
lola: 1 markings, 0 edges
lola: ========================================
lola: subprocess 5 will run for 321 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((pl_P125_1 <= pl_P242_1)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F ((pl_P125_1 <= pl_P242_1)))
lola: processed formula: A (F ((pl_P125_1 <= pl_P242_1)))
lola: processed formula length: 32
lola: 1 rewrites
lola: formula mentions 0 of 518 places; total mentions: 0
lola: closed formula file Railroad-PT-050-CTLCardinality.task
lola: the resulting B\xfcchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 832 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: 43 markings, 43 edges
lola: ========================================
lola: subprocess 6 will run for 353 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((2 <= pl_P261_33) OR (pl_P6_1 <= pl_P8_1) OR ((pl_P77_1 <= pl_P112_27) AND (1 <= pl_P212_1)))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((2 <= pl_P261_33) OR (pl_P6_1 <= pl_P8_1) OR ((pl_P77_1 <= pl_P112_27) AND (1 <= pl_P212_1)))
lola: processed formula length: 96
lola: 1 rewrites
lola: formula mentions 0 of 518 places; total mentions: 0
lola: closed formula file Railroad-PT-050-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 7 will run for 392 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((1 <= pl_P168_17)))
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 828 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to Railroad-PT-050-CTLCardinality-7.sara
lola: state equation: calling and running sara
sara: try reading problem file Railroad-PT-050-CTLCardinality-7.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 36 markings, 35 edges
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: ========================================
lola: subprocess 4 will run for 294 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT(E (((pl_P261_44 <= pl_P16_6) U ((2 <= pl_P261_11) OR (1 <= pl_P168_18)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (((pl_P16_6 + 1 <= pl_P261_44) R ((pl_P261_11 <= 1) AND (pl_P168_18 <= 0))))
lola: processed formula: A (((pl_P16_6 + 1 <= pl_P261_44) R ((pl_P261_11 <= 1) AND (pl_P168_18 <= 0))))
lola: processed formula length: 78
lola: 4 rewrites
lola: formula mentions 0 of 518 places; total mentions: 0
lola: closed formula file Railroad-PT-050-CTLCardinality.task
lola: the resulting B\xfcchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 832 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: 10190 markings, 20988 edges, 2038 markings/sec, 0 secs
lola: 20819 markings, 43083 edges, 2126 markings/sec, 5 secs
lola: 31179 markings, 65576 edges, 2072 markings/sec, 10 secs
lola: 41482 markings, 86913 edges, 2061 markings/sec, 15 secs
lola: 51414 markings, 108452 edges, 1986 markings/sec, 20 secs
lola: 61253 markings, 128496 edges, 1968 markings/sec, 25 secs
lola: 70875 markings, 148927 edges, 1924 markings/sec, 30 secs
lola: 80546 markings, 168122 edges, 1934 markings/sec, 35 secs
lola: 90055 markings, 189396 edges, 1902 markings/sec, 40 secs
lola: 99322 markings, 213208 edges, 1853 markings/sec, 45 secs
lola: 109035 markings, 234039 edges, 1943 markings/sec, 50 secs
lola: 118814 markings, 254893 edges, 1956 markings/sec, 55 secs
lola: 128530 markings, 276731 edges, 1943 markings/sec, 60 secs
lola: 138361 markings, 297052 edges, 1966 markings/sec, 65 secs
lola: 148120 markings, 318433 edges, 1952 markings/sec, 70 secs
lola: 158322 markings, 340012 edges, 2040 markings/sec, 75 secs
lola: 168349 markings, 361156 edges, 2005 markings/sec, 80 secs
lola: 178827 markings, 382422 edges, 2096 markings/sec, 85 secs
lola: 189423 markings, 404338 edges, 2119 markings/sec, 90 secs
lola: 199852 markings, 427744 edges, 2086 markings/sec, 95 secs
lola: 210486 markings, 449608 edges, 2127 markings/sec, 100 secs
lola: 221152 markings, 471710 edges, 2133 markings/sec, 105 secs
lola: 231054 markings, 491679 edges, 1980 markings/sec, 110 secs
lola: 240762 markings, 513377 edges, 1942 markings/sec, 115 secs
lola: 250436 markings, 533232 edges, 1935 markings/sec, 120 secs
lola: 260147 markings, 553521 edges, 1942 markings/sec, 125 secs
lola: 269845 markings, 573835 edges, 1940 markings/sec, 130 secs
lola: 279541 markings, 593960 edges, 1939 markings/sec, 135 secs
lola: 289070 markings, 618251 edges, 1906 markings/sec, 140 secs
lola: 298907 markings, 638589 edges, 1967 markings/sec, 145 secs
lola: 308860 markings, 658924 edges, 1991 markings/sec, 150 secs
lola: 318649 markings, 680953 edges, 1958 markings/sec, 155 secs
lola: 329443 markings, 702840 edges, 2159 markings/sec, 160 secs
lola: 339699 markings, 723962 edges, 2051 markings/sec, 165 secs
lola: 349716 markings, 744182 edges, 2003 markings/sec, 170 secs
lola: 359716 markings, 764878 edges, 2000 markings/sec, 175 secs
lola: 369931 markings, 784894 edges, 2043 markings/sec, 180 secs
lola: 379904 markings, 808048 edges, 1995 markings/sec, 185 secs
lola: 389494 markings, 830519 edges, 1918 markings/sec, 190 secs
lola: 399214 markings, 851082 edges, 1944 markings/sec, 195 secs
lola: 408866 markings, 873152 edges, 1930 markings/sec, 200 secs
lola: 418699 markings, 892892 edges, 1967 markings/sec, 205 secs
lola: 428637 markings, 913232 edges, 1988 markings/sec, 210 secs
lola: 438683 markings, 933212 edges, 2009 markings/sec, 215 secs
lola: 449134 markings, 954139 edges, 2090 markings/sec, 220 secs
lola: 459521 markings, 976433 edges, 2077 markings/sec, 225 secs
lola: 469387 markings, 997171 edges, 1973 markings/sec, 230 secs
lola: 478933 markings, 1019177 edges, 1909 markings/sec, 235 secs
lola: 489035 markings, 1039390 edges, 2020 markings/sec, 240 secs
lola: 499233 markings, 1059766 edges, 2040 markings/sec, 245 secs
lola: 509397 markings, 1081783 edges, 2033 markings/sec, 250 secs
lola: 519551 markings, 1104548 edges, 2031 markings/sec, 255 secs
lola: 529513 markings, 1125678 edges, 1992 markings/sec, 260 secs
lola: 539596 markings, 1145732 edges, 2017 markings/sec, 265 secs
lola: 549396 markings, 1165425 edges, 1960 markings/sec, 270 secs
lola: 559619 markings, 1185686 edges, 2045 markings/sec, 275 secs
lola: 569946 markings, 1209551 edges, 2065 markings/sec, 280 secs
lola: 580273 markings, 1230505 edges, 2065 markings/sec, 285 secs
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
terminate called after throwing an instance of 'std::runtime_error'
what(): parse error at position 0: unexpected character, last read: '
'
Aborted (core dumped)
FORMULA Railroad-PT-050-CTLCardinality-0 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Railroad-PT-050-CTLCardinality-1 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Railroad-PT-050-CTLCardinality-2 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Railroad-PT-050-CTLCardinality-3 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Railroad-PT-050-CTLCardinality-4 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Railroad-PT-050-CTLCardinality-5 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Railroad-PT-050-CTLCardinality-6 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Railroad-PT-050-CTLCardinality-7 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Railroad-PT-050-CTLCardinality-8 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Railroad-PT-050-CTLCardinality-9 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Railroad-PT-050-CTLCardinality-10 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Railroad-PT-050-CTLCardinality-11 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stderr -----
FORMULA Railroad-PT-050-CTLCardinality-12 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Railroad-PT-050-CTLCardinality-13 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Railroad-PT-050-CTLCardinality-14 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Railroad-PT-050-CTLCardinality-15 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- 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="Railroad-PT-050"
export BK_EXAMINATION="CTLCardinality"
export BK_TOOL="irma4mcc-full"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

tar xzf /home/mcc/BenchKit/INPUTS/Railroad-PT-050.tgz
mv Railroad-PT-050 execution
cd execution
pwd
ls -lh

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-3637"
echo " Executing tool irma4mcc-full"
echo " Input is Railroad-PT-050, 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 r138-qhx2-152673580700192"
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 ;