About the Execution of LoLA for Referendum-PT-0100
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
243.340 | 29608.00 | 27056.00 | 6935.90 | 100 1 100 100 100 100 100 ? 1 1 1 1 1 1 1 1 | normal |
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 908K
-rw-r--r-- 1 mcc users 30K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 98K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 23K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 124K 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 23K May 15 18:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 72K May 15 18:54 LTLCardinality.xml
-rw-r--r-- 1 mcc users 8.0K May 15 18:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 40K May 15 18:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 35K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 115K May 15 18:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 109 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 347 May 15 18:54 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 24K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 126K May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 13K May 15 18:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 28K 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 5 May 15 18:50 instance
-rw-r--r-- 1 mcc users 6 May 15 18:50 iscolored
-rw-r--r-- 1 mcc users 101K May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool lola
Input is Referendum-PT-0100, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r136-qhx2-152673579000289
=====================================================================
--------------------
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 Referendum-PT-0100-UpperBounds-00
FORMULA_NAME Referendum-PT-0100-UpperBounds-01
FORMULA_NAME Referendum-PT-0100-UpperBounds-02
FORMULA_NAME Referendum-PT-0100-UpperBounds-03
FORMULA_NAME Referendum-PT-0100-UpperBounds-04
FORMULA_NAME Referendum-PT-0100-UpperBounds-05
FORMULA_NAME Referendum-PT-0100-UpperBounds-06
FORMULA_NAME Referendum-PT-0100-UpperBounds-07
FORMULA_NAME Referendum-PT-0100-UpperBounds-08
FORMULA_NAME Referendum-PT-0100-UpperBounds-09
FORMULA_NAME Referendum-PT-0100-UpperBounds-10
FORMULA_NAME Referendum-PT-0100-UpperBounds-11
FORMULA_NAME Referendum-PT-0100-UpperBounds-12
FORMULA_NAME Referendum-PT-0100-UpperBounds-13
FORMULA_NAME Referendum-PT-0100-UpperBounds-14
FORMULA_NAME Referendum-PT-0100-UpperBounds-15
=== Now, execution of the tool begins
BK_START 1526990587284
info: Time: 3600 - MCC
===========================================================================================
prep: translating Referendum-PT-0100 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 Referendum-PT-0100 formula UpperBounds into LoLA format
===========================================================================================
prep: translating PT formula complete
vrfy: Checking UpperBounds @ Referendum-PT-0100 @ 3566 seconds
lola: LoLA will run for 3566 seconds at most (--timelimit)
lola: NET
lola: reading net from model.pnml.lola
lola: finished parsing
lola: closed net file model.pnml.lola
lola: 502/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 301
lola: finding significant places
lola: 301 places, 201 transitions, 201 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 103 transition conflict sets
lola: TASK
lola: reading formula from Referendum-PT-0100-UpperBounds.task
lola: MAX(voted_no_100 + voted_no_1 + voted_no_2 + voted_no_3 + voted_no_4 + voted_no_5 + voted_no_6 + voted_no_7 + voted_no_8 + voted_no_9 + voted_no_10 + voted_no_11 + voted_no_12 + voted_no_13 + voted_no_14 + voted_no_15 + voted_no_16 + voted_no_17 + voted_no_18 + voted_no_19 + voted_no_20 + voted_no_21 + voted_no_22 + voted_no_23 + voted_no_24 + voted_no_25 + voted_no_26 + voted_no_27 + voted_no_28 + voted_no_29 + voted_no_30 + voted_no_31 + voted_no_32 + voted_no_33 + voted_no_34 + voted_no_35 + voted_no_36 + voted_no_37 + voted_no_38 + voted_no_39 + voted_no_40 + voted_no_41 + voted_no_42 + voted_no_43 + voted_no_44 + voted_no_45 + voted_no_46 + voted_no_47 + voted_no_48 + voted_no_49 + voted_no_50 + voted_no_51 + voted_no_52 + voted_no_53 + voted_no_54 + voted_no_55 + voted_no_56 + voted_no_57 + voted_no_58 + voted_no_59 + voted_no_60 + voted_no_61 + voted_no_62 + voted_no_63 + voted_no_64 + voted_no_65 + voted_no_66 + voted_no_67 + voted_no_68 + voted_no_69 + voted_no_70 + voted_no_71 + voted_no_72 + voted_no_73 + voted_no_74 + voted_no_75 + voted_no_76 + voted_no_77 + voted_no_78 + voted_no_79 + voted_no_80 + voted_no_81 + voted_no_82 + voted_no_83 + voted_no_84 + voted_no_85 + voted_no_86 + voted_no_87 + voted_no_88 + voted_no_89 + voted_no_90 + voted_no_91 + voted_no_92 + voted_no_93 + voted_no_94 + voted_no_95 + voted_no_96 + voted_no_97 + voted_no_98 + voted_no_99) : MAX(ready) : MAX(voted_no_100 + voted_no_1 + voted_no_2 + voted_no_3 + voted_no_4 + voted_no_5 + voted_no_6 + voted_no_7 + voted_no_8 + voted_no_9 + voted_no_10 + voted_no_11 + voted_no_12 + voted_no_13 + voted_no_14 + voted_no_15 + voted_no_16 + voted_no_17 + voted_no_18 + voted_no_19 + voted_no_20 + voted_no_21 + voted_no_22 + voted_no_23 + voted_no_24 + voted_no_25 + voted_no_26 + voted_no_27 + voted_no_28 + voted_no_29 + voted_no_30 + voted_no_31 + voted_no_32 + voted_no_33 + voted_no_34 + voted_no_35 + voted_no_36 + voted_no_37 + voted_no_38 + voted_no_39 + voted_no_40 + voted_no_41 + voted_no_42 + voted_no_43 + voted_no_44 + voted_no_45 + voted_no_46 + voted_no_47 + voted_no_48 + voted_no_49 + voted_no_50 + voted_no_51 + voted_no_52 + voted_no_53 + voted_no_54 + voted_no_55 + voted_no_56 + voted_no_57 + voted_no_58 + voted_no_59 + voted_no_60 + voted_no_61 + voted_no_62 + voted_no_63 + voted_no_64 + voted_no_65 + voted_no_66 + voted_no_67 + voted_no_68 + voted_no_69 + voted_no_70 + voted_no_71 + voted_no_72 + voted_no_73 + voted_no_74 + voted_no_75 + voted_no_76 + voted_no_77 + voted_no_78 + voted_no_79 + voted_no_80 + voted_no_81 + voted_no_82 + voted_no_83 + voted_no_84 + voted_no_85 + voted_no_86 + voted_no_87 + voted_no_88 + voted_no_89 + voted_no_90 + voted_no_91 + voted_no_92 + voted_no_93 + voted_no_94 + voted_no_95 + voted_no_96 + voted_no_97 + voted_no_98 + voted_no_99) : MAX(voted_no_100 + voted_no_1 + voted_no_2 + voted_no_3 + voted_no_4 + voted_no_5 + voted_no_6 + voted_no_7 + voted_no_8 + voted_no_9 + voted_no_10 + voted_no_11 + voted_no_12 + voted_no_13 + voted_no_14 + voted_no_15 + voted_no_16 + voted_no_17 + voted_no_18 + voted_no_19 + voted_no_20 + voted_no_21 + voted_no_22 + voted_no_23 + voted_no_24 + voted_no_25 + voted_no_26 + voted_no_27 + voted_no_28 + voted_no_29 + voted_no_30 + voted_no_31 + voted_no_32 + voted_no_33 + voted_no_34 + voted_no_35 + voted_no_36 + voted_no_37 + voted_no_38 + voted_no_39 + voted_no_40 + voted_no_41 + voted_no_42 + voted_no_43 + voted_no_44 + voted_no_45 + voted_no_46 + voted_no_47 + voted_no_48 + voted_no_49 + voted_no_50 + voted_no_51 + voted_no_52 + voted_no_53 + voted_no_54 + voted_no_55 + voted_no_56 + voted_no_57 + voted_no_58 + voted_no_59 + voted_no_60 + voted_no_61 + voted_no_62 + voted_no_63 + voted_no_64 + voted_no_65 + voted_no_66 + voted_no_67 + voted_no_68 + voted_no_69 + voted_no_70 + voted_no_71 + voted_no_72 + voted_no_73 + voted_no_74 + voted_no_75 + voted_no_76 + voted_no_77 + voted_no_78 + voted_no_79 + voted_no_80 + voted_no_81 + voted_no_82 + voted_no_83 + voted_no_84 + voted_no_85 + voted_no_86 + voted_no_87 + voted_no_88 + voted_no_89 + voted_no_90 + voted_no_91 + voted_no_92 + voted_no_93 + voted_no_94 + voted_no_95 + voted_no_96 + voted_no_97 + voted_no_98 + voted_no_99) : MAX(voted_yes_100 + voted_yes_10 + voted_yes_11 + voted_yes_12 + voted_yes_13 + voted_yes_14 + voted_yes_15 + voted_yes_16 + voted_yes_17 + voted_yes_18 + voted_yes_19 + voted_yes_20 + voted_yes_21 + voted_yes_22 + voted_yes_23 + voted_yes_24 + voted_yes_25 + voted_yes_26 + voted_yes_27 + voted_yes_28 + voted_yes_29 + voted_yes_30 + voted_yes_31 + voted_yes_32 + voted_yes_33 + voted_yes_34 + voted_yes_35 + voted_yes_36 + voted_yes_37 + voted_yes_38 + voted_yes_39 + voted_yes_40 + voted_yes_41 + voted_yes_42 + voted_yes_43 + voted_yes_44 + voted_yes_45 + voted_yes_46 + voted_yes_47 + voted_yes_48 + voted_yes_49 + voted_yes_50 + voted_yes_51 + voted_yes_52 + voted_yes_53 + voted_yes_54 + voted_yes_55 + voted_yes_56 + voted_yes_57 + voted_yes_58 + voted_yes_59 + voted_yes_60 + voted_yes_61 + voted_yes_62 + voted_yes_63 + voted_yes_64 + voted_yes_65 + voted_yes_66 + voted_yes_67 + voted_yes_68 + voted_yes_69 + voted_yes_70 + voted_yes_71 + voted_yes_72 + voted_yes_73 + voted_yes_74 + voted_yes_75 + voted_yes_76 + voted_yes_77 + voted_yes_78 + voted_yes_79 + voted_yes_80 + voted_yes_81 + voted_yes_82 + voted_yes_83 + voted_yes_84 + voted_yes_85 + voted_yes_86 + voted_yes_87 + voted_yes_88 + voted_yes_89 + voted_yes_90 + voted_yes_91 + voted_yes_92 + voted_yes_93 + voted_yes_94 + voted_yes_95 + voted_yes_96 + voted_yes_97 + voted_yes_98 + voted_yes_99 + voted_yes_1 + voted_yes_2 + voted_yes_3 + voted_yes_4 + voted_yes_5 + voted_yes_6 + voted_yes_7 + voted_yes_8 + voted_yes_9) : MAX(voted_yes_100 + voted_yes_10 + voted_yes_11 + voted_yes_12 + voted_yes_13 + voted_yes_14 + voted_yes_15 + voted_yes_16 + voted_yes_17 + voted_yes_18 + voted_yes_19 + voted_yes_20 + voted_yes_21 + voted_yes_22 + voted_yes_23 + voted_yes_24 + voted_yes_25 + voted_yes_26 + voted_yes_27 + voted_yes_28 + voted_yes_29 + voted_yes_30 + voted_yes_31 + voted_yes_32 + voted_yes_33 + voted_yes_34 + voted_yes_35 + voted_yes_36 + voted_yes_37 + voted_yes_38 + voted_yes_39 + voted_yes_40 + voted_yes_41 + voted_yes_42 + voted_yes_43 + voted_yes_44 + voted_yes_45 + voted_yes_46 + voted_yes_47 + voted_yes_48 + voted_yes_49 + voted_yes_50 + voted_yes_51 + voted_yes_52 + voted_yes_53 + voted_yes_54 + voted_yes_55 + voted_yes_56 + voted_yes_57 + voted_yes_58 + voted_yes_59 + voted_yes_60 + voted_yes_61 + voted_yes_62 + voted_yes_63 + voted_yes_64 + voted_yes_65 + voted_yes_66 + voted_yes_67 + voted_yes_68 + voted_yes_69 + voted_yes_70 + voted_yes_71 + voted_yes_72 + voted_yes_73 + voted_yes_74 + voted_yes_75 + voted_yes_76 + voted_yes_77 + voted_yes_78 + voted_yes_79 + voted_yes_80 + voted_yes_81 + voted_yes_82 + voted_yes_83 + voted_yes_84 + voted_yes_85 + voted_yes_86 + voted_yes_87 + voted_yes_88 + voted_yes_89 + voted_yes_90 + voted_yes_91 + voted_yes_92 + voted_yes_93 + voted_yes_94 + voted_yes_95 + voted_yes_96 + voted_yes_97 + voted_yes_98 + voted_yes_99 + voted_yes_1 + voted_yes_2 + voted_yes_3 + voted_yes_4 + voted_yes_5 + voted_yes_6 + voted_yes_7 + voted_yes_8 + voted_yes_9) : MAX(voted_yes_100 + voted_yes_10 + voted_yes_11 + voted_yes_12 + voted_yes_13 + voted_yes_14 + voted_yes_15 + voted_yes_16 + voted_yes_17 + voted_yes_18 + voted_yes_19 + voted_yes_20 + voted_yes_21 + voted_yes_22 + voted_yes_23 + voted_yes_24 + voted_yes_25 + voted_yes_26 + voted_yes_27 + voted_yes_28 + voted_yes_29 + voted_yes_30 + voted_yes_31 + voted_yes_32 + voted_yes_33 + voted_yes_34 + voted_yes_35 + voted_yes_36 + voted_yes_37 + voted_yes_38 + voted_yes_39 + voted_yes_40 + voted_yes_41 + voted_yes_42 + voted_yes_43 + voted_yes_44 + voted_yes_45 + voted_yes_46 + voted_yes_47 + voted_yes_48 + voted_yes_49 + voted_yes_50 + voted_yes_51 + voted_yes_52 + voted_yes_53 + voted_yes_54 + voted_yes_55 + voted_yes_56 + voted_yes_57 + voted_yes_58 + voted_yes_59 + voted_yes_60 + voted_yes_61 + voted_yes_62 + voted_yes_63 + voted_yes_64 + voted_yes_65 + voted_yes_66 + voted_yes_67 + voted_yes_68 + voted_yes_69 + voted_yes_70 + voted_yes_71 + voted_yes_72 + voted_yes_73 + voted_yes_74 + voted_yes_75 + voted_yes_76 + voted_yes_77 + voted_yes_78 + voted_yes_79 + voted_yes_80 + voted_yes_81 + voted_yes_82 + voted_yes_83 + voted_yes_84 + voted_yes_85 + voted_yes_86 + voted_yes_87 + voted_yes_88 + voted_yes_89 + voted_yes_90 + voted_yes_91 + voted_yes_92 + voted_yes_93 + voted_yes_94 + voted_yes_95 + voted_yes_96 + voted_yes_97 + voted_yes_98 + voted_yes_99 + voted_yes_1 + voted_yes_2 + voted_yes_3 + voted_yes_4 + voted_yes_5 + voted_yes_6 + voted_yes_7 + voted_yes_8 + voted_yes_9) : MAX(voted_no_100 + voted_no_1 + voted_no_2 + voted_no_3 + voted_no_4 + voted_no_5 + voted_no_6 + voted_no_7 + voted_no_8 + voted_no_9 + voted_no_10 + voted_no_11 + voted_no_12 + voted_no_13 + voted_no_14 + voted_no_15 + voted_no_16 + voted_no_17 + voted_no_18 + voted_no_19 + voted_no_20 + voted_no_21 + voted_no_22 + voted_no_23 + voted_no_24 + voted_no_25 + voted_no_26 + voted_no_27 + voted_no_28 + voted_no_29 + voted_no_30 + voted_no_31 + voted_no_32 + voted_no_33 + voted_no_34 + voted_no_35 + voted_no_36 + voted_no_37 + voted_no_38 + voted_no_39 + voted_no_40 + voted_no_41 + voted_no_42 + voted_no_43 + voted_no_44 + voted_no_45 + voted_no_46 + voted_no_47 + voted_no_48 + voted_no_49 + voted_no_50 + voted_no_51 + voted_no_52 + voted_no_53 + voted_no_54 + voted_no_55 + voted_no_56 + voted_no_57 + voted_no_58 + voted_no_59 + voted_no_60 + voted_no_61 + voted_no_62 + voted_no_63 + voted_no_64 + voted_no_65 + voted_no_66 + voted_no_67 + voted_no_68 + voted_no_69 + voted_no_70 + voted_no_71 + voted_no_72 + voted_no_73 + voted_no_74 + voted_no_75 + voted_no_76 + voted_no_77 + voted_no_78 + voted_no_79 + voted_no_80 + voted_no_81 + voted_no_82 + voted_no_83 + voted_no_84 + voted_no_85 + voted_no_86 + voted_no_87 + voted_no_88 + voted_no_89 + voted_no_90 + voted_no_91 + voted_no_92 + voted_no_93 + voted_no_94 + voted_no_95 + voted_no_96 + voted_no_97 + voted_no_98 + voted_no_99) : MAX(voted_yes_84) : MAX(voting_76) : MAX(voting_45) : MAX(voted_no_92) : MAX(voted_no_84) : MAX(voted_no_2) : MAX(voted_yes_84) : MAX(voting_25)
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(ready)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(ready)
lola: processed formula length: 10
lola: 0 rewrites
lola: closed formula file Referendum-PT-0100-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 Referendum-PT-0100-UpperBounds-1 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(voted_yes_84)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(voted_yes_84)
lola: processed formula length: 17
lola: 0 rewrites
lola: closed formula file Referendum-PT-0100-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 Referendum-PT-0100-UpperBounds-8 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(voting_76)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(voting_76)
lola: processed formula length: 14
lola: 0 rewrites
lola: closed formula file Referendum-PT-0100-UpperBounds.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using bound preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: RUNNING
lola: Structural Bound: 1
lola: SUBRESULT
lola: result: 1
lola: produced by: state space
lola: The maximum value of the given expression is 1
lola: 2 markings, 1 edges
lola:
========================================
FORMULA Referendum-PT-0100-UpperBounds-9 1 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(voting_45)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(voting_45)
lola: processed formula length: 14
lola: 0 rewrites
lola: closed formula file Referendum-PT-0100-UpperBounds.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using bound preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: RUNNING
lola: Structural Bound: 1
lola: SUBRESULT
lola: result: 1
lola: produced by: state space
lola: The maximum value of the given expression is 1
lola: 2 markings, 1 edges
lola: ========================================
FORMULA Referendum-PT-0100-UpperBounds-10 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(voted_no_92)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(voted_no_92)
lola: processed formula length: 16
lola: 0 rewrites
lola: closed formula file Referendum-PT-0100-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 Referendum-PT-0100-UpperBounds-11 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(voted_no_84)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(voted_no_84)
lola: processed formula length: 16
lola: 0 rewrites
lola: closed formula file Referendum-PT-0100-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 Referendum-PT-0100-UpperBounds-12 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(voted_no_2)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(voted_no_2)
lola: processed formula length: 15
lola: 0 rewrites
lola: closed formula file Referendum-PT-0100-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 Referendum-PT-0100-UpperBounds-13 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(voted_yes_84)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(voted_yes_84)
lola: processed formula length: 17
lola: 0 rewrites
lola: closed formula file Referendum-PT-0100-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 Referendum-PT-0100-UpperBounds-14 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(voting_25)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(voting_25)
lola: processed formula length: 14
lola: 0 rewrites
lola: closed formula file Referendum-PT-0100-UpperBounds.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using bound preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: RUNNING
lola: Structural Bound: 1
lola: SUBRESULT
lola: result: 1
lola: produced by: state space
lola: The maximum value of the given expression is 1
lola: 2 markings, 1 edges
lola: ========================================
FORMULA Referendum-PT-0100-UpperBounds-15 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(voted_no_100 + voted_no_1 + voted_no_2 + voted_no_3 + voted_no_4 + voted_no_5 + voted_no_6 + voted_no_7 + voted_no_8 + voted_no_9 + voted_no_10 + voted_no_11 + voted_no_12 + voted_no_13 + voted_no_14 + voted_no_15 + voted_no_16 + voted_no_17 + voted_no_18 + voted_no_19 + voted_no_20 + voted_no_21 + voted_no_22 + voted_no_23 + voted_no_24 + voted_no_25 + voted_no_26 + voted_no_27 + voted_no_28 ... (shortened)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(voted_no_100 + voted_no_1 + voted_no_2 + voted_no_3 + voted_no_4 + voted_no_5 + voted_no_6 + voted_no_7 + voted_no_8 + voted_no_9 + voted_no_10 + voted_no_11 + voted_no_12 + voted_no_13 + voted_no_14 + voted_no_15 + voted_no_16 + voted_no_17 + voted_no_18 + voted_no_19 + voted_no_20 + voted_no_21 + voted_no_22 + voted_no_23 + voted_no_24 + voted_no_25 + voted_no_26 + voted_no_27 + voted_no_28 ... (shortened)
lola: processed formula length: 1394
lola: 0 rewrites
lola: closed formula file Referendum-PT-0100-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: 100
lola: SUBRESULT
lola: result: 100
lola: produced by: state space
lola: The maximum value of the given expression is 100
lola: 102 markings, 101 edges
lola:
FORMULA Referendum-PT-0100-UpperBounds-2 100 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(voted_no_100 + voted_no_1 + voted_no_2 + voted_no_3 + voted_no_4 + voted_no_5 + voted_no_6 + voted_no_7 + voted_no_8 + voted_no_9 + voted_no_10 + voted_no_11 + voted_no_12 + voted_no_13 + voted_no_14 + voted_no_15 + voted_no_16 + voted_no_17 + voted_no_18 + voted_no_19 + voted_no_20 + voted_no_21 + voted_no_22 + voted_no_23 + voted_no_24 + voted_no_25 + voted_no_26 + voted_no_27 + voted_no_28 ... (shortened)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(voted_no_100 + voted_no_1 + voted_no_2 + voted_no_3 + voted_no_4 + voted_no_5 + voted_no_6 + voted_no_7 + voted_no_8 + voted_no_9 + voted_no_10 + voted_no_11 + voted_no_12 + voted_no_13 + voted_no_14 + voted_no_15 + voted_no_16 + voted_no_17 + voted_no_18 + voted_no_19 + voted_no_20 + voted_no_21 + voted_no_22 + voted_no_23 + voted_no_24 + voted_no_25 + voted_no_26 + voted_no_27 + voted_no_28 ... (shortened)
lola: processed formula length: 1394
lola: 0 rewrites
lola: closed formula file Referendum-PT-0100-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: 100
lola: SUBRESULT
lola: result: 100
lola: produced by: state space
lola: The maximum value of the given expression is 100
lola: 102 markings, 101 edges
lola:
FORMULA Referendum-PT-0100-UpperBounds-3 100 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(voted_yes_100 + voted_yes_10 + voted_yes_11 + voted_yes_12 + voted_yes_13 + voted_yes_14 + voted_yes_15 + voted_yes_16 + voted_yes_17 + voted_yes_18 + voted_yes_19 + voted_yes_20 + voted_yes_21 + voted_yes_22 + voted_yes_23 + voted_yes_24 + voted_yes_25 + voted_yes_26 + voted_yes_27 + voted_yes_28 + voted_yes_29 + voted_yes_30 + voted_yes_31 + voted_yes_32 + voted_yes_33 + voted_yes_34 + voted... (shortened)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(voted_yes_100 + voted_yes_10 + voted_yes_11 + voted_yes_12 + voted_yes_13 + voted_yes_14 + voted_yes_15 + voted_yes_16 + voted_yes_17 + voted_yes_18 + voted_yes_19 + voted_yes_20 + voted_yes_21 + voted_yes_22 + voted_yes_23 + voted_yes_24 + voted_yes_25 + voted_yes_26 + voted_yes_27 + voted_yes_28 + voted_yes_29 + voted_yes_30 + voted_yes_31 + voted_yes_32 + voted_yes_33 + voted_yes_34 + voted... (shortened)
lola: processed formula length: 1494
lola: 0 rewrites
lola: closed formula file Referendum-PT-0100-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: 100
lola: SUBRESULT
lola: result: 100
lola: produced by: state space
lola: The maximum value of the given expression is 100
lola: 102 markings, 101 edges
lola: ========================================
FORMULA Referendum-PT-0100-UpperBounds-4 100 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 12 will run for 891 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(voted_yes_100 + voted_yes_10 + voted_yes_11 + voted_yes_12 + voted_yes_13 + voted_yes_14 + voted_yes_15 + voted_yes_16 + voted_yes_17 + voted_yes_18 + voted_yes_19 + voted_yes_20 + voted_yes_21 + voted_yes_22 + voted_yes_23 + voted_yes_24 + voted_yes_25 + voted_yes_26 + voted_yes_27 + voted_yes_28 + voted_yes_29 + voted_yes_30 + voted_yes_31 + voted_yes_32 + voted_yes_33 + voted_yes_34 + voted... (shortened)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(voted_yes_100 + voted_yes_10 + voted_yes_11 + voted_yes_12 + voted_yes_13 + voted_yes_14 + voted_yes_15 + voted_yes_16 + voted_yes_17 + voted_yes_18 + voted_yes_19 + voted_yes_20 + voted_yes_21 + voted_yes_22 + voted_yes_23 + voted_yes_24 + voted_yes_25 + voted_yes_26 + voted_yes_27 + voted_yes_28 + voted_yes_29 + voted_yes_30 + voted_yes_31 + voted_yes_32 + voted_yes_33 + voted_yes_34 + voted... (shortened)
lola: processed formula length: 1494
lola: 0 rewrites
lola: closed formula file Referendum-PT-0100-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: 100
lola: SUBRESULT
lola: result: 100
lola: produced by: state space
lola: The maximum value of the given expression is 100
lola: 102 markings, 101 edges
lola: ========================================
FORMULA Referendum-PT-0100-UpperBounds-5 100 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 13 will run for 1188 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(voted_yes_100 + voted_yes_10 + voted_yes_11 + voted_yes_12 + voted_yes_13 + voted_yes_14 + voted_yes_15 + voted_yes_16 + voted_yes_17 + voted_yes_18 + voted_yes_19 + voted_yes_20 + voted_yes_21 + voted_yes_22 + voted_yes_23 + voted_yes_24 + voted_yes_25 + voted_yes_26 + voted_yes_27 + voted_yes_28 + voted_yes_29 + voted_yes_30 + voted_yes_31 + voted_yes_32 + voted_yes_33 + voted_yes_34 + voted... (shortened)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(voted_yes_100 + voted_yes_10 + voted_yes_11 + voted_yes_12 + voted_yes_13 + voted_yes_14 + voted_yes_15 + voted_yes_16 + voted_yes_17 + voted_yes_18 + voted_yes_19 + voted_yes_20 + voted_yes_21 + voted_yes_22 + voted_yes_23 + voted_yes_24 + voted_yes_25 + voted_yes_26 + voted_yes_27 + voted_yes_28 + voted_yes_29 + voted_yes_30 + voted_yes_31 + voted_yes_32 + voted_yes_33 + voted_yes_34 + voted... (shortened)
lola: processed formula length: 1494
lola: 0 rewrites
lola: closed formula file Referendum-PT-0100-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: 100
lola: SUBRESULT
lola: result: 100
lola: produced by: state space
lola: The maximum value of the given expression is 100
lola: 102 markings, 101 edges
lola: ========================================
FORMULA Referendum-PT-0100-UpperBounds-6 100 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 14 will run for 1782 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(voted_no_100 + voted_no_1 + voted_no_2 + voted_no_3 + voted_no_4 + voted_no_5 + voted_no_6 + voted_no_7 + voted_no_8 + voted_no_9 + voted_no_10 + voted_no_11 + voted_no_12 + voted_no_13 + voted_no_14 + voted_no_15 + voted_no_16 + voted_no_17 + voted_no_18 + voted_no_19 + voted_no_20 + voted_no_21 + voted_no_22 + voted_no_23 + voted_no_24 + voted_no_25 + voted_no_26 + voted_no_27 + voted_no_28 ... (shortened)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(voted_no_100 + voted_no_1 + voted_no_2 + voted_no_3 + voted_no_4 + voted_no_5 + voted_no_6 + voted_no_7 + voted_no_8 + voted_no_9 + voted_no_10 + voted_no_11 + voted_no_12 + voted_no_13 + voted_no_14 + voted_no_15 + voted_no_16 + voted_no_17 + voted_no_18 + voted_no_19 + voted_no_20 + voted_no_21 + voted_no_22 + voted_no_23 + voted_no_24 + voted_no_25 + voted_no_26 + voted_no_27 + voted_no_28 ... (shortened)
lola: processed formula length: 1394
lola: 0 rewrites
lola: closed formula file Referendum-PT-0100-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: 100
lola: SUBRESULT
lola: result: 100
lola: produced by: state space
lola: The maximum value of the given expression is 100
lola: 102 markings, 101 edges
lola:
========================================FORMULA Referendum-PT-0100-UpperBounds-7 100 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 15 will run for 3565 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(voted_no_100 + voted_no_1 + voted_no_2 + voted_no_3 + voted_no_4 + voted_no_5 + voted_no_6 + voted_no_7 + voted_no_8 + voted_no_9 + voted_no_10 + voted_no_11 + voted_no_12 + voted_no_13 + voted_no_14 + voted_no_15 + voted_no_16 + voted_no_17 + voted_no_18 + voted_no_19 + voted_no_20 + voted_no_21 + voted_no_22 + voted_no_23 + voted_no_24 + voted_no_25 + voted_no_26 + voted_no_27 + voted_no_28 ... (shortened)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(voted_no_100 + voted_no_1 + voted_no_2 + voted_no_3 + voted_no_4 + voted_no_5 + voted_no_6 + voted_no_7 + voted_no_8 + voted_no_9 + voted_no_10 + voted_no_11 + voted_no_12 + voted_no_13 + voted_no_14 + voted_no_15 + voted_no_16 + voted_no_17 + voted_no_18 + voted_no_19 + voted_no_20 + voted_no_21 + voted_no_22 + voted_no_23 + voted_no_24 + voted_no_25 + voted_no_26 + voted_no_27 + voted_no_28 ... (shortened)
lola: processed formula length: 1394
lola: 0 rewrites
lola: closed formula file Referendum-PT-0100-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: 100
lola: SUBRESULT
lola: result: 100
lola: produced by: state space
lola: The maximum value of the given expression is 100
lola: 102 markings, 101 edges
lola:
FORMULA Referendum-PT-0100-UpperBounds-0 100 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
========================================
lola: RESULT
lola:
SUMMARY: 100 1 100 100 100 100 100 100 1 1 1 1 1 1 1 1
lola:
preliminary result: 100 1 100 100 100 100 100 100 1 1 1 1 1 1 1 1
lola: memory consumption: 18880 KB
lola: time consumption: 1 seconds
BK_STOP 1526990616892
--------------------
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="Referendum-PT-0100"
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/Referendum-PT-0100.tgz
mv Referendum-PT-0100 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 Referendum-PT-0100, 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-152673579000289"
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 '
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 ;