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 2.5M
-rw-r--r-- 1 mcc users 34K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 128K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 13K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 59K 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 30K May 26 09:27 LTLCardinality.txt
-rw-r--r-- 1 mcc users 107K May 26 09:27 LTLCardinality.xml
-rw-r--r-- 1 mcc users 6.3K May 26 09:27 LTLFireability.txt
-rw-r--r-- 1 mcc users 27K May 26 09:27 LTLFireability.xml
-rw-r--r-- 1 mcc users 43K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 166K 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 8.3K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 38K May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 3.8K May 15 18:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 11K 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 1.8M May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool mcc4mcc-full
Input is QuasiCertifProtocol-PT-32, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r142-qhx2-152673583700105
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1527954011655


BK_STOP 1527954847285

--------------------
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-32 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': 1327995, 'Memory': 15946.66, 'Tool': 'lola'}, {'Time': 1380904, 'Memory': 15816.4, 'Tool': 'lola'}].
Learned tools are: [{'Tool': 'lola'}].
Learned tool lola is 1.0x far from the best tool lola.
ReachabilityFireability lola QuasiCertifProtocol-PT-32...
----- Start make prepare stderr -----

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


checking for too many tokens
===========================================================================================
QuasiCertifProtocol-PT-32: translating PT formula ReachabilityFireability into LoLA format
===========================================================================================
translating formula complete
touch formulae;
----- Start make result stdout -----
----- Start make result stderr -----
ReachabilityFireability @ QuasiCertifProtocol-PT-32 @ 3538 seconds
----- Start make result stderr -----
----- Start make result stdout -----
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: 4312/65536 symbol table entries, 134 collisions
lola: preprocessing...
lola: finding significant places
lola: 3806 places, 506 transitions, 505 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 671 transition conflict sets
lola: TASK
lola: reading formula from QuasiCertifProtocol-PT-32-ReachabilityFireability.task
lola: E (F (((FIREABLE(CsendTS1_19) OR FIREABLE(CsendTS1_18) OR FIREABLE(CsendTS1_21) OR FIREABLE(CsendTS1_20) OR FIREABLE(CsendTS1_23) OR FIREABLE(CsendTS1_22) OR FIREABLE(CsendTS1_25) OR FIREABLE(CsendTS1_24) OR FIREABLE(CsendTS1_27) OR FIREABLE(CsendTS1_26) OR FIREABLE(CsendTS1_29) OR FIREABLE(CsendTS1_28) OR FIREABLE(CsendTS1_31) OR FIREABLE(CsendTS1_30) OR FIREABLE(CsendTS1_32) OR FIREABLE(CsendTS1_1) OR FIREABLE(CsendTS1_0) OR FIREABLE(CsendTS1_2) OR FIREABLE(CsendTS1_3) OR FIREABLE(CsendTS1_4) OR FIREABLE(CsendTS1_5) OR FIREABLE(CsendTS1_6) OR FIREABLE(CsendTS1_7) OR FIREABLE(CsendTS1_8) OR FIREABLE(CsendTS1_9) OR FIREABLE(CsendTS1_10) OR FIREABLE(CsendTS1_11) OR FIREABLE(CsendTS1_12) OR FIREABLE(CsendTS1_13) OR FIREABLE(CsendTS1_14) OR FIREABLE(CsendTS1_15) OR FIREABLE(CsendTS1_16) OR FIREABLE(CsendTS1_17))))) : E (F ((FIREABLE(malA1) AND (FIREABLE(SackCS_2) OR FIREABLE(SackCS_3) OR FIREABLE(SackCS_0) OR FIREABLE(SackCS_1) OR FIREABLE(SackCS_6) OR FIREABLE(SackCS_7) OR FIREABLE(SackCS_4) OR FIREABLE(SackCS_5) OR FIREABLE(SackCS_10) OR FIREABLE(SackCS_11) OR FIREABLE(SackCS_8) OR FIREABLE(SackCS_9) OR FIREABLE(SackCS_14) OR FIREABLE(SackCS_15) OR FIREABLE(SackCS_12) OR FIREABLE(SackCS_13) OR FIREABLE(SackCS_21) OR FIREABLE(SackCS_20) OR FIREABLE(SackCS_23) OR FIREABLE(SackCS_22) OR FIREABLE(SackCS_17) OR FIREABLE(SackCS_16) OR FIREABLE(SackCS_19) OR FIREABLE(SackCS_18) OR FIREABLE(SackCS_29) OR FIREABLE(SackCS_28) OR FIREABLE(SackCS_31) OR FIREABLE(SackCS_30) OR FIREABLE(SackCS_25) OR FIREABLE(SackCS_24) OR FIREABLE(SackCS_27) OR FIREABLE(SackCS_26) OR FIREABLE(SackCS_32) OR FIREABLE(AreqCS))))) : A (G ((FIREABLE(SackCS_2) OR FIREABLE(SackCS_3) OR FIREABLE(SackCS_0) OR FIREABLE(SackCS_1) OR FIREABLE(SackCS_6) OR FIREABLE(SackCS_7) OR FIREABLE(SackCS_4) OR FIREABLE(SackCS_5) OR FIREABLE(SackCS_10) OR FIREABLE(SackCS_11) OR FIREABLE(SackCS_8) OR FIREABLE(SackCS_9) OR FIREABLE(SackCS_14) OR FIREABLE(SackCS_15) OR FIREABLE(SackCS_12) OR FIREABLE(SackCS_13) OR FIREABLE(SackCS_21) OR FIREABLE(SackCS_20) OR FIREABLE(SackCS_23) OR FIREABLE(SackCS_22) OR FIREABLE(SackCS_17) OR FIREABLE(SackCS_16) OR FIREABLE(SackCS_19) OR FIREABLE(SackCS_18) OR FIREABLE(SackCS_29) OR FIREABLE(SackCS_28) OR FIREABLE(SackCS_31) OR FIREABLE(SackCS_30) OR FIREABLE(SackCS_25) OR FIREABLE(SackCS_24) OR FIREABLE(SackCS_27) OR FIREABLE(SackCS_26) OR FIREABLE(SackCS_32) OR NOT FIREABLE(AgetTS)))) : A (G (((NOT FIREABLE(SsendTS_20) AND NOT FIREABLE(SsendTS_19) AND NOT FIREABLE(SsendTS_18) AND NOT FIREABLE(SsendTS_17) AND NOT FIREABLE(SsendTS_24) AND NOT FIREABLE(SsendTS_23) AND NOT FIREABLE(SsendTS_22) AND NOT FIREABLE(SsendTS_21) AND NOT FIREABLE(SsendTS_28) AND NOT FIREABLE(SsendTS_27) AND NOT FIREABLE(SsendTS_26) AND NOT FIREABLE(SsendTS_25) AND NOT FIREABLE(SsendTS_32) AND NOT FIREABLE(SsendTS_31) AND NOT FIREABLE(SsendTS_30) AND NOT FIREABLE(SsendTS_29) AND NOT FIREABLE(SsendTS_0) AND NOT FIREABLE(SsendTS_1) AND NOT FIREABLE(SsendTS_2) AND NOT FIREABLE(SsendTS_3) AND NOT FIREABLE(SsendTS_4) AND NOT FIREABLE(SsendTS_5) AND NOT FIREABLE(SsendTS_6) AND NOT FIREABLE(SsendTS_7) AND NOT FIREABLE(SsendTS_8) AND NOT FIREABLE(SsendTS_9) AND NOT FIREABLE(SsendTS_10) AND NOT FIREABLE(SsendTS_11) AND NOT FIREABLE(SsendTS_12) AND NOT FIREABLE(SsendTS_13) AND NOT FIREABLE(SsendTS_14) AND NOT FIREABLE(SsendTS_15) AND NOT FIREABLE(SsendTS_16)) OR NOT FIREABLE(AackCS) OR (NOT FIREABLE(CsendTS1_19) AND NOT FIREABLE(CsendTS1_18) AND NOT FIREABLE(CsendTS1_21) AND NOT FIREABLE(CsendTS1_20) AND NOT FIREABLE(CsendTS1_23) AND NOT FIREABLE(CsendTS1_22) AND NOT FIREABLE(CsendTS1_25) AND NOT FIREABLE(CsendTS1_24) AND NOT FIREABLE(CsendTS1_27) AND NOT FIREABLE(CsendTS1_26) AND NOT FIREABLE(CsendTS1_29) AND NOT FIREABLE(CsendTS1_28) AND NOT FIREABLE(CsendTS1_31) AND NOT FIREABLE(CsendTS1_30) AND NOT FIREABLE(CsendTS1_32) AND NOT FIREABLE(CsendTS1_1) AND NOT FIREABLE(CsendTS1_0) AND NOT FIREABLE(CsendTS1_2) AND NOT FIREABLE(CsendTS1_3) AND NOT FIREABLE(CsendTS1_4) AND NOT FIREABLE(CsendTS1_5) AND NOT FIREABLE(CsendTS1_6) AND NOT FIREABLE(CsendTS1_7) AND NOT FIREABLE(CsendTS1_8) AND NOT FIREABLE(CsendTS1_9) AND NOT FIREABLE(CsendTS1_10) AND NOT FIREABLE(CsendTS1_11) AND NOT FIREABLE(CsendTS1_12) AND NOT FIREABLE(CsendTS1_13) AND NOT FIREABLE(CsendTS1_14) AND NOT FIREABLE(CsendTS1_15) AND NOT FIREABLE(CsendTS1_16) AND NOT FIREABLE(CsendTS1_17) AND NOT FIREABLE(malA3)) OR (((NOT FIREABLE(ScertCS_7) AND NOT FIREABLE(ScertCS_6) AND NOT FIREABLE(ScertCS_5) AND NOT FIREABLE(ScertCS_4) AND NOT FIREABLE(ScertCS_11) AND NOT FIREABLE(ScertCS_10) AND NOT FIREABLE(ScertCS_9) AND NOT FIREABLE(ScertCS_8) AND NOT FIREABLE(ScertCS_3) AND NOT FIREABLE(ScertCS_2) AND NOT FIREABLE(ScertCS_1) AND NOT FIREABLE(ScertCS_0) AND NOT FIREABLE(ScertCS_24) AND NOT FIREABLE(ScertCS_25) AND NOT FIREABLE(ScertCS_26) AND NOT FIREABLE(ScertCS_27) AND NOT FIREABLE(ScertCS_20) AND NOT FIREABLE(ScertCS_21) AND NOT FIREABLE(ScertCS_22) AND NOT FIREABLE(ScertCS_23) AND NOT FIREABLE(ScertCS_16) AND NOT FIREABLE(ScertCS_17) AND NOT FIREABLE(ScertCS_18) AND NOT FIREABLE(ScertCS_19) AND NOT FIREABLE(ScertCS_12) AND NOT FIREABLE(ScertCS_13) AND NOT FIREABLE(ScertCS_14) AND NOT FIREABLE(ScertCS_15) AND NOT FIREABLE(ScertCS_32) AND NOT FIREABLE(ScertCS_29) AND NOT FIREABLE(ScertCS_28) AND NOT FIREABLE(ScertCS_31) AND NOT FIREABLE(ScertCS_30)) OR NOT FIREABLE(AreqTS)) AND (FIREABLE(malC1_17) OR FIREABLE(malC1_18) OR FIREABLE(malC1_15) OR FIREABLE(malC1_16) OR FIREABLE(malC1_21) OR FIREABLE(malC1_22) OR FIREABLE(malC1_19) OR FIREABLE(malC1_20) OR FIREABLE(malC1_25) OR FIREABLE(malC1_26) OR FIREABLE(malC1_23) OR FIREABLE(malC1_24) OR FIREABLE(malC1_29) OR FIREABLE(malC1_30) OR FIREABLE(malC1_27) OR FIREABLE(malC1_28) OR FIREABLE(malC1_2) OR FIREABLE(malC1_1) OR FIREABLE(malC1_0) OR FIREABLE(malC1_6) OR FIREABLE(malC1_5) OR FIREABLE(malC1_4) OR FIREABLE(malC1_3) OR FIREABLE(malC1_10) OR FIREABLE(malC1_9) OR FIREABLE(malC1_8) OR FIREABLE(malC1_7) OR FIREABLE(malC1_14) OR FIREABLE(malC1_13) OR FIREABLE(malC1_12) OR FIREABLE(malC1_11) OR FIREABLE(malC1_31) OR FIREABLE(malC1_32)))))) : E (F ((FIREABLE(SgetTS_23) OR FIREABLE(SgetTS_24) OR FIREABLE(SgetTS_21) OR FIREABLE(SgetTS_22) OR FIREABLE(SgetTS_27) OR FIREABLE(SgetTS_28) OR FIREABLE(SgetTS_25) OR FIREABLE(SgetTS_26) OR FIREABLE(SgetTS_15) OR FIREABLE(SgetTS_16) OR FIREABLE(SgetTS_13) OR FIREABLE(SgetTS_14) OR FIREABLE(SgetTS_19) OR FIREABLE(SgetTS_20) OR FIREABLE(SgetTS_17) OR FIREABLE(SgetTS_18) OR FIREABLE(SgetTS_32) OR FIREABLE(SgetTS_31) OR FIREABLE(SgetTS_30) OR FIREABLE(SgetTS_29) OR FIREABLE(SgetTS_6) OR FIREABLE(SgetTS_5) OR FIREABLE(SgetTS_8) OR FIREABLE(SgetTS_7) OR FIREABLE(SgetTS_10) OR FIREABLE(SgetTS_9) OR FIREABLE(SgetTS_12) OR FIREABLE(SgetTS_11) OR FIREABLE(SgetTS_0) OR FIREABLE(SgetTS_2) OR FIREABLE(SgetTS_1) OR FIREABLE(SgetTS_4) OR FIREABLE(SgetTS_3)))) : E (F (FIREABLE(malA4))) : E (F (FIREABLE(AstartCS))) : E (F (((FIREABLE(SreqTS_4) OR FIREABLE(SreqTS_5) OR FIREABLE(SreqTS_2) OR FIREABLE(SreqTS_3) OR FIREABLE(SreqTS_0) OR FIREABLE(SreqTS_1) OR FIREABLE(SreqTS_12) OR FIREABLE(SreqTS_13) OR FIREABLE(SreqTS_10) OR FIREABLE(SreqTS_11) OR FIREABLE(SreqTS_8) OR FIREABLE(SreqTS_9) OR FIREABLE(SreqTS_6) OR FIREABLE(SreqTS_7) OR FIREABLE(SreqTS_22) OR FIREABLE(SreqTS_23) OR FIREABLE(SreqTS_24) OR FIREABLE(SreqTS_25) OR FIREABLE(SreqTS_26) OR FIREABLE(SreqTS_27) OR FIREABLE(SreqTS_28) OR FIREABLE(SreqTS_29) OR FIREABLE(SreqTS_14) OR FIREABLE(SreqTS_15) OR FIREABLE(SreqTS_16) OR FIREABLE(SreqTS_17) OR FIREABLE(SreqTS_18) OR FIREABLE(SreqTS_19) OR FIREABLE(SreqTS_20) OR FIREABLE(SreqTS_21) OR FIREABLE(SreqTS_31) OR FIREABLE(SreqTS_30) OR FIREABLE(SreqTS_32)) AND (FIREABLE(malS5_31) OR FIREABLE(malS5_32) OR FIREABLE(malS5_29) OR FIREABLE(malS5_30) OR FIREABLE(malS5_9) OR FIREABLE(malS5_10) OR FIREABLE(malS5_11) OR FIREABLE(malS5_12) OR FIREABLE(malS5_5) OR FIREABLE(malS5_6) OR FIREABLE(malS5_7) OR FIREABLE(malS5_8) OR FIREABLE(malS5_1) OR FIREABLE(malS5_2) OR FIREABLE(malS5_3) OR FIREABLE(malS5_4) OR FIREABLE(malS5_0) OR FIREABLE(malS5_26) OR FIREABLE(malS5_25) OR FIREABLE(malS5_28) OR FIREABLE(malS5_27) OR FIREABLE(malS5_22) OR FIREABLE(malS5_21) OR FIREABLE(malS5_24) OR FIREABLE(malS5_23) OR FIREABLE(malS5_18) OR FIREABLE(malS5_17) OR FIREABLE(malS5_20) OR FIREABLE(malS5_19) OR FIREABLE(malS5_14) OR FIREABLE(malS5_13) OR FIREABLE(malS5_16) OR FIREABLE(malS5_15)) AND ((NOT FIREABLE(malS4_28) AND NOT FIREABLE(malS4_29) AND NOT FIREABLE(malS4_30) AND NOT FIREABLE(malS4_31) AND NOT FIREABLE(malS4_32) AND NOT FIREABLE(malS4_6) AND NOT FIREABLE(malS4_7) AND NOT FIREABLE(malS4_4) AND NOT FIREABLE(malS4_5) AND NOT FIREABLE(malS4_10) AND NOT FIREABLE(malS4_11) AND NOT FIREABLE(malS4_8) AND NOT FIREABLE(malS4_9) AND NOT FIREABLE(malS4_2) AND NOT FIREABLE(malS4_3) AND NOT FIREABLE(malS4_0) AND NOT FIREABLE(malS4_1) AND NOT FIREABLE(malS4_23) AND NOT FIREABLE(malS4_22) AND NOT FIREABLE(malS4_21) AND NOT FIREABLE(malS4_20) AND NOT FIREABLE(malS4_27) AND NOT FIREABLE(malS4_26) AND NOT FIREABLE(malS4_25) AND NOT FIREABLE(malS4_24) AND NOT FIREABLE(malS4_15) AND NOT FIREABLE(malS4_14) AND NOT FIREABLE(malS4_13) AND NOT FIREABLE(malS4_12) AND NOT FIREABLE(malS4_19) AND NOT FIREABLE(malS4_18) AND NOT FIREABLE(malS4_17) AND NOT FIREABLE(malS4_16)) OR (NOT FIREABLE(malS2_31) AND NOT FIREABLE(malS2_30) AND NOT FIREABLE(malS2_32) AND NOT FIREABLE(malS2_27) AND NOT FIREABLE(malS2_26) AND NOT FIREABLE(malS2_29) AND NOT FIREABLE(malS2_28) AND NOT FIREABLE(malS2_1) AND NOT FIREABLE(malS2_0) AND NOT FIREABLE(malS2_9) AND NOT FIREABLE(malS2_8) AND NOT FIREABLE(malS2_7) AND NOT FIREABLE(malS2_6) AND NOT FIREABLE(malS2_5) AND NOT FIREABLE(malS2_4) AND NOT FIREABLE(malS2_3) AND NOT FIREABLE(malS2_2) AND NOT FIREABLE(malS2_16) AND NOT FIREABLE(malS2_17) AND NOT FIREABLE(malS2_14) AND NOT FIREABLE(malS2_15) AND NOT FIREABLE(malS2_12) AND NOT FIREABLE(malS2_13) AND NOT FIREABLE(malS2_10) AND NOT FIREABLE(malS2_11) AND NOT FIREABLE(malS2_24) AND NOT FIREABLE(malS2_25) AND NOT FIREABLE(malS2_22) AND NOT FIREABLE(malS2_23) AND NOT FIREABLE(malS2_20) AND NOT FIREABLE(malS2_21) AND NOT FIREABLE(malS2_18) AND NOT FIREABLE(malS2_19)) OR (NOT FIREABLE(malS1_28) AND NOT FIREABLE(malS1_27) AND NOT FIREABLE(malS1_26) AND NOT FIREABLE(malS1_25) AND NOT FIREABLE(malS1_32) AND NOT FIREABLE(malS1_31) AND NOT FIREABLE(malS1_30) AND NOT FIREABLE(malS1_29) AND NOT FIREABLE(malS1_0) AND NOT FIREABLE(malS1_6) AND NOT FIREABLE(malS1_5) AND NOT FIREABLE(malS1_8) AND NOT FIREABLE(malS1_7) AND NOT FIREABLE(malS1_2) AND NOT FIREABLE(malS1_1) AND NOT FIREABLE(malS1_4) AND NOT FIREABLE(malS1_3) AND NOT FIREABLE(malS1_13) AND NOT FIREABLE(malS1_14) AND NOT FIREABLE(malS1_15) AND NOT FIREABLE(malS1_16) AND NOT FIREABLE(malS1_9) AND NOT FIREABLE(malS1_10) AND NOT FIREABLE(malS1_11) AND NOT FIREABLE(malS1_12) AND NOT FIREABLE(malS1_21) AND NOT FIREABLE(malS1_22) AND NOT FIREABLE(malS1_23) AND NOT FIREABLE(malS1_24) AND NOT FIREABLE(malS1_17) AND NOT FIREABLE(malS1_18) AND NOT FIREABLE(malS1_19) AND NOT FIREABLE(malS1_20) AND NOT FIREABLE(malA3)))))) : E (F ((FIREABLE(CgenCertif_7) OR (FIREABLE(malS6_27) AND (FIREABLE(SreqTS_27) OR FIREABLE(SreqTS_23) OR NOT FIREABLE(malS3_20)))))) : A (G ((NOT FIREABLE(malS2_32) OR NOT FIREABLE(ScertCS_16) OR NOT FIREABLE(CgenCertif_7) OR NOT FIREABLE(malS5_31)))) : E (F ((FIREABLE(SgetTS_0) AND FIREABLE(SreqTS_1) AND NOT FIREABLE(SgetTS_32) AND (FIREABLE(malC1_29) OR FIREABLE(malS5_22)) AND FIREABLE(SsendTS_8)))) : E (F (FIREABLE(malC1_15))) : A (G (((NOT FIREABLE(malS4_15) AND NOT FIREABLE(ScertCS_0)) OR (NOT FIREABLE(malS6_24) AND NOT FIREABLE(SreqTS_19)) OR (FIREABLE(malS2_24) AND (FIREABLE(malS4_12) OR FIREABLE(SsendTS_29) OR FIREABLE(SsendTS_14)))))) : E (F ((FIREABLE(malS5_24) AND FIREABLE(SsendTS_15) AND FIREABLE(SgetTS_9) AND (FIREABLE(CgenCertif_7) OR FIREABLE(CsendTS1_25) OR FIREABLE(malC1_32)) AND ((NOT FIREABLE(Sperform_4) AND NOT FIREABLE(SackCS_7)) OR (NOT FIREABLE(SreqTS_25) AND NOT FIREABLE(malS2_22)))))) : A (G ((NOT FIREABLE(SackCS_26) OR NOT FIREABLE(CgenCertif_21) OR NOT FIREABLE(SreqTS_26) OR NOT FIREABLE(malS2_9) OR NOT FIREABLE(malS3_5) OR NOT FIREABLE(SgetTS_29) OR (FIREABLE(SsendTS_22) AND FIREABLE(malS1_3)) OR FIREABLE(CsendTS1_22)))) : E (F ((FIREABLE(malC1_17) AND NOT FIREABLE(SgetTS_27) AND FIREABLE(malS6_25) AND FIREABLE(SackCS_6))))
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((FIREABLE(CsendTS1_19) OR FIREABLE(CsendTS1_18) OR FIREABLE(CsendTS1_21) OR FIREABLE(CsendTS1_20) OR FIREABLE(CsendTS1_23) OR FIREABLE(CsendTS1_22) OR FIREABLE(CsendTS1_25) OR FIREABLE(CsendTS1_24) OR FIREABLE(CsendTS1_27) OR FIREABLE(CsendTS1_26) OR FIREABLE(CsendTS1_29) OR FIREABLE(CsendTS1_28) OR FIREABLE(CsendTS1_31) OR FIREABLE(CsendTS1_30) OR FIREABLE(CsendTS1_32) OR FI... (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 2020 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 1122 literals and 33 conjunctive subformulas
lola: state equation: write sara problem file to QuasiCertifProtocol-PT-32-ReachabilityFireability.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 138 markings, 137 edges
lola: ========================================
lola: subprocess 1 will run for 235 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(malA1) AND (FIREABLE(SackCS_2) OR FIREABLE(SackCS_3) OR FIREABLE(SackCS_0) OR FIREABLE(SackCS_1) OR FIREABLE(SackCS_6) OR FIREABLE(SackCS_7) OR FIREABLE(SackCS_4) OR FIREABLE(SackCS_5) OR FIREABLE(SackCS_10) OR FIREABLE(SackCS_11) OR FIREABLE(SackCS_8) OR FIREABLE(SackCS_9) OR FIREABLE(SackCS_14) OR FIREABLE(SackCS_15) OR FIREABLE(SackCS_12) OR FIREABLE(SackCS_13) OR... (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 2020 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 101 literals and 34 conjunctive subformulas
lola: state equation: write sara problem file to QuasiCertifProtocol-PT-32-ReachabilityFireability.sara
lola: state equation: calling and running sara
sara: try reading problem file QuasiCertifProtocol-PT-32-ReachabilityFireability.sara.
sara: place or transition ordering is non-deterministic
lola: sara is running 0 secs || 282900 markings, 564297 edges, 56580 markings/sec, 0 secs
lola: sara is running 5 secs || 570748 markings, 1227447 edges, 57570 markings/sec, 5 secs
lola: sara is running 10 secs || 846110 markings, 1848115 edges, 55072 markings/sec, 10 secs
lola: sara is running 15 secs || 1116348 markings, 2486368 edges, 54048 markings/sec, 15 secs
lola: sara is running 20 secs || 1379348 markings, 3127920 edges, 52600 markings/sec, 20 secs
lola: sara is running 25 secs || 1637497 markings, 3796088 edges, 51630 markings/sec, 25 secs
lola: sara is running 30 secs || 1889020 markings, 4460434 edges, 50305 markings/sec, 30 secs
lola: sara is running 35 secs || 2152158 markings, 5059836 edges, 52628 markings/sec, 35 secs
lola: sara is running 40 secs || 2409388 markings, 5667864 edges, 51446 markings/sec, 40 secs
lola: sara is running 45 secs || 2660928 markings, 6295096 edges, 50308 markings/sec, 45 secs
lola: sara is running 50 secs || 2905383 markings, 6953413 edges, 48891 markings/sec, 50 secs
lola: sara is running 55 secs || 3150395 markings, 7579681 edges, 49002 markings/sec, 55 secs

lola: state equation: solution impossible
lola: SUBRESULT
lola: result: no
lola: produced by: state equation
lola: The predicate is unreachable.
lola: ========================================
lola: subprocess 2 will run for 248 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((FIREABLE(SackCS_2) OR FIREABLE(SackCS_3) OR FIREABLE(SackCS_0) OR FIREABLE(SackCS_1) OR FIREABLE(SackCS_6) OR FIREABLE(SackCS_7) OR FIREABLE(SackCS_4) OR FIREABLE(SackCS_5) OR FIREABLE(SackCS_10) OR FIREABLE(SackCS_11) OR FIREABLE(SackCS_8) OR FIREABLE(SackCS_9) OR FIREABLE(SackCS_14) OR FIREABLE(SackCS_15) OR FIREABLE(SackCS_12) OR FIREABLE(SackCS_13) OR FIREABLE(SackCS_21)... (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 2020 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 35 markings, 34 edges
lola: ========================================
lola: subprocess 3 will run for 267 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((NOT FIREABLE(SsendTS_20) AND NOT FIREABLE(SsendTS_19) AND NOT FIREABLE(SsendTS_18) AND NOT FIREABLE(SsendTS_17) AND NOT FIREABLE(SsendTS_24) AND NOT FIREABLE(SsendTS_23) AND NOT FIREABLE(SsendTS_22) AND NOT FIREABLE(SsendTS_21) AND NOT FIREABLE(SsendTS_28) AND NOT FIREABLE(SsendTS_27) AND NOT FIREABLE(SsendTS_26) AND NOT FIREABLE(SsendTS_25) AND NOT FIREABLE(SsendTS_32) AND NOT FIREABLE(Ss... (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 2020 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: sara not yet started (preprocessing) || 126566 markings, 359195 edges, 25313 markings/sec, 0 secs
lola: sara not yet started (preprocessing) || 266846 markings, 804209 edges, 28056 markings/sec, 5 secs
lola: sara not yet started (preprocessing) || 433108 markings, 1358882 edges, 33252 markings/sec, 10 secs
lola: state equation: Could not create input for sara: DNF too long or DEADLOCK predicate contained
lola: sara not yet started (preprocessing) || 648610 markings, 2098162 edges, 43100 markings/sec, 15 secs
lola: sara not yet started (preprocessing) || 868136 markings, 2911101 edges, 43905 markings/sec, 20 secs
lola: sara not yet started (preprocessing) || 1086184 markings, 3745076 edges, 43610 markings/sec, 25 secs
lola: sara not yet started (preprocessing) || 1308081 markings, 4500823 edges, 44379 markings/sec, 30 secs
lola: sara not yet started (preprocessing) || 1524079 markings, 5298641 edges, 43200 markings/sec, 35 secs
lola: sara not yet started (preprocessing) || 1728266 markings, 6106738 edges, 40837 markings/sec, 40 secs
lola: sara not yet started (preprocessing) || 1931263 markings, 6855337 edges, 40599 markings/sec, 45 secs
lola: sara not yet started (preprocessing) || 2133286 markings, 7669041 edges, 40405 markings/sec, 50 secs
lola: sara not yet started (preprocessing) || 2341468 markings, 8490803 edges, 41636 markings/sec, 55 secs
lola: sara not yet started (preprocessing) || 2540457 markings, 9334692 edges, 39798 markings/sec, 60 secs
lola: sara not yet started (preprocessing) || 2731380 markings, 10197124 edges, 38185 markings/sec, 65 secs
lola: sara not yet started (preprocessing) || 2955962 markings, 11034027 edges, 44916 markings/sec, 70 secs
lola: sara not yet started (preprocessing) || 3177297 markings, 11823429 edges, 44267 markings/sec, 75 secs
lola: sara not yet started (preprocessing) || 3387304 markings, 12618441 edges, 42001 markings/sec, 80 secs
lola: sara not yet started (preprocessing) || 3596374 markings, 13412148 edges, 41814 markings/sec, 85 secs
lola: sara not yet started (preprocessing) || 3798904 markings, 14180184 edges, 40506 markings/sec, 90 secs
lola: sara not yet started (preprocessing) || 3995815 markings, 14973821 edges, 39382 markings/sec, 95 secs
lola: sara not yet started (preprocessing) || 4190397 markings, 15773856 edges, 38916 markings/sec, 100 secs
lola: sara not yet started (preprocessing) || 4383287 markings, 16586368 edges, 38578 markings/sec, 105 secs
lola: sara not yet started (preprocessing) || 4562278 markings, 17428043 edges, 35798 markings/sec, 110 secs
lola: sara not yet started (preprocessing) || 4763275 markings, 18179201 edges, 40199 markings/sec, 115 secs
lola: sara not yet started (preprocessing) || 4957905 markings, 18927983 edges, 38926 markings/sec, 120 secs
lola: sara not yet started (preprocessing) || 5148907 markings, 19684688 edges, 38200 markings/sec, 125 secs
lola: sara not yet started (preprocessing) || 5333245 markings, 20447817 edges, 36868 markings/sec, 130 secs
lola: sara not yet started (preprocessing) || 5515094 markings, 21226479 edges, 36370 markings/sec, 135 secs
lola: sara not yet started (preprocessing) || 5687196 markings, 22031773 edges, 34420 markings/sec, 140 secs
lola: sara not yet started (preprocessing) || 5876411 markings, 22783362 edges, 37843 markings/sec, 145 secs
lola: sara not yet started (preprocessing) || 6058108 markings, 23544799 edges, 36339 markings/sec, 150 secs
lola: sara not yet started (preprocessing) || 6237801 markings, 24317694 edges, 35939 markings/sec, 155 secs
lola: sara not yet started (preprocessing) || 6404578 markings, 25129722 edges, 33355 markings/sec, 160 secs
lola: sara not yet started (preprocessing) || 6588164 markings, 25904525 edges, 36717 markings/sec, 165 secs
lola: sara not yet started (preprocessing) || 6765551 markings, 26703819 edges, 35477 markings/sec, 170 secs
lola: sara not yet started (preprocessing) || 6937309 markings, 27512095 edges, 34352 markings/sec, 175 secs
lola: sara not yet started (preprocessing) || 7107827 markings, 28332941 edges, 34104 markings/sec, 180 secs
lola: sara not yet started (preprocessing) || 7271258 markings, 29159656 edges, 32686 markings/sec, 185 secs
lola: sara not yet started (preprocessing) || 7451999 markings, 29990851 edges, 36148 markings/sec, 190 secs
lola: sara not yet started (preprocessing) || 7676908 markings, 30755274 edges, 44982 markings/sec, 195 secs
lola: sara not yet started (preprocessing) || 7890417 markings, 31538590 edges, 42702 markings/sec, 200 secs
lola: sara not yet started (preprocessing) || 8095124 markings, 32353245 edges, 40941 markings/sec, 205 secs
lola: sara not yet started (preprocessing) || 8302259 markings, 33104796 edges, 41427 markings/sec, 210 secs
lola: sara not yet started (preprocessing) || 8497602 markings, 33906467 edges, 39069 markings/sec, 215 secs
lola: sara not yet started (preprocessing) || 8696400 markings, 34674978 edges, 39760 markings/sec, 220 secs
lola: sara not yet started (preprocessing) || 8883338 markings, 35451723 edges, 37388 markings/sec, 225 secs
lola: sara not yet started (preprocessing) || 9067006 markings, 36273438 edges, 36734 markings/sec, 230 secs
lola: sara not yet started (preprocessing) || 9254714 markings, 37076294 edges, 37542 markings/sec, 235 secs
lola: sara not yet started (preprocessing) || 9454965 markings, 37817211 edges, 40050 markings/sec, 240 secs
lola: sara not yet started (preprocessing) || 9640601 markings, 38577051 edges, 37127 markings/sec, 245 secs
lola: sara not yet started (preprocessing) || 9834214 markings, 39332863 edges, 38723 markings/sec, 250 secs
lola: sara not yet started (preprocessing) || 10019051 markings, 40106758 edges, 36967 markings/sec, 255 secs
lola: sara not yet started (preprocessing) || 10197146 markings, 40903486 edges, 35619 markings/sec, 260 secs
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 4 will run for 267 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(SgetTS_23) OR FIREABLE(SgetTS_24) OR FIREABLE(SgetTS_21) OR FIREABLE(SgetTS_22) OR FIREABLE(SgetTS_27) OR FIREABLE(SgetTS_28) OR FIREABLE(SgetTS_25) OR FIREABLE(SgetTS_26) OR FIREABLE(SgetTS_15) OR FIREABLE(SgetTS_16) OR FIREABLE(SgetTS_13) OR FIREABLE(SgetTS_14) OR FIREABLE(SgetTS_19) OR FIREABLE(SgetTS_20) OR FIREABLE(SgetTS_17) OR FIREABLE(SgetTS_18) 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 2020 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 1122 literals and 33 conjunctive subformulas
lola: state equation: write sara problem file to QuasiCertifProtocol-PT-32-ReachabilityFireability-4.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 171 markings, 170 edges
lola: ========================================
lola: subprocess 5 will run for 291 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (FIREABLE(malA4)))
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 2020 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-32-ReachabilityFireability-5.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 71 markings, 70 edges
lola: ========================================
lola: subprocess 6 will run for 320 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (FIREABLE(AstartCS)))
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 2020 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-32-ReachabilityFireability-6.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 71 markings, 70 edges
lola: ========================================
lola: subprocess 7 will run for 356 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((FIREABLE(SreqTS_4) OR FIREABLE(SreqTS_5) OR FIREABLE(SreqTS_2) OR FIREABLE(SreqTS_3) OR FIREABLE(SreqTS_0) OR FIREABLE(SreqTS_1) OR FIREABLE(SreqTS_12) OR FIREABLE(SreqTS_13) OR FIREABLE(SreqTS_10) OR FIREABLE(SreqTS_11) OR FIREABLE(SreqTS_8) OR FIREABLE(SreqTS_9) OR FIREABLE(SreqTS_6) OR FIREABLE(SreqTS_7) OR FIREABLE(SreqTS_22) OR FIREABLE(SreqTS_23) OR FIREABLE(SreqTS_24... (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 2020 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: 75 markings, 74 edges
lola: ========================================
lola: subprocess 8 will run for 401 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(CgenCertif_7) OR (FIREABLE(malS6_27) AND (FIREABLE(SreqTS_27) OR FIREABLE(SreqTS_23) OR NOT FIREABLE(malS3_20))))))
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 2020 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 43 literals and 4 conjunctive subformulas
lola: state equation: write sara problem file to QuasiCertifProtocol-PT-32-ReachabilityFireability-8.sara
lola: state equation: calling and running sara
sara: try reading problem file QuasiCertifProtocol-PT-32-ReachabilityFireability-8.sara.
sara: place or transition ordering is non-deterministic
lola: sara is running 0 secs || 123656 markings, 348356 edges, 24731 markings/sec, 0 secs

lola: state equation: solution produced
lola: SUBRESULT
lola: result: yes
lola: produced by: state equation
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 9 will run for 457 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((NOT FIREABLE(malS2_32) OR NOT FIREABLE(ScertCS_16) OR NOT FIREABLE(CgenCertif_7) OR NOT FIREABLE(malS5_31))))
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 2020 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 39 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to QuasiCertifProtocol-PT-32-ReachabilityFireability-9.sara
lola: state equation: calling and running sara
sara: try reading problem file QuasiCertifProtocol-PT-32-ReachabilityFireability-9.sara.
sara: place or transition ordering is non-deterministic

lola: state equation: solution impossible
lola: SUBRESULT
lola: result: yes
lola: produced by: state equation
lola: The predicate is invariant.
lola: ========================================
lola: subprocess 10 will run for 533 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(SgetTS_0) AND FIREABLE(SreqTS_1) AND NOT FIREABLE(SgetTS_32) AND (FIREABLE(malC1_29) OR FIREABLE(malS5_22)) AND FIREABLE(SsendTS_8))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 2020 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 2720 literals and 68 conjunctive subformulas
lola: state equation: write sara problem file to QuasiCertifProtocol-PT-32-ReachabilityFireability-10.sara
lola: state equation: calling and running sara
sara: try reading problem file QuasiCertifProtocol-PT-32-ReachabilityFireability-10.sara.
sara: place or transition ordering is non-deterministic
lola: sara is running 0 secs || 268510 markings, 315560 edges, 53702 markings/sec, 0 secs
lola: sara is running 5 secs || 586262 markings, 695833 edges, 63550 markings/sec, 5 secs
lola: sara is running 10 secs || 913131 markings, 1092891 edges, 65374 markings/sec, 10 secs
lola: sara is running 15 secs || 1246824 markings, 1500962 edges, 66739 markings/sec, 15 secs
lola: sara is running 20 secs || 1569238 markings, 1904300 edges, 64483 markings/sec, 20 secs
lola: sara is running 25 secs || 1901244 markings, 2329459 edges, 66401 markings/sec, 25 secs
lola: sara is running 30 secs || 2240563 markings, 2760387 edges, 67864 markings/sec, 30 secs
lola: sara is running 35 secs || 2579430 markings, 3206077 edges, 67773 markings/sec, 35 secs
lola: sara is running 40 secs || 2916634 markings, 3658679 edges, 67441 markings/sec, 40 secs
lola: sara is running 45 secs || 3250416 markings, 4118383 edges, 66756 markings/sec, 45 secs
lola: sara is running 50 secs || 3584462 markings, 4586611 edges, 66809 markings/sec, 50 secs
lola: sara is running 55 secs || 3918443 markings, 5058820 edges, 66796 markings/sec, 55 secs
lola: sara is running 60 secs || 4251176 markings, 5545198 edges, 66547 markings/sec, 60 secs
lola: sara is running 65 secs || 4581621 markings, 6042308 edges, 66089 markings/sec, 65 secs
lola: sara is running 70 secs || 4910034 markings, 6553662 edges, 65683 markings/sec, 70 secs
lola: sara is running 75 secs || 5236872 markings, 7081131 edges, 65368 markings/sec, 75 secs
lola: sara is running 80 secs || 5560440 markings, 7626046 edges, 64714 markings/sec, 80 secs
lola: sara is running 85 secs || 5881307 markings, 8193780 edges, 64173 markings/sec, 85 secs
lola: sara is running 90 secs || 6175226 markings, 8719772 edges, 58784 markings/sec, 90 secs
lola: sara is running 95 secs || 6437247 markings, 9237748 edges, 52404 markings/sec, 95 secs
lola: sara is running 100 secs || 6637784 markings, 9862940 edges, 40107 markings/sec, 100 secs
lola: sara is running 105 secs || 6833505 markings, 10523078 edges, 39144 markings/sec, 105 secs
lola: sara is running 110 secs || 7049095 markings, 11147313 edges, 43118 markings/sec, 110 secs
lola: sara is running 115 secs || 7247479 markings, 11794399 edges, 39677 markings/sec, 115 secs

lola: state equation: solution impossible
lola: SUBRESULT
lola: result: no
lola: produced by: state equation
lola: The predicate is unreachable.
lola: ========================================
lola: subprocess 11 will run for 614 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (FIREABLE(malC1_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 2020 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-32-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: 139 markings, 138 edges
lola: ========================================
lola: subprocess 12 will run for 768 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((NOT FIREABLE(malS4_15) AND NOT FIREABLE(ScertCS_0)) OR (NOT FIREABLE(malS6_24) AND NOT FIREABLE(SreqTS_19)) OR (FIREABLE(malS2_24) AND (FIREABLE(malS4_12) OR FIREABLE(SsendTS_29) OR FIREABLE(SsendTS_14))))))
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 2020 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 135 literals and 25 conjunctive subformulas
lola: state equation: write sara problem file to QuasiCertifProtocol-PT-32-ReachabilityFireability-12.sara
lola: state equation: calling and running sara
sara: try reading problem file QuasiCertifProtocol-PT-32-ReachabilityFireability-12.sara.
sara: place or transition ordering is non-deterministic
lola: sara is running 0 secs || 182516 markings, 623753 edges, 36503 markings/sec, 0 secs
lola: sara is running 5 secs || 358524 markings, 1324057 edges, 35202 markings/sec, 5 secs
lola: sara is running 10 secs || 527277 markings, 2045896 edges, 33751 markings/sec, 10 secs
lola: sara is running 15 secs || 694845 markings, 2823277 edges, 33514 markings/sec, 15 secs
lola: sara is running 20 secs || 851895 markings, 3598168 edges, 31410 markings/sec, 20 secs

lola: state equation: solution produced
lola: SUBRESULT
lola: result: no
lola: produced by: state equation
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 13 will run for 1014 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(malS5_24) AND FIREABLE(SsendTS_15) AND FIREABLE(SgetTS_9) AND (FIREABLE(CgenCertif_7) OR FIREABLE(CsendTS1_25) OR FIREABLE(malC1_32)) AND ((NOT FIREABLE(Sperform_4) AND NOT FIREABLE(SackCS_7)) OR (NOT FIREABLE(SreqTS_25) AND NOT FIREABLE(malS2_22))))))
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 2020 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 950 literals and 15 conjunctive subformulas
lola: state equation: write sara problem file to QuasiCertifProtocol-PT-32-ReachabilityFireability-13.sara
lola: state equation: calling and running sara
sara: try reading problem file QuasiCertifProtocol-PT-32-ReachabilityFireability-13.sara.
sara: place or transition ordering is non-deterministic
lola: sara is running 0 secs || 275897 markings, 324133 edges, 55179 markings/sec, 0 secs
lola: sara is running 5 secs || 594645 markings, 705582 edges, 63750 markings/sec, 5 secs
lola: sara is running 10 secs || 903401 markings, 1080623 edges, 61751 markings/sec, 10 secs
lola: sara is running 15 secs || 1213597 markings, 1458727 edges, 62039 markings/sec, 15 secs
lola: sara is running 20 secs || 1513704 markings, 1838176 edges, 60021 markings/sec, 20 secs

lola: sara is running 25 secs || 1812169 markings, 2210392 edges, 59693 markings/sec, 25 secs
lola: state equation: solution impossible
lola: SUBRESULT
lola: result: no
lola: produced by: state equation
lola: The predicate is unreachable.
lola: subprocess 14 will run for 1506 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ========================================
lola: ...considering subproblem: A (G ((NOT FIREABLE(SackCS_26) OR NOT FIREABLE(CgenCertif_21) OR NOT FIREABLE(SreqTS_26) OR NOT FIREABLE(malS2_9) OR NOT FIREABLE(malS3_5) OR NOT FIREABLE(SgetTS_29) OR (FIREABLE(SsendTS_22) AND FIREABLE(malS1_3)) OR FIREABLE(CsendTS1_22))))
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 2020 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 7854 literals and 102 conjunctive subformulas
lola: state equation: write sara problem file to QuasiCertifProtocol-PT-32-ReachabilityFireability-14.sara
lola: state equation: calling and running sara
sara: try reading problem file QuasiCertifProtocol-PT-32-ReachabilityFireability-14.sara.
sara: place or transition ordering is non-deterministic
lola: sara is running 0 secs || 220602 markings, 289073 edges, 44120 markings/sec, 0 secs
lola: sara is running 5 secs || 540338 markings, 764444 edges, 63947 markings/sec, 5 secs
lola: sara is running 10 secs || 825118 markings, 1271934 edges, 56956 markings/sec, 10 secs
lola: sara is running 15 secs || 1020118 markings, 1764283 edges, 39000 markings/sec, 15 secs
lola: sara is running 20 secs || 1220827 markings, 2330675 edges, 40142 markings/sec, 20 secs
lola: sara is running 25 secs || 1427113 markings, 2779867 edges, 41257 markings/sec, 25 secs
lola: sara is running 30 secs || 1745914 markings, 3242809 edges, 63760 markings/sec, 30 secs
lola: sara is running 35 secs || 2038965 markings, 3751649 edges, 58610 markings/sec, 35 secs
lola: sara is running 40 secs || 2242827 markings, 4236938 edges, 40772 markings/sec, 40 secs
lola: sara is running 45 secs || 2476919 markings, 4892040 edges, 46818 markings/sec, 45 secs
lola: sara is running 50 secs || 2731536 markings, 5411736 edges, 50923 markings/sec, 50 secs
lola: sara is running 55 secs || 3038226 markings, 5885185 edges, 61338 markings/sec, 55 secs
lola: sara is running 60 secs || 3305902 markings, 6380781 edges, 53535 markings/sec, 60 secs
lola: sara is running 65 secs || 3520425 markings, 6979410 edges, 42905 markings/sec, 65 secs
lola: sara is running 70 secs || 3761834 markings, 7665911 edges, 48282 markings/sec, 70 secs
lola: sara is running 75 secs || 4050885 markings, 8090377 edges, 57810 markings/sec, 75 secs
lola: sara is running 80 secs || 4339009 markings, 8593685 edges, 57625 markings/sec, 80 secs
lola: sara is running 85 secs || 4564529 markings, 9142728 edges, 45104 markings/sec, 85 secs
lola: sara is running 90 secs || 4804751 markings, 9815498 edges, 48044 markings/sec, 90 secs
lola: sara is running 95 secs || 5073900 markings, 10330077 edges, 53830 markings/sec, 95 secs
lola: sara is running 100 secs || 5365530 markings, 10831890 edges, 58326 markings/sec, 100 secs
lola: sara is running 105 secs || 5613730 markings, 11427572 edges, 49640 markings/sec, 105 secs
lola: sara is running 110 secs || 5855878 markings, 12107244 edges, 48430 markings/sec, 110 secs
lola: sara is running 115 secs || 6117998 markings, 12612758 edges, 52424 markings/sec, 115 secs
lola: sara is running 120 secs || 6388410 markings, 13094829 edges, 54082 markings/sec, 120 secs
lola: sara is running 125 secs || 6633526 markings, 13728143 edges, 49023 markings/sec, 125 secs
lola: sara is running 130 secs || 6881245 markings, 14429501 edges, 49544 markings/sec, 130 secs
lola: sara is running 135 secs || 7164851 markings, 14920214 edges, 56721 markings/sec, 135 secs
lola: sara is running 140 secs || 7440747 markings, 15506452 edges, 55179 markings/sec, 140 secs
lola: sara is running 145 secs || 7676872 markings, 16158288 edges, 47225 markings/sec, 145 secs
lola: sara is running 150 secs || 7944338 markings, 16782525 edges, 53493 markings/sec, 150 secs
lola: sara is running 155 secs || 8208355 markings, 17270387 edges, 52803 markings/sec, 155 secs
lola: sara is running 160 secs || 8428313 markings, 17884283 edges, 43992 markings/sec, 160 secs
lola: sara is running 165 secs || 8665464 markings, 18556323 edges, 47430 markings/sec, 165 secs
lola: sara is running 170 secs || 8924535 markings, 19013910 edges, 51814 markings/sec, 170 secs
lola: sara is running 175 secs || 9170800 markings, 19622719 edges, 49253 markings/sec, 175 secs
lola: sara is running 180 secs || 9402780 markings, 20271159 edges, 46396 markings/sec, 180 secs

lola: state equation: solution impossible
lola: SUBRESULT
lola: result: yes
lola: produced by: state equation
lola: The predicate is invariant.
lola: ========================================
lola: subprocess 15 will run for 2825 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(malC1_17) AND NOT FIREABLE(SgetTS_27) AND FIREABLE(malS6_25) AND FIREABLE(SackCS_6))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 2020 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 238 literals and 34 conjunctive subformulas
lola: state equation: write sara problem file to QuasiCertifProtocol-PT-32-ReachabilityFireability-15.sara
lola: state equation: calling and running sara
sara: try reading problem file QuasiCertifProtocol-PT-32-ReachabilityFireability-15.sara.
sara: place or transition ordering is non-deterministic
lola: sara is running 0 secs || 192534 markings, 255250 edges, 38507 markings/sec, 0 secs
lola: sara is running 5 secs || 392681 markings, 525779 edges, 40029 markings/sec, 5 secs
lola: sara is running 10 secs || 655411 markings, 895492 edges, 52546 markings/sec, 10 secs
lola: sara is running 15 secs || 938071 markings, 1308040 edges, 56532 markings/sec, 15 secs
lola: sara is running 20 secs || 1233690 markings, 1752679 edges, 59124 markings/sec, 20 secs
lola: sara is running 25 secs || 1522119 markings, 2211455 edges, 57686 markings/sec, 25 secs
lola: sara is running 30 secs || 1812508 markings, 2687424 edges, 58078 markings/sec, 30 secs
lola: sara is running 35 secs || 2099029 markings, 3177480 edges, 57304 markings/sec, 35 secs
lola: sara is running 40 secs || 2376502 markings, 3681982 edges, 55495 markings/sec, 40 secs
lola: sara is running 45 secs || 2645250 markings, 4197693 edges, 53750 markings/sec, 45 secs
lola: sara is running 50 secs || 2904254 markings, 4720677 edges, 51801 markings/sec, 50 secs
lola: sara is running 55 secs || 3145610 markings, 5250782 edges, 48271 markings/sec, 55 secs

lola: sara is running 60 secs || 3362741 markings, 5742098 edges, 43426 markings/sec, 60 secs
lola: state equation: solution impossible
lola: SUBRESULT
lola: result: no
lola: produced by: state equation
lola: The predicate is unreachable.
lola: RESULT
lola:
SUMMARY: yes no no unknown yes yes yes yes yes yes no yes no no yes no
lola: ========================================
FORMULA QuasiCertifProtocol-PT-32-ReachabilityFireability-0 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA QuasiCertifProtocol-PT-32-ReachabilityFireability-1 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA QuasiCertifProtocol-PT-32-ReachabilityFireability-2 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA QuasiCertifProtocol-PT-32-ReachabilityFireability-3 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA QuasiCertifProtocol-PT-32-ReachabilityFireability-4 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA QuasiCertifProtocol-PT-32-ReachabilityFireability-5 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA QuasiCertifProtocol-PT-32-ReachabilityFireability-6 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA QuasiCertifProtocol-PT-32-ReachabilityFireability-7 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA QuasiCertifProtocol-PT-32-ReachabilityFireability-8 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA QuasiCertifProtocol-PT-32-ReachabilityFireability-9 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA QuasiCertifProtocol-PT-32-ReachabilityFireability-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA QuasiCertifProtocol-PT-32-ReachabilityFireability-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA QuasiCertifProtocol-PT-32-ReachabilityFireability-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA QuasiCertifProtocol-PT-32-ReachabilityFireability-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA QuasiCertifProtocol-PT-32-ReachabilityFireability-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA QuasiCertifProtocol-PT-32-ReachabilityFireability-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stdout -----
----- Kill lola and sara stderr -----
----- Finished stdout -----
----- Finished stderr -----

Sequence of Actions to be Executed by the VM

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

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