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 164K
-rw-r--r-- 1 mcc users 3.4K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 19K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 15 18:54 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K May 15 18:50 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 5.8K May 15 18:50 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 2.3K May 15 18:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 8.6K May 15 18:54 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.8K May 15 18:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 7.4K 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 15K May 15 18:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 109 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 347 May 15 18:54 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 2.9K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 18K May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 15 18:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 15 18:54 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 15 18:50 equiv_col
-rw-r--r-- 1 mcc users 3 May 15 18:50 instance
-rw-r--r-- 1 mcc users 6 May 15 18:50 iscolored
-rw-r--r-- 1 mcc users 3.9K May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool irma4mcc-structural
Input is SwimmingPool-PT-08, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r163-smll-152705515000262
=====================================================================

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1527075186442


BK_STOP 1527075852776

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

Prefix is 75f5f979.
Reading known information in /usr/share/mcc4mcc/75f5f979-known.json.
Reading learned information in /usr/share/mcc4mcc/75f5f979-learned.json.
Reading value translations in /usr/share/mcc4mcc/75f5f979-values.json.
Using directory /home/mcc/execution for input, as it contains a model.pnml file.
Using SwimmingPool-PT-08 as instance name.
Using SwimmingPool as model name.
Using algorithm or tool bmdt.
Model characteristics are: {'Examination': 'CTLCardinality', 'Place/Transition': True, 'Colored': False, 'Relative-Time': 1, 'Relative-Memory': 1, 'Ordinary': True, 'Simple Free Choice': False, 'Extended Free Choice': False, 'State Machine': False, 'Marked Graph': False, 'Connected': True, 'Strongly Connected': True, 'Source Place': False, 'Sink Place': False, 'Source Transition': False, 'Sink Transition': False, 'Loop Free': True, 'Conservative': False, 'Sub-Conservative': False, 'Nested Units': False, 'Safe': False, 'Deadlock': False, 'Reversible': True, 'Quasi Live': None, 'Live': None}.
Known tools are: [{'Time': 1234902, 'Memory': 15951.57, 'Tool': 'lola'}, {'Time': 1372479, 'Memory': 15951.85, 'Tool': 'lola'}].
Learned tools are: [{'Tool': 'itstools'}].
CTLCardinality lola SwimmingPool-PT-08...

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


checking for too many tokens
===========================================================================================
SwimmingPool-PT-08: translating PT formula CTLCardinality into LoLA format
===========================================================================================
translating formula complete
touch formulae;
----- Start make result stdout -----
----- Start make result stderr -----
CTLCardinality @ SwimmingPool-PT-08 @ 3540 seconds
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: 16/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: finding significant places
lola: 9 places, 7 transitions, 6 significant places
make: [verify] Error 134 (ignored)
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 9 transition conflict sets
lola: TASK
lola: reading formula from SwimmingPool-PT-08-CTLCardinality.task
lola: ((E (X ((Dress + 1 <= Undress))) AND ((Entered <= 2) AND (Bags <= 0) AND (3 <= Bags))) OR (NOT(A (G ((1 <= Bags)))) OR (E (G ((Bags <= WaitBag))) AND (2 <= Dressed)))) : (A (G ((WaitBag + 1 <= Cabins))) AND A (X (E (G ((1 <= Out)))))) : NOT((A (G (TRUE)) AND (Dressed <= WaitBag))) : (E (F (((3 <= Entered) AND (Entered + 1 <= Dress)))) AND (3 <= Out)) : NOT(NOT(NOT(E (G ((WaitBag <= Dress)))))) : A (G (E (X ((WaitBag + 1 <= Out))))) : A (G (E (F ((Undress <= 2))))) : NOT(A (X (E (F ((Out <= Cabins)))))) : E (F (A (G (((2 <= Bags) OR (WaitBag <= Bags)))))) : A (G (A (((2 <= Dressed) U (2 <= Out))))) : (((E (X ((Dress <= WaitBag))) AND (Dressed <= 1)) AND ((Out <= InBath) OR A (F ((1 <= WaitBag))))) OR (((3 <= Entered) OR A (X ((Out <= Bags)))) AND (Bags <= Dress))) : E (F ((A (G ((2 <= Dressed))) AND A (X ((Bags <= Entered)))))) : E (F (NOT(E (G ((2 <= Cabins)))))) : NOT(A (G ((3 <= Out)))) : (A (F (((Cabins <= Bags) AND (2 <= Out) AND (1 <= Undress)))) AND E ((((1 <= Entered) AND (2 <= Dressed)) U ((Dress <= Cabins) OR (Dressed <= Dress))))) : (A ((((Dress <= Bags) AND (Bags <= Dressed)) U (Cabins <= Dress))) OR A (G (((WaitBag + 1 <= Out) OR (Out <= 2)))))
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 (X ((Dress + 1 <= Undress))) AND ((Entered <= 2) AND (Bags <= 0) AND (3 <= Bags))) OR (NOT(A (G ((1 <= Bags)))) OR (E (G ((Bags <= WaitBag))) AND (2 <= Dressed))))
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 (X ((Dress + 1 <= Undress)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: EX((Dress + 1 <= Undress))
lola: processed formula length: 26
lola: 4 rewrites
lola: formula mentions 0 of 9 places; total mentions: 0
lola: closed formula file SwimmingPool-PT-08-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 24 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains EX or AX operators, stubborn sets not applicable
lola: RUNNING
lola: CTL formula contains 0 significant temporal operators and needs 0 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: 0 markings, 0 edges
lola: ========================================
lola: subprocess 1 will run for 236 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((Bags <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 24 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
----- Start make result stderr -----
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 401 markings, 400 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 1 will run for 236 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (A (G ((WaitBag + 1 <= Cabins))) AND A (X (E (G ((1 <= Out))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
----- Kill lola and sara stderr -----
lola: subprocess 1 will run for 236 seconds at most (--localtimelimit=-1)
lola: ========================================
----- Finished stderr -----
lola: ...considering subproblem: A (G ((WaitBag + 1 <= Cabins)))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 24 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 81 markings, 80 edges
lola: state equation: write sara problem file to SwimmingPool-PT-08-CTLCardinality.saralola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================

lola: lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT((A (G (TRUE)) AND (Dressed <= WaitBag)))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (WaitBag + 1 <= Dressed)
lola: processed formula length: 24
lola: 5 rewrites
lola: formula mentions 0 of 9 places; total mentions: 0========================================

lola: closed formula file SwimmingPool-PT-08-CTLCardinality.task
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (E (F (((3 <= Entered) AND (Entered + 1 <= Dress)))) AND (3 <= Out))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((3 <= Entered) AND (Entered + 1 <= Dress))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 24 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to SwimmingPool-PT-08-CTLCardinality-3.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 513 markings, 521 edges
lola: ========================================
lola: subprocess 4 will run for 295 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (3 <= Out)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (3 <= Out)
lola: processed formula length: 10
lola: 0 rewrites
lola: formula mentions 0 of 9 places; total mentions: 0
lola: closed formula file SwimmingPool-PT-08-CTLCardinality.task
lola: processed formula with 1 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 4 will run for 295 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT(NOT(NOT(E (G ((WaitBag <= Dress))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F ((Dress + 1 <= WaitBag)))
lola: processed formula: A (F ((Dress + 1 <= WaitBag)))
lola: processed formula length: 30
lola: 9 rewrites
lola: formula mentions 0 of 9 places; total mentions: 0
lola: closed formula file SwimmingPool-PT-08-CTLCardinality.task
lola: the resulting B\xfcchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 28 bytes per marking, with 31 unused bits
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method (--stubborn)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 162 markings, 161 edges
lola: ========================================
lola: subprocess 5 will run for 321 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (E (X ((WaitBag + 1 <= Out)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(E(TRUE U NOT(EX((WaitBag + 1 <= Out)))))
lola: processed formula length: 44
lola: 2 rewrites
lola: formula mentions 0 of 9 places; total mentions: 0
lola: closed formula file SwimmingPool-PT-08-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 24 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: 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: 160 markings, 159 edges
lola: ========================================
lola: subprocess 6 will run for 354 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (E (F ((Undress <= 2)))))
lola: ========================================
lola: SUBTASK
lola: checking liveness
lola: liveness not yet implemented, converting to CTL...
lola: processed formula: NOT(E(TRUE U NOT(E(TRUE U (Undress <= 2)))))
lola: processed formula length: 44
lola: 2 rewrites
lola: formula mentions 0 of 9 places; total mentions: 0
lola: closed formula file SwimmingPool-PT-08-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 24 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: 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: 1180420 markings, 4308749 edges
lola: ========================================
lola: subprocess 7 will run for 392 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT(A (X (E (F ((Out <= Cabins))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: EX(NOT(E(TRUE U (Out <= Cabins))))
lola: processed formula length: 34
lola: 8 rewrites
lola: formula mentions 0 of 9 places; total mentions: 0
lola: closed formula file SwimmingPool-PT-08-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 24 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: 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: 80 markings, 79 edges
lola: ========================================
lola: subprocess 8 will run for 442 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (A (G (((2 <= Bags) OR (WaitBag <= Bags))))))
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 ((Bags <= 1) AND (Bags + 1 <= WaitBag)))))
lola: processed formula length: 64
lola: 3 rewrites
lola: formula mentions 0 of 9 places; total mentions: 0
lola: closed formula file SwimmingPool-PT-08-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 24 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 1180420 markings, 4729596 edges
lola: ========================================
lola: subprocess 9 will run for 504 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (A (((2 <= Dressed) U (2 <= Out)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(E(TRUE U NOT(A((2 <= Dressed) U (2 <= Out)))))
lola: processed formula length: 50
lola: 2 rewrites
lola: formula mentions 0 of 9 places; total mentions: 0
lola: closed formula file SwimmingPool-PT-08-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 24 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 160 markings, 319 edges
lola: ========================================
lola: subprocess 10 will run for 588 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (((E (X ((Dress <= WaitBag))) AND (Dressed <= 1)) AND ((Out <= InBath) OR A (F ((1 <= WaitBag))))) OR (((3 <= Entered) OR A (X ((Out <= Bags)))) AND (Bags <= Dress)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 10 will run for 588 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (X ((Dress <= WaitBag)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: EX((Dress <= WaitBag))
lola: processed formula length: 22
lola: 2 rewrites
lola: formula mentions 0 of 9 places; total mentions: 0
lola: closed formula file SwimmingPool-PT-08-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 24 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains EX or AX operators, stubborn sets not applicable
lola: RUNNING
lola: CTL formula contains 0 significant temporal operators and needs 0 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: 0 markings, 0 edges
lola: ========================================
lola: subprocess 11 will run for 706 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (Dressed <= 1)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (Dressed <= 1)
lola: processed formula length: 14
lola: 1 rewrites
lola: formula mentions 0 of 9 places; total mentions: 0
lola: closed formula file SwimmingPool-PT-08-CTLCardinality.task
lola: processed formula with 1 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 883 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (Out <= InBath)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (Out <= InBath)
lola: processed formula length: 15
lola: 1 rewrites
lola: formula mentions 0 of 9 places; total mentions: 0
lola: closed formula file SwimmingPool-PT-08-CTLCardinality.task
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 13 will run for 1177 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((1 <= WaitBag)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F ((1 <= WaitBag)))
lola: processed formula: A (F ((1 <= WaitBag)))
lola: processed formula length: 22
lola: 1 rewrites
lola: formula mentions 0 of 9 places; total mentions: 0
lola: closed formula file SwimmingPool-PT-08-CTLCardinality.task
lola: the resulting B\xfcchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 28 bytes per marking, with 31 unused bits
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method (--stubborn)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 162 markings, 161 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 11 will run for 706 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((A (G ((2 <= Dressed))) AND A (X ((Bags <= Entered))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(TRUE U (NOT(E(TRUE U (Dressed <= 1))) AND AX((Bags <= Entered))))
lola: processed formula length: 67
lola: 4 rewrites
lola: formula mentions 0 of 9 places; total mentions: 0
lola: closed formula file SwimmingPool-PT-08-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 24 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: 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: 1373301 markings, 5854239 edges, 3096159597753270272 markings/sec, 0 secs
lola: 2556180 markings, 11361158 edges, 236576 markings/sec, 5 secs
lola: 3661669 markings, 16657468 edges, 221098 markings/sec, 10 secs
lola: 4714495 markings, 21799131 edges, 210565 markings/sec, 15 secs
lola: 5695644 markings, 26629127 edges, 196230 markings/sec, 20 secs
lola: 6590486 markings, 31077113 edges, 178968 markings/sec, 25 secs
lola: 7490280 markings, 35557965 edges, 179959 markings/sec, 30 secs
lola: 8364608 markings, 39955858 edges, 174866 markings/sec, 35 secs
lola: 9253843 markings, 44446560 edges, 177847 markings/sec, 40 secs
lola: 10137125 markings, 48911459 edges, 176656 markings/sec, 45 secs
lola: 10956048 markings, 53065507 edges, 163785 markings/sec, 50 secs
lola: 11743771 markings, 57049475 edges, 157545 markings/sec, 55 secs
lola: 12551856 markings, 61153655 edges, 161617 markings/sec, 60 secs
lola: 13377156 markings, 65359805 edges, 165060 markings/sec, 65 secs
lola: 14185903 markings, 69497798 edges, 161749 markings/sec, 70 secs
lola: 14953945 markings, 73441361 edges, 153608 markings/sec, 75 secs
lola: 15724619 markings, 77389437 edges, 154135 markings/sec, 80 secs
lola: 16491127 markings, 81327293 edges, 153302 markings/sec, 85 secs
lola: 17284706 markings, 85418311 edges, 158716 markings/sec, 90 secs
lola: 18036092 markings, 89314313 edges, 150277 markings/sec, 95 secs
lola: 18826643 markings, 93411701 edges, 158110 markings/sec, 100 secs
lola: 19612594 markings, 97490836 edges, 157190 markings/sec, 105 secs
lola: 20395199 markings, 101544089 edges, 156521 markings/sec, 110 secs
lola: 21124611 markings, 105338979 edges, 145882 markings/sec, 115 secs
lola: 21880839 markings, 109281558 edges, 151246 markings/sec, 120 secs
lola: 22635028 markings, 113224948 edges, 150838 markings/sec, 125 secs
lola: 23383182 markings, 117149053 edges, 149631 markings/sec, 130 secs
lola: 24132684 markings, 121078866 edges, 149900 markings/sec, 135 secs
lola: 24868325 markings, 124928910 edges, 147128 markings/sec, 140 secs
lola: 25589534 markings, 128704487 edges, 144242 markings/sec, 145 secs
lola: 26303750 markings, 132451762 edges, 142843 markings/sec, 150 secs
lola: 27015278 markings, 136189144 edges, 142306 markings/sec, 155 secs
lola: 27728277 markings, 139933564 edges, 142600 markings/sec, 160 secs
lola: 28445451 markings, 143693066 edges, 143435 markings/sec, 165 secs
lola: 29159419 markings, 147441140 edges, 142794 markings/sec, 170 secs
lola: 29868652 markings, 151179435 edges, 141847 markings/sec, 175 secs
lola: 30587493 markings, 154952638 edges, 143768 markings/sec, 180 secs
lola: 31300573 markings, 158699575 edges, 142616 markings/sec, 185 secs
lola: 32005982 markings, 162419713 edges, 141082 markings/sec, 190 secs
lola: 32715179 markings, 166160828 edges, 141839 markings/sec, 195 secs
lola: 33430156 markings, 169915069 edges, 142995 markings/sec, 200 secs
lola: 34136876 markings, 173646606 edges, 141344 markings/sec, 205 secs
lola: 34855742 markings, 177435742 edges, 143773 markings/sec, 210 secs
lola: 35586411 markings, 181284326 edges, 146134 markings/sec, 215 secs
lola: 36285762 markings, 184981435 edges, 139870 markings/sec, 220 secs
lola: 36984563 markings, 188671403 edges, 139760 markings/sec, 225 secs
lola: 37686355 markings, 192381599 edges, 140358 markings/sec, 230 secs
lola: 38358482 markings, 195933487 edges, 134425 markings/sec, 235 secs
lola: 39051017 markings, 199599258 edges, 138507 markings/sec, 240 secs
lola: 39737712 markings, 203238161 edges, 137339 markings/sec, 245 secs
lola: 40415111 markings, 206838022 edges, 135480 markings/sec, 250 secs
lola: 41088516 markings, 210419815 edges, 134681 markings/sec, 255 secs
lola: 41766350 markings, 214006066 edges, 135567 markings/sec, 260 secs
lola: 42442672 markings, 217584678 edges, 135264 markings/sec, 265 secs
lola: 43081401 markings, 220976466 edges, 127746 markings/sec, 270 secs
lola: 43746983 markings, 224516572 edges, 133116 markings/sec, 275 secs
lola: 44416724 markings, 228075389 edges, 133948 markings/sec, 280 secs
lola: 45043846 markings, 231412056 edges, 125424 markings/sec, 285 secs
lola: 45661459 markings, 234716250 edges, 123523 markings/sec, 290 secs
lola: 46287656 markings, 238050594 edges, 125239 markings/sec, 295 secs
lola: 46913948 markings, 241381584 edges, 125258 markings/sec, 300 secs
lola: 47541076 markings, 244717885 edges, 125426 markings/sec, 305 secs
lola: 48155386 markings, 248011975 edges, 122862 markings/sec, 310 secs
lola: 48774788 markings, 251323407 edges, 123880 markings/sec, 315 secs
lola: 49412252 markings, 254744255 edges, 127493 markings/sec, 320 secs
lola: 50079675 markings, 258329891 edges, 133485 markings/sec, 325 secs
lola: 50745003 markings, 261896206 edges, 133066 markings/sec, 330 secs
lola: 51412002 markings, 265464197 edges, 133400 markings/sec, 335 secs
lola: 52084671 markings, 269057451 edges, 134534 markings/sec, 340 secs
lola: 52746386 markings, 272604456 edges, 132343 markings/sec, 345 secs
lola: 53408688 markings, 276154416 edges, 132460 markings/sec, 350 secs
lola: 54069048 markings, 279700206 edges, 132072 markings/sec, 355 secs
lola: 54722651 markings, 283219806 edges, 130721 markings/sec, 360 secs
lola: 55377798 markings, 286737913 edges, 131029 markings/sec, 365 secs
lola: 56037260 markings, 290265791 edges, 131892 markings/sec, 370 secs
lola: 56696390 markings, 293793360 edges, 131826 markings/sec, 375 secs
lola: 57340917 markings, 297267260 edges, 128905 markings/sec, 380 secs
lola: 57995004 markings, 300776750 edges, 130817 markings/sec, 385 secs
lola: 58641278 markings, 304256446 edges, 129255 markings/sec, 390 secs
lola: 59283906 markings, 307718916 edges, 128526 markings/sec, 395 secs
lola: 59930782 markings, 311191247 edges, 129375 markings/sec, 400 secs
lola: 60581124 markings, 314675121 edges, 130068 markings/sec, 405 secs
lola: 61222381 markings, 318124715 edges, 128251 markings/sec, 410 secs
lola: 61860308 markings, 321566491 edges, 127585 markings/sec, 415 secs
lola: 62501708 markings, 325014770 edges, 128280 markings/sec, 420 secs
lola: 63137579 markings, 328445077 edges, 127174 markings/sec, 425 secs
lola: 63775832 markings, 331885072 edges, 127651 markings/sec, 430 secs
lola: 64415785 markings, 335324681 edges, 127991 markings/sec, 435 secs
lola: 65049350 markings, 338741225 edges, 126713 markings/sec, 440 secs
lola: 65689235 markings, 342175515 edges, 127977 markings/sec, 445 secs
lola: 66326775 markings, 345605580 edges, 127508 markings/sec, 450 secs
lola: 66965742 markings, 349037657 edges, 127793 markings/sec, 455 secs
lola: 67598021 markings, 352445660 edges, 126456 markings/sec, 460 secs
lola: 68233049 markings, 355862709 edges, 127006 markings/sec, 465 secs
lola: 68870783 markings, 359287316 edges, 127547 markings/sec, 470 secs
lola: 69480193 markings, 362577722 edges, 121882 markings/sec, 475 secs
lola: 70074613 markings, 365787591 edges, 118884 markings/sec, 480 secs
lola: 70675479 markings, 369025187 edges, 120173 markings/sec, 485 secs
lola: 71266333 markings, 372221631 edges, 118171 markings/sec, 490 secs
lola: 71862043 markings, 375440187 edges, 119142 markings/sec, 495 secs
lola: 72453295 markings, 378639556 edges, 118250 markings/sec, 500 secs
lola: 73045296 markings, 381844585 edges, 118400 markings/sec, 505 secs
lola: 73642010 markings, 385065029 edges, 119343 markings/sec, 510 secs
lola: 74244331 markings, 388308931 edges, 120464 markings/sec, 515 secs
lola: 74837967 markings, 391521515 edges, 118727 markings/sec, 520 secs
lola: 75433680 markings, 394740234 edges, 119143 markings/sec, 525 secs
lola: 76032571 markings, 397972520 edges, 119778 markings/sec, 530 secs
lola: 76632253 markings, 401210099 edges, 119936 markings/sec, 535 secs
lola: 77219250 markings, 404400805 edges, 117399 markings/sec, 540 secs
lola: 77809670 markings, 407601930 edges, 118084 markings/sec, 545 secs
lola: 78409432 markings, 410851669 edges, 119952 markings/sec, 550 secs
lola: 79023206 markings, 414164082 edges, 122755 markings/sec, 555 secs
lola: 79631714 markings, 417461793 edges, 121702 markings/sec, 560 secs
lola: 80264184 markings, 420883503 edges, 126494 markings/sec, 565 secs
lola: 80895125 markings, 424306911 edges, 126188 markings/sec, 570 secs
lola: 81527696 markings, 427735026 edges, 126514 markings/sec, 575 secs
lola: 82165877 markings, 431178437 edges, 127636 markings/sec, 580 secs
lola: 82796791 markings, 434598288 edges, 126183 markings/sec, 585 secs
lola: 83430304 markings, 438022668 edges, 126703 markings/sec, 590 secs
lola: 84066577 markings, 441459192 edges, 127255 markings/sec, 595 secs
lola: 84699700 markings, 444886415 edges, 126625 markings/sec, 600 secs
lola: 85328775 markings, 448297260 edges, 125815 markings/sec, 605 secs
lola: 85956695 markings, 451706236 edges, 125584 markings/sec, 610 secs
lola: 86588723 markings, 455127322 edges, 126406 markings/sec, 615 secs
lola: 87218303 markings, 458535752 edges, 125916 markings/sec, 620 secs
lola: 87823225 markings, 461806506 edges, 120984 markings/sec, 625 secs
lola: 88434295 markings, 465109039 edges, 122214 markings/sec, 630 secs
lola: 89036123 markings, 468378383 edges, 120366 markings/sec, 635 secs
lola: 89646908 markings, 471671454 edges, 122157 markings/sec, 640 secs
lola: 90145410 markings, 474378182 edges, 99700 markings/sec, 645 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 SwimmingPool-PT-08-CTLCardinality-0 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SwimmingPool-PT-08-CTLCardinality-1 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SwimmingPool-PT-08-CTLCardinality-2 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SwimmingPool-PT-08-CTLCardinality-3 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SwimmingPool-PT-08-CTLCardinality-4 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SwimmingPool-PT-08-CTLCardinality-5 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SwimmingPool-PT-08-CTLCardinality-6 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SwimmingPool-PT-08-CTLCardinality-7 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SwimmingPool-PT-08-CTLCardinality-8 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SwimmingPool-PT-08-CTLCardinality-9 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SwimmingPool-PT-08-CTLCardinality-10 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SwimmingPool-PT-08-CTLCardinality-11 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SwimmingPool-PT-08-CTLCardinality-12 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SwimmingPool-PT-08-CTLCardinality-13 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SwimmingPool-PT-08-CTLCardinality-14 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SwimmingPool-PT-08-CTLCardinality-15 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stdout -----
----- Finished stdout -----

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-3637"
echo " Executing tool irma4mcc-structural"
echo " Input is SwimmingPool-PT-08, examination is CTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r163-smll-152705515000262"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "CTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLCardinality" != "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 "CTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLCardinality.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 '' CTLCardinality.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 ;