fond
Model Checking Contest 2018
8th edition, Bratislava, Slovakia, June 26, 2018
Execution of r214-smll-152732265700533
Last Updated
June 26, 2018

About the Execution of M4M.full for SafeBus-PT-10

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
1515.260 399551.00 399355.00 1920.20 ???????????????? normal

Execution Chart

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

Trace from the execution

Waiting for the VM to be ready (probing ssh)
....................
/home/mcc/execution
total 2.4M
-rw-r--r-- 1 mcc users 7.2K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 33K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 62K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 209K 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.0K May 15 18:50 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 6.4K May 26 09:27 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 26 09:27 LTLCardinality.xml
-rw-r--r-- 1 mcc users 13K May 26 09:27 LTLFireability.txt
-rw-r--r-- 1 mcc users 46K May 26 09:27 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.6K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 38K May 15 18:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 104 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 342 May 15 18:54 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 60K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 193K May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 3.0K May 15 18:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 7.5K 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.7M May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool mcc4mcc-full
Input is SafeBus-PT-10, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r214-smll-152732265700533
=====================================================================


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

=== Now, execution of the tool begins

BK_START 1527490296647


BK_STOP 1527490696198

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

Prefix is 65b80f64.
Reading known information in /usr/share/mcc4mcc/65b80f64-known.json.
Reading learned information in /usr/share/mcc4mcc/65b80f64-learned.json.
Reading value translations in /usr/share/mcc4mcc/65b80f64-values.json.
Using directory /home/mcc/execution for input, as it contains a model.pnml file.
Using SafeBus-PT-10 as instance name.
Using SafeBus as model name.
Using algorithm or tool bmdt.
Model characteristics are: {'Examination': 'LTLCardinality', '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': True, 'Source Place': False, 'Sink Place': False, 'Source Transition': False, 'Sink Transition': False, 'Loop Free': False, 'Conservative': False, 'Sub-Conservative': False, 'Nested Units': False, 'Safe': None, 'Deadlock': None, 'Reversible': None, 'Quasi Live': None, 'Live': None}.
Known tools are: [{'Time': 1751638, 'Memory': 15922.81, 'Tool': 'itstools'}, {'Time': 1760367, 'Memory': 15927.83, 'Tool': 'itstools'}, {'Time': 1896001, 'Memory': 15947.26, 'Tool': 'lola'}, {'Time': 1924065, 'Memory': 15944.64, 'Tool': 'lola'}].
Learned tools are: [{'Tool': 'lola'}].
Learned tool lola is 1.0824160014797577x far from the best tool itstools.
LTLCardinality lola SafeBus-PT-10...

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


checking for too many tokens
===========================================================================================
SafeBus-PT-10: translating PT formula LTLCardinality into LoLA format
===========================================================================================
translating formula complete
touch formulae;
----- Start make result stderr -----
----- Start make result stdout -----
LTLCardinality @ SafeBus-PT-10 @ 3540 seconds
make: [verify] Error 134 (ignored)
Makefile:222: recipe for target 'verify' failed
----- Start make result stdout -----
----- Start make result stderr -----
lola: LoLA will run for 3540 seconds at most (--timelimit)
lola: NET
lola: reading net from model.pnml.lola
lola: finished parsing
lola: closed net file model.pnml.lola
lola: 1947/65536 symbol table entries, 197 collisions
lola: preprocessing...
lola: finding significant places
lola: 316 places, 1631 transitions, 261 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 983 transition conflict sets
lola: TASK
lola: reading formula from SafeBus-PT-10-LTLCardinality.task
lola: A (F (F (F (G ((Cpt1_1 + Cpt1_2 + Cpt1_3 + Cpt1_4 + Cpt1_5 + Cpt1_6 + Cpt1_7 + Cpt1_8 + Cpt1_9 + Cpt1_10 <= PMC_10 + PMC_3 + PMC_4 + PMC_9 + PMC_8 + PMC_7 + PMC_6 + PMC_5 + PMC_2 + PMC_1)))))) : A (G (X (X (G ((PMC_10 + PMC_3 + PMC_4 + PMC_9 + PMC_8 + PMC_7 + PMC_6 + PMC_5 + PMC_2 + PMC_1 <= cable_free)))))) : A ((X ((Cpt2_10 + Cpt2_1 + Cpt2_2 + Cpt2_3 + Cpt2_4 + Cpt2_5 + Cpt2_6 + Cpt2_7 + Cpt2_8 + Cpt2_9 <= cable_free)) U X (X ((AMC_8_10 + AMC_2_10 + AMC_1_1 + AMC_1_2 + AMC_1_3 + AMC_1_4 + AMC_1_5 + AMC_1_6 + AMC_1_7 + AMC_1_8 + AMC_1_9 + AMC_7_10 + AMC_2_1 + AMC_2_2 + AMC_2_3 + AMC_2_4 + AMC_2_5 + AMC_2_6 + AMC_2_7 + AMC_2_8 + AMC_2_9 + AMC_3_1 + AMC_3_2 + AMC_3_3 + AMC_3_4 + AMC_3_5 + AMC_3_6 + AMC_3_7 + AMC_3_8 + AMC_3_9 + AMC_1_10 + AMC_10_10 + AMC_4_1 + AMC_4_2 + AMC_4_3 + AMC_4_4 + AMC_4_5 + AMC_4_6 + AMC_4_7 + AMC_4_8 + AMC_4_9 + AMC_6_10 + AMC_5_1 + AMC_5_2 + AMC_5_3 + AMC_5_4 + AMC_5_5 + AMC_5_6 + AMC_5_7 + AMC_5_8 + AMC_5_9 + AMC_6_1 + AMC_6_2 + AMC_6_3 + AMC_6_4 + AMC_6_5 + AMC_6_6 + AMC_6_7 + AMC_6_8 + AMC_6_9 + AMC_10_1 + AMC_10_2 + AMC_10_3 + AMC_10_4 + AMC_10_5 + AMC_10_6 + AMC_10_7 + AMC_10_8 + AMC_7_1 + AMC_7_2 + AMC_7_3 + AMC_7_4 + AMC_7_5 + AMC_7_6 + AMC_7_7 + AMC_7_8 + AMC_7_9 + AMC_5_10 + AMC_8_1 + AMC_8_2 + AMC_8_3 + AMC_8_4 + AMC_8_5 + AMC_8_6 + AMC_8_7 + AMC_8_8 + AMC_8_9 + AMC_9_8 + AMC_9_7 + AMC_9_6 + AMC_9_5 + AMC_9_4 + AMC_9_1 + AMC_9_2 + AMC_9_3 + AMC_9_9 + AMC_4_10 + AMC_10_9 + AMC_9_10 + AMC_3_10 <= loop_em_1 + loop_em_2 + loop_em_3 + loop_em_4 + loop_em_5 + loop_em_6 + loop_em_7 + loop_em_8 + loop_em_9 + loop_em_10))))) : A (X ((3 <= FMC_10 + FMC_1 + FMC_2 + FMC_3 + FMC_4 + FMC_5 + FMC_6 + FMC_7 + FMC_8 + FMC_9))) : A (X ((X ((Cpt1_1 + Cpt1_2 + Cpt1_3 + Cpt1_4 + Cpt1_5 + Cpt1_6 + Cpt1_7 + Cpt1_8 + Cpt1_9 + Cpt1_10 <= wait_cable_10 + wait_cable_1 + wait_cable_2 + wait_cable_3 + wait_cable_4 + wait_cable_5 + wait_cable_6 + wait_cable_7 + wait_cable_8 + wait_cable_9)) U (3 <= PMC_10 + PMC_3 + PMC_4 + PMC_9 + PMC_8 + PMC_7 + PMC_6 + PMC_5 + PMC_2 + PMC_1)))) : A ((X (X ((MSG_10 + MSG_1 + MSG_2 + MSG_3 + MSG_4 + MSG_5 + MSG_6 + MSG_7 + MSG_8 + MSG_9 <= S_tout))) U X (F ((R_tout <= Cpt1_1 + Cpt1_2 + Cpt1_3 + Cpt1_4 + Cpt1_5 + Cpt1_6 + Cpt1_7 + Cpt1_8 + Cpt1_9 + Cpt1_10))))) : A (X (X (X ((wait_ack_1_2 + wait_ack_1_3 + wait_ack_1_4 + wait_ack_1_5 + wait_ack_1_6 + wait_ack_1_7 + wait_ack_1_8 + wait_ack_1_9 + wait_ack_7_10 + wait_ack_2_1 + wait_ack_2_3 + wait_ack_2_4 + wait_ack_2_5 + wait_ack_2_6 + wait_ack_2_7 + wait_ack_2_8 + wait_ack_2_9 + wait_ack_3_1 + wait_ack_3_2 + wait_ack_3_4 + wait_ack_3_5 + wait_ack_3_6 + wait_ack_3_7 + wait_ack_3_8 + wait_ack_3_9 + wait_ack_1_10 + wait_ack_4_1 + wait_ack_4_2 + wait_ack_4_3 + wait_ack_4_5 + wait_ack_4_6 + wait_ack_4_7 + wait_ack_4_8 + wait_ack_4_9 + wait_ack_6_10 + wait_ack_5_1 + wait_ack_5_2 + wait_ack_5_3 + wait_ack_5_4 + wait_ack_5_6 + wait_ack_5_7 + wait_ack_5_8 + wait_ack_5_9 + wait_ack_6_1 + wait_ack_6_2 + wait_ack_6_3 + wait_ack_6_4 + wait_ack_6_5 + wait_ack_6_7 + wait_ack_6_8 + wait_ack_6_9 + wait_ack_10_1 + wait_ack_10_2 + wait_ack_10_3 + wait_ack_10_4 + wait_ack_10_5 + wait_ack_10_6 + wait_ack_10_7 + wait_ack_10_8 + wait_ack_10_9 + wait_ack_7_1 + wait_ack_7_2 + wait_ack_7_3 + wait_ack_7_4 + wait_ack_7_5 + wait_ack_7_6 + wait_ack_7_8 + wait_ack_7_9 + wait_ack_5_10 + wait_ack_8_1 + wait_ack_8_2 + wait_ack_8_3 + wait_ack_8_4 + wait_ack_8_5 + wait_ack_8_6 + wait_ack_8_7 + wait_ack_8_9 + wait_ack_9_1 + wait_ack_9_2 + wait_ack_9_3 + wait_ack_9_4 + wait_ack_9_5 + wait_ack_9_6 + wait_ack_9_7 + wait_ack_9_8 + wait_ack_8_10 + wait_ack_4_10 + wait_ack_3_10 + wait_ack_9_10 + wait_ack_2_10 <= Cpt2_10 + Cpt2_1 + Cpt2_2 + Cpt2_3 + Cpt2_4 + Cpt2_5 + Cpt2_6 + Cpt2_7 + Cpt2_8 + Cpt2_9))))) : A ((F (F ((FMCb <= listen_10 + listen_1 + listen_2 + listen_3 + listen_4 + listen_5 + listen_6 + listen_7 + listen_8 + listen_9))) U F ((FMCb <= cable_used_1 + cable_used_2 + cable_used_3 + cable_used_4 + cable_used_5 + cable_used_6 + cable_used_7 + cable_used_8 + cable_used_9 + cable_used_10)))) : A (F ((Cpt2_1 <= Cpt1_10))) : A ((cable_used_9 <= AMC_10_2)) : A (X (G (F (X ((wait_msg_4 <= AMC_10_5)))))) : A ((AMC_4_7 <= AMC_10_5)) : A (F (X ((Cpt1_2 <= wait_ack_3_2)))) : A ((X (G ((2 <= ACK))) U F (F ((wait_ack_7_9 <= AMC_3_9))))) : A (G (F (((AMC_5_5 <= wait_ack_9_2) U (PMC_1 <= wait_ack_5_8))))) : A (G (F (F (X ((listen_2 <= PMC_3))))))
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 (F (F (F (G ((Cpt1_1 + Cpt1_2 + Cpt1_3 + Cpt1_4 + Cpt1_5 + Cpt1_6 + Cpt1_7 + Cpt1_8 + Cpt1_9 + Cpt1_10 <= PMC_10 + PMC_3 + PMC_4 + PMC_9 + PMC_8 + PMC_7 + PMC_6 + PMC_5 + PMC_2 + PMC_1))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F (G ((Cpt1_1 + Cpt1_2 + Cpt1_3 + Cpt1_4 + Cpt1_5 + Cpt1_6 + Cpt1_7 + Cpt1_8 + Cpt1_9 + Cpt1_10 <= PMC_10 + PMC_3 + PMC_4 + PMC_9 + PMC_8 + PMC_7 + PMC_6 + PMC_5 + PMC_2 + PMC_1))))
lola: processed formula: A (F (G ((Cpt1_1 + Cpt1_2 + Cpt1_3 + Cpt1_4 + Cpt1_5 + Cpt1_6 + Cpt1_7 + Cpt1_8 + Cpt1_9 + Cpt1_10 <= PMC_10 + PMC_3 + PMC_4 + PMC_9 + PMC_8 + PMC_7 + PMC_6 + PMC_5 + PMC_2 + PMC_1))))
lola: processed formula length: 184
lola: 2 rewrites
lola: formula mentions 0 of 316 places; total mentions: 0
lola: closed formula file SafeBus-PT-10-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1048 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: 144 markings, 145 edges
lola: ========================================
lola: subprocess 1 will run for 236 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (X (X (G ((PMC_10 + PMC_3 + PMC_4 + PMC_9 + PMC_8 + PMC_7 + PMC_6 + PMC_5 + PMC_2 + PMC_1 <= cable_free))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (G (X (X (G ((PMC_10 + PMC_3 + PMC_4 + PMC_9 + PMC_8 + PMC_7 + PMC_6 + PMC_5 + PMC_2 + PMC_1 <= cable_free))))))
lola: processed formula: A (G (X (X (G ((PMC_10 + PMC_3 + PMC_4 + PMC_9 + PMC_8 + PMC_7 + PMC_6 + PMC_5 + PMC_2 + PMC_1 <= cable_free))))))
lola: processed formula length: 114
lola: 0 rewrites
lola: formula mentions 0 of 316 places; total mentions: 0
lola: closed formula file SafeBus-PT-10-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 4 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1048 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: 137 markings, 137 edges
lola: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((X ((Cpt2_10 + Cpt2_1 + Cpt2_2 + Cpt2_3 + Cpt2_4 + Cpt2_5 + Cpt2_6 + Cpt2_7 + Cpt2_8 + Cpt2_9 <= cable_free)) U X (X ((AMC_8_10 + AMC_2_10 + AMC_1_1 + AMC_1_2 + AMC_1_3 + AMC_1_4 + AMC_1_5 + AMC_1_6 + AMC_1_7 + AMC_1_8 + AMC_1_9 + AMC_7_10 + AMC_2_1 + AMC_2_2 + AMC_2_3 + AMC_2_4 + AMC_2_5 + AMC_2_6 + AMC_2_7 + AMC_2_8 + AMC_2_9 + AMC_3_1 + AMC_3_2 + AMC_3_3 + AMC_3_4 + AMC_3_5 + AMC_3_6 + AMC_3... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (X (((Cpt2_10 + Cpt2_1 + Cpt2_2 + Cpt2_3 + Cpt2_4 + Cpt2_5 + Cpt2_6 + Cpt2_7 + Cpt2_8 + Cpt2_9 <= cable_free) U X ((AMC_8_10 + AMC_2_10 + AMC_1_1 + AMC_1_2 + AMC_1_3 + AMC_1_4 + AMC_1_5 + AMC_1_6 + AMC_1_7 + AMC_1_8 + AMC_1_9 + AMC_7_10 + AMC_2_1 + AMC_2_2 + AMC_2_3 + AMC_2_4 + AMC_2_5 + AMC_2_6 + AMC_2_7 + AMC_2_8 + AMC_2_9 + AMC_3_1 + AMC_3_2 + AMC_3_3 + AMC_3_4 + AMC_3_5 + AMC_3_6 + AMC_3_7 + AMC_3_8 + AMC_3_9 + AMC_1_10 + AMC_10_10 + AMC_4_1 + AMC_4_2 + AMC_4_3 + AMC_4_4 + AMC_4_5 + AMC_4_6 + AMC_4_7 + AMC_4_8 + AMC_4_9 + AMC_6_10 + AMC_5_1 + AMC_5_2 + AMC_5_3 + AMC_5_4 + AMC_5_5 + AMC_5_6 + AMC_5_7 + AMC_5_8 + AMC_5_9 + AMC_6_1 + AMC_6_2 + AMC_6_3 + AMC_6_4 + AMC_6_5 + AMC_6_6 + AMC_6_7 + AMC_6_8 + AMC_6_9 + AMC_10_1 + AMC_10_2 + AMC_10_3 + AMC_10_4 + AMC_10_5 + AMC_10_6 + AMC_10_7 + AMC_10_8 + AMC_7_1 + AMC_7_2 + AMC_7_3 + AMC_7_4 + AMC_7_5 + AMC_7_6 + AMC_7_7 + AMC_7_8 + AMC_7_9 + AMC_5_10 + AMC_8_1 + AMC_8_2 + AMC_8_3 + AMC_8_4 + AMC_8_5 + AMC_8_6 + AMC_8_7 + AMC_8_8 + AMC_8_9 + AMC_9_8 + AMC_9_7 + AMC_9_6 + AMC_9_5 + AMC_9_4 + AMC_9_1 + AMC_9_2 + AMC_9_3 + AMC_9_9 + AMC_4_10 + AMC_10_9 + AMC_9_10 + AMC_3_10 <= loop_em_1 + loop_em_2 + loop_em_3 + loop_em_4 + loop_em_5 + loop_em_6 + loop_em_7 + loop_em_8 + loop_em_9 + loop_em_10)))))
lola: processed formula: A (X (((Cpt2_10 + Cpt2_1 + Cpt2_2 + Cpt2_3 + Cpt2_4 + Cpt2_5 + Cpt2_6 + Cpt2_7 + Cpt2_8 + Cpt2_9 <= cable_free) U X ((AMC_8_10 + AMC_2_10 + AMC_1_1 + AMC_1_2 + AMC_1_3 + AMC_1_4 + AMC_1_5 + AMC_1_6 + AMC_1_7 + AMC_1_8 + AMC_1_9 + AMC_7_10 + AMC_2_1 + AMC_2_2 + AMC_2_3 + AMC_2_4 + AMC_2_5 + AMC_2_6 + AMC_2_7 + AMC_2_8 + AMC_2_9 + AMC_3_1 + AMC_3_2 + AMC_3_3 + AMC_3_4 + AMC_3_5 + AMC_3_6 + AMC_3_7 +... (shortened)
lola: processed formula length: 1262
lola: 1 rewrites
lola: formula mentions 0 of 316 places; total mentions: 0
lola: closed formula file SafeBus-PT-10-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 5 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1048 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: 137 markings, 137 edges
lola: ========================================
lola: subprocess 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X ((3 <= FMC_10 + FMC_1 + FMC_2 + FMC_3 + FMC_4 + FMC_5 + FMC_6 + FMC_7 + FMC_8 + FMC_9)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (X ((3 <= FMC_10 + FMC_1 + FMC_2 + FMC_3 + FMC_4 + FMC_5 + FMC_6 + FMC_7 + FMC_8 + FMC_9)))
lola: processed formula: A (X ((3 <= FMC_10 + FMC_1 + FMC_2 + FMC_3 + FMC_4 + FMC_5 + FMC_6 + FMC_7 + FMC_8 + FMC_9)))
lola: processed formula length: 93
lola: 0 rewrites
lola: formula mentions 0 of 316 places; total mentions: 0
lola: closed formula file SafeBus-PT-10-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1048 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: 137 markings, 137 edges
lola: ========================================
lola: subprocess 4 will run for 295 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X ((X ((Cpt1_1 + Cpt1_2 + Cpt1_3 + Cpt1_4 + Cpt1_5 + Cpt1_6 + Cpt1_7 + Cpt1_8 + Cpt1_9 + Cpt1_10 <= wait_cable_10 + wait_cable_1 + wait_cable_2 + wait_cable_3 + wait_cable_4 + wait_cable_5 + wait_cable_6 + wait_cable_7 + wait_cable_8 + wait_cable_9)) U (3 <= PMC_10 + PMC_3 + PMC_4 + PMC_9 + PMC_8 + PMC_7 + PMC_6 + PMC_5 + PMC_2 + PMC_1))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (X ((X ((Cpt1_1 + Cpt1_2 + Cpt1_3 + Cpt1_4 + Cpt1_5 + Cpt1_6 + Cpt1_7 + Cpt1_8 + Cpt1_9 + Cpt1_10 <= wait_cable_10 + wait_cable_1 + wait_cable_2 + wait_cable_3 + wait_cable_4 + wait_cable_5 + wait_cable_6 + wait_cable_7 + wait_cable_8 + wait_cable_9)) U (3 <= PMC_10 + PMC_3 + PMC_4 + PMC_9 + PMC_8 + PMC_7 + PMC_6 + PMC_5 + PMC_2 + PMC_1))))
lola: processed formula: A (X ((X ((Cpt1_1 + Cpt1_2 + Cpt1_3 + Cpt1_4 + Cpt1_5 + Cpt1_6 + Cpt1_7 + Cpt1_8 + Cpt1_9 + Cpt1_10 <= wait_cable_10 + wait_cable_1 + wait_cable_2 + wait_cable_3 + wait_cable_4 + wait_cable_5 + wait_cable_6 + wait_cable_7 + wait_cable_8 + wait_cable_9)) U (3 <= PMC_10 + PMC_3 + PMC_4 + PMC_9 + PMC_8 + PMC_7 + PMC_6 + PMC_5 + PMC_2 + PMC_1))))
lola: processed formula length: 344
lola: 0 rewrites
lola: formula mentions 0 of 316 places; total mentions: 0
lola: closed formula file SafeBus-PT-10-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 4 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1048 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: 201 markings, 201 edges
lola: ========================================
lola: subprocess 5 will run for 321 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((X (X ((MSG_10 + MSG_1 + MSG_2 + MSG_3 + MSG_4 + MSG_5 + MSG_6 + MSG_7 + MSG_8 + MSG_9 <= S_tout))) U X (F ((R_tout <= Cpt1_1 + Cpt1_2 + Cpt1_3 + Cpt1_4 + Cpt1_5 + Cpt1_6 + Cpt1_7 + Cpt1_8 + Cpt1_9 + Cpt1_10)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (X ((X ((MSG_10 + MSG_1 + MSG_2 + MSG_3 + MSG_4 + MSG_5 + MSG_6 + MSG_7 + MSG_8 + MSG_9 <= S_tout)) U F ((R_tout <= Cpt1_1 + Cpt1_2 + Cpt1_3 + Cpt1_4 + Cpt1_5 + Cpt1_6 + Cpt1_7 + Cpt1_8 + Cpt1_9 + Cpt1_10)))))
lola: processed formula: A (X ((X ((MSG_10 + MSG_1 + MSG_2 + MSG_3 + MSG_4 + MSG_5 + MSG_6 + MSG_7 + MSG_8 + MSG_9 <= S_tout)) U F ((R_tout <= Cpt1_1 + Cpt1_2 + Cpt1_3 + Cpt1_4 + Cpt1_5 + Cpt1_6 + Cpt1_7 + Cpt1_8 + Cpt1_9 + Cpt1_10)))))
lola: processed formula length: 211
lola: 1 rewrites
lola: formula mentions 0 of 316 places; total mentions: 0
lola: closed formula file SafeBus-PT-10-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1048 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: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 11 markings, 10 edges
lola: ========================================
lola: subprocess 6 will run for 354 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (X (X ((wait_ack_1_2 + wait_ack_1_3 + wait_ack_1_4 + wait_ack_1_5 + wait_ack_1_6 + wait_ack_1_7 + wait_ack_1_8 + wait_ack_1_9 + wait_ack_7_10 + wait_ack_2_1 + wait_ack_2_3 + wait_ack_2_4 + wait_ack_2_5 + wait_ack_2_6 + wait_ack_2_7 + wait_ack_2_8 + wait_ack_2_9 + wait_ack_3_1 + wait_ack_3_2 + wait_ack_3_4 + wait_ack_3_5 + wait_ack_3_6 + wait_ack_3_7 + wait_ack_3_8 + wait_ack_3_9 + wait_ack_1_... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (X (X (X ((wait_ack_1_2 + wait_ack_1_3 + wait_ack_1_4 + wait_ack_1_5 + wait_ack_1_6 + wait_ack_1_7 + wait_ack_1_8 + wait_ack_1_9 + wait_ack_7_10 + wait_ack_2_1 + wait_ack_2_3 + wait_ack_2_4 + wait_ack_2_5 + wait_ack_2_6 + wait_ack_2_7 + wait_ack_2_8 + wait_ack_2_9 + wait_ack_3_1 + wait_ack_3_2 + wait_ack_3_4 + wait_ack_3_5 + wait_ack_3_6 + wait_ack_3_7 + wait_ack_3_8 + wait_ack_3_9 + wait_ack_1_10 + wait_ack_4_1 + wait_ack_4_2 + wait_ack_4_3 + wait_ack_4_5 + wait_ack_4_6 + wait_ack_4_7 + wait_ack_4_8 + wait_ack_4_9 + wait_ack_6_10 + wait_ack_5_1 + wait_ack_5_2 + wait_ack_5_3 + wait_ack_5_4 + wait_ack_5_6 + wait_ack_5_7 + wait_ack_5_8 + wait_ack_5_9 + wait_ack_6_1 + wait_ack_6_2 + wait_ack_6_3 + wait_ack_6_4 + wait_ack_6_5 + wait_ack_6_7 + wait_ack_6_8 + wait_ack_6_9 + wait_ack_10_1 + wait_ack_10_2 + wait_ack_10_3 + wait_ack_10_4 + wait_ack_10_5 + wait_ack_10_6 + wait_ack_10_7 + wait_ack_10_8 + wait_ack_10_9 + wait_ack_7_1 + wait_ack_7_2 + wait_ack_7_3 + wait_ack_7_4 + wait_ack_7_5 + wait_ack_7_6 + wait_ack_7_8 + wait_ack_7_9 + wait_ack_5_10 + wait_ack_8_1 + wait_ack_8_2 + wait_ack_8_3 + wait_ack_8_4 + wait_ack_8_5 + wait_ack_8_6 + wait_ack_8_7 + wait_ack_8_9 + wait_ack_9_1 + wait_ack_9_2 + wait_ack_9_3 + wait_ack_9_4 + wait_ack_9_5 + wait_ack_9_6 + wait_ack_9_7 + wait_ack_9_8 + wait_ack_8_10 + wait_ack_4_10 + wait_ack_3_10 + wait_ack_9_10 + wait_ack_2_10 <= Cpt2_10 + Cpt2_1 + Cpt2_2 + Cpt2_3 + Cpt2_4 + Cpt2_5 + Cpt2_6 + Cpt2_7 + Cpt2_8 + Cpt2_9)))))
lola: processed formula: A (X (X (X ((wait_ack_1_2 + wait_ack_1_3 + wait_ack_1_4 + wait_ack_1_5 + wait_ack_1_6 + wait_ack_1_7 + wait_ack_1_8 + wait_ack_1_9 + wait_ack_7_10 + wait_ack_2_1 + wait_ack_2_3 + wait_ack_2_4 + wait_ack_2_5 + wait_ack_2_6 + wait_ack_2_7 + wait_ack_2_8 + wait_ack_2_9 + wait_ack_3_1 + wait_ack_3_2 + wait_ack_3_4 + wait_ack_3_5 + wait_ack_3_6 + wait_ack_3_7 + wait_ack_3_8 + wait_ack_3_9 + wait_ack_1_... (shortened)
lola: processed formula length: 1475
lola: 0 rewrites
lola: formula mentions 0 of 316 places; total mentions: 0
lola: closed formula file SafeBus-PT-10-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 5 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1048 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: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 1011 markings, 1100 edges
lola: ========================================
lola: subprocess 7 will run for 393 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((F (F ((FMCb <= listen_10 + listen_1 + listen_2 + listen_3 + listen_4 + listen_5 + listen_6 + listen_7 + listen_8 + listen_9))) U F ((FMCb <= cable_used_1 + cable_used_2 + cable_used_3 + cable_used_4 + cable_used_5 + cable_used_6 + cable_used_7 + cable_used_8 + cable_used_9 + cable_used_10))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A ((F ((FMCb <= listen_10 + listen_1 + listen_2 + listen_3 + listen_4 + listen_5 + listen_6 + listen_7 + listen_8 + listen_9)) U F ((FMCb <= cable_used_1 + cable_used_2 + cable_used_3 + cable_used_4 + cable_used_5 + cable_used_6 + cable_used_7 + cable_used_8 + cable_used_9 + cable_used_10))))
lola: processed formula: A ((F ((FMCb <= listen_10 + listen_1 + listen_2 + listen_3 + listen_4 + listen_5 + listen_6 + listen_7 + listen_8 + listen_9)) U F ((FMCb <= cable_used_1 + cable_used_2 + cable_used_3 + cable_used_4 + cable_used_5 + cable_used_6 + cable_used_7 + cable_used_8 + cable_used_9 + cable_used_10))))
lola: processed formula length: 293
lola: 1 rewrites
lola: formula mentions 0 of 316 places; total mentions: 0
lola: closed formula file SafeBus-PT-10-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1048 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: 54316 markings, 54315 edges, 10863 markings/sec, 0 secs
lola: 112469 markings, 112468 edges, 11631 markings/sec, 5 secs
lola: 170429 markings, 170428 edges, 11592 markings/sec, 10 secs
lola: 237777 markings, 237776 edges, 13470 markings/sec, 15 secs
lola: 297649 markings, 297648 edges, 11974 markings/sec, 20 secs
lola: 369011 markings, 369010 edges, 14272 markings/sec, 25 secs
lola: 449125 markings, 449124 edges, 16023 markings/sec, 30 secs
lola: 548377 markings, 548376 edges, 19850 markings/sec, 35 secs
lola: 647874 markings, 647873 edges, 19899 markings/sec, 40 secs
lola: 690074 markings, 690073 edges, 8440 markings/sec, 45 secs
lola: 725793 markings, 725792 edges, 7144 markings/sec, 50 secs
lola: 761613 markings, 761612 edges, 7164 markings/sec, 55 secs
lola: 797472 markings, 797471 edges, 7172 markings/sec, 60 secs
lola: 832906 markings, 832905 edges, 7087 markings/sec, 65 secs
lola: 872374 markings, 872373 edges, 7894 markings/sec, 70 secs
lola: 893943 markings, 893942 edges, 4314 markings/sec, 75 secs
lola: 913606 markings, 913605 edges, 3933 markings/sec, 80 secs
lola: 932874 markings, 932873 edges, 3854 markings/sec, 85 secs
lola: 951348 markings, 951347 edges, 3695 markings/sec, 90 secs
lola: 970401 markings, 970400 edges, 3811 markings/sec, 95 secs
lola: 988976 markings, 988975 edges, 3715 markings/sec, 100 secs
lola: 1006832 markings, 1006831 edges, 3571 markings/sec, 105 secs
lola: 1025652 markings, 1025651 edges, 3764 markings/sec, 110 secs
lola: 1044162 markings, 1044161 edges, 3702 markings/sec, 115 secs
lola: 1061853 markings, 1061852 edges, 3538 markings/sec, 120 secs
lola: 1082758 markings, 1082757 edges, 4181 markings/sec, 125 secs
lola: 1108581 markings, 1108580 edges, 5165 markings/sec, 130 secs
lola: 1145797 markings, 1145796 edges, 7443 markings/sec, 135 secs
lola: 1184127 markings, 1184126 edges, 7666 markings/sec, 140 secs
lola: 1221573 markings, 1221572 edges, 7489 markings/sec, 145 secs
lola: 1260012 markings, 1260011 edges, 7688 markings/sec, 150 secs
lola: 1300549 markings, 1300548 edges, 8107 markings/sec, 155 secs
lola: 1335641 markings, 1335640 edges, 7018 markings/sec, 160 secs
lola: 1363647 markings, 1363646 edges, 5601 markings/sec, 165 secs
lola: 1391022 markings, 1391021 edges, 5475 markings/sec, 170 secs
lola: 1418205 markings, 1418204 edges, 5437 markings/sec, 175 secs
lola: 1445792 markings, 1445791 edges, 5517 markings/sec, 180 secs
lola: 1472972 markings, 1472971 edges, 5436 markings/sec, 185 secs
lola: 1500043 markings, 1500042 edges, 5414 markings/sec, 190 secs
lola: 1531962 markings, 1531961 edges, 6384 markings/sec, 195 secs
lola: 1570709 markings, 1570708 edges, 7749 markings/sec, 200 secs
lola: 1604820 markings, 1604819 edges, 6822 markings/sec, 205 secs
lola: 1638364 markings, 1638363 edges, 6709 markings/sec, 210 secs
lola: 1673736 markings, 1673735 edges, 7074 markings/sec, 215 secs
lola: 1708241 markings, 1708240 edges, 6901 markings/sec, 220 secs
lola: 1746737 markings, 1746736 edges, 7699 markings/sec, 225 secs
lola: 1775801 markings, 1775800 edges, 5813 markings/sec, 230 secs
lola: 1802288 markings, 1802287 edges, 5297 markings/sec, 235 secs
lola: 1823880 markings, 1823879 edges, 4318 markings/sec, 240 secs
lola: 1843692 markings, 1843691 edges, 3962 markings/sec, 245 secs
lola: 1861490 markings, 1861489 edges, 3560 markings/sec, 250 secs
lola: 1881318 markings, 1881317 edges, 3966 markings/sec, 255 secs
lola: 1901078 markings, 1901077 edges, 3952 markings/sec, 260 secs
lola: 1918578 markings, 1918577 edges, 3500 markings/sec, 265 secs
lola: 1937974 markings, 1937973 edges, 3879 markings/sec, 270 secs
lola: 1957659 markings, 1957658 edges, 3937 markings/sec, 275 secs
lola: 1976283 markings, 1976282 edges, 3725 markings/sec, 280 secs
lola: 1999866 markings, 1999865 edges, 4717 markings/sec, 285 secs
lola: 2022719 markings, 2022718 edges, 4571 markings/sec, 290 secs
lola: 2044686 markings, 2044685 edges, 4393 markings/sec, 295 secs
lola: 2066491 markings, 2066490 edges, 4361 markings/sec, 300 secs
lola: 2088315 markings, 2088314 edges, 4365 markings/sec, 305 secs
lola: 2109628 markings, 2109627 edges, 4263 markings/sec, 310 secs
lola: 2132983 markings, 2132982 edges, 4671 markings/sec, 315 secs
lola: 2155151 markings, 2155150 edges, 4434 markings/sec, 320 secs
lola: 2176924 markings, 2176923 edges, 4355 markings/sec, 325 secs
lola: 2207434 markings, 2207433 edges, 6102 markings/sec, 330 secs
lola: 2266542 markings, 2266541 edges, 11822 markings/sec, 335 secs
lola: 2326069 markings, 2326068 edges, 11905 markings/sec, 340 secs
lola: 2386216 markings, 2386215 edges, 12029 markings/sec, 345 secs
lola: 2445006 markings, 2445005 edges, 11758 markings/sec, 350 secs
lola: 2505003 markings, 2505002 edges, 11999 markings/sec, 355 secs
lola: 2564996 markings, 2564995 edges, 11999 markings/sec, 360 secs
lola: 2625271 markings, 2625270 edges, 12055 markings/sec, 365 secs
lola: 2682698 markings, 2682697 edges, 11485 markings/sec, 370 secs
lola: 2741727 markings, 2741726 edges, 11806 markings/sec, 375 secs
lola: 2799898 markings, 2799897 edges, 11634 markings/sec, 380 secs
lola: 2853016 markings, 2853015 edges, 10624 markings/sec, 385 secs
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
terminate called after throwing an instance of 'std::runtime_error'
what(): parse error at position 0: unexpected character, last read: '
'
Aborted (core dumped)
FORMULA SafeBus-PT-10-LTLCardinality-0 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SafeBus-PT-10-LTLCardinality-1 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SafeBus-PT-10-LTLCardinality-2 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SafeBus-PT-10-LTLCardinality-3 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SafeBus-PT-10-LTLCardinality-4 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SafeBus-PT-10-LTLCardinality-5 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SafeBus-PT-10-LTLCardinality-6 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SafeBus-PT-10-LTLCardinality-7 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SafeBus-PT-10-LTLCardinality-8 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SafeBus-PT-10-LTLCardinality-9 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SafeBus-PT-10-LTLCardinality-10 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SafeBus-PT-10-LTLCardinality-11 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SafeBus-PT-10-LTLCardinality-12 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SafeBus-PT-10-LTLCardinality-13 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SafeBus-PT-10-LTLCardinality-14 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SafeBus-PT-10-LTLCardinality-15 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stdout -----
----- Kill lola and sara stderr -----
----- Finished stderr -----
----- Finished stdout -----

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="SafeBus-PT-10"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="mcc4mcc-full"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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

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