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-full
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 r162-smll-152705514200262
=====================================================================

--------------------
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 1527075322052


BK_STOP 1527075941254

--------------------
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 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': 'lola'}].
Learned tool lola is 1.0x far from the best tool lola.
CTLCardinality lola SwimmingPool-PT-08...
----- Start make prepare stderr -----

Time: 3600 - MCC
----- Start make prepare stdout -----
===========================================================================================
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 stderr -----
----- Start make result stdout -----
CTLCardinality @ SwimmingPool-PT-08 @ 3540 seconds
make: [verify] Error 134 (ignored)
----- Start make result stderr -----
----- Kill lola and sara stderr -----
----- Finished 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: 16/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: finding significant places
lola: 9 places, 7 transitions, 6 significant places
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
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
lola: subprocess 1 will run for 236 seconds at most (--localtimelimit=-1)
lola: ========================================
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: state equation: write sara problem file to SwimmingPool-PT-08-CTLCardinality.sara
lola: 81 markings, 80 edges
lola: ========================================
lola: lola: SUBRESULT
lola: state equation: calling and running sara
result: no
lola: The Boolean predicate is false.
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: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 513 markings, 521 edges
lola: state equation: write sara problem file to SwimmingPool-PT-08-CTLCardinality-3.sara
lola: ========================================
lola: subprocess 4 will run for 294 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
sara: lola: try reading problem file SwimmingPool-PT-08-CTLCardinality.sara.
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 294 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)))
sara: place or transition ordering is non-deterministic
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 353 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: 1480504 markings, 6344529 edges, 3096159597753270272 markings/sec, 0 secs
lola: 2692836 markings, 12016495 edges, 242466 markings/sec, 5 secs
lola: 3824802 markings, 17448531 edges, 226393 markings/sec, 10 secs
lola: 4893700 markings, 22679914 edges, 213780 markings/sec, 15 secs
lola: 5927162 markings, 27781082 edges, 206692 markings/sec, 20 secs
lola: 6930699 markings, 32760039 edges, 200707 markings/sec, 25 secs
lola: 7909465 markings, 37662412 edges, 195753 markings/sec, 30 secs
lola: 8851720 markings, 42414333 edges, 188451 markings/sec, 35 secs
lola: 9756117 markings, 46985903 edges, 180879 markings/sec, 40 secs
lola: 10663003 markings, 51579451 edges, 181377 markings/sec, 45 secs
lola: 11559298 markings, 56115768 edges, 179259 markings/sec, 50 secs
lola: 12449980 markings, 60637399 edges, 178136 markings/sec, 55 secs
lola: 13330720 markings, 65122688 edges, 176148 markings/sec, 60 secs
lola: 14196990 markings, 69554757 edges, 173254 markings/sec, 65 secs
lola: 15055757 markings, 73960687 edges, 171753 markings/sec, 70 secs
lola: 15913328 markings, 78361411 edges, 171514 markings/sec, 75 secs
lola: 16766020 markings, 82743250 edges, 170538 markings/sec, 80 secs
lola: 17608080 markings, 87091277 edges, 168412 markings/sec, 85 secs
lola: 18443286 markings, 91421114 edges, 167041 markings/sec, 90 secs
lola: 19268414 markings, 95708772 edges, 165026 markings/sec, 95 secs
lola: 20094770 markings, 99981730 edges, 165271 markings/sec, 100 secs
lola: 20913816 markings, 104239096 edges, 163809 markings/sec, 105 secs
lola: 21724624 markings, 108464257 edges, 162162 markings/sec, 110 secs
lola: 22527841 markings, 112660058 edges, 160643 markings/sec, 115 secs
lola: 23320333 markings, 116822818 edges, 158498 markings/sec, 120 secs
lola: 24112770 markings, 120975027 edges, 158487 markings/sec, 125 secs
lola: 24904264 markings, 125117515 edges, 158299 markings/sec, 130 secs
lola: 25692341 markings, 129243538 edges, 157615 markings/sec, 135 secs
lola: 26471241 markings, 133333690 edges, 155780 markings/sec, 140 secs
lola: 27251451 markings, 137424973 edges, 156042 markings/sec, 145 secs
lola: 28024961 markings, 141486931 edges, 154702 markings/sec, 150 secs
lola: 28799617 markings, 145549162 edges, 154931 markings/sec, 155 secs
lola: 29565401 markings, 149581400 edges, 153157 markings/sec, 160 secs
lola: 30331300 markings, 153613324 edges, 153180 markings/sec, 165 secs
lola: 31096032 markings, 157625651 edges, 152946 markings/sec, 170 secs
lola: 31720932 markings, 160912659 edges, 124980 markings/sec, 175 secs
lola: 32371454 markings, 164351764 edges, 130104 markings/sec, 180 secs
lola: 33029228 markings, 167810597 edges, 131555 markings/sec, 185 secs
lola: 33689179 markings, 171284611 edges, 131990 markings/sec, 190 secs
lola: 34348770 markings, 174763412 edges, 131918 markings/sec, 195 secs
lola: 35008085 markings, 178236665 edges, 131863 markings/sec, 200 secs
lola: 35670461 markings, 181727906 edges, 132475 markings/sec, 205 secs
lola: 36317266 markings, 185146596 edges, 129361 markings/sec, 210 secs
lola: 37014403 markings, 188830377 edges, 139427 markings/sec, 215 secs
lola: 37756548 markings, 192747412 edges, 148429 markings/sec, 220 secs
lola: 38491752 markings, 196639793 edges, 147041 markings/sec, 225 secs
lola: 39228249 markings, 200536806 edges, 147299 markings/sec, 230 secs
lola: 39959741 markings, 204413199 edges, 146298 markings/sec, 235 secs
lola: 40680326 markings, 208253238 edges, 144117 markings/sec, 240 secs
lola: 41414167 markings, 212140702 edges, 146768 markings/sec, 245 secs
lola: 42149393 markings, 216029359 edges, 147045 markings/sec, 250 secs
lola: 42881933 markings, 219916273 edges, 146508 markings/sec, 255 secs
lola: 43607593 markings, 223779866 edges, 145132 markings/sec, 260 secs
lola: 44338693 markings, 227656305 edges, 146220 markings/sec, 265 secs
lola: 45059413 markings, 231495982 edges, 144144 markings/sec, 270 secs
lola: 45774338 markings, 235317624 edges, 142985 markings/sec, 275 secs
lola: 46497658 markings, 239170506 edges, 144664 markings/sec, 280 secs
lola: 47228086 markings, 243042404 edges, 146086 markings/sec, 285 secs
lola: 47943777 markings, 246875453 edges, 143138 markings/sec, 290 secs
lola: 48657370 markings, 250693715 edges, 142719 markings/sec, 295 secs
lola: 49368768 markings, 254509772 edges, 142280 markings/sec, 300 secs
lola: 50076988 markings, 258315544 edges, 141644 markings/sec, 305 secs
lola: 50784420 markings, 262108786 edges, 141486 markings/sec, 310 secs
lola: 51496068 markings, 265910243 edges, 142330 markings/sec, 315 secs
lola: 52209245 markings, 269728349 edges, 142635 markings/sec, 320 secs
lola: 52918056 markings, 273525417 edges, 141762 markings/sec, 325 secs
lola: 53582786 markings, 277089592 edges, 132946 markings/sec, 330 secs
lola: 54289318 markings, 280885355 edges, 141306 markings/sec, 335 secs
lola: 54988669 markings, 284652736 edges, 139870 markings/sec, 340 secs
lola: 55698115 markings, 288446804 edges, 141889 markings/sec, 345 secs
lola: 56385236 markings, 292119961 edges, 137424 markings/sec, 350 secs
lola: 57082860 markings, 295878577 edges, 139525 markings/sec, 355 secs
lola: 57787403 markings, 299658197 edges, 140909 markings/sec, 360 secs
lola: 58488139 markings, 303425220 edges, 140147 markings/sec, 365 secs
lola: 59179976 markings, 307164311 edges, 138367 markings/sec, 370 secs
lola: 59881922 markings, 310928572 edges, 140389 markings/sec, 375 secs
lola: 60586511 markings, 314703737 edges, 140918 markings/sec, 380 secs
lola: 61282853 markings, 318449553 edges, 139268 markings/sec, 385 secs
lola: 61979114 markings, 322196815 edges, 139252 markings/sec, 390 secs
lola: 62671481 markings, 325928411 edges, 138473 markings/sec, 395 secs
lola: 63359365 markings, 329646396 edges, 137577 markings/sec, 400 secs
lola: 64053158 markings, 333384285 edges, 138759 markings/sec, 405 secs
lola: 64749849 markings, 337128822 edges, 139338 markings/sec, 410 secs
lola: 65445737 markings, 340868626 edges, 139178 markings/sec, 415 secs
lola: 66141337 markings, 344608728 edges, 139120 markings/sec, 420 secs
lola: 66839111 markings, 348357135 edges, 139555 markings/sec, 425 secs
lola: 67529979 markings, 352080697 edges, 138174 markings/sec, 430 secs
lola: 68224592 markings, 355816207 edges, 138923 markings/sec, 435 secs
lola: 68921524 markings, 359560268 edges, 139386 markings/sec, 440 secs
lola: 69606367 markings, 363261322 edges, 136969 markings/sec, 445 secs
lola: 70293218 markings, 366965836 edges, 137370 markings/sec, 450 secs
lola: 70980341 markings, 370671368 edges, 137425 markings/sec, 455 secs
lola: 71662952 markings, 374361318 edges, 136522 markings/sec, 460 secs
lola: 72343719 markings, 378046377 edges, 136153 markings/sec, 465 secs
lola: 73022209 markings, 381722925 edges, 135698 markings/sec, 470 secs
lola: 73707447 markings, 385418054 edges, 137048 markings/sec, 475 secs
lola: 74392838 markings, 389113227 edges, 137078 markings/sec, 480 secs
lola: 75070776 markings, 392782104 edges, 135588 markings/sec, 485 secs
lola: 75757098 markings, 396479691 edges, 137264 markings/sec, 490 secs
lola: 76434729 markings, 400144203 edges, 135526 markings/sec, 495 secs
lola: 77109810 markings, 403805846 edges, 135016 markings/sec, 500 secs
lola: 77783306 markings, 407458137 edges, 134699 markings/sec, 505 secs
lola: 78458422 markings, 411116808 edges, 135023 markings/sec, 510 secs
lola: 79140093 markings, 414793950 edges, 136334 markings/sec, 515 secs
lola: 79812643 markings, 418443878 edges, 134510 markings/sec, 520 secs
lola: 80490141 markings, 422104061 edges, 135500 markings/sec, 525 secs
lola: 81143303 markings, 425652480 edges, 130632 markings/sec, 530 secs
lola: 81798324 markings, 429199514 edges, 131004 markings/sec, 535 secs
lola: 82463281 markings, 432784454 edges, 132991 markings/sec, 540 secs
lola: 83130889 markings, 436408277 edges, 133522 markings/sec, 545 secs
lola: 83810619 markings, 440069727 edges, 135946 markings/sec, 550 secs
lola: 84480889 markings, 443700668 edges, 134054 markings/sec, 555 secs
lola: 85147936 markings, 447317805 edges, 133409 markings/sec, 560 secs
lola: 85816356 markings, 450943195 edges, 133684 markings/sec, 565 secs
lola: 86485739 markings, 454568492 edges, 133877 markings/sec, 570 secs
lola: 87156612 markings, 458200690 edges, 134175 markings/sec, 575 secs
lola: 87825339 markings, 461818327 edges, 133745 markings/sec, 580 secs
lola: 88499666 markings, 465460599 edges, 134865 markings/sec, 585 secs
lola: 89164918 markings, 469070803 edges, 133050 markings/sec, 590 secs
lola: 89836112 markings, 472698441 edges, 134239 markings/sec, 595 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-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/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-full"
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 r162-smll-152705514200262"
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 ;