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 224K
-rw-r--r-- 1 mcc users 4.4K 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 4.2K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 20K 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 3.3K May 15 18:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 12K May 15 18:54 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.0K May 15 18:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 13K May 15 18:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 5.4K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 22K May 15 18:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 114 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 352 May 15 18:54 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 4.0K 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 2.2K May 15 18:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.6K May 15 18:54 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 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 29K May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool mcc4mcc-full
Input is DatabaseWithMutex-PT-02, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r082-blw3-152649949300040
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1527403072915


BK_STOP 1527403115782

--------------------
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 DatabaseWithMutex-PT-02 as instance name.
Using DatabaseWithMutex as model name.
Using algorithm or tool bmdt.
Model characteristics are: {'Examination': 'ReachabilityCardinality', 'Place/Transition': True, 'Colored': True, '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': True, 'Live': True}.
Known tools are: [{'Time': 116, 'Memory': 100.54, 'Tool': 'gspn'}, {'Time': 263, 'Memory': 106.39, 'Tool': 'lola'}, {'Time': 396, 'Memory': 106.14, 'Tool': 'lola'}, {'Time': 3744, 'Memory': 160.57, 'Tool': 'gspn'}, {'Time': 4176, 'Memory': 263.72, 'Tool': 'itstools'}, {'Time': 4219, 'Memory': 2205.52, 'Tool': 'marcie'}, {'Time': 4483, 'Memory': 2205.28, 'Tool': 'marcie'}, {'Time': 4669, 'Memory': 264.17, 'Tool': 'itstools'}].
Learned tools are: [{'Tool': 'lola'}].
Learned tool lola is 2.2672413793103448x far from the best tool gspn.
ReachabilityCardinality lola DatabaseWithMutex-PT-02...
----- Start make prepare stderr -----

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


checking for too many tokens
===========================================================================================
DatabaseWithMutex-PT-02: translating PT formula ReachabilityCardinality into LoLA format
===========================================================================================
translating formula complete
touch formulae;
----- Start make result stderr -----
----- Start make result stdout -----
ReachabilityCardinality @ DatabaseWithMutex-PT-02 @ 3540 seconds
----- Start make result stderr -----
----- Start make result stdout -----
lola: LoLA will run for 3540 seconds at most (--timelimit)
lola: NET
lola: reading net from model.pnml.lola
lola: finished parsing
lola: closed net file model.pnml.lola
lola: 70/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: finding significant places
lola: 38 places, 32 transitions, 28 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 46 transition conflict sets
lola: TASK
lola: reading formula from DatabaseWithMutex-PT-02-ReachabilityCardinality.task
lola: A (G ((updating_1_1 + updating_2_1 + updating_2_2 + updating_1_2 + 1 <= all_active_1 + all_active_2))) : E (F ((2 <= Active_2_1 + Active_2_2 + Active_1_1 + Active_1_2))) : A (G ((2 <= WaitMutex_1_1 + WaitMutex_1_2 + WaitMutex_2_1 + WaitMutex_2_2))) : A (G ((2 <= MesBuffReply_1_1 + MesBuffReply_1_2 + MesBuffReply_2_1 + MesBuffReply_2_2))) : E (F (((2 <= updating_1_1 + updating_2_1 + updating_2_2 + updating_1_2) OR (Modify_1_1 + Modify_1_2 + Modify_2_1 + Modify_2_2 <= updating_1_1 + updating_2_1 + updating_2_2 + updating_1_2) OR ((3 <= RecBuff_1_1 + RecBuff_1_2 + RecBuff_2_1 + RecBuff_2_2) AND (MesBuffReply_1_1 + MesBuffReply_1_2 + MesBuffReply_2_1 + MesBuffReply_2_2 <= WaitMutex_1_1 + WaitMutex_1_2 + WaitMutex_2_1 + WaitMutex_2_2)) OR (((1 <= updating_1_1 + updating_2_1 + updating_2_2 + updating_1_2) OR (2 <= Acknowledge_1_1 + Acknowledge_1_2 + Acknowledge_2_1 + Acknowledge_2_2)) AND ((Acknowledge_1_1 + Acknowledge_1_2 + Acknowledge_2_1 + Acknowledge_2_2 <= updating_1_1 + updating_2_1 + updating_2_2 + updating_1_2) OR (2 <= updating_1_1 + updating_2_1 + updating_2_2 + updating_1_2)))))) : E (F ((((Active_2_1 + Active_2_2 + Active_1_1 + Active_1_2 <= 2) AND (Message_1_1 + Message_1_2 + Message_2_1 + Message_2_2 <= 2)) OR (all_passive_1 + all_passive_2 <= 0)))) : E (F (((Message_1_1 + Message_1_2 + Message_2_1 + Message_2_2 <= all_passive_1 + all_passive_2) AND (1 <= MesBuffReply_1_1 + MesBuffReply_1_2 + MesBuffReply_2_1 + MesBuffReply_2_2)))) : E (F (((updating_1_1 + updating_2_1 + updating_2_2 + updating_1_2 + 1 <= all_active_1 + all_active_2) AND (Acknowledge_1_1 + Acknowledge_1_2 + Acknowledge_2_1 + Acknowledge_2_2 <= 0)))) : E (F ((((MesBuffReply_1_2 <= WaitMutex_2_1) OR (2 <= Message_1_1)) AND ((3 <= Message_2_1) OR (3 <= Active_2_1)) AND ((Modify_1_2 + 1 <= Message_2_2) OR (RecBuff_1_1 + 1 <= all_passive_1))))) : A (G (((Modify_2_2 <= WaitMutex_1_1) AND (Message_1_2 <= all_active_2)))) : E (F ((Modify_2_1 + 1 <= RecBuff_1_1))) : E (F (((1 <= Acknowledge_2_2) OR (2 <= WaitMutex_1_2) OR (Acknowledge_2_2 <= 2) OR (Mutex_2 <= MesBuffReply_2_2) OR (WaitMutex_2_2 <= 2)))) : A (G (((Modify_2_1 <= Acknowledge_2_1) OR (1 <= all_active_1) OR (RecBuff_2_1 + 1 <= MesBuffReply_1_2) OR (3 <= WaitMutex_1_2)))) : E (F (((2 <= Message_2_2) AND (2 <= RecBuff_1_1)))) : A (G ((((updating_2_2 <= 0) OR (2 <= all_passive_1)) AND ((3 <= MesBuffReply_2_2) OR (WaitMutex_1_1 <= Active_1_1) OR (WaitMutex_1_2 + 1 <= Acknowledge_2_1))))) : A (G (((MesBuffReply_1_1 <= 2) OR (all_passive_1 <= all_active_1) OR ((RecBuff_2_2 <= 1) AND (Message_2_1 + 1 <= Message_1_1)))))
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((updating_1_1 + updating_2_1 + updating_2_2 + updating_1_2 + 1 <= all_active_1 + all_active_2)))
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 112 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: 3 markings, 2 edges
lola: ========================================
lola: subprocess 1 will run for 236 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((2 <= Active_2_1 + Active_2_2 + Active_1_1 + Active_1_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 112 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: state equation: write sara problem file to DatabaseWithMutex-PT-02-ReachabilityCardinality.sara
lola: The predicate is reachable.
lola: 7 markings, 6 edges
lola: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: state equation: calling and running sara
lola: ========================================
lola: ...considering subproblem: A (G ((2 <= WaitMutex_1_1 + WaitMutex_1_2 + WaitMutex_2_1 + WaitMutex_2_2)))
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 112 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: 0 markings, 0 edges
lola: ========================================
lola: subprocess 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((2 <= MesBuffReply_1_1 + MesBuffReply_1_2 + MesBuffReply_2_1 + MesBuffReply_2_2)))
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 112 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: 0 markings, 0 edges
lola: ========================================
lola: subprocess 4 will run for 295 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((2 <= updating_1_1 + updating_2_1 + updating_2_2 + updating_1_2) OR (Modify_1_1 + Modify_1_2 + Modify_2_1 + Modify_2_2 <= updating_1_1 + updating_2_1 + updating_2_2 + updating_1_2) OR ((3 <= RecBuff_1_1 + RecBuff_1_2 + RecBuff_2_1 + RecBuff_2_2) AND (MesBuffReply_1_1 + MesBuffReply_1_2 + MesBuffReply_2_1 + MesBuffReply_2_2 <= WaitMutex_1_1 + WaitMutex_1_2 + WaitMutex_2_1 + WaitMutex_2_2))... (shortened)
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 112 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 0 markings, 0 edges
lola: ========================================
sara: try reading problem file DatabaseWithMutex-PT-02-ReachabilityCardinality.sara.
sara: place or transition ordering is non-deterministic

lola: subprocess 5 will run for 321 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((((Active_2_1 + Active_2_2 + Active_1_1 + Active_1_2 <= 2) AND (Message_1_1 + Message_1_2 + Message_2_1 + Message_2_2 <= 2)) OR (all_passive_1 + all_passive_2 <= 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 112 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: state equation: Generated DNF with 3 literals and 2 conjunctive subformulas
lola: 0 markings, 0 edges
lola: state equation: write sara problem file to DatabaseWithMutex-PT-02-ReachabilityCardinality-5.sara
lola: ========================================
lola: subprocess 6 will run for 354 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((Message_1_1 + Message_1_2 + Message_2_1 + Message_2_2 <= all_passive_1 + all_passive_2) AND (1 <= MesBuffReply_1_1 + MesBuffReply_1_2 + MesBuffReply_2_1 + MesBuffReply_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 112 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: state equation: write sara problem file to DatabaseWithMutex-PT-02-ReachabilityCardinality-6.sara
lola: The predicate is reachable.
lola: 7 markings, 6 edges
lola: ========================================
lola: state equation: calling and running sara
lola: subprocess 7 will run for 393 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((updating_1_1 + updating_2_1 + updating_2_2 + updating_1_2 + 1 <= all_active_1 + all_active_2) AND (Acknowledge_1_1 + Acknowledge_1_2 + Acknowledge_2_1 + Acknowledge_2_2 <= 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 112 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 DatabaseWithMutex-PT-02-ReachabilityCardinality-7.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 8 will run for 442 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((((MesBuffReply_1_2 <= WaitMutex_2_1) OR (2 <= Message_1_1)) AND ((3 <= Message_2_1) OR (3 <= Active_2_1)) AND ((Modify_1_2 + 1 <= Message_2_2) OR (RecBuff_1_1 + 1 <= all_passive_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 112 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 24 literals and 8 conjunctive subformulas
sara: try reading problem file DatabaseWithMutex-PT-02-ReachabilityCardinality-6.sara.
sara: place or transition ordering is non-deterministic

lola: state equation: write sara problem file to DatabaseWithMutex-PT-02-ReachabilityCardinality-8.sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is unreachable.
lola: 149 markings, 223 edges
lola: state equation: calling and running sara
lola: ========================================
sara: try reading problem file DatabaseWithMutex-PT-02-ReachabilityCardinality-8.sara.
sara: place or transition ordering is non-deterministic
lola: subprocess 9 will run for 505 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((Modify_2_2 <= WaitMutex_1_1) AND (Message_1_2 <= all_active_2))))
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 112 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 19 markings, 20 edges
lola: ========================================
lola: subprocess 10 will run for 590 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((Modify_2_1 + 1 <= RecBuff_1_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 112 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 5 markings, 4 edges
lola: ========================================

lola: subprocess 11 will run for 708 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((1 <= Acknowledge_2_2) OR (2 <= WaitMutex_1_2) OR (Acknowledge_2_2 <= 2) OR (Mutex_2 <= MesBuffReply_2_2) OR (WaitMutex_2_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 112 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 5 literals and 5 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: state equation: write sara problem file to DatabaseWithMutex-PT-02-ReachabilityCardinality-11.sara
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 12 will run for 885 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((Modify_2_1 <= Acknowledge_2_1) OR (1 <= all_active_1) OR (RecBuff_2_1 + 1 <= MesBuffReply_1_2) OR (3 <= WaitMutex_1_2))))
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 112 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 4 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: state equation: write sara problem file to DatabaseWithMutex-PT-02-ReachabilityCardinality-12.sara
lola: The predicate is not invariant.
lola: 4 markings, 3 edges
lola: state equation: calling and running sara
lola: ========================================
lola: subprocess 13 will run for 1180 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((2 <= Message_2_2) AND (2 <= RecBuff_1_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 112 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 DatabaseWithMutex-PT-02-ReachabilityCardinality-13.sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is unreachable.
lola: 111 markings, 140 edges
lola: ========================================
sara: try reading problem file DatabaseWithMutex-PT-02-ReachabilityCardinality-12.sara.
lola: state equation: calling and running sara
sara: place or transition ordering is non-deterministic

lola: subprocess 14 will run for 1770 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((((updating_2_2 <= 0) OR (2 <= all_passive_1)) AND ((3 <= MesBuffReply_2_2) OR (WaitMutex_1_1 <= Active_1_1) OR (WaitMutex_1_2 + 1 <= Acknowledge_2_1)))))
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 112 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 5 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to DatabaseWithMutex-PT-02-ReachabilityCardinality-14.sara
lola: state equation: calling and running saralola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 2 markings, 1 edges
lola: ========================================
lola: subprocess 15 will run for 3540 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((MesBuffReply_1_1 <= 2) OR (all_passive_1 <= all_active_1) OR ((RecBuff_2_2 <= 1) AND (Message_2_1 + 1 <= Message_1_1)))))
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 112 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 6 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to DatabaseWithMutex-PT-02-ReachabilityCardinality-15.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
sara: try reading problem file DatabaseWithMutex-PT-02-ReachabilityCardinality-13.sara.lola:
The predicate is invariant.
lola: 131 markings, 209 edges
lola: ========================================
lola: RESULT
lola:
SUMMARY: no yes no no yes yes yes yes no no yes yes no no no yes
lola: state equation: calling and running sara
sara: place or transition ordering is non-deterministic

sara: try reading problem file DatabaseWithMutex-PT-02-ReachabilityCardinality-15.sara.
sara: place or transition ordering is non-deterministic

FORMULA DatabaseWithMutex-PT-02-ReachabilityCardinality-0 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DatabaseWithMutex-PT-02-ReachabilityCardinality-1 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DatabaseWithMutex-PT-02-ReachabilityCardinality-2 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DatabaseWithMutex-PT-02-ReachabilityCardinality-3 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DatabaseWithMutex-PT-02-ReachabilityCardinality-4 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DatabaseWithMutex-PT-02-ReachabilityCardinality-5 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DatabaseWithMutex-PT-02-ReachabilityCardinality-6 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DatabaseWithMutex-PT-02-ReachabilityCardinality-7 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DatabaseWithMutex-PT-02-ReachabilityCardinality-8 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DatabaseWithMutex-PT-02-ReachabilityCardinality-9 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DatabaseWithMutex-PT-02-ReachabilityCardinality-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DatabaseWithMutex-PT-02-ReachabilityCardinality-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DatabaseWithMutex-PT-02-ReachabilityCardinality-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DatabaseWithMutex-PT-02-ReachabilityCardinality-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DatabaseWithMutex-PT-02-ReachabilityCardinality-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DatabaseWithMutex-PT-02-ReachabilityCardinality-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stdout -----
----- Kill lola and sara stderr -----
----- Finished stdout -----
----- Finished stderr -----

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="DatabaseWithMutex-PT-02"
export BK_EXAMINATION="ReachabilityCardinality"
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/DatabaseWithMutex-PT-02.tgz
mv DatabaseWithMutex-PT-02 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 DatabaseWithMutex-PT-02, examination is ReachabilityCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r082-blw3-152649949300040"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "ReachabilityCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityCardinality" != "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 "ReachabilityCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityCardinality.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 '' ReachabilityCardinality.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 ;