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 240K
-rw-r--r-- 1 mcc users 3.3K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 18K 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 17K May 15 18:54 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K May 15 18:50 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K May 15 18:50 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 2.5K May 26 09:27 LTLCardinality.txt
-rw-r--r-- 1 mcc users 11K May 26 09:27 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K May 26 09:27 LTLFireability.txt
-rw-r--r-- 1 mcc users 9.7K May 26 09:27 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 18K May 15 18:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 116 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 354 May 15 18:54 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 3.3K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 21K 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:50 equiv_col
-rw-r--r-- 1 mcc users 9 May 15 18:50 instance
-rw-r--r-- 1 mcc users 6 May 15 18:50 iscolored
-rw-r--r-- 1 mcc users 68K May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool mcc4mcc-full
Input is ResAllocation-PT-R003C010, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r142-qhx2-152673584000346
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1527971031973


BK_STOP 1527971104092

--------------------
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 ResAllocation-PT-R003C010 as instance name.
Using ResAllocation 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': True, 'Deadlock': True, 'Reversible': False, 'Quasi Live': True, 'Live': False}.
Known tools are: [{'Time': 302, 'Memory': 101.13, 'Tool': 'gspn'}, {'Time': 1809, 'Memory': 166.36, 'Tool': 'gspn'}, {'Time': 1900, 'Memory': 1804.71, 'Tool': 'marcie'}, {'Time': 1986, 'Memory': 1743.68, 'Tool': 'marcie'}, {'Time': 6369, 'Memory': 358.18, 'Tool': 'itstools'}, {'Time': 7263, 'Memory': 355.84, 'Tool': 'itstools'}, {'Time': 13174, 'Memory': 249.3, 'Tool': 'lola'}, {'Time': 16817, 'Memory': 255.63, 'Tool': 'lola'}].
Learned tools are: [{'Tool': 'lola'}].
Learned tool lola is 43.62251655629139x far from the best tool gspn.
CTLCardinality lola ResAllocation-PT-R003C010...
----- Start make prepare stderr -----

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


checking for too many tokens
===========================================================================================
ResAllocation-PT-R003C010: translating PT formula CTLCardinality into LoLA format
===========================================================================================
translating formula complete
touch formulae;
----- Start make result stdout -----
----- Start make result stderr -----
CTLCardinality @ ResAllocation-PT-R003C010 @ 3538 seconds
----- Start make result stderr -----
----- Start make result stdout -----
lola: LoLA will run for 3538 seconds at most (--timelimit)
lola: NET
lola: reading net from model.pnml.lola
lola: finished parsing
lola: closed net file model.pnml.lola
lola: 100/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: finding significant places
lola: 60 places, 40 transitions, 30 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 70 transition conflict sets
lola: TASK
lola: reading formula from ResAllocation-PT-R003C010-CTLCardinality.task
lola: E (F (A (((2 <= p_9_1) U (3 <= p_4_0))))) : E (F (((2 <= p_6_0) OR A (F ((3 <= r_6_2)))))) : E ((((p_2_2 <= p_9_2) AND (p_6_0 + 1 <= r_9_2)) U A (F ((3 <= r_8_2))))) : ((3 <= p_9_1) OR (E ((TRUE U (2 <= r_9_0))) OR E (G ((3 <= p_8_2))))) : E (F ((2 <= p_2_2))) : (((r_3_0 + 1 <= r_1_2) AND A (G (((p_7_2 <= r_0_1) OR (r_1_1 <= p_8_2))))) OR (E (((1 <= r_6_1) U (2 <= r_0_0))) AND E (F (((p_6_2 <= p_1_0) AND (p_7_2 <= r_8_2)))))) : E (F ((r_9_1 + 1 <= p_6_2))) : A (G (E (X ((p_9_1 <= p_0_0))))) : (E (F (A (G ((p_0_0 <= r_1_0))))) OR A (((2 <= p_0_2) U ((1 <= p_7_0) AND (r_6_0 <= p_7_0))))) : A (G (NOT(A (X ((2 <= r_6_1)))))) : E (F ((((1 <= p_4_1) OR (r_0_1 <= p_3_2)) AND (1 <= p_2_0) AND (3 <= r_8_1)))) : A ((((r_7_1 <= 1) AND (p_2_1 + 1 <= r_1_1)) U E (F ((3 <= r_0_0))))) : A ((E (F ((1 <= p_1_0))) U E (F ((3 <= r_0_1))))) : NOT(A (F (E (F ((3 <= r_2_1)))))) : A (G (NOT(E (F ((2 <= p_0_0)))))) : (E ((((r_5_2 <= r_2_1) OR (2 <= p_3_0)) U (r_6_0 <= p_9_1))) AND NOT(E (((1 <= r_5_1) U (3 <= r_3_0)))))
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (A (((2 <= p_9_1) U (3 <= p_4_0)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(TRUE U A((2 <= p_9_1) U (3 <= p_4_0)))
lola: processed formula length: 40
lola: 2 rewrites
lola: formula mentions 0 of 60 places; total mentions: 0
lola: closed formula file ResAllocation-PT-R003C010-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 4 bytes per marking, with 2 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: 283136 markings, 1506816 edges
lola: ========================================
lola: subprocess 1 will run for 235 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((2 <= p_6_0) OR A (F ((3 <= r_6_2))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 1 will run for 235 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((2 <= p_6_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 4 bytes per marking, with 2 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: state equation: write sara problem file to ResAllocation-PT-R003C010-CTLCardinality.sara
lola: state equation: calling and running sara
sara: try reading problem file ResAllocation-PT-R003C010-CTLCardinality.sara.
sara: place or transition ordering is non-deterministic

lola: state equation: solution impossible
lola: SUBRESULT
lola: result: no
lola: produced by: state equation
lola: The predicate is unreachable.
lola: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (A (F ((3 <= r_6_2)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(TRUE U A(TRUE U (3 <= r_6_2)))
lola: processed formula length: 32
lola: 3 rewrites
lola: formula mentions 0 of 60 places; total mentions: 0
lola: closed formula file ResAllocation-PT-R003C010-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 4 bytes per marking, with 2 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: 311296 markings, 1999472 edges
lola: ========================================
lola: SUBRESULT
lola: 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: E ((((p_2_2 <= p_9_2) AND (p_6_0 + 1 <= r_9_2)) U A (F ((3 <= r_8_2)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(((p_2_2 <= p_9_2) AND (p_6_0 + 1 <= r_9_2)) U A(TRUE U (3 <= r_8_2)))
lola: processed formula length: 71
lola: 2 rewrites
lola: formula mentions 0 of 60 places; total mentions: 0
lola: closed formula file ResAllocation-PT-R003C010-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 4 bytes per marking, with 2 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: 81994 markings, 344318 edges
lola: ========================================
lola: subprocess 3 will run for 271 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((3 <= p_9_1) OR (E ((TRUE U (2 <= r_9_0))) OR E (G ((3 <= p_8_2)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 3 will run for 271 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (3 <= p_9_1)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (3 <= p_9_1)
lola: processed formula length: 12
lola: 2 rewrites
lola: formula mentions 0 of 60 places; total mentions: 0
lola: closed formula file ResAllocation-PT-R003C010-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 4 will run for 294 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((2 <= r_9_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 4 bytes per marking, with 2 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: state equation: write sara problem file to ResAllocation-PT-R003C010-CTLCardinality-4.sara
lola: state equation: calling and running sara
sara: try reading problem file ResAllocation-PT-R003C010-CTLCardinality-4.sara.
sara: place or transition ordering is non-deterministic

lola: state equation: solution impossible
lola: SUBRESULT
lola: result: no
lola: produced by: state equation
lola: The predicate is unreachable.
lola: subprocess 5 will run for 321 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G ((3 <= p_8_2)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U (p_8_2 <= 2)))
lola: processed formula length: 27
lola: 4 rewrites
lola: formula mentions 0 of 60 places; total mentions: 0
lola: closed formula file ResAllocation-PT-R003C010-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 4 bytes per marking, with 2 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 1 markings, 0 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: ========================================
lola: subprocess 4 will run for 294 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((2 <= p_2_2)))
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 4 bytes per marking, with 2 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: state equation: write sara problem file to ResAllocation-PT-R003C010-CTLCardinality-4.sara
lola: state equation: calling and running sara
sara: try reading problem file ResAllocation-PT-R003C010-CTLCardinality-4.sara.
sara: place or transition ordering is non-deterministic

lola: state equation: solution impossible
lola: SUBRESULT
lola: result: no
lola: produced by: state equation
lola: The predicate is unreachable.
lola: ========================================
lola: subprocess 5 will run for 321 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (((r_3_0 + 1 <= r_1_2) AND A (G (((p_7_2 <= r_0_1) OR (r_1_1 <= p_8_2))))) OR (E (((1 <= r_6_1) U (2 <= r_0_0))) AND E (F (((p_6_2 <= p_1_0) AND (p_7_2 <= r_8_2))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 5 will run for 321 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (r_3_0 + 1 <= r_1_2)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (r_3_0 + 1 <= r_1_2)
lola: processed formula length: 20
lola: 0 rewrites
lola: formula mentions 0 of 60 places; total mentions: 0
lola: closed formula file ResAllocation-PT-R003C010-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 6 will run for 353 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (((1 <= r_6_1) U (2 <= r_0_0)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E((1 <= r_6_1) U (2 <= r_0_0))
lola: processed formula length: 30
lola: 1 rewrites
lola: formula mentions 0 of 60 places; total mentions: 0
lola: closed formula file ResAllocation-PT-R003C010-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 4 bytes per marking, with 2 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 170752 markings, 603776 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 6 will run for 353 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((r_9_1 + 1 <= p_6_2)))
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 4 bytes per marking, with 2 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: 10 markings, 10 edges
lola: subprocess 7 will run for 392 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (E (X ((p_9_1 <= p_0_0)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(E(TRUE U NOT(EX((p_9_1 <= p_0_0)))))
lola: processed formula length: 40
lola: 2 rewrites
lola: formula mentions 0 of 60 places; total mentions: 0
lola: closed formula file ResAllocation-PT-R003C010-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 4 bytes per marking, with 2 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: 25 markings, 28 edges
lola: ========================================
lola: ========================================
lola: subprocess 8 will run for 441 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (E (F (A (G ((p_0_0 <= r_1_0))))) OR A (((2 <= p_0_2) U ((1 <= p_7_0) AND (r_6_0 <= p_7_0)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 8 will run for 441 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (A (G ((p_0_0 <= r_1_0)))))
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 (r_1_0 + 1 <= p_0_0))))
lola: processed formula length: 45
lola: 3 rewrites
lola: formula mentions 0 of 60 places; total mentions: 0
lola: closed formula file ResAllocation-PT-R003C010-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 4 bytes per marking, with 2 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: 304256 markings, 1897595 edges
lola: ========================================
lola: subprocess 9 will run for 504 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (((2 <= p_0_2) U ((1 <= p_7_0) AND (r_6_0 <= p_7_0))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (((2 <= p_0_2) U ((1 <= p_7_0) AND (r_6_0 <= p_7_0))))
lola: processed formula: A (((2 <= p_0_2) U ((1 <= p_7_0) AND (r_6_0 <= p_7_0))))
lola: processed formula length: 56
lola: 0 rewrites
lola: formula mentions 0 of 60 places; total mentions: 0
lola: closed formula file ResAllocation-PT-R003C010-CTLCardinality.task
lola: the resulting B\xfcchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 4 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method (--stubborn)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 5 markings, 5 edges
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: ========================================
lola: subprocess 9 will run for 504 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (NOT(A (X ((2 <= r_6_1))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(E(TRUE U NOT(EX((r_6_1 <= 1)))))
lola: processed formula length: 36
lola: 5 rewrites
lola: formula mentions 0 of 60 places; total mentions: 0
lola: closed formula file ResAllocation-PT-R003C010-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 4 bytes per marking, with 2 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: 25 markings, 28 edges
lola: ========================================
lola: subprocess 10 will run for 588 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((((1 <= p_4_1) OR (r_0_1 <= p_3_2)) AND (1 <= p_2_0) AND (3 <= r_8_1))))
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 4 bytes per marking, with 2 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 6 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to ResAllocation-PT-R003C010-CTLCardinality-10.sara
lola: state equation: calling and running sara
sara: try reading problem file ResAllocation-PT-R003C010-CTLCardinality-10.sara.
sara: place or transition ordering is non-deterministic

lola: state equation: solution impossible
lola: SUBRESULT
lola: result: no
lola: produced by: state equation
lola: The predicate is unreachable.
lola: ========================================
lola: subprocess 11 will run for 705 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((((r_7_1 <= 1) AND (p_2_1 + 1 <= r_1_1)) U E (F ((3 <= r_0_0)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(((r_7_1 <= 1) AND (p_2_1 + 1 <= r_1_1)) U E(TRUE U (3 <= r_0_0)))
lola: processed formula length: 67
lola: 2 rewrites
lola: formula mentions 0 of 60 places; total mentions: 0
lola: closed formula file ResAllocation-PT-R003C010-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 4 bytes per marking, with 2 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: 304256 markings, 1349384 edges
lola: ========================================
lola: subprocess 12 will run for 881 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((E (F ((1 <= p_1_0))) U E (F ((3 <= r_0_1)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(E(TRUE U (1 <= p_1_0)) U E(TRUE U (3 <= r_0_1)))
lola: processed formula length: 50
lola: 3 rewrites
lola: formula mentions 0 of 60 places; total mentions: 0
lola: closed formula file ResAllocation-PT-R003C010-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 4 bytes per marking, with 2 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: 304256 markings, 1349568 edges
lola: ========================================
lola: subprocess 13 will run for 1175 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT(A (F (E (F ((3 <= r_2_1))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U E(TRUE U (3 <= r_2_1))))
lola: processed formula length: 37
lola: 9 rewrites
lola: formula mentions 0 of 60 places; total mentions: 0
lola: closed formula file ResAllocation-PT-R003C010-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 4 bytes per marking, with 2 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: 283136 markings, 1223688 edges
lola: ========================================
lola: subprocess 14 will run for 1762 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (NOT(E (F ((2 <= p_0_0))))))
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 4 bytes per marking, with 2 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: state equation: write sara problem file to ResAllocation-PT-R003C010-CTLCardinality-14.sara
lola: state equation: calling and running sara
sara: try reading problem file ResAllocation-PT-R003C010-CTLCardinality-14.sara.
sara: place or transition ordering is non-deterministic

lola: state equation: solution impossible
lola: SUBRESULT
lola: result: yes
lola: produced by: state equation
lola: The predicate is invariant.
lola: ========================================
lola: subprocess 15 will run for 3524 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (E ((((r_5_2 <= r_2_1) OR (2 <= p_3_0)) U (r_6_0 <= p_9_1))) AND NOT(E (((1 <= r_5_1) U (3 <= r_3_0)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 15 will run for 3524 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E ((((r_5_2 <= r_2_1) OR (2 <= p_3_0)) U (r_6_0 <= p_9_1)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(((r_5_2 <= r_2_1) OR (2 <= p_3_0)) U (r_6_0 <= p_9_1))
lola: processed formula length: 57
lola: 5 rewrites
lola: formula mentions 0 of 60 places; total mentions: 0
lola: closed formula file ResAllocation-PT-R003C010-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 4 bytes per marking, with 2 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 8 markings, 9 edges
lola: ========================================
lola: Child process aborted or communication problem between parent and child process
lola: SUBRESULT
lola: result: unknown
lola: The Boolean predicate may be true or false.
lola: ========================================
lola: RESULT
lola:
SUMMARY: no no no no no no yes no no no no no no yes yes unknown
FORMULA ResAllocation-PT-R003C010-CTLCardinality-0 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ResAllocation-PT-R003C010-CTLCardinality-1 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ResAllocation-PT-R003C010-CTLCardinality-2 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ResAllocation-PT-R003C010-CTLCardinality-3 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ResAllocation-PT-R003C010-CTLCardinality-4 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ResAllocation-PT-R003C010-CTLCardinality-5 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ResAllocation-PT-R003C010-CTLCardinality-6 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ResAllocation-PT-R003C010-CTLCardinality-7 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ResAllocation-PT-R003C010-CTLCardinality-8 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ResAllocation-PT-R003C010-CTLCardinality-9 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ResAllocation-PT-R003C010-CTLCardinality-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ResAllocation-PT-R003C010-CTLCardinality-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ResAllocation-PT-R003C010-CTLCardinality-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ResAllocation-PT-R003C010-CTLCardinality-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ResAllocation-PT-R003C010-CTLCardinality-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ResAllocation-PT-R003C010-CTLCardinality-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 stderr -----
----- Finished stdout -----

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="ResAllocation-PT-R003C010"
export BK_EXAMINATION="CTLCardinality"
export BK_TOOL="mcc4mcc-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/ResAllocation-PT-R003C010.tgz
mv ResAllocation-PT-R003C010 execution
cd execution
pwd
ls -lh

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-3637"
echo " Executing tool mcc4mcc-full"
echo " Input is ResAllocation-PT-R003C010, 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 r142-qhx2-152673584000346"
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 ;