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 6.5M
-rw-r--r-- 1 mcc users 21K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 72K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 117K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 341K 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 7.7K May 26 09:27 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 26 09:27 LTLCardinality.xml
-rw-r--r-- 1 mcc users 163K May 26 09:27 LTLFireability.txt
-rw-r--r-- 1 mcc users 493K May 26 09:27 LTLFireability.xml
-rw-r--r-- 1 mcc users 22K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 83K 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 55K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 197K May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 7.7K May 15 18:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 21K 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 4.9M May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool lola
Input is SafeBus-PT-15, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r208-smll-152732257900535
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1528137951839

info: Time: 3600 - MCC
===========================================================================================
prep: translating SafeBus-PT-15 Petri net model.pnml into LoLA format
===========================================================================================
prep: translating PT Petri net complete
prep: check for too many tokens
===========================================================================================
prep: translating SafeBus-PT-15 formula LTLCardinality into LoLA format
===========================================================================================
prep: translating PT formula complete
vrfy: Checking LTLCardinality @ SafeBus-PT-15 @ 3569 seconds
lola: LoLA will run for 3569 seconds at most (--timelimit)
lola: NET
lola: reading net from model.pnml.lola
lola: finished parsing
lola: closed net file model.pnml.lola
lola: 5392/65536 symbol table entries, 362 collisions
lola: preprocessing...
lola: Size of bit vector: 19872
lola: finding significant places
lola: 621 places, 4771 transitions, 541 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 2148 transition conflict sets
lola: TASK
lola: reading formula from SafeBus-PT-15-LTLCardinality.task
lola: LP says that atomic proposition is always false: (3 <= PMC_10 + PMC_11 + PMC_12 + PMC_13 + PMC_14 + PMC_15 + PMC_3 + PMC_4 + PMC_9 + PMC_8 + PMC_7 + PMC_6 + PMC_5 + PMC_2 + PMC_1)
lola: place invariant simplifies atomic proposition
lola: before: (ACK <= Cpt2_10 + Cpt2_11 + Cpt2_12 + Cpt2_13 + Cpt2_14 + Cpt2_15 + Cpt2_1 + Cpt2_2 + Cpt2_3 + Cpt2_4 + Cpt2_5 + Cpt2_6 + Cpt2_7 + Cpt2_8 + Cpt2_9)
lola: after: (ACK <= 1)
lola: LP says that atomic proposition is always true: (ACK <= 1)
lola: place invariant simplifies atomic proposition
lola: before: (msgl_9 + msgl_8 + msgl_7 + msgl_6 + msgl_5 + msgl_4 + msgl_3 + msgl_2 + msgl_1 + msgl_15 + msgl_14 + msgl_13 + msgl_12 + msgl_11 + msgl_10 <= MSG_1 + MSG_2 + MSG_3 + MSG_4 + MSG_5 + MSG_6 + MSG_7 + MSG_8 + MSG_9 + MSG_10 + MSG_11 + MSG_12 + MSG_13 + MSG_14 + MSG_15)
lola: after: (15 <= MSG_1 + MSG_2 + MSG_3 + MSG_4 + MSG_5 + MSG_6 + MSG_7 + MSG_8 + MSG_9 + MSG_10 + MSG_11 + MSG_12 + MSG_13 + MSG_14 + MSG_15)
lola: LP says that atomic proposition is always false: (15 <= MSG_1 + MSG_2 + MSG_3 + MSG_4 + MSG_5 + MSG_6 + MSG_7 + MSG_8 + MSG_9 + MSG_10 + MSG_11 + MSG_12 + MSG_13 + MSG_14 + MSG_15)
lola: LP says that atomic proposition is always false: (2 <= MSG_1 + MSG_2 + MSG_3 + MSG_4 + MSG_5 + MSG_6 + MSG_7 + MSG_8 + MSG_9 + MSG_10 + MSG_11 + MSG_12 + MSG_13 + MSG_14 + MSG_15)
lola: place invariant simplifies atomic proposition
lola: before: (Cpt2_10 + Cpt2_11 + Cpt2_12 + Cpt2_13 + Cpt2_14 + Cpt2_15 + Cpt2_1 + Cpt2_2 + Cpt2_3 + Cpt2_4 + Cpt2_5 + Cpt2_6 + Cpt2_7 + Cpt2_8 + Cpt2_9 <= msgl_9 + msgl_8 + msgl_7 + msgl_6 + msgl_5 + msgl_4 + msgl_3 + msgl_2 + msgl_1 + msgl_15 + msgl_14 + msgl_13 + msgl_12 + msgl_11 + msgl_10)
lola: after: (0 <= 14)
lola: always true
lola: place invariant simplifies atomic proposition
lola: before: (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_12_10 + wait_ack_12_11 + wait_ack_12_13 + wait_ack_12_14 + wait_ack_12_15 + wait_ack_7_10 + wait_ack_7_11 + wait_ack_7_12 + wait_ack_7_13 + wait_ack_7_14 + wait_ack_7_15 + 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_1_11 + wait_ack_1_12 + wait_ack_1_13 + wait_ack_1_14 + wait_ack_1_15 + 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_11_10 + wait_ack_11_12 + wait_ack_11_13 + wait_ack_11_14 + wait_ack_11_15 + wait_ack_6_10 + wait_ack_6_11 + wait_ack_6_12 + wait_ack_6_13 + wait_ack_6_14 + wait_ack_6_15 + 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_10_11 + wait_ack_10_12 + wait_ack_10_13 + wait_ack_10_14 + wait_ack_10_15 + wait_ack_11_1 + wait_ack_11_2 + wait_ack_11_3 + wait_ack_11_4 + wait_ack_11_5 + wait_ack_11_6 + wait_ack_11_7 + wait_ack_11_8 + wait_ack_11_9 + wait_ack_5_10 + wait_ack_5_11 + wait_ack_5_12 + wait_ack_5_13 + wait_ack_5_14 + wait_ack_5_15 + 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_12_1 + wait_ack_12_2 + wait_ack_12_3 + wait_ack_12_4 + wait_ack_12_5 + wait_ack_12_6 + wait_ack_12_7 + wait_ack_12_8 + wait_ack_12_9 + wait_ack_15_10 + wait_ack_15_11 + wait_ack_15_12 + wait_ack_15_13 + wait_ack_15_14 + 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_13_1 + wait_ack_13_2 + wait_ack_13_3 + wait_ack_13_4 + wait_ack_13_5 + wait_ack_13_6 + wait_ack_13_7 + wait_ack_13_8 + wait_ack_13_9 + wait_ack_14_1 + wait_ack_14_2 + wait_ack_14_3 + wait_ack_14_4 + wait_ack_14_5 + wait_ack_14_6 + wait_ack_14_7 + wait_ack_14_8 + wait_ack_14_9 + wait_ack_4_10 + wait_ack_4_11 + wait_ack_4_12 + wait_ack_4_13 + wait_ack_4_14 + wait_ack_4_15 + wait_ack_2_14 + wait_ack_2_13 + wait_ack_2_12 + wait_ack_15_1 + wait_ack_15_2 + wait_ack_15_3 + wait_ack_15_4 + wait_ack_15_5 + wait_ack_15_6 + wait_ack_15_7 + wait_ack_15_8 + wait_ack_15_9 + wait_ack_14_10 + wait_ack_14_11 + wait_ack_14_12 + wait_ack_14_13 + wait_ack_14_15 + wait_ack_9_10 + wait_ack_9_11 + wait_ack_9_12 + wait_ack_9_13 + wait_ack_9_14 + wait_ack_9_15 + wait_ack_2_11 + wait_ack_2_10 + wait_ack_8_15 + wait_ack_8_14 + wait_ack_8_13 + wait_ack_8_12 + wait_ack_8_11 + wait_ack_8_10 + wait_ack_3_10 + wait_ack_3_11 + wait_ack_3_12 + wait_ack_3_13 + wait_ack_3_14 + wait_ack_3_15 + wait_ack_13_14 + wait_ack_13_12 + wait_ack_13_11 + wait_ack_13_10 + wait_ack_13_15 + wait_ack_2_15 <= Cpt2_10 + Cpt2_11 + Cpt2_12 + Cpt2_13 + Cpt2_14 + Cpt2_15 + Cpt2_1 + Cpt2_2 + Cpt2_3 + Cpt2_4 + Cpt2_5 + Cpt2_6 + Cpt2_7 + Cpt2_8 + Cpt2_9)
lola: after: (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_12_10 + wait_ack_12_11 + wait_ack_12_13 + wait_ack_12_14 + wait_ack_12_15 + wait_ack_7_10 + wait_ack_7_11 + wait_ack_7_12 + wait_ack_7_13 + wait_ack_7_14 + wait_ack_7_15 + 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_1_11 + wait_ack_1_12 + wait_ack_1_13 + wait_ack_1_14 + wait_ack_1_15 + 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_11_10 + wait_ack_11_12 + wait_ack_11_13 + wait_ack_11_14 + wait_ack_11_15 + wait_ack_6_10 + wait_ack_6_11 + wait_ack_6_12 + wait_ack_6_13 + wait_ack_6_14 + wait_ack_6_15 + 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_10_11 + wait_ack_10_12 + wait_ack_10_13 + wait_ack_10_14 + wait_ack_10_15 + wait_ack_11_1 + wait_ack_11_2 + wait_ack_11_3 + wait_ack_11_4 + wait_ack_11_5 + wait_ack_11_6 + wait_ack_11_7 + wait_ack_11_8 + wait_ack_11_9 + wait_ack_5_10 + wait_ack_5_11 + wait_ack_5_12 + wait_ack_5_13 + wait_ack_5_14 + wait_ack_5_15 + 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_12_1 + wait_ack_12_2 + wait_ack_12_3 + wait_ack_12_4 + wait_ack_12_5 + wait_ack_12_6 + wait_ack_12_7 + wait_ack_12_8 + wait_ack_12_9 + wait_ack_15_10 + wait_ack_15_11 + wait_ack_15_12 + wait_ack_15_13 + wait_ack_15_14 + 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_13_1 + wait_ack_13_2 + wait_ack_13_3 + wait_ack_13_4 + wait_ack_13_5 + wait_ack_13_6 + wait_ack_13_7 + wait_ack_13_8 + wait_ack_13_9 + wait_ack_14_1 + wait_ack_14_2 + wait_ack_14_3 + wait_ack_14_4 + wait_ack_14_5 + wait_ack_14_6 + wait_ack_14_7 + wait_ack_14_8 + wait_ack_14_9 + wait_ack_4_10 + wait_ack_4_11 + wait_ack_4_12 + wait_ack_4_13 + wait_ack_4_14 + wait_ack_4_15 + wait_ack_2_14 + wait_ack_2_13 + wait_ack_2_12 + wait_ack_15_1 + wait_ack_15_2 + wait_ack_15_3 + wait_ack_15_4 + wait_ack_15_5 + wait_ack_15_6 + wait_ack_15_7 + wait_ack_15_8 + wait_ack_15_9 + wait_ack_14_10 + wait_ack_14_11 + wait_ack_14_12 + wait_ack_14_13 + wait_ack_14_15 + wait_ack_9_10 + wait_ack_9_11 + wait_ack_9_12 + wait_ack_9_13 + wait_ack_9_14 + wait_ack_9_15 + wait_ack_2_11 + wait_ack_2_10 + wait_ack_8_15 + wait_ack_8_14 + wait_ack_8_13 + wait_ack_8_12 + wait_ack_8_11 + wait_ack_8_10 + wait_ack_3_10 + wait_ack_3_11 + wait_ack_3_12 + wait_ack_3_13 + wait_ack_3_14 + wait_ack_3_15 + wait_ack_13_14 + wait_ack_13_12 + wait_ack_13_11 + wait_ack_13_10 + wait_ack_13_15 + wait_ack_2_15 <= 1)
lola: LP says that atomic proposition is always true: (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_12_10 + wait_ack_12_11 + wait_ack_12_13 + wait_ack_12_14 + wait_ack_12_15 + wait_ack_7_10 + wait_ack_7_11 + wait_ack_7_12 + wait_ack_7_13 + wait_ack_7_14 + wait_ack_7_15 + 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_1_11 + wait_ack_1_12 + wait_ack_1_13 + wait_ack_1_14 + wait_ack_1_15 + 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_11_10 + wait_ack_11_12 + wait_ack_11_13 + wait_ack_11_14 + wait_ack_11_15 + wait_ack_6_10 + wait_ack_6_11 + wait_ack_6_12 + wait_ack_6_13 + wait_ack_6_14 + wait_ack_6_15 + 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_10_11 + wait_ack_10_12 + wait_ack_10_13 + wait_ack_10_14 + wait_ack_10_15 + wait_ack_11_1 + wait_ack_11_2 + wait_ack_11_3 + wait_ack_11_4 + wait_ack_11_5 + wait_ack_11_6 + wait_ack_11_7 + wait_ack_11_8 + wait_ack_11_9 + wait_ack_5_10 + wait_ack_5_11 + wait_ack_5_12 + wait_ack_5_13 + wait_ack_5_14 + wait_ack_5_15 + 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_12_1 + wait_ack_12_2 + wait_ack_12_3 + wait_ack_12_4 + wait_ack_12_5 + wait_ack_12_6 + wait_ack_12_7 + wait_ack_12_8 + wait_ack_12_9 + wait_ack_15_10 + wait_ack_15_11 + wait_ack_15_12 + wait_ack_15_13 + wait_ack_15_14 + 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_13_1 + wait_ack_13_2 + wait_ack_13_3 + wait_ack_13_4 + wait_ack_13_5 + wait_ack_13_6 + wait_ack_13_7 + wait_ack_13_8 + wait_ack_13_9 + wait_ack_14_1 + wait_ack_14_2 + wait_ack_14_3 + wait_ack_14_4 + wait_ack_14_5 + wait_ack_14_6 + wait_ack_14_7 + wait_ack_14_8 + wait_ack_14_9 + wait_ack_4_10 + wait_ack_4_11 + wait_ack_4_12 + wait_ack_4_13 + wait_ack_4_14 + wait_ack_4_15 + wait_ack_2_14 + wait_ack_2_13 + wait_ack_2_12 + wait_ack_15_1 + wait_ack_15_2 + wait_ack_15_3 + wait_ack_15_4 + wait_ack_15_5 + wait_ack_15_6 + wait_ack_15_7 + wait_ack_15_8 + wait_ack_15_9 + wait_ack_14_10 + wait_ack_14_11 + wait_ack_14_12 + wait_ack_14_13 + wait_ack_14_15 + wait_ack_9_10 + wait_ack_9_11 + wait_ack_9_12 + wait_ack_9_13 + wait_ack_9_14 + wait_ack_9_15 + wait_ack_2_11 + wait_ack_2_10 + wait_ack_8_15 + wait_ack_8_14 + wait_ack_8_13 + wait_ack_8_12 + wait_ack_8_11 + wait_ack_8_10 + wait_ack_3_10 + wait_ack_3_11 + wait_ack_3_12 + wait_ack_3_13 + wait_ack_3_14 + wait_ack_3_15 + wait_ack_13_14 + wait_ack_13_12 + wait_ack_13_11 + wait_ack_13_10 + wait_ack_13_15 + wait_ack_2_15 <= 1)
lola: place invariant simplifies atomic proposition
lola: before: (AMC_13_6 <= msgl_6)
lola: after: (AMC_13_6 <= 1)
lola: LP says that atomic proposition is always true: (AMC_13_6 <= 1)
lola: A ((F (X (FALSE)) U G (TRUE))) : A (((2 <= listen_10 + listen_11 + listen_12 + listen_13 + listen_14 + listen_15 + listen_1 + listen_2 + listen_3 + listen_4 + listen_5 + listen_6 + listen_7 + listen_8 + listen_9) U FALSE)) : A (G (X (X ((1 <= wait_cable_10 + wait_cable_11 + wait_cable_12 + wait_cable_13 + wait_cable_14 + wait_cable_15 + 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))))) : A (F (F (X (X ((RMC_10 + RMC_11 + RMC_12 + RMC_13 + RMC_14 + RMC_15 + RMC_1 + RMC_2 + RMC_3 + RMC_4 + RMC_5 + RMC_6 + RMC_7 + RMC_8 + RMC_9 <= R_tout)))))) : A ((X (G ((S_tout <= T_out))) U FALSE)) : A (G (X (F (F (TRUE))))) : A (G (TRUE)) : A (X ((2 <= wait_msg_15 + wait_msg_14 + wait_msg_13 + wait_msg_12 + wait_msg_11 + wait_msg_10 + wait_msg_1 + wait_msg_2 + wait_msg_3 + wait_msg_4 + wait_msg_5 + wait_msg_6 + wait_msg_7 + wait_msg_8 + wait_msg_9))) : A ((G (F ((wait_ack_7_15 <= AMC_12_10))) U (wait_ack_8_10 <= AMC_14_14))) : A (X (X (G (X ((AMC_13_3 <= MSG_13)))))) : A ((wait_ack_5_8 <= AMC_14_1)) : A ((AMC_14_12 <= wait_ack_5_15)) : A ((G (X ((AMC_1_5 <= cable_used_8))) U F (F ((wait_ack_2_8 <= AMC_5_15))))) : A (G (X (F (G ((AMC_13_4 <= AMC_3_2)))))) : A (G (X (X (F (TRUE))))) : A (X (F ((wait_ack_9_4 <= AMC_15_10))))
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:145
lola: rewrite Frontend/Parser/formula_rewrite.k:157
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:160
lola: rewrite Frontend/Parser/formula_rewrite.k:185
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:180
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:180
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:154
lola: rewrite Frontend/Parser/formula_rewrite.k:154
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:160
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:160
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:422
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:374
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:154
lola: rewrite Frontend/Parser/formula_rewrite.k:142
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:160
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 218 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: TRUE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: TRUE
lola: processed formula length: 4
lola: 42 rewrites
lola: closed formula file SafeBus-PT-15-LTLCardinality.task
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
check_solution: Constraint R228 = 4.48261457576e+151 is above its equality of 0
check_solution: Constraint R229 = 3.25126068743e+161 is above its equality of 0
check_solution: Constraint R231 = 4.17776543924e+199 is above its equality of 0
check_solution: Constraint R232 = 3.55423368461e+150 is above its equality of 0
check_solution: Constraint R233 = 5.81500891973e+252 is above its equality of 0
check_solution: Constraint R235 = 6.68152819707e+151 is above its equality of 0
check_solution: Constraint R237 = 1.10556353217e+161 is above its equality of 0
check_solution: Constraint R239 = 5.24516470262e+170 is above its equality of 0
check_solution: Constraint R241 = 1.10556353217e+161 is above its equality of 0
check_solution: Constraint R243 = 6.68152819707e+151 is above its equality of 0

Seriously low accuracy found ||*|| = 6.51681e+265 (rel. error 6.51681e+235)

FORMULA SafeBus-PT-15-LTLCardinality-0 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 1 will run for 233 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: FALSE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FALSE
lola: processed formula length: 5
lola: 42 rewrites
lola: closed formula file SafeBus-PT-15-LTLCardinality.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: ========================================

FORMULA SafeBus-PT-15-LTLCardinality-1 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 2 will run for 250 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: FALSE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FALSE
lola: processed formula length: 5
lola: 42 rewrites
lola: closed formula file SafeBus-PT-15-LTLCardinality.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: ========================================

FORMULA SafeBus-PT-15-LTLCardinality-4 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 3 will run for 269 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: TRUE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: TRUE
lola: processed formula length: 4
lola: 42 rewrites
lola: closed formula file SafeBus-PT-15-LTLCardinality.task
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================

FORMULA SafeBus-PT-15-LTLCardinality-6 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 4 will run for 291 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (wait_ack_5_8 <= AMC_14_1)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (wait_ack_5_8 <= AMC_14_1)
lola: processed formula length: 26
lola: 42 rewrites
lola: closed formula file SafeBus-PT-15-LTLCardinality.task
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================

FORMULA SafeBus-PT-15-LTLCardinality-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 5 will run for 318 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (AMC_14_12 <= wait_ack_5_15)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (AMC_14_12 <= wait_ack_5_15)
lola: processed formula length: 28
lola: 42 rewrites
lola: closed formula file SafeBus-PT-15-LTLCardinality.task
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================

FORMULA SafeBus-PT-15-LTLCardinality-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 6 will run for 350 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (X (F ((RMC_10 + RMC_11 + RMC_12 + RMC_13 + RMC_14 + RMC_15 + RMC_1 + RMC_2 + RMC_3 + RMC_4 + RMC_5 + RMC_6 + RMC_7 + RMC_8 + RMC_9 <= R_tout)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (X (F ((RMC_10 + RMC_11 + RMC_12 + RMC_13 + RMC_14 + RMC_15 + RMC_1 + RMC_2 + RMC_3 + RMC_4 + RMC_5 + RMC_6 + RMC_7 + RMC_8 + RMC_9 <= R_tout)))))
lola: processed formula length: 151
lola: 42 rewrites
lola: closed formula file SafeBus-PT-15-LTLCardinality.task
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
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: 241 markings, 240 edges
lola: ========================================

FORMULA SafeBus-PT-15-LTLCardinality-3 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 7 will run for 389 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X ((2 <= wait_msg_15 + wait_msg_14 + wait_msg_13 + wait_msg_12 + wait_msg_11 + wait_msg_10 + wait_msg_1 + wait_msg_2 + wait_msg_3 + wait_msg_4 + wait_msg_5 + wait_msg_6 + wait_msg_7 + wait_msg_8 + wait_msg_9)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X ((2 <= wait_msg_15 + wait_msg_14 + wait_msg_13 + wait_msg_12 + wait_msg_11 + wait_msg_10 + wait_msg_1 + wait_msg_2 + wait_msg_3 + wait_msg_4 + wait_msg_5 + wait_msg_6 + wait_msg_7 + wait_msg_8 + wait_msg_9)))
lola: processed formula length: 213
lola: 42 rewrites
lola: closed formula file SafeBus-PT-15-LTLCardinality.task
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
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: 191 markings, 191 edges
lola: ========================================

FORMULA SafeBus-PT-15-LTLCardinality-7 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 8 will run for 437 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (X (X (G ((AMC_13_3 <= MSG_13))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (X (X (G ((AMC_13_3 <= MSG_13))))))
lola: processed formula length: 40
lola: 42 rewrites
lola: closed formula file SafeBus-PT-15-LTLCardinality.task
lola: the resulting Büchi automaton has 5 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
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: 512 markings, 533 edges
lola: ========================================

FORMULA SafeBus-PT-15-LTLCardinality-9 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 9 will run for 500 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (X (G ((1 <= wait_cable_10 + wait_cable_11 + wait_cable_12 + wait_cable_13 + wait_cable_14 + wait_cable_15 + 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)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (X (G ((1 <= wait_cable_10 + wait_cable_11 + wait_cable_12 + wait_cable_13 + wait_cable_14 + wait_cable_15 + 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)))))
lola: processed formula length: 251
lola: 42 rewrites
lola: closed formula file SafeBus-PT-15-LTLCardinality.task
lola: the resulting Büchi automaton has 4 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
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: 192 markings, 192 edges
lola: ========================================

FORMULA SafeBus-PT-15-LTLCardinality-2 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 10 will run for 583 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (TRUE))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (TRUE))
lola: processed formula length: 12
lola: 42 rewrites
lola: closed formula file SafeBus-PT-15-LTLCardinality.task
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
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: 16 markings, 15 edges
lola: ========================================

FORMULA SafeBus-PT-15-LTLCardinality-5 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 11 will run for 700 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (TRUE))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (TRUE))
lola: processed formula length: 12
lola: 42 rewrites
lola: closed formula file SafeBus-PT-15-LTLCardinality.task
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
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: 16 markings, 15 edges
lola: ========================================

FORMULA SafeBus-PT-15-LTLCardinality-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 12 will run for 875 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (F ((wait_ack_9_4 <= AMC_15_10))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (F ((wait_ack_9_4 <= AMC_15_10))))
lola: processed formula length: 39
lola: 42 rewrites
lola: closed formula file SafeBus-PT-15-LTLCardinality.task
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
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: 16 markings, 15 edges
lola:
========================================
FORMULA SafeBus-PT-15-LTLCardinality-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 13 will run for 1167 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F ((wait_ack_2_8 <= AMC_5_15)))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:659
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: (AMC_5_15 + 1 <= wait_ack_2_8)
lola: processed formula length: 30
lola: 44 rewrites
lola: closed formula file SafeBus-PT-15-LTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: state space / EG
lola: The predicate eventually occurs.
lola: 1 markings, 0 edges
lola: ========================================

FORMULA SafeBus-PT-15-LTLCardinality-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 14 will run for 1750 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (G ((AMC_13_4 <= AMC_3_2))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F (G ((AMC_13_4 <= AMC_3_2))))
lola: processed formula length: 33
lola: 42 rewrites
lola: closed formula file SafeBus-PT-15-LTLCardinality.task
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method (--stubborn)
lola: SEARCH
lola: RUNNING
lola: 287 markings, 287 edges, 57 markings/sec, 0 secs
lola: 573 markings, 584 edges, 57 markings/sec, 5 secs
lola: 865 markings, 898 edges, 58 markings/sec, 10 secs
lola: 1162 markings, 1230 edges, 59 markings/sec, 15 secs
lola: 1447 markings, 1544 edges, 57 markings/sec, 20 secs
lola: 1720 markings, 1840 edges, 55 markings/sec, 25 secs
lola: 2007 markings, 2175 edges, 57 markings/sec, 30 secs
lola: 2296 markings, 2516 edges, 58 markings/sec, 35 secs
lola: 2559 markings, 2824 edges, 53 markings/sec, 40 secs
lola: 2850 markings, 3162 edges, 58 markings/sec, 45 secs
lola: 3141 markings, 3501 edges, 58 markings/sec, 50 secs
lola: 3418 markings, 3831 edges, 55 markings/sec, 55 secs
lola: 3692 markings, 4157 edges, 55 markings/sec, 60 secs
lola: 3999 markings, 4524 edges, 61 markings/sec, 65 secs
lola: 4283 markings, 4873 edges, 57 markings/sec, 70 secs
lola: 4581 markings, 5255 edges, 60 markings/sec, 75 secs
lola: 4864 markings, 5624 edges, 57 markings/sec, 80 secs
lola: 5176 markings, 5998 edges, 62 markings/sec, 85 secs
lola: 5476 markings, 6338 edges, 60 markings/sec, 90 secs
lola: 5807 markings, 6737 edges, 66 markings/sec, 95 secs
lola: 6101 markings, 7101 edges, 59 markings/sec, 100 secs
lola: 6368 markings, 7438 edges, 53 markings/sec, 105 secs
lola: 6669 markings, 7792 edges, 60 markings/sec, 110 secs
lola: 7033 markings, 8201 edges, 73 markings/sec, 115 secs
lola: 7310 markings, 8520 edges, 55 markings/sec, 120 secs
lola: 7553 markings, 8766 edges, 49 markings/sec, 125 secs
lola: 7807 markings, 9026 edges, 51 markings/sec, 130 secs
lola: 8052 markings, 9286 edges, 49 markings/sec, 135 secs
lola: 8299 markings, 9549 edges, 49 markings/sec, 140 secs
lola: 8511 markings, 9761 edges, 42 markings/sec, 145 secs
lola: 8791 markings, 10084 edges, 56 markings/sec, 150 secs
lola: 9069 markings, 10401 edges, 56 markings/sec, 155 secs
lola: 9307 markings, 10648 edges, 48 markings/sec, 160 secs
lola: 9541 markings, 10936 edges, 47 markings/sec, 165 secs
lola: 9792 markings, 11200 edges, 50 markings/sec, 170 secs
lola: 10058 markings, 11495 edges, 53 markings/sec, 175 secs
lola: 10291 markings, 11751 edges, 47 markings/sec, 180 secs
lola: 10538 markings, 11999 edges, 49 markings/sec, 185 secs
lola: 10796 markings, 12275 edges, 52 markings/sec, 190 secs
lola: 11043 markings, 12554 edges, 49 markings/sec, 195 secs
lola: 11278 markings, 12822 edges, 47 markings/sec, 200 secs
lola: 11527 markings, 13081 edges, 50 markings/sec, 205 secs
lola: 11763 markings, 13360 edges, 47 markings/sec, 210 secs
lola: 12003 markings, 13636 edges, 48 markings/sec, 215 secs
lola: 12246 markings, 13907 edges, 49 markings/sec, 220 secs
lola: 12470 markings, 14140 edges, 45 markings/sec, 225 secs
lola: 12710 markings, 14404 edges, 48 markings/sec, 230 secs
lola: 12940 markings, 14652 edges, 46 markings/sec, 235 secs
lola: 13177 markings, 14937 edges, 47 markings/sec, 240 secs
lola: 13424 markings, 15238 edges, 49 markings/sec, 245 secs
lola: 13673 markings, 15546 edges, 50 markings/sec, 250 secs
lola: 13917 markings, 15840 edges, 49 markings/sec, 255 secs
lola: 14161 markings, 16113 edges, 49 markings/sec, 260 secs
lola: 14413 markings, 16395 edges, 50 markings/sec, 265 secs
lola: 14670 markings, 16700 edges, 51 markings/sec, 270 secs
lola: 14926 markings, 16990 edges, 51 markings/sec, 275 secs
lola: 15184 markings, 17256 edges, 52 markings/sec, 280 secs
lola: 15424 markings, 17513 edges, 48 markings/sec, 285 secs
lola: 15675 markings, 17802 edges, 50 markings/sec, 290 secs
lola: 15922 markings, 18063 edges, 49 markings/sec, 295 secs
lola: 16151 markings, 18318 edges, 46 markings/sec, 300 secs
lola: 16391 markings, 18575 edges, 48 markings/sec, 305 secs
lola: 16635 markings, 18841 edges, 49 markings/sec, 310 secs
lola: 16909 markings, 19163 edges, 55 markings/sec, 315 secs
lola: 17153 markings, 19451 edges, 49 markings/sec, 320 secs
lola: 17393 markings, 19701 edges, 48 markings/sec, 325 secs
lola: 17636 markings, 19967 edges, 49 markings/sec, 330 secs
lola: 17886 markings, 20263 edges, 50 markings/sec, 335 secs
lola: 18109 markings, 20497 edges, 45 markings/sec, 340 secs
lola: 18343 markings, 20739 edges, 47 markings/sec, 345 secs
lola: 18584 markings, 20984 edges, 48 markings/sec, 350 secs
lola: 18833 markings, 21264 edges, 50 markings/sec, 355 secs
lola: 19084 markings, 21558 edges, 50 markings/sec, 360 secs
lola: 19321 markings, 21851 edges, 47 markings/sec, 365 secs
lola: 19555 markings, 22151 edges, 47 markings/sec, 370 secs
lola: 19792 markings, 22414 edges, 47 markings/sec, 375 secs
lola: 20026 markings, 22704 edges, 47 markings/sec, 380 secs
lola: 20254 markings, 23000 edges, 46 markings/sec, 385 secs
lola: 20513 markings, 23300 edges, 52 markings/sec, 390 secs
lola: 20736 markings, 23568 edges, 45 markings/sec, 395 secs
lola: 20969 markings, 23851 edges, 47 markings/sec, 400 secs
lola: 21203 markings, 24169 edges, 47 markings/sec, 405 secs
lola: 21430 markings, 24451 edges, 45 markings/sec, 410 secs
lola: 21665 markings, 24754 edges, 47 markings/sec, 415 secs
lola: 21927 markings, 25076 edges, 52 markings/sec, 420 secs
lola: 22165 markings, 25371 edges, 48 markings/sec, 425 secs
lola: 22421 markings, 25701 edges, 51 markings/sec, 430 secs
lola: 22667 markings, 26006 edges, 49 markings/sec, 435 secs
lola: 22910 markings, 26297 edges, 49 markings/sec, 440 secs
lola: 23139 markings, 26587 edges, 46 markings/sec, 445 secs
lola: 23376 markings, 26895 edges, 47 markings/sec, 450 secs
lola: 23614 markings, 27193 edges, 48 markings/sec, 455 secs
lola: 23861 markings, 27509 edges, 49 markings/sec, 460 secs
lola: 24133 markings, 27871 edges, 54 markings/sec, 465 secs
lola: 24396 markings, 28180 edges, 53 markings/sec, 470 secs
lola: 24666 markings, 28501 edges, 54 markings/sec, 475 secs
lola: 24938 markings, 28867 edges, 54 markings/sec, 480 secs
lola: 25196 markings, 29168 edges, 52 markings/sec, 485 secs
lola: 25448 markings, 29517 edges, 50 markings/sec, 490 secs
lola: 25689 markings, 29807 edges, 48 markings/sec, 495 secs
lola: 25958 markings, 30150 edges, 54 markings/sec, 500 secs
lola: 26213 markings, 30452 edges, 51 markings/sec, 505 secs
lola: 26468 markings, 30780 edges, 51 markings/sec, 510 secs
lola: 26742 markings, 31129 edges, 55 markings/sec, 515 secs
lola: 27003 markings, 31475 edges, 52 markings/sec, 520 secs
lola: 27273 markings, 31839 edges, 54 markings/sec, 525 secs
lola: 27480 markings, 32103 edges, 41 markings/sec, 530 secs
lola: 27718 markings, 32342 edges, 48 markings/sec, 535 secs
lola: 27953 markings, 32597 edges, 47 markings/sec, 540 secs
lola: 28190 markings, 32868 edges, 47 markings/sec, 545 secs
lola: 28442 markings, 33169 edges, 50 markings/sec, 550 secs
lola: 28676 markings, 33454 edges, 47 markings/sec, 555 secs
lola: 28952 markings, 33803 edges, 55 markings/sec, 560 secs
lola: 29183 markings, 34067 edges, 46 markings/sec, 565 secs
lola: 29420 markings, 34366 edges, 47 markings/sec, 570 secs
lola: 29657 markings, 34628 edges, 47 markings/sec, 575 secs
lola: 29905 markings, 34916 edges, 50 markings/sec, 580 secs
lola: 30192 markings, 35310 edges, 57 markings/sec, 585 secs
lola: 30442 markings, 35636 edges, 50 markings/sec, 590 secs
lola: 30696 markings, 35962 edges, 51 markings/sec, 595 secs
lola: 30961 markings, 36281 edges, 53 markings/sec, 600 secs
lola: 31206 markings, 36562 edges, 49 markings/sec, 605 secs
lola: 31439 markings, 36871 edges, 47 markings/sec, 610 secs
lola: 31688 markings, 37180 edges, 50 markings/sec, 615 secs
lola: 31958 markings, 37560 edges, 54 markings/sec, 620 secs
lola: 32193 markings, 37838 edges, 47 markings/sec, 625 secs
lola: 32458 markings, 38188 edges, 53 markings/sec, 630 secs
lola: 32680 markings, 38477 edges, 44 markings/sec, 635 secs
lola: 32918 markings, 38790 edges, 48 markings/sec, 640 secs
lola: 33166 markings, 39130 edges, 50 markings/sec, 645 secs
lola: 33411 markings, 39466 edges, 49 markings/sec, 650 secs
lola: 33664 markings, 39767 edges, 51 markings/sec, 655 secs
lola: 33908 markings, 40043 edges, 49 markings/sec, 660 secs
lola: 34141 markings, 40311 edges, 47 markings/sec, 665 secs
lola: 34432 markings, 40653 edges, 58 markings/sec, 670 secs
lola: 34723 markings, 41021 edges, 58 markings/sec, 675 secs
lola: 34965 markings, 41329 edges, 48 markings/sec, 680 secs
lola: 35220 markings, 41673 edges, 51 markings/sec, 685 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: 35237 markings, 41696 edges
lola: ========================================

FORMULA SafeBus-PT-15-LTLCardinality-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 15 will run for 2811 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (((wait_ack_8_10 <= AMC_14_14) OR (G (F ((wait_ack_7_15 <= AMC_12_10))) AND F ((wait_ack_8_10 <= AMC_14_14)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (((wait_ack_8_10 <= AMC_14_14) OR (G (F ((wait_ack_7_15 <= AMC_12_10))) AND F ((wait_ack_8_10 <= AMC_14_14)))))
lola: processed formula length: 113
lola: 42 rewrites
lola: closed formula file SafeBus-PT-15-LTLCardinality.task
lola: the resulting Büchi automaton has 4 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method (--stubborn)
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: 1 markings, 0 edges
lola: ========================================

FORMULA SafeBus-PT-15-LTLCardinality-8 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: RESULT
lola:
SUMMARY: yes no no yes no yes yes no yes no yes yes yes no yes yes
lola:
preliminary result: yes no no yes no yes yes no yes no yes yes yes no yes yes
lola: memory consumption: 33932 KB
lola: time consumption: 758 seconds

BK_STOP 1528138710478

--------------------
content from 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="SafeBus-PT-15"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="lola"
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-15.tgz
mv SafeBus-PT-15 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 lola"
echo " Input is SafeBus-PT-15, 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 r208-smll-152732257900535"
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 ;