fond

jQuery Multi Level CSS Menu Css3Menu.com

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

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

Execution Summary
Max Memory
Used (MB)		 Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
6662.770 307858.00 549005.00 1702.20 TF?TTTTTTTFTFTTT 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.4M
-rw-r--r-- 1 mcc users 15K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 65K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.7K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 38K 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 16K May 26 09:27 LTLCardinality.txt
-rw-r--r-- 1 mcc users 60K May 26 09:27 LTLCardinality.xml
-rw-r--r-- 1 mcc users 5.1K May 26 09:27 LTLFireability.txt
-rw-r--r-- 1 mcc users 23K May 26 09:27 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 58K 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 5.5K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 23K May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 8.5K May 15 18:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 23K 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 949K May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool mcc4mcc-full
Input is QuasiCertifProtocol-PT-22, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r142-qhx2-152673583600091
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1527952498886


BK_STOP 1527952806744

--------------------
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-22 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': 861935, 'Memory': 10478.81, 'Tool': 'lola'}, {'Time': 862017, 'Memory': 10468.66, 'Tool': 'lola'}].
Learned tools are: [{'Tool': 'lola'}].
Learned tool lola is 1.0x far from the best tool lola.
ReachabilityFireability lola QuasiCertifProtocol-PT-22...

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


checking for too many tokens
===========================================================================================
QuasiCertifProtocol-PT-22: translating PT formula ReachabilityFireability into LoLA format
===========================================================================================
translating formula complete
touch formulae;
----- Start make result stderr -----
----- Start make result stdout -----
ReachabilityFireability @ QuasiCertifProtocol-PT-22 @ 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: 2322/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: finding significant places
lola: 1966 places, 356 transitions, 355 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 471 transition conflict sets
lola: TASK
lola: reading formula from QuasiCertifProtocol-PT-22-ReachabilityFireability.task
lola: E (F (FIREABLE(malA2))) : A (G ((NOT FIREABLE(AgetTS) AND (NOT FIREABLE(AreqCS) OR NOT FIREABLE(AackCS) OR FIREABLE(malA3))))) : A (G ((NOT FIREABLE(malA4) OR (NOT FIREABLE(SreqTS_18) AND NOT FIREABLE(SreqTS_19) AND NOT FIREABLE(SreqTS_20) AND NOT FIREABLE(SreqTS_21) AND NOT FIREABLE(SreqTS_14) AND NOT FIREABLE(SreqTS_15) AND NOT FIREABLE(SreqTS_16) AND NOT FIREABLE(SreqTS_17) AND NOT FIREABLE(SreqTS_10) AND NOT FIREABLE(SreqTS_11) AND NOT FIREABLE(SreqTS_12) AND NOT FIREABLE(SreqTS_13) AND NOT FIREABLE(SreqTS_6) AND NOT FIREABLE(SreqTS_7) AND NOT FIREABLE(SreqTS_8) AND NOT FIREABLE(SreqTS_9) AND NOT FIREABLE(SreqTS_3) AND NOT FIREABLE(SreqTS_2) AND NOT FIREABLE(SreqTS_5) AND NOT FIREABLE(SreqTS_4) AND NOT FIREABLE(SreqTS_1) AND NOT FIREABLE(SreqTS_0) AND NOT FIREABLE(SreqTS_22)) OR NOT FIREABLE(malA5) OR (NOT FIREABLE(SgetTS_21) AND NOT FIREABLE(SgetTS_22) AND NOT FIREABLE(SgetTS_19) AND NOT FIREABLE(SgetTS_20) AND NOT FIREABLE(SgetTS_17) AND NOT FIREABLE(SgetTS_18) AND NOT FIREABLE(SgetTS_15) AND NOT FIREABLE(SgetTS_16) AND NOT FIREABLE(SgetTS_14) AND NOT FIREABLE(SgetTS_13) AND NOT FIREABLE(SgetTS_12) AND NOT FIREABLE(SgetTS_11) AND NOT FIREABLE(SgetTS_10) AND NOT FIREABLE(SgetTS_9) AND NOT FIREABLE(SgetTS_8) AND NOT FIREABLE(SgetTS_7) AND NOT FIREABLE(SgetTS_6) AND NOT FIREABLE(SgetTS_5) AND NOT FIREABLE(SgetTS_4) AND NOT FIREABLE(SgetTS_3) AND NOT FIREABLE(SgetTS_2) AND NOT FIREABLE(SgetTS_1) AND NOT FIREABLE(SgetTS_0)) OR (NOT FIREABLE(Sperform_7) AND NOT FIREABLE(Sperform_8) AND NOT FIREABLE(Sperform_5) AND NOT FIREABLE(Sperform_6) AND NOT FIREABLE(Sperform_11) AND NOT FIREABLE(Sperform_12) AND NOT FIREABLE(Sperform_9) AND NOT FIREABLE(Sperform_10) AND NOT FIREABLE(Sperform_0) AND NOT FIREABLE(Sperform_3) AND NOT FIREABLE(Sperform_4) AND NOT FIREABLE(Sperform_1) AND NOT FIREABLE(Sperform_2) AND NOT FIREABLE(Sperform_22) AND NOT FIREABLE(Sperform_21) AND NOT FIREABLE(Sperform_18) AND NOT FIREABLE(Sperform_17) AND NOT FIREABLE(Sperform_20) AND NOT FIREABLE(Sperform_19) AND NOT FIREABLE(Sperform_14) AND NOT FIREABLE(Sperform_13) AND NOT FIREABLE(Sperform_16) AND NOT FIREABLE(Sperform_15))))) : E (F (FIREABLE(AackCS))) : E (F ((FIREABLE(ScertCS_6) OR FIREABLE(ScertCS_7) OR FIREABLE(ScertCS_4) OR FIREABLE(ScertCS_5) OR FIREABLE(ScertCS_2) OR FIREABLE(ScertCS_3) OR FIREABLE(ScertCS_0) OR FIREABLE(ScertCS_1) OR FIREABLE(ScertCS_10) OR FIREABLE(ScertCS_11) OR FIREABLE(ScertCS_8) OR FIREABLE(ScertCS_9) OR FIREABLE(ScertCS_14) OR FIREABLE(ScertCS_15) OR FIREABLE(ScertCS_12) OR FIREABLE(ScertCS_13) OR FIREABLE(ScertCS_18) OR FIREABLE(ScertCS_19) OR FIREABLE(ScertCS_16) OR FIREABLE(ScertCS_17) OR FIREABLE(ScertCS_22) OR FIREABLE(ScertCS_20) OR FIREABLE(ScertCS_21)))) : E (F ((FIREABLE(CsendTS1_19) OR FIREABLE(CsendTS1_18) OR FIREABLE(CsendTS1_21) OR FIREABLE(CsendTS1_20) OR FIREABLE(CsendTS1_22) OR FIREABLE(CsendTS1_9) OR FIREABLE(CsendTS1_8) OR FIREABLE(CsendTS1_7) OR FIREABLE(CsendTS1_6) OR FIREABLE(CsendTS1_5) OR FIREABLE(CsendTS1_4) OR FIREABLE(CsendTS1_3) OR FIREABLE(CsendTS1_2) OR FIREABLE(CsendTS1_17) OR FIREABLE(CsendTS1_16) OR FIREABLE(CsendTS1_15) OR FIREABLE(CsendTS1_14) OR FIREABLE(CsendTS1_13) OR FIREABLE(CsendTS1_12) OR FIREABLE(CsendTS1_11) OR FIREABLE(CsendTS1_10) OR FIREABLE(CsendTS1_0) OR FIREABLE(CsendTS1_1)))) : E (F ((FIREABLE(malC1_18) OR FIREABLE(malC1_17) OR FIREABLE(malC1_16) OR FIREABLE(malC1_15) OR FIREABLE(malC1_22) OR FIREABLE(malC1_21) OR FIREABLE(malC1_20) OR FIREABLE(malC1_19) OR FIREABLE(malC1_3) OR FIREABLE(malC1_4) OR FIREABLE(malC1_5) OR FIREABLE(malC1_6) OR FIREABLE(malC1_0) OR FIREABLE(malC1_1) OR FIREABLE(malC1_2) OR FIREABLE(malC1_11) OR FIREABLE(malC1_12) OR FIREABLE(malC1_13) OR FIREABLE(malC1_14) OR FIREABLE(malC1_7) OR FIREABLE(malC1_8) OR FIREABLE(malC1_9) OR FIREABLE(malC1_10) OR (((FIREABLE(malA5) AND (FIREABLE(SreqTS_18) OR FIREABLE(SreqTS_19) OR FIREABLE(SreqTS_20) OR FIREABLE(SreqTS_21) OR FIREABLE(SreqTS_14) OR FIREABLE(SreqTS_15) OR FIREABLE(SreqTS_16) OR FIREABLE(SreqTS_17) OR FIREABLE(SreqTS_10) OR FIREABLE(SreqTS_11) OR FIREABLE(SreqTS_12) OR FIREABLE(SreqTS_13) OR FIREABLE(SreqTS_6) OR FIREABLE(SreqTS_7) OR FIREABLE(SreqTS_8) OR FIREABLE(SreqTS_9) OR FIREABLE(SreqTS_3) OR FIREABLE(SreqTS_2) OR FIREABLE(SreqTS_5) OR FIREABLE(SreqTS_4) OR FIREABLE(SreqTS_1) OR FIREABLE(SreqTS_0) OR FIREABLE(SreqTS_22))) OR ((FIREABLE(malS3_4) OR FIREABLE(malS3_3) OR FIREABLE(malS3_6) OR FIREABLE(malS3_5) OR FIREABLE(malS3_8) OR FIREABLE(malS3_7) OR FIREABLE(malS3_10) OR FIREABLE(malS3_9) OR FIREABLE(malS3_12) OR FIREABLE(malS3_11) OR FIREABLE(malS3_14) OR FIREABLE(malS3_13) OR FIREABLE(malS3_16) OR FIREABLE(malS3_15) OR FIREABLE(malS3_18) OR FIREABLE(malS3_17) OR FIREABLE(malS3_0) OR FIREABLE(malS3_1) OR FIREABLE(malS3_2) OR FIREABLE(malS3_21) OR FIREABLE(malS3_22) OR FIREABLE(malS3_19) OR FIREABLE(malS3_20)) AND (FIREABLE(malS5_17) OR FIREABLE(malS5_18) OR FIREABLE(malS5_19) OR FIREABLE(malS5_20) OR FIREABLE(malS5_21) OR FIREABLE(malS5_22) 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) OR FIREABLE(malS5_0)))))))) : E (F ((FIREABLE(ScertCS_6) OR FIREABLE(ScertCS_7) OR FIREABLE(ScertCS_4) OR FIREABLE(ScertCS_5) OR FIREABLE(ScertCS_2) OR FIREABLE(ScertCS_3) OR FIREABLE(ScertCS_0) OR FIREABLE(ScertCS_1) OR FIREABLE(ScertCS_10) OR FIREABLE(ScertCS_11) OR FIREABLE(ScertCS_8) OR FIREABLE(ScertCS_9) OR FIREABLE(ScertCS_14) OR FIREABLE(ScertCS_15) OR FIREABLE(ScertCS_12) OR FIREABLE(ScertCS_13) OR FIREABLE(ScertCS_18) OR FIREABLE(ScertCS_19) OR FIREABLE(ScertCS_16) OR FIREABLE(ScertCS_17) OR FIREABLE(ScertCS_22) OR FIREABLE(ScertCS_20) OR FIREABLE(ScertCS_21) OR FIREABLE(malS3_4) OR FIREABLE(malS3_3) OR FIREABLE(malS3_6) OR FIREABLE(malS3_5) OR FIREABLE(malS3_8) OR FIREABLE(malS3_7) OR FIREABLE(malS3_10) OR FIREABLE(malS3_9) OR FIREABLE(malS3_12) OR FIREABLE(malS3_11) OR FIREABLE(malS3_14) OR FIREABLE(malS3_13) OR FIREABLE(malS3_16) OR FIREABLE(malS3_15) OR FIREABLE(malS3_18) OR FIREABLE(malS3_17) OR FIREABLE(malS3_0) OR FIREABLE(malS3_1) OR FIREABLE(malS3_2) OR FIREABLE(malS3_21) OR FIREABLE(malS3_22) OR FIREABLE(malS3_19) OR FIREABLE(malS3_20) OR FIREABLE(malA2)))) : E (F (FIREABLE(malS4_9))) : E (F (FIREABLE(Sperform_1))) : A (G ((((NOT FIREABLE(malC1_8) OR NOT FIREABLE(SgetTS_14)) AND (NOT FIREABLE(CsendTS1_1) OR NOT FIREABLE(SsendTS_2))) OR FIREABLE(SreqTS_17)))) : E (F (FIREABLE(SreqTS_15))) : E (F ((FIREABLE(CsendTS1_2) AND FIREABLE(CsendTS1_4) AND (FIREABLE(malS4_18) OR FIREABLE(malS4_14)) AND FIREABLE(malA4) AND FIREABLE(CgenCertif_15)))) : E (F ((FIREABLE(SackCS_4) OR FIREABLE(malC1_14)))) : E (F (FIREABLE(malS6_2))) : E (F ((FIREABLE(malS3_20) OR FIREABLE(CsendTS1_11))))
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(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 1420 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: 26 markings, 25 edges
lola: state equation: write sara problem file to QuasiCertifProtocol-PT-22-ReachabilityFireability.sara
lola: ========================================
lola: subprocess 1 will run for 235 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((NOT FIREABLE(AgetTS) AND (NOT FIREABLE(AreqCS) OR NOT FIREABLE(AackCS) OR FIREABLE(malA3)))))
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 1420 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 1 conjunctive subformulas
lola: state equation: write sara problem file to QuasiCertifProtocol-PT-22-ReachabilityFireability.sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 25 markings, 24 edges
lola: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((NOT FIREABLE(malA4) OR (NOT FIREABLE(SreqTS_18) AND NOT FIREABLE(SreqTS_19) AND NOT FIREABLE(SreqTS_20) AND NOT FIREABLE(SreqTS_21) AND NOT FIREABLE(SreqTS_14) AND NOT FIREABLE(SreqTS_15) AND NOT FIREABLE(SreqTS_16) AND NOT FIREABLE(SreqTS_17) AND NOT FIREABLE(SreqTS_10) AND NOT FIREABLE(SreqTS_11) AND NOT FIREABLE(SreqTS_12) AND NOT FIREABLE(SreqTS_13) AND NOT FIREABLE(SreqTS_6) 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 1420 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 352843 literals and 12167 conjunctive subformulas
lola: state equation: write sara problem file to QuasiCertifProtocol-PT-22-ReachabilityFireability-2.sara
lola: sara not yet started (preprocessing) || 225382 markings, 394918 edges, 45076 markings/sec, 0 secs
lola: state equation: calling and running sara
sara: try reading problem file QuasiCertifProtocol-PT-22-ReachabilityFireability-2.sara.
sara: place or transition ordering is non-deterministic
lola: sara is running 5 secs || 453421 markings, 846272 edges, 45608 markings/sec, 5 secs
lola: sara is running 10 secs || 701307 markings, 1335255 edges, 49577 markings/sec, 10 secs
lola: sara is running 15 secs || 974193 markings, 1904956 edges, 54577 markings/sec, 15 secs
lola: sara is running 20 secs || 1238341 markings, 2435712 edges, 52830 markings/sec, 20 secs
lola: sara is running 25 secs || 1497313 markings, 2972049 edges, 51794 markings/sec, 25 secs
lola: sara is running 30 secs || 1746954 markings, 3510200 edges, 49928 markings/sec, 30 secs
lola: sara is running 35 secs || 1995162 markings, 4060390 edges, 49642 markings/sec, 35 secs
lola: sara is running 40 secs || 2241878 markings, 4614921 edges, 49343 markings/sec, 40 secs
lola: sara is running 45 secs || 2487859 markings, 5163768 edges, 49196 markings/sec, 45 secs
lola: sara is running 50 secs || 2748843 markings, 5686054 edges, 52197 markings/sec, 50 secs
lola: sara is running 55 secs || 2992700 markings, 6230142 edges, 48771 markings/sec, 55 secs
lola: sara is running 60 secs || 3246181 markings, 6753644 edges, 50696 markings/sec, 60 secs
lola: sara is running 65 secs || 3489279 markings, 7299076 edges, 48620 markings/sec, 65 secs
lola: sara is running 70 secs || 3726887 markings, 7875062 edges, 47522 markings/sec, 70 secs
lola: sara is running 75 secs || 3983534 markings, 8413818 edges, 51329 markings/sec, 75 secs
lola: sara is running 80 secs || 4224542 markings, 8952315 edges, 48202 markings/sec, 80 secs
lola: sara is running 85 secs || 4446079 markings, 9482288 edges, 44307 markings/sec, 85 secs
lola: sara is running 90 secs || 4681017 markings, 10022801 edges, 46988 markings/sec, 90 secs
lola: sara is running 95 secs || 4918448 markings, 10593154 edges, 47486 markings/sec, 95 secs
lola: sara is running 100 secs || 5154740 markings, 11177099 edges, 47258 markings/sec, 100 secs
lola: sara is running 105 secs || 5392643 markings, 11748372 edges, 47581 markings/sec, 105 secs
lola: sara is running 110 secs || 5653912 markings, 12270299 edges, 52254 markings/sec, 110 secs
lola: sara is running 115 secs || 5905677 markings, 12816474 edges, 50353 markings/sec, 115 secs
lola: sara is running 120 secs || 6162642 markings, 13356367 edges, 51393 markings/sec, 120 secs
lola: sara is running 125 secs || 6410421 markings, 13910711 edges, 49556 markings/sec, 125 secs
lola: sara is running 130 secs || 6646023 markings, 14476452 edges, 47120 markings/sec, 130 secs
lola: sara is running 135 secs || 6902121 markings, 15018889 edges, 51220 markings/sec, 135 secs
lola: sara is running 140 secs || 7148889 markings, 15570674 edges, 49354 markings/sec, 140 secs
lola: sara is running 145 secs || 7387791 markings, 16142719 edges, 47780 markings/sec, 145 secs
lola: sara is running 150 secs || 7630877 markings, 16697891 edges, 48617 markings/sec, 150 secs
lola: sara is running 155 secs || 7865611 markings, 17264680 edges, 46947 markings/sec, 155 secs
lola: sara is running 160 secs || 8096522 markings, 17835778 edges, 46182 markings/sec, 160 secs
lola: sara is running 165 secs || 8330180 markings, 18407255 edges, 46732 markings/sec, 165 secs
lola: sara is running 170 secs || 8576591 markings, 18942637 edges, 49282 markings/sec, 170 secs
lola: sara is running 175 secs || 8821669 markings, 19494536 edges, 49016 markings/sec, 175 secs
lola: sara is running 180 secs || 9059823 markings, 20059801 edges, 47631 markings/sec, 180 secs
lola: sara is running 185 secs || 9301254 markings, 20620528 edges, 48286 markings/sec, 185 secs
lola: sara is running 190 secs || 9536673 markings, 21191260 edges, 47084 markings/sec, 190 secs
lola: sara is running 195 secs || 9765548 markings, 21774041 edges, 45775 markings/sec, 195 secs
lola: sara is running 200 secs || 10003483 markings, 22338774 edges, 47587 markings/sec, 200 secs
lola: sara is running 205 secs || 10237556 markings, 22906770 edges, 46815 markings/sec, 205 secs
lola: sara is running 210 secs || 10471152 markings, 23475359 edges, 46719 markings/sec, 210 secs
lola: sara is running 215 secs || 10695389 markings, 24057988 edges, 44847 markings/sec, 215 secs
lola: sara is running 220 secs || 10927324 markings, 24623310 edges, 46387 markings/sec, 220 secs
lola: sara is running 225 secs || 11151145 markings, 25207555 edges, 44764 markings/sec, 225 secs
lola: sara is running 230 secs || 11369425 markings, 25783580 edges, 43656 markings/sec, 230 secs
lola: sara is running 235 secs || 11590300 markings, 26382084 edges, 44175 markings/sec, 235 secs
lola: sara is running 240 secs || 11843908 markings, 26880982 edges, 50722 markings/sec, 240 secs
lola: sara is running 245 secs || 12105995 markings, 27428185 edges, 52417 markings/sec, 245 secs
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 3 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 1420 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 1 conjunctive subformulas
lola: state equation: write sara problem file to QuasiCertifProtocol-PT-22-ReachabilityFireability-3.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 50 markings, 49 edges
lola: ========================================
lola: subprocess 4 will run for 273 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(ScertCS_6) OR FIREABLE(ScertCS_7) OR FIREABLE(ScertCS_4) OR FIREABLE(ScertCS_5) OR FIREABLE(ScertCS_2) OR FIREABLE(ScertCS_3) OR FIREABLE(ScertCS_0) OR FIREABLE(ScertCS_1) OR FIREABLE(ScertCS_10) OR FIREABLE(ScertCS_11) OR FIREABLE(ScertCS_8) OR FIREABLE(ScertCS_9) OR FIREABLE(ScertCS_14) OR FIREABLE(ScertCS_15) OR FIREABLE(ScertCS_12) OR FIREABLE(ScertCS_13) OR FIR... (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 1420 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 23 literals and 23 conjunctive subformulas
lola: state equation: write sara problem file to QuasiCertifProtocol-PT-22-ReachabilityFireability-4.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 122 markings, 121 edges
lola: ========================================
lola: subprocess 5 will run for 298 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(CsendTS1_19) OR FIREABLE(CsendTS1_18) OR FIREABLE(CsendTS1_21) OR FIREABLE(CsendTS1_20) OR FIREABLE(CsendTS1_22) OR FIREABLE(CsendTS1_9) OR FIREABLE(CsendTS1_8) OR FIREABLE(CsendTS1_7) OR FIREABLE(CsendTS1_6) OR FIREABLE(CsendTS1_5) OR FIREABLE(CsendTS1_4) OR FIREABLE(CsendTS1_3) OR FIREABLE(CsendTS1_2) OR FIREABLE(CsendTS1_17) OR FIREABLE(CsendTS1_16) OR FIREABLE(Cs... (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 1420 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 552 literals and 23 conjunctive subformulas
lola: state equation: write sara problem file to QuasiCertifProtocol-PT-22-ReachabilityFireability-5.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 98 markings, 97 edges
lola: ========================================
lola: subprocess 6 will run for 328 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(malC1_18) OR FIREABLE(malC1_17) OR FIREABLE(malC1_16) OR FIREABLE(malC1_15) OR FIREABLE(malC1_22) OR FIREABLE(malC1_21) OR FIREABLE(malC1_20) OR FIREABLE(malC1_19) OR FIREABLE(malC1_3) OR FIREABLE(malC1_4) OR FIREABLE(malC1_5) OR FIREABLE(malC1_6) OR FIREABLE(malC1_0) OR FIREABLE(malC1_1) OR FIREABLE(malC1_2) OR FIREABLE(malC1_11) OR FIREABLE(malC1_12) OR FIREABLE(... (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 1420 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: 53 markings, 52 edges
lola: ========================================
lola: subprocess 7 will run for 364 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(ScertCS_6) OR FIREABLE(ScertCS_7) OR FIREABLE(ScertCS_4) OR FIREABLE(ScertCS_5) OR FIREABLE(ScertCS_2) OR FIREABLE(ScertCS_3) OR FIREABLE(ScertCS_0) OR FIREABLE(ScertCS_1) OR FIREABLE(ScertCS_10) OR FIREABLE(ScertCS_11) OR FIREABLE(ScertCS_8) OR FIREABLE(ScertCS_9) OR FIREABLE(ScertCS_14) OR FIREABLE(ScertCS_15) OR FIREABLE(ScertCS_12) OR FIREABLE(ScertCS_13) OR FIR... (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 1420 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 70 literals and 47 conjunctive subformulas
lola: state equation: write sara problem file to QuasiCertifProtocol-PT-22-ReachabilityFireability-7.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 26 markings, 25 edges
lola: ========================================
lola: subprocess 8 will run for 410 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (FIREABLE(malS4_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 1420 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-22-ReachabilityFireability-8.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 53 markings, 52 edges
lola: ========================================
lola: subprocess 9 will run for 469 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (FIREABLE(Sperform_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 1420 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-22-ReachabilityFireability-9.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 52 markings, 51 edges
lola: ========================================
lola: subprocess 10 will run for 547 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((((NOT FIREABLE(malC1_8) OR NOT FIREABLE(SgetTS_14)) AND (NOT FIREABLE(CsendTS1_1) OR NOT FIREABLE(SsendTS_2))) OR FIREABLE(SreqTS_17))))
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 1420 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 54 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to QuasiCertifProtocol-PT-22-ReachabilityFireability-10.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: 122 markings, 121 edges
lola: ========================================
lola: subprocess 11 will run for 656 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (FIREABLE(SreqTS_15)))
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 1420 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-22-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: 53 markings, 52 edges
lola: ========================================
lola: subprocess 12 will run for 821 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(CsendTS1_2) AND FIREABLE(CsendTS1_4) AND (FIREABLE(malS4_18) OR FIREABLE(malS4_14)) AND FIREABLE(malA4) AND FIREABLE(CgenCertif_15))))
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 1420 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 150 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to QuasiCertifProtocol-PT-22-ReachabilityFireability-12.sara
lola: state equation: calling and running sara
sara: try reading problem file QuasiCertifProtocol-PT-22-ReachabilityFireability-12.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 13 will run for 1094 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(SackCS_4) OR FIREABLE(malC1_14))))
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 1420 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 2 conjunctive subformulas
lola: state equation: write sara problem file to QuasiCertifProtocol-PT-22-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: 27 markings, 26 edges
lola: ========================================
lola: subprocess 14 will run for 1641 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (FIREABLE(malS6_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 1420 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-22-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: 122 markings, 121 edges
lola: ========================================
lola: subprocess 15 will run for 3282 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(malS3_20) OR FIREABLE(CsendTS1_11))))
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 1420 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 26 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to QuasiCertifProtocol-PT-22-ReachabilityFireability-15.sara
lola: lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 28 markings, 27 edges
lola: ========================================
lola: RESULT
lola:
SUMMARY: yes no unknown yes yes yes yes yes yes yes no yes no yes yes yes
FORMULA QuasiCertifProtocol-PT-22-ReachabilityFireability-0 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA QuasiCertifProtocol-PT-22-ReachabilityFireability-1 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA QuasiCertifProtocol-PT-22-ReachabilityFireability-2 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA QuasiCertifProtocol-PT-22-ReachabilityFireability-3 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA QuasiCertifProtocol-PT-22-ReachabilityFireability-4 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA QuasiCertifProtocol-PT-22-ReachabilityFireability-5 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA QuasiCertifProtocol-PT-22-ReachabilityFireability-6 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA QuasiCertifProtocol-PT-22-ReachabilityFireability-7 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA QuasiCertifProtocol-PT-22-ReachabilityFireability-8 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA QuasiCertifProtocol-PT-22-ReachabilityFireability-9 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA QuasiCertifProtocol-PT-22-ReachabilityFireability-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA QuasiCertifProtocol-PT-22-ReachabilityFireability-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA QuasiCertifProtocol-PT-22-ReachabilityFireability-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA QuasiCertifProtocol-PT-22-ReachabilityFireability-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA QuasiCertifProtocol-PT-22-ReachabilityFireability-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA QuasiCertifProtocol-PT-22-ReachabilityFireability-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stderr -----
----- Kill lola and sara stdout -----
----- Finished stderr -----
----- Finished stdout -----

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="QuasiCertifProtocol-PT-22"
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-22.tgz
mv QuasiCertifProtocol-PT-22 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-22, 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-152673583600091"
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 ;