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 300K
-rw-r--r-- 1 mcc users 3.0K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 17K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K 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.3K 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.7K May 15 18:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 8.2K 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 17K May 15 18:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 101 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 339 May 15 18:54 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 2.4K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 14K 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 139K May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool mcc4mcc-structural
Input is DES-PT-60b, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r059-smll-152646386400291
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1526625024615


BK_STOP 1526625555832

--------------------
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-60b 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': 2653560, 'Memory': 4659.52, 'Tool': 'lola'}, {'Time': 2654138, 'Memory': 4643.34, 'Tool': 'lola'}].
Learned tools are: [{'Tool': 'lola'}].
Learned tool lola is 1.0x far from the best tool lola.
CTLFireability lola DES-PT-60b...

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


checking for too many tokens
===========================================================================================
DES-PT-60b: translating PT formula CTLFireability into LoLA format
===========================================================================================
translating formula complete
touch formulae;
----- Start make result stdout -----
----- Start make result stderr -----
CTLFireability @ DES-PT-60b @ 3540 seconds
make: [verify] Error 134 (ignored)
----- Start make result stderr -----
Makefile:222: recipe for target 'verify' failed
----- 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: 989/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: finding significant places
lola: 519 places, 470 transitions, 454 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 567 transition conflict sets
lola: TASK
lola: reading formula from DES-PT-60b-CTLFireability.task
lola: E (F ((A (G (NOT FIREABLE(t235))) OR FIREABLE(t229)))) : A (F ((E (X (NOT FIREABLE(t139))) AND FIREABLE(t188)))) : E (F (E (G ((NOT FIREABLE(t146) OR (FIREABLE(t280) AND FIREABLE(t60))))))) : A (F (FIREABLE(t415))) : A (F (E (X (((FIREABLE(t443) AND FIREABLE(t173)) OR (FIREABLE(t103) AND FIREABLE(t436))))))) : NOT(E (G (NOT FIREABLE(t344)))) : NOT((A (F ((NOT FIREABLE(t117) OR NOT FIREABLE(t198)))) AND (A (F (NOT FIREABLE(t180))) AND A (G (NOT FIREABLE(t3)))))) : NOT((A (F (E (G (FIREABLE(t173))))) OR ((A (G (FIREABLE(t228))) OR FIREABLE(t428)) OR FIREABLE(t301)))) : (E (F ((FIREABLE(t389) AND (NOT FIREABLE(t287) OR (FIREABLE(t288) AND FIREABLE(t468)))))) OR FIREABLE(t365)) : ((A (F ((NOT FIREABLE(t309) AND FIREABLE(t253)))) OR FIREABLE(t241)) OR A ((A (X (FIREABLE(t447))) U E (G (FIREABLE(t334)))))) : (E (F (FIREABLE(t133))) AND NOT((FIREABLE(t457) OR A (G ((FIREABLE(t44) AND FIREABLE(t286))))))) : A (F (((NOT FIREABLE(t59) OR A (X (FIREABLE(t458)))) AND E ((FIREABLE(t436) U FIREABLE(t159)))))) : ((((NOT FIREABLE(t357) OR NOT FIREABLE(t439) OR FIREABLE(t39)) AND NOT FIREABLE(t283)) AND (A (G (NOT FIREABLE(t250))) OR FIREABLE(t300))) AND (((NOT FIREABLE(t133) OR NOT FIREABLE(t108) OR (FIREABLE(t6) AND FIREABLE(t209))) OR E (F ((FIREABLE(t296) AND FIREABLE(t1))))) OR E ((NOT FIREABLE(t352) U (FIREABLE(t390) OR FIREABLE(t251)))))) : A (F (A (G (NOT FIREABLE(t208))))) : (E (F (E (F ((FIREABLE(t384) AND FIREABLE(t129)))))) AND NOT FIREABLE(t326)) : E (G ((E (X ((FIREABLE(t447) OR FIREABLE(t383)))) OR A (X (NOT FIREABLE(t277))))))
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 (G (NOT FIREABLE(t235))) OR FIREABLE(t229))))
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 (G (NOT FIREABLE(t235)))))
lola: ========================================
lola: SUBTASK
lola: checking possible invariance
lola: possible invariance not yet implemented, converting to CTL...
lola: processed formula: E(TRUE U NOT(E(TRUE U FIREABLE(t235))))
lola: processed formula length: 39
lola: 4 rewrites
lola: formula mentions 0 of 519 places; total mentions: 0
lola: closed formula file DES-PT-60b-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 60 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: 775681 markings, 2561126 edges, 3096159597753270272 markings/sec, 0 secs
lola: 1598726 markings, 5232478 edges, 164609 markings/sec, 5 secs
lola: 2419931 markings, 7882872 edges, 164241 markings/sec, 10 secs
lola: 3196413 markings, 10396425 edges, 155296 markings/sec, 15 secs
lola: 3919380 markings, 12740944 edges, 144593 markings/sec, 20 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 4422482 markings, 14376291 edges
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: subprocess 1 will run for 234 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((E (X (NOT FIREABLE(t139))) AND FIREABLE(t188))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U (EX(NOT FIREABLE(t139)) AND FIREABLE(t188)))
lola: processed formula length: 53
lola: 2 rewrites
lola: formula mentions 0 of 519 places; total mentions: 0
lola: closed formula file DES-PT-60b-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 60 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: 85 markings, 84 edges
lola: ========================================
lola: subprocess 2 will run for 250 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (E (G ((NOT FIREABLE(t146) OR (FIREABLE(t280) AND FIREABLE(t60)))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(TRUE U NOT(A(TRUE U (FIREABLE(t146) AND (NOT FIREABLE(t280) OR NOT FIREABLE(t60))))))
lola: processed formula length: 88
lola: 3 rewrites
lola: formula mentions 0 of 519 places; total mentions: 0
lola: closed formula file DES-PT-60b-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 60 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: 85 markings, 85 edges
lola: ========================================
lola: ========================================
lola: ========================================
lola: subprocess 3 will run for 270 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (FIREABLE(t415)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F (FIREABLE(t415)))
lola: processed formula: A (F (FIREABLE(t415)))
lola: processed formula length: 22
lola: 0 rewrites
lola: formula mentions 0 of 519 places; total mentions: 0
lola: closed formula file DES-PT-60b-CTLFireability.task
lola: the resulting B\xfcchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 60 bytes per marking, with 25 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: 87 markings, 87 edges
lola: ========================================
lola: subprocess 4 will run for 292 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (E (X (((FIREABLE(t443) AND FIREABLE(t173)) OR (FIREABLE(t103) AND FIREABLE(t436)))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U EX(((FIREABLE(t443) AND FIREABLE(t173)) OR (FIREABLE(t103) AND FIREABLE(t436)))))
lola: processed formula length: 91
lola: 2 rewrites
lola: formula mentions 0 of 519 places; total mentions: 0
lola: closed formula file DES-PT-60b-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 60 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: 85 markings, 84 edges
lola: ========================================
lola: subprocess 5 will run for 319 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT(E (G (NOT FIREABLE(t344))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F (FIREABLE(t344)))
lola: processed formula: A (F (FIREABLE(t344)))
lola: processed formula length: 22
lola: 3 rewrites
lola: formula mentions 0 of 519 places; total mentions: 0
lola: closed formula file DES-PT-60b-CTLFireability.task
lola: the resulting B\xfcchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 60 bytes per marking, with 25 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: 97 markings, 97 edges
lola: ========================================
lola: subprocess 6 will run for 351 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT((A (F ((NOT FIREABLE(t117) OR NOT FIREABLE(t198)))) AND (A (F (NOT FIREABLE(t180))) AND A (G (NOT FIREABLE(t3))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 6 will run for 351 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G ((FIREABLE(t117) AND FIREABLE(t198))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U (NOT FIREABLE(t117) OR NOT FIREABLE(t198))))
lola: processed formula length: 58
lola: 13 rewrites
lola: formula mentions 0 of 519 places; total mentions: 0
lola: closed formula file DES-PT-60b-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 60 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: subprocess 7 will run for 390 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G (FIREABLE(t180)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U NOT FIREABLE(t180)))
lola: processed formula length: 33
lola: 13 rewrites
lola: formula mentions 0 of 519 places; total mentions: 0
lola: closed formula file DES-PT-60b-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 60 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: subprocess 8 will run for 438 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (FIREABLE(t3)))
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 60 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: 31 markings, 30 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 7 will run for 390 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT((A (F (E (G (FIREABLE(t173))))) OR ((A (G (FIREABLE(t228))) OR FIREABLE(t428)) OR FIREABLE(t301))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 7 will run for 390 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G (A (F (NOT FIREABLE(t173)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U NOT(A(TRUE U NOT FIREABLE(t173)))))
lola: processed formula length: 48
lola: 16 rewrites
lola: formula mentions 0 of 519 places; total mentions: 0
lola: closed formula file DES-PT-60b-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 60 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: 85 markings, 169 edges
lola: ========================================
lola: subprocess 8 will run for 438 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (NOT FIREABLE(t228)))
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 60 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: 0 markings, 0 edges
lola: ========================================
lola: subprocess 9 will run for 501 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (NOT FIREABLE(t428) AND NOT FIREABLE(t301))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (NOT FIREABLE(t428) AND NOT FIREABLE(t301))
lola: processed formula length: 43
lola: 15 rewrites
lola: formula mentions 0 of 519 places; total mentions: 0
lola: closed formula file DES-PT-60b-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: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 8 will run for 438 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (E (F ((FIREABLE(t389) AND (NOT FIREABLE(t287) OR (FIREABLE(t288) AND FIREABLE(t468)))))) OR FIREABLE(t365))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 8 will run for 438 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(t389) AND (NOT FIREABLE(t287) OR (FIREABLE(t288) AND FIREABLE(t468))))))
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 60 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: 1675699 markings, 1919174 edges, 335140 markings/sec, 0 secs
lola: 3289939 markings, 3768587 edges, 322848 markings/sec, 5 secs
lola: 4969113 markings, 5692248 edges, 335835 markings/sec, 10 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 5565083 markings, 6375242 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 9 will run for 499 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((A (F ((NOT FIREABLE(t309) AND FIREABLE(t253)))) OR FIREABLE(t241)) OR A ((A (X (FIREABLE(t447))) U E (G (FIREABLE(t334))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 9 will run for 499 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((NOT FIREABLE(t309) AND FIREABLE(t253))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F ((NOT FIREABLE(t309) AND FIREABLE(t253))))
lola: processed formula: A (F ((NOT FIREABLE(t309) AND FIREABLE(t253))))
lola: processed formula length: 47
lola: 1 rewrites
lola: formula mentions 0 of 519 places; total mentions: 0
lola: closed formula file DES-PT-60b-CTLFireability.task
lola: the resulting B\xfcchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 60 bytes per marking, with 25 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: 89 markings, 89 edges
lola: ========================================
lola: subprocess 10 will run for 582 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: FIREABLE(t241)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FIREABLE(t241)
lola: processed formula length: 14
lola: 1 rewrites
lola: formula mentions 0 of 519 places; total mentions: 0
lola: closed formula file DES-PT-60b-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 11 will run for 699 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((A (X (FIREABLE(t447))) U E (G (FIREABLE(t334)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(AX(FIREABLE(t447)) U NOT(A(TRUE U NOT FIREABLE(t334))))
lola: processed formula length: 57
lola: 5 rewrites
lola: formula mentions 0 of 519 places; total mentions: 0
lola: closed formula file DES-PT-60b-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 60 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: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 10 will run for 582 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (E (F (FIREABLE(t133))) AND NOT((FIREABLE(t457) OR A (G ((FIREABLE(t44) AND FIREABLE(t286)))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 10 will run for 582 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (FIREABLE(t133)))
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 60 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 11 will run for 699 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT FIREABLE(t457)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: NOT FIREABLE(t457)
lola: processed formula length: 18
lola: 5 rewrites
lola: formula mentions 0 of 519 places; total mentions: 0
lola: closed formula file DES-PT-60b-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 12 will run for 873 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((NOT FIREABLE(t44) OR NOT FIREABLE(t286))))
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 60 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: 0 markings, 0 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 11 will run for 699 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (((NOT FIREABLE(t59) OR A (X (FIREABLE(t458)))) AND E ((FIREABLE(t436) U FIREABLE(t159))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U ((NOT FIREABLE(t59) OR AX(FIREABLE(t458))) AND E(FIREABLE(t436) U FIREABLE(t159))))
lola: processed formula length: 92
lola: 3 rewrites
lola: formula mentions 0 of 519 places; total mentions: 0
lola: closed formula file DES-PT-60b-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 60 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: 338636 markings, 2426809 edges, 67719 markings/sec, 0 secs
lola: 650706 markings, 5164765 edges, 62414 markings/sec, 5 secs
lola: 979310 markings, 7900530 edges, 65721 markings/sec, 10 secs
lola: 1309356 markings, 10618385 edges, 66009 markings/sec, 15 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 1540595 markings, 12426473 edges
lola: ========================================
lola: subprocess 12 will run for 867 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((((NOT FIREABLE(t357) OR NOT FIREABLE(t439) OR FIREABLE(t39)) AND NOT FIREABLE(t283)) AND (A (G (NOT FIREABLE(t250))) OR FIREABLE(t300))) AND (((NOT FIREABLE(t133) OR NOT FIREABLE(t108) OR (FIREABLE(t6) AND FIREABLE(t209))) OR E (F ((FIREABLE(t296) AND FIREABLE(t1))))) OR E ((NOT FIREABLE(t352) U (FIREABLE(t390) OR FIREABLE(t251))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 12 will run for 867 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((NOT FIREABLE(t357) OR NOT FIREABLE(t439) OR FIREABLE(t39)) AND NOT FIREABLE(t283))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((NOT FIREABLE(t357) OR NOT FIREABLE(t439) OR FIREABLE(t39)) AND NOT FIREABLE(t283))
lola: processed formula length: 86
lola: 2 rewrites
lola: formula mentions 0 of 519 places; total mentions: 0
lola: closed formula file DES-PT-60b-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 13 will run for 1157 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (NOT FIREABLE(t250)))
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 60 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: 1473770 markings, 1802710 edges, 294754 markings/sec, 0 secs
lola: 2912006 markings, 3607157 edges, 287647 markings/sec, 5 secs
lola: 4290478 markings, 5325957 edges, 275694 markings/sec, 10 secs
lola: 5745429 markings, 7152593 edges, 290990 markings/sec, 15 secs
lola: 7195792 markings, 8976132 edges, 290073 markings/sec, 20 secs
lola: 8647388 markings, 10802714 edges, 290319 markings/sec, 25 secs
lola: 10064571 markings, 12569139 edges, 283437 markings/sec, 30 secs
lola: 11437271 markings, 14286902 edges, 274540 markings/sec, 35 secs
lola: 12799206 markings, 15995813 edges, 272387 markings/sec, 40 secs
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 13435685 markings, 16792583 edges
lola: ========================================
lola: subprocess 14 will run for 1712 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: FIREABLE(t300)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FIREABLE(t300)
lola: processed formula length: 14
lola: 2 rewrites
lola: formula mentions 0 of 519 places; total mentions: 0
lola: closed formula file DES-PT-60b-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: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 13 will run for 1141 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (A (G (NOT FIREABLE(t208)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F (A (G (NOT FIREABLE(t208)))))
lola: processed formula: A (F (A (G (NOT FIREABLE(t208)))))
lola: processed formula length: 34
lola: 0 rewrites
lola: formula mentions 0 of 519 places; total mentions: 0
lola: closed formula file DES-PT-60b-CTLFireability.task
lola: the resulting B\xfcchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 60 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: 1254913 markings, 1534092 edges, 250983 markings/sec, 0 secs
lola: 2463479 markings, 3108143 edges, 241713 markings/sec, 5 secs
lola: 3665195 markings, 4663794 edges, 240343 markings/sec, 10 secs
lola: 4877910 markings, 6245022 edges, 242543 markings/sec, 15 secs
lola: 6074739 markings, 7795178 edges, 239366 markings/sec, 20 secs
lola: 7195549 markings, 9254650 edges, 224162 markings/sec, 25 secs
lola: 8375781 markings, 10832608 edges, 236046 markings/sec, 30 secs
lola: 9431626 markings, 12200648 edges, 211169 markings/sec, 35 secs
lola: 10575196 markings, 13689277 edges, 228714 markings/sec, 40 secs
lola: 11693655 markings, 15145018 edges, 223692 markings/sec, 45 secs
lola: 12819859 markings, 16602343 edges, 225241 markings/sec, 50 secs
lola: 13949065 markings, 18071623 edges, 225841 markings/sec, 55 secs
lola: 15068739 markings, 19529726 edges, 223935 markings/sec, 60 secs
lola: 16184377 markings, 20974330 edges, 223128 markings/sec, 65 secs
lola: 17294269 markings, 22416226 edges, 221978 markings/sec, 70 secs
lola: 18352398 markings, 23791976 edges, 211626 markings/sec, 75 secs
lola: 19477327 markings, 25256815 edges, 224986 markings/sec, 80 secs
lola: 20717511 markings, 26893562 edges, 248037 markings/sec, 85 secs
lola: 22109873 markings, 28662335 edges, 278472 markings/sec, 90 secs
lola: 23783038 markings, 30597050 edges, 334633 markings/sec, 95 secs
lola: 25696641 markings, 32640447 edges, 382721 markings/sec, 100 secs
lola: 27076010 markings, 34339534 edges, 275874 markings/sec, 105 secs
lola: 28463724 markings, 36061765 edges, 277543 markings/sec, 110 secs
lola: 29859211 markings, 37721678 edges, 279097 markings/sec, 115 secs
lola: 31319979 markings, 39412658 edges, 292154 markings/sec, 120 secs
lola: 32831448 markings, 41101203 edges, 302294 markings/sec, 125 secs
lola: 34101603 markings, 42540581 edges, 254031 markings/sec, 130 secs
lola: 35538463 markings, 44207662 edges, 287372 markings/sec, 135 secs
lola: 36804159 markings, 45829146 edges, 253139 markings/sec, 140 secs
lola: 38185938 markings, 47521587 edges, 276356 markings/sec, 145 secs
lola: 39507748 markings, 49148331 edges, 264362 markings/sec, 150 secs
lola: 40579314 markings, 50603243 edges, 214313 markings/sec, 155 secs
lola: 42041913 markings, 52296339 edges, 292520 markings/sec, 160 secs
lola: 43156775 markings, 53715438 edges, 222972 markings/sec, 165 secs
lola: 44281689 markings, 55159073 edges, 224983 markings/sec, 170 secs
lola: 45762079 markings, 56892219 edges, 296078 markings/sec, 175 secs
lola: 47137080 markings, 58533439 edges, 275000 markings/sec, 180 secs
lola: 48396199 markings, 60007832 edges, 251824 markings/sec, 185 secs
lola: 49578848 markings, 61444390 edges, 236530 markings/sec, 190 secs
lola: 50942876 markings, 63008494 edges, 272806 markings/sec, 195 secs
lola: 52244880 markings, 64578473 edges, 260401 markings/sec, 200 secs
lola: 53403808 markings, 66008615 edges, 231786 markings/sec, 205 secs
lola: 54643310 markings, 67446299 edges, 247900 markings/sec, 210 secs
lola: 55825707 markings, 68938082 edges, 236479 markings/sec, 215 secs
lola: 57124366 markings, 70509850 edges, 259732 markings/sec, 220 secs
lola: 58755348 markings, 72378935 edges, 326196 markings/sec, 225 secs
lola: 60025317 markings, 74053692 edges, 253994 markings/sec, 230 secs
lola: 61171213 markings, 75669705 edges, 229179 markings/sec, 235 secs
lola: 62344797 markings, 77214463 edges, 234717 markings/sec, 240 secs
lola: 63938992 markings, 79031961 edges, 318839 markings/sec, 245 secs
lola: 65457385 markings, 80788015 edges, 303679 markings/sec, 250 secs
lola: 66638793 markings, 82337639 edges, 236282 markings/sec, 255 secs
lola: 68072441 markings, 83987879 edges, 286730 markings/sec, 260 secs
lola: 69156288 markings, 85511247 edges, 216769 markings/sec, 265 secs
lola: 70238533 markings, 87019069 edges, 216449 markings/sec, 270 secs
lola: 71838322 markings, 88798412 edges, 319958 markings/sec, 275 secs
lola: 73274315 markings, 90508298 edges, 287199 markings/sec, 280 secs
lola: 74571396 markings, 92065025 edges, 259416 markings/sec, 285 secs
lola: 75887804 markings, 93599841 edges, 263282 markings/sec, 290 secs
lola: 77318838 markings, 95188039 edges, 286207 markings/sec, 295 secs
lola: 78853343 markings, 96850323 edges, 306901 markings/sec, 300 secs
lola: 80250106 markings, 98395733 edges, 279353 markings/sec, 305 secs
lola: 81418755 markings, 99825004 edges, 233730 markings/sec, 310 secs
lola: 82781209 markings, 101410895 edges, 272491 markings/sec, 315 secs
lola: 83927929 markings, 102926782 edges, 229344 markings/sec, 320 secs
lola: 85380689 markings, 104594219 edges, 290552 markings/sec, 325 secs
lola: 86618456 markings, 106136554 edges, 247553 markings/sec, 330 secs
lola: 87931996 markings, 107675803 edges, 262708 markings/sec, 335 secs
lola: 89078223 markings, 109198448 edges, 229245 markings/sec, 340 secs
lola: 90253825 markings, 110773331 edges, 235120 markings/sec, 345 secs
lola: 91369337 markings, 112193865 edges, 223102 markings/sec, 350 secs
lola: 92581935 markings, 113839140 edges, 242520 markings/sec, 355 secs
lola: 94288005 markings, 115773332 edges, 341214 markings/sec, 360 secs
lola: 95682230 markings, 117477800 edges, 278845 markings/sec, 365 secs
lola: 96976065 markings, 119112916 edges, 258767 markings/sec, 370 secs
lola: 98266723 markings, 120766707 edges, 258132 markings/sec, 375 secs
lola: 99882948 markings, 122576579 edges, 323245 markings/sec, 380 secs
lola: 100975745 markings, 124066159 edges, 218559 markings/sec, 385 secs
lola: 102218340 markings, 125714323 edges, 248519 markings/sec, 390 secs
lola: 103710654 markings, 127453301 edges, 298463 markings/sec, 395 secs
lola: 105187545 markings, 129259883 edges, 295378 markings/sec, 400 secs
lola: Child process aborted or communication problem between parent and child process
terminate called after throwing an instance of 'std::runtime_error'
what(): parse error at position 0: unexpected character, last read: '
'
Aborted (core dumped)
FORMULA DES-PT-60b-CTLFireability-0 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-60b-CTLFireability-1 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-60b-CTLFireability-2 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-60b-CTLFireability-3 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-60b-CTLFireability-4 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-60b-CTLFireability-5 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-60b-CTLFireability-6 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-60b-CTLFireability-7 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-60b-CTLFireability-8 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-60b-CTLFireability-9 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-60b-CTLFireability-10 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-60b-CTLFireability-11 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-60b-CTLFireability-12 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-60b-CTLFireability-13 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-60b-CTLFireability-14 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-60b-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-60b"
export BK_EXAMINATION="CTLFireability"
export BK_TOOL="mcc4mcc-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-60b.tgz
mv DES-PT-60b 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 mcc4mcc-structural"
echo " Input is DES-PT-60b, 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 r059-smll-152646386400291"
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 ;