Execution Chart

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

Trace from the execution

Formatting '/local/x2003239/mcc2020-input.r174-csrt-158987852900245.qcow2', fmt=qcow2 size=4294967296 backing_file=/local/x2003239/mcc2020-input.qcow2 encryption=off cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
..............................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itslola
Input is NeoElection-COL-5, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r174-csrt-158987852900245
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 264K
-rw-r--r-- 1 mcc users 4.3K Apr 30 13:04 CTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Apr 30 13:04 CTLCardinality.xml
-rw-r--r-- 1 mcc users 3.0K Apr 30 13:04 CTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 30 13:04 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Apr 30 13:04 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.7K Apr 30 13:04 LTLCardinality.txt
-rw-r--r-- 1 mcc users 21K Apr 30 13:04 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Apr 30 13:04 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 30 13:04 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K Apr 30 13:04 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 14K Apr 30 13:04 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.3K Apr 30 13:04 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 30 13:04 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 30 13:04 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 30 13:04 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Apr 30 13:04 equiv_pt
-rw-r--r-- 1 mcc users 2 Apr 30 13:04 instance
-rw-r--r-- 1 mcc users 5 Apr 30 13:04 iscolored
-rw-r--r-- 1 mcc users 89K Apr 30 13:04 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 NeoElection-COL-5-UpperBounds-00
FORMULA_NAME NeoElection-COL-5-UpperBounds-01
FORMULA_NAME NeoElection-COL-5-UpperBounds-02
FORMULA_NAME NeoElection-COL-5-UpperBounds-03
FORMULA_NAME NeoElection-COL-5-UpperBounds-04
FORMULA_NAME NeoElection-COL-5-UpperBounds-05
FORMULA_NAME NeoElection-COL-5-UpperBounds-06
FORMULA_NAME NeoElection-COL-5-UpperBounds-07
FORMULA_NAME NeoElection-COL-5-UpperBounds-08
FORMULA_NAME NeoElection-COL-5-UpperBounds-09
FORMULA_NAME NeoElection-COL-5-UpperBounds-10
FORMULA_NAME NeoElection-COL-5-UpperBounds-11
FORMULA_NAME NeoElection-COL-5-UpperBounds-12
FORMULA_NAME NeoElection-COL-5-UpperBounds-13
FORMULA_NAME NeoElection-COL-5-UpperBounds-14
FORMULA_NAME NeoElection-COL-5-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1591136993721

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-02 22:29:56] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -timeout, 3600, -rebuildPNML]
[2020-06-02 22:29:56] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-02 22:29:56] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
SLF4J: Failed to load class "org.slf4j.impl.StaticLoggerBinder".
SLF4J: Defaulting to no-operation (NOP) logger implementation
SLF4J: See http://www.slf4j.org/codes.html#StaticLoggerBinder for further details.
[2020-06-02 22:29:57] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 870 ms
[2020-06-02 22:29:57] [INFO ] sort/places :
M * STAGE->P-stage,
M * POS->P-sendAnnPs__broadcasting,P-startNeg__broadcasting,
M * M * MT * M->P-network,P-poll__networl,
M * POS * M->P-masterList,
M * BOOL * M->P-masterState,
M * M * NEGSTEP->P-negotiation,
M->P-crashed,dead,P-electedPrimary,P-electedSecondary,P-electionFailed,P-electionInit,P-poll__handlingMessage,P-poll__pollEnd,P-poll__waitingMessage,P-polling,

[2020-06-02 22:29:57] [INFO ] Detected 4 constant HL places corresponding to 198 PT places.
[2020-06-02 22:29:57] [INFO ] Imported 18 HL places and 22 HL transitions for a total of 3090 PT places and 7716.0 transition bindings in 29 ms.
[2020-06-02 22:29:57] [INFO ] Computed order based on color domains.
[2020-06-02 22:29:57] [INFO ] Unfolded HLPN to a Petri net with 3090 places and 4426 transitions in 102 ms.
[2020-06-02 22:29:57] [INFO ] Unfolded HLPN properties in 1 ms.
Deduced a syphon composed of 2866 places in 17 ms
Reduce places removed 2886 places and 4190 transitions.
Reduce places removed 11 places and 0 transitions.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 168 ms.
Finished random walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
[2020-06-02 22:29:57] [INFO ] Flatten gal took : 78 ms
FORMULA NeoElection-COL-5-UpperBounds-15 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NeoElection-COL-5-UpperBounds-13 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NeoElection-COL-5-UpperBounds-12 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NeoElection-COL-5-UpperBounds-11 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NeoElection-COL-5-UpperBounds-10 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NeoElection-COL-5-UpperBounds-09 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NeoElection-COL-5-UpperBounds-05 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NeoElection-COL-5-UpperBounds-03 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NeoElection-COL-5-UpperBounds-02 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NeoElection-COL-5-UpperBounds-00 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Finished random walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished probabilistic random walk after 0 steps, run visited all 0 properties in 0 ms. (steps per millisecond=0 )
[2020-06-02 22:29:57] [INFO ] Flow matrix only has 220 transitions (discarded 16 similar events)
// Phase 1: matrix 220 rows 193 cols
[2020-06-02 22:29:57] [INFO ] Computed 54 place invariants in 10 ms
Support contains 90 out of 193 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 193/193 places, 236/236 transitions.
Discarding 20 places :
Also discarding 0 output transitions
Graph (complete) has 591 edges and 193 vertex of which 173 are kept as prefixes of interest. Removing 20 places using SCC suffix rule.10 ms
Symmetric choice reduction at 0 with 20 rule applications. Total rules 21 place count 173 transition count 236
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 95 transitions.
Iterating global reduction 0 with 40 rules applied. Total rules applied 61 place count 153 transition count 141
Applied a total of 61 rules in 33 ms. Remains 153 /193 variables (removed 40) and now considering 141/236 (removed 95) transitions.
Finished structural reductions, in 1 iterations. Remains : 153/193 places, 141/236 transitions.
Finished random walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished probabilistic random walk after 0 steps, run visited all 0 properties in 0 ms. (steps per millisecond=0 )
[2020-06-02 22:29:57] [INFO ] Flow matrix only has 125 transitions (discarded 16 similar events)
// Phase 1: matrix 125 rows 153 cols
[2020-06-02 22:29:57] [INFO ] Computed 34 place invariants in 3 ms
Support contains 90 out of 153 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 153/153 places, 141/141 transitions.
Applied a total of 0 rules in 6 ms. Remains 153 /153 variables (removed 0) and now considering 141/141 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 153/153 places, 141/141 transitions.
Starting structural reductions, iteration 0 : 153/153 places, 141/141 transitions.
Applied a total of 0 rules in 8 ms. Remains 153 /153 variables (removed 0) and now considering 141/141 (removed 0) transitions.
[2020-06-02 22:29:57] [INFO ] Flow matrix only has 125 transitions (discarded 16 similar events)
// Phase 1: matrix 125 rows 153 cols
[2020-06-02 22:29:57] [INFO ] Computed 34 place invariants in 3 ms
[2020-06-02 22:29:57] [INFO ] Implicit Places using invariants in 258 ms returned [13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37]
Discarding 25 places :
Implicit Place search using SMT only with invariants took 262 ms to find 25 implicit places.
[2020-06-02 22:29:57] [INFO ] Redundant transitions in 3 ms returned []
[2020-06-02 22:29:57] [INFO ] Flow matrix only has 125 transitions (discarded 16 similar events)
// Phase 1: matrix 125 rows 128 cols
[2020-06-02 22:29:57] [INFO ] Computed 9 place invariants in 2 ms
[2020-06-02 22:29:58] [INFO ] Dead Transitions using invariants and state equation in 156 ms returned []
Starting structural reductions, iteration 1 : 128/153 places, 141/141 transitions.
Applied a total of 0 rules in 5 ms. Remains 128 /128 variables (removed 0) and now considering 141/141 (removed 0) transitions.
[2020-06-02 22:29:58] [INFO ] Redundant transitions in 5 ms returned []
[2020-06-02 22:29:58] [INFO ] Flow matrix only has 125 transitions (discarded 16 similar events)
// Phase 1: matrix 125 rows 128 cols
[2020-06-02 22:29:58] [INFO ] Computed 9 place invariants in 3 ms
[2020-06-02 22:29:58] [INFO ] Dead Transitions using invariants and state equation in 171 ms returned []
Finished structural reductions, in 2 iterations. Remains : 128/153 places, 141/141 transitions.
Finished random walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished probabilistic random walk after 0 steps, run visited all 0 properties in 0 ms. (steps per millisecond=0 )
[2020-06-02 22:29:58] [INFO ] Flow matrix only has 125 transitions (discarded 16 similar events)
// Phase 1: matrix 125 rows 128 cols
[2020-06-02 22:29:58] [INFO ] Computed 9 place invariants in 2 ms
Support contains 90 out of 128 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 128/128 places, 141/141 transitions.
Applied a total of 0 rules in 5 ms. Remains 128 /128 variables (removed 0) and now considering 141/141 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 128/128 places, 141/141 transitions.
Starting structural reductions, iteration 0 : 128/128 places, 141/141 transitions.
Applied a total of 0 rules in 5 ms. Remains 128 /128 variables (removed 0) and now considering 141/141 (removed 0) transitions.
[2020-06-02 22:29:58] [INFO ] Flow matrix only has 125 transitions (discarded 16 similar events)
// Phase 1: matrix 125 rows 128 cols
[2020-06-02 22:29:58] [INFO ] Computed 9 place invariants in 2 ms
[2020-06-02 22:29:58] [INFO ] Implicit Places using invariants in 61 ms returned []
[2020-06-02 22:29:58] [INFO ] Flow matrix only has 125 transitions (discarded 16 similar events)
// Phase 1: matrix 125 rows 128 cols
[2020-06-02 22:29:58] [INFO ] Computed 9 place invariants in 1 ms
[2020-06-02 22:29:58] [INFO ] State equation strengthened by 26 read => feed constraints.
[2020-06-02 22:29:58] [INFO ] Implicit Places using invariants and state equation in 177 ms returned []
Implicit Place search using SMT with State Equation took 248 ms to find 0 implicit places.
[2020-06-02 22:29:58] [INFO ] Redundant transitions in 3 ms returned []
[2020-06-02 22:29:58] [INFO ] Flow matrix only has 125 transitions (discarded 16 similar events)
// Phase 1: matrix 125 rows 128 cols
[2020-06-02 22:29:58] [INFO ] Computed 9 place invariants in 2 ms
[2020-06-02 22:29:58] [INFO ] Dead Transitions using invariants and state equation in 122 ms returned []
Finished structural reductions, in 1 iterations. Remains : 128/128 places, 141/141 transitions.
Finished random walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Discarding 4 places :
Also discarding 0 output transitions
Graph (complete) has 282 edges and 128 vertex of which 124 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.1 ms
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 0 with 16 rules applied. Total rules applied 17 place count 124 transition count 125
Applied a total of 17 rules in 8 ms. Remains 124 /128 variables (removed 4) and now considering 125/141 (removed 16) transitions.
// Phase 1: matrix 125 rows 124 cols
[2020-06-02 22:29:58] [INFO ] Computed 5 place invariants in 1 ms
[2020-06-02 22:29:58] [INFO ] Export to MCC properties in file /home/mcc/execution/UpperBounds.sr.xml took 2 ms.
[2020-06-02 22:29:58] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 2 ms.
info: Time: 3600 - MCC
vrfy: Checking UpperBounds @ NeoElection-COL-5 @ 3569 seconds

FORMULA NeoElection-COL-5-UpperBounds-01 5 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA NeoElection-COL-5-UpperBounds-07 5 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA NeoElection-COL-5-UpperBounds-08 5 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA NeoElection-COL-5-UpperBounds-14 5 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA NeoElection-COL-5-UpperBounds-06 20 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA NeoElection-COL-5-UpperBounds-04 20 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 3565
rslt: Output for UpperBounds @ NeoElection-COL-5

{
"build":
{
"architecture": 64,
"assertions": false,
"build_hostname": "mcc2019",
"build_system": "x86_64-unknown-linux-gnu",
"optimizations": true,
"package_version": "2.0",
"svn_version": "3189M"
},
"call":
{
"exec_host": "mcc2020",
"markinglimit": null,
"parameters":
[
"--pnmlnet",
"model.pnml",
"--xmlformula",
"--formula=UpperBounds.xml",
"--mcc",
"--donotcomputecapacities",
"--encoder=simplecompressed",
"--check=modelchecking",
"--stubborn=tarjan",
"--timelimit=3569",
"--localtimelimit=0",
"--json=UpperBounds.json",
"--jsoninclude=formula,formulastat,net"
],
"starttime": "Tue Jun 2 22:29:59 2020
",
"timelimit": 3569
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 594
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 0,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 5,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "MAX(p103 + p104 + p105 + p106 + p107)",
"processed_size": 37,
"rewrites": 0
},
"result":
{
"edges": 1545,
"markings": 733,
"produced_by": "search",
"value": 5
},
"task":
{
"compoundnumber": 0,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "bound preserving/insertion"
},
"type": "dfs"
},
"type": "bound",
"workflow": "search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 713
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 0,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 5,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "MAX(p0 + p1 + p2 + p3 + p4)",
"processed_size": 27,
"rewrites": 0
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "search",
"value": 5
},
"task":
{
"compoundnumber": 1,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "bound preserving/insertion"
},
"type": "dfs"
},
"type": "bound",
"workflow": "search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 891
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 0,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 5,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "MAX(p0 + p1 + p2 + p3 + p4)",
"processed_size": 27,
"rewrites": 0
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "search",
"value": 5
},
"task":
{
"compoundnumber": 2,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "bound preserving/insertion"
},
"type": "dfs"
},
"type": "bound",
"workflow": "search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1188
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 0,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 5,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "MAX(p0 + p1 + p2 + p3 + p4)",
"processed_size": 27,
"rewrites": 0
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "search",
"value": 5
},
"task":
{
"compoundnumber": 3,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "bound preserving/insertion"
},
"type": "dfs"
},
"type": "bound",
"workflow": "search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1783
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 0,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 80,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 80,
"visible_transitions": 0
},
"processed": "MAX(p92 + p91 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29 + p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39 + p40 + p41 + p42 + p43 + p44 + p45 + p46 + p47 + p48 + p49 + p50 + p51 + p52 + p53 + p54 + p55 + p56 + p57 + p58 + p59 + p60 + p61 + p62 + p63 + p64 + p65 + p66 + p67 + p68 + p69 + p70 + p71 + p72 + p73 + p74 + p75 + p76 + p77 + p78 + p79 + p80 + p81 + p82 + p83 + p84 + p85 + p86 + p87 + p88 + p89 + p90)",
"processed_size": 482,
"rewrites": 0
},
"result":
{
"edges": 25,
"markings": 26,
"produced_by": "search",
"value": 20
},
"task":
{
"compoundnumber": 4,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "bound preserving/insertion"
},
"type": "dfs"
},
"type": "bound",
"workflow": "search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3566
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 0,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 80,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 80,
"visible_transitions": 0
},
"processed": "MAX(p92 + p91 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29 + p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39 + p40 + p41 + p42 + p43 + p44 + p45 + p46 + p47 + p48 + p49 + p50 + p51 + p52 + p53 + p54 + p55 + p56 + p57 + p58 + p59 + p60 + p61 + p62 + p63 + p64 + p65 + p66 + p67 + p68 + p69 + p70 + p71 + p72 + p73 + p74 + p75 + p76 + p77 + p78 + p79 + p80 + p81 + p82 + p83 + p84 + p85 + p86 + p87 + p88 + p89 + p90)",
"processed_size": 482,
"rewrites": 0
},
"result":
{
"edges": 25,
"markings": 26,
"produced_by": "search",
"value": 20
},
"task":
{
"compoundnumber": 5,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "bound preserving/insertion"
},
"type": "dfs"
},
"type": "bound",
"workflow": "search"
}
}
],
"exit":
{
"error": null,
"memory": 17496,
"runtime": 3.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "UpperBounds.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "MAX(*) : MAX(*) : MAX(*) : MAX(*) : MAX(*) : MAX(*)"
},
"net":
{
"arcs": 588,
"conflict_clusters": 40,
"places": 128,
"places_significant": 119,
"singleton_clusters": 0,
"transitions": 141
},
"result":
{
"preliminary_value": "5 20 20 5 5 5 ",
"value": "5 20 20 5 5 5 "
},
"task":
{
"type": "compound"
}
}
lola: LoLA will run for 3569 seconds at most (--timelimit)
lola: NET
lola: input: PNML file (--pnml)
lola: reading net from model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file model.pnml
lola: 269/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 4096
lola: finding significant places
lola: 128 places, 141 transitions, 119 significant places
lola: compute conflict clusters
lola: computed conflict clusters
lola: Computing conflicting sets
lola: Computing back conflicting sets
lola: TASK
lola: Reading formula in XML format (--xmlformula)
lola: reading pnml
lola: reading formula from UpperBounds.xml
lola: MAX(p103 + p104 + p105 + p106 + p107) : MAX(p92 + p91 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29 + p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39 + p40 + p41 + p42 + p43 + p44 + p45 + p46 + p47 + p48 + p49 + p50 + p51 + p52 + p53 + p54 + p55 + p56 + p57 + p58 + p59 + p60 + p61 + p62 + p63 + p64 + p65 + p66 + p67 + p68 + p69 + p70 + p71 + p72 + p73 + p74 + p75 + p76 + p77 + p78 + p79 + p80 + p81 + p82 + p83 + p84 + p85 + p86 + p87 + p88 + p89 + p90) : MAX(p92 + p91 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29 + p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39 + p40 + p41 + p42 + p43 + p44 + p45 + p46 + p47 + p48 + p49 + p50 + p51 + p52 + p53 + p54 + p55 + p56 + p57 + p58 + p59 + p60 + p61 + p62 + p63 + p64 + p65 + p66 + p67 + p68 + p69 + p70 + p71 + p72 + p73 + p74 + p75 + p76 + p77 + p78 + p79 + p80 + p81 + p82 + p83 + p84 + p85 + p86 + p87 + p88 + p89 + p90) : MAX(p0 + p1 + p2 + p3 + p4) : MAX(p0 + p1 + p2 + p3 + p4) : MAX(p0 + p1 + p2 + p3 + p4)
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 594 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(p103 + p104 + p105 + p106 + p107)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(p103 + p104 + p105 + p106 + p107)
lola: processed formula length: 37
lola: 0 rewrites
lola: closed formula file UpperBounds.xml
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: 5
lola: SUBRESULT
lola: result: 5
lola: produced by: state space
lola: The maximum value of the given expression is 5
lola: 733 markings, 1545 edges
lola: ========================================
lola: subprocess 1 will run for 713 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(p0 + p1 + p2 + p3 + p4)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(p0 + p1 + p2 + p3 + p4)
lola: processed formula length: 27
lola: 0 rewrites
lola: closed formula file UpperBounds.xml
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: 5
lola: SUBRESULT
lola: result: 5
lola: produced by: state space
lola: The maximum value of the given expression is 5
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 2 will run for 891 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(p0 + p1 + p2 + p3 + p4)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(p0 + p1 + p2 + p3 + p4)
lola: processed formula length: 27
lola: 0 rewrites
lola: closed formula file UpperBounds.xml
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: 5
lola: SUBRESULT
lola: result: 5
lola: produced by: state space
lola: The maximum value of the given expression is 5
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 3 will run for 1188 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(p0 + p1 + p2 + p3 + p4)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(p0 + p1 + p2 + p3 + p4)
lola: processed formula length: 27
lola: 0 rewrites
lola: closed formula file UpperBounds.xml
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: 5
lola: SUBRESULT
lola: result: 5
lola: produced by: state space
lola: The maximum value of the given expression is 5
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 4 will run for 1783 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(p92 + p91 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29 + p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39 + p40 + p41 + p42 + p43 + p44 + p45 + p46 + p47 + p48 + p49 + p50 + p51 + p52 + p53 + p54 + p55 + p56 + p57 + p58 + p59 + p60 + p61 + p62 + p63 + p64 + p65 + p66 + p67 + p68 + p69 + p70 + p71 + p72 + p73 + p74 + p75 + p76 + ... (shortened)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(p92 + p91 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29 + p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39 + p40 + p41 + p42 + p43 + p44 + p45 + p46 + p47 + p48 + p49 + p50 + p51 + p52 + p53 + p54 + p55 + p56 + p57 + p58 + p59 + p60 + p61 + p62 + p63 + p64 + p65 + p66 + p67 + p68 + p69 + p70 + p71 + p72 + p73 + p74 + p75 + p76 + ... (shortened)
lola: processed formula length: 482
lola: 0 rewrites
lola: closed formula file UpperBounds.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using bound preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: RUNNING
lola: Structural Bound: 20
lola: SUBRESULT
lola: result: 20
lola: produced by: state space
lola: The maximum value of the given expression is 20
lola: 26 markings, 25 edges
lola: subprocess 5 will run for 3566 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(p92 + p91 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29 + p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39 + p40 + p41 + p42 + p43 + p44 + p45 + p46 + p47 + p48 + p49 + p50 + p51 + p52 + p53 + p54 + p55 + p56 + p57 + p58 + p59 + p60 + p61 + p62 + p63 + p64 + p65 + p66 + p67 + p68 + p69 + p70 + p71 + p72 + p73 + p74 + p75 + p76 + ... (shortened)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(p92 + p91 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29 + p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39 + p40 + p41 + p42 + p43 + p44 + p45 + p46 + p47 + p48 + p49 + p50 + p51 + p52 + p53 + p54 + p55 + p56 + p57 + p58 + p59 + p60 + p61 + p62 + p63 + p64 + p65 + p66 + p67 + p68 + p69 + p70 + p71 + p72 + p73 + p74 + p75 + p76 + ... (shortened)
lola: processed formula length: 482
lola: 0 rewrites
lola: closed formula file UpperBounds.xml
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: ========================================
lola: Structural Bound: 20
lola: SUBRESULT
lola: result: 20
lola: produced by: state space
lola: The maximum value of the given expression is 20
lola: 26 markings, 25 edges
lola: RESULT
lola:
SUMMARY: 5 20 20 5 5 5
lola:
preliminary result: 5 20 20 5 5 5
lola: ========================================
lola: memory consumption: 17496 KB
lola: time consumption: 3 seconds
lola: print data as JSON (--json)
lola: writing JSON to UpperBounds.json
lola: closed JSON file UpperBounds.json
rslt: finished

--------------------
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="NeoElection-COL-5"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="itslola"
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-4028"
echo " Executing tool itslola"
echo " Input is NeoElection-COL-5, 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 r174-csrt-158987852900245"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/NeoElection-COL-5.tgz
mv NeoElection-COL-5 execution
cd execution
if [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "UpperBounds" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] || [ "UpperBounds" = "StateSpace" ]; 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
elif [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] ; then
echo "FORMULA_NAME UpperBounds"
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 ;