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-structural
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 r143-qhx2-152673584500105
=====================================================================

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


BK_STOP 1528004922730

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

Time: 3600 - MCC
----- Start make prepare stdout -----
----- Start make prepare stderr -----
===========================================================================================
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: state equation: calling and running 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 || 251967 markings, 499751 edges, 50393 markings/sec, 0 secs
lola: sara is running 5 secs || 508799 markings, 1072830 edges, 51366 markings/sec, 5 secs
lola: sara is running 10 secs || 751468 markings, 1640717 edges, 48534 markings/sec, 10 secs
lola: sara is running 15 secs || 997955 markings, 2206950 edges, 49297 markings/sec, 15 secs
lola: sara is running 20 secs || 1255614 markings, 2814825 edges, 51532 markings/sec, 20 secs
lola: sara is running 25 secs || 1501773 markings, 3447034 edges, 49232 markings/sec, 25 secs
lola: sara is running 30 secs || 1752603 markings, 4122999 edges, 50166 markings/sec, 30 secs
lola: sara is running 35 secs || 2019706 markings, 4746053 edges, 53421 markings/sec, 35 secs
lola: sara is running 40 secs || 2245319 markings, 5297367 edges, 45123 markings/sec, 40 secs
lola: sara is running 45 secs || 2477099 markings, 5838863 edges, 46356 markings/sec, 45 secs
lola: sara is running 50 secs || 2697345 markings, 6403950 edges, 44049 markings/sec, 50 secs

lola: sara is running 55 secs || 2916462 markings, 6984391 edges, 43823 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) || 118430 markings, 333665 edges, 23686 markings/sec, 0 secs
lola: sara not yet started (preprocessing) || 241566 markings, 718096 edges, 24627 markings/sec, 5 secs
lola: sara not yet started (preprocessing) || 396683 markings, 1243767 edges, 31023 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) || 589414 markings, 1905022 edges, 38546 markings/sec, 15 secs
lola: sara not yet started (preprocessing) || 797915 markings, 2640791 edges, 41700 markings/sec, 20 secs
lola: sara not yet started (preprocessing) || 990218 markings, 3432090 edges, 38461 markings/sec, 25 secs
lola: sara not yet started (preprocessing) || 1197214 markings, 4115963 edges, 41399 markings/sec, 30 secs
lola: sara not yet started (preprocessing) || 1392937 markings, 4823184 edges, 39145 markings/sec, 35 secs
lola: sara not yet started (preprocessing) || 1588948 markings, 5556305 edges, 39202 markings/sec, 40 secs
lola: sara not yet started (preprocessing) || 1779839 markings, 6283256 edges, 38178 markings/sec, 45 secs
lola: sara not yet started (preprocessing) || 1971393 markings, 7000212 edges, 38311 markings/sec, 50 secs
lola: sara not yet started (preprocessing) || 2154668 markings, 7743135 edges, 36655 markings/sec, 55 secs
lola: sara not yet started (preprocessing) || 2340015 markings, 8483476 edges, 37069 markings/sec, 60 secs
lola: sara not yet started (preprocessing) || 2519168 markings, 9233171 edges, 35831 markings/sec, 65 secs
lola: sara not yet started (preprocessing) || 2692565 markings, 10008742 edges, 34679 markings/sec, 70 secs
lola: sara not yet started (preprocessing) || 2877597 markings, 10781733 edges, 37006 markings/sec, 75 secs
lola: sara not yet started (preprocessing) || 3088249 markings, 11500131 edges, 42130 markings/sec, 80 secs
lola: sara not yet started (preprocessing) || 3284787 markings, 12219978 edges, 39308 markings/sec, 85 secs
lola: sara not yet started (preprocessing) || 3468348 markings, 12979240 edges, 36712 markings/sec, 90 secs
lola: sara not yet started (preprocessing) || 3662846 markings, 13654788 edges, 38900 markings/sec, 95 secs
lola: sara not yet started (preprocessing) || 3843423 markings, 14364896 edges, 36115 markings/sec, 100 secs
lola: sara not yet started (preprocessing) || 4024389 markings, 15080185 edges, 36193 markings/sec, 105 secs
lola: sara not yet started (preprocessing) || 4214769 markings, 15866029 edges, 38076 markings/sec, 110 secs
lola: sara not yet started (preprocessing) || 4393950 markings, 16631328 edges, 35836 markings/sec, 115 secs
lola: sara not yet started (preprocessing) || 4556284 markings, 17397369 edges, 32467 markings/sec, 120 secs
lola: sara not yet started (preprocessing) || 4741551 markings, 18104771 edges, 37053 markings/sec, 125 secs
lola: sara not yet started (preprocessing) || 4933981 markings, 18828273 edges, 38486 markings/sec, 130 secs
lola: sara not yet started (preprocessing) || 5106853 markings, 19520769 edges, 34574 markings/sec, 135 secs
lola: sara not yet started (preprocessing) || 5288483 markings, 20271712 edges, 36326 markings/sec, 140 secs
lola: sara not yet started (preprocessing) || 5466272 markings, 21019293 edges, 35558 markings/sec, 145 secs
lola: sara not yet started (preprocessing) || 5642644 markings, 21812027 edges, 35274 markings/sec, 150 secs
lola: sara not yet started (preprocessing) || 5820134 markings, 22575227 edges, 35498 markings/sec, 155 secs
lola: sara not yet started (preprocessing) || 6001271 markings, 23324526 edges, 36227 markings/sec, 160 secs
lola: sara not yet started (preprocessing) || 6178295 markings, 24063495 edges, 35405 markings/sec, 165 secs
lola: sara not yet started (preprocessing) || 6349712 markings, 24842682 edges, 34283 markings/sec, 170 secs
lola: sara not yet started (preprocessing) || 6521374 markings, 25602892 edges, 34332 markings/sec, 175 secs
lola: sara not yet started (preprocessing) || 6693972 markings, 26369483 edges, 34520 markings/sec, 180 secs
lola: sara not yet started (preprocessing) || 6859047 markings, 27154046 edges, 33015 markings/sec, 185 secs
lola: sara not yet started (preprocessing) || 7028498 markings, 27942217 edges, 33890 markings/sec, 190 secs
lola: sara not yet started (preprocessing) || 7193748 markings, 28760208 edges, 33050 markings/sec, 195 secs
lola: sara not yet started (preprocessing) || 7349569 markings, 29588422 edges, 31164 markings/sec, 200 secs
lola: sara not yet started (preprocessing) || 7571958 markings, 30389569 edges, 44478 markings/sec, 205 secs
lola: sara not yet started (preprocessing) || 7793796 markings, 31177163 edges, 44368 markings/sec, 210 secs
lola: sara not yet started (preprocessing) || 8001898 markings, 31986823 edges, 41620 markings/sec, 215 secs
lola: sara not yet started (preprocessing) || 8193051 markings, 32701592 edges, 38231 markings/sec, 220 secs
lola: sara not yet started (preprocessing) || 8386082 markings, 33430921 edges, 38606 markings/sec, 225 secs
lola: sara not yet started (preprocessing) || 8573394 markings, 34182638 edges, 37462 markings/sec, 230 secs
lola: sara not yet started (preprocessing) || 8756141 markings, 34947451 edges, 36549 markings/sec, 235 secs
lola: sara not yet started (preprocessing) || 8940487 markings, 35713722 edges, 36869 markings/sec, 240 secs
lola: sara not yet started (preprocessing) || 9122285 markings, 36540637 edges, 36360 markings/sec, 245 secs
lola: sara not yet started (preprocessing) || 9315064 markings, 37296538 edges, 38556 markings/sec, 250 secs
lola: sara not yet started (preprocessing) || 9500567 markings, 37997698 edges, 37101 markings/sec, 255 secs
lola: sara not yet started (preprocessing) || 9685007 markings, 38736519 edges, 36888 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: state equation: calling and running 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 || 113287 markings, 320114 edges, 22657 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 || 252731 markings, 297378 edges, 50546 markings/sec, 0 secs
lola: sara is running 5 secs || 526176 markings, 626478 edges, 54689 markings/sec, 5 secs
lola: sara is running 10 secs || 842011 markings, 1003343 edges, 63167 markings/sec, 10 secs
lola: sara is running 15 secs || 1153254 markings, 1383876 edges, 62249 markings/sec, 15 secs
lola: sara is running 20 secs || 1451631 markings, 1762337 edges, 59675 markings/sec, 20 secs
lola: sara is running 25 secs || 1771000 markings, 2156839 edges, 63874 markings/sec, 25 secs
lola: sara is running 30 secs || 2078750 markings, 2550996 edges, 61550 markings/sec, 30 secs
lola: sara is running 35 secs || 2385025 markings, 2959345 edges, 61255 markings/sec, 35 secs
lola: sara is running 40 secs || 2701393 markings, 3369943 edges, 63274 markings/sec, 40 secs
lola: sara is running 45 secs || 3015610 markings, 3793960 edges, 62843 markings/sec, 45 secs
lola: sara is running 50 secs || 3328427 markings, 4221540 edges, 62563 markings/sec, 50 secs
lola: sara is running 55 secs || 3639191 markings, 4662716 edges, 62153 markings/sec, 55 secs
lola: sara is running 60 secs || 3953117 markings, 5112403 edges, 62785 markings/sec, 60 secs
lola: sara is running 65 secs || 4258359 markings, 5557318 edges, 61048 markings/sec, 65 secs
lola: sara is running 70 secs || 4564994 markings, 6017409 edges, 61327 markings/sec, 70 secs
lola: sara is running 75 secs || 4869946 markings, 6492319 edges, 60990 markings/sec, 75 secs
lola: sara is running 80 secs || 5174555 markings, 6981690 edges, 60922 markings/sec, 80 secs
lola: sara is running 85 secs || 5479858 markings, 7489968 edges, 61061 markings/sec, 85 secs
lola: sara is running 90 secs || 5785144 markings, 8015033 edges, 61057 markings/sec, 90 secs
lola: sara is running 95 secs || 6074155 markings, 8524283 edges, 57802 markings/sec, 95 secs
lola: sara is running 100 secs || 6346280 markings, 9028774 edges, 54425 markings/sec, 100 secs
lola: sara is running 105 secs || 6561492 markings, 9647722 edges, 43042 markings/sec, 105 secs
lola: sara is running 110 secs || 6763001 markings, 10296598 edges, 40302 markings/sec, 110 secs
lola: sara is running 115 secs || 6979483 markings, 10910659 edges, 43296 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 615 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: 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 769 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 || 183004 markings, 628888 edges, 36601 markings/sec, 0 secs
lola: sara is running 5 secs || 382304 markings, 1437727 edges, 39860 markings/sec, 5 secs
lola: sara is running 10 secs || 569646 markings, 2261032 edges, 37468 markings/sec, 10 secs
lola: sara is running 15 secs || 755114 markings, 3084231 edges, 37094 markings/sec, 15 secs
lola: sara is running 20 secs || 925889 markings, 3984696 edges, 34155 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 1015 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 || 254646 markings, 299729 edges, 50929 markings/sec, 0 secs
lola: sara is running 5 secs || 517087 markings, 616235 edges, 52488 markings/sec, 5 secs
lola: sara is running 10 secs || 814194 markings, 968863 edges, 59421 markings/sec, 10 secs
lola: sara is running 15 secs || 1079873 markings, 1296291 edges, 53136 markings/sec, 15 secs
lola: sara is running 20 secs || 1403748 markings, 1698242 edges, 64775 markings/sec, 20 secs

lola: sara is running 25 secs || 1719291 markings, 2093202 edges, 63109 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: ========================================
lola: subprocess 14 will run for 1508 seconds at most (--localtimelimit=-1)
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 || 224374 markings, 293745 edges, 44875 markings/sec, 0 secs
lola: sara is running 5 secs || 549105 markings, 777840 edges, 64946 markings/sec, 5 secs
lola: sara is running 10 secs || 831994 markings, 1284442 edges, 56578 markings/sec, 10 secs
lola: sara is running 15 secs || 1037278 markings, 1817381 edges, 41057 markings/sec, 15 secs
lola: sara is running 20 secs || 1232747 markings, 2356892 edges, 39094 markings/sec, 20 secs
lola: sara is running 25 secs || 1440608 markings, 2798110 edges, 41572 markings/sec, 25 secs
lola: sara is running 30 secs || 1731302 markings, 3221469 edges, 58139 markings/sec, 30 secs
lola: sara is running 35 secs || 2004584 markings, 3688652 edges, 54656 markings/sec, 35 secs
lola: sara is running 40 secs || 2202572 markings, 4123583 edges, 39598 markings/sec, 40 secs
lola: sara is running 45 secs || 2394975 markings, 4647209 edges, 38481 markings/sec, 45 secs
lola: sara is running 50 secs || 2611903 markings, 5245796 edges, 43386 markings/sec, 50 secs
lola: sara is running 55 secs || 2890935 markings, 5647336 edges, 55806 markings/sec, 55 secs
lola: sara is running 60 secs || 3182986 markings, 6143770 edges, 58410 markings/sec, 60 secs
lola: sara is running 65 secs || 3402677 markings, 6639602 edges, 43938 markings/sec, 65 secs
lola: sara is running 70 secs || 3647672 markings, 7321820 edges, 48999 markings/sec, 70 secs
lola: sara is running 75 secs || 3907885 markings, 7872221 edges, 52043 markings/sec, 75 secs
lola: sara is running 80 secs || 4206472 markings, 8349312 edges, 59717 markings/sec, 80 secs
lola: sara is running 85 secs || 4461480 markings, 8854195 edges, 51002 markings/sec, 85 secs
lola: sara is running 90 secs || 4704994 markings, 9524658 edges, 48703 markings/sec, 90 secs
lola: sara is running 95 secs || 4954289 markings, 10148200 edges, 49859 markings/sec, 95 secs
lola: sara is running 100 secs || 5249445 markings, 10619825 edges, 59031 markings/sec, 100 secs
lola: sara is running 105 secs || 5517286 markings, 11161431 edges, 53568 markings/sec, 105 secs
lola: sara is running 110 secs || 5755173 markings, 11815376 edges, 47577 markings/sec, 110 secs
lola: sara is running 115 secs || 5985137 markings, 12406133 edges, 45993 markings/sec, 115 secs
lola: sara is running 120 secs || 6273459 markings, 12880241 edges, 57664 markings/sec, 120 secs
lola: sara is running 125 secs || 6533727 markings, 13445332 edges, 52054 markings/sec, 125 secs
lola: sara is running 130 secs || 6772944 markings, 14108377 edges, 47843 markings/sec, 130 secs
lola: sara is running 135 secs || 7023915 markings, 14683070 edges, 50194 markings/sec, 135 secs
lola: sara is running 140 secs || 7296711 markings, 15166730 edges, 54559 markings/sec, 140 secs
lola: sara is running 145 secs || 7541014 markings, 15788101 edges, 48861 markings/sec, 145 secs
lola: sara is running 150 secs || 7776074 markings, 16448504 edges, 47012 markings/sec, 150 secs
lola: sara is running 155 secs || 8049997 markings, 16967440 edges, 54785 markings/sec, 155 secs
lola: sara is running 160 secs || 8309241 markings, 17540312 edges, 51849 markings/sec, 160 secs
lola: sara is running 165 secs || 8549123 markings, 18206488 edges, 47976 markings/sec, 165 secs
lola: sara is running 170 secs || 8800006 markings, 18783467 edges, 50177 markings/sec, 170 secs
lola: sara is running 175 secs || 9059638 markings, 19310368 edges, 51926 markings/sec, 175 secs
lola: sara is running 180 secs || 9290805 markings, 19943612 edges, 46233 markings/sec, 180 secs
lola: sara is running 185 secs || 9524561 markings, 20564805 edges, 46751 markings/sec, 185 secs
lola: sara is running 190 secs || 9786352 markings, 21080927 edges, 52358 markings/sec, 190 secs
lola: sara is running 195 secs || 10010316 markings, 21693763 edges, 44793 markings/sec, 195 secs
lola: sara is running 200 secs || 10235462 markings, 22322431 edges, 45029 markings/sec, 200 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 2808 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 || 169669 markings, 224101 edges, 33934 markings/sec, 0 secs
lola: sara is running 5 secs || 373873 markings, 500355 edges, 40841 markings/sec, 5 secs
lola: sara is running 10 secs || 632588 markings, 862867 edges, 51743 markings/sec, 10 secs
lola: sara is running 15 secs || 933607 markings, 1300870 edges, 60204 markings/sec, 15 secs
lola: sara is running 20 secs || 1212769 markings, 1720625 edges, 55832 markings/sec, 20 secs
lola: sara is running 25 secs || 1490654 markings, 2158032 edges, 55577 markings/sec, 25 secs
lola: sara is running 30 secs || 1779025 markings, 2639353 edges, 57674 markings/sec, 30 secs
lola: sara is running 35 secs || 2073780 markings, 3132252 edges, 58951 markings/sec, 35 secs
lola: sara is running 40 secs || 2348382 markings, 3627362 edges, 54920 markings/sec, 40 secs
lola: sara is running 45 secs || 2615942 markings, 4148676 edges, 53512 markings/sec, 45 secs
lola: sara is running 50 secs || 2883305 markings, 4675966 edges, 53473 markings/sec, 50 secs
lola: sara is running 55 secs || 3138478 markings, 5231903 edges, 51035 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: RESULT
lola:
SUMMARY: yes no no unknown yes yes yes yes yes yes no yes no no yes no
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-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-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-structural"
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 r143-qhx2-152673584500105"
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 ;