fond

jQuery Multi Level CSS Menu Css3Menu.com

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

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

Execution Summary
Max Memory
Used (MB)		 Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
2986.260 404775.00 754550.00 1457.90 TTTTTTFTFFFTFTTF 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 1.2M
-rw-r--r-- 1 mcc users 27K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 110K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 26K 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 13K May 26 09:27 LTLCardinality.txt
-rw-r--r-- 1 mcc users 49K May 26 09:27 LTLCardinality.xml
-rw-r--r-- 1 mcc users 4.0K May 26 09:27 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 26 09:27 LTLFireability.xml
-rw-r--r-- 1 mcc users 27K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 107K 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 6.7K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 30K May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 6.2K May 15 18:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 17K 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 686K May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool mcc4mcc-full
Input is QuasiCertifProtocol-PT-18, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r142-qhx2-152673583600084
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1527952010211


BK_STOP 1527952414986

--------------------
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-18 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': 2697266, 'Memory': 12142.59, 'Tool': 'lola'}, {'Time': 2701842, 'Memory': 11647.93, 'Tool': 'lola'}].
Learned tools are: [{'Tool': 'lola'}].
Learned tool lola is 1.0x far from the best tool lola.
ReachabilityFireability lola QuasiCertifProtocol-PT-18...

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


checking for too many tokens
===========================================================================================
QuasiCertifProtocol-PT-18: translating PT formula ReachabilityFireability into LoLA format
===========================================================================================
translating formula complete
touch formulae;
----- Start make result stdout -----
----- Start make result stderr -----
ReachabilityFireability @ QuasiCertifProtocol-PT-18 @ 3538 seconds
----- Start make result stdout -----
----- Start make result stderr -----
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: 1694/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: finding significant places
lola: 1398 places, 296 transitions, 295 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 391 transition conflict sets
lola: TASK
lola: reading formula from QuasiCertifProtocol-PT-18-ReachabilityFireability.task
lola: E (F (FIREABLE(malA5))) : A (G (((NOT FIREABLE(CgenCertif_9) AND NOT FIREABLE(CgenCertif_10) AND NOT FIREABLE(CgenCertif_11) AND NOT FIREABLE(CgenCertif_12) AND NOT FIREABLE(CgenCertif_5) AND NOT FIREABLE(CgenCertif_6) AND NOT FIREABLE(CgenCertif_7) AND NOT FIREABLE(CgenCertif_8) AND NOT FIREABLE(CgenCertif_1) AND NOT FIREABLE(CgenCertif_2) AND NOT FIREABLE(CgenCertif_3) AND NOT FIREABLE(CgenCertif_4) AND NOT FIREABLE(CgenCertif_0) AND NOT FIREABLE(CgenCertif_18) AND NOT FIREABLE(CgenCertif_17) AND NOT FIREABLE(CgenCertif_14) AND NOT FIREABLE(CgenCertif_13) AND NOT FIREABLE(CgenCertif_16) AND NOT FIREABLE(CgenCertif_15)) OR NOT FIREABLE(AreqTS) OR FIREABLE(malA3) OR (FIREABLE(malA5) AND NOT FIREABLE(malA2))))) : E (F (FIREABLE(AackCS))) : E (F ((FIREABLE(SgetTS_6) OR FIREABLE(SgetTS_5) OR FIREABLE(SgetTS_4) OR FIREABLE(SgetTS_3) OR FIREABLE(SgetTS_10) OR FIREABLE(SgetTS_9) OR FIREABLE(SgetTS_8) OR FIREABLE(SgetTS_7) OR FIREABLE(SgetTS_2) OR FIREABLE(SgetTS_1) OR FIREABLE(SgetTS_0) OR FIREABLE(SgetTS_16) OR FIREABLE(SgetTS_15) OR FIREABLE(SgetTS_18) OR FIREABLE(SgetTS_17) OR FIREABLE(SgetTS_12) OR FIREABLE(SgetTS_11) OR FIREABLE(SgetTS_14) OR FIREABLE(SgetTS_13) OR FIREABLE(CsendTS1_18) OR FIREABLE(CsendTS1_16) OR FIREABLE(CsendTS1_17) OR FIREABLE(CsendTS1_14) OR FIREABLE(CsendTS1_15) OR FIREABLE(CsendTS1_12) OR FIREABLE(CsendTS1_13) OR FIREABLE(CsendTS1_10) OR FIREABLE(CsendTS1_11) OR FIREABLE(CsendTS1_7) OR FIREABLE(CsendTS1_6) OR FIREABLE(CsendTS1_9) OR FIREABLE(CsendTS1_8) OR FIREABLE(CsendTS1_3) OR FIREABLE(CsendTS1_2) OR FIREABLE(CsendTS1_5) OR FIREABLE(CsendTS1_4) OR FIREABLE(CsendTS1_1) OR FIREABLE(CsendTS1_0) OR FIREABLE(SgetTS_6) OR FIREABLE(SgetTS_5) OR FIREABLE(SgetTS_4) OR FIREABLE(SgetTS_3) OR FIREABLE(SgetTS_10) OR FIREABLE(SgetTS_9) OR FIREABLE(SgetTS_8) OR FIREABLE(SgetTS_7) OR FIREABLE(SgetTS_2) OR FIREABLE(SgetTS_1) OR FIREABLE(SgetTS_0) OR FIREABLE(SgetTS_16) OR FIREABLE(SgetTS_15) OR FIREABLE(SgetTS_18) OR FIREABLE(SgetTS_17) OR FIREABLE(SgetTS_12) OR FIREABLE(SgetTS_11) OR FIREABLE(SgetTS_14) OR FIREABLE(SgetTS_13) OR ((FIREABLE(SgetTS_6) OR FIREABLE(SgetTS_5) OR FIREABLE(SgetTS_4) OR FIREABLE(SgetTS_3) OR FIREABLE(SgetTS_10) OR FIREABLE(SgetTS_9) OR FIREABLE(SgetTS_8) OR FIREABLE(SgetTS_7) OR FIREABLE(SgetTS_2) OR FIREABLE(SgetTS_1) OR FIREABLE(SgetTS_0) OR FIREABLE(SgetTS_16) OR FIREABLE(SgetTS_15) OR FIREABLE(SgetTS_18) OR FIREABLE(SgetTS_17) OR FIREABLE(SgetTS_12) OR FIREABLE(SgetTS_11) OR FIREABLE(SgetTS_14) OR FIREABLE(SgetTS_13)) AND FIREABLE(AendCS)) OR (NOT FIREABLE(malS1_9) AND NOT FIREABLE(malS1_10) AND NOT FIREABLE(malS1_11) AND NOT FIREABLE(malS1_12) AND NOT FIREABLE(malS1_5) AND NOT FIREABLE(malS1_6) AND NOT FIREABLE(malS1_7) AND NOT FIREABLE(malS1_8) AND NOT FIREABLE(malS1_17) AND NOT FIREABLE(malS1_18) AND NOT FIREABLE(malS1_13) AND NOT FIREABLE(malS1_14) AND NOT FIREABLE(malS1_15) AND NOT FIREABLE(malS1_16) AND NOT FIREABLE(malS1_2) AND NOT FIREABLE(malS1_1) AND NOT FIREABLE(malS1_4) AND NOT FIREABLE(malS1_3) AND NOT FIREABLE(malS1_0) AND NOT FIREABLE(malS4_18) AND NOT FIREABLE(malS4_17) AND NOT FIREABLE(malS4_16) AND NOT FIREABLE(malS4_15) AND NOT FIREABLE(malS4_14) 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_6) AND NOT FIREABLE(malS4_7) AND NOT FIREABLE(malS4_8) AND NOT FIREABLE(malS4_9) AND NOT FIREABLE(malS4_10) AND NOT FIREABLE(malS4_11) AND NOT FIREABLE(malS4_12) AND NOT FIREABLE(malS4_13) AND (NOT FIREABLE(AendCS) OR NOT FIREABLE(AgetTS)))))) : E (F (((FIREABLE(CgenCertif_9) OR FIREABLE(CgenCertif_10) OR FIREABLE(CgenCertif_11) OR FIREABLE(CgenCertif_12) OR FIREABLE(CgenCertif_5) OR FIREABLE(CgenCertif_6) OR FIREABLE(CgenCertif_7) OR FIREABLE(CgenCertif_8) OR FIREABLE(CgenCertif_1) OR FIREABLE(CgenCertif_2) OR FIREABLE(CgenCertif_3) OR FIREABLE(CgenCertif_4) OR FIREABLE(CgenCertif_0) OR FIREABLE(CgenCertif_18) OR FIREABLE(CgenCertif_17) OR FIREABLE(CgenCertif_14) OR FIREABLE(CgenCertif_13) OR FIREABLE(CgenCertif_16) OR FIREABLE(CgenCertif_15) OR FIREABLE(ScertCS_5) OR FIREABLE(ScertCS_4) OR FIREABLE(ScertCS_7) OR FIREABLE(ScertCS_6) OR FIREABLE(ScertCS_1) OR FIREABLE(ScertCS_0) OR FIREABLE(ScertCS_3) OR FIREABLE(ScertCS_2) OR FIREABLE(ScertCS_12) OR FIREABLE(ScertCS_13) OR FIREABLE(ScertCS_14) OR FIREABLE(ScertCS_15) OR FIREABLE(ScertCS_8) OR FIREABLE(ScertCS_9) OR FIREABLE(ScertCS_10) OR FIREABLE(ScertCS_11) OR FIREABLE(ScertCS_16) OR FIREABLE(ScertCS_17) OR FIREABLE(ScertCS_18)) AND (FIREABLE(malS5_0) OR FIREABLE(malS5_17) OR FIREABLE(malS5_18) OR FIREABLE(malS5_2) OR FIREABLE(malS5_1) OR FIREABLE(malS5_4) OR FIREABLE(malS5_3) OR FIREABLE(malS5_6) OR FIREABLE(malS5_5) OR FIREABLE(malS5_8) OR FIREABLE(malS5_7) OR FIREABLE(malS5_10) OR FIREABLE(malS5_9) OR FIREABLE(malS5_12) OR FIREABLE(malS5_11) OR FIREABLE(malS5_14) OR FIREABLE(malS5_13) OR FIREABLE(malS5_16) OR FIREABLE(malS5_15))))) : A (G (((NOT FIREABLE(SreqTS_8) AND NOT FIREABLE(SreqTS_9) AND NOT FIREABLE(SreqTS_6) AND NOT FIREABLE(SreqTS_7) AND NOT FIREABLE(SreqTS_12) AND NOT FIREABLE(SreqTS_13) AND NOT FIREABLE(SreqTS_10) AND NOT FIREABLE(SreqTS_11) AND NOT FIREABLE(SreqTS_0) AND NOT FIREABLE(SreqTS_1) AND NOT FIREABLE(SreqTS_4) AND NOT FIREABLE(SreqTS_5) AND NOT FIREABLE(SreqTS_2) AND NOT FIREABLE(SreqTS_3) AND NOT FIREABLE(SreqTS_17) AND NOT FIREABLE(SreqTS_16) AND NOT FIREABLE(SreqTS_15) AND NOT FIREABLE(SreqTS_14) AND NOT FIREABLE(SreqTS_18)) OR NOT FIREABLE(malA3) OR FIREABLE(malA1) OR (NOT FIREABLE(malS5_0) AND NOT FIREABLE(malS5_17) AND NOT FIREABLE(malS5_18) AND NOT FIREABLE(malS5_2) AND NOT FIREABLE(malS5_1) AND NOT FIREABLE(malS5_4) AND NOT FIREABLE(malS5_3) AND NOT FIREABLE(malS5_6) AND NOT FIREABLE(malS5_5) AND NOT FIREABLE(malS5_8) AND NOT FIREABLE(malS5_7) AND NOT FIREABLE(malS5_10) AND NOT FIREABLE(malS5_9) AND NOT FIREABLE(malS5_12) AND NOT FIREABLE(malS5_11) AND NOT FIREABLE(malS5_14) AND NOT FIREABLE(malS5_13) AND NOT FIREABLE(malS5_16) AND NOT FIREABLE(malS5_15))))) : A (G (((NOT FIREABLE(Sperform_17) AND NOT FIREABLE(Sperform_18) AND NOT FIREABLE(Sperform_0) AND NOT FIREABLE(Sperform_10) AND NOT FIREABLE(Sperform_9) AND NOT FIREABLE(Sperform_12) AND NOT FIREABLE(Sperform_11) AND NOT FIREABLE(Sperform_14) AND NOT FIREABLE(Sperform_13) AND NOT FIREABLE(Sperform_16) AND NOT FIREABLE(Sperform_15) AND NOT FIREABLE(Sperform_2) AND NOT FIREABLE(Sperform_1) AND NOT FIREABLE(Sperform_4) AND NOT FIREABLE(Sperform_3) AND NOT FIREABLE(Sperform_6) AND NOT FIREABLE(Sperform_5) AND NOT FIREABLE(Sperform_8) AND NOT FIREABLE(Sperform_7)) OR ((FIREABLE(malS1_9) OR FIREABLE(malS1_10) OR FIREABLE(malS1_11) OR FIREABLE(malS1_12) OR FIREABLE(malS1_5) OR FIREABLE(malS1_6) OR FIREABLE(malS1_7) OR FIREABLE(malS1_8) OR FIREABLE(malS1_17) OR FIREABLE(malS1_18) OR FIREABLE(malS1_13) OR FIREABLE(malS1_14) OR FIREABLE(malS1_15) OR FIREABLE(malS1_16) OR FIREABLE(malS1_2) OR FIREABLE(malS1_1) OR FIREABLE(malS1_4) OR FIREABLE(malS1_3) OR FIREABLE(malS1_0)) AND (FIREABLE(malS6_6) OR FIREABLE(malS6_7) OR FIREABLE(malS6_4) OR FIREABLE(malS6_5) OR FIREABLE(malS6_10) OR FIREABLE(malS6_11) OR FIREABLE(malS6_8) OR FIREABLE(malS6_9) OR FIREABLE(malS6_14) OR FIREABLE(malS6_15) OR FIREABLE(malS6_12) OR FIREABLE(malS6_13) OR FIREABLE(malS6_18) OR FIREABLE(malS6_16) OR FIREABLE(malS6_17) OR FIREABLE(malS6_3) OR FIREABLE(malS6_2) OR FIREABLE(malS6_1) OR FIREABLE(malS6_0) OR FIREABLE(malS6_6) OR FIREABLE(malS6_7) OR FIREABLE(malS6_4) OR FIREABLE(malS6_5) OR FIREABLE(malS6_10) OR FIREABLE(malS6_11) OR FIREABLE(malS6_8) OR FIREABLE(malS6_9) OR FIREABLE(malS6_14) OR FIREABLE(malS6_15) OR FIREABLE(malS6_12) OR FIREABLE(malS6_13) OR FIREABLE(malS6_18) OR FIREABLE(malS6_16) OR FIREABLE(malS6_17) OR FIREABLE(malS6_3) OR FIREABLE(malS6_2) OR FIREABLE(malS6_1) OR FIREABLE(malS6_0) OR FIREABLE(malS5_0) OR FIREABLE(malS5_17) OR FIREABLE(malS5_18) OR FIREABLE(malS5_2) OR FIREABLE(malS5_1) OR FIREABLE(malS5_4) OR FIREABLE(malS5_3) OR FIREABLE(malS5_6) OR FIREABLE(malS5_5) OR FIREABLE(malS5_8) OR FIREABLE(malS5_7) OR FIREABLE(malS5_10) OR FIREABLE(malS5_9) OR FIREABLE(malS5_12) OR FIREABLE(malS5_11) OR FIREABLE(malS5_14) OR FIREABLE(malS5_13) OR FIREABLE(malS5_16) OR FIREABLE(malS5_15)))))) : E (F (FIREABLE(AreqCS))) : E (F ((NOT FIREABLE(ScertCS_8) AND NOT FIREABLE(CsendTS1_10) AND NOT FIREABLE(SgetTS_4) AND FIREABLE(malS1_9) AND FIREABLE(malS6_0) AND FIREABLE(Sperform_11) AND ((FIREABLE(CgenCertif_18) AND FIREABLE(SsendTS_16)) OR (FIREABLE(ScertCS_15) AND FIREABLE(malS5_8)))))) : E (F ((FIREABLE(malS1_0) AND FIREABLE(malS3_0) AND (NOT FIREABLE(malS1_17) OR NOT FIREABLE(malS6_8) OR (NOT FIREABLE(SsendTS_16) AND NOT FIREABLE(malS3_6)))))) : A (G (NOT FIREABLE(SackCS_5))) : E (F (FIREABLE(malS5_0))) : A (G (((FIREABLE(malS4_2) AND FIREABLE(ScertCS_17) AND NOT FIREABLE(CgenCertif_4)) OR NOT FIREABLE(AstartCS)))) : E (F (FIREABLE(Sperform_18))) : E (F (FIREABLE(malS5_6))) : E (F ((((FIREABLE(malS4_5) AND FIREABLE(malS5_0) AND FIREABLE(SgetTS_16)) OR FIREABLE(Sperform_0)) AND FIREABLE(CsendTS1_6))))
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 (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 1180 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 44 markings, 43 edges
lola: ========================================
lola: subprocess 1 will run for 235 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((NOT FIREABLE(CgenCertif_9) AND NOT FIREABLE(CgenCertif_10) AND NOT FIREABLE(CgenCertif_11) AND NOT FIREABLE(CgenCertif_12) AND NOT FIREABLE(CgenCertif_5) AND NOT FIREABLE(CgenCertif_6) AND NOT FIREABLE(CgenCertif_7) AND NOT FIREABLE(CgenCertif_8) AND NOT FIREABLE(CgenCertif_1) AND NOT FIREABLE(CgenCertif_2) AND NOT FIREABLE(CgenCertif_3) AND NOT FIREABLE(CgenCertif_4) AND NOT FIREABLE(Cgen... (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 1180 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 invariant.
lola: 2 markings, 1 edges
lola: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (FIREABLE(AackCS)))
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 1180 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 20 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to QuasiCertifProtocol-PT-18-ReachabilityFireability-2.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 42 markings, 41 edges
lola: ========================================
lola: subprocess 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(SgetTS_6) OR FIREABLE(SgetTS_5) OR FIREABLE(SgetTS_4) OR FIREABLE(SgetTS_3) OR FIREABLE(SgetTS_10) OR FIREABLE(SgetTS_9) OR FIREABLE(SgetTS_8) OR FIREABLE(SgetTS_7) OR FIREABLE(SgetTS_2) OR FIREABLE(SgetTS_1) OR FIREABLE(SgetTS_0) OR FIREABLE(SgetTS_16) OR FIREABLE(SgetTS_15) OR FIREABLE(SgetTS_18) OR FIREABLE(SgetTS_17) OR FIREABLE(SgetTS_12) OR FIREABLE(SgetTS_11)... (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 1180 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: 11 markings, 10 edges
lola: ========================================
lola: subprocess 4 will run for 294 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((FIREABLE(CgenCertif_9) OR FIREABLE(CgenCertif_10) OR FIREABLE(CgenCertif_11) OR FIREABLE(CgenCertif_12) OR FIREABLE(CgenCertif_5) OR FIREABLE(CgenCertif_6) OR FIREABLE(CgenCertif_7) OR FIREABLE(CgenCertif_8) OR FIREABLE(CgenCertif_1) OR FIREABLE(CgenCertif_2) OR FIREABLE(CgenCertif_3) OR FIREABLE(CgenCertif_4) OR FIREABLE(CgenCertif_0) OR FIREABLE(CgenCertif_18) OR FIREABLE(C... (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 1180 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: 102 markings, 101 edges
lola: ========================================
lola: subprocess 5 will run for 321 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((NOT FIREABLE(SreqTS_8) AND NOT FIREABLE(SreqTS_9) AND NOT FIREABLE(SreqTS_6) AND NOT FIREABLE(SreqTS_7) AND NOT FIREABLE(SreqTS_12) AND NOT FIREABLE(SreqTS_13) AND NOT FIREABLE(SreqTS_10) AND NOT FIREABLE(SreqTS_11) AND NOT FIREABLE(SreqTS_0) AND NOT FIREABLE(SreqTS_1) AND NOT FIREABLE(SreqTS_4) AND NOT FIREABLE(SreqTS_5) AND NOT FIREABLE(SreqTS_2) AND NOT FIREABLE(SreqTS_3) AND NOT FIREAB... (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 1180 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 1805 literals and 361 conjunctive subformulas
lola: state equation: write sara problem file to QuasiCertifProtocol-PT-18-ReachabilityFireability-5.sara
lola: state equation: calling and running sara
sara: try reading problem file QuasiCertifProtocol-PT-18-ReachabilityFireability-5.sara.
sara: place or transition ordering is non-deterministic
lola: sara is running 0 secs || 336457 markings, 1123215 edges, 67291 markings/sec, 0 secs
lola: sara is running 5 secs || 639705 markings, 2338909 edges, 60650 markings/sec, 5 secs
lola: sara is running 10 secs || 895005 markings, 3601460 edges, 51060 markings/sec, 10 secs
lola: sara is running 15 secs || 1147441 markings, 4862191 edges, 50487 markings/sec, 15 secs
lola: sara is running 20 secs || 1378249 markings, 6112458 edges, 46162 markings/sec, 20 secs
lola: sara is running 25 secs || 1623302 markings, 7388700 edges, 49011 markings/sec, 25 secs
lola: sara is running 30 secs || 1861975 markings, 8668267 edges, 47735 markings/sec, 30 secs
lola: sara is running 35 secs || 2079955 markings, 9895059 edges, 43596 markings/sec, 35 secs
lola: sara is running 40 secs || 2307887 markings, 11183855 edges, 45586 markings/sec, 40 secs
lola: sara is running 45 secs || 2530942 markings, 12484377 edges, 44611 markings/sec, 45 secs
lola: sara is running 50 secs || 2746590 markings, 13819302 edges, 43130 markings/sec, 50 secs
lola: sara is running 55 secs || 2973821 markings, 15044495 edges, 45446 markings/sec, 55 secs
lola: sara is running 60 secs || 3195525 markings, 16223845 edges, 44341 markings/sec, 60 secs
lola: sara is running 65 secs || 3408582 markings, 17420028 edges, 42611 markings/sec, 65 secs
lola: sara is running 70 secs || 3620386 markings, 18616569 edges, 42361 markings/sec, 70 secs
lola: sara is running 75 secs || 3826070 markings, 19818284 edges, 41137 markings/sec, 75 secs
lola: sara is running 80 secs || 4020545 markings, 21021256 edges, 38895 markings/sec, 80 secs
lola: sara is running 85 secs || 4234112 markings, 22206375 edges, 42713 markings/sec, 85 secs
lola: sara is running 90 secs || 4440940 markings, 23400490 edges, 41366 markings/sec, 90 secs

lola: state equation: solution impossible
lola: SUBRESULT
lola: result: yes
lola: produced by: state equation
lola: The predicate is invariant.
lola: ========================================
lola: subprocess 6 will run for 344 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((NOT FIREABLE(Sperform_17) AND NOT FIREABLE(Sperform_18) AND NOT FIREABLE(Sperform_0) AND NOT FIREABLE(Sperform_10) AND NOT FIREABLE(Sperform_9) AND NOT FIREABLE(Sperform_12) AND NOT FIREABLE(Sperform_11) AND NOT FIREABLE(Sperform_14) AND NOT FIREABLE(Sperform_13) AND NOT FIREABLE(Sperform_16) AND NOT FIREABLE(Sperform_15) AND NOT FIREABLE(Sperform_2) AND NOT FIREABLE(Sperform_1) AND NOT FI... (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 1180 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: 44 markings, 43 edges
lola: ========================================
lola: subprocess 7 will run for 382 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 1180 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-18-ReachabilityFireability-7.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 22 markings, 21 edges
lola: ========================================
lola: subprocess 8 will run for 430 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((NOT FIREABLE(ScertCS_8) AND NOT FIREABLE(CsendTS1_10) AND NOT FIREABLE(SgetTS_4) AND FIREABLE(malS1_9) AND FIREABLE(malS6_0) AND FIREABLE(Sperform_11) AND ((FIREABLE(CgenCertif_18) AND FIREABLE(SsendTS_16)) OR (FIREABLE(ScertCS_15) AND FIREABLE(malS5_8))))))
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 1180 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 17200 literals and 800 conjunctive subformulas
lola: state equation: write sara problem file to QuasiCertifProtocol-PT-18-ReachabilityFireability-8.sara
lola: state equation: calling and running sara
sara: try reading problem file QuasiCertifProtocol-PT-18-ReachabilityFireability-8.sara.
sara: place or transition ordering is non-deterministic
lola: sara is running 0 secs || 340904 markings, 801788 edges, 68181 markings/sec, 0 secs
lola: sara is running 5 secs || 686852 markings, 1889977 edges, 69190 markings/sec, 5 secs
lola: sara is running 10 secs || 1044926 markings, 2866895 edges, 71615 markings/sec, 10 secs
lola: sara is running 15 secs || 1379111 markings, 3970544 edges, 66837 markings/sec, 15 secs
lola: sara is running 20 secs || 1716794 markings, 4902505 edges, 67537 markings/sec, 20 secs
lola: sara is running 25 secs || 2063788 markings, 6083451 edges, 69399 markings/sec, 25 secs
lola: sara is running 30 secs || 2416760 markings, 7104063 edges, 70594 markings/sec, 30 secs
lola: sara is running 35 secs || 2744830 markings, 8179215 edges, 65614 markings/sec, 35 secs
lola: sara is running 40 secs || 3072197 markings, 9308287 edges, 65473 markings/sec, 40 secs
lola: sara is running 45 secs || 3404931 markings, 10449632 edges, 66547 markings/sec, 45 secs
lola: sara is running 50 secs || 3729174 markings, 11530425 edges, 64849 markings/sec, 50 secs
lola: sara is running 55 secs || 4040377 markings, 12633685 edges, 62241 markings/sec, 55 secs
lola: sara is running 60 secs || 4342279 markings, 13765235 edges, 60380 markings/sec, 60 secs
lola: sara is running 65 secs || 4644637 markings, 14886576 edges, 60472 markings/sec, 65 secs
lola: sara is running 70 secs || 4932719 markings, 16045457 edges, 57616 markings/sec, 70 secs
lola: sara is running 75 secs || 5219481 markings, 17210652 edges, 57352 markings/sec, 75 secs
lola: sara is running 80 secs || 5481382 markings, 18439347 edges, 52380 markings/sec, 80 secs
lola: sara is running 85 secs || 5744659 markings, 19623772 edges, 52655 markings/sec, 85 secs
lola: sara is running 90 secs || 6101064 markings, 20556187 edges, 71281 markings/sec, 90 secs
lola: sara is running 95 secs || 6424638 markings, 21652876 edges, 64715 markings/sec, 95 secs
lola: sara is running 100 secs || 6774977 markings, 22613500 edges, 70068 markings/sec, 100 secs
lola: sara is running 105 secs || 7109564 markings, 23706328 edges, 66917 markings/sec, 105 secs
lola: sara is running 110 secs || 7439295 markings, 24777986 edges, 65946 markings/sec, 110 secs
lola: sara is running 115 secs || 7764139 markings, 25773774 edges, 64969 markings/sec, 115 secs
lola: sara is running 120 secs || 8073536 markings, 26830581 edges, 61879 markings/sec, 120 secs
lola: sara is running 125 secs || 8377850 markings, 27917613 edges, 60863 markings/sec, 125 secs
lola: sara is running 130 secs || 8691589 markings, 28964639 edges, 62748 markings/sec, 130 secs
lola: sara is running 135 secs || 8998075 markings, 30047381 edges, 61297 markings/sec, 135 secs
lola: sara is running 140 secs || 9302772 markings, 31193386 edges, 60939 markings/sec, 140 secs
lola: sara is running 145 secs || 9609672 markings, 32316818 edges, 61380 markings/sec, 145 secs
lola: sara is running 150 secs || 9899661 markings, 33506418 edges, 57998 markings/sec, 150 secs
lola: sara is running 155 secs || 10195921 markings, 34710267 edges, 59252 markings/sec, 155 secs
lola: sara is running 160 secs || 10465040 markings, 35967133 edges, 53824 markings/sec, 160 secs
lola: sara is running 165 secs || 10741016 markings, 37132679 edges, 55195 markings/sec, 165 secs
lola: sara is running 170 secs || 11087863 markings, 38108346 edges, 69369 markings/sec, 170 secs
lola: sara is running 175 secs || 11403143 markings, 39134833 edges, 63056 markings/sec, 175 secs
lola: sara is running 180 secs || 11728561 markings, 40200261 edges, 65084 markings/sec, 180 secs
lola: sara is running 185 secs || 12054708 markings, 41190693 edges, 65229 markings/sec, 185 secs
lola: sara is running 190 secs || 12361261 markings, 42239282 edges, 61311 markings/sec, 190 secs
lola: sara is running 195 secs || 12669506 markings, 43332998 edges, 61649 markings/sec, 195 secs
lola: sara is running 200 secs || 12986946 markings, 44419203 edges, 63488 markings/sec, 200 secs
lola: sara is running 205 secs || 13292335 markings, 45499640 edges, 61078 markings/sec, 205 secs
lola: sara is running 210 secs || 13585376 markings, 46591359 edges, 58608 markings/sec, 210 secs
lola: sara is running 215 secs || 13880404 markings, 47674464 edges, 59006 markings/sec, 215 secs
lola: sara is running 220 secs || 14166023 markings, 48823958 edges, 57124 markings/sec, 220 secs
lola: sara is running 225 secs || 14458415 markings, 50014626 edges, 58478 markings/sec, 225 secs
lola: sara is running 230 secs || 14725023 markings, 51262321 edges, 53322 markings/sec, 230 secs
lola: sara is running 235 secs || 14991866 markings, 52465866 edges, 53369 markings/sec, 235 secs
lola: sara is running 240 secs || 15346903 markings, 53495543 edges, 71007 markings/sec, 240 secs
lola: sara is running 245 secs || 15682628 markings, 54581478 edges, 67145 markings/sec, 245 secs

lola: state equation: solution impossible
lola: SUBRESULT
lola: result: no
lola: produced by: state equation
lola: The predicate is unreachable.
lola: ========================================
lola: subprocess 9 will run for 455 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(malS1_0) AND FIREABLE(malS3_0) AND (NOT FIREABLE(malS1_17) OR NOT FIREABLE(malS6_8) OR (NOT FIREABLE(SsendTS_16) AND NOT FIREABLE(malS3_6))))))
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 1180 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 4 conjunctive subformulas
lola: state equation: write sara problem file to QuasiCertifProtocol-PT-18-ReachabilityFireability-9.sara
lola: state equation: calling and running sara
sara: try reading problem file QuasiCertifProtocol-PT-18-ReachabilityFireability-9.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 10 will run for 531 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (NOT FIREABLE(SackCS_5)))
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 1180 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 QuasiCertifProtocol-PT-18-ReachabilityFireability-10.sara
lola: state equation: calling and running sara
sara: try reading problem file QuasiCertifProtocol-PT-18-ReachabilityFireability-10.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 23 markings, 22 edges
lola: ========================================
lola: subprocess 11 will run for 637 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (FIREABLE(malS5_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 1180 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 QuasiCertifProtocol-PT-18-ReachabilityFireability-11.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 46 markings, 45 edges
lola: ========================================
lola: subprocess 12 will run for 796 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((FIREABLE(malS4_2) AND FIREABLE(ScertCS_17) AND NOT FIREABLE(CgenCertif_4)) OR NOT FIREABLE(AstartCS))))
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 1180 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 27 literals and 4 conjunctive subformulas
lola: state equation: write sara problem file to QuasiCertifProtocol-PT-18-ReachabilityFireability-12.sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 43 markings, 42 edges
lola: ========================================
lola: subprocess 13 will run for 1062 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (FIREABLE(Sperform_18)))
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 1180 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 QuasiCertifProtocol-PT-18-ReachabilityFireability-13.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 44 markings, 43 edges
lola: ========================================
lola: subprocess 14 will run for 1593 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (FIREABLE(malS5_6)))
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 1180 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 QuasiCertifProtocol-PT-18-ReachabilityFireability-14.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 46 markings, 45 edges
lola: ========================================
lola: subprocess 15 will run for 3187 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((((FIREABLE(malS4_5) AND FIREABLE(malS5_0) AND FIREABLE(SgetTS_16)) OR FIREABLE(Sperform_0)) AND FIREABLE(CsendTS1_6))))
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 1180 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 66 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to QuasiCertifProtocol-PT-18-ReachabilityFireability-15.sara
lola: state equation: calling and running sara
sara: try reading problem file QuasiCertifProtocol-PT-18-ReachabilityFireability-15.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: RESULT
lola:
SUMMARY: yes yes yes yes yes yes no yes no no no yes no yes yes no
lola: ========================================
FORMULA QuasiCertifProtocol-PT-18-ReachabilityFireability-0 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA QuasiCertifProtocol-PT-18-ReachabilityFireability-1 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA QuasiCertifProtocol-PT-18-ReachabilityFireability-2 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA QuasiCertifProtocol-PT-18-ReachabilityFireability-3 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA QuasiCertifProtocol-PT-18-ReachabilityFireability-4 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA QuasiCertifProtocol-PT-18-ReachabilityFireability-5 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA QuasiCertifProtocol-PT-18-ReachabilityFireability-6 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA QuasiCertifProtocol-PT-18-ReachabilityFireability-7 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA QuasiCertifProtocol-PT-18-ReachabilityFireability-8 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA QuasiCertifProtocol-PT-18-ReachabilityFireability-9 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA QuasiCertifProtocol-PT-18-ReachabilityFireability-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA QuasiCertifProtocol-PT-18-ReachabilityFireability-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA QuasiCertifProtocol-PT-18-ReachabilityFireability-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA QuasiCertifProtocol-PT-18-ReachabilityFireability-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA QuasiCertifProtocol-PT-18-ReachabilityFireability-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA QuasiCertifProtocol-PT-18-ReachabilityFireability-15 FALSE 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="QuasiCertifProtocol-PT-18"
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-18.tgz
mv QuasiCertifProtocol-PT-18 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-18, 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-152673583600084"
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 ;