fond
Model Checking Contest 2018
8th edition, Bratislava, Slovakia, June 26, 2018
Execution of r142-qhx2-152673583600077
Last Updated
June 26, 2018

About the Execution of M4M.full for QuasiCertifProtocol-PT-10

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
485.860 56344.00 28761.00 1246.50 TTFTTTFFFFTTTTFT normal

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 568K
-rw-r--r-- 1 mcc users 9.5K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 45K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 28K 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.4K May 15 18:50 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.5K May 26 09:27 LTLCardinality.txt
-rw-r--r-- 1 mcc users 20K May 26 09:27 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.1K May 26 09:27 LTLFireability.txt
-rw-r--r-- 1 mcc users 14K May 26 09:27 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.7K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 42K 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.6K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 16K May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 5.7K May 15 18:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 16K 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 290K May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool mcc4mcc-full
Input is QuasiCertifProtocol-PT-10, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r142-qhx2-152673583600077
=====================================================================


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

=== Now, execution of the tool begins

BK_START 1527950695195


BK_STOP 1527950751539

--------------------
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 QuasiCertifProtocol-PT-10 as instance name.
Using QuasiCertifProtocol as model name.
Using algorithm or tool decision-tree.
Model characteristics are: {'Examination': 'ReachabilityFireability', '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': False, 'Source Place': True, 'Sink Place': True, 'Source Transition': False, 'Sink Transition': False, 'Loop Free': True, 'Conservative': False, 'Sub-Conservative': False, 'Nested Units': False, 'Safe': False, 'Deadlock': True, 'Reversible': False, 'Quasi Live': None, 'Live': False}.
Known tools are: [{'Time': 429844, 'Memory': 2392.64, 'Tool': 'lola'}, {'Time': 435063, 'Memory': 2390.24, 'Tool': 'lola'}].
Learned tools are: [{'Tool': 'lola'}].
Learned tool lola is 1.0x far from the best tool lola.
ReachabilityFireability lola QuasiCertifProtocol-PT-10...

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


checking for too many tokens
===========================================================================================
QuasiCertifProtocol-PT-10: translating PT formula ReachabilityFireability into LoLA format
===========================================================================================
translating formula complete
touch formulae;
----- Start make result stdout -----
----- Start make result stderr -----
ReachabilityFireability @ QuasiCertifProtocol-PT-10 @ 3537 seconds
----- Start make result stderr -----
----- Start make result stdout -----
lola: LoLA will run for 3537 seconds at most (--timelimit)
lola: NET
lola: reading net from model.pnml.lola
lola: finished parsing
lola: closed net file model.pnml.lola
lola: 726/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: finding significant places
lola: 550 places, 176 transitions, 175 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 231 transition conflict sets
lola: TASK
lola: reading formula from QuasiCertifProtocol-PT-10-ReachabilityFireability.task
lola: E (F (((NOT FIREABLE(AackCS) AND (FIREABLE(malS4_0) OR FIREABLE(malS4_1) OR FIREABLE(malS4_2) OR FIREABLE(malS4_3) OR FIREABLE(malS4_4) OR FIREABLE(malS4_5) OR FIREABLE(malS4_7) OR FIREABLE(malS4_6) OR FIREABLE(malS4_9) OR FIREABLE(malS4_8) OR FIREABLE(malS4_10)) AND (FIREABLE(AackCS) OR FIREABLE(AreqTS)) AND (FIREABLE(malS1_0) OR FIREABLE(malS1_3) OR FIREABLE(malS1_4) OR FIREABLE(malS1_1) OR FIREABLE(malS1_2) OR FIREABLE(malS1_8) OR FIREABLE(malS1_7) OR FIREABLE(malS1_6) OR FIREABLE(malS1_5) OR FIREABLE(malS1_10) OR FIREABLE(malS1_9))) OR FIREABLE(AendCS)))) : E (F (FIREABLE(AendCS))) : A (G (((NOT FIREABLE(SsendTS_7) AND NOT FIREABLE(SsendTS_8) AND NOT FIREABLE(SsendTS_9) AND NOT FIREABLE(SsendTS_10) AND NOT FIREABLE(SsendTS_3) AND NOT FIREABLE(SsendTS_4) AND NOT FIREABLE(SsendTS_5) AND NOT FIREABLE(SsendTS_6) AND NOT FIREABLE(SsendTS_0) AND NOT FIREABLE(SsendTS_1) AND NOT FIREABLE(SsendTS_2) AND NOT FIREABLE(malS4_0) AND NOT FIREABLE(malS4_1) AND NOT FIREABLE(malS4_2) AND NOT FIREABLE(malS4_3) AND NOT FIREABLE(malS4_4) AND NOT FIREABLE(malS4_5) AND NOT FIREABLE(malS4_7) AND NOT FIREABLE(malS4_6) AND NOT FIREABLE(malS4_9) AND NOT FIREABLE(malS4_8) AND NOT FIREABLE(malS4_10)) OR NOT FIREABLE(AendCS)))) : E (F ((FIREABLE(ScertCS_1) OR FIREABLE(ScertCS_0) OR FIREABLE(ScertCS_3) OR FIREABLE(ScertCS_2) OR FIREABLE(ScertCS_5) OR FIREABLE(ScertCS_4) OR FIREABLE(ScertCS_7) OR FIREABLE(ScertCS_6) OR FIREABLE(ScertCS_8) OR FIREABLE(ScertCS_9) OR FIREABLE(ScertCS_10)))) : E (F ((FIREABLE(SackCS_10) OR FIREABLE(SackCS_9) OR FIREABLE(SackCS_8) OR FIREABLE(SackCS_7) OR FIREABLE(SackCS_6) OR FIREABLE(SackCS_5) OR FIREABLE(SackCS_4) OR FIREABLE(SackCS_0) OR FIREABLE(SackCS_1) OR FIREABLE(SackCS_2) OR FIREABLE(SackCS_3)))) : E (F (FIREABLE(malA5))) : A (G ((FIREABLE(malS1_0) OR FIREABLE(malS1_3) OR FIREABLE(malS1_4) OR FIREABLE(malS1_1) OR FIREABLE(malS1_2) OR FIREABLE(malS1_8) OR FIREABLE(malS1_7) OR FIREABLE(malS1_6) OR FIREABLE(malS1_5) OR FIREABLE(malS1_10) OR FIREABLE(malS1_9) OR FIREABLE(malS5_0) OR FIREABLE(malS5_1) OR FIREABLE(malS5_2) OR FIREABLE(malS5_3) OR FIREABLE(malS5_4) OR FIREABLE(malS5_5) OR FIREABLE(malS5_6) OR FIREABLE(malS5_7) OR FIREABLE(malS5_8) OR FIREABLE(malS5_9) OR FIREABLE(malS5_10)))) : A (G ((NOT FIREABLE(malA2) OR FIREABLE(AreqTS) OR FIREABLE(malS1_0) OR FIREABLE(malS1_3) OR FIREABLE(malS1_4) OR FIREABLE(malS1_1) OR FIREABLE(malS1_2) OR FIREABLE(malS1_8) OR FIREABLE(malS1_7) OR FIREABLE(malS1_6) OR FIREABLE(malS1_5) OR FIREABLE(malS1_10) OR FIREABLE(malS1_9)))) : A (G ((NOT FIREABLE(malS5_1) AND (NOT FIREABLE(malS5_3) OR NOT FIREABLE(malS3_6))))) : E (F ((FIREABLE(ScertCS_0) AND FIREABLE(SsendTS_7) AND FIREABLE(SsendTS_10) AND (NOT FIREABLE(SreqTS_10) OR NOT FIREABLE(CgenCertif_5))))) : E (F (FIREABLE(AreqCS))) : E (F (FIREABLE(CgenCertif_9))) : E (F (FIREABLE(CgenCertif_9))) : E (F ((NOT FIREABLE(CgenCertif_9) AND (FIREABLE(SackCS_2) OR (FIREABLE(malS3_9) AND FIREABLE(malS1_4) AND (FIREABLE(SgetTS_4) OR FIREABLE(SackCS_3))))))) : A (G ((NOT FIREABLE(SackCS_7) OR FIREABLE(malS5_1)))) : E (F ((FIREABLE(Sperform_4) AND (FIREABLE(malS6_5) OR FIREABLE(SgetTS_4) OR NOT FIREABLE(ScertCS_3)) AND (NOT FIREABLE(SackCS_5) OR FIREABLE(malA2)))))
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 (((NOT FIREABLE(AackCS) AND (FIREABLE(malS4_0) OR FIREABLE(malS4_1) OR FIREABLE(malS4_2) OR FIREABLE(malS4_3) OR FIREABLE(malS4_4) OR FIREABLE(malS4_5) OR FIREABLE(malS4_7) OR FIREABLE(malS4_6) OR FIREABLE(malS4_9) OR FIREABLE(malS4_8) OR FIREABLE(malS4_10)) AND (FIREABLE(AackCS) OR FIREABLE(AreqTS)) AND (FIREABLE(malS1_0) OR FIREABLE(malS1_3) OR FIREABLE(malS1_4) OR FIREABLE(ma... (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 700 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: 39 markings, 38 edges
lola: subprocess 1 will run for 235 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ========================================lola:
...considering subproblem: E (F (FIREABLE(AendCS)))
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 700 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 12 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 39 markings, 38 edges
lola: state equation: write sara problem file to QuasiCertifProtocol-PT-10-ReachabilityFireability.sara
lola: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((NOT FIREABLE(SsendTS_7) AND NOT FIREABLE(SsendTS_8) AND NOT FIREABLE(SsendTS_9) AND NOT FIREABLE(SsendTS_10) AND NOT FIREABLE(SsendTS_3) AND NOT FIREABLE(SsendTS_4) AND NOT FIREABLE(SsendTS_5) AND NOT FIREABLE(SsendTS_6) AND NOT FIREABLE(SsendTS_0) AND NOT FIREABLE(SsendTS_1) AND NOT FIREABLE(SsendTS_2) AND NOT FIREABLE(malS4_0) AND NOT FIREABLE(malS4_1) AND NOT FIREABLE(malS4_2) AND NOT F... (shortened)
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 700 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 308 literals and 22 conjunctive subformulas
lola: state equation: write sara problem file to QuasiCertifProtocol-PT-10-ReachabilityFireability-2.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 39 markings, 38 edges
lola: ========================================
lola: subprocess 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(ScertCS_1) OR FIREABLE(ScertCS_0) OR FIREABLE(ScertCS_3) OR FIREABLE(ScertCS_2) OR FIREABLE(ScertCS_5) OR FIREABLE(ScertCS_4) OR FIREABLE(ScertCS_7) OR FIREABLE(ScertCS_6) OR FIREABLE(ScertCS_8) OR FIREABLE(ScertCS_9) OR FIREABLE(ScertCS_10))))
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 700 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 11 literals and 11 conjunctive subformulas
lola: state equation: write sara problem file to QuasiCertifProtocol-PT-10-ReachabilityFireability-3.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 62 markings, 61 edges
lola: ========================================
lola: state equation: calling and running sara
lola: subprocess 4 will run for 294 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(SackCS_10) OR FIREABLE(SackCS_9) OR FIREABLE(SackCS_8) OR FIREABLE(SackCS_7) OR FIREABLE(SackCS_6) OR FIREABLE(SackCS_5) OR FIREABLE(SackCS_4) OR FIREABLE(SackCS_0) OR FIREABLE(SackCS_1) OR FIREABLE(SackCS_2) OR FIREABLE(SackCS_3))))
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 700 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 22 literals and 11 conjunctive subformulas
lola: state equation: write sara problem file to QuasiCertifProtocol-PT-10-ReachabilityFireability-4.sara
sara: try reading problem file QuasiCertifProtocol-PT-10-ReachabilityFireability-3.sara.
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 15 markings, 14 edges
lola: ========================================
lola: subprocess 5 will run for 321 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (FIREABLE(malA5)))
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 700 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: state equation: write sara problem file to QuasiCertifProtocol-PT-10-ReachabilityFireability-5.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 28 markings, 27 edges
lola: ========================================
lola: subprocess 6 will run for 353 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((FIREABLE(malS1_0) OR FIREABLE(malS1_3) OR FIREABLE(malS1_4) OR FIREABLE(malS1_1) OR FIREABLE(malS1_2) OR FIREABLE(malS1_8) OR FIREABLE(malS1_7) OR FIREABLE(malS1_6) OR FIREABLE(malS1_5) OR FIREABLE(malS1_10) OR FIREABLE(malS1_9) OR FIREABLE(malS5_0) OR FIREABLE(malS5_1) OR FIREABLE(malS5_2) OR FIREABLE(malS5_3) OR FIREABLE(malS5_4) OR FIREABLE(malS5_5) OR FIREABLE(malS5_6) ... (shortened)
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 700 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
sara: place or transition ordering is non-deterministic
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 7 markings, 6 edges
lola: ========================================
lola: subprocess 7 will run for 392 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((NOT FIREABLE(malA2) OR FIREABLE(AreqTS) OR FIREABLE(malS1_0) OR FIREABLE(malS1_3) OR FIREABLE(malS1_4) OR FIREABLE(malS1_1) OR FIREABLE(malS1_2) OR FIREABLE(malS1_8) OR FIREABLE(malS1_7) OR FIREABLE(malS1_6) OR FIREABLE(malS1_5) OR FIREABLE(malS1_10) OR FIREABLE(malS1_9))))
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 700 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: 20 markings, 19 edges
lola: ========================================
lola: subprocess 8 will run for 442 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((NOT FIREABLE(malS5_1) AND (NOT FIREABLE(malS5_3) OR NOT FIREABLE(malS3_6)))))
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 700 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 QuasiCertifProtocol-PT-10-ReachabilityFireability-8.sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 30 markings, 29 edges
lola: state equation: calling and running sara
sara: try reading problem file QuasiCertifProtocol-PT-10-ReachabilityFireability-8.sara.

lola: ========================================
lola: subprocess 9 will run for 505 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(ScertCS_0) AND FIREABLE(SsendTS_7) AND FIREABLE(SsendTS_10) AND (NOT FIREABLE(SreqTS_10) OR NOT FIREABLE(CgenCertif_5)))))
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 700 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 78 literals and 13 conjunctive subformulas
lola: state equation: write sara problem file to QuasiCertifProtocol-PT-10-ReachabilityFireability-9.sara
lola: state equation: calling and running sara
sara: try reading problem file QuasiCertifProtocol-PT-10-ReachabilityFireability-9.sara.
sara: place or transition ordering is non-deterministic

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 10 will run for 589 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (FIREABLE(AreqCS)))
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 700 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: state equation: write sara problem file to QuasiCertifProtocol-PT-10-ReachabilityFireability-10.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 14 markings, 13 edges
lola: ========================================
lola: ========================================
lola: subprocess 11 will run for 707 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (FIREABLE(CgenCertif_9)))
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 700 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 12 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to QuasiCertifProtocol-PT-10-ReachabilityFireability-11.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 83 markings, 82 edges
lola: ========================================
lola: subprocess 12 will run for 883 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (FIREABLE(CgenCertif_9)))
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 700 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 12 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to QuasiCertifProtocol-PT-10-ReachabilityFireability-12.sara
lola: lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 83 markings, 82 edges
lola: ========================================
lola: subprocess 13 will run for 1178 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((NOT FIREABLE(CgenCertif_9) AND (FIREABLE(SackCS_2) OR (FIREABLE(malS3_9) AND FIREABLE(malS1_4) AND (FIREABLE(SgetTS_4) OR FIREABLE(SackCS_3)))))))
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 700 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 324 literals and 36 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 15 markings, 14 edges
lola: ========================================
lola: subprocess 14 will run for 1767 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((NOT FIREABLE(SackCS_7) OR FIREABLE(malS5_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 700 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 QuasiCertifProtocol-PT-10-ReachabilityFireability-14.sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 15 markings, 14 edges
lola: ========================================
lola: state equation: calling and running sara
sara: try reading problem file QuasiCertifProtocol-PT-10-ReachabilityFireability-14.sara.
lola: subprocess 15 will run for 3534 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(Sperform_4) AND (FIREABLE(malS6_5) OR FIREABLE(SgetTS_4) OR NOT FIREABLE(ScertCS_3)) AND (NOT FIREABLE(SackCS_5) OR FIREABLE(malA2)))))
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 700 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 72 literals and 9 conjunctive subformulas
lola: state equation: write sara problem file to QuasiCertifProtocol-PT-10-ReachabilityFireability-15.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 28 markings, 27 edges
lola: RESULT
lola:
SUMMARY: yes yes no yes yes yes no no no no yes yes yes yes no yes
lola: ========================================
lola: state equation: calling and running sara
sara: try reading problem file QuasiCertifProtocol-PT-10-ReachabilityFireability-15.sara.
sara: place or transition ordering is non-deterministic

sara: place or transition ordering is non-deterministic

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

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="QuasiCertifProtocol-PT-10"
export BK_EXAMINATION="ReachabilityFireability"
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/QuasiCertifProtocol-PT-10.tgz
mv QuasiCertifProtocol-PT-10 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 QuasiCertifProtocol-PT-10, examination is ReachabilityFireability"
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-152673583600077"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "ReachabilityFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityFireability" != "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 "ReachabilityFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityFireability.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 '' ReachabilityFireability.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 ;