Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2019-input.r143-smll-155284920800079.qcow2', fmt=qcow2 size=4294967296 backing_file='/data/fkordon/mcc2019-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
...................
=====================================================================
Generated by BenchKit 2-3957
Executing tool win2018
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 r143-smll-155284920800079
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 904K
-rw-r--r-- 1 mcc users 44K Feb 12 12:14 CTLCardinality.txt
-rw-r--r-- 1 mcc users 146K Feb 12 12:14 CTLCardinality.xml
-rw-r--r-- 1 mcc users 19K Feb 8 14:33 CTLFireability.txt
-rw-r--r-- 1 mcc users 102K Feb 8 14:33 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 10 17:31 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 105 Feb 24 15:05 GlobalProperties.txt
-rw-r--r-- 1 mcc users 343 Feb 24 15:05 GlobalProperties.xml
-rw-r--r-- 1 mcc users 16K Feb 5 01:03 LTLCardinality.txt
-rw-r--r-- 1 mcc users 49K Feb 5 01:03 LTLCardinality.xml
-rw-r--r-- 1 mcc users 11K Feb 4 22:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 51K Feb 4 22:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 27K Feb 4 15:04 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 86K Feb 4 15:04 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 28K Feb 1 11:30 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 150K Feb 1 11:30 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 8.3K Feb 4 22:30 UpperBounds.txt
-rw-r--r-- 1 mcc users 20K Feb 4 22:30 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Jan 29 09:35 equiv_col
-rw-r--r-- 1 mcc users 5 Jan 29 09:35 instance
-rw-r--r-- 1 mcc users 6 Jan 29 09:35 iscolored
-rw-r--r-- 1 mcc users 101K Mar 10 17:31 model.pnml

--------------------
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 1552999528036

info: Time: 3600 - MCC
===========================================================================================
prep: translating Referendum-PT-0100 Petri net model.pnml into LoLA format
===========================================================================================
prep: translating PT Petri net complete
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 @ 3570 seconds
lola: LoLA will run for 3570 seconds at most (--timelimit)
lola: NET
lola: reading net from model.pnml.lola
lola: finished parsing
lola: closed net file model.pnml.lola
lola: 502/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 9632
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(ready) : MAX(voting_10 + voting_11 + voting_12 + voting_13 + voting_14 + voting_15 + voting_16 + voting_17 + voting_18 + voting_19 + voting_20 + voting_21 + voting_22 + voting_23 + voting_24 + voting_25 + voting_26 + voting_27 + voting_28 + voting_29 + voting_30 + voting_31 + voting_32 + voting_33 + voting_34 + voting_35 + voting_36 + voting_37 + voting_38 + voting_39 + voting_40 + voting_41 + voting_42 + voting_43 + voting_44 + voting_45 + voting_46 + voting_47 + voting_48 + voting_49 + voting_50 + voting_51 + voting_52 + voting_53 + voting_54 + voting_55 + voting_56 + voting_57 + voting_58 + voting_59 + voting_60 + voting_61 + voting_62 + voting_63 + voting_64 + voting_65 + voting_66 + voting_67 + voting_68 + voting_69 + voting_70 + voting_71 + voting_72 + voting_73 + voting_74 + voting_75 + voting_76 + voting_77 + voting_78 + voting_79 + voting_80 + voting_81 + voting_82 + voting_83 + voting_84 + voting_85 + voting_86 + voting_87 + voting_88 + voting_89 + voting_90 + voting_91 + voting_92 + voting_93 + voting_94 + voting_95 + voting_96 + voting_97 + voting_98 + voting_99 + voting_1 + voting_2 + voting_3 + voting_4 + voting_5 + voting_6 + voting_7 + voting_8 + voting_9 + voting_100) : 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(ready) : MAX(voting_10 + voting_11 + voting_12 + voting_13 + voting_14 + voting_15 + voting_16 + voting_17 + voting_18 + voting_19 + voting_20 + voting_21 + voting_22 + voting_23 + voting_24 + voting_25 + voting_26 + voting_27 + voting_28 + voting_29 + voting_30 + voting_31 + voting_32 + voting_33 + voting_34 + voting_35 + voting_36 + voting_37 + voting_38 + voting_39 + voting_40 + voting_41 + voting_42 + voting_43 + voting_44 + voting_45 + voting_46 + voting_47 + voting_48 + voting_49 + voting_50 + voting_51 + voting_52 + voting_53 + voting_54 + voting_55 + voting_56 + voting_57 + voting_58 + voting_59 + voting_60 + voting_61 + voting_62 + voting_63 + voting_64 + voting_65 + voting_66 + voting_67 + voting_68 + voting_69 + voting_70 + voting_71 + voting_72 + voting_73 + voting_74 + voting_75 + voting_76 + voting_77 + voting_78 + voting_79 + voting_80 + voting_81 + voting_82 + voting_83 + voting_84 + voting_85 + voting_86 + voting_87 + voting_88 + voting_89 + voting_90 + voting_91 + voting_92 + voting_93 + voting_94 + voting_95 + voting_96 + voting_97 + voting_98 + voting_99 + voting_1 + voting_2 + voting_3 + voting_4 + voting_5 + voting_6 + voting_7 + voting_8 + voting_9 + voting_100) : MAX(voting_10 + voting_11 + voting_12 + voting_13 + voting_14 + voting_15 + voting_16 + voting_17 + voting_18 + voting_19 + voting_20 + voting_21 + voting_22 + voting_23 + voting_24 + voting_25 + voting_26 + voting_27 + voting_28 + voting_29 + voting_30 + voting_31 + voting_32 + voting_33 + voting_34 + voting_35 + voting_36 + voting_37 + voting_38 + voting_39 + voting_40 + voting_41 + voting_42 + voting_43 + voting_44 + voting_45 + voting_46 + voting_47 + voting_48 + voting_49 + voting_50 + voting_51 + voting_52 + voting_53 + voting_54 + voting_55 + voting_56 + voting_57 + voting_58 + voting_59 + voting_60 + voting_61 + voting_62 + voting_63 + voting_64 + voting_65 + voting_66 + voting_67 + voting_68 + voting_69 + voting_70 + voting_71 + voting_72 + voting_73 + voting_74 + voting_75 + voting_76 + voting_77 + voting_78 + voting_79 + voting_80 + voting_81 + voting_82 + voting_83 + voting_84 + voting_85 + voting_86 + voting_87 + voting_88 + voting_89 + voting_90 + voting_91 + voting_92 + voting_93 + voting_94 + voting_95 + voting_96 + voting_97 + voting_98 + voting_99 + voting_1 + voting_2 + voting_3 + voting_4 + voting_5 + voting_6 + voting_7 + voting_8 + voting_9 + voting_100) : MAX(ready) : MAX(voting_10 + voting_11 + voting_12 + voting_13 + voting_14 + voting_15 + voting_16 + voting_17 + voting_18 + voting_19 + voting_20 + voting_21 + voting_22 + voting_23 + voting_24 + voting_25 + voting_26 + voting_27 + voting_28 + voting_29 + voting_30 + voting_31 + voting_32 + voting_33 + voting_34 + voting_35 + voting_36 + voting_37 + voting_38 + voting_39 + voting_40 + voting_41 + voting_42 + voting_43 + voting_44 + voting_45 + voting_46 + voting_47 + voting_48 + voting_49 + voting_50 + voting_51 + voting_52 + voting_53 + voting_54 + voting_55 + voting_56 + voting_57 + voting_58 + voting_59 + voting_60 + voting_61 + voting_62 + voting_63 + voting_64 + voting_65 + voting_66 + voting_67 + voting_68 + voting_69 + voting_70 + voting_71 + voting_72 + voting_73 + voting_74 + voting_75 + voting_76 + voting_77 + voting_78 + voting_79 + voting_80 + voting_81 + voting_82 + voting_83 + voting_84 + voting_85 + voting_86 + voting_87 + voting_88 + voting_89 + voting_90 + voting_91 + voting_92 + voting_93 + voting_94 + voting_95 + voting_96 + voting_97 + voting_98 + voting_99 + voting_1 + voting_2 + voting_3 + voting_4 + voting_5 + voting_6 + voting_7 + voting_8 + voting_9 + voting_100) : MAX(voted_no_49) : MAX(voting_45) : MAX(voted_no_57) : MAX(voted_no_18) : MAX(voted_no_87) : MAX(voted_yes_64) : MAX(voted_no_83) : MAX(voted_yes_13)
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 223 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(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-0 1 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

lola: subprocess 1 will run for 238 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(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-3 1 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
========================================
lola: subprocess 2 will run for 255 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(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-6 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(voted_no_49)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(voted_no_49)
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-8 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(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-9 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_57)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(voted_no_57)
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-10 1 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
========================================
lola: subprocess 6 will run for 357 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(voted_no_18)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(voted_no_18)
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 7 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(voted_no_87)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(voted_no_87)
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 8 will run for 446 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(voted_yes_64)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(voted_yes_64)
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-13 1 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 9 will run for 510 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(voted_no_83)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(voted_no_83)
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-14 1 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 10 will run for 595 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(voted_yes_13)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(voted_yes_13)
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-15 1 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 11 will run for 714 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-2 100 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 12 will run for 892 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(voting_10 + voting_11 + voting_12 + voting_13 + voting_14 + voting_15 + voting_16 + voting_17 + voting_18 + voting_19 + voting_20 + voting_21 + voting_22 + voting_23 + voting_24 + voting_25 + voting_26 + voting_27 + voting_28 + voting_29 + voting_30 + voting_31 + voting_32 + voting_33 + voting_34 + voting_35 + voting_36 + voting_37 + voting_38 + voting_39 + voting_40 + voting_41 + voting_42 + ... (shortened)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(voting_10 + voting_11 + voting_12 + voting_13 + voting_14 + voting_15 + voting_16 + voting_17 + voting_18 + voting_19 + voting_20 + voting_21 + voting_22 + voting_23 + voting_24 + voting_25 + voting_26 + voting_27 + voting_28 + voting_29 + voting_30 + voting_31 + voting_32 + voting_33 + voting_34 + voting_35 + voting_36 + voting_37 + voting_38 + voting_39 + voting_40 + voting_41 + voting_42 + ... (shortened)
lola: processed formula length: 1194
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: 2 markings, 1 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 13 will run for 1190 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(voting_10 + voting_11 + voting_12 + voting_13 + voting_14 + voting_15 + voting_16 + voting_17 + voting_18 + voting_19 + voting_20 + voting_21 + voting_22 + voting_23 + voting_24 + voting_25 + voting_26 + voting_27 + voting_28 + voting_29 + voting_30 + voting_31 + voting_32 + voting_33 + voting_34 + voting_35 + voting_36 + voting_37 + voting_38 + voting_39 + voting_40 + voting_41 + voting_42 + ... (shortened)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(voting_10 + voting_11 + voting_12 + voting_13 + voting_14 + voting_15 + voting_16 + voting_17 + voting_18 + voting_19 + voting_20 + voting_21 + voting_22 + voting_23 + voting_24 + voting_25 + voting_26 + voting_27 + voting_28 + voting_29 + voting_30 + voting_31 + voting_32 + voting_33 + voting_34 + voting_35 + voting_36 + voting_37 + voting_38 + voting_39 + voting_40 + voting_41 + voting_42 + ... (shortened)
lola: processed formula length: 1194
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: 2 markings, 1 edges
lola:
FORMULA Referendum-PT-0100-UpperBounds-1 100 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
========================================
lola: subprocess 14 will run for 1785 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(voting_10 + voting_11 + voting_12 + voting_13 + voting_14 + voting_15 + voting_16 + voting_17 + voting_18 + voting_19 + voting_20 + voting_21 + voting_22 + voting_23 + voting_24 + voting_25 + voting_26 + voting_27 + voting_28 + voting_29 + voting_30 + voting_31 + voting_32 + voting_33 + voting_34 + voting_35 + voting_36 + voting_37 + voting_38 + voting_39 + voting_40 + voting_41 + voting_42 + ... (shortened)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(voting_10 + voting_11 + voting_12 + voting_13 + voting_14 + voting_15 + voting_16 + voting_17 + voting_18 + voting_19 + voting_20 + voting_21 + voting_22 + voting_23 + voting_24 + voting_25 + voting_26 + voting_27 + voting_28 + voting_29 + voting_30 + voting_31 + voting_32 + voting_33 + voting_34 + voting_35 + voting_36 + voting_37 + voting_38 + voting_39 + voting_40 + voting_41 + voting_42 + ... (shortened)
lola: processed formula length: 1194
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: 2 markings, 1 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 15 will run for 3570 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(voting_10 + voting_11 + voting_12 + voting_13 + voting_14 + voting_15 + voting_16 + voting_17 + voting_18 + voting_19 + voting_20 + voting_21 + voting_22 + voting_23 + voting_24 + voting_25 + voting_26 + voting_27 + voting_28 + voting_29 + voting_30 + voting_31 + voting_32 + voting_33 + voting_34 + voting_35 + voting_36 + voting_37 + voting_38 + voting_39 + voting_40 + voting_41 + voting_42 + ... (shortened)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(voting_10 + voting_11 + voting_12 + voting_13 + voting_14 + voting_15 + voting_16 + voting_17 + voting_18 + voting_19 + voting_20 + voting_21 + voting_22 + voting_23 + voting_24 + voting_25 + voting_26 + voting_27 + voting_28 + voting_29 + voting_30 + voting_31 + voting_32 + voting_33 + voting_34 + voting_35 + voting_36 + voting_37 + voting_38 + voting_39 + voting_40 + voting_41 + voting_42 + ... (shortened)
lola: processed formula length: 1194
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: 2 markings, 1 edges
lola: ========================================

FORMULA Referendum-PT-0100-UpperBounds-5 100 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: RESULT
lola:
SUMMARY: 1 100 100 1 100 100 1 100 1 1 1 1 1 1 1 1
lola:
preliminary result: 1 100 100 1 100 100 1 100 1 1 1 1 1 1 1 1
lola: memory consumption: 19132 KB
lola: time consumption: 0 seconds

BK_STOP 1552999528607

--------------------
content from stderr:

grep: GenericPropertiesVerdict.xml: No such file or directory

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="win2018"
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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-3957"
echo " Executing tool win2018"
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 r143-smll-155284920800079"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/Referendum-PT-0100.tgz
mv Referendum-PT-0100 execution
cd execution
if [ "UpperBounds" = "GlobalProperties" ] ; then
rm -f GenericPropertiesVerdict.xml
fi
if [ "UpperBounds" = "UpperBounds" ] ; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

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 ;