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 232K
-rw-r--r-- 1 mcc users 4.0K 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.5K 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 6.1K May 15 18:50 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 2.6K 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 1.9K 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.3K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 16K May 15 18:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 113 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 351 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 13K 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 69K May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool irma4mcc-full
Input is FlexibleBarrier-PT-04b, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r090-blw7-152650001100109
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1527055391986


BK_STOP 1527056037592

--------------------
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 FlexibleBarrier-PT-04b as instance name.
Using FlexibleBarrier as model name.
Using algorithm or tool voting-classifier.
Model characteristics are: {'Examination': 'CTLFireability', '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': False, 'Source Transition': False, 'Sink Transition': False, 'Loop Free': None, 'Conservative': False, 'Sub-Conservative': False, 'Nested Units': True, 'Safe': True, 'Deadlock': None, 'Reversible': None, 'Quasi Live': None, 'Live': None}.
/usr/local/lib/python3.6/dist-packages/sklearn/preprocessing/label.py:151: DeprecationWarning: The truth value of an empty array is ambiguous. Returning False, but in future this will result in an error. Use `array.size > 0` to check that an array is not empty.
if diff:
Known tools are: [{'Time': 144047, 'Memory': 2292.34, 'Tool': 'lola'}].
Learned tools are: [{'Tool': 'lola'}].
Learned tool lola is 1.0x far from the best tool lola.
CTLFireability lola FlexibleBarrier-PT-04b...

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


checking for too many tokens
===========================================================================================
FlexibleBarrier-PT-04b: translating PT formula CTLFireability into LoLA format
===========================================================================================
translating formula complete
touch formulae;
----- Start make result stdout -----
----- Start make result stderr -----
CTLFireability @ FlexibleBarrier-PT-04b @ 3540 seconds
----- Start make result stdout -----
----- Start make result stderr -----
lola: LoLA will run for 3540 seconds at most (--timelimit)
lola: NET
lola: reading net from model.pnml.lola
lola: finished parsing
lola: closed net file model.pnml.lola
lola: 573/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: finding significant places
lola: 268 places, 305 transitions, 262 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 315 transition conflict sets
lola: TASK
lola: reading formula from FlexibleBarrier-PT-04b-CTLFireability.task
lola: (E (F (A (F ((FIREABLE(t196) AND FIREABLE(t133)))))) OR (((FIREABLE(t283) OR FIREABLE(t211)) OR A ((FIREABLE(t195) U FIREABLE(t70)))) AND E (F ((FIREABLE(t43) AND FIREABLE(t210) AND FIREABLE(t278)))))) : A (G ((FIREABLE(t122) OR NOT FIREABLE(t167) OR FIREABLE(t23) OR FIREABLE(t285)))) : A (G (NOT(A (X ((FIREABLE(t274) AND FIREABLE(t92))))))) : E (F (FIREABLE(t191))) : (NOT FIREABLE(t282) AND E (F (FIREABLE(t266)))) : NOT(A (F (E (F ((FIREABLE(t239) OR FIREABLE(t251))))))) : E (F (E (((FIREABLE(t186) OR FIREABLE(t157)) U (FIREABLE(t31) OR FIREABLE(t35)))))) : (E ((A (G (FIREABLE(t234))) U A (X (FIREABLE(t250))))) OR (NOT(NOT(E (F (FIREABLE(t301))))) OR E (G (FIREABLE(t219))))) : E (F ((FIREABLE(t98) AND (((FIREABLE(t41) AND FIREABLE(t134)) OR (FIREABLE(t52) AND FIREABLE(t155))) AND E (F (FIREABLE(t274))))))) : E (F ((E ((FIREABLE(t95) U FIREABLE(t271))) OR FIREABLE(t173)))) : E (G (E (F (A (G (FIREABLE(t103))))))) : E (F ((NOT FIREABLE(t27) AND ((FIREABLE(t157) AND FIREABLE(t245)) OR NOT FIREABLE(t269)) AND (FIREABLE(t272) OR FIREABLE(t41) OR FIREABLE(t211)) AND (NOT FIREABLE(t233) OR NOT FIREABLE(t264))))) : (A (F (((NOT FIREABLE(t30) AND NOT FIREABLE(t17)) AND A (G (FIREABLE(t143)))))) OR E (G (A (G (NOT FIREABLE(t210)))))) : E (F ((NOT FIREABLE(t304) AND FIREABLE(t8) AND ((NOT FIREABLE(t9) AND NOT FIREABLE(t150)) OR FIREABLE(t78))))) : (FIREABLE(t70) OR NOT(A (G ((NOT FIREABLE(t148) OR NOT FIREABLE(t230)))))) : (E (G (FIREABLE(t173))) OR E ((NOT FIREABLE(t124) U FIREABLE(t191))))
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (E (F (A (F ((FIREABLE(t196) AND FIREABLE(t133)))))) OR (((FIREABLE(t283) OR FIREABLE(t211)) OR A ((FIREABLE(t195) U FIREABLE(t70)))) AND E (F ((FIREABLE(t43) AND FIREABLE(t210) AND FIREABLE(t278))))))
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 (A (F ((FIREABLE(t196) AND FIREABLE(t133))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(TRUE U A(TRUE U (FIREABLE(t196) AND FIREABLE(t133))))
lola: processed formula length: 55
lola: 2 rewrites
lola: formula mentions 0 of 268 places; total mentions: 0
lola: closed formula file FlexibleBarrier-PT-04b-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 36 bytes per marking, with 26 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: 761302 markings, 3107587 edges, 2734514280459141120 markings/sec, 0 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 797625 markings, 3255417 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 1 will run for 235 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((FIREABLE(t122) OR NOT FIREABLE(t167) OR FIREABLE(t23) OR FIREABLE(t285))))
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 36 bytes per marking, with 26 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: 20 markings, 19 edges
lola: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (NOT(A (X ((FIREABLE(t274) AND FIREABLE(t92)))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(E(TRUE U NOT(EX((NOT FIREABLE(t274) OR NOT FIREABLE(t92))))))
lola: processed formula length: 66
lola: 5 rewrites
lola: formula mentions 0 of 268 places; total mentions: 0
lola: closed formula file FlexibleBarrier-PT-04b-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 36 bytes per marking, with 26 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: 523 markings, 776 edges
lola: ========================================
lola: subprocess 3 will run for 271 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (FIREABLE(t191)))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 36 bytes per marking, with 26 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 21 markings, 20 edges
lola: ========================================
lola: subprocess 4 will run for 294 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (NOT FIREABLE(t282) AND E (F (FIREABLE(t266))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 4 will run for 294 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT FIREABLE(t282)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: NOT FIREABLE(t282)
lola: processed formula length: 18
lola: 0 rewrites
lola: formula mentions 0 of 268 places; total mentions: 0
lola: closed formula file FlexibleBarrier-PT-04b-CTLFireability.task
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 5 will run for 321 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (FIREABLE(t266)))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 36 bytes per marking, with 26 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 36 markings, 35 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 5 will run for 321 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT(A (F (E (F ((FIREABLE(t239) OR FIREABLE(t251)))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U E(TRUE U (FIREABLE(t239) OR FIREABLE(t251)))))
lola: processed formula length: 60
lola: 9 rewrites
lola: formula mentions 0 of 268 places; total mentions: 0
lola: closed formula file FlexibleBarrier-PT-04b-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 36 bytes per marking, with 26 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: 309 markings, 340 edges
lola: ========================================
lola: subprocess 6 will run for 353 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (E (((FIREABLE(t186) OR FIREABLE(t157)) U (FIREABLE(t31) OR FIREABLE(t35))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(TRUE U E((FIREABLE(t186) OR FIREABLE(t157)) U (FIREABLE(t31) OR FIREABLE(t35))))
lola: processed formula length: 84
lola: 2 rewrites
lola: formula mentions 0 of 268 places; total mentions: 0
lola: closed formula file FlexibleBarrier-PT-04b-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 36 bytes per marking, with 26 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: 90116 markings, 153908 edges
lola: ========================================
lola: subprocess 7 will run for 392 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (E ((A (G (FIREABLE(t234))) U A (X (FIREABLE(t250))))) OR (NOT(NOT(E (F (FIREABLE(t301))))) OR E (G (FIREABLE(t219)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 7 will run for 392 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E ((A (G (FIREABLE(t234))) U A (X (FIREABLE(t250)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(NOT(E(TRUE U NOT FIREABLE(t234))) U AX(FIREABLE(t250)))
lola: processed formula length: 57
lola: 10 rewrites
lola: formula mentions 0 of 268 places; total mentions: 0
lola: closed formula file FlexibleBarrier-PT-04b-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 36 bytes per marking, with 26 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 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: 1 markings, 1 edges
lola: ========================================
lola: subprocess 8 will run for 441 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (FIREABLE(t301)))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 36 bytes per marking, with 26 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 12 markings, 11 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 8 will run for 441 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(t98) AND (((FIREABLE(t41) AND FIREABLE(t134)) OR (FIREABLE(t52) AND FIREABLE(t155))) AND E (F (FIREABLE(t274)))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(TRUE U (FIREABLE(t98) AND (((FIREABLE(t41) AND FIREABLE(t134)) OR (FIREABLE(t52) AND FIREABLE(t155))) AND E(TRUE U FIREABLE(t274)))))
lola: processed formula length: 136
lola: 2 rewrites
lola: formula mentions 0 of 268 places; total mentions: 0
lola: closed formula file FlexibleBarrier-PT-04b-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 36 bytes per marking, with 26 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: 1417889 markings, 2836606 edges, 283570 markings/sec, 0 secs
lola: 2585419 markings, 5523821 edges, 233506 markings/sec, 5 secs
lola: 3766617 markings, 8237769 edges, 236240 markings/sec, 10 secs
lola: 4900192 markings, 10797889 edges, 226715 markings/sec, 15 secs
lola: 5911078 markings, 13403628 edges, 202177 markings/sec, 20 secs
lola: 6815779 markings, 15867711 edges, 180940 markings/sec, 25 secs
lola: 7753815 markings, 18197875 edges, 187607 markings/sec, 30 secs
lola: 8743314 markings, 20759951 edges, 197900 markings/sec, 35 secs
lola: 9718398 markings, 23334861 edges, 195017 markings/sec, 40 secs
lola: 10673829 markings, 25738397 edges, 191086 markings/sec, 45 secs
lola: 11532204 markings, 28139358 edges, 171675 markings/sec, 50 secs
lola: 12346802 markings, 30574354 edges, 162920 markings/sec, 55 secs
lola: 13105756 markings, 32607811 edges, 151791 markings/sec, 60 secs
lola: 13984354 markings, 35025827 edges, 175720 markings/sec, 65 secs
lola: 14845526 markings, 37396697 edges, 172234 markings/sec, 70 secs
lola: 15600227 markings, 39523445 edges, 150940 markings/sec, 75 secs
lola: 16404790 markings, 41716113 edges, 160913 markings/sec, 80 secs
lola: 17279161 markings, 44209522 edges, 174874 markings/sec, 85 secs
lola: 18124235 markings, 46521860 edges, 169015 markings/sec, 90 secs
lola: 18980126 markings, 48726323 edges, 171178 markings/sec, 95 secs
lola: 19761628 markings, 51024197 edges, 156300 markings/sec, 100 secs
lola: 20514566 markings, 53176957 edges, 150588 markings/sec, 105 secs
lola: 21330967 markings, 55583801 edges, 163280 markings/sec, 110 secs
lola: 21973818 markings, 57400756 edges, 128570 markings/sec, 115 secs
lola: 22760745 markings, 59668220 edges, 157385 markings/sec, 120 secs
lola: 23479566 markings, 61669090 edges, 143764 markings/sec, 125 secs
lola: 24163380 markings, 63731369 edges, 136763 markings/sec, 130 secs
lola: 24856338 markings, 66097884 edges, 138592 markings/sec, 135 secs
lola: 25936862 markings, 68397818 edges, 216105 markings/sec, 140 secs
lola: 26906385 markings, 70700186 edges, 193905 markings/sec, 145 secs
lola: 27669769 markings, 72603104 edges, 152677 markings/sec, 150 secs
lola: 28401833 markings, 74476207 edges, 146413 markings/sec, 155 secs
lola: 29098134 markings, 76319828 edges, 139260 markings/sec, 160 secs
lola: 29985752 markings, 78201539 edges, 177524 markings/sec, 165 secs
lola: 30660352 markings, 80079870 edges, 134920 markings/sec, 170 secs
lola: 31016934 markings, 81708274 edges, 71316 markings/sec, 175 secs
lola: 31791357 markings, 83776032 edges, 154885 markings/sec, 180 secs
lola: 32611173 markings, 85901927 edges, 163963 markings/sec, 185 secs
lola: 33393178 markings, 87939984 edges, 156401 markings/sec, 190 secs
lola: 34184851 markings, 90041388 edges, 158335 markings/sec, 195 secs
lola: 34882220 markings, 91896227 edges, 139474 markings/sec, 200 secs
lola: 35603784 markings, 93851562 edges, 144313 markings/sec, 205 secs
lola: 36189632 markings, 95419490 edges, 117170 markings/sec, 210 secs
lola: 36840754 markings, 97238156 edges, 130224 markings/sec, 215 secs
lola: 37512253 markings, 99135451 edges, 134300 markings/sec, 220 secs
lola: 38207918 markings, 101109763 edges, 139133 markings/sec, 225 secs
lola: 38881856 markings, 103030104 edges, 134788 markings/sec, 230 secs
lola: 39543790 markings, 104861516 edges, 132387 markings/sec, 235 secs
lola: 40203476 markings, 106692294 edges, 131937 markings/sec, 240 secs
lola: 40741818 markings, 108215678 edges, 107668 markings/sec, 245 secs
lola: 41398219 markings, 110047093 edges, 131280 markings/sec, 250 secs
lola: 42074970 markings, 111958476 edges, 135350 markings/sec, 255 secs
lola: 42704301 markings, 113777851 edges, 125866 markings/sec, 260 secs
lola: 43380816 markings, 115712842 edges, 135303 markings/sec, 265 secs
lola: 44031208 markings, 117602505 edges, 130078 markings/sec, 270 secs
lola: 44735471 markings, 119623660 edges, 140853 markings/sec, 275 secs
lola: 45387202 markings, 121574137 edges, 130346 markings/sec, 280 secs
lola: 46026703 markings, 123486238 edges, 127900 markings/sec, 285 secs
lola: 46696243 markings, 125451889 edges, 133908 markings/sec, 290 secs
lola: 47275044 markings, 127207110 edges, 115760 markings/sec, 295 secs
lola: 47852239 markings, 128939736 edges, 115439 markings/sec, 300 secs
lola: 48409420 markings, 130604098 edges, 111436 markings/sec, 305 secs
lola: 48989934 markings, 132357949 edges, 116103 markings/sec, 310 secs
lola: 49664651 markings, 134362715 edges, 134943 markings/sec, 315 secs
lola: 50289090 markings, 136196896 edges, 124888 markings/sec, 320 secs
lola: 50941498 markings, 138317727 edges, 130482 markings/sec, 325 secs
lola: 51644107 markings, 140465813 edges, 140522 markings/sec, 330 secs
lola: 52275958 markings, 142401252 edges, 126370 markings/sec, 335 secs
lola: 52733249 markings, 143854265 edges, 91458 markings/sec, 340 secs
lola: 53374013 markings, 145854242 edges, 128153 markings/sec, 345 secs
lola: 53924229 markings, 147701795 edges, 110043 markings/sec, 350 secs
lola: 54422831 markings, 149278151 edges, 99720 markings/sec, 355 secs
lola: 55018657 markings, 151135090 edges, 119165 markings/sec, 360 secs
lola: 55568697 markings, 153006332 edges, 110008 markings/sec, 365 secs
lola: 56200751 markings, 155136737 edges, 126411 markings/sec, 370 secs
lola: 56825878 markings, 157153570 edges, 125025 markings/sec, 375 secs
lola: 57492324 markings, 159328622 edges, 133289 markings/sec, 380 secs
lola: 58081567 markings, 161267927 edges, 117849 markings/sec, 385 secs
lola: 58668251 markings, 163174206 edges, 117337 markings/sec, 390 secs
lola: 59293608 markings, 165145582 edges, 125071 markings/sec, 395 secs
lola: 59887719 markings, 167107258 edges, 118822 markings/sec, 400 secs
lola: 60446057 markings, 168929750 edges, 111668 markings/sec, 405 secs
lola: 61000750 markings, 170844837 edges, 110939 markings/sec, 410 secs
lola: 61593246 markings, 172850011 edges, 118499 markings/sec, 415 secs
lola: 62020398 markings, 174347933 edges, 85430 markings/sec, 420 secs
lola: 62456640 markings, 175923459 edges, 87248 markings/sec, 425 secs
lola: 63050524 markings, 177813531 edges, 118777 markings/sec, 430 secs
lola: 63709429 markings, 180018665 edges, 131781 markings/sec, 435 secs
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 9 will run for 441 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((E ((FIREABLE(t95) U FIREABLE(t271))) OR FIREABLE(t173))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 9 will run for 441 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (E ((FIREABLE(t95) U FIREABLE(t271)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(TRUE U E(FIREABLE(t95) U FIREABLE(t271)))
lola: processed formula length: 43
lola: 3 rewrites
lola: formula mentions 0 of 268 places; total mentions: 0
lola: closed formula file FlexibleBarrier-PT-04b-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 36 bytes per marking, with 26 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: 11926 markings, 31862 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 10 will run for 515 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G (E (F (A (G (FIREABLE(t103)))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U NOT(E(TRUE U NOT(E(TRUE U NOT FIREABLE(t103)))))))
lola: processed formula length: 63
lola: 4 rewrites
lola: formula mentions 0 of 268 places; total mentions: 0
lola: closed formula file FlexibleBarrier-PT-04b-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 36 bytes per marking, with 26 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 3 significant temporal operators and needs 13 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: 1122309 markings, 3576227 edges, 224454 markings/sec, 0 secs
lola: 2110646 markings, 6930626 edges, 197667 markings/sec, 5 secs
lola: 3042113 markings, 10258537 edges, 186293 markings/sec, 10 secs
lola: 3945828 markings, 13393854 edges, 180743 markings/sec, 15 secs
lola: 4797198 markings, 16464826 edges, 170274 markings/sec, 20 secs
lola: 5580267 markings, 19524638 edges, 156614 markings/sec, 25 secs
lola: 6410211 markings, 22651872 edges, 165989 markings/sec, 30 secs
lola: 7282368 markings, 25798239 edges, 174431 markings/sec, 35 secs
lola: 8164915 markings, 28974942 edges, 176509 markings/sec, 40 secs
lola: 9049443 markings, 32271458 edges, 176906 markings/sec, 45 secs
lola: 9824409 markings, 35356569 edges, 154993 markings/sec, 50 secs
lola: 10640793 markings, 38344954 edges, 163277 markings/sec, 55 secs
lola: 11384031 markings, 41247817 edges, 148648 markings/sec, 60 secs
lola: 12194533 markings, 44306826 edges, 162100 markings/sec, 65 secs
lola: 12970851 markings, 47274413 edges, 155264 markings/sec, 70 secs
lola: 13513695 markings, 49505311 edges, 108569 markings/sec, 75 secs
lola: 14252668 markings, 52456763 edges, 147795 markings/sec, 80 secs
lola: 15022286 markings, 55308134 edges, 153924 markings/sec, 85 secs
lola: 15817109 markings, 58209984 edges, 158965 markings/sec, 90 secs
lola: 16532205 markings, 61049704 edges, 143019 markings/sec, 95 secs
lola: 17213332 markings, 63676394 edges, 136225 markings/sec, 100 secs
lola: 17693334 markings, 65737179 edges, 96000 markings/sec, 105 secs
lola: 18385743 markings, 68446244 edges, 138482 markings/sec, 110 secs
lola: 19055781 markings, 71292082 edges, 134008 markings/sec, 115 secs
lola: 19769116 markings, 74250257 edges, 142667 markings/sec, 120 secs
lola: 20472534 markings, 77163399 edges, 140684 markings/sec, 125 secs
lola: 21140151 markings, 79976653 edges, 133523 markings/sec, 130 secs
lola: 21710669 markings, 82743626 edges, 114104 markings/sec, 135 secs
lola: 22339726 markings, 85403199 edges, 125811 markings/sec, 140 secs
lola: 22851586 markings, 87697346 edges, 102372 markings/sec, 145 secs
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 23134500 markings, 89552594 edges
lola: ========================================
lola: subprocess 11 will run for 587 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((NOT FIREABLE(t27) AND ((FIREABLE(t157) AND FIREABLE(t245)) OR NOT FIREABLE(t269)) AND (FIREABLE(t272) OR FIREABLE(t41) OR FIREABLE(t211)) AND (NOT FIREABLE(t233) OR NOT FIREABLE(t264)))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 36 bytes per marking, with 26 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 22 markings, 21 edges
lola: ========================================
lola: subprocess 12 will run for 734 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (A (F (((NOT FIREABLE(t30) AND NOT FIREABLE(t17)) AND A (G (FIREABLE(t143)))))) OR E (G (A (G (NOT FIREABLE(t210))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 12 will run for 734 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (((NOT FIREABLE(t30) AND NOT FIREABLE(t17)) AND A (G (FIREABLE(t143))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F (((NOT FIREABLE(t30) AND NOT FIREABLE(t17)) AND A (G (FIREABLE(t143))))))
lola: processed formula: A (F (((NOT FIREABLE(t30) AND NOT FIREABLE(t17)) AND A (G (FIREABLE(t143))))))
lola: processed formula length: 78
lola: 0 rewrites
lola: formula mentions 0 of 268 places; total mentions: 0
lola: closed formula file FlexibleBarrier-PT-04b-CTLFireability.task
lola: the resulting B\xfcchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 36 bytes per marking, with 24 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: 40 markings, 40 edges
lola: ========================================
lola: subprocess 13 will run for 979 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G (A (G (NOT FIREABLE(t210)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U E(TRUE U FIREABLE(t210))))
lola: processed formula length: 39
lola: 4 rewrites
lola: formula mentions 0 of 268 places; total mentions: 0
lola: closed formula file FlexibleBarrier-PT-04b-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 36 bytes per marking, with 26 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: 66077 markings, 138152 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 13 will run for 979 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((NOT FIREABLE(t304) AND FIREABLE(t8) AND ((NOT FIREABLE(t9) AND NOT FIREABLE(t150)) OR FIREABLE(t78)))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 36 bytes per marking, with 26 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 23 markings, 22 edges
lola: ========================================
lola: subprocess 14 will run for 1469 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (FIREABLE(t70) OR NOT(A (G ((NOT FIREABLE(t148) OR NOT FIREABLE(t230))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 14 will run for 1469 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: FIREABLE(t70)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FIREABLE(t70)
lola: processed formula length: 13
lola: 3 rewrites
lola: formula mentions 0 of 268 places; total mentions: 0
lola: closed formula file FlexibleBarrier-PT-04b-CTLFireability.task
lola: processed formula with 0 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 15 will run for 2938 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(t148) AND FIREABLE(t230))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 36 bytes per marking, with 26 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 24 markings, 23 edges
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: ========================================
lola: subprocess 15 will run for 2938 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (E (G (FIREABLE(t173))) OR E ((NOT FIREABLE(t124) U FIREABLE(t191))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 15 will run for 2938 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G (FIREABLE(t173)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U NOT FIREABLE(t173)))
lola: processed formula length: 33
lola: 2 rewrites
lola: formula mentions 0 of 268 places; total mentions: 0
lola: closed formula file FlexibleBarrier-PT-04b-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 36 bytes per marking, with 26 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: Child process aborted or communication problem between parent and child process
lola: SUBRESULT
lola: result: unknown
lola: The Boolean predicate may be true or false.
lola: ========================================
lola: RESULT
lola:
SUMMARY: yes no no yes yes no yes yes unknown yes no yes no yes yes unknown
FORMULA FlexibleBarrier-PT-04b-CTLFireability-0 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA FlexibleBarrier-PT-04b-CTLFireability-1 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA FlexibleBarrier-PT-04b-CTLFireability-2 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA FlexibleBarrier-PT-04b-CTLFireability-3 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA FlexibleBarrier-PT-04b-CTLFireability-4 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA FlexibleBarrier-PT-04b-CTLFireability-5 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA FlexibleBarrier-PT-04b-CTLFireability-6 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA FlexibleBarrier-PT-04b-CTLFireability-7 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA FlexibleBarrier-PT-04b-CTLFireability-8 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA FlexibleBarrier-PT-04b-CTLFireability-9 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA FlexibleBarrier-PT-04b-CTLFireability-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA FlexibleBarrier-PT-04b-CTLFireability-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA FlexibleBarrier-PT-04b-CTLFireability-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA FlexibleBarrier-PT-04b-CTLFireability-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA FlexibleBarrier-PT-04b-CTLFireability-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA FlexibleBarrier-PT-04b-CTLFireability-15 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stdout -----
----- Kill lola and sara stderr -----
----- Finished stderr -----
----- Finished stdout -----

Sequence of Actions to be Executed by the VM

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

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