Execution Chart

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

Trace from the execution

Waiting for the VM to be ready (probing ssh)
....................
/home/mcc/execution
total 1.8M
-rw-r--r-- 1 mcc users 52K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 142K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 22K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 71K 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.1K May 15 18:50 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 22K 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 21K May 15 18:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 64K May 15 18:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 69K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 185K May 15 18:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 113 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 351 May 15 18:54 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 96K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 293K May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 11K May 15 18:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 23K 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 7 May 15 18:50 instance
-rw-r--r-- 1 mcc users 6 May 15 18:50 iscolored
-rw-r--r-- 1 mcc users 648K May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool lola
Input is SharedMemory-PT-000020, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r172-smll-152708742900114
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1527170973758

info: Time: 3600 - MCC
===========================================================================================
prep: translating SharedMemory-PT-000020 Petri net model.pnml into LoLA format
===========================================================================================
prep: translating PT Petri net complete
prep: added safe information to the net based on GenericPropertiesVerdict
prep: check for too many tokens
===========================================================================================
prep: translating SharedMemory-PT-000020 formula UpperBounds into LoLA format
===========================================================================================
prep: translating PT formula complete
vrfy: Checking UpperBounds @ SharedMemory-PT-000020 @ 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: 1281/65536 symbol table entries, 6 collisions
lola: preprocessing...
lola: Size of bit vector: 461
lola: finding significant places
lola: 461 places, 820 transitions, 420 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 880 transition conflict sets
lola: TASK
lola: reading formula from SharedMemory-PT-000020-UpperBounds.task
lola: LP says that atomic proposition is always false: (Memory_1 + Memory_2 + Memory_3 + Memory_4 + Memory_5 + Memory_6 + Memory_7 + Memory_8 + Memory_9 + Memory_10 + Memory_11 + Memory_12 + Memory_13 + Memory_14 + Memory_15 + Memory_16 + Memory_17 + Memory_18 + Memory_19 + Memory_20 <= 0)
lola: MAX(OwnMemAcc_10 + OwnMemAcc_11 + OwnMemAcc_12 + OwnMemAcc_13 + OwnMemAcc_14 + OwnMemAcc_15 + OwnMemAcc_16 + OwnMemAcc_17 + OwnMemAcc_18 + OwnMemAcc_19 + OwnMemAcc_20 + OwnMemAcc_1 + OwnMemAcc_2 + OwnMemAcc_3 + OwnMemAcc_4 + OwnMemAcc_5 + OwnMemAcc_6 + OwnMemAcc_7 + OwnMemAcc_8 + OwnMemAcc_9) : MAX(OwnMemAcc_10 + OwnMemAcc_11 + OwnMemAcc_12 + OwnMemAcc_13 + OwnMemAcc_14 + OwnMemAcc_15 + OwnMemAcc_16 + OwnMemAcc_17 + OwnMemAcc_18 + OwnMemAcc_19 + OwnMemAcc_20 + OwnMemAcc_1 + OwnMemAcc_2 + OwnMemAcc_3 + OwnMemAcc_4 + OwnMemAcc_5 + OwnMemAcc_6 + OwnMemAcc_7 + OwnMemAcc_8 + OwnMemAcc_9) : MAX(Ext_Bus) : MAX(Ext_Mem_Acc_13_10 + Ext_Mem_Acc_13_11 + Ext_Mem_Acc_13_12 + Ext_Mem_Acc_13_14 + Ext_Mem_Acc_13_15 + Ext_Mem_Acc_13_16 + Ext_Mem_Acc_13_17 + Ext_Mem_Acc_13_18 + Ext_Mem_Acc_13_19 + Ext_Mem_Acc_13_20 + Ext_Mem_Acc_2_10 + Ext_Mem_Acc_2_11 + Ext_Mem_Acc_2_12 + Ext_Mem_Acc_2_13 + Ext_Mem_Acc_2_14 + Ext_Mem_Acc_2_15 + Ext_Mem_Acc_2_16 + Ext_Mem_Acc_2_17 + Ext_Mem_Acc_2_18 + Ext_Mem_Acc_2_19 + Ext_Mem_Acc_2_20 + Ext_Mem_Acc_18_10 + Ext_Mem_Acc_18_11 + Ext_Mem_Acc_18_12 + Ext_Mem_Acc_18_13 + Ext_Mem_Acc_18_14 + Ext_Mem_Acc_18_15 + Ext_Mem_Acc_18_16 + Ext_Mem_Acc_18_17 + Ext_Mem_Acc_18_19 + Ext_Mem_Acc_18_20 + Ext_Mem_Acc_7_10 + Ext_Mem_Acc_7_11 + Ext_Mem_Acc_7_12 + Ext_Mem_Acc_7_13 + Ext_Mem_Acc_7_14 + Ext_Mem_Acc_7_15 + Ext_Mem_Acc_7_16 + Ext_Mem_Acc_7_17 + Ext_Mem_Acc_7_18 + Ext_Mem_Acc_7_19 + Ext_Mem_Acc_7_20 + Ext_Mem_Acc_12_10 + Ext_Mem_Acc_12_11 + Ext_Mem_Acc_12_13 + Ext_Mem_Acc_12_14 + Ext_Mem_Acc_12_15 + Ext_Mem_Acc_12_16 + Ext_Mem_Acc_12_17 + Ext_Mem_Acc_12_18 + Ext_Mem_Acc_12_19 + Ext_Mem_Acc_12_20 + Ext_Mem_Acc_1_10 + Ext_Mem_Acc_1_11 + Ext_Mem_Acc_1_12 + Ext_Mem_Acc_1_13 + Ext_Mem_Acc_1_14 + Ext_Mem_Acc_1_15 + Ext_Mem_Acc_1_16 + Ext_Mem_Acc_1_17 + Ext_Mem_Acc_1_18 + Ext_Mem_Acc_1_19 + Ext_Mem_Acc_1_20 + Ext_Mem_Acc_20_1 + Ext_Mem_Acc_20_2 + Ext_Mem_Acc_20_3 + Ext_Mem_Acc_20_4 + Ext_Mem_Acc_20_5 + Ext_Mem_Acc_20_6 + Ext_Mem_Acc_20_7 + Ext_Mem_Acc_20_8 + Ext_Mem_Acc_20_9 + Ext_Mem_Acc_17_10 + Ext_Mem_Acc_17_11 + Ext_Mem_Acc_17_12 + Ext_Mem_Acc_17_13 + Ext_Mem_Acc_17_14 + Ext_Mem_Acc_17_15 + Ext_Mem_Acc_17_16 + Ext_Mem_Acc_17_18 + Ext_Mem_Acc_17_19 + Ext_Mem_Acc_17_20 + Ext_Mem_Acc_6_10 + Ext_Mem_Acc_6_11 + Ext_Mem_Acc_6_12 + Ext_Mem_Acc_6_13 + Ext_Mem_Acc_6_14 + Ext_Mem_Acc_6_15 + Ext_Mem_Acc_6_16 + Ext_Mem_Acc_6_17 + Ext_Mem_Acc_6_18 + Ext_Mem_Acc_6_19 + Ext_Mem_Acc_6_20 + Ext_Mem_Acc_1_2 + Ext_Mem_Acc_1_3 + Ext_Mem_Acc_1_4 + Ext_Mem_Acc_1_5 + Ext_Mem_Acc_1_6 + Ext_Mem_Acc_1_7 + Ext_Mem_Acc_1_8 + Ext_Mem_Acc_1_9 + Ext_Mem_Acc_11_10 + Ext_Mem_Acc_11_12 + Ext_Mem_Acc_11_13 + Ext_Mem_Acc_11_14 + Ext_Mem_Acc_11_15 + Ext_Mem_Acc_11_16 + Ext_Mem_Acc_11_17 + Ext_Mem_Acc_11_18 + Ext_Mem_Acc_11_19 + Ext_Mem_Acc_11_20 + Ext_Mem_Acc_10_1 + Ext_Mem_Acc_10_2 + Ext_Mem_Acc_10_3 + Ext_Mem_Acc_10_4 + Ext_Mem_Acc_10_5 + Ext_Mem_Acc_10_6 + Ext_Mem_Acc_10_7 + Ext_Mem_Acc_10_8 + Ext_Mem_Acc_10_9 + Ext_Mem_Acc_2_1 + Ext_Mem_Acc_2_3 + Ext_Mem_Acc_2_4 + Ext_Mem_Acc_2_5 + Ext_Mem_Acc_2_6 + Ext_Mem_Acc_2_7 + Ext_Mem_Acc_2_8 + Ext_Mem_Acc_2_9 + Ext_Mem_Acc_16_10 + Ext_Mem_Acc_16_11 + Ext_Mem_Acc_16_12 + Ext_Mem_Acc_16_13 + Ext_Mem_Acc_16_14 + Ext_Mem_Acc_16_15 + Ext_Mem_Acc_16_17 + Ext_Mem_Acc_16_18 + Ext_Mem_Acc_16_19 + Ext_Mem_Acc_16_20 + Ext_Mem_Acc_11_1 + Ext_Mem_Acc_11_2 + Ext_Mem_Acc_11_3 + Ext_Mem_Acc_11_4 + Ext_Mem_Acc_11_5 + Ext_Mem_Acc_11_6 + Ext_Mem_Acc_11_7 + Ext_Mem_Acc_11_8 + Ext_Mem_Acc_11_9 + Ext_Mem_Acc_5_10 + Ext_Mem_Acc_5_11 + Ext_Mem_Acc_5_12 + Ext_Mem_Acc_5_13 + Ext_Mem_Acc_5_14 + Ext_Mem_Acc_5_15 + Ext_Mem_Acc_5_16 + Ext_Mem_Acc_5_17 + Ext_Mem_Acc_5_18 + Ext_Mem_Acc_5_19 + Ext_Mem_Acc_5_20 + Ext_Mem_Acc_3_1 + Ext_Mem_Acc_3_2 + Ext_Mem_Acc_3_4 + Ext_Mem_Acc_3_5 + Ext_Mem_Acc_3_6 + Ext_Mem_Acc_3_7 + Ext_Mem_Acc_3_8 + Ext_Mem_Acc_3_9 + Ext_Mem_Acc_12_1 + Ext_Mem_Acc_12_2 + Ext_Mem_Acc_12_3 + Ext_Mem_Acc_12_4 + Ext_Mem_Acc_12_5 + Ext_Mem_Acc_12_6 + Ext_Mem_Acc_12_7 + Ext_Mem_Acc_12_8 + Ext_Mem_Acc_12_9 + Ext_Mem_Acc_4_1 + Ext_Mem_Acc_4_2 + Ext_Mem_Acc_4_3 + Ext_Mem_Acc_4_5 + Ext_Mem_Acc_4_6 + Ext_Mem_Acc_4_7 + Ext_Mem_Acc_4_8 + Ext_Mem_Acc_4_9 + Ext_Mem_Acc_10_11 + Ext_Mem_Acc_10_12 + Ext_Mem_Acc_10_13 + Ext_Mem_Acc_10_14 + Ext_Mem_Acc_10_15 + Ext_Mem_Acc_10_16 + Ext_Mem_Acc_10_17 + Ext_Mem_Acc_10_18 + Ext_Mem_Acc_10_19 + Ext_Mem_Acc_10_20 + Ext_Mem_Acc_13_1 + Ext_Mem_Acc_13_2 + Ext_Mem_Acc_13_3 + Ext_Mem_Acc_13_4 + Ext_Mem_Acc_13_5 + Ext_Mem_Acc_13_6 + Ext_Mem_Acc_13_7 + Ext_Mem_Acc_13_8 + Ext_Mem_Acc_13_9 + Ext_Mem_Acc_5_1 + Ext_Mem_Acc_5_2 + Ext_Mem_Acc_5_3 + Ext_Mem_Acc_5_4 + Ext_Mem_Acc_5_6 + Ext_Mem_Acc_5_7 + Ext_Mem_Acc_5_8 + Ext_Mem_Acc_5_9 + Ext_Mem_Acc_15_10 + Ext_Mem_Acc_15_11 + Ext_Mem_Acc_15_12 + Ext_Mem_Acc_15_13 + Ext_Mem_Acc_15_14 + Ext_Mem_Acc_15_16 + Ext_Mem_Acc_15_17 + Ext_Mem_Acc_15_18 + Ext_Mem_Acc_15_19 + Ext_Mem_Acc_15_20 + Ext_Mem_Acc_14_1 + Ext_Mem_Acc_14_2 + Ext_Mem_Acc_14_3 + Ext_Mem_Acc_14_4 + Ext_Mem_Acc_14_5 + Ext_Mem_Acc_14_6 + Ext_Mem_Acc_14_7 + Ext_Mem_Acc_14_8 + Ext_Mem_Acc_14_9 + Ext_Mem_Acc_4_10 + Ext_Mem_Acc_4_11 + Ext_Mem_Acc_4_12 + Ext_Mem_Acc_4_13 + Ext_Mem_Acc_4_14 + Ext_Mem_Acc_4_15 + Ext_Mem_Acc_4_16 + Ext_Mem_Acc_4_17 + Ext_Mem_Acc_4_18 + Ext_Mem_Acc_4_19 + Ext_Mem_Acc_4_20 + Ext_Mem_Acc_6_1 + Ext_Mem_Acc_6_2 + Ext_Mem_Acc_6_3 + Ext_Mem_Acc_6_4 + Ext_Mem_Acc_6_5 + Ext_Mem_Acc_6_7 + Ext_Mem_Acc_6_8 + Ext_Mem_Acc_6_9 + Ext_Mem_Acc_15_1 + Ext_Mem_Acc_15_2 + Ext_Mem_Acc_15_3 + Ext_Mem_Acc_15_4 + Ext_Mem_Acc_15_5 + Ext_Mem_Acc_15_6 + Ext_Mem_Acc_15_7 + Ext_Mem_Acc_15_8 + Ext_Mem_Acc_15_9 + Ext_Mem_Acc_7_1 + Ext_Mem_Acc_7_2 + Ext_Mem_Acc_7_3 + Ext_Mem_Acc_7_4 + Ext_Mem_Acc_7_5 + Ext_Mem_Acc_7_6 + Ext_Mem_Acc_7_8 + Ext_Mem_Acc_7_9 + Ext_Mem_Acc_9_10 + Ext_Mem_Acc_9_11 + Ext_Mem_Acc_9_12 + Ext_Mem_Acc_9_13 + Ext_Mem_Acc_9_14 + Ext_Mem_Acc_9_15 + Ext_Mem_Acc_9_16 + Ext_Mem_Acc_9_17 + Ext_Mem_Acc_9_18 + Ext_Mem_Acc_9_19 + Ext_Mem_Acc_9_20 + Ext_Mem_Acc_8_18 + Ext_Mem_Acc_16_1 + Ext_Mem_Acc_16_2 + Ext_Mem_Acc_16_3 + Ext_Mem_Acc_16_4 + Ext_Mem_Acc_16_5 + Ext_Mem_Acc_16_6 + Ext_Mem_Acc_16_7 + Ext_Mem_Acc_16_8 + Ext_Mem_Acc_16_9 + Ext_Mem_Acc_8_1 + Ext_Mem_Acc_8_2 + Ext_Mem_Acc_8_3 + Ext_Mem_Acc_8_4 + Ext_Mem_Acc_8_5 + Ext_Mem_Acc_8_6 + Ext_Mem_Acc_8_7 + Ext_Mem_Acc_8_9 + Ext_Mem_Acc_14_10 + Ext_Mem_Acc_14_11 + Ext_Mem_Acc_14_12 + Ext_Mem_Acc_14_13 + Ext_Mem_Acc_14_15 + Ext_Mem_Acc_14_16 + Ext_Mem_Acc_14_17 + Ext_Mem_Acc_14_18 + Ext_Mem_Acc_14_19 + Ext_Mem_Acc_14_20 + Ext_Mem_Acc_8_17 + Ext_Mem_Acc_8_16 + Ext_Mem_Acc_8_15 + Ext_Mem_Acc_8_14 + Ext_Mem_Acc_8_13 + Ext_Mem_Acc_8_12 + Ext_Mem_Acc_17_1 + Ext_Mem_Acc_17_2 + Ext_Mem_Acc_17_3 + Ext_Mem_Acc_17_4 + Ext_Mem_Acc_17_5 + Ext_Mem_Acc_17_6 + Ext_Mem_Acc_17_7 + Ext_Mem_Acc_17_8 + Ext_Mem_Acc_17_9 + Ext_Mem_Acc_9_1 + Ext_Mem_Acc_9_2 + Ext_Mem_Acc_9_3 + Ext_Mem_Acc_9_4 + Ext_Mem_Acc_9_5 + Ext_Mem_Acc_9_6 + Ext_Mem_Acc_9_7 + Ext_Mem_Acc_8_11 + Ext_Mem_Acc_3_10 + Ext_Mem_Acc_3_11 + Ext_Mem_Acc_3_12 + Ext_Mem_Acc_3_13 + Ext_Mem_Acc_3_14 + Ext_Mem_Acc_3_15 + Ext_Mem_Acc_3_16 + Ext_Mem_Acc_3_17 + Ext_Mem_Acc_3_18 + Ext_Mem_Acc_3_19 + Ext_Mem_Acc_8_10 + Ext_Mem_Acc_19_18 + Ext_Mem_Acc_19_17 + Ext_Mem_Acc_19_16 + Ext_Mem_Acc_19_15 + Ext_Mem_Acc_19_14 + Ext_Mem_Acc_19_13 + Ext_Mem_Acc_19_12 + Ext_Mem_Acc_19_11 + Ext_Mem_Acc_19_10 + Ext_Mem_Acc_18_1 + Ext_Mem_Acc_18_2 + Ext_Mem_Acc_18_3 + Ext_Mem_Acc_18_4 + Ext_Mem_Acc_18_5 + Ext_Mem_Acc_18_6 + Ext_Mem_Acc_18_7 + Ext_Mem_Acc_18_8 + Ext_Mem_Acc_18_9 + Ext_Mem_Acc_19_20 + Ext_Mem_Acc_3_20 + Ext_Mem_Acc_9_8 + Ext_Mem_Acc_8_19 + Ext_Mem_Acc_8_20 + Ext_Mem_Acc_20_10 + Ext_Mem_Acc_20_11 + Ext_Mem_Acc_20_12 + Ext_Mem_Acc_20_13 + Ext_Mem_Acc_20_14 + Ext_Mem_Acc_20_15 + Ext_Mem_Acc_20_16 + Ext_Mem_Acc_20_17 + Ext_Mem_Acc_20_18 + Ext_Mem_Acc_20_19 + Ext_Mem_Acc_19_1 + Ext_Mem_Acc_19_2 + Ext_Mem_Acc_19_3 + Ext_Mem_Acc_19_4 + Ext_Mem_Acc_19_5 + Ext_Mem_Acc_19_6 + Ext_Mem_Acc_19_7 + Ext_Mem_Acc_19_8 + Ext_Mem_Acc_19_9) : MAX(OwnMemAcc_10 + OwnMemAcc_11 + OwnMemAcc_12 + OwnMemAcc_13 + OwnMemAcc_14 + OwnMemAcc_15 + OwnMemAcc_16 + OwnMemAcc_17 + OwnMemAcc_18 + OwnMemAcc_19 + OwnMemAcc_20 + OwnMemAcc_1 + OwnMemAcc_2 + OwnMemAcc_3 + OwnMemAcc_4 + OwnMemAcc_5 + OwnMemAcc_6 + OwnMemAcc_7 + OwnMemAcc_8 + OwnMemAcc_9) : MAX(Memory_1 + Memory_2 + Memory_3 + Memory_4 + Memory_5 + Memory_6 + Memory_7 + Memory_8 + Memory_9 + Memory_10 + Memory_11 + Memory_12 + Memory_13 + Memory_14 + Memory_15 + Memory_16 + Memory_17 + Memory_18 + Memory_19 + Memory_20) : MAX(OwnMemAcc_10 + OwnMemAcc_11 + OwnMemAcc_12 + OwnMemAcc_13 + OwnMemAcc_14 + OwnMemAcc_15 + OwnMemAcc_16 + OwnMemAcc_17 + OwnMemAcc_18 + OwnMemAcc_19 + OwnMemAcc_20 + OwnMemAcc_1 + OwnMemAcc_2 + OwnMemAcc_3 + OwnMemAcc_4 + OwnMemAcc_5 + OwnMemAcc_6 + OwnMemAcc_7 + OwnMemAcc_8 + OwnMemAcc_9) : MAX(Active_3 + Active_8 + Active_9 + Active_18 + Active_19 + Active_20 + Active_17 + Active_16 + Active_15 + Active_14 + Active_13 + Active_12 + Active_11 + Active_10 + Active_7 + Active_6 + Active_5 + Active_4 + Active_2 + Active_1) : MAX(Ext_Mem_Acc_3_6) : MAX(Ext_Mem_Acc_20_8) : MAX(Ext_Mem_Acc_19_7) : MAX(Active_15) : MAX(Memory_14) : MAX(Ext_Mem_Acc_13_16) : MAX(Ext_Mem_Acc_20_19) : MAX(Memory_11)
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(Memory_1 + Memory_2 + Memory_3 + Memory_4 + Memory_5 + Memory_6 + Memory_7 + Memory_8 + Memory_9 + Memory_10 + Memory_11 + Memory_12 + Memory_13 + Memory_14 + Memory_15 + Memory_16 + Memory_17 + Memory_18 + Memory_19 + Memory_20)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(Memory_1 + Memory_2 + Memory_3 + Memory_4 + Memory_5 + Memory_6 + Memory_7 + Memory_8 + Memory_9 + Memory_10 + Memory_11 + Memory_12 + Memory_13 + Memory_14 + Memory_15 + Memory_16 + Memory_17 + Memory_18 + Memory_19 + Memory_20)
lola: processed formula length: 233
lola: 0 rewrites
lola: closed formula file SharedMemory-PT-000020-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: 20
lola: SUBRESULT
lola: result: 20
lola: produced by: state space
lola: The maximum value of the given expression is 20
lola: 0 markings, 0 edges
lola: ========================================

FORMULA SharedMemory-PT-000020-UpperBounds-5 20 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 1 will run for 237 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(Ext_Bus)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(Ext_Bus)
lola: processed formula length: 12
lola: 0 rewrites
lola: closed formula file SharedMemory-PT-000020-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: 0 markings, 0 edges
lola: ========================================

FORMULA SharedMemory-PT-000020-UpperBounds-2 1 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 2 will run for 254 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(Ext_Mem_Acc_3_6)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(Ext_Mem_Acc_3_6)
lola: processed formula length: 20
lola: 0 rewrites
lola: closed formula file SharedMemory-PT-000020-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: 3 markings, 2 edges

FORMULA SharedMemory-PT-000020-UpperBounds-8 1 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(Ext_Mem_Acc_20_8)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(Ext_Mem_Acc_20_8)
lola: processed formula length: 21
lola: 0 rewrites
lola: closed formula file SharedMemory-PT-000020-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: 3 markings, 2 edges
lola: ========================================

FORMULA SharedMemory-PT-000020-UpperBounds-9 1 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(Ext_Mem_Acc_19_7)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(Ext_Mem_Acc_19_7)
lola: processed formula length: 21
lola: 0 rewrites
lola: closed formula file SharedMemory-PT-000020-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: 3 markings, 2 edges
lola: ========================================

FORMULA SharedMemory-PT-000020-UpperBounds-10 1 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(Active_15)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(Active_15)
lola: processed formula length: 14
lola: 0 rewrites
lola: closed formula file SharedMemory-PT-000020-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: 0 markings, 0 edges

FORMULA SharedMemory-PT-000020-UpperBounds-11 1 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 6 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(Memory_14)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(Memory_14)
lola: processed formula length: 14
lola: 0 rewrites
lola: closed formula file SharedMemory-PT-000020-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: 0 markings, 0 edges
lola: ========================================

FORMULA SharedMemory-PT-000020-UpperBounds-12 1 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(Ext_Mem_Acc_13_16)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(Ext_Mem_Acc_13_16)
lola: processed formula length: 22
lola: 0 rewrites
lola: closed formula file SharedMemory-PT-000020-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: 3 markings, 2 edges
lola: ========================================

FORMULA SharedMemory-PT-000020-UpperBounds-13 1 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(Ext_Mem_Acc_20_19)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(Ext_Mem_Acc_20_19)
lola: processed formula length: 22
lola: 0 rewrites
lola: closed formula file SharedMemory-PT-000020-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: 3 markings, 2 edges
lola: ========================================

FORMULA SharedMemory-PT-000020-UpperBounds-14 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(Memory_11)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(Memory_11)
lola: processed formula length: 14
lola: 0 rewrites
lola: closed formula file SharedMemory-PT-000020-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: 0 markings, 0 edges
lola: ========================================

FORMULA SharedMemory-PT-000020-UpperBounds-15 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(OwnMemAcc_10 + OwnMemAcc_11 + OwnMemAcc_12 + OwnMemAcc_13 + OwnMemAcc_14 + OwnMemAcc_15 + OwnMemAcc_16 + OwnMemAcc_17 + OwnMemAcc_18 + OwnMemAcc_19 + OwnMemAcc_20 + OwnMemAcc_1 + OwnMemAcc_2 + OwnMemAcc_3 + OwnMemAcc_4 + OwnMemAcc_5 + OwnMemAcc_6 + OwnMemAcc_7 + OwnMemAcc_8 + OwnMemAcc_9)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(OwnMemAcc_10 + OwnMemAcc_11 + OwnMemAcc_12 + OwnMemAcc_13 + OwnMemAcc_14 + OwnMemAcc_15 + OwnMemAcc_16 + OwnMemAcc_17 + OwnMemAcc_18 + OwnMemAcc_19 + OwnMemAcc_20 + OwnMemAcc_1 + OwnMemAcc_2 + OwnMemAcc_3 + OwnMemAcc_4 + OwnMemAcc_5 + OwnMemAcc_6 + OwnMemAcc_7 + OwnMemAcc_8 + OwnMemAcc_9)
lola: processed formula length: 293
lola: 0 rewrites
lola: closed formula file SharedMemory-PT-000020-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: 20
lola: SUBRESULT
lola: result: 20
lola: produced by: state space
lola: The maximum value of the given expression is 20
lola: 21 markings, 20 edges
lola: ========================================

FORMULA SharedMemory-PT-000020-UpperBounds-6 20 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(Active_3 + Active_8 + Active_9 + Active_18 + Active_19 + Active_20 + Active_17 + Active_16 + Active_15 + Active_14 + Active_13 + Active_12 + Active_11 + Active_10 + Active_7 + Active_6 + Active_5 + Active_4 + Active_2 + Active_1)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(Active_3 + Active_8 + Active_9 + Active_18 + Active_19 + Active_20 + Active_17 + Active_16 + Active_15 + Active_14 + Active_13 + Active_12 + Active_11 + Active_10 + Active_7 + Active_6 + Active_5 + Active_4 + Active_2 + Active_1)
lola: processed formula length: 233
lola: 0 rewrites
lola: closed formula file SharedMemory-PT-000020-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: 20
lola: SUBRESULT
lola: result: 20
lola: produced by: state space
lola: The maximum value of the given expression is 20
lola: 0 markings, 0 edges
lola: ========================================

FORMULA SharedMemory-PT-000020-UpperBounds-7 20 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(OwnMemAcc_10 + OwnMemAcc_11 + OwnMemAcc_12 + OwnMemAcc_13 + OwnMemAcc_14 + OwnMemAcc_15 + OwnMemAcc_16 + OwnMemAcc_17 + OwnMemAcc_18 + OwnMemAcc_19 + OwnMemAcc_20 + OwnMemAcc_1 + OwnMemAcc_2 + OwnMemAcc_3 + OwnMemAcc_4 + OwnMemAcc_5 + OwnMemAcc_6 + OwnMemAcc_7 + OwnMemAcc_8 + OwnMemAcc_9)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(OwnMemAcc_10 + OwnMemAcc_11 + OwnMemAcc_12 + OwnMemAcc_13 + OwnMemAcc_14 + OwnMemAcc_15 + OwnMemAcc_16 + OwnMemAcc_17 + OwnMemAcc_18 + OwnMemAcc_19 + OwnMemAcc_20 + OwnMemAcc_1 + OwnMemAcc_2 + OwnMemAcc_3 + OwnMemAcc_4 + OwnMemAcc_5 + OwnMemAcc_6 + OwnMemAcc_7 + OwnMemAcc_8 + OwnMemAcc_9)
lola: processed formula length: 293
lola: 0 rewrites
lola: closed formula file SharedMemory-PT-000020-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: 20
lola: SUBRESULT
lola: result: 20
lola: produced by: state space
lola: The maximum value of the given expression is 20
lola: 21 markings, 20 edges
lola: ========================================

FORMULA SharedMemory-PT-000020-UpperBounds-0 20 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(OwnMemAcc_10 + OwnMemAcc_11 + OwnMemAcc_12 + OwnMemAcc_13 + OwnMemAcc_14 + OwnMemAcc_15 + OwnMemAcc_16 + OwnMemAcc_17 + OwnMemAcc_18 + OwnMemAcc_19 + OwnMemAcc_20 + OwnMemAcc_1 + OwnMemAcc_2 + OwnMemAcc_3 + OwnMemAcc_4 + OwnMemAcc_5 + OwnMemAcc_6 + OwnMemAcc_7 + OwnMemAcc_8 + OwnMemAcc_9)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(OwnMemAcc_10 + OwnMemAcc_11 + OwnMemAcc_12 + OwnMemAcc_13 + OwnMemAcc_14 + OwnMemAcc_15 + OwnMemAcc_16 + OwnMemAcc_17 + OwnMemAcc_18 + OwnMemAcc_19 + OwnMemAcc_20 + OwnMemAcc_1 + OwnMemAcc_2 + OwnMemAcc_3 + OwnMemAcc_4 + OwnMemAcc_5 + OwnMemAcc_6 + OwnMemAcc_7 + OwnMemAcc_8 + OwnMemAcc_9)
lola: processed formula length: 293
lola: 0 rewrites
lola: closed formula file SharedMemory-PT-000020-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: 20
lola: SUBRESULT
lola: result: 20
lola: produced by: state space
lola: The maximum value of the given expression is 20
lola: 21 markings, 20 edges
lola: ========================================

FORMULA SharedMemory-PT-000020-UpperBounds-4 20 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(OwnMemAcc_10 + OwnMemAcc_11 + OwnMemAcc_12 + OwnMemAcc_13 + OwnMemAcc_14 + OwnMemAcc_15 + OwnMemAcc_16 + OwnMemAcc_17 + OwnMemAcc_18 + OwnMemAcc_19 + OwnMemAcc_20 + OwnMemAcc_1 + OwnMemAcc_2 + OwnMemAcc_3 + OwnMemAcc_4 + OwnMemAcc_5 + OwnMemAcc_6 + OwnMemAcc_7 + OwnMemAcc_8 + OwnMemAcc_9)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(OwnMemAcc_10 + OwnMemAcc_11 + OwnMemAcc_12 + OwnMemAcc_13 + OwnMemAcc_14 + OwnMemAcc_15 + OwnMemAcc_16 + OwnMemAcc_17 + OwnMemAcc_18 + OwnMemAcc_19 + OwnMemAcc_20 + OwnMemAcc_1 + OwnMemAcc_2 + OwnMemAcc_3 + OwnMemAcc_4 + OwnMemAcc_5 + OwnMemAcc_6 + OwnMemAcc_7 + OwnMemAcc_8 + OwnMemAcc_9)
lola: processed formula length: 293
lola: 0 rewrites
lola: closed formula file SharedMemory-PT-000020-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: 20
lola: SUBRESULT
lola: result: 20
lola: produced by: state space
lola: The maximum value of the given expression is 20
lola: 21 markings, 20 edges
lola: ========================================

FORMULA SharedMemory-PT-000020-UpperBounds-1 20 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 15 will run for 3568 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(Ext_Mem_Acc_13_10 + Ext_Mem_Acc_13_11 + Ext_Mem_Acc_13_12 + Ext_Mem_Acc_13_14 + Ext_Mem_Acc_13_15 + Ext_Mem_Acc_13_16 + Ext_Mem_Acc_13_17 + Ext_Mem_Acc_13_18 + Ext_Mem_Acc_13_19 + Ext_Mem_Acc_13_20 + Ext_Mem_Acc_2_10 + Ext_Mem_Acc_2_11 + Ext_Mem_Acc_2_12 + Ext_Mem_Acc_2_13 + Ext_Mem_Acc_2_14 + Ext_Mem_Acc_2_15 + Ext_Mem_Acc_2_16 + Ext_Mem_Acc_2_17 + Ext_Mem_Acc_2_18 + Ext_Mem_Acc_2_19 + Ext_Me... (shortened)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(Ext_Mem_Acc_13_10 + Ext_Mem_Acc_13_11 + Ext_Mem_Acc_13_12 + Ext_Mem_Acc_13_14 + Ext_Mem_Acc_13_15 + Ext_Mem_Acc_13_16 + Ext_Mem_Acc_13_17 + Ext_Mem_Acc_13_18 + Ext_Mem_Acc_13_19 + Ext_Mem_Acc_13_20 + Ext_Mem_Acc_2_10 + Ext_Mem_Acc_2_11 + Ext_Mem_Acc_2_12 + Ext_Mem_Acc_2_13 + Ext_Mem_Acc_2_14 + Ext_Mem_Acc_2_15 + Ext_Mem_Acc_2_16 + Ext_Mem_Acc_2_17 + Ext_Mem_Acc_2_18 + Ext_Mem_Acc_2_19 + Ext_Me... (shortened)
lola: processed formula length: 7260
lola: 0 rewrites
lola: closed formula file SharedMemory-PT-000020-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: 3 markings, 2 edges
lola: ========================================

FORMULA SharedMemory-PT-000020-UpperBounds-3 1 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: RESULT
lola:
SUMMARY: 20 20 1 1 20 20 20 20 1 1 1 1 1 1 1 1
lola:
preliminary result: 20 20 1 1 20 20 20 20 1 1 1 1 1 1 1 1
lola: memory consumption: 21312 KB
lola: time consumption: 1 seconds

BK_STOP 1527170975947

--------------------
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="SharedMemory-PT-000020"
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/SharedMemory-PT-000020.tgz
mv SharedMemory-PT-000020 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 SharedMemory-PT-000020, 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-152708742900114"
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 ;