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.3M
-rw-r--r-- 1 mcc users 15K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 65K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.7K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 38K May 15 18:54 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K May 15 18:50 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K May 15 18:50 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.3K May 15 18:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 16K May 15 18:54 LTLCardinality.xml
-rw-r--r-- 1 mcc users 4.9K May 15 18:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 21K May 15 18:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 58K May 15 18:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 116 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 354 May 15 18:54 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 5.5K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 23K May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 8.5K 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 3 May 15 18:50 instance
-rw-r--r-- 1 mcc users 6 May 15 18:50 iscolored
-rw-r--r-- 1 mcc users 949K May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool lola
Input is QuasiCertifProtocol-PT-22, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r136-qhx2-152673578800086
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1526931488532

info: Time: 3600 - MCC
===========================================================================================
prep: translating QuasiCertifProtocol-PT-22 Petri net model.pnml into LoLA format
===========================================================================================
prep: translating PT Petri net complete
prep: check for too many tokens
===========================================================================================
prep: translating QuasiCertifProtocol-PT-22 formula UpperBounds into LoLA format
===========================================================================================
prep: translating PT formula complete
vrfy: Checking UpperBounds @ QuasiCertifProtocol-PT-22 @ 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: 2322/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 62912
lola: finding significant places
lola: 1966 places, 356 transitions, 355 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 471 transition conflict sets
lola: TASK
lola: reading formula from QuasiCertifProtocol-PT-22-UpperBounds.task
lola: MAX(SstopOK_9 + SstopOK_10 + SstopOK_11 + SstopOK_12 + SstopOK_13 + SstopOK_14 + SstopOK_15 + SstopOK_16 + SstopOK_17 + SstopOK_18 + SstopOK_19 + SstopOK_8 + SstopOK_21 + SstopOK_22 + SstopOK_5 + SstopOK_4 + SstopOK_3 + SstopOK_2 + SstopOK_0 + SstopOK_1 + SstopOK_6 + SstopOK_7 + SstopOK_20) : MAX(SstopAbort) : MAX(Sstart_9 + Sstart_8 + Sstart_7 + Sstart_6 + Sstart_5 + Sstart_4 + Sstart_3 + Sstart_2 + Sstart_1 + Sstart_0 + Sstart_10 + Sstart_11 + Sstart_12 + Sstart_13 + Sstart_14 + Sstart_15 + Sstart_16 + Sstart_17 + Sstart_18 + Sstart_19 + Sstart_20 + Sstart_21 + Sstart_22) : MAX(AstopOK) : MAX(c1_8 + c1_7 + c1_6 + c1_5 + c1_4 + c1_3 + c1_2 + c1_1 + c1_0 + c1_22 + c1_21 + c1_20 + c1_19 + c1_18 + c1_17 + c1_16 + c1_15 + c1_14 + c1_13 + c1_12 + c1_11 + c1_10 + c1_9) : MAX(a3) : MAX(n8_14_10 + n8_11_0 + n8_5_10 + n8_21_0 + n8_0_0 + n8_22_10 + n8_10_10 + n8_12_0 + n8_1_0 + n8_8_10 + n8_7_0 + n8_6_0 + n8_19_10 + n8_17_0 + n8_16_0 + n8_9_10 + n8_18_10 + n8_15_0 + n8_20_10 + n8_4_10 + n8_3_0 + n8_2_0 + n8_13_0 + n8_13_1 + n8_13_2 + n8_13_3 + n8_13_4 + n8_13_5 + n8_13_6 + n8_13_7 + n8_13_8 + n8_13_9 + n8_2_1 + n8_2_2 + n8_2_3 + n8_2_4 + n8_2_5 + n8_2_6 + n8_2_7 + n8_2_8 + n8_2_9 + n8_14_0 + n8_14_1 + n8_14_2 + n8_14_3 + n8_14_4 + n8_14_5 + n8_14_6 + n8_14_7 + n8_14_8 + n8_14_9 + n8_13_10 + n8_13_11 + n8_13_12 + n8_13_13 + n8_13_14 + n8_13_15 + n8_13_16 + n8_13_17 + n8_13_18 + n8_13_19 + n8_13_20 + n8_13_21 + n8_13_22 + n8_3_1 + n8_3_2 + n8_3_3 + n8_3_4 + n8_3_5 + n8_3_6 + n8_3_7 + n8_3_8 + n8_3_9 + n8_4_11 + n8_4_12 + n8_4_13 + n8_4_14 + n8_4_15 + n8_4_16 + n8_4_17 + n8_4_18 + n8_4_19 + n8_4_20 + n8_4_21 + n8_4_22 + n8_20_22 + n8_20_21 + n8_20_20 + n8_20_19 + n8_20_18 + n8_20_17 + n8_20_16 + n8_20_15 + n8_20_14 + n8_20_13 + n8_20_12 + n8_20_11 + n8_15_1 + n8_15_2 + n8_15_3 + n8_15_4 + n8_15_5 + n8_15_6 + n8_15_7 + n8_15_8 + n8_15_9 + n8_4_0 + n8_4_1 + n8_4_2 + n8_4_3 + n8_4_4 + n8_4_5 + n8_4_6 + n8_4_7 + n8_4_8 + n8_4_9 + n8_18_11 + n8_18_12 + n8_18_13 + n8_18_14 + n8_18_15 + n8_18_16 + n8_18_17 + n8_18_18 + n8_18_19 + n8_18_20 + n8_18_21 + n8_18_22 + n8_9_11 + n8_9_12 + n8_9_13 + n8_9_14 + n8_9_15 + n8_9_16 + n8_9_17 + n8_9_18 + n8_9_19 + n8_9_20 + n8_9_21 + n8_9_22 + n8_19_22 + n8_19_21 + n8_16_1 + n8_16_2 + n8_16_3 + n8_16_4 + n8_16_5 + n8_16_6 + n8_16_7 + n8_16_8 + n8_16_9 + n8_5_0 + n8_5_1 + n8_5_2 + n8_5_3 + n8_5_4 + n8_5_5 + n8_5_6 + n8_5_7 + n8_5_8 + n8_5_9 + n8_19_20 + n8_19_19 + n8_17_1 + n8_17_2 + n8_17_3 + n8_17_4 + n8_17_5 + n8_17_6 + n8_17_7 + n8_17_8 + n8_17_9 + n8_12_10 + n8_12_11 + n8_12_12 + n8_12_13 + n8_12_14 + n8_12_15 + n8_12_16 + n8_12_17 + n8_12_18 + n8_12_19 + n8_12_20 + n8_12_21 + n8_12_22 + n8_19_18 + n8_19_17 + n8_19_16 + n8_19_15 + n8_19_14 + n8_19_13 + n8_19_12 + n8_19_11 + n8_6_1 + n8_6_2 + n8_6_3 + n8_6_4 + n8_6_5 + n8_6_6 + n8_6_7 + n8_6_8 + n8_6_9 + n8_3_10 + n8_3_11 + n8_3_12 + n8_3_13 + n8_3_14 + n8_3_15 + n8_3_16 + n8_3_17 + n8_3_18 + n8_3_19 + n8_3_20 + n8_3_21 + n8_3_22 + n8_18_0 + n8_18_1 + n8_18_2 + n8_18_3 + n8_18_4 + n8_18_5 + n8_18_6 + n8_18_7 + n8_18_8 + n8_18_9 + n8_7_1 + n8_7_2 + n8_7_3 + n8_7_4 + n8_7_5 + n8_7_6 + n8_7_7 + n8_7_8 + n8_7_9 + n8_17_10 + n8_17_11 + n8_17_12 + n8_17_13 + n8_17_14 + n8_17_15 + n8_17_16 + n8_17_17 + n8_17_18 + n8_17_19 + n8_17_20 + n8_17_21 + n8_17_22 + n8_8_11 + n8_8_12 + n8_8_13 + n8_8_14 + n8_8_15 + n8_8_16 + n8_8_17 + n8_8_18 + n8_8_19 + n8_8_20 + n8_8_21 + n8_8_22 + n8_1_9 + n8_1_8 + n8_1_7 + n8_1_6 + n8_1_5 + n8_1_4 + n8_1_3 + n8_19_0 + n8_19_1 + n8_19_2 + n8_19_3 + n8_19_4 + n8_19_5 + n8_19_6 + n8_19_7 + n8_19_8 + n8_19_9 + n8_1_2 + n8_1_1 + n8_12_9 + n8_12_8 + n8_8_0 + n8_8_1 + n8_8_2 + n8_8_3 + n8_8_4 + n8_8_5 + n8_8_6 + n8_8_7 + n8_8_8 + n8_8_9 + n8_12_7 + n8_12_6 + n8_12_5 + n8_9_0 + n8_9_1 + n8_9_2 + n8_9_3 + n8_9_4 + n8_9_5 + n8_9_6 + n8_9_7 + n8_9_8 + n8_9_9 + n8_11_10 + n8_11_11 + n8_11_12 + n8_11_13 + n8_11_14 + n8_11_15 + n8_11_16 + n8_11_17 + n8_11_18 + n8_11_19 + n8_11_20 + n8_11_21 + n8_11_22 + n8_12_4 + n8_2_10 + n8_2_11 + n8_2_12 + n8_2_13 + n8_2_14 + n8_2_15 + n8_2_16 + n8_2_17 + n8_2_18 + n8_2_19 + n8_2_20 + n8_2_21 + n8_2_22 + n8_12_3 + n8_12_2 + n8_12_1 + n8_16_10 + n8_16_11 + n8_16_12 + n8_16_13 + n8_16_14 + n8_16_15 + n8_16_16 + n8_16_17 + n8_16_18 + n8_16_19 + n8_16_20 + n8_16_21 + n8_16_22 + n8_7_10 + n8_7_11 + n8_7_12 + n8_7_13 + n8_7_14 + n8_7_15 + n8_7_16 + n8_7_17 + n8_7_18 + n8_7_19 + n8_7_20 + n8_7_21 + n8_7_22 + n8_10_11 + n8_10_12 + n8_10_13 + n8_10_14 + n8_10_15 + n8_10_16 + n8_10_17 + n8_10_18 + n8_10_19 + n8_10_20 + n8_10_21 + n8_10_22 + n8_22_11 + n8_22_12 + n8_22_13 + n8_22_14 + n8_22_15 + n8_22_16 + n8_22_17 + n8_22_18 + n8_22_19 + n8_22_20 + n8_22_21 + n8_22_22 + n8_1_10 + n8_1_11 + n8_1_12 + n8_1_13 + n8_1_14 + n8_1_15 + n8_1_16 + n8_1_17 + n8_1_18 + n8_1_19 + n8_1_20 + n8_1_21 + n8_1_22 + n8_20_0 + n8_20_1 + n8_20_2 + n8_20_3 + n8_20_4 + n8_20_5 + n8_20_6 + n8_20_7 + n8_20_8 + n8_20_9 + n8_0_9 + n8_0_8 + n8_0_7 + n8_0_6 + n8_0_5 + n8_0_4 + n8_0_3 + n8_0_2 + n8_15_10 + n8_15_11 + n8_15_12 + n8_15_13 + n8_15_14 + n8_15_15 + n8_15_16 + n8_15_17 + n8_15_18 + n8_15_19 + n8_15_20 + n8_15_21 + n8_15_22 + n8_0_1 + n8_5_22 + n8_21_1 + n8_21_2 + n8_21_3 + n8_21_4 + n8_21_5 + n8_21_6 + n8_21_7 + n8_21_8 + n8_21_9 + n8_6_10 + n8_6_11 + n8_6_12 + n8_6_13 + n8_6_14 + n8_6_15 + n8_6_16 + n8_6_17 + n8_6_18 + n8_6_19 + n8_6_20 + n8_6_21 + n8_6_22 + n8_5_21 + n8_5_20 + n8_5_19 + n8_5_18 + n8_5_17 + n8_5_16 + n8_5_15 + n8_5_14 + n8_5_13 + n8_5_12 + n8_5_11 + n8_11_9 + n8_11_8 + n8_11_7 + n8_11_6 + n8_11_5 + n8_11_4 + n8_11_3 + n8_11_2 + n8_11_1 + n8_14_22 + n8_14_21 + n8_14_20 + n8_14_19 + n8_14_18 + n8_22_0 + n8_22_1 + n8_22_2 + n8_22_3 + n8_22_4 + n8_22_5 + n8_22_6 + n8_22_7 + n8_22_8 + n8_22_9 + n8_14_17 + n8_14_16 + n8_14_15 + n8_14_14 + n8_14_13 + n8_14_12 + n8_14_11 + n8_21_10 + n8_21_11 + n8_21_12 + n8_21_13 + n8_21_14 + n8_21_15 + n8_21_16 + n8_21_17 + n8_21_18 + n8_21_19 + n8_21_20 + n8_21_21 + n8_21_22 + n8_0_10 + n8_0_11 + n8_0_12 + n8_0_13 + n8_0_14 + n8_0_15 + n8_0_16 + n8_0_17 + n8_0_18 + n8_0_19 + n8_0_20 + n8_0_21 + n8_0_22 + n8_10_0 + n8_10_1 + n8_10_2 + n8_10_3 + n8_10_4 + n8_10_5 + n8_10_6 + n8_10_7 + n8_10_8 + n8_10_9) : MAX(s4_0 + s4_1 + s4_2 + s4_3 + s4_4 + s4_5 + s4_6 + s4_7 + s4_8 + s4_9 + s4_22 + s4_21 + s4_20 + s4_19 + s4_18 + s4_17 + s4_16 + s4_15 + s4_14 + s4_13 + s4_12 + s4_11 + s4_10) : MAX(n7_21_6) : MAX(n8_13_9) : MAX(n9_8_7) : MAX(n9_6_14) : MAX(CstopOK_2) : MAX(n2_5) : MAX(n7_16_5) : MAX(c1_5)
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 222 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(SstopAbort)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(SstopAbort)
lola: processed formula length: 15
lola: 0 rewrites
lola: closed formula file QuasiCertifProtocol-PT-22-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: 13
lola: SUBRESULT
lola: result: 13
lola: produced by: state space
lola: The maximum value of the given expression is 13
lola: 14 markings, 13 edges
lola: ========================================

FORMULA QuasiCertifProtocol-PT-22-UpperBounds-1 13 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(AstopOK)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(AstopOK)
lola: processed formula length: 12
lola: 0 rewrites
lola: closed formula file QuasiCertifProtocol-PT-22-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: 76 markings, 75 edges
lola: ========================================

FORMULA QuasiCertifProtocol-PT-22-UpperBounds-3 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(a3)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(a3)
lola: processed formula length: 7
lola: 0 rewrites
lola: closed formula file QuasiCertifProtocol-PT-22-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: 27 markings, 26 edges
lola: ========================================

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

FORMULA QuasiCertifProtocol-PT-22-UpperBounds-8 1 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 4 will run for 296 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(n8_13_9)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(n8_13_9)
lola: processed formula length: 12
lola: 0 rewrites
lola: closed formula file QuasiCertifProtocol-PT-22-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: 99 markings, 98 edges
lola: ========================================

FORMULA QuasiCertifProtocol-PT-22-UpperBounds-9 1 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 5 will run for 323 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(n9_8_7)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(n9_8_7)
lola: processed formula length: 11
lola: 0 rewrites
lola: closed formula file QuasiCertifProtocol-PT-22-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: 123 markings, 122 edges
lola: ========================================

FORMULA QuasiCertifProtocol-PT-22-UpperBounds-10 1 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 6 will run for 355 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(n9_6_14)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(n9_6_14)
lola: processed formula length: 12
lola: 0 rewrites
lola: closed formula file QuasiCertifProtocol-PT-22-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: 123 markings, 122 edges

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

FORMULA QuasiCertifProtocol-PT-22-UpperBounds-12 1 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 8 will run for 444 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(n2_5)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(n2_5)
lola: processed formula length: 9
lola: 0 rewrites
lola: closed formula file QuasiCertifProtocol-PT-22-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 QuasiCertifProtocol-PT-22-UpperBounds-13 1 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 9 will run for 507 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(n7_16_5)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(n7_16_5)
lola: processed formula length: 12
lola: 0 rewrites
lola: closed formula file QuasiCertifProtocol-PT-22-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: 54 markings, 53 edges

FORMULA QuasiCertifProtocol-PT-22-UpperBounds-14 1 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 10 will run for 592 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(c1_5)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(c1_5)
lola: processed formula length: 9
lola: 0 rewrites
lola: closed formula file QuasiCertifProtocol-PT-22-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: 99 markings, 98 edges

FORMULA QuasiCertifProtocol-PT-22-UpperBounds-15 1 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 11 will run for 711 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(SstopOK_9 + SstopOK_10 + SstopOK_11 + SstopOK_12 + SstopOK_13 + SstopOK_14 + SstopOK_15 + SstopOK_16 + SstopOK_17 + SstopOK_18 + SstopOK_19 + SstopOK_8 + SstopOK_21 + SstopOK_22 + SstopOK_5 + SstopOK_4 + SstopOK_3 + SstopOK_2 + SstopOK_0 + SstopOK_1 + SstopOK_6 + SstopOK_7 + SstopOK_20)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(SstopOK_9 + SstopOK_10 + SstopOK_11 + SstopOK_12 + SstopOK_13 + SstopOK_14 + SstopOK_15 + SstopOK_16 + SstopOK_17 + SstopOK_18 + SstopOK_19 + SstopOK_8 + SstopOK_21 + SstopOK_22 + SstopOK_5 + SstopOK_4 + SstopOK_3 + SstopOK_2 + SstopOK_0 + SstopOK_1 + SstopOK_6 + SstopOK_7 + SstopOK_20)
lola: processed formula length: 291
lola: 0 rewrites
lola: closed formula file QuasiCertifProtocol-PT-22-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: 23
lola: SUBRESULT
lola: result: 23
lola: produced by: state space
lola: The maximum value of the given expression is 23
lola: 167 markings, 166 edges
lola: ========================================

FORMULA QuasiCertifProtocol-PT-22-UpperBounds-0 23 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 12 will run for 888 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(c1_8 + c1_7 + c1_6 + c1_5 + c1_4 + c1_3 + c1_2 + c1_1 + c1_0 + c1_22 + c1_21 + c1_20 + c1_19 + c1_18 + c1_17 + c1_16 + c1_15 + c1_14 + c1_13 + c1_12 + c1_11 + c1_10 + c1_9)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(c1_8 + c1_7 + c1_6 + c1_5 + c1_4 + c1_3 + c1_2 + c1_1 + c1_0 + c1_22 + c1_21 + c1_20 + c1_19 + c1_18 + c1_17 + c1_16 + c1_15 + c1_14 + c1_13 + c1_12 + c1_11 + c1_10 + c1_9)
lola: processed formula length: 176
lola: 0 rewrites
lola: closed formula file QuasiCertifProtocol-PT-22-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: 23
lola: SUBRESULT
lola: result: 23
lola: produced by: state space
lola: The maximum value of the given expression is 23
lola: 121 markings, 120 edges

FORMULA QuasiCertifProtocol-PT-22-UpperBounds-4 23 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 13 will run for 1184 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(Sstart_9 + Sstart_8 + Sstart_7 + Sstart_6 + Sstart_5 + Sstart_4 + Sstart_3 + Sstart_2 + Sstart_1 + Sstart_0 + Sstart_10 + Sstart_11 + Sstart_12 + Sstart_13 + Sstart_14 + Sstart_15 + Sstart_16 + Sstart_17 + Sstart_18 + Sstart_19 + Sstart_20 + Sstart_21 + Sstart_22)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(Sstart_9 + Sstart_8 + Sstart_7 + Sstart_6 + Sstart_5 + Sstart_4 + Sstart_3 + Sstart_2 + Sstart_1 + Sstart_0 + Sstart_10 + Sstart_11 + Sstart_12 + Sstart_13 + Sstart_14 + Sstart_15 + Sstart_16 + Sstart_17 + Sstart_18 + Sstart_19 + Sstart_20 + Sstart_21 + Sstart_22)
lola: processed formula length: 268
lola: 0 rewrites
lola: closed formula file QuasiCertifProtocol-PT-22-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: 23
lola: SUBRESULT
lola: result: 23
lola: produced by: state space
lola: The maximum value of the given expression is 23
lola: 0 markings, 0 edges
lola: ========================================

FORMULA QuasiCertifProtocol-PT-22-UpperBounds-2 23 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 14 will run for 1776 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(s4_0 + s4_1 + s4_2 + s4_3 + s4_4 + s4_5 + s4_6 + s4_7 + s4_8 + s4_9 + s4_22 + s4_21 + s4_20 + s4_19 + s4_18 + s4_17 + s4_16 + s4_15 + s4_14 + s4_13 + s4_12 + s4_11 + s4_10)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(s4_0 + s4_1 + s4_2 + s4_3 + s4_4 + s4_5 + s4_6 + s4_7 + s4_8 + s4_9 + s4_22 + s4_21 + s4_20 + s4_19 + s4_18 + s4_17 + s4_16 + s4_15 + s4_14 + s4_13 + s4_12 + s4_11 + s4_10)
lola: processed formula length: 176
lola: 0 rewrites
lola: closed formula file QuasiCertifProtocol-PT-22-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: 23
lola: SUBRESULT
lola: result: 23
lola: produced by: state space
lola: The maximum value of the given expression is 23
lola: 75 markings, 74 edges

FORMULA QuasiCertifProtocol-PT-22-UpperBounds-7 23 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 15 will run for 3553 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(n8_14_10 + n8_11_0 + n8_5_10 + n8_21_0 + n8_0_0 + n8_22_10 + n8_10_10 + n8_12_0 + n8_1_0 + n8_8_10 + n8_7_0 + n8_6_0 + n8_19_10 + n8_17_0 + n8_16_0 + n8_9_10 + n8_18_10 + n8_15_0 + n8_20_10 + n8_4_10 + n8_3_0 + n8_2_0 + n8_13_0 + n8_13_1 + n8_13_2 + n8_13_3 + n8_13_4 + n8_13_5 + n8_13_6 + n8_13_7 + n8_13_8 + n8_13_9 + n8_2_1 + n8_2_2 + n8_2_3 + n8_2_4 + n8_2_5 + n8_2_6 + n8_2_7 + n8_2_8 + n8_2... (shortened)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(n8_14_10 + n8_11_0 + n8_5_10 + n8_21_0 + n8_0_0 + n8_22_10 + n8_10_10 + n8_12_0 + n8_1_0 + n8_8_10 + n8_7_0 + n8_6_0 + n8_19_10 + n8_17_0 + n8_16_0 + n8_9_10 + n8_18_10 + n8_15_0 + n8_20_10 + n8_4_10 + n8_3_0 + n8_2_0 + n8_13_0 + n8_13_1 + n8_13_2 + n8_13_3 + n8_13_4 + n8_13_5 + n8_13_6 + n8_13_7 + n8_13_8 + n8_13_9 + n8_2_1 + n8_2_2 + n8_2_3 + n8_2_4 + n8_2_5 + n8_2_6 + n8_2_7 + n8_2_8 + n8_2... (shortened)
lola: processed formula length: 5361
lola: 0 rewrites
lola: closed formula file QuasiCertifProtocol-PT-22-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: 529
lola: SUBRESULT
lola: result: 529
lola: produced by: state space
lola: The maximum value of the given expression is 529
lola: 121 markings, 120 edges

FORMULA QuasiCertifProtocol-PT-22-UpperBounds-6 529 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: RESULT
lola:
SUMMARY: 23 13 23 1 23 1 529 23 1 1 1 1 1 1 1 1
lola:
preliminary result: 23 13 23 1 23 1 529 23 1 1 1 1 1 1 1 1
lola: ========================================
lola: memory consumption: 20376 KB
lola: time consumption: 16 seconds

BK_STOP 1526931525863

--------------------
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="QuasiCertifProtocol-PT-22"
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/QuasiCertifProtocol-PT-22.tgz
mv QuasiCertifProtocol-PT-22 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 QuasiCertifProtocol-PT-22, 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 r136-qhx2-152673578800086"
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 ;