fond

jQuery Multi Level CSS Menu Css3Menu.com

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

About the Execution of Irma.struct for QuasiCertifProtocol-PT-22

Execution Summary
Max Memory
Used (MB)		 Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
6729.930 307975.00 552764.00 1664.50 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 irma4mcc-structural
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 r139-qhx2-152673581200091
=====================================================================

--------------------
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 1527788629358


BK_STOP 1527788937333

--------------------
content from stderr:

Prefix is 75f5f979.
Reading known information in /usr/share/mcc4mcc/75f5f979-known.json.
Reading learned information in /usr/share/mcc4mcc/75f5f979-learned.json.
Reading value translations in /usr/share/mcc4mcc/75f5f979-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 stdout -----
----- Start make result stderr -----
ReachabilityFireability @ QuasiCertifProtocol-PT-22 @ 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: 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: ========================================
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) || 224766 markings, 393633 edges, 44953 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 || 435306 markings, 817565 edges, 42108 markings/sec, 5 secs
lola: sara is running 10 secs || 675167 markings, 1277346 edges, 47972 markings/sec, 10 secs
lola: sara is running 15 secs || 914949 markings, 1772720 edges, 47956 markings/sec, 15 secs
lola: sara is running 20 secs || 1154592 markings, 2273408 edges, 47929 markings/sec, 20 secs
lola: sara is running 25 secs || 1393281 markings, 2751414 edges, 47738 markings/sec, 25 secs
lola: sara is running 30 secs || 1626072 markings, 3263786 edges, 46558 markings/sec, 30 secs
lola: sara is running 35 secs || 1866495 markings, 3763966 edges, 48085 markings/sec, 35 secs
lola: sara is running 40 secs || 2095982 markings, 4277100 edges, 45897 markings/sec, 40 secs
lola: sara is running 45 secs || 2318045 markings, 4800513 edges, 44413 markings/sec, 45 secs
lola: sara is running 50 secs || 2593504 markings, 5369573 edges, 55092 markings/sec, 50 secs
lola: sara is running 55 secs || 2874008 markings, 5952588 edges, 56101 markings/sec, 55 secs
lola: sara is running 60 secs || 3145918 markings, 6541980 edges, 54382 markings/sec, 60 secs
lola: sara is running 65 secs || 3417942 markings, 7138696 edges, 54405 markings/sec, 65 secs
lola: sara is running 70 secs || 3681250 markings, 7757883 edges, 52662 markings/sec, 70 secs
lola: sara is running 75 secs || 3955180 markings, 8349348 edges, 54786 markings/sec, 75 secs
lola: sara is running 80 secs || 4224293 markings, 8951875 edges, 53823 markings/sec, 80 secs
lola: sara is running 85 secs || 4481076 markings, 9575652 edges, 51357 markings/sec, 85 secs
lola: sara is running 90 secs || 4747098 markings, 10173491 edges, 53204 markings/sec, 90 secs
lola: sara is running 95 secs || 5003108 markings, 10795656 edges, 51202 markings/sec, 95 secs
lola: sara is running 100 secs || 5252455 markings, 11430062 edges, 49869 markings/sec, 100 secs
lola: sara is running 105 secs || 5524598 markings, 12004629 edges, 54429 markings/sec, 105 secs
lola: sara is running 110 secs || 5782973 markings, 12539446 edges, 51675 markings/sec, 110 secs
lola: sara is running 115 secs || 6049682 markings, 13112910 edges, 53342 markings/sec, 115 secs
lola: sara is running 120 secs || 6312494 markings, 13693182 edges, 52562 markings/sec, 120 secs
lola: sara is running 125 secs || 6551538 markings, 14241559 edges, 47809 markings/sec, 125 secs
lola: sara is running 130 secs || 6792834 markings, 14784241 edges, 48259 markings/sec, 130 secs
lola: sara is running 135 secs || 7039425 markings, 15330061 edges, 49318 markings/sec, 135 secs
lola: sara is running 140 secs || 7285695 markings, 15890006 edges, 49254 markings/sec, 140 secs
lola: sara is running 145 secs || 7524194 markings, 16449481 edges, 47700 markings/sec, 145 secs
lola: sara is running 150 secs || 7757454 markings, 17000134 edges, 46652 markings/sec, 150 secs
lola: sara is running 155 secs || 7992542 markings, 17573568 edges, 47018 markings/sec, 155 secs
lola: sara is running 160 secs || 8220469 markings, 18161865 edges, 45585 markings/sec, 160 secs
lola: sara is running 165 secs || 8473663 markings, 18708802 edges, 50639 markings/sec, 165 secs
lola: sara is running 170 secs || 8720970 markings, 19259880 edges, 49461 markings/sec, 170 secs
lola: sara is running 175 secs || 8956491 markings, 19820642 edges, 47104 markings/sec, 175 secs
lola: sara is running 180 secs || 9195091 markings, 20374655 edges, 47720 markings/sec, 180 secs
lola: sara is running 185 secs || 9430017 markings, 20938051 edges, 46985 markings/sec, 185 secs
lola: sara is running 190 secs || 9662121 markings, 21506340 edges, 46421 markings/sec, 190 secs
lola: sara is running 195 secs || 9888165 markings, 22079458 edges, 45209 markings/sec, 195 secs
lola: sara is running 200 secs || 10125894 markings, 22626606 edges, 47546 markings/sec, 200 secs
lola: sara is running 205 secs || 10352754 markings, 23178824 edges, 45372 markings/sec, 205 secs
lola: sara is running 210 secs || 10581791 markings, 23756739 edges, 45807 markings/sec, 210 secs
lola: sara is running 215 secs || 10813294 markings, 24336525 edges, 46301 markings/sec, 215 secs
lola: sara is running 220 secs || 11041961 markings, 24919164 edges, 45733 markings/sec, 220 secs
lola: sara is running 225 secs || 11266678 markings, 25505599 edges, 44943 markings/sec, 225 secs
lola: sara is running 230 secs || 11487124 markings, 26105976 edges, 44089 markings/sec, 230 secs
lola: sara is running 235 secs || 11731886 markings, 26646592 edges, 48952 markings/sec, 235 secs
lola: sara is running 240 secs || 11987626 markings, 27177424 edges, 51148 markings/sec, 240 secs
lola: sara is running 245 secs || 12237643 markings, 27714284 edges, 50003 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: state equation: calling and running 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: 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: ========================================
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 365 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: 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 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: state equation: calling and running 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 657 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: 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: 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 stdout -----
----- Kill lola and sara stderr -----
----- 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="irma4mcc-structural"
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 irma4mcc-structural"
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 r139-qhx2-152673581200091"
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 ;