fond

jQuery Multi Level CSS Menu Css3Menu.com

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

About the Execution of M4M.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
6096.340 309112.00 559625.00 1661.40 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-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 r143-qhx2-152673584500091
=====================================================================

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


BK_STOP 1527999414208

--------------------
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...
----- Start make prepare stderr -----

Time: 3600 - MCC
----- Start make prepare stdout -----
===========================================================================================
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: state equation: calling and running sara
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
sara: try reading problem file QuasiCertifProtocol-PT-22-ReachabilityFireability.sara.
sara: place or transition ordering is non-deterministic

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) || 187602 markings, 328554 edges, 37520 markings/sec, 0 secs
lola: state equation: calling and running sara
sara: try reading problem file QuasiCertifProtocol-PT-22-ReachabilityFireability-2.sara.
lola: sara is running 5 secs || 400503 markings, 737518 edges, 42580 markings/sec, 5 secs
sara: place or transition ordering is non-deterministic
lola: sara is running 10 secs || 632034 markings, 1185476 edges, 46306 markings/sec, 10 secs
lola: sara is running 15 secs || 860820 markings, 1659455 edges, 45757 markings/sec, 15 secs
lola: sara is running 20 secs || 1087020 markings, 2144353 edges, 45240 markings/sec, 20 secs
lola: sara is running 25 secs || 1319825 markings, 2606377 edges, 46561 markings/sec, 25 secs
lola: sara is running 30 secs || 1546935 markings, 3081691 edges, 45422 markings/sec, 30 secs
lola: sara is running 35 secs || 1774068 markings, 3567326 edges, 45427 markings/sec, 35 secs
lola: sara is running 40 secs || 2001727 markings, 4073228 edges, 45532 markings/sec, 40 secs
lola: sara is running 45 secs || 2225330 markings, 4578143 edges, 44721 markings/sec, 45 secs
lola: sara is running 50 secs || 2446837 markings, 5084562 edges, 44301 markings/sec, 50 secs
lola: sara is running 55 secs || 2683325 markings, 5555107 edges, 47298 markings/sec, 55 secs
lola: sara is running 60 secs || 2913615 markings, 6041416 edges, 46058 markings/sec, 60 secs
lola: sara is running 65 secs || 3141564 markings, 6530881 edges, 45590 markings/sec, 65 secs
lola: sara is running 70 secs || 3366541 markings, 7026072 edges, 44995 markings/sec, 70 secs
lola: sara is running 75 secs || 3586167 markings, 7524943 edges, 43925 markings/sec, 75 secs
lola: sara is running 80 secs || 3802217 markings, 8028975 edges, 43210 markings/sec, 80 secs
lola: sara is running 85 secs || 4021078 markings, 8496400 edges, 43772 markings/sec, 85 secs
lola: sara is running 90 secs || 4236010 markings, 8978723 edges, 42986 markings/sec, 90 secs
lola: sara is running 95 secs || 4445008 markings, 9479526 edges, 41800 markings/sec, 95 secs
lola: sara is running 100 secs || 4660001 markings, 9972490 edges, 42999 markings/sec, 100 secs
lola: sara is running 105 secs || 4868852 markings, 10476207 edges, 41770 markings/sec, 105 secs
lola: sara is running 110 secs || 5076886 markings, 10980638 edges, 41607 markings/sec, 110 secs
lola: sara is running 115 secs || 5281476 markings, 11508552 edges, 40918 markings/sec, 115 secs
lola: sara is running 120 secs || 5525567 markings, 12006780 edges, 48818 markings/sec, 120 secs
lola: sara is running 125 secs || 5746101 markings, 12464690 edges, 44107 markings/sec, 125 secs
lola: sara is running 130 secs || 5962023 markings, 12935245 edges, 43184 markings/sec, 130 secs
lola: sara is running 135 secs || 6179540 markings, 13393544 edges, 43503 markings/sec, 135 secs
lola: sara is running 140 secs || 6392290 markings, 13867747 edges, 42550 markings/sec, 140 secs
lola: sara is running 145 secs || 6598630 markings, 14355150 edges, 41268 markings/sec, 145 secs
lola: sara is running 150 secs || 6811794 markings, 14826207 edges, 42633 markings/sec, 150 secs
lola: sara is running 155 secs || 7025124 markings, 15302498 edges, 42666 markings/sec, 155 secs
lola: sara is running 160 secs || 7236808 markings, 15775134 edges, 42337 markings/sec, 160 secs
lola: sara is running 165 secs || 7444766 markings, 16276667 edges, 41592 markings/sec, 165 secs
lola: sara is running 170 secs || 7657127 markings, 16758675 edges, 42472 markings/sec, 170 secs
lola: sara is running 175 secs || 7872274 markings, 17281109 edges, 43029 markings/sec, 175 secs
lola: sara is running 180 secs || 8083094 markings, 17801988 edges, 42164 markings/sec, 180 secs
lola: sara is running 185 secs || 8301194 markings, 18348147 edges, 43620 markings/sec, 185 secs
lola: sara is running 190 secs || 8544073 markings, 18866204 edges, 48576 markings/sec, 190 secs
lola: sara is running 195 secs || 8778972 markings, 19397831 edges, 46980 markings/sec, 195 secs
lola: sara is running 200 secs || 9007185 markings, 19953323 edges, 45643 markings/sec, 200 secs
lola: sara is running 205 secs || 9240221 markings, 20473475 edges, 46607 markings/sec, 205 secs
lola: sara is running 210 secs || 9463585 markings, 21014190 edges, 44673 markings/sec, 210 secs
lola: sara is running 215 secs || 9677324 markings, 21545336 edges, 42748 markings/sec, 215 secs
lola: sara is running 220 secs || 9868720 markings, 22038226 edges, 38279 markings/sec, 220 secs
lola: sara is running 225 secs || 10078815 markings, 22514256 edges, 42019 markings/sec, 225 secs
lola: sara is running 230 secs || 10296903 markings, 23043967 edges, 43618 markings/sec, 230 secs
lola: sara is running 235 secs || 10513564 markings, 23581075 edges, 43332 markings/sec, 235 secs
lola: sara is running 240 secs || 10724579 markings, 24123518 edges, 42203 markings/sec, 240 secs
lola: sara is running 245 secs || 10942360 markings, 24661118 edges, 43556 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: 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: state equation: calling and running sarasubprocess 6 will run for 328 seconds at most (--localtimelimit=-1)

lola: ========================================
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
sara: try reading problem file QuasiCertifProtocol-PT-22-ReachabilityFireability-5.sara.
lola: state equation: Generated DNF with 2208 literals and 575 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 53 markings, 52 edges
lola: state equation: write sara problem file to QuasiCertifProtocol-PT-22-ReachabilityFireability-6.sara
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 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
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 1093 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 1640 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: 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 3281 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: state equation: calling and running sara
lola: ========================================
lola: RESULT
lola:
SUMMARY: yes no unknown yes yes yes yes yes yes yes no yes no yes yes yes
sara: try reading problem file QuasiCertifProtocol-PT-22-ReachabilityFireability-15.sara.
sara: place or transition ordering is non-deterministic

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 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-22"
export BK_EXAMINATION="ReachabilityFireability"
export BK_TOOL="mcc4mcc-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 mcc4mcc-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 r143-qhx2-152673584500091"
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 ;