Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Waiting for the VM to be ready (probing ssh)
.........................................................
/home/mcc/execution
total 1.2M
-rw-r--r-- 1 mcc users 27K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 110K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 26K 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 13K May 26 09:27 LTLCardinality.txt
-rw-r--r-- 1 mcc users 49K May 26 09:27 LTLCardinality.xml
-rw-r--r-- 1 mcc users 4.0K May 26 09:27 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 26 09:27 LTLFireability.xml
-rw-r--r-- 1 mcc users 27K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 107K 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 6.7K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 30K May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 6.2K May 15 18:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 17K 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 686K May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool irma4mcc-structural
Input is QuasiCertifProtocol-PT-18, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r187-qhx2-152732139400062
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1528265424247


BK_STOP 1528265504952

--------------------
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-18 as instance name.
Using QuasiCertifProtocol as model name.
Using algorithm or tool bmdt.
Model characteristics are: {'Examination': 'LTLFireability', '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': 158, 'Memory': 106.91, 'Tool': 'lola'}, {'Time': 250, 'Memory': 107.33, 'Tool': 'lola'}].
Learned tools are: [{'Tool': 'lola'}].
Learned tool lola is 1.0x far from the best tool lola.
LTLFireability lola QuasiCertifProtocol-PT-18...

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


checking for too many tokens
===========================================================================================
QuasiCertifProtocol-PT-18: translating PT formula LTLFireability into LoLA format
===========================================================================================
translating formula complete
touch formulae;
----- Start make result stderr -----
----- Start make result stdout -----
LTLFireability @ QuasiCertifProtocol-PT-18 @ 3538 seconds
----- Start make result stdout -----
----- Start make result stderr -----
lola: LoLA will run for 3538 seconds at most (--timelimit)
lola: NET
lola: reading net from model.pnml.lola
lola: finished parsing
lola: closed net file model.pnml.lola
lola: 1694/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: finding significant places
lola: 1398 places, 296 transitions, 295 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 391 transition conflict sets
lola: TASK
lola: reading formula from QuasiCertifProtocol-PT-18-LTLFireability.task
lola: A ((G (((FIREABLE(SgetTS_6) OR FIREABLE(SgetTS_5) OR FIREABLE(SgetTS_4) OR FIREABLE(SgetTS_3) OR FIREABLE(SgetTS_10) OR FIREABLE(SgetTS_9) OR FIREABLE(SgetTS_8) OR FIREABLE(SgetTS_7) OR FIREABLE(SgetTS_2) OR FIREABLE(SgetTS_1) OR FIREABLE(SgetTS_0) OR FIREABLE(SgetTS_16) OR FIREABLE(SgetTS_15) OR FIREABLE(SgetTS_18) OR FIREABLE(SgetTS_17) OR FIREABLE(SgetTS_12) OR FIREABLE(SgetTS_11) OR FIREABLE(SgetTS_14) OR FIREABLE(SgetTS_13)) U (FIREABLE(malC1_4) OR FIREABLE(malC1_3) OR FIREABLE(malC1_6) OR FIREABLE(malC1_5) OR FIREABLE(malC1_0) OR FIREABLE(malC1_2) OR FIREABLE(malC1_1) 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_18) OR FIREABLE(malC1_17) OR FIREABLE(malC1_16) OR FIREABLE(malC1_15)))) U F (G (X ((FIREABLE(malC1_4) OR FIREABLE(malC1_3) OR FIREABLE(malC1_6) OR FIREABLE(malC1_5) OR FIREABLE(malC1_0) OR FIREABLE(malC1_2) OR FIREABLE(malC1_1) 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_18) OR FIREABLE(malC1_17) OR FIREABLE(malC1_16) OR FIREABLE(malC1_15))))))) : A (F (G (G (X (X ((FIREABLE(malS1_9) OR FIREABLE(malS1_10) OR FIREABLE(malS1_11) OR FIREABLE(malS1_12) OR FIREABLE(malS1_5) OR FIREABLE(malS1_6) OR FIREABLE(malS1_7) OR FIREABLE(malS1_8) OR FIREABLE(malS1_17) OR FIREABLE(malS1_18) OR FIREABLE(malS1_13) OR FIREABLE(malS1_14) OR FIREABLE(malS1_15) OR FIREABLE(malS1_16) OR FIREABLE(malS1_2) OR FIREABLE(malS1_1) OR FIREABLE(malS1_4) OR FIREABLE(malS1_3) OR FIREABLE(malS1_0)))))))) : A (F (X (F (FIREABLE(AreqTS))))) : A (G ((FIREABLE(SackCS_12) OR FIREABLE(SackCS_13) OR FIREABLE(SackCS_14) OR FIREABLE(SackCS_15) OR FIREABLE(SackCS_16) OR FIREABLE(SackCS_17) OR FIREABLE(SackCS_18) OR FIREABLE(SackCS_4) OR FIREABLE(SackCS_5) OR FIREABLE(SackCS_6) OR FIREABLE(SackCS_7) OR FIREABLE(SackCS_8) OR FIREABLE(SackCS_9) OR FIREABLE(SackCS_10) OR FIREABLE(SackCS_11) OR FIREABLE(SackCS_3) OR FIREABLE(SackCS_2) OR FIREABLE(SackCS_1) OR FIREABLE(SackCS_0)))) : A (X (F ((FIREABLE(malS5_0) OR FIREABLE(malS5_17) OR FIREABLE(malS5_18) OR FIREABLE(malS5_2) OR FIREABLE(malS5_1) OR FIREABLE(malS5_4) OR FIREABLE(malS5_3) OR FIREABLE(malS5_6) OR FIREABLE(malS5_5) OR FIREABLE(malS5_8) OR FIREABLE(malS5_7) OR FIREABLE(malS5_10) OR FIREABLE(malS5_9) OR FIREABLE(malS5_12) OR FIREABLE(malS5_11) OR FIREABLE(malS5_14) OR FIREABLE(malS5_13) OR FIREABLE(malS5_16) OR FIREABLE(malS5_15))))) : A (F (((FIREABLE(ScertCS_5) OR FIREABLE(ScertCS_4) OR FIREABLE(ScertCS_7) OR FIREABLE(ScertCS_6) OR FIREABLE(ScertCS_1) OR FIREABLE(ScertCS_0) OR FIREABLE(ScertCS_3) OR FIREABLE(ScertCS_2) OR FIREABLE(ScertCS_12) OR FIREABLE(ScertCS_13) OR FIREABLE(ScertCS_14) OR FIREABLE(ScertCS_15) OR FIREABLE(ScertCS_8) OR FIREABLE(ScertCS_9) OR FIREABLE(ScertCS_10) OR FIREABLE(ScertCS_11) OR FIREABLE(ScertCS_16) OR FIREABLE(ScertCS_17) OR FIREABLE(ScertCS_18)) U (FIREABLE(AreqCS) U FIREABLE(malA1))))) : A ((FIREABLE(SackCS_12) OR FIREABLE(SackCS_13) OR FIREABLE(SackCS_14) OR FIREABLE(SackCS_15) OR FIREABLE(SackCS_16) OR FIREABLE(SackCS_17) OR FIREABLE(SackCS_18) OR FIREABLE(SackCS_4) OR FIREABLE(SackCS_5) OR FIREABLE(SackCS_6) OR FIREABLE(SackCS_7) OR FIREABLE(SackCS_8) OR FIREABLE(SackCS_9) OR FIREABLE(SackCS_10) OR FIREABLE(SackCS_11) OR FIREABLE(SackCS_3) OR FIREABLE(SackCS_2) OR FIREABLE(SackCS_1) OR FIREABLE(SackCS_0))) : A (G (F (F (X ((FIREABLE(SsendTS_5) OR FIREABLE(SsendTS_6) OR FIREABLE(SsendTS_3) OR FIREABLE(SsendTS_4) OR FIREABLE(SsendTS_1) OR FIREABLE(SsendTS_2) OR FIREABLE(SsendTS_0) OR FIREABLE(SsendTS_18) OR FIREABLE(SsendTS_17) OR FIREABLE(SsendTS_16) OR FIREABLE(SsendTS_15) OR FIREABLE(SsendTS_14) OR FIREABLE(SsendTS_13) OR FIREABLE(SsendTS_12) OR FIREABLE(SsendTS_11) OR FIREABLE(SsendTS_10) OR FIREABLE(SsendTS_9) OR FIREABLE(SsendTS_8) OR FIREABLE(SsendTS_7))))))) : A ((F (G (F (FIREABLE(SgetTS_5)))) U FIREABLE(SackCS_4))) : A (F ((X (FIREABLE(malC1_18)) U FIREABLE(CgenCertif_11)))) : A (FIREABLE(SackCS_1)) : A (F (G ((G (FIREABLE(malS6_10)) U F (FIREABLE(malS6_4)))))) : A (F (G (FIREABLE(CsendTS1_12)))) : A (X (X (FIREABLE(malS5_0)))) : A (FIREABLE(Sperform_3)) : A (G (G (G (FIREABLE(malC1_17)))))
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((G (((FIREABLE(SgetTS_6) OR FIREABLE(SgetTS_5) OR FIREABLE(SgetTS_4) OR FIREABLE(SgetTS_3) OR FIREABLE(SgetTS_10) OR FIREABLE(SgetTS_9) OR FIREABLE(SgetTS_8) OR FIREABLE(SgetTS_7) OR FIREABLE(SgetTS_2) OR FIREABLE(SgetTS_1) OR FIREABLE(SgetTS_0) OR FIREABLE(SgetTS_16) OR FIREABLE(SgetTS_15) OR FIREABLE(SgetTS_18) OR FIREABLE(SgetTS_17) OR FIREABLE(SgetTS_12) OR FIREABLE(SgetTS_1... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A ((G (((FIREABLE(SgetTS_6) OR FIREABLE(SgetTS_5) OR FIREABLE(SgetTS_4) OR FIREABLE(SgetTS_3) OR FIREABLE(SgetTS_10) OR FIREABLE(SgetTS_9) OR FIREABLE(SgetTS_8) OR FIREABLE(SgetTS_7) OR FIREABLE(SgetTS_2) OR FIREABLE(SgetTS_1) OR FIREABLE(SgetTS_0) OR FIREABLE(SgetTS_16) OR FIREABLE(SgetTS_15) OR FIREABLE(SgetTS_18) OR FIREABLE(SgetTS_17) OR FIREABLE(SgetTS_12) OR FIREABLE(SgetTS_11) OR FIREABLE(SgetTS_14) OR FIREABLE(SgetTS_13)) U (FIREABLE(malC1_4) OR FIREABLE(malC1_3) OR FIREABLE(malC1_6) OR FIREABLE(malC1_5) OR FIREABLE(malC1_0) OR FIREABLE(malC1_2) OR FIREABLE(malC1_1) 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_18) OR FIREABLE(malC1_17) OR FIREABLE(malC1_16) OR FIREABLE(malC1_15)))) U F (G (X ((FIREABLE(malC1_4) OR FIREABLE(malC1_3) OR FIREABLE(malC1_6) OR FIREABLE(malC1_5) OR FIREABLE(malC1_0) OR FIREABLE(malC1_2) OR FIREABLE(malC1_1) 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_18) OR FIREABLE(malC1_17) OR FIREABLE(malC1_16) OR FIREABLE(malC1_15)))))))
lola: processed formula: A ((G (((FIREABLE(SgetTS_6) OR FIREABLE(SgetTS_5) OR FIREABLE(SgetTS_4) OR FIREABLE(SgetTS_3) OR FIREABLE(SgetTS_10) OR FIREABLE(SgetTS_9) OR FIREABLE(SgetTS_8) OR FIREABLE(SgetTS_7) OR FIREABLE(SgetTS_2) OR FIREABLE(SgetTS_1) OR FIREABLE(SgetTS_0) OR FIREABLE(SgetTS_16) OR FIREABLE(SgetTS_15) OR FIREABLE(SgetTS_18) OR FIREABLE(SgetTS_17) OR FIREABLE(SgetTS_12) OR FIREABLE(SgetTS_1... (shortened)
lola: processed formula length: 1321
lola: 0 rewrites
lola: formula mentions 0 of 1398 places; total mentions: 0
lola: closed formula file QuasiCertifProtocol-PT-18-LTLFireability.task
lola: the resulting B\xfcchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1184 bytes per marking, with 30 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 23 markings, 24 edges
lola: ========================================
lola: subprocess 1 will run for 235 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (G (G (X (X ((FIREABLE(malS1_9) OR FIREABLE(malS1_10) OR FIREABLE(malS1_11) OR FIREABLE(malS1_12) OR FIREABLE(malS1_5) OR FIREABLE(malS1_6) OR FIREABLE(malS1_7) OR FIREABLE(malS1_8) OR FIREABLE(malS1_17) OR FIREABLE(malS1_18) OR FIREABLE(malS1_13) OR FIREABLE(malS1_14) OR FIREABLE(malS1_15) OR FIREABLE(malS1_16) OR FIREABLE(malS1_2) OR FIREABLE(malS1_1) OR FIREABLE(malS1_4) OR... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F (G (G (X (X ((FIREABLE(malS1_9) OR FIREABLE(malS1_10) OR FIREABLE(malS1_11) OR FIREABLE(malS1_12) OR FIREABLE(malS1_5) OR FIREABLE(malS1_6) OR FIREABLE(malS1_7) OR FIREABLE(malS1_8) OR FIREABLE(malS1_17) OR FIREABLE(malS1_18) OR FIREABLE(malS1_13) OR FIREABLE(malS1_14) OR FIREABLE(malS1_15) OR FIREABLE(malS1_16) OR FIREABLE(malS1_2) OR FIREABLE(malS1_1) OR FIREABLE(malS1_4) OR FIREABLE(malS1_3) OR FIREABLE(malS1_0))))))))
lola: processed formula: A (F (G (G (X (X ((FIREABLE(malS1_9) OR FIREABLE(malS1_10) OR FIREABLE(malS1_11) OR FIREABLE(malS1_12) OR FIREABLE(malS1_5) OR FIREABLE(malS1_6) OR FIREABLE(malS1_7) OR FIREABLE(malS1_8) OR FIREABLE(malS1_17) OR FIREABLE(malS1_18) OR FIREABLE(malS1_13) OR FIREABLE(malS1_14) OR FIREABLE(malS1_15) OR FIREABLE(malS1_16) OR FIREABLE(malS1_2) OR FIREABLE(malS1_1) OR FIREABLE(malS1_4) OR... (shortened)
lola: processed formula length: 448
lola: 0 rewrites
lola: formula mentions 0 of 1398 places; total mentions: 0
lola: closed formula file QuasiCertifProtocol-PT-18-LTLFireability.task
lola: the resulting B\xfcchi automaton has 4 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1184 bytes per marking, with 29 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 24 markings, 25 edges
lola: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (X (F (FIREABLE(AreqTS)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F (X (F (FIREABLE(AreqTS)))))
lola: processed formula: A (F (X (F (FIREABLE(AreqTS)))))
lola: processed formula length: 32
lola: 0 rewrites
lola: formula mentions 0 of 1398 places; total mentions: 0
lola: closed formula file QuasiCertifProtocol-PT-18-LTLFireability.task
lola: the resulting B\xfcchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1184 bytes per marking, with 30 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 31 markings, 31 edges
lola: ========================================
lola: subprocess 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((FIREABLE(SackCS_12) OR FIREABLE(SackCS_13) OR FIREABLE(SackCS_14) OR FIREABLE(SackCS_15) OR FIREABLE(SackCS_16) OR FIREABLE(SackCS_17) OR FIREABLE(SackCS_18) OR FIREABLE(SackCS_4) OR FIREABLE(SackCS_5) OR FIREABLE(SackCS_6) OR FIREABLE(SackCS_7) OR FIREABLE(SackCS_8) OR FIREABLE(SackCS_9) OR FIREABLE(SackCS_10) OR FIREABLE(SackCS_11) OR FIREABLE(SackCS_3) OR FIREABLE(SackCS_... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1180 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: 0 markings, 0 edges
lola: ========================================
lola: subprocess 4 will run for 294 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (F ((FIREABLE(malS5_0) OR FIREABLE(malS5_17) OR FIREABLE(malS5_18) OR FIREABLE(malS5_2) OR FIREABLE(malS5_1) OR FIREABLE(malS5_4) OR FIREABLE(malS5_3) OR FIREABLE(malS5_6) OR FIREABLE(malS5_5) OR FIREABLE(malS5_8) OR FIREABLE(malS5_7) OR FIREABLE(malS5_10) OR FIREABLE(malS5_9) OR FIREABLE(malS5_12) OR FIREABLE(malS5_11) OR FIREABLE(malS5_14) OR FIREABLE(malS5_13) OR FIREABLE(... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (X (F ((FIREABLE(malS5_0) OR FIREABLE(malS5_17) OR FIREABLE(malS5_18) OR FIREABLE(malS5_2) OR FIREABLE(malS5_1) OR FIREABLE(malS5_4) OR FIREABLE(malS5_3) OR FIREABLE(malS5_6) OR FIREABLE(malS5_5) OR FIREABLE(malS5_8) OR FIREABLE(malS5_7) OR FIREABLE(malS5_10) OR FIREABLE(malS5_9) OR FIREABLE(malS5_12) OR FIREABLE(malS5_11) OR FIREABLE(malS5_14) OR FIREABLE(malS5_13) OR FIREABLE(malS5_16) OR FIREABLE(malS5_15)))))
lola: processed formula: A (X (F ((FIREABLE(malS5_0) OR FIREABLE(malS5_17) OR FIREABLE(malS5_18) OR FIREABLE(malS5_2) OR FIREABLE(malS5_1) OR FIREABLE(malS5_4) OR FIREABLE(malS5_3) OR FIREABLE(malS5_6) OR FIREABLE(malS5_5) OR FIREABLE(malS5_8) OR FIREABLE(malS5_7) OR FIREABLE(malS5_10) OR FIREABLE(malS5_9) OR FIREABLE(malS5_12) OR FIREABLE(malS5_11) OR FIREABLE(malS5_14) OR FIREABLE(malS5_13) OR FIREABLE(... (shortened)
lola: processed formula length: 436
lola: 0 rewrites
lola: formula mentions 0 of 1398 places; total mentions: 0
lola: closed formula file QuasiCertifProtocol-PT-18-LTLFireability.task
lola: the resulting B\xfcchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1184 bytes per marking, with 30 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 22 markings, 22 edges
lola: ========================================
lola: subprocess 5 will run for 321 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (((FIREABLE(ScertCS_5) OR FIREABLE(ScertCS_4) OR FIREABLE(ScertCS_7) OR FIREABLE(ScertCS_6) OR FIREABLE(ScertCS_1) OR FIREABLE(ScertCS_0) OR FIREABLE(ScertCS_3) OR FIREABLE(ScertCS_2) OR FIREABLE(ScertCS_12) OR FIREABLE(ScertCS_13) OR FIREABLE(ScertCS_14) OR FIREABLE(ScertCS_15) OR FIREABLE(ScertCS_8) OR FIREABLE(ScertCS_9) OR FIREABLE(ScertCS_10) OR FIREABLE(ScertCS_11) OR FI... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F (((FIREABLE(ScertCS_5) OR FIREABLE(ScertCS_4) OR FIREABLE(ScertCS_7) OR FIREABLE(ScertCS_6) OR FIREABLE(ScertCS_1) OR FIREABLE(ScertCS_0) OR FIREABLE(ScertCS_3) OR FIREABLE(ScertCS_2) OR FIREABLE(ScertCS_12) OR FIREABLE(ScertCS_13) OR FIREABLE(ScertCS_14) OR FIREABLE(ScertCS_15) OR FIREABLE(ScertCS_8) OR FIREABLE(ScertCS_9) OR FIREABLE(ScertCS_10) OR FIREABLE(ScertCS_11) OR FIREABLE(ScertCS_16) OR FIREABLE(ScertCS_17) OR FIREABLE(ScertCS_18)) U (FIREABLE(AreqCS) U FIREABLE(malA1)))))
lola: processed formula: A (F (((FIREABLE(ScertCS_5) OR FIREABLE(ScertCS_4) OR FIREABLE(ScertCS_7) OR FIREABLE(ScertCS_6) OR FIREABLE(ScertCS_1) OR FIREABLE(ScertCS_0) OR FIREABLE(ScertCS_3) OR FIREABLE(ScertCS_2) OR FIREABLE(ScertCS_12) OR FIREABLE(ScertCS_13) OR FIREABLE(ScertCS_14) OR FIREABLE(ScertCS_15) OR FIREABLE(ScertCS_8) OR FIREABLE(ScertCS_9) OR FIREABLE(ScertCS_10) OR FIREABLE(ScertCS_11) OR FI... (shortened)
lola: processed formula length: 511
lola: 0 rewrites
lola: formula mentions 0 of 1398 places; total mentions: 0
lola: closed formula file QuasiCertifProtocol-PT-18-LTLFireability.task
lola: the resulting B\xfcchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1184 bytes per marking, with 31 unused bits
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method (--stubborn)
lola: SEARCH
lola: RUNNING
lola: 179902 markings, 697490 edges, 35980 markings/sec, 0 secs
lola: 337587 markings, 1429364 edges, 31537 markings/sec, 5 secs
lola: 489464 markings, 2149616 edges, 30375 markings/sec, 10 secs
lola: 637292 markings, 2877285 edges, 29566 markings/sec, 15 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 709044 markings, 3306780 edges
lola: ========================================
lola: subprocess 6 will run for 351 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((FIREABLE(SackCS_12) OR FIREABLE(SackCS_13) OR FIREABLE(SackCS_14) OR FIREABLE(SackCS_15) OR FIREABLE(SackCS_16) OR FIREABLE(SackCS_17) OR FIREABLE(SackCS_18) OR FIREABLE(SackCS_4) OR FIREABLE(SackCS_5) OR FIREABLE(SackCS_6) OR FIREABLE(SackCS_7) OR FIREABLE(SackCS_8) OR FIREABLE(SackCS_9) OR FIREABLE(SackCS_10) OR FIREABLE(SackCS_11) OR FIREABLE(SackCS_3) OR FIREABLE(SackCS_2) ... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (FIREABLE(SackCS_12) OR FIREABLE(SackCS_13) OR FIREABLE(SackCS_14) OR FIREABLE(SackCS_15) OR FIREABLE(SackCS_16) OR FIREABLE(SackCS_17) OR FIREABLE(SackCS_18) OR FIREABLE(SackCS_4) OR FIREABLE(SackCS_5) OR FIREABLE(SackCS_6) OR FIREABLE(SackCS_7) OR FIREABLE(SackCS_8) OR FIREABLE(SackCS_9) OR FIREABLE(SackCS_10) OR FIREABLE(SackCS_11) OR FIREABLE(SackCS_3) OR FIREABLE(SackCS_2) OR ... (shortened)
lola: processed formula length: 443
lola: 1 rewrites
lola: formula mentions 0 of 1398 places; total mentions: 0
lola: closed formula file QuasiCertifProtocol-PT-18-LTLFireability.task
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 7 will run for 390 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (F (F (X ((FIREABLE(SsendTS_5) OR FIREABLE(SsendTS_6) OR FIREABLE(SsendTS_3) OR FIREABLE(SsendTS_4) OR FIREABLE(SsendTS_1) OR FIREABLE(SsendTS_2) OR FIREABLE(SsendTS_0) OR FIREABLE(SsendTS_18) OR FIREABLE(SsendTS_17) OR FIREABLE(SsendTS_16) OR FIREABLE(SsendTS_15) OR FIREABLE(SsendTS_14) OR FIREABLE(SsendTS_13) OR FIREABLE(SsendTS_12) OR FIREABLE(SsendTS_11) OR FIREABLE(SsendTS... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (G (F (X ((FIREABLE(SsendTS_5) OR FIREABLE(SsendTS_6) OR FIREABLE(SsendTS_3) OR FIREABLE(SsendTS_4) OR FIREABLE(SsendTS_1) OR FIREABLE(SsendTS_2) OR FIREABLE(SsendTS_0) OR FIREABLE(SsendTS_18) OR FIREABLE(SsendTS_17) OR FIREABLE(SsendTS_16) OR FIREABLE(SsendTS_15) OR FIREABLE(SsendTS_14) OR FIREABLE(SsendTS_13) OR FIREABLE(SsendTS_12) OR FIREABLE(SsendTS_11) OR FIREABLE(SsendTS_10) OR FIREABLE(SsendTS_9) OR FIREABLE(SsendTS_8) OR FIREABLE(SsendTS_7))))))
lola: processed formula: A (G (F (X ((FIREABLE(SsendTS_5) OR FIREABLE(SsendTS_6) OR FIREABLE(SsendTS_3) OR FIREABLE(SsendTS_4) OR FIREABLE(SsendTS_1) OR FIREABLE(SsendTS_2) OR FIREABLE(SsendTS_0) OR FIREABLE(SsendTS_18) OR FIREABLE(SsendTS_17) OR FIREABLE(SsendTS_16) OR FIREABLE(SsendTS_15) OR FIREABLE(SsendTS_14) OR FIREABLE(SsendTS_13) OR FIREABLE(SsendTS_12) OR FIREABLE(SsendTS_11) OR FIREABLE(SsendTS_10... (shortened)
lola: processed formula length: 478
lola: 1 rewrites
lola: formula mentions 0 of 1398 places; total mentions: 0
lola: closed formula file QuasiCertifProtocol-PT-18-LTLFireability.task
lola: the resulting B\xfcchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1184 bytes per marking, with 30 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: 245364 markings, 990869 edges, 49073 markings/sec, 0 secs
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 310795 markings, 1335072 edges
lola: ========================================
lola: subprocess 8 will run for 438 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((F (G (F (FIREABLE(SgetTS_5)))) U FIREABLE(SackCS_4)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A ((G (F (FIREABLE(SgetTS_5))) U FIREABLE(SackCS_4)))
lola: processed formula: A ((G (F (FIREABLE(SgetTS_5))) U FIREABLE(SackCS_4)))
lola: processed formula length: 53
lola: 1 rewrites
lola: formula mentions 0 of 1398 places; total mentions: 0
lola: closed formula file QuasiCertifProtocol-PT-18-LTLFireability.task
lola: the resulting B\xfcchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1184 bytes per marking, with 30 unused bits
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method (--stubborn)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 22 markings, 22 edges
lola: ========================================
lola: subprocess 9 will run for 501 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((X (FIREABLE(malC1_18)) U FIREABLE(CgenCertif_11))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F ((X (FIREABLE(malC1_18)) U FIREABLE(CgenCertif_11))))
lola: processed formula: A (F ((X (FIREABLE(malC1_18)) U FIREABLE(CgenCertif_11))))
lola: processed formula length: 58
lola: 0 rewrites
lola: formula mentions 0 of 1398 places; total mentions: 0
lola: closed formula file QuasiCertifProtocol-PT-18-LTLFireability.task
lola: the resulting B\xfcchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1184 bytes per marking, with 31 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 22 markings, 22 edges
lola: ========================================
lola: subprocess 10 will run for 584 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (FIREABLE(SackCS_1))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FIREABLE(SackCS_1)
lola: processed formula length: 18
lola: 1 rewrites
lola: formula mentions 0 of 1398 places; total mentions: 0
lola: closed formula file QuasiCertifProtocol-PT-18-LTLFireability.task
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 11 will run for 701 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (G ((G (FIREABLE(malS6_10)) U F (FIREABLE(malS6_4))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F (G ((G (FIREABLE(malS6_10)) U F (FIREABLE(malS6_4))))))
lola: processed formula: A (F (G ((G (FIREABLE(malS6_10)) U F (FIREABLE(malS6_4))))))
lola: processed formula length: 60
lola: 0 rewrites
lola: formula mentions 0 of 1398 places; total mentions: 0
lola: closed formula file QuasiCertifProtocol-PT-18-LTLFireability.task
lola: the resulting B\xfcchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1184 bytes per marking, with 30 unused bits
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method (--stubborn)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 22 markings, 22 edges
lola: ========================================
lola: subprocess 12 will run for 877 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (G (FIREABLE(CsendTS1_12))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F (G (FIREABLE(CsendTS1_12))))
lola: processed formula: A (F (G (FIREABLE(CsendTS1_12))))
lola: processed formula length: 33
lola: 0 rewrites
lola: formula mentions 0 of 1398 places; total mentions: 0
lola: closed formula file QuasiCertifProtocol-PT-18-LTLFireability.task
lola: the resulting B\xfcchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1184 bytes per marking, with 30 unused bits
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method (--stubborn)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 24 markings, 25 edges
lola: ========================================
lola: subprocess 13 will run for 1169 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (X (FIREABLE(malS5_0))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (X (X (FIREABLE(malS5_0))))
lola: processed formula: A (X (X (FIREABLE(malS5_0))))
lola: processed formula length: 29
lola: 0 rewrites
lola: formula mentions 0 of 1398 places; total mentions: 0
lola: closed formula file QuasiCertifProtocol-PT-18-LTLFireability.task
lola: the resulting B\xfcchi automaton has 4 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1184 bytes per marking, with 29 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 22 markings, 22 edges
lola: ========================================
lola: subprocess 14 will run for 1754 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (FIREABLE(Sperform_3))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FIREABLE(Sperform_3)
lola: processed formula length: 20
lola: 1 rewrites
lola: formula mentions 0 of 1398 places; total mentions: 0
lola: closed formula file QuasiCertifProtocol-PT-18-LTLFireability.task
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 15 will run for 3508 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (G (G (FIREABLE(malC1_17)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (G (G (G (FIREABLE(malC1_17)))))
lola: processed formula: A (G (G (G (FIREABLE(malC1_17)))))
lola: processed formula length: 34
lola: 0 rewrites
lola: formula mentions 0 of 1398 places; total mentions: 0
lola: closed formula file QuasiCertifProtocol-PT-18-LTLFireability.task
lola: the resulting B\xfcchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1184 bytes per marking, with 30 unused bits
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method (--stubborn)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 22 markings, 22 edges
lola: ========================================
lola: RESULT
lola:
SUMMARY: no no no no no yes no no no no no no no no no no
FORMULA QuasiCertifProtocol-PT-18-LTLFireability-0 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA QuasiCertifProtocol-PT-18-LTLFireability-1 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA QuasiCertifProtocol-PT-18-LTLFireability-2 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA QuasiCertifProtocol-PT-18-LTLFireability-3 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA QuasiCertifProtocol-PT-18-LTLFireability-4 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA QuasiCertifProtocol-PT-18-LTLFireability-5 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA QuasiCertifProtocol-PT-18-LTLFireability-6 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA QuasiCertifProtocol-PT-18-LTLFireability-7 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA QuasiCertifProtocol-PT-18-LTLFireability-8 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA QuasiCertifProtocol-PT-18-LTLFireability-9 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA QuasiCertifProtocol-PT-18-LTLFireability-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA QuasiCertifProtocol-PT-18-LTLFireability-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA QuasiCertifProtocol-PT-18-LTLFireability-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA QuasiCertifProtocol-PT-18-LTLFireability-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA QuasiCertifProtocol-PT-18-LTLFireability-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA QuasiCertifProtocol-PT-18-LTLFireability-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stderr -----
----- Kill lola and sara stdout -----
----- 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-18"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="irma4mcc-structural"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

tar xzf /home/mcc/BenchKit/INPUTS/QuasiCertifProtocol-PT-18.tgz
mv QuasiCertifProtocol-PT-18 execution
cd execution
pwd
ls -lh

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-3637"
echo " Executing tool irma4mcc-structural"
echo " Input is QuasiCertifProtocol-PT-18, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r187-qhx2-152732139400062"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "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 "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.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 '' LTLFireability.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 ;