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 236K
-rw-r--r-- 1 mcc users 3.5K 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.2K 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.1K May 15 18:50 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 2.3K May 15 18:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 11K May 15 18:54 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.7K May 15 18:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 8.3K May 15 18:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 2.8K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 14K May 15 18:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 101 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 339 May 15 18:54 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 2.3K 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.5K May 15 18:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.5K May 15 18:54 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 15 18:50 equiv_col
-rw-r--r-- 1 mcc users 4 May 15 18:50 instance
-rw-r--r-- 1 mcc users 6 May 15 18:50 iscolored
-rw-r--r-- 1 mcc users 79K May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool irma4mcc-structural
Input is DES-PT-10b, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r055-smll-152646382900221
=====================================================================

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME DES-PT-10b-CTLFireability-00
FORMULA_NAME DES-PT-10b-CTLFireability-01
FORMULA_NAME DES-PT-10b-CTLFireability-02
FORMULA_NAME DES-PT-10b-CTLFireability-03
FORMULA_NAME DES-PT-10b-CTLFireability-04
FORMULA_NAME DES-PT-10b-CTLFireability-05
FORMULA_NAME DES-PT-10b-CTLFireability-06
FORMULA_NAME DES-PT-10b-CTLFireability-07
FORMULA_NAME DES-PT-10b-CTLFireability-08
FORMULA_NAME DES-PT-10b-CTLFireability-09
FORMULA_NAME DES-PT-10b-CTLFireability-10
FORMULA_NAME DES-PT-10b-CTLFireability-11
FORMULA_NAME DES-PT-10b-CTLFireability-12
FORMULA_NAME DES-PT-10b-CTLFireability-13
FORMULA_NAME DES-PT-10b-CTLFireability-14
FORMULA_NAME DES-PT-10b-CTLFireability-15

=== Now, execution of the tool begins

BK_START 1526498174626


BK_STOP 1526498958490

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

Prefix is 75f5f979.
Reading known information in /usr/share/mcc4mcc/75f5f979-known.json.
Reading learned information in /usr/share/mcc4mcc/75f5f979-learned.json.
Reading value translations in /usr/share/mcc4mcc/75f5f979-values.json.
Using directory /home/mcc/execution for input, as it contains a model.pnml file.
Using DES-PT-10b as instance name.
Using DES as model name.
Using algorithm or tool bmdt.
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': None, 'Source Transition': False, 'Sink Transition': None, 'Loop Free': None, 'Conservative': False, 'Sub-Conservative': False, 'Nested Units': True, 'Safe': True, 'Deadlock': None, 'Reversible': None, 'Quasi Live': None, 'Live': None}.
Known tools are: [{'Time': 856826, 'Memory': 3545.33, 'Tool': 'lola'}, {'Time': 857058, 'Memory': 3506.48, 'Tool': 'lola'}].
Learned tools are: [{'Tool': 'lola'}].
Learned tool lola is 1.0x far from the best tool lola.
CTLFireability lola DES-PT-10b...
----- Start make prepare stderr -----

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


checking for too many tokens
===========================================================================================
DES-PT-10b: translating PT formula CTLFireability into LoLA format
===========================================================================================
translating formula complete
touch formulae;
----- Start make result stdout -----
----- Start make result stderr -----
CTLFireability @ DES-PT-10b @ 3540 seconds
Makefile:222: recipe for target 'verify' failed
make: [verify] Error 134 (ignored)
----- Start make result stderr -----
----- Start make result stdout -----
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: 591/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: finding significant places
lola: 320 places, 271 transitions, 255 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 368 transition conflict sets
lola: TASK
lola: reading formula from DES-PT-10b-CTLFireability.task
lola: ((((A (X (FIREABLE(t241))) AND A (X (FIREABLE(t4)))) AND (NOT FIREABLE(t151) OR NOT FIREABLE(t174) OR (FIREABLE(t203) AND FIREABLE(t156) AND (FIREABLE(t94) OR FIREABLE(t147))))) AND FIREABLE(t70)) OR E (F (((NOT FIREABLE(t264) OR NOT FIREABLE(t88)) AND A (F (FIREABLE(t222))))))) : E (X (A (F (E (G (FIREABLE(t113))))))) : (E (G ((FIREABLE(t240) OR NOT FIREABLE(t245)))) OR E (G (A (X (NOT FIREABLE(t260)))))) : ((FIREABLE(t251) OR E ((FIREABLE(t158) U (FIREABLE(t235) OR FIREABLE(t60))))) OR E (F ((FIREABLE(t268) AND FIREABLE(t40))))) : E (G (NOT((E (X (FIREABLE(t196))) AND (FIREABLE(t162) AND (FIREABLE(t75) OR FIREABLE(t34))))))) : A (F (FIREABLE(t42))) : NOT(E ((A (X (FIREABLE(t23))) U E (F (FIREABLE(t62)))))) : E (F (((FIREABLE(t269) AND FIREABLE(t156)) OR FIREABLE(t232)))) : A (F (FIREABLE(t74))) : E (F (E (F (((FIREABLE(t49) OR FIREABLE(t90)) AND (FIREABLE(t130) OR FIREABLE(t259))))))) : A (((FIREABLE(t94) OR FIREABLE(t66) OR NOT FIREABLE(t25) OR FIREABLE(t84)) U FIREABLE(t40))) : A (X ((NOT(A (G (FIREABLE(t63)))) AND ((NOT FIREABLE(t61) AND NOT FIREABLE(t106)) AND E (F (FIREABLE(t182))))))) : E (F (FIREABLE(t98))) : E (F (E (G (FIREABLE(t204))))) : (NOT(((A (F (FIREABLE(t206))) OR ((FIREABLE(t23) OR FIREABLE(t110)) AND FIREABLE(t88))) OR A (G (FIREABLE(t75))))) AND A (F ((FIREABLE(t123) OR FIREABLE(t86))))) : NOT(NOT(A (F (E (X (FIREABLE(t22)))))))
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 (X (FIREABLE(t241))) AND A (X (FIREABLE(t4)))) AND (NOT FIREABLE(t151) OR NOT FIREABLE(t174) OR (FIREABLE(t203) AND FIREABLE(t156) AND (FIREABLE(t94) OR FIREABLE(t147))))) AND FIREABLE(t70)) OR E (F (((NOT FIREABLE(t264) OR NOT FIREABLE(t88)) AND A (F (FIREABLE(t222)))))))
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: A (X (FIREABLE(t241)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (X (FIREABLE(t241)))
lola: processed formula: A (X (FIREABLE(t241)))
lola: processed formula length: 22
lola: 3 rewrites
lola: formula mentions 0 of 320 places; total mentions: 0
lola: closed formula file DES-PT-10b-CTLFireability.task
lola: the resulting B\xfcchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 36 bytes per marking, with 31 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: 85 markings, 85 edges
lola: ========================================
lola: subprocess 1 will run for 236 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((NOT FIREABLE(t264) OR NOT FIREABLE(t88)) AND A (F (FIREABLE(t222))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(TRUE U ((NOT FIREABLE(t264) OR NOT FIREABLE(t88)) AND A(TRUE U FIREABLE(t222))))
lola: processed formula length: 83
lola: 5 rewrites
lola: formula mentions 0 of 320 places; total mentions: 0
lola: closed formula file DES-PT-10b-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 32 bytes per marking, with 1 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: 557863 markings, 3269566 edges, 2011131286894149632 markings/sec, 0 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 579030 markings, 3406466 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: E (X (A (F (E (G (FIREABLE(t113)))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: EX(A(TRUE U NOT(A(TRUE U NOT FIREABLE(t113)))))
lola: processed formula length: 47
lola: 4 rewrites
lola: formula mentions 0 of 320 places; total mentions: 0
lola: closed formula file DES-PT-10b-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 32 bytes per marking, with 1 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: 84 markings, 167 edges
lola: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (E (G ((FIREABLE(t240) OR NOT FIREABLE(t245)))) OR E (G (A (X (NOT FIREABLE(t260))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G ((FIREABLE(t240) OR NOT FIREABLE(t245))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U (NOT FIREABLE(t240) AND FIREABLE(t245))))
lola: processed formula length: 54
lola: 2 rewrites
lola: formula mentions 0 of 320 places; total mentions: 0
lola: closed formula file DES-PT-10b-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 32 bytes per marking, with 1 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 85 markings, 84 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 3 will run for 271 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((FIREABLE(t251) OR E ((FIREABLE(t158) U (FIREABLE(t235) OR FIREABLE(t60))))) OR E (F ((FIREABLE(t268) AND FIREABLE(t40)))))
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: FIREABLE(t251)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FIREABLE(t251)
lola: processed formula length: 14
lola: 1 rewrites
lola: formula mentions 0 of 320 places; total mentions: 0
lola: closed formula file DES-PT-10b-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 4 will run for 294 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E ((FIREABLE(t158) U (FIREABLE(t235) OR FIREABLE(t60))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(FIREABLE(t158) U (FIREABLE(t235) OR FIREABLE(t60)))
lola: processed formula length: 54
lola: 2 rewrites
lola: formula mentions 0 of 320 places; total mentions: 0
lola: closed formula file DES-PT-10b-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 32 bytes per marking, with 1 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 5 will run for 321 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(t268) AND FIREABLE(t40))))
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 32 bytes per marking, with 1 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: 48 markings, 47 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 4 will run for 294 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G (NOT((E (X (FIREABLE(t196))) AND (FIREABLE(t162) AND (FIREABLE(t75) OR FIREABLE(t34)))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U (NOT(AX(NOT FIREABLE(t196))) AND (FIREABLE(t162) AND (FIREABLE(t75) OR FIREABLE(t34))))))
lola: processed formula length: 103
lola: 9 rewrites
lola: formula mentions 0 of 320 places; total mentions: 0
lola: closed formula file DES-PT-10b-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 32 bytes per marking, with 1 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: 85 markings, 84 edges
lola: ========================================
lola: subprocess 5 will run for 321 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (FIREABLE(t42)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F (FIREABLE(t42)))
lola: processed formula: A (F (FIREABLE(t42)))
lola: processed formula length: 21
lola: 0 rewrites
lola: formula mentions 0 of 320 places; total mentions: 0
lola: closed formula file DES-PT-10b-CTLFireability.task
lola: the resulting B\xfcchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 32 bytes per marking, with 0 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: 920131 markings, 1054128 edges
lola: ========================================
lola: subprocess 6 will run for 353 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT(E ((A (X (FIREABLE(t23))) U E (F (FIREABLE(t62))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(E(NOT(EX(NOT FIREABLE(t23))) U E(TRUE U FIREABLE(t62))))
lola: processed formula length: 60
lola: 13 rewrites
lola: formula mentions 0 of 320 places; total mentions: 0
lola: closed formula file DES-PT-10b-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 32 bytes per marking, with 1 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: 73 markings, 73 edges
lola: ========================================
lola: subprocess 7 will run for 392 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((FIREABLE(t269) AND FIREABLE(t156)) OR FIREABLE(t232))))
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 32 bytes per marking, with 1 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: subprocess 8 will run for 441 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (FIREABLE(t74)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F (FIREABLE(t74)))
lola: processed formula: A (F (FIREABLE(t74)))
lola: processed formula length: 21
lola: 0 rewrites
lola: formula mentions 0 of 320 places; total mentions: 0
lola: closed formula file DES-PT-10b-CTLFireability.task
lola: the resulting B\xfcchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 32 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method (--stubborn)
lola: SEARCH
lola: RUNNING
lola: 1879815 markings, 2126925 edges, 375963 markings/sec, 0 secs
lola: 3739730 markings, 4342011 edges, 371983 markings/sec, 5 secs
lola: 5748467 markings, 6568811 edges, 401747 markings/sec, 10 secs
lola: 7415985 markings, 8401496 edges, 333504 markings/sec, 15 secs
lola: 9193170 markings, 10491035 edges, 355437 markings/sec, 20 secs
lola: 11091320 markings, 12598063 edges, 379630 markings/sec, 25 secs
lola: 12867619 markings, 14597570 edges, 355260 markings/sec, 30 secs
lola: 14586765 markings, 16504074 edges, 343829 markings/sec, 35 secs
lola: 16314880 markings, 18444630 edges, 345623 markings/sec, 40 secs
lola: 18099364 markings, 20484673 edges, 356897 markings/sec, 45 secs
lola: 20013749 markings, 22601711 edges, 382877 markings/sec, 50 secs
lola: 22173307 markings, 24902449 edges, 431912 markings/sec, 55 secs
lola: 24187846 markings, 27077859 edges, 402908 markings/sec, 60 secs
lola: 26267843 markings, 29255924 edges, 415999 markings/sec, 65 secs
lola: 28074166 markings, 31300949 edges, 361265 markings/sec, 70 secs
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: 28591471 markings, 31918934 edges
lola: ========================================
lola: subprocess 9 will run for 493 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (E (F (((FIREABLE(t49) OR FIREABLE(t90)) AND (FIREABLE(t130) OR FIREABLE(t259)))))))
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 32 bytes per marking, with 1 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: 47 markings, 46 edges
lola: ========================================
lola: subprocess 10 will run for 576 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (((FIREABLE(t94) OR FIREABLE(t66) OR NOT FIREABLE(t25) OR FIREABLE(t84)) U FIREABLE(t40)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (((FIREABLE(t94) OR FIREABLE(t66) OR NOT FIREABLE(t25) OR FIREABLE(t84)) U FIREABLE(t40)))
lola: processed formula: A (((FIREABLE(t94) OR FIREABLE(t66) OR NOT FIREABLE(t25) OR FIREABLE(t84)) U FIREABLE(t40)))
lola: processed formula length: 95
lola: 0 rewrites
lola: formula mentions 0 of 320 places; total mentions: 0
lola: closed formula file DES-PT-10b-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 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: 1325166 markings, 1560460 edges
lola: ========================================
lola: subprocess 11 will run for 690 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X ((NOT(A (G (FIREABLE(t63)))) AND ((NOT FIREABLE(t61) AND NOT FIREABLE(t106)) AND E (F (FIREABLE(t182)))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 11 will run for 690 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (E (F (NOT FIREABLE(t63)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: AX(E(TRUE U NOT FIREABLE(t63)))
lola: processed formula length: 31
lola: 7 rewrites
lola: formula mentions 0 of 320 places; total mentions: 0
lola: closed formula file DES-PT-10b-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 32 bytes per marking, with 1 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: 1 markings, 0 edges
lola: ========================================
lola: subprocess 12 will run for 862 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X ((NOT FIREABLE(t61) AND NOT FIREABLE(t106))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (X ((NOT FIREABLE(t61) AND NOT FIREABLE(t106))))
lola: processed formula: A (X ((NOT FIREABLE(t61) AND NOT FIREABLE(t106))))
lola: processed formula length: 50
lola: 5 rewrites
lola: formula mentions 0 of 320 places; total mentions: 0
lola: closed formula file DES-PT-10b-CTLFireability.task
lola: the resulting B\xfcchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 36 bytes per marking, with 31 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 13 will run for 1150 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (E (F (FIREABLE(t182)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: AX(E(TRUE U FIREABLE(t182)))
lola: processed formula length: 28
lola: 7 rewrites
lola: formula mentions 0 of 320 places; total mentions: 0
lola: closed formula file DES-PT-10b-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 32 bytes per marking, with 1 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: 656871 markings, 3600979 edges, 131374 markings/sec, 0 secs
lola: 1271160 markings, 7518462 edges, 122858 markings/sec, 5 secs
lola: 1878078 markings, 11477682 edges, 121384 markings/sec, 10 secs
lola: 2491237 markings, 15242036 edges, 122632 markings/sec, 15 secs
lola: 3039311 markings, 18980770 edges, 109615 markings/sec, 20 secs
lola: 3676856 markings, 22939382 edges, 127509 markings/sec, 25 secs
lola: 4256695 markings, 26906432 edges, 115968 markings/sec, 30 secs
lola: 4767679 markings, 30744001 edges, 102197 markings/sec, 35 secs
lola: 5390118 markings, 34516062 edges, 124488 markings/sec, 40 secs
lola: 5970491 markings, 38397792 edges, 116075 markings/sec, 45 secs
lola: 6531200 markings, 42014491 edges, 112142 markings/sec, 50 secs
lola: 7097494 markings, 45738162 edges, 113259 markings/sec, 55 secs
lola: 7665229 markings, 49629909 edges, 113547 markings/sec, 60 secs
lola: 8199259 markings, 53322667 edges, 106806 markings/sec, 65 secs
lola: 8788111 markings, 57083742 edges, 117770 markings/sec, 70 secs
lola: 9358221 markings, 60856926 edges, 114022 markings/sec, 75 secs
lola: 9900794 markings, 64415780 edges, 108515 markings/sec, 80 secs
lola: 10457305 markings, 68015919 edges, 111302 markings/sec, 85 secs
lola: 10968299 markings, 71628806 edges, 102199 markings/sec, 90 secs
lola: 11398951 markings, 75232921 edges, 86130 markings/sec, 95 secs
lola: 11799509 markings, 78857442 edges, 80112 markings/sec, 100 secs
lola: 12187812 markings, 82313227 edges, 77661 markings/sec, 105 secs
lola: 12602077 markings, 86011229 edges, 82853 markings/sec, 110 secs
lola: 13017042 markings, 89635753 edges, 82993 markings/sec, 115 secs
lola: 13596421 markings, 92894104 edges, 115876 markings/sec, 120 secs
lola: 14167149 markings, 96596975 edges, 114146 markings/sec, 125 secs
lola: 14746786 markings, 100362535 edges, 115927 markings/sec, 130 secs
lola: 15327196 markings, 103936249 edges, 116082 markings/sec, 135 secs
lola: 15850192 markings, 107463694 edges, 104599 markings/sec, 140 secs
lola: 16403044 markings, 110973995 edges, 110570 markings/sec, 145 secs
lola: 16945296 markings, 114550741 edges, 108450 markings/sec, 150 secs
lola: 17451911 markings, 118229448 edges, 101323 markings/sec, 155 secs
lola: 18010087 markings, 121789798 edges, 111635 markings/sec, 160 secs
lola: 18564639 markings, 125435952 edges, 110910 markings/sec, 165 secs
lola: 19116351 markings, 129035008 edges, 110342 markings/sec, 170 secs
lola: 19629087 markings, 132487609 edges, 102547 markings/sec, 175 secs
lola: 20173770 markings, 136006189 edges, 108937 markings/sec, 180 secs
lola: 20674557 markings, 139623235 edges, 100157 markings/sec, 185 secs
lola: 21226991 markings, 143140316 edges, 110487 markings/sec, 190 secs
lola: 21774654 markings, 146738358 edges, 109533 markings/sec, 195 secs
lola: 22319446 markings, 150303749 edges, 108958 markings/sec, 200 secs
lola: 22832027 markings, 153740705 edges, 102516 markings/sec, 205 secs
lola: 23393259 markings, 157374642 edges, 112246 markings/sec, 210 secs
lola: 23900006 markings, 161045584 edges, 101349 markings/sec, 215 secs
lola: 24302457 markings, 164427709 edges, 80490 markings/sec, 220 secs
lola: 24668473 markings, 167735951 edges, 73203 markings/sec, 225 secs
lola: 25048691 markings, 171117539 edges, 76044 markings/sec, 230 secs
lola: 25453662 markings, 174728978 edges, 80994 markings/sec, 235 secs
lola: 25844152 markings, 178297119 edges, 78098 markings/sec, 240 secs
lola: 26479167 markings, 181862645 edges, 127003 markings/sec, 245 secs
lola: 27048440 markings, 185569171 edges, 113855 markings/sec, 250 secs
lola: 27628816 markings, 189337206 edges, 116075 markings/sec, 255 secs
lola: 28213635 markings, 192930774 edges, 116964 markings/sec, 260 secs
lola: 28742381 markings, 196512922 edges, 105749 markings/sec, 265 secs
lola: 29303129 markings, 200040083 edges, 112150 markings/sec, 270 secs
lola: 29870701 markings, 203822970 edges, 113514 markings/sec, 275 secs
lola: 30369922 markings, 207551465 edges, 99844 markings/sec, 280 secs
lola: 30957719 markings, 211141063 edges, 117559 markings/sec, 285 secs
lola: 31515054 markings, 214868987 edges, 111467 markings/sec, 290 secs
lola: 32036612 markings, 218228155 edges, 104312 markings/sec, 295 secs
lola: 32551197 markings, 221747253 edges, 102917 markings/sec, 300 secs
lola: 33132748 markings, 225520508 edges, 116310 markings/sec, 305 secs
lola: 33625926 markings, 229235975 edges, 98636 markings/sec, 310 secs
lola: 34218854 markings, 232790104 edges, 118586 markings/sec, 315 secs
lola: 34763692 markings, 236436531 edges, 108968 markings/sec, 320 secs
lola: 35321787 markings, 239999710 edges, 111619 markings/sec, 325 secs
lola: 35826735 markings, 243510172 edges, 100990 markings/sec, 330 secs
lola: 36407225 markings, 247264146 edges, 116098 markings/sec, 335 secs
lola: 36885647 markings, 250968951 edges, 95684 markings/sec, 340 secs
lola: 37289537 markings, 254379053 edges, 80778 markings/sec, 345 secs
lola: 37681643 markings, 257837439 edges, 78421 markings/sec, 350 secs
lola: 38056936 markings, 261234117 edges, 75059 markings/sec, 355 secs
lola: 38453200 markings, 264848598 edges, 79253 markings/sec, 360 secs
lola: 38818489 markings, 268385503 edges, 73058 markings/sec, 365 secs
lola: 39235813 markings, 271959077 edges, 83465 markings/sec, 370 secs
lola: 39629970 markings, 275615246 edges, 78831 markings/sec, 375 secs
lola: 40018432 markings, 279343229 edges, 77692 markings/sec, 380 secs
lola: 40417395 markings, 283101899 edges, 79793 markings/sec, 385 secs
lola: 40810789 markings, 286788592 edges, 78679 markings/sec, 390 secs
lola: 41193683 markings, 290280978 edges, 76579 markings/sec, 395 secs
lola: 41525981 markings, 293540311 edges, 66460 markings/sec, 400 secs
lola: 41893792 markings, 297143427 edges, 73562 markings/sec, 405 secs
lola: 42325885 markings, 301014956 edges, 86419 markings/sec, 410 secs
lola: 42715058 markings, 304839574 edges, 77835 markings/sec, 415 secs
lola: 43096463 markings, 308655390 edges, 76281 markings/sec, 420 secs
lola: 43452287 markings, 312372071 edges, 71165 markings/sec, 425 secs
lola: 43864197 markings, 316030281 edges, 82382 markings/sec, 430 secs
lola: 44248268 markings, 319777339 edges, 76814 markings/sec, 435 secs
lola: 44638527 markings, 323536384 edges, 78052 markings/sec, 440 secs
lola: 44990125 markings, 326761475 edges, 70320 markings/sec, 445 secs
lola: 45320602 markings, 330049110 edges, 66095 markings/sec, 450 secs
lola: 45716600 markings, 333780215 edges, 79200 markings/sec, 455 secs
lola: 46108619 markings, 337620769 edges, 78404 markings/sec, 460 secs
lola: 46464496 markings, 341402409 edges, 71175 markings/sec, 465 secs
lola: 46855216 markings, 344994170 edges, 78144 markings/sec, 470 secs
lola: 47242744 markings, 348600866 edges, 77506 markings/sec, 475 secs
lola: 47623359 markings, 352283161 edges, 76123 markings/sec, 480 secs
lola: 48004740 markings, 355931289 edges, 76276 markings/sec, 485 secs
lola: 48371121 markings, 359401948 edges, 73276 markings/sec, 490 secs
lola: 48727607 markings, 362949969 edges, 71297 markings/sec, 495 secs
lola: 49135041 markings, 366732391 edges, 81487 markings/sec, 500 secs
lola: 49514741 markings, 370521762 edges, 75940 markings/sec, 505 secs
lola: 49828833 markings, 374073133 edges, 62818 markings/sec, 510 secs
lola: 50109420 markings, 377295753 edges, 56117 markings/sec, 515 secs
lola: 50402352 markings, 380815527 edges, 58586 markings/sec, 520 secs
lola: 50668342 markings, 383938572 edges, 53198 markings/sec, 525 secs
lola: 50952720 markings, 387352960 edges, 56876 markings/sec, 530 secs
lola: 51251068 markings, 390950612 edges, 59670 markings/sec, 535 secs
lola: 51542213 markings, 394487862 edges, 58229 markings/sec, 540 secs
lola: 52178367 markings, 398049124 edges, 127231 markings/sec, 545 secs
lola: 52757632 markings, 401753265 edges, 115853 markings/sec, 550 secs
lola: 53310248 markings, 405357947 edges, 110523 markings/sec, 555 secs
lola: 53896724 markings, 408982520 edges, 117295 markings/sec, 560 secs
lola: 54406790 markings, 412393939 edges, 102013 markings/sec, 565 secs
lola: 54980845 markings, 416085953 edges, 114811 markings/sec, 570 secs
lola: 55567749 markings, 419928532 edges, 117381 markings/sec, 575 secs
lola: 56078453 markings, 423668833 edges, 102141 markings/sec, 580 secs
lola: 56651634 markings, 427282608 edges, 114636 markings/sec, 585 secs
lola: 57213552 markings, 430993388 edges, 112384 markings/sec, 590 secs
lola: 57747139 markings, 434463425 edges, 106717 markings/sec, 595 secs
lola: 58273043 markings, 438022528 edges, 105181 markings/sec, 600 secs
lola: 58861810 markings, 441841519 edges, 117753 markings/sec, 605 secs
lola: 59366231 markings, 445634627 edges, 100884 markings/sec, 610 secs
lola: 59968146 markings, 449254851 edges, 120383 markings/sec, 615 secs
lola: 60525577 markings, 452983868 edges, 111486 markings/sec, 620 secs
lola: 61094277 markings, 456612651 edges, 113740 markings/sec, 625 secs
lola: 61611781 markings, 460199142 edges, 103501 markings/sec, 630 secs
lola: 62193598 markings, 463986007 edges, 116363 markings/sec, 635 secs
lola: 62658657 markings, 467616025 edges, 93012 markings/sec, 640 secs
lola: 63049072 markings, 470947329 edges, 78083 markings/sec, 645 secs
lola: 63414785 markings, 474182755 edges, 73143 markings/sec, 650 secs
lola: 63783229 markings, 477518217 edges, 73689 markings/sec, 655 secs
lola: 64178992 markings, 481095429 edges, 79153 markings/sec, 660 secs
lola: 64630658 markings, 484585131 edges, 90333 markings/sec, 665 secs
lola: 65253332 markings, 488214032 edges, 124535 markings/sec, 670 secs
lola: 65825150 markings, 491924485 edges, 114364 markings/sec, 675 secs
lola: 66402978 markings, 495740589 edges, 115566 markings/sec, 680 secs
lola: local time limit reached - aborting
lola: caught signal User defined signal 1 - aborting LoLA
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 DES-PT-10b-CTLFireability-0 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-10b-CTLFireability-1 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-10b-CTLFireability-2 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-10b-CTLFireability-3 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-10b-CTLFireability-4 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-10b-CTLFireability-5 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-10b-CTLFireability-6 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-10b-CTLFireability-7 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-10b-CTLFireability-8 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-10b-CTLFireability-9 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-10b-CTLFireability-10 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-10b-CTLFireability-11 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-10b-CTLFireability-12 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-10b-CTLFireability-13 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-10b-CTLFireability-14 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-10b-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="DES-PT-10b"
export BK_EXAMINATION="CTLFireability"
export BK_TOOL="irma4mcc-structural"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

tar xzf /home/mcc/BenchKit/INPUTS/DES-PT-10b.tgz
mv DES-PT-10b execution
cd execution
pwd
ls -lh

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