About the Execution of Irma.struct for SwimmingPool-PT-10
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
15919.130 | 529683.00 | 461175.00 | 3710.60 | ???????????????? | normal |
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 172K
-rw-r--r-- 1 mcc users 4.2K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 16K 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.8K May 15 18:50 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 2.5K May 26 09:27 LTLCardinality.txt
-rw-r--r-- 1 mcc users 12K May 26 09:27 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.8K May 26 09:27 LTLFireability.txt
-rw-r--r-- 1 mcc users 8.1K May 26 09:27 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 17K May 15 18:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 109 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 347 May 15 18:54 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 2.5K 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 3 May 15 18:50 instance
-rw-r--r-- 1 mcc users 6 May 15 18:50 iscolored
-rw-r--r-- 1 mcc users 3.9K May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool irma4mcc-structural
Input is SwimmingPool-PT-10, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r211-smll-152732262400667
=====================================================================
--------------------
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 SwimmingPool-PT-10-LTLCardinality-00
FORMULA_NAME SwimmingPool-PT-10-LTLCardinality-01
FORMULA_NAME SwimmingPool-PT-10-LTLCardinality-02
FORMULA_NAME SwimmingPool-PT-10-LTLCardinality-03
FORMULA_NAME SwimmingPool-PT-10-LTLCardinality-04
FORMULA_NAME SwimmingPool-PT-10-LTLCardinality-05
FORMULA_NAME SwimmingPool-PT-10-LTLCardinality-06
FORMULA_NAME SwimmingPool-PT-10-LTLCardinality-07
FORMULA_NAME SwimmingPool-PT-10-LTLCardinality-08
FORMULA_NAME SwimmingPool-PT-10-LTLCardinality-09
FORMULA_NAME SwimmingPool-PT-10-LTLCardinality-10
FORMULA_NAME SwimmingPool-PT-10-LTLCardinality-11
FORMULA_NAME SwimmingPool-PT-10-LTLCardinality-12
FORMULA_NAME SwimmingPool-PT-10-LTLCardinality-13
FORMULA_NAME SwimmingPool-PT-10-LTLCardinality-14
FORMULA_NAME SwimmingPool-PT-10-LTLCardinality-15
=== Now, execution of the tool begins
BK_START 1527474846804
BK_STOP 1527475376487
--------------------
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 SwimmingPool-PT-10 as instance name.
Using SwimmingPool 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': True, 'Simple Free Choice': False, 'Extended Free Choice': False, 'State Machine': False, 'Marked Graph': False, 'Connected': True, 'Strongly Connected': True, 'Source Place': False, 'Sink Place': False, 'Source Transition': False, 'Sink Transition': False, 'Loop Free': True, 'Conservative': False, 'Sub-Conservative': False, 'Nested Units': False, 'Safe': False, 'Deadlock': False, 'Reversible': True, 'Quasi Live': None, 'Live': None}.
Known tools are: [{'Time': 506370, 'Memory': 14779.59, 'Tool': 'lola'}, {'Time': 506567, 'Memory': 13813.52, 'Tool': 'lola'}, {'Time': 3511122, 'Memory': 5451.85, 'Tool': 'itstools'}, {'Time': 3512195, 'Memory': 5454.14, 'Tool': 'itstools'}].
Learned tools are: [{'Tool': 'lola'}].
Learned tool lola is 1.0x far from the best tool lola.
LTLCardinality lola SwimmingPool-PT-10...
----- Start make prepare stderr -----
Time: 3600 - MCC
----- Start make prepare stdout -----
===========================================================================================
SwimmingPool-PT-10: translating PT Petri net model.pnml into LoLA format
===========================================================================================
translating PT Petri net complete
checking for too many tokens
===========================================================================================
SwimmingPool-PT-10: translating PT formula LTLCardinality into LoLA format
===========================================================================================
translating formula complete
touch formulae;
----- Start make result stdout -----
----- Start make result stderr -----
LTLCardinality @ SwimmingPool-PT-10 @ 3539 seconds
make: [verify] Error 134 (ignored)
----- Start make result stderr -----
----- Kill lola and sara stderr -----
----- Finished stderr -----
Makefile:222: recipe for target 'verify' failed
----- Start make result stdout -----
lola: LoLA will run for 3539 seconds at most (--timelimit)
lola: NET
lola: reading net from model.pnml.lola
lola: finished parsing
lola: closed net file model.pnml.lola
lola: 16/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: finding significant places
lola: 9 places, 7 transitions, 6 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 9 transition conflict sets
lola: TASK
lola: reading formula from SwimmingPool-PT-10-LTLCardinality.task
lola: A ((1 <= Dressed)) : A (G ((1 <= InBath))) : A (F ((G ((Bags <= Entered)) U G ((1 <= Dress))))) : A ((((1 <= Undress) U (Dress <= Dressed)) U (Dressed <= Entered))) : A (G ((Out <= Bags))) : A (F ((F ((Cabins <= InBath)) U X ((Dressed <= Cabins))))) : A (F (F (X (G ((Bags <= Dress)))))) : A ((F (X ((3 <= Dress))) U G (G ((Out <= Dress))))) : A (X (G ((2 <= Entered)))) : A (F (F (((Entered <= Out) U (Dress <= Cabins))))) : A ((G (F ((2 <= Out))) U F ((2 <= Bags)))) : A (X (F (X (G ((1 <= Bags)))))) : A ((1 <= Entered)) : A (X ((Out <= Dressed))) : A (X (X (((Dress <= InBath) U (Undress <= Entered))))) : A (G (G (X (F ((Cabins <= Out))))))
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 ((1 <= Dressed))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (1 <= Dressed)
lola: processed formula length: 14
lola: 1 rewrites
lola: formula mentions 0 of 9 places; total mentions: 0
lola: closed formula file SwimmingPool-PT-10-LTLCardinality.task
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 1 will run for 235 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((1 <= InBath)))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 24 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: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((G ((Bags <= Entered)) U G ((1 <= Dress)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F ((G ((Bags <= Entered)) U G ((1 <= Dress)))))
lola: processed formula: A (F ((G ((Bags <= Entered)) U G ((1 <= Dress)))))
lola: processed formula length: 50
lola: 0 rewrites
lola: formula mentions 0 of 9 places; total mentions: 0
lola: closed formula file SwimmingPool-PT-10-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 28 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: 307 markings, 308 edges
lola: ========================================
lola: subprocess 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((((1 <= Undress) U (Dress <= Dressed)) U (Dressed <= Entered)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A ((((1 <= Undress) U (Dress <= Dressed)) U (Dressed <= Entered)))
lola: processed formula: A ((((1 <= Undress) U (Dress <= Dressed)) U (Dressed <= Entered)))
lola: processed formula length: 66
lola: 0 rewrites
lola: formula mentions 0 of 9 places; total mentions: 0
lola: closed formula file SwimmingPool-PT-10-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 28 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: 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 4 will run for 294 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((Out <= Bags)))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 24 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: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 5 will run for 321 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((F ((Cabins <= InBath)) U X ((Dressed <= Cabins)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F ((F ((Cabins <= InBath)) U X ((Dressed <= Cabins)))))
lola: processed formula: A (F ((F ((Cabins <= InBath)) U X ((Dressed <= Cabins)))))
lola: processed formula length: 58
lola: 0 rewrites
lola: formula mentions 0 of 9 places; total mentions: 0
lola: closed formula file SwimmingPool-PT-10-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 28 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: 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 6 will run for 353 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (F (X (G ((Bags <= Dress))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F (X (G ((Bags <= Dress)))))
lola: processed formula: A (F (X (G ((Bags <= Dress)))))
lola: processed formula length: 31
lola: 1 rewrites
lola: formula mentions 0 of 9 places; total mentions: 0
lola: closed formula file SwimmingPool-PT-10-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 28 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: 406 markings, 406 edges
lola: ========================================
lola: subprocess 7 will run for 393 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((F (X ((3 <= Dress))) U G (G ((Out <= Dress)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A ((F (X ((3 <= Dress))) U G (G ((Out <= Dress)))))
lola: processed formula: A ((F (X ((3 <= Dress))) U G (G ((Out <= Dress)))))
lola: processed formula length: 51
lola: 0 rewrites
lola: formula mentions 0 of 9 places; total mentions: 0
lola: closed formula file SwimmingPool-PT-10-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 4 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 28 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: 406 markings, 406 edges
lola: ========================================
lola: subprocess 8 will run for 442 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (G ((2 <= Entered))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (X (G ((2 <= Entered))))
lola: processed formula: A (X (G ((2 <= Entered))))
lola: processed formula length: 26
lola: 0 rewrites
lola: formula mentions 0 of 9 places; total mentions: 0
lola: closed formula file SwimmingPool-PT-10-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 28 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: 406 markings, 406 edges
lola: ========================================
lola: subprocess 9 will run for 505 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (F (((Entered <= Out) U (Dress <= Cabins)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F (((Entered <= Out) U (Dress <= Cabins))))
lola: processed formula: A (F (((Entered <= Out) U (Dress <= Cabins))))
lola: processed formula length: 46
lola: 1 rewrites
lola: formula mentions 0 of 9 places; total mentions: 0
lola: closed formula file SwimmingPool-PT-10-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 28 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 10 will run for 589 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((G (F ((2 <= Out))) U F ((2 <= Bags))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A ((G (F ((2 <= Out))) U F ((2 <= Bags))))
lola: processed formula: A ((G (F ((2 <= Out))) U F ((2 <= Bags))))
lola: processed formula length: 42
lola: 0 rewrites
lola: formula mentions 0 of 9 places; total mentions: 0
lola: closed formula file SwimmingPool-PT-10-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 28 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 11 will run for 707 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (F (X (G ((1 <= Bags))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (X (F (X (G ((1 <= Bags))))))
lola: processed formula: A (X (F (X (G ((1 <= Bags))))))
lola: processed formula length: 31
lola: 0 rewrites
lola: formula mentions 0 of 9 places; total mentions: 0
lola: closed formula file SwimmingPool-PT-10-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 4 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 28 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: 1980849 markings, 5470105 edges, 396170 markings/sec, 0 secs
lola: 3578667 markings, 10346490 edges, 319564 markings/sec, 5 secs
lola: 5040838 markings, 14937520 edges, 292434 markings/sec, 10 secs
lola: 6420423 markings, 19331189 edges, 275917 markings/sec, 15 secs
lola: 7753282 markings, 23615696 edges, 266572 markings/sec, 20 secs
lola: 9052052 markings, 27811211 edges, 259754 markings/sec, 25 secs
lola: 10310924 markings, 31931762 edges, 251774 markings/sec, 30 secs
lola: 11532828 markings, 35960715 edges, 244381 markings/sec, 35 secs
lola: 12732705 markings, 39917794 edges, 239975 markings/sec, 40 secs
lola: 13913033 markings, 43829668 edges, 236066 markings/sec, 45 secs
lola: 15093038 markings, 47736722 edges, 236001 markings/sec, 50 secs
lola: 16237170 markings, 51568150 edges, 228826 markings/sec, 55 secs
lola: 17368259 markings, 55370055 edges, 226218 markings/sec, 60 secs
lola: 18481686 markings, 59128177 edges, 222685 markings/sec, 65 secs
lola: 19571105 markings, 62816216 edges, 217884 markings/sec, 70 secs
lola: 20660351 markings, 66496598 edges, 217849 markings/sec, 75 secs
lola: 21732391 markings, 70127708 edges, 214408 markings/sec, 80 secs
lola: 22793300 markings, 73736728 edges, 212182 markings/sec, 85 secs
lola: 23838513 markings, 77300256 edges, 209043 markings/sec, 90 secs
lola: 24876460 markings, 80831319 edges, 207589 markings/sec, 95 secs
lola: 25902556 markings, 84333860 edges, 205219 markings/sec, 100 secs
lola: 26916664 markings, 87812275 edges, 202822 markings/sec, 105 secs
lola: 27929753 markings, 91275015 edges, 202618 markings/sec, 110 secs
lola: 28912551 markings, 94620781 edges, 196560 markings/sec, 115 secs
lola: 29877426 markings, 97912195 edges, 192975 markings/sec, 120 secs
lola: 30845467 markings, 101207248 edges, 193608 markings/sec, 125 secs
lola: 31830803 markings, 104569089 edges, 197067 markings/sec, 130 secs
lola: 32811117 markings, 107929499 edges, 196063 markings/sec, 135 secs
lola: 33787799 markings, 111288535 edges, 195336 markings/sec, 140 secs
lola: 34766147 markings, 114644009 edges, 195670 markings/sec, 145 secs
lola: 35730667 markings, 117954914 edges, 192904 markings/sec, 150 secs
lola: 36682133 markings, 121229796 edges, 190293 markings/sec, 155 secs
lola: 37628779 markings, 124490724 edges, 189329 markings/sec, 160 secs
lola: 38557546 markings, 127696407 edges, 185753 markings/sec, 165 secs
lola: 39476341 markings, 130874926 edges, 183759 markings/sec, 170 secs
lola: 40388649 markings, 134030032 edges, 182462 markings/sec, 175 secs
lola: 41286493 markings, 137140154 edges, 179569 markings/sec, 180 secs
lola: 42179157 markings, 140236292 edges, 178533 markings/sec, 185 secs
lola: 43064694 markings, 143306240 edges, 177107 markings/sec, 190 secs
lola: 43946537 markings, 146361891 edges, 176369 markings/sec, 195 secs
lola: 44817597 markings, 149398337 edges, 174212 markings/sec, 200 secs
lola: 45685221 markings, 152414895 edges, 173525 markings/sec, 205 secs
lola: 46538653 markings, 155397754 edges, 170686 markings/sec, 210 secs
lola: 47395784 markings, 158384009 edges, 171426 markings/sec, 215 secs
lola: 48241266 markings, 161333513 edges, 169096 markings/sec, 220 secs
lola: 49081025 markings, 164262630 edges, 167952 markings/sec, 225 secs
lola: 49924980 markings, 167201021 edges, 168791 markings/sec, 230 secs
lola: 50755147 markings, 170105175 edges, 166033 markings/sec, 235 secs
lola: 51538466 markings, 172842820 edges, 156664 markings/sec, 240 secs
lola: 52319026 markings, 175574559 edges, 156112 markings/sec, 245 secs
lola: 53095821 markings, 178298986 edges, 155359 markings/sec, 250 secs
lola: 53878747 markings, 181036935 edges, 156585 markings/sec, 255 secs
lola: 54652272 markings, 183749572 edges, 154705 markings/sec, 260 secs
lola: 55426112 markings, 186472354 edges, 154768 markings/sec, 265 secs
lola: 56203522 markings, 189197183 edges, 155482 markings/sec, 270 secs
lola: 56977192 markings, 191909827 edges, 154734 markings/sec, 275 secs
lola: 57745716 markings, 194605077 edges, 153705 markings/sec, 280 secs
lola: 58512341 markings, 197293628 edges, 153325 markings/sec, 285 secs
lola: 59270036 markings, 199958747 edges, 151539 markings/sec, 290 secs
lola: 60035149 markings, 202642836 edges, 153023 markings/sec, 295 secs
lola: 60795073 markings, 205323612 edges, 151985 markings/sec, 300 secs
lola: 61576462 markings, 208064531 edges, 156278 markings/sec, 305 secs
lola: 62370413 markings, 210840279 edges, 158790 markings/sec, 310 secs
lola: 63178503 markings, 213679695 edges, 161618 markings/sec, 315 secs
lola: 63997239 markings, 216558091 edges, 163747 markings/sec, 320 secs
lola: 64813977 markings, 219432923 edges, 163348 markings/sec, 325 secs
lola: 65626068 markings, 222294852 edges, 162418 markings/sec, 330 secs
lola: 66453873 markings, 225192035 edges, 165561 markings/sec, 335 secs
lola: 67266326 markings, 228059985 edges, 162491 markings/sec, 340 secs
lola: 68078858 markings, 230920619 edges, 162506 markings/sec, 345 secs
lola: 68884665 markings, 233761720 edges, 161161 markings/sec, 350 secs
lola: 69692515 markings, 236601624 edges, 161570 markings/sec, 355 secs
lola: 70474708 markings, 239366354 edges, 156439 markings/sec, 360 secs
lola: 71287746 markings, 242227227 edges, 162608 markings/sec, 365 secs
lola: 72097382 markings, 245086456 edges, 161927 markings/sec, 370 secs
lola: 72894667 markings, 247912506 edges, 159457 markings/sec, 375 secs
lola: 73699321 markings, 250759299 edges, 160931 markings/sec, 380 secs
lola: 74504000 markings, 253606072 edges, 160936 markings/sec, 385 secs
lola: 75277075 markings, 256349182 edges, 154615 markings/sec, 390 secs
lola: 76040705 markings, 259058437 edges, 152726 markings/sec, 395 secs
lola: 76803036 markings, 261762225 edges, 152466 markings/sec, 400 secs
lola: 77569458 markings, 264478171 edges, 153284 markings/sec, 405 secs
lola: 78326495 markings, 267165808 edges, 151407 markings/sec, 410 secs
lola: 79090607 markings, 269875687 edges, 152822 markings/sec, 415 secs
lola: 79846504 markings, 272564543 edges, 151179 markings/sec, 420 secs
lola: 80601750 markings, 275249433 edges, 151049 markings/sec, 425 secs
lola: 81362147 markings, 277953078 edges, 152079 markings/sec, 430 secs
lola: 82117365 markings, 280648911 edges, 151044 markings/sec, 435 secs
lola: 82875266 markings, 283335402 edges, 151580 markings/sec, 440 secs
lola: 82989396 markings, 283740518 edges, 22826 markings/sec, 445 secs
lola: 82994745 markings, 283759918 edges, 1070 markings/sec, 450 secs
lola: 82994763 markings, 283759974 edges, 4 markings/sec, 455 secs
lola: 82995777 markings, 283763648 edges, 203 markings/sec, 460 secs
lola: 82999436 markings, 283777038 edges, 732 markings/sec, 465 secs
lola: 82999446 markings, 283777070 edges, 2 markings/sec, 470 secs
lola: 82999457 markings, 283777104 edges, 2 markings/sec, 475 secs
lola: 82999462 markings, 283777125 edges, 1 markings/sec, 480 secs
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: '\ufffd'
Aborted (core dumped)
FORMULA SwimmingPool-PT-10-LTLCardinality-0 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SwimmingPool-PT-10-LTLCardinality-1 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SwimmingPool-PT-10-LTLCardinality-2 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SwimmingPool-PT-10-LTLCardinality-3 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SwimmingPool-PT-10-LTLCardinality-4 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SwimmingPool-PT-10-LTLCardinality-5 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SwimmingPool-PT-10-LTLCardinality-6 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SwimmingPool-PT-10-LTLCardinality-7 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SwimmingPool-PT-10-LTLCardinality-8 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SwimmingPool-PT-10-LTLCardinality-9 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SwimmingPool-PT-10-LTLCardinality-10 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SwimmingPool-PT-10-LTLCardinality-11 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SwimmingPool-PT-10-LTLCardinality-12 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SwimmingPool-PT-10-LTLCardinality-13 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SwimmingPool-PT-10-LTLCardinality-14 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SwimmingPool-PT-10-LTLCardinality-15 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stdout -----
----- 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="SwimmingPool-PT-10"
export BK_EXAMINATION="LTLCardinality"
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/SwimmingPool-PT-10.tgz
mv SwimmingPool-PT-10 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 SwimmingPool-PT-10, 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 r211-smll-152732262400667"
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 '
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 ;