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 180K
-rw-r--r-- 1 mcc users 3.7K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 21K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.7K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 15 18:54 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K May 15 18:49 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.2K May 15 18:49 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 2.4K May 15 18:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 9.1K May 15 18:54 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K May 15 18:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 9.6K May 15 18:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.3K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 16K May 15 18:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 119 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 357 May 15 18:54 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 3.1K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 20K May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K May 15 18:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 15 18:54 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 15 18:49 equiv_col
-rw-r--r-- 1 mcc users 8 May 15 18:49 instance
-rw-r--r-- 1 mcc users 6 May 15 18:49 iscolored
-rw-r--r-- 1 mcc users 9.2K May 15 18:49 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool irma4mcc-full
Input is ClientsAndServers-PT-N0020P1, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r042-smll-152646358700116
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1526471584927


BK_STOP 1526472000607

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

Prefix is 65b80f64.
Reading known information in /usr/share/mcc4mcc/65b80f64-known.json.
Reading learned information in /usr/share/mcc4mcc/65b80f64-learned.json.
Reading value translations in /usr/share/mcc4mcc/65b80f64-values.json.
Using directory /home/mcc/execution for input, as it contains a model.pnml file.
Using ClientsAndServers-PT-N0020P1 as instance name.
Using ClientsAndServers as model name.
Using algorithm or tool voting-classifier.
Model characteristics are: {'Examination': 'CTLFireability', 'Place/Transition': True, 'Colored': False, 'Relative-Time': 1, 'Relative-Memory': 1, 'Ordinary': True, 'Simple Free Choice': False, 'Extended Free Choice': False, 'State Machine': False, 'Marked Graph': False, 'Connected': True, 'Strongly Connected': True, 'Source Place': False, 'Sink Place': False, 'Source Transition': False, 'Sink Transition': False, 'Loop Free': True, 'Conservative': False, 'Sub-Conservative': False, 'Nested Units': False, 'Safe': False, 'Deadlock': None, 'Reversible': None, 'Quasi Live': True, 'Live': None}.
/usr/local/lib/python3.6/dist-packages/sklearn/preprocessing/label.py:151: DeprecationWarning: The truth value of an empty array is ambiguous. Returning False, but in future this will result in an error. Use `array.size > 0` to check that an array is not empty.
if diff:
Known tools are: [{'Time': 452204, 'Memory': 7792.72, 'Tool': 'lola'}].
Learned tools are: [{'Tool': 'itstools'}].
CTLFireability lola ClientsAndServers-PT-N0020P1...

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


checking for too many tokens
===========================================================================================
ClientsAndServers-PT-N0020P1: translating PT formula CTLFireability into LoLA format
===========================================================================================
translating formula complete
touch formulae;
----- Start make result stdout -----
----- Start make result stderr -----
CTLFireability @ ClientsAndServers-PT-N0020P1 @ 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: 43/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: finding significant places
lola: 25 places, 18 transitions, 17 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 25 transition conflict sets
lola: TASK
lola: reading formula from ClientsAndServers-PT-N0020P1-CTLFireability.task
lola: E ((E (F (NOT FIREABLE(mfU))) U A (G (FIREABLE(mfU))))) : (NOT(E (F (A (X (FIREABLE(srA)))))) AND E (F (A ((FIREABLE(srF) U FIREABLE(crG)))))) : E (((E (F (FIREABLE(csR))) AND NOT FIREABLE(ssR)) U (A (G (FIREABLE(srG))) AND FIREABLE(msG)))) : (((E (F (FIREABLE(msA))) OR (NOT FIREABLE(crA) AND NOT FIREABLE(maU) AND FIREABLE(csF))) OR (E ((FIREABLE(ssR) U FIREABLE(ssG))) OR A (G (FIREABLE(mrF))))) AND A (F ((A (F (FIREABLE(ssA))) OR A (F (FIREABLE(mrF))))))) : A (F (E (((FIREABLE(mrF) OR FIREABLE(msG)) U FIREABLE(ssG))))) : ((A (F (E (X (FIREABLE(ssA))))) OR FIREABLE(srF)) OR NOT(NOT(A ((FIREABLE(srG) U FIREABLE(srR)))))) : A (F (E (G ((NOT FIREABLE(ssF) AND (FIREABLE(csF) OR FIREABLE(ssF))))))) : NOT((NOT FIREABLE(msA) AND NOT((A (G (FIREABLE(csR))) AND (FIREABLE(csR) OR NOT FIREABLE(msG)))))) : NOT(((A (F (FIREABLE(msG))) OR (FIREABLE(csF) OR FIREABLE(ssF) OR FIREABLE(ssG))) AND E (X ((NOT FIREABLE(ssR) AND NOT FIREABLE(csF)))))) : NOT(E (X ((FIREABLE(maU) OR A (F (FIREABLE(ssF))))))) : A ((A (F (NOT FIREABLE(mrF))) U (A (F (FIREABLE(ssA))) OR FIREABLE(crG)))) : A (F ((A (F (NOT FIREABLE(srA))) AND A (F ((FIREABLE(srG) OR FIREABLE(msG))))))) : E (((FIREABLE(ssG) OR A (G (FIREABLE(csR)))) U E ((FIREABLE(mrR) U FIREABLE(srG))))) : A (F (FIREABLE(ssF))) : (((FIREABLE(mrF) OR FIREABLE(srG) OR FIREABLE(maU)) OR E (G (NOT FIREABLE(ssA)))) OR A ((((FIREABLE(ssG) OR FIREABLE(ssA)) AND (FIREABLE(mfU) OR FIREABLE(crA))) U E (X (FIREABLE(crG)))))) : ((NOT(NOT(E (G (FIREABLE(msG))))) OR NOT(((NOT FIREABLE(msG) OR NOT FIREABLE(crA)) AND E (X (FIREABLE(ssG)))))) AND E (((NOT FIREABLE(srA) AND NOT FIREABLE(ssA)) U E (G (FIREABLE(srR))))))
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 ((E (F (NOT FIREABLE(mfU))) U A (G (FIREABLE(mfU)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(E(TRUE U NOT FIREABLE(mfU)) U NOT(E(TRUE U NOT FIREABLE(mfU))))
lola: processed formula length: 65
lola: 4 rewrites
lola: formula mentions 0 of 25 places; total mentions: 0
lola: closed formula file ClientsAndServers-PT-N0020P1-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 68 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 3 significant temporal operators and needs 13 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: 1077910 markings, 5315253 edges, 210081 markings/sec, 0 secs
lola: 2208802 markings, 11010980 edges, 226178 markings/sec, 5 secs
lola: 3339932 markings, 16714973 edges, 226226 markings/sec, 10 secs
lola: 4471709 markings, 22429824 edges, 226355 markings/sec, 15 secs
lola: 5597979 markings, 28123481 edges, 225254 markings/sec, 20 secs
lola: 6725068 markings, 33812571 edges, 225418 markings/sec, 25 secs
lola: 7832071 markings, 39412183 edges, 221401 markings/sec, 30 secs
lola: 8932570 markings, 44965553 edges, 220100 markings/sec, 35 secs
lola: 9928120 markings, 50144698 edges, 199110 markings/sec, 40 secs
lola: 10766396 markings, 54711874 edges, 167655 markings/sec, 45 secs
lola: 11603907 markings, 59256605 edges, 167502 markings/sec, 50 secs
lola: 12539706 markings, 64219410 edges, 187160 markings/sec, 55 secs
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 12600648 markings, 64520795 edges
lola: ========================================
lola: subprocess 1 will run for 232 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (NOT(E (F (A (X (FIREABLE(srA)))))) AND E (F (A ((FIREABLE(srF) U FIREABLE(crG))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 1 will run for 232 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (E (X (NOT FIREABLE(srA)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(E(TRUE U NOT(EX(NOT FIREABLE(srA)))))
lola: processed formula length: 41
lola: 7 rewrites
lola: formula mentions 0 of 25 places; total mentions: 0
lola: closed formula file ClientsAndServers-PT-N0020P1-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 68 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains EX or AX operators, stubborn sets not applicable
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 1073 markings, 1072 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 2 will run for 248 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (((E (F (FIREABLE(csR))) AND NOT FIREABLE(ssR)) U (A (G (FIREABLE(srG))) AND FIREABLE(msG))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E((E(TRUE U FIREABLE(csR)) AND NOT FIREABLE(ssR)) U (NOT(E(TRUE U NOT FIREABLE(srG))) AND FIREABLE(msG)))
lola: processed formula length: 105
lola: 4 rewrites
lola: formula mentions 0 of 25 places; total mentions: 0
lola: closed formula file ClientsAndServers-PT-N0020P1-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 68 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 3 significant temporal operators and needs 13 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: 1242 markings, 1884 edges
lola: ========================================
lola: subprocess 3 will run for 267 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (((E (F (FIREABLE(msA))) OR (NOT FIREABLE(crA) AND NOT FIREABLE(maU) AND FIREABLE(csF))) OR (E ((FIREABLE(ssR) U FIREABLE(ssG))) OR A (G (FIREABLE(mrF))))) AND A (F ((A (F (FIREABLE(ssA))) OR A (F (FIREABLE(mrF)))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 3 will run for 267 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (FIREABLE(msA)))
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 68 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 15 markings, 14 edges
lola: ========================================
lola: subprocess 4 will run for 290 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((A (F (FIREABLE(ssA))) OR A (F (FIREABLE(mrF))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U (A(TRUE U FIREABLE(ssA)) OR A(TRUE U FIREABLE(mrF))))
lola: processed formula length: 62
lola: 4 rewrites
lola: formula mentions 0 of 25 places; total mentions: 0
lola: closed formula file ClientsAndServers-PT-N0020P1-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 68 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 3 significant temporal operators and needs 13 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: 1073 markings, 5362 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 4 will run for 290 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (E (((FIREABLE(mrF) OR FIREABLE(msG)) U FIREABLE(ssG)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U E((FIREABLE(mrF) OR FIREABLE(msG)) U FIREABLE(ssG)))
lola: processed formula length: 62
lola: 2 rewrites
lola: formula mentions 0 of 25 places; total mentions: 0
lola: closed formula file ClientsAndServers-PT-N0020P1-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 68 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 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: 5937 markings, 10196 edges
lola: ========================================
lola: subprocess 5 will run for 316 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((A (F (E (X (FIREABLE(ssA))))) OR FIREABLE(srF)) OR NOT(NOT(A ((FIREABLE(srG) U FIREABLE(srR))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 5 will run for 316 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (E (X (FIREABLE(ssA)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U EX(FIREABLE(ssA)))
lola: processed formula length: 27
lola: 11 rewrites
lola: formula mentions 0 of 25 places; total mentions: 0
lola: closed formula file ClientsAndServers-PT-N0020P1-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 68 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains EX or AX operators, stubborn sets not applicable
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 1073 markings, 1072 edges
lola: ========================================
lola: subprocess 6 will run for 348 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: FIREABLE(srF)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FIREABLE(srF)
lola: processed formula length: 13
lola: 9 rewrites
lola: formula mentions 0 of 25 places; total mentions: 0
lola: closed formula file ClientsAndServers-PT-N0020P1-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 7 will run for 386 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((FIREABLE(srG) U FIREABLE(srR)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A ((FIREABLE(srG) U FIREABLE(srR)))
lola: processed formula: A ((FIREABLE(srG) U FIREABLE(srR)))
lola: processed formula length: 35
lola: 9 rewrites
lola: formula mentions 0 of 25 places; total mentions: 0
lola: closed formula file ClientsAndServers-PT-N0020P1-CTLFireability.task
lola: the resulting B\xfcchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 72 bytes per marking, with 30 unused bits
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method (--stubborn)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 1073 markings, 1073 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 6 will run for 348 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (E (G ((NOT FIREABLE(ssF) AND (FIREABLE(csF) OR FIREABLE(ssF)))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U NOT(A(TRUE U (FIREABLE(ssF) OR (NOT FIREABLE(csF) AND NOT FIREABLE(ssF))))))
lola: processed formula length: 86
lola: 3 rewrites
lola: formula mentions 0 of 25 places; total mentions: 0
lola: closed formula file ClientsAndServers-PT-N0020P1-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 68 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: 1951073 markings, 4796519 edges, 384713 markings/sec, 0 secs
lola: 3509629 markings, 9546631 edges, 311711 markings/sec, 5 secs
lola: 5093570 markings, 13523686 edges, 316788 markings/sec, 10 secs
lola: 6628632 markings, 18149524 edges, 307012 markings/sec, 15 secs
lola: 7740282 markings, 22285770 edges, 222330 markings/sec, 20 secs
lola: 9282817 markings, 26531016 edges, 308507 markings/sec, 25 secs
lola: 10688156 markings, 30221065 edges, 281068 markings/sec, 30 secs
lola: 12291814 markings, 34533498 edges, 320732 markings/sec, 35 secs
lola: 13494098 markings, 38931692 edges, 240457 markings/sec, 40 secs
lola: 14634022 markings, 43050873 edges, 227985 markings/sec, 45 secs
lola: 15566305 markings, 46857305 edges, 186457 markings/sec, 50 secs
lola: 16594398 markings, 50697731 edges, 205619 markings/sec, 55 secs
lola: 18097102 markings, 54622968 edges, 300541 markings/sec, 60 secs
lola: 19444490 markings, 58364514 edges, 269478 markings/sec, 65 secs
lola: 20875434 markings, 62105635 edges, 286189 markings/sec, 70 secs
lola: 22381319 markings, 65912471 edges, 301177 markings/sec, 75 secs
lola: 23884954 markings, 70908520 edges, 300727 markings/sec, 80 secs
lola: 25019542 markings, 75110472 edges, 226918 markings/sec, 85 secs
lola: 26101005 markings, 79388772 edges, 216293 markings/sec, 90 secs
lola: 27135776 markings, 83330467 edges, 206954 markings/sec, 95 secs
lola: 28235113 markings, 87495562 edges, 219867 markings/sec, 100 secs
lola: 29144102 markings, 91295844 edges, 181798 markings/sec, 105 secs
lola: 30055894 markings, 94970739 edges, 182358 markings/sec, 110 secs
lola: 31033088 markings, 98755224 edges, 195439 markings/sec, 115 secs
lola: 32604945 markings, 102926555 edges, 314371 markings/sec, 120 secs
lola: 33956860 markings, 106677982 edges, 270383 markings/sec, 125 secs
lola: 35285684 markings, 110335621 edges, 265765 markings/sec, 130 secs
lola: 36503472 markings, 113876005 edges, 243558 markings/sec, 135 secs
lola: 37891254 markings, 117465374 edges, 277556 markings/sec, 140 secs
lola: 39290780 markings, 121116348 edges, 279905 markings/sec, 145 secs
lola: 40795890 markings, 125572028 edges, 301022 markings/sec, 150 secs
lola: 41995047 markings, 129978142 edges, 239831 markings/sec, 155 secs
lola: 43164280 markings, 134312788 edges, 233847 markings/sec, 160 secs
lola: 44104103 markings, 138066520 edges, 187965 markings/sec, 165 secs
lola: 45224447 markings, 142204352 edges, 224069 markings/sec, 170 secs
lola: 46195683 markings, 146135434 edges, 194247 markings/sec, 175 secs
lola: 47026163 markings, 149705366 edges, 166096 markings/sec, 180 secs
lola: 47950459 markings, 153316349 edges, 184859 markings/sec, 185 secs
lola: 49060928 markings, 157403877 edges, 222094 markings/sec, 190 secs
lola: 50015331 markings, 161262228 edges, 190881 markings/sec, 195 secs
lola: 50847512 markings, 164845778 edges, 166436 markings/sec, 200 secs
lola: 51637676 markings, 168231829 edges, 158033 markings/sec, 205 secs
lola: 52379729 markings, 171407553 edges, 148411 markings/sec, 210 secs
lola: 53262818 markings, 174849673 edges, 176618 markings/sec, 215 secs
lola: 54195728 markings, 178479254 edges, 186582 markings/sec, 220 secs
lola: 55701678 markings, 182443794 edges, 301190 markings/sec, 225 secs
lola: 57011390 markings, 186057064 edges, 261942 markings/sec, 230 secs
lola: 58280901 markings, 189578566 edges, 253902 markings/sec, 235 secs
lola: 59470671 markings, 193045301 edges, 237954 markings/sec, 240 secs
lola: 60584940 markings, 196117785 edges, 222854 markings/sec, 245 secs
lola: 61552202 markings, 199013399 edges, 193452 markings/sec, 250 secs
lola: 62610573 markings, 202072097 edges, 211674 markings/sec, 255 secs
lola: 63853914 markings, 205277013 edges, 248668 markings/sec, 260 secs
lola: 65099918 markings, 208633601 edges, 249201 markings/sec, 265 secs
lola: 66465183 markings, 212137498 edges, 273053 markings/sec, 270 secs
lola: 67811089 markings, 216271348 edges, 269181 markings/sec, 275 secs
lola: 68906696 markings, 220325077 edges, 219121 markings/sec, 280 secs
lola: 70080622 markings, 224679344 edges, 234785 markings/sec, 285 secs
lola: 71042687 markings, 228515629 edges, 192413 markings/sec, 290 secs
lola: 72181114 markings, 232737891 edges, 227685 markings/sec, 295 secs
lola: 73032258 markings, 236202797 edges, 170229 markings/sec, 300 secs
lola: 73782310 markings, 239387980 edges, 150010 markings/sec, 305 secs
lola: 74714629 markings, 243037483 edges, 186464 markings/sec, 310 secs
lola: 75756420 markings, 246903640 edges, 208358 markings/sec, 315 secs
lola: 76669886 markings, 250586255 edges, 182693 markings/sec, 320 secs
lola: 77438082 markings, 253852805 edges, 153639 markings/sec, 325 secs
lola: 78295276 markings, 257432262 edges, 171439 markings/sec, 330 secs
lola: 79099338 markings, 260964896 edges, 160812 markings/sec, 335 secs
lola: 79996406 markings, 264485200 edges, 179414 markings/sec, 340 secs
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
terminate called after throwing an instance of 'std::runtime_error'
what(): parse error at position 0: unexpected character, last read: '\ufffd'
Aborted (core dumped)
FORMULA ClientsAndServers-PT-N0020P1-CTLFireability-0 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ClientsAndServers-PT-N0020P1-CTLFireability-1 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ClientsAndServers-PT-N0020P1-CTLFireability-2 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ClientsAndServers-PT-N0020P1-CTLFireability-3 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ClientsAndServers-PT-N0020P1-CTLFireability-4 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ClientsAndServers-PT-N0020P1-CTLFireability-5 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ClientsAndServers-PT-N0020P1-CTLFireability-6 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ClientsAndServers-PT-N0020P1-CTLFireability-7 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ClientsAndServers-PT-N0020P1-CTLFireability-8 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ClientsAndServers-PT-N0020P1-CTLFireability-9 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ClientsAndServers-PT-N0020P1-CTLFireability-10 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ClientsAndServers-PT-N0020P1-CTLFireability-11 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ClientsAndServers-PT-N0020P1-CTLFireability-12 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ClientsAndServers-PT-N0020P1-CTLFireability-13 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ClientsAndServers-PT-N0020P1-CTLFireability-14 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ClientsAndServers-PT-N0020P1-CTLFireability-15 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stderr -----
----- Kill lola and sara stdout -----
----- Finished stdout -----
----- Finished stderr -----

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="ClientsAndServers-PT-N0020P1"
export BK_EXAMINATION="CTLFireability"
export BK_TOOL="irma4mcc-full"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-3637"
echo " Executing tool irma4mcc-full"
echo " Input is ClientsAndServers-PT-N0020P1, 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 r042-smll-152646358700116"
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 ;