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 5.4M
-rw-r--r-- 1 mcc users 51K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 177K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 509K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 1.5M 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.2K May 15 18:50 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 18K May 15 18:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 59K May 15 18:54 LTLCardinality.xml
-rw-r--r-- 1 mcc users 195K May 15 18:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 533K May 15 18:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 62K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 210K May 15 18:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 107 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 345 May 15 18:54 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 339K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 957K May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 14K May 15 18:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 35K 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 4 May 15 18:50 instance
-rw-r--r-- 1 mcc users 6 May 15 18:50 iscolored
-rw-r--r-- 1 mcc users 802K May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool lola
Input is TokenRing-PT-010, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r172-smll-152708743200317
=====================================================================

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of positive values
NUM_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME TokenRing-PT-010-UpperBounds-00
FORMULA_NAME TokenRing-PT-010-UpperBounds-01
FORMULA_NAME TokenRing-PT-010-UpperBounds-02
FORMULA_NAME TokenRing-PT-010-UpperBounds-03
FORMULA_NAME TokenRing-PT-010-UpperBounds-04
FORMULA_NAME TokenRing-PT-010-UpperBounds-05
FORMULA_NAME TokenRing-PT-010-UpperBounds-06
FORMULA_NAME TokenRing-PT-010-UpperBounds-07
FORMULA_NAME TokenRing-PT-010-UpperBounds-08
FORMULA_NAME TokenRing-PT-010-UpperBounds-09
FORMULA_NAME TokenRing-PT-010-UpperBounds-10
FORMULA_NAME TokenRing-PT-010-UpperBounds-11
FORMULA_NAME TokenRing-PT-010-UpperBounds-12
FORMULA_NAME TokenRing-PT-010-UpperBounds-13
FORMULA_NAME TokenRing-PT-010-UpperBounds-14
FORMULA_NAME TokenRing-PT-010-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1527327478550

info: Time: 3600 - MCC
===========================================================================================
prep: translating TokenRing-PT-010 Petri net model.pnml into LoLA format
===========================================================================================
prep: translating PT Petri net complete
prep: check for too many tokens
===========================================================================================
prep: translating TokenRing-PT-010 formula UpperBounds into LoLA format
===========================================================================================
prep: translating PT formula complete
vrfy: Checking UpperBounds @ TokenRing-PT-010 @ 3570 seconds
lola: LoLA will run for 3570 seconds at most (--timelimit)
lola: NET
lola: reading net from model.pnml.lola
lola: finished parsing
lola: closed net file model.pnml.lola
lola: 1232/65536 symbol table entries, 62 collisions
lola: preprocessing...
lola: Size of bit vector: 3872
lola: finding significant places
lola: 121 places, 1111 transitions, 110 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 1232 transition conflict sets
lola: TASK
lola: reading formula from TokenRing-PT-010-UpperBounds.task
lola: place invariant simplifies atomic proposition
lola: before: (State_8_0 + State_8_1 + State_8_2 + State_8_3 + State_8_4 + State_8_5 + State_8_6 + State_8_7 + State_8_8 + State_8_9 + State_0_10 + State_9_0 + State_9_1 + State_9_2 + State_9_3 + State_9_4 + State_9_5 + State_9_6 + State_9_7 + State_9_8 + State_9_9 + State_10_0 + State_10_1 + State_10_2 + State_10_3 + State_10_4 + State_10_5 + State_10_6 + State_10_7 + State_10_8 + State_10_9 + State_5_10 + State_4_10 + State_7_8 + State_7_7 + State_3_10 + State_0_0 + State_0_1 + State_0_2 + State_0_3 + State_0_4 + State_0_5 + State_0_6 + State_0_7 + State_0_8 + State_7_6 + State_7_5 + State_1_0 + State_1_1 + State_1_2 + State_1_3 + State_1_4 + State_1_5 + State_1_6 + State_1_7 + State_1_8 + State_1_9 + State_2_0 + State_2_1 + State_2_2 + State_2_3 + State_2_4 + State_2_5 + State_2_6 + State_2_7 + State_2_8 + State_2_9 + State_7_4 + State_3_0 + State_3_1 + State_3_2 + State_3_3 + State_3_4 + State_3_5 + State_3_6 + State_3_7 + State_3_8 + State_7_3 + State_7_10 + State_4_0 + State_4_1 + State_4_2 + State_4_3 + State_4_4 + State_4_5 + State_4_6 + State_4_7 + State_4_8 + State_7_2 + State_5_0 + State_5_1 + State_5_2 + State_5_3 + State_5_4 + State_5_5 + State_5_6 + State_5_7 + State_5_8 + State_7_1 + State_7_0 + State_6_0 + State_6_1 + State_6_2 + State_6_3 + State_6_4 + State_6_5 + State_6_6 + State_6_7 + State_6_8 + State_6_9 + State_1_10 + State_5_9 + State_4_9 + State_3_9 + State_2_10 + State_8_10 + State_0_9 + State_10_10 + State_9_10 + State_7_9 + State_6_10 <= 0)
lola: after: (11 <= 0)
lola: always false
lola: place invariant simplifies atomic proposition
lola: before: (State_8_0 + State_8_1 + State_8_2 + State_8_3 + State_8_4 + State_8_5 + State_8_6 + State_8_7 + State_8_8 + State_8_9 + State_0_10 + State_9_0 + State_9_1 + State_9_2 + State_9_3 + State_9_4 + State_9_5 + State_9_6 + State_9_7 + State_9_8 + State_9_9 + State_10_0 + State_10_1 + State_10_2 + State_10_3 + State_10_4 + State_10_5 + State_10_6 + State_10_7 + State_10_8 + State_10_9 + State_5_10 + State_4_10 + State_7_8 + State_7_7 + State_3_10 + State_0_0 + State_0_1 + State_0_2 + State_0_3 + State_0_4 + State_0_5 + State_0_6 + State_0_7 + State_0_8 + State_7_6 + State_7_5 + State_1_0 + State_1_1 + State_1_2 + State_1_3 + State_1_4 + State_1_5 + State_1_6 + State_1_7 + State_1_8 + State_1_9 + State_2_0 + State_2_1 + State_2_2 + State_2_3 + State_2_4 + State_2_5 + State_2_6 + State_2_7 + State_2_8 + State_2_9 + State_7_4 + State_3_0 + State_3_1 + State_3_2 + State_3_3 + State_3_4 + State_3_5 + State_3_6 + State_3_7 + State_3_8 + State_7_3 + State_7_10 + State_4_0 + State_4_1 + State_4_2 + State_4_3 + State_4_4 + State_4_5 + State_4_6 + State_4_7 + State_4_8 + State_7_2 + State_5_0 + State_5_1 + State_5_2 + State_5_3 + State_5_4 + State_5_5 + State_5_6 + State_5_7 + State_5_8 + State_7_1 + State_7_0 + State_6_0 + State_6_1 + State_6_2 + State_6_3 + State_6_4 + State_6_5 + State_6_6 + State_6_7 + State_6_8 + State_6_9 + State_1_10 + State_5_9 + State_4_9 + State_3_9 + State_2_10 + State_8_10 + State_0_9 + State_10_10 + State_9_10 + State_7_9 + State_6_10 <= 0)
lola: after: (11 <= 0)
lola: always false
lola: place invariant simplifies atomic proposition
lola: before: (State_8_0 + State_8_1 + State_8_2 + State_8_3 + State_8_4 + State_8_5 + State_8_6 + State_8_7 + State_8_8 + State_8_9 + State_0_10 + State_9_0 + State_9_1 + State_9_2 + State_9_3 + State_9_4 + State_9_5 + State_9_6 + State_9_7 + State_9_8 + State_9_9 + State_10_0 + State_10_1 + State_10_2 + State_10_3 + State_10_4 + State_10_5 + State_10_6 + State_10_7 + State_10_8 + State_10_9 + State_5_10 + State_4_10 + State_7_8 + State_7_7 + State_3_10 + State_0_0 + State_0_1 + State_0_2 + State_0_3 + State_0_4 + State_0_5 + State_0_6 + State_0_7 + State_0_8 + State_7_6 + State_7_5 + State_1_0 + State_1_1 + State_1_2 + State_1_3 + State_1_4 + State_1_5 + State_1_6 + State_1_7 + State_1_8 + State_1_9 + State_2_0 + State_2_1 + State_2_2 + State_2_3 + State_2_4 + State_2_5 + State_2_6 + State_2_7 + State_2_8 + State_2_9 + State_7_4 + State_3_0 + State_3_1 + State_3_2 + State_3_3 + State_3_4 + State_3_5 + State_3_6 + State_3_7 + State_3_8 + State_7_3 + State_7_10 + State_4_0 + State_4_1 + State_4_2 + State_4_3 + State_4_4 + State_4_5 + State_4_6 + State_4_7 + State_4_8 + State_7_2 + State_5_0 + State_5_1 + State_5_2 + State_5_3 + State_5_4 + State_5_5 + State_5_6 + State_5_7 + State_5_8 + State_7_1 + State_7_0 + State_6_0 + State_6_1 + State_6_2 + State_6_3 + State_6_4 + State_6_5 + State_6_6 + State_6_7 + State_6_8 + State_6_9 + State_1_10 + State_5_9 + State_4_9 + State_3_9 + State_2_10 + State_8_10 + State_0_9 + State_10_10 + State_9_10 + State_7_9 + State_6_10 <= 0)
lola: after: (11 <= 0)
lola: always false
lola: place invariant simplifies atomic proposition
lola: before: (State_8_0 + State_8_1 + State_8_2 + State_8_3 + State_8_4 + State_8_5 + State_8_6 + State_8_7 + State_8_8 + State_8_9 + State_0_10 + State_9_0 + State_9_1 + State_9_2 + State_9_3 + State_9_4 + State_9_5 + State_9_6 + State_9_7 + State_9_8 + State_9_9 + State_10_0 + State_10_1 + State_10_2 + State_10_3 + State_10_4 + State_10_5 + State_10_6 + State_10_7 + State_10_8 + State_10_9 + State_5_10 + State_4_10 + State_7_8 + State_7_7 + State_3_10 + State_0_0 + State_0_1 + State_0_2 + State_0_3 + State_0_4 + State_0_5 + State_0_6 + State_0_7 + State_0_8 + State_7_6 + State_7_5 + State_1_0 + State_1_1 + State_1_2 + State_1_3 + State_1_4 + State_1_5 + State_1_6 + State_1_7 + State_1_8 + State_1_9 + State_2_0 + State_2_1 + State_2_2 + State_2_3 + State_2_4 + State_2_5 + State_2_6 + State_2_7 + State_2_8 + State_2_9 + State_7_4 + State_3_0 + State_3_1 + State_3_2 + State_3_3 + State_3_4 + State_3_5 + State_3_6 + State_3_7 + State_3_8 + State_7_3 + State_7_10 + State_4_0 + State_4_1 + State_4_2 + State_4_3 + State_4_4 + State_4_5 + State_4_6 + State_4_7 + State_4_8 + State_7_2 + State_5_0 + State_5_1 + State_5_2 + State_5_3 + State_5_4 + State_5_5 + State_5_6 + State_5_7 + State_5_8 + State_7_1 + State_7_0 + State_6_0 + State_6_1 + State_6_2 + State_6_3 + State_6_4 + State_6_5 + State_6_6 + State_6_7 + State_6_8 + State_6_9 + State_1_10 + State_5_9 + State_4_9 + State_3_9 + State_2_10 + State_8_10 + State_0_9 + State_10_10 + State_9_10 + State_7_9 + State_6_10 <= 0)
lola: after: (11 <= 0)
lola: always false
lola: place invariant simplifies atomic proposition
lola: before: (State_8_0 + State_8_1 + State_8_2 + State_8_3 + State_8_4 + State_8_5 + State_8_6 + State_8_7 + State_8_8 + State_8_9 + State_0_10 + State_9_0 + State_9_1 + State_9_2 + State_9_3 + State_9_4 + State_9_5 + State_9_6 + State_9_7 + State_9_8 + State_9_9 + State_10_0 + State_10_1 + State_10_2 + State_10_3 + State_10_4 + State_10_5 + State_10_6 + State_10_7 + State_10_8 + State_10_9 + State_5_10 + State_4_10 + State_7_8 + State_7_7 + State_3_10 + State_0_0 + State_0_1 + State_0_2 + State_0_3 + State_0_4 + State_0_5 + State_0_6 + State_0_7 + State_0_8 + State_7_6 + State_7_5 + State_1_0 + State_1_1 + State_1_2 + State_1_3 + State_1_4 + State_1_5 + State_1_6 + State_1_7 + State_1_8 + State_1_9 + State_2_0 + State_2_1 + State_2_2 + State_2_3 + State_2_4 + State_2_5 + State_2_6 + State_2_7 + State_2_8 + State_2_9 + State_7_4 + State_3_0 + State_3_1 + State_3_2 + State_3_3 + State_3_4 + State_3_5 + State_3_6 + State_3_7 + State_3_8 + State_7_3 + State_7_10 + State_4_0 + State_4_1 + State_4_2 + State_4_3 + State_4_4 + State_4_5 + State_4_6 + State_4_7 + State_4_8 + State_7_2 + State_5_0 + State_5_1 + State_5_2 + State_5_3 + State_5_4 + State_5_5 + State_5_6 + State_5_7 + State_5_8 + State_7_1 + State_7_0 + State_6_0 + State_6_1 + State_6_2 + State_6_3 + State_6_4 + State_6_5 + State_6_6 + State_6_7 + State_6_8 + State_6_9 + State_1_10 + State_5_9 + State_4_9 + State_3_9 + State_2_10 + State_8_10 + State_0_9 + State_10_10 + State_9_10 + State_7_9 + State_6_10 <= 0)
lola: after: (11 <= 0)
lola: always false
lola: place invariant simplifies atomic proposition
lola: before: (State_8_0 + State_8_1 + State_8_2 + State_8_3 + State_8_4 + State_8_5 + State_8_6 + State_8_7 + State_8_8 + State_8_9 + State_0_10 + State_9_0 + State_9_1 + State_9_2 + State_9_3 + State_9_4 + State_9_5 + State_9_6 + State_9_7 + State_9_8 + State_9_9 + State_10_0 + State_10_1 + State_10_2 + State_10_3 + State_10_4 + State_10_5 + State_10_6 + State_10_7 + State_10_8 + State_10_9 + State_5_10 + State_4_10 + State_7_8 + State_7_7 + State_3_10 + State_0_0 + State_0_1 + State_0_2 + State_0_3 + State_0_4 + State_0_5 + State_0_6 + State_0_7 + State_0_8 + State_7_6 + State_7_5 + State_1_0 + State_1_1 + State_1_2 + State_1_3 + State_1_4 + State_1_5 + State_1_6 + State_1_7 + State_1_8 + State_1_9 + State_2_0 + State_2_1 + State_2_2 + State_2_3 + State_2_4 + State_2_5 + State_2_6 + State_2_7 + State_2_8 + State_2_9 + State_7_4 + State_3_0 + State_3_1 + State_3_2 + State_3_3 + State_3_4 + State_3_5 + State_3_6 + State_3_7 + State_3_8 + State_7_3 + State_7_10 + State_4_0 + State_4_1 + State_4_2 + State_4_3 + State_4_4 + State_4_5 + State_4_6 + State_4_7 + State_4_8 + State_7_2 + State_5_0 + State_5_1 + State_5_2 + State_5_3 + State_5_4 + State_5_5 + State_5_6 + State_5_7 + State_5_8 + State_7_1 + State_7_0 + State_6_0 + State_6_1 + State_6_2 + State_6_3 + State_6_4 + State_6_5 + State_6_6 + State_6_7 + State_6_8 + State_6_9 + State_1_10 + State_5_9 + State_4_9 + State_3_9 + State_2_10 + State_8_10 + State_0_9 + State_10_10 + State_9_10 + State_7_9 + State_6_10 <= 0)
lola: after: (11 <= 0)
lola: always false
lola: place invariant simplifies atomic proposition
lola: before: (State_8_0 + State_8_1 + State_8_2 + State_8_3 + State_8_4 + State_8_5 + State_8_6 + State_8_7 + State_8_8 + State_8_9 + State_0_10 + State_9_0 + State_9_1 + State_9_2 + State_9_3 + State_9_4 + State_9_5 + State_9_6 + State_9_7 + State_9_8 + State_9_9 + State_10_0 + State_10_1 + State_10_2 + State_10_3 + State_10_4 + State_10_5 + State_10_6 + State_10_7 + State_10_8 + State_10_9 + State_5_10 + State_4_10 + State_7_8 + State_7_7 + State_3_10 + State_0_0 + State_0_1 + State_0_2 + State_0_3 + State_0_4 + State_0_5 + State_0_6 + State_0_7 + State_0_8 + State_7_6 + State_7_5 + State_1_0 + State_1_1 + State_1_2 + State_1_3 + State_1_4 + State_1_5 + State_1_6 + State_1_7 + State_1_8 + State_1_9 + State_2_0 + State_2_1 + State_2_2 + State_2_3 + State_2_4 + State_2_5 + State_2_6 + State_2_7 + State_2_8 + State_2_9 + State_7_4 + State_3_0 + State_3_1 + State_3_2 + State_3_3 + State_3_4 + State_3_5 + State_3_6 + State_3_7 + State_3_8 + State_7_3 + State_7_10 + State_4_0 + State_4_1 + State_4_2 + State_4_3 + State_4_4 + State_4_5 + State_4_6 + State_4_7 + State_4_8 + State_7_2 + State_5_0 + State_5_1 + State_5_2 + State_5_3 + State_5_4 + State_5_5 + State_5_6 + State_5_7 + State_5_8 + State_7_1 + State_7_0 + State_6_0 + State_6_1 + State_6_2 + State_6_3 + State_6_4 + State_6_5 + State_6_6 + State_6_7 + State_6_8 + State_6_9 + State_1_10 + State_5_9 + State_4_9 + State_3_9 + State_2_10 + State_8_10 + State_0_9 + State_10_10 + State_9_10 + State_7_9 + State_6_10 <= 0)
lola: after: (11 <= 0)
lola: always false
lola: place invariant simplifies atomic proposition
lola: before: (State_8_0 + State_8_1 + State_8_2 + State_8_3 + State_8_4 + State_8_5 + State_8_6 + State_8_7 + State_8_8 + State_8_9 + State_0_10 + State_9_0 + State_9_1 + State_9_2 + State_9_3 + State_9_4 + State_9_5 + State_9_6 + State_9_7 + State_9_8 + State_9_9 + State_10_0 + State_10_1 + State_10_2 + State_10_3 + State_10_4 + State_10_5 + State_10_6 + State_10_7 + State_10_8 + State_10_9 + State_5_10 + State_4_10 + State_7_8 + State_7_7 + State_3_10 + State_0_0 + State_0_1 + State_0_2 + State_0_3 + State_0_4 + State_0_5 + State_0_6 + State_0_7 + State_0_8 + State_7_6 + State_7_5 + State_1_0 + State_1_1 + State_1_2 + State_1_3 + State_1_4 + State_1_5 + State_1_6 + State_1_7 + State_1_8 + State_1_9 + State_2_0 + State_2_1 + State_2_2 + State_2_3 + State_2_4 + State_2_5 + State_2_6 + State_2_7 + State_2_8 + State_2_9 + State_7_4 + State_3_0 + State_3_1 + State_3_2 + State_3_3 + State_3_4 + State_3_5 + State_3_6 + State_3_7 + State_3_8 + State_7_3 + State_7_10 + State_4_0 + State_4_1 + State_4_2 + State_4_3 + State_4_4 + State_4_5 + State_4_6 + State_4_7 + State_4_8 + State_7_2 + State_5_0 + State_5_1 + State_5_2 + State_5_3 + State_5_4 + State_5_5 + State_5_6 + State_5_7 + State_5_8 + State_7_1 + State_7_0 + State_6_0 + State_6_1 + State_6_2 + State_6_3 + State_6_4 + State_6_5 + State_6_6 + State_6_7 + State_6_8 + State_6_9 + State_1_10 + State_5_9 + State_4_9 + State_3_9 + State_2_10 + State_8_10 + State_0_9 + State_10_10 + State_9_10 + State_7_9 + State_6_10 <= 0)
lola: after: (11 <= 0)
lola: always false
lola: MAX(0) : MAX(0) : MAX(0) : MAX(0) : MAX(0) : MAX(0) : MAX(0) : MAX(0) : MAX(State_2_0) : MAX(State_9_1) : MAX(State_4_3) : MAX(State_7_0) : MAX(State_7_8) : MAX(State_7_2) : MAX(State_7_6) : MAX(State_9_4)
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 223 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(0)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(0)
lola: processed formula length: 6
lola: 0 rewrites
lola: closed formula file TokenRing-PT-010-UpperBounds.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using bound preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: RUNNING
lola: Structural Bound: 11
lola: SUBRESULT
lola: result: 11
lola: produced by: state space
lola: The maximum value of the given expression is 11
lola: 0 markings, 0 edges
lola: ========================================

FORMULA TokenRing-PT-010-UpperBounds-0 11 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 1 will run for 238 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(0)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(0)
lola: processed formula length: 6
lola: 0 rewrites
lola: closed formula file TokenRing-PT-010-UpperBounds.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using bound preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: RUNNING
lola: Structural Bound: 11
lola: SUBRESULT
lola: result: 11
lola: produced by: state space
lola: The maximum value of the given expression is 11
lola: 0 markings, 0 edges
lola: ========================================

FORMULA TokenRing-PT-010-UpperBounds-1 11 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 2 will run for 255 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(0)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(0)
lola: processed formula length: 6
lola: 0 rewrites
lola: closed formula file TokenRing-PT-010-UpperBounds.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using bound preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: RUNNING
lola: Structural Bound: 11
lola: SUBRESULT
lola: result: 11
lola: produced by: state space
lola: The maximum value of the given expression is 11
lola: 0 markings, 0 edges

FORMULA TokenRing-PT-010-UpperBounds-2 11 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 3 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(0)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(0)
lola: processed formula length: 6
lola: 0 rewrites
lola: closed formula file TokenRing-PT-010-UpperBounds.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using bound preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: RUNNING
lola: Structural Bound: 11
lola: SUBRESULT
lola: result: 11
lola: produced by: state space
lola: The maximum value of the given expression is 11
lola: 0 markings, 0 edges
lola: ========================================

FORMULA TokenRing-PT-010-UpperBounds-3 11 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 4 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(0)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(0)
lola: processed formula length: 6
lola: 0 rewrites
lola: closed formula file TokenRing-PT-010-UpperBounds.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using bound preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: RUNNING
lola: Structural Bound: 11
lola: SUBRESULT
lola: result: 11
lola: produced by: state space
lola: The maximum value of the given expression is 11
lola: 0 markings, 0 edges
lola: ========================================

FORMULA TokenRing-PT-010-UpperBounds-4 11 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 5 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(0)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(0)
lola: processed formula length: 6
lola: 0 rewrites
lola: closed formula file TokenRing-PT-010-UpperBounds.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using bound preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: RUNNING
lola: Structural Bound: 11
lola: SUBRESULT
lola: result: 11
lola: produced by: state space
lola: The maximum value of the given expression is 11
lola: 0 markings, 0 edges
lola: ========================================

FORMULA TokenRing-PT-010-UpperBounds-5 11 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 6 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(0)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(0)
lola: processed formula length: 6
lola: 0 rewrites
lola: closed formula file TokenRing-PT-010-UpperBounds.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using bound preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: RUNNING
lola: Structural Bound: 11
lola: SUBRESULT
lola: result: 11
lola: produced by: state space
lola: The maximum value of the given expression is 11
lola: 0 markings, 0 edges
lola: ========================================

FORMULA TokenRing-PT-010-UpperBounds-6 11 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 7 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(0)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(0)
lola: processed formula length: 6
lola: 0 rewrites
lola: closed formula file TokenRing-PT-010-UpperBounds.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using bound preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: RUNNING
lola: Structural Bound: 11
lola: SUBRESULT
lola: result: 11
lola: produced by: state space
lola: The maximum value of the given expression is 11
lola: 0 markings, 0 edges
lola: ========================================

FORMULA TokenRing-PT-010-UpperBounds-7 11 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 8 will run for 446 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(State_2_0)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(State_2_0)
lola: processed formula length: 14
lola: 0 rewrites
lola: closed formula file TokenRing-PT-010-UpperBounds.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using bound preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: RUNNING
lola: Structural Bound: 1
lola: SUBRESULT
lola: result: 1
lola: produced by: state space
lola: The maximum value of the given expression is 1
lola: 4 markings, 3 edges
lola: ========================================

FORMULA TokenRing-PT-010-UpperBounds-8 1 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 9 will run for 509 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(State_9_1)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(State_9_1)
lola: processed formula length: 14
lola: 0 rewrites
lola: closed formula file TokenRing-PT-010-UpperBounds.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using bound preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: RUNNING
lola: Structural Bound: 1
lola: SUBRESULT
lola: result: 1
lola: produced by: state space
lola: The maximum value of the given expression is 1
lola: 37 markings, 36 edges
lola: ========================================

FORMULA TokenRing-PT-010-UpperBounds-9 1 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 10 will run for 594 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(State_4_3)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(State_4_3)
lola: processed formula length: 14
lola: 0 rewrites
lola: closed formula file TokenRing-PT-010-UpperBounds.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using bound preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: RUNNING
lola: Structural Bound: 1
lola: SUBRESULT
lola: result: 1
lola: produced by: state space
lola: The maximum value of the given expression is 1
lola: 2 markings, 1 edges
lola: ========================================

FORMULA TokenRing-PT-010-UpperBounds-10 1 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 11 will run for 713 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(State_7_0)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(State_7_0)
lola: processed formula length: 14
lola: 0 rewrites
lola: closed formula file TokenRing-PT-010-UpperBounds.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using bound preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: RUNNING
lola: Structural Bound: 1
lola: SUBRESULT
lola: result: 1
lola: produced by: state space
lola: The maximum value of the given expression is 1
lola: 23 markings, 22 edges
lola: ========================================

FORMULA TokenRing-PT-010-UpperBounds-11 1 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 12 will run for 892 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(State_7_8)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(State_7_8)
lola: processed formula length: 14
lola: 0 rewrites
lola: closed formula file TokenRing-PT-010-UpperBounds.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using bound preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: RUNNING
lola: Structural Bound: 1
lola: SUBRESULT
lola: result: 1
lola: produced by: state space
lola: The maximum value of the given expression is 1
lola: 118 markings, 117 edges
lola: ========================================

FORMULA TokenRing-PT-010-UpperBounds-12 1 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 13 will run for 1189 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(State_7_2)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(State_7_2)
lola: processed formula length: 14
lola: 0 rewrites
lola: closed formula file TokenRing-PT-010-UpperBounds.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using bound preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: RUNNING
lola: Structural Bound: 1
lola: SUBRESULT
lola: result: 1
lola: produced by: state space
lola: The maximum value of the given expression is 1
lola: 12 markings, 11 edges
lola: ========================================

FORMULA TokenRing-PT-010-UpperBounds-13 1 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 14 will run for 1784 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(State_7_6)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(State_7_6)
lola: processed formula length: 14
lola: 0 rewrites
lola: closed formula file TokenRing-PT-010-UpperBounds.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using bound preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: RUNNING
lola: Structural Bound: 1
lola: SUBRESULT
lola: result: 1
lola: produced by: state space
lola: The maximum value of the given expression is 1
lola: 2 markings, 1 edges
lola: ========================================

FORMULA TokenRing-PT-010-UpperBounds-14 1 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 15 will run for 3569 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(State_9_4)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(State_9_4)
lola: processed formula length: 14
lola: 0 rewrites
lola: closed formula file TokenRing-PT-010-UpperBounds.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using bound preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: RUNNING
lola: Structural Bound: 1
lola: SUBRESULT
lola: result: 1
lola: produced by: state space
lola: The maximum value of the given expression is 1
lola: 16 markings, 15 edges
lola: ========================================

FORMULA TokenRing-PT-010-UpperBounds-15 1 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: RESULT
lola:
SUMMARY: 11 11 11 11 11 11 11 11 1 1 1 1 1 1 1 1
lola:
preliminary result: 11 11 11 11 11 11 11 11 1 1 1 1 1 1 1 1
lola: memory consumption: 17936 KB
lola: time consumption: 1 seconds

BK_STOP 1527327479188

--------------------
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="TokenRing-PT-010"
export BK_EXAMINATION="UpperBounds"
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/TokenRing-PT-010.tgz
mv TokenRing-PT-010 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 TokenRing-PT-010, examination is UpperBounds"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r172-smll-152708743200317"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "UpperBounds" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "UpperBounds" != "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 "UpperBounds.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property UpperBounds.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "UpperBounds.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 '' UpperBounds.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 ;