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.2M
-rw-r--r-- 1 mcc users 27K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 110K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 26K 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 12K May 15 18:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 43K May 15 18:54 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.4K May 15 18:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K May 15 18:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 27K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 107K 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 6.7K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 30K May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 6.2K May 15 18:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 17K 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 686K May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool lola
Input is QuasiCertifProtocol-PT-18, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r136-qhx2-152673578800079
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1526927934321

info: Time: 3600 - MCC
===========================================================================================
prep: translating QuasiCertifProtocol-PT-18 Petri net model.pnml into LoLA format
===========================================================================================
prep: translating PT Petri net complete
prep: check for too many tokens
===========================================================================================
prep: translating QuasiCertifProtocol-PT-18 formula UpperBounds into LoLA format
===========================================================================================
prep: translating PT formula complete
vrfy: Checking UpperBounds @ QuasiCertifProtocol-PT-18 @ 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: 1694/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 44736
lola: finding significant places
lola: 1398 places, 296 transitions, 295 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 391 transition conflict sets
lola: TASK
lola: reading formula from QuasiCertifProtocol-PT-18-UpperBounds.task
lola: MAX(Astart) : MAX(a4) : MAX(n9_7_10 + n9_7_11 + n9_7_12 + n9_7_13 + n9_7_14 + n9_7_15 + n9_7_16 + n9_7_17 + n9_7_18 + n9_13_10 + n9_1_10 + n9_10_9 + n9_10_8 + n9_10_7 + n9_10_6 + n9_10_5 + n9_10_4 + n9_10_3 + n9_10_2 + n9_10_1 + n9_10_0 + n9_6_10 + n9_18_10 + n9_18_11 + n9_18_12 + n9_18_13 + n9_18_14 + n9_18_15 + n9_18_16 + n9_18_17 + n9_18_18 + n9_6_11 + n9_6_12 + n9_6_13 + n9_6_14 + n9_6_15 + n9_6_16 + n9_6_17 + n9_6_18 + n9_12_10 + n9_12_11 + n9_12_12 + n9_12_13 + n9_12_14 + n9_12_15 + n9_12_16 + n9_12_17 + n9_12_18 + n9_0_10 + n9_0_11 + n9_0_12 + n9_0_13 + n9_0_14 + n9_0_15 + n9_0_16 + n9_0_17 + n9_0_18 + n9_1_18 + n9_1_17 + n9_1_16 + n9_1_15 + n9_1_14 + n9_1_13 + n9_1_12 + n9_1_11 + n9_17_10 + n9_17_11 + n9_17_12 + n9_17_13 + n9_17_14 + n9_17_15 + n9_17_16 + n9_17_17 + n9_17_18 + n9_0_0 + n9_0_1 + n9_0_2 + n9_0_3 + n9_0_4 + n9_0_5 + n9_0_6 + n9_0_7 + n9_0_8 + n9_0_9 + n9_11_0 + n9_11_1 + n9_11_2 + n9_11_3 + n9_11_4 + n9_11_5 + n9_11_6 + n9_11_7 + n9_11_8 + n9_11_9 + n9_5_10 + n9_5_11 + n9_5_12 + n9_5_13 + n9_5_14 + n9_5_15 + n9_5_16 + n9_5_17 + n9_5_18 + n9_1_0 + n9_1_1 + n9_1_2 + n9_1_3 + n9_1_4 + n9_1_5 + n9_1_6 + n9_1_7 + n9_1_8 + n9_1_9 + n9_12_0 + n9_12_1 + n9_12_2 + n9_12_3 + n9_12_4 + n9_12_5 + n9_12_6 + n9_12_7 + n9_12_8 + n9_12_9 + n9_11_10 + n9_11_11 + n9_11_12 + n9_11_13 + n9_11_14 + n9_11_15 + n9_11_16 + n9_11_17 + n9_11_18 + n9_13_18 + n9_13_17 + n9_13_16 + n9_13_15 + n9_13_14 + n9_13_13 + n9_2_0 + n9_2_1 + n9_2_2 + n9_2_3 + n9_2_4 + n9_2_5 + n9_2_6 + n9_2_7 + n9_2_8 + n9_2_9 + n9_13_0 + n9_13_1 + n9_13_2 + n9_13_3 + n9_13_4 + n9_13_5 + n9_13_6 + n9_13_7 + n9_13_8 + n9_13_9 + n9_13_12 + n9_13_11 + n9_3_0 + n9_3_1 + n9_3_2 + n9_3_3 + n9_3_4 + n9_3_5 + n9_3_6 + n9_3_7 + n9_3_8 + n9_3_9 + n9_16_10 + n9_16_11 + n9_16_12 + n9_16_13 + n9_16_14 + n9_16_15 + n9_16_16 + n9_16_17 + n9_16_18 + n9_14_0 + n9_14_1 + n9_14_2 + n9_14_3 + n9_14_4 + n9_14_5 + n9_14_6 + n9_14_7 + n9_14_8 + n9_14_9 + n9_4_10 + n9_4_11 + n9_4_12 + n9_4_13 + n9_4_14 + n9_4_15 + n9_4_16 + n9_4_17 + n9_4_18 + n9_4_0 + n9_4_1 + n9_4_2 + n9_4_3 + n9_4_4 + n9_4_5 + n9_4_6 + n9_4_7 + n9_4_8 + n9_4_9 + n9_15_0 + n9_15_1 + n9_15_2 + n9_15_3 + n9_15_4 + n9_15_5 + n9_15_6 + n9_15_7 + n9_15_8 + n9_15_9 + n9_9_10 + n9_9_11 + n9_9_12 + n9_9_13 + n9_9_14 + n9_9_15 + n9_9_16 + n9_9_17 + n9_9_18 + n9_10_10 + n9_10_11 + n9_10_12 + n9_10_13 + n9_10_14 + n9_10_15 + n9_10_16 + n9_10_17 + n9_10_18 + n9_5_0 + n9_5_1 + n9_5_2 + n9_5_3 + n9_5_4 + n9_5_5 + n9_5_6 + n9_5_7 + n9_5_8 + n9_5_9 + n9_16_0 + n9_16_1 + n9_16_2 + n9_16_3 + n9_16_4 + n9_16_5 + n9_16_6 + n9_16_7 + n9_16_8 + n9_16_9 + n9_6_0 + n9_6_1 + n9_6_2 + n9_6_3 + n9_6_4 + n9_6_5 + n9_6_6 + n9_6_7 + n9_6_8 + n9_6_9 + n9_17_0 + n9_17_1 + n9_17_2 + n9_17_3 + n9_17_4 + n9_17_5 + n9_17_6 + n9_17_7 + n9_17_8 + n9_17_9 + n9_15_10 + n9_15_11 + n9_15_12 + n9_15_13 + n9_15_14 + n9_15_15 + n9_15_16 + n9_15_17 + n9_15_18 + n9_3_10 + n9_3_11 + n9_3_12 + n9_3_13 + n9_3_14 + n9_3_15 + n9_3_16 + n9_3_17 + n9_3_18 + n9_7_0 + n9_7_1 + n9_7_2 + n9_7_3 + n9_7_4 + n9_7_5 + n9_7_6 + n9_7_7 + n9_7_8 + n9_7_9 + n9_18_0 + n9_18_1 + n9_18_2 + n9_18_3 + n9_18_4 + n9_18_5 + n9_18_6 + n9_18_7 + n9_18_8 + n9_18_9 + n9_8_10 + n9_8_11 + n9_8_12 + n9_8_13 + n9_8_14 + n9_8_15 + n9_8_16 + n9_8_17 + n9_8_18 + n9_8_0 + n9_8_1 + n9_8_2 + n9_8_3 + n9_8_4 + n9_8_5 + n9_8_6 + n9_8_7 + n9_8_8 + n9_8_9 + n9_9_0 + n9_9_1 + n9_9_2 + n9_9_3 + n9_9_4 + n9_9_5 + n9_9_6 + n9_9_7 + n9_9_8 + n9_9_9 + n9_14_10 + n9_14_11 + n9_14_12 + n9_14_13 + n9_14_14 + n9_14_15 + n9_14_16 + n9_14_17 + n9_14_18 + n9_2_10 + n9_2_11 + n9_2_12 + n9_2_13 + n9_2_14 + n9_2_15 + n9_2_16 + n9_2_17 + n9_2_18) : MAX(n3_9 + n3_8 + n3_7 + n3_6 + n3_5 + n3_4 + n3_3 + n3_2 + n3_1 + n3_0 + n3_10 + n3_11 + n3_12 + n3_13 + n3_14 + n3_15 + n3_16 + n3_17 + n3_18) : MAX(n5_10 + n5_11 + n5_12 + n5_13 + n5_14 + n5_15 + n5_16 + n5_17 + n5_18 + n5_0 + n5_1 + n5_2 + n5_3 + n5_4 + n5_5 + n5_6 + n5_7 + n5_8 + n5_9) : MAX(CstopAbort) : MAX(n6_0 + n6_1 + n6_2 + n6_3 + n6_4 + n6_5 + n6_6 + n6_7 + n6_8 + n6_9 + n6_18 + n6_17 + n6_16 + n6_15 + n6_14 + n6_13 + n6_12 + n6_11 + n6_10) : MAX(n5_10 + n5_11 + n5_12 + n5_13 + n5_14 + n5_15 + n5_16 + n5_17 + n5_18 + n5_0 + n5_1 + n5_2 + n5_3 + n5_4 + n5_5 + n5_6 + n5_7 + n5_8 + n5_9) : MAX(n8_8_4) : MAX(SstopOK_14) : MAX(s6_16) : MAX(n9_18_16) : MAX(n9_6_3) : MAX(n7_18_2) : MAX(n9_0_14) : MAX(n9_16_7)
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(Astart)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(Astart)
lola: processed formula length: 11
lola: 0 rewrites
lola: closed formula file QuasiCertifProtocol-PT-18-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 QuasiCertifProtocol-PT-18-UpperBounds-0 1 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(a4)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(a4)
lola: processed formula length: 7
lola: 0 rewrites
lola: closed formula file QuasiCertifProtocol-PT-18-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: 43 markings, 42 edges
lola: ========================================

FORMULA QuasiCertifProtocol-PT-18-UpperBounds-1 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(CstopAbort)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(CstopAbort)
lola: processed formula length: 15
lola: 0 rewrites
lola: closed formula file QuasiCertifProtocol-PT-18-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: 10
lola: SUBRESULT
lola: result: 10
lola: produced by: state space
lola: The maximum value of the given expression is 10
lola: 102 markings, 101 edges
lola: ========================================

FORMULA QuasiCertifProtocol-PT-18-UpperBounds-5 10 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 3 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(n8_8_4)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(n8_8_4)
lola: processed formula length: 11
lola: 0 rewrites
lola: closed formula file QuasiCertifProtocol-PT-18-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: 83 markings, 82 edges
lola: ========================================

FORMULA QuasiCertifProtocol-PT-18-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(SstopOK_14)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(SstopOK_14)
lola: processed formula length: 15
lola: 0 rewrites
lola: closed formula file QuasiCertifProtocol-PT-18-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: 103 markings, 102 edges
lola: ========================================

FORMULA QuasiCertifProtocol-PT-18-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(s6_16)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(s6_16)
lola: processed formula length: 10
lola: 0 rewrites
lola: closed formula file QuasiCertifProtocol-PT-18-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: 102 markings, 101 edges
lola: ========================================

FORMULA QuasiCertifProtocol-PT-18-UpperBounds-10 1 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(n9_18_16)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(n9_18_16)
lola: processed formula length: 13
lola: 0 rewrites
lola: closed formula file QuasiCertifProtocol-PT-18-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: 103 markings, 102 edges
lola: ========================================

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

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

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

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

FORMULA QuasiCertifProtocol-PT-18-UpperBounds-15 1 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 11 will run for 712 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(n5_10 + n5_11 + n5_12 + n5_13 + n5_14 + n5_15 + n5_16 + n5_17 + n5_18 + n5_0 + n5_1 + n5_2 + n5_3 + n5_4 + n5_5 + n5_6 + n5_7 + n5_8 + n5_9)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(n5_10 + n5_11 + n5_12 + n5_13 + n5_14 + n5_15 + n5_16 + n5_17 + n5_18 + n5_0 + n5_1 + n5_2 + n5_3 + n5_4 + n5_5 + n5_6 + n5_7 + n5_8 + n5_9)
lola: processed formula length: 144
lola: 0 rewrites
lola: closed formula file QuasiCertifProtocol-PT-18-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: 19
lola: SUBRESULT
lola: result: 19
lola: produced by: state space
lola: The maximum value of the given expression is 19
lola: 44 markings, 43 edges
lola: ========================================

FORMULA QuasiCertifProtocol-PT-18-UpperBounds-4 19 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 12 will run for 890 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(n3_9 + n3_8 + n3_7 + n3_6 + n3_5 + n3_4 + n3_3 + n3_2 + n3_1 + n3_0 + n3_10 + n3_11 + n3_12 + n3_13 + n3_14 + n3_15 + n3_16 + n3_17 + n3_18)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(n3_9 + n3_8 + n3_7 + n3_6 + n3_5 + n3_4 + n3_3 + n3_2 + n3_1 + n3_0 + n3_10 + n3_11 + n3_12 + n3_13 + n3_14 + n3_15 + n3_16 + n3_17 + n3_18)
lola: processed formula length: 144
lola: 0 rewrites
lola: closed formula file QuasiCertifProtocol-PT-18-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: 19
lola: SUBRESULT
lola: result: 19
lola: produced by: state space
lola: The maximum value of the given expression is 19
lola: 23 markings, 22 edges
lola: ========================================

FORMULA QuasiCertifProtocol-PT-18-UpperBounds-3 19 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 13 will run for 1186 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(n6_0 + n6_1 + n6_2 + n6_3 + n6_4 + n6_5 + n6_6 + n6_7 + n6_8 + n6_9 + n6_18 + n6_17 + n6_16 + n6_15 + n6_14 + n6_13 + n6_12 + n6_11 + n6_10)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(n6_0 + n6_1 + n6_2 + n6_3 + n6_4 + n6_5 + n6_6 + n6_7 + n6_8 + n6_9 + n6_18 + n6_17 + n6_16 + n6_15 + n6_14 + n6_13 + n6_12 + n6_11 + n6_10)
lola: processed formula length: 144
lola: 0 rewrites
lola: closed formula file QuasiCertifProtocol-PT-18-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: 19
lola: SUBRESULT
lola: result: 19
lola: produced by: state space
lola: The maximum value of the given expression is 19
lola: 63 markings, 62 edges
lola: ========================================

FORMULA QuasiCertifProtocol-PT-18-UpperBounds-6 19 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 14 will run for 1780 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(n5_10 + n5_11 + n5_12 + n5_13 + n5_14 + n5_15 + n5_16 + n5_17 + n5_18 + n5_0 + n5_1 + n5_2 + n5_3 + n5_4 + n5_5 + n5_6 + n5_7 + n5_8 + n5_9)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(n5_10 + n5_11 + n5_12 + n5_13 + n5_14 + n5_15 + n5_16 + n5_17 + n5_18 + n5_0 + n5_1 + n5_2 + n5_3 + n5_4 + n5_5 + n5_6 + n5_7 + n5_8 + n5_9)
lola: processed formula length: 144
lola: 0 rewrites
lola: closed formula file QuasiCertifProtocol-PT-18-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: 19
lola: SUBRESULT
lola: result: 19
lola: produced by: state space
lola: The maximum value of the given expression is 19
lola: 44 markings, 43 edges
lola:
FORMULA QuasiCertifProtocol-PT-18-UpperBounds-7 19 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
========================================
lola: subprocess 15 will run for 3560 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(n9_7_10 + n9_7_11 + n9_7_12 + n9_7_13 + n9_7_14 + n9_7_15 + n9_7_16 + n9_7_17 + n9_7_18 + n9_13_10 + n9_1_10 + n9_10_9 + n9_10_8 + n9_10_7 + n9_10_6 + n9_10_5 + n9_10_4 + n9_10_3 + n9_10_2 + n9_10_1 + n9_10_0 + n9_6_10 + n9_18_10 + n9_18_11 + n9_18_12 + n9_18_13 + n9_18_14 + n9_18_15 + n9_18_16 + n9_18_17 + n9_18_18 + n9_6_11 + n9_6_12 + n9_6_13 + n9_6_14 + n9_6_15 + n9_6_16 + n9_6_17 + n9_6_1... (shortened)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(n9_7_10 + n9_7_11 + n9_7_12 + n9_7_13 + n9_7_14 + n9_7_15 + n9_7_16 + n9_7_17 + n9_7_18 + n9_13_10 + n9_1_10 + n9_10_9 + n9_10_8 + n9_10_7 + n9_10_6 + n9_10_5 + n9_10_4 + n9_10_3 + n9_10_2 + n9_10_1 + n9_10_0 + n9_6_10 + n9_18_10 + n9_18_11 + n9_18_12 + n9_18_13 + n9_18_14 + n9_18_15 + n9_18_16 + n9_18_17 + n9_18_18 + n9_6_11 + n9_6_12 + n9_6_13 + n9_6_14 + n9_6_15 + n9_6_16 + n9_6_17 + n9_6_1... (shortened)
lola: processed formula length: 3593
lola: 0 rewrites
lola: closed formula file QuasiCertifProtocol-PT-18-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: 361
lola: SUBRESULT
lola: result: 361
lola: produced by: state space
lola: The maximum value of the given expression is 361
lola: 139 markings, 138 edges
lola: ========================================

FORMULA QuasiCertifProtocol-PT-18-UpperBounds-2 361 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: RESULT
lola:
SUMMARY: 1 1 361 19 19 10 19 19 1 1 1 1 1 1 1 1
lola:
preliminary result: 1 1 361 19 19 10 19 19 1 1 1 1 1 1 1 1
lola: memory consumption: 19684 KB
lola: time consumption: 10 seconds

BK_STOP 1526927965354

--------------------
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-18"
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-18.tgz
mv QuasiCertifProtocol-PT-18 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-18, 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-152673578800079"
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 ;