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-158987852900269.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-8, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r174-csrt-158987852900269
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 292K
-rw-r--r-- 1 mcc users 3.3K Apr 30 13:04 CTLCardinality.txt
-rw-r--r-- 1 mcc users 16K Apr 30 13:04 CTLCardinality.xml
-rw-r--r-- 1 mcc users 3.1K Apr 30 13:04 CTLFireability.txt
-rw-r--r-- 1 mcc users 18K 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.9K Apr 30 13:04 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 30 13:04 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K 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 4.1K Apr 30 13:04 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 19K Apr 30 13:04 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.6K Apr 30 13:04 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 18K 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 120K 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-8-UpperBounds-00
FORMULA_NAME NeoElection-COL-8-UpperBounds-01
FORMULA_NAME NeoElection-COL-8-UpperBounds-02
FORMULA_NAME NeoElection-COL-8-UpperBounds-03
FORMULA_NAME NeoElection-COL-8-UpperBounds-04
FORMULA_NAME NeoElection-COL-8-UpperBounds-05
FORMULA_NAME NeoElection-COL-8-UpperBounds-06
FORMULA_NAME NeoElection-COL-8-UpperBounds-07
FORMULA_NAME NeoElection-COL-8-UpperBounds-08
FORMULA_NAME NeoElection-COL-8-UpperBounds-09
FORMULA_NAME NeoElection-COL-8-UpperBounds-10
FORMULA_NAME NeoElection-COL-8-UpperBounds-11
FORMULA_NAME NeoElection-COL-8-UpperBounds-12
FORMULA_NAME NeoElection-COL-8-UpperBounds-13
FORMULA_NAME NeoElection-COL-8-UpperBounds-14
FORMULA_NAME NeoElection-COL-8-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1591137148236

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-02 22:32:30] [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:32:30] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-02 22:32:31] [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:32:32] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 1181 ms
[2020-06-02 22:32:32] [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:32:32] [INFO ] Detected 4 constant HL places corresponding to 675 PT places.
[2020-06-02 22:32:32] [INFO ] Imported 18 HL places and 22 HL transitions for a total of 10062 PT places and 34578.0 transition bindings in 88 ms.
[2020-06-02 22:32:32] [INFO ] Computed order based on color domains.
[2020-06-02 22:32:32] [INFO ] Unfolded HLPN to a Petri net with 10062 places and 21244 transitions in 337 ms.
[2020-06-02 22:32:32] [INFO ] Unfolded HLPN properties in 1 ms.
Deduced a syphon composed of 9487 places in 76 ms
Reduce places removed 9543 places and 20351 transitions.
Reduce places removed 17 places and 0 transitions.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 643 ms.
Finished random walk after 0 steps, including 0 resets, run visited all 0 properties in 2 ms. (steps per millisecond=0 )
[2020-06-02 22:32:33] [INFO ] Flatten gal took : 237 ms
FORMULA NeoElection-COL-8-UpperBounds-15 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NeoElection-COL-8-UpperBounds-14 64 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NeoElection-COL-8-UpperBounds-12 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NeoElection-COL-8-UpperBounds-10 8 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NeoElection-COL-8-UpperBounds-09 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NeoElection-COL-8-UpperBounds-08 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NeoElection-COL-8-UpperBounds-07 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NeoElection-COL-8-UpperBounds-05 8 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NeoElection-COL-8-UpperBounds-04 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NeoElection-COL-8-UpperBounds-03 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NeoElection-COL-8-UpperBounds-02 56 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NeoElection-COL-8-UpperBounds-01 8 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NeoElection-COL-8-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:32:33] [INFO ] Flow matrix only has 844 transitions (discarded 49 similar events)
// Phase 1: matrix 844 rows 502 cols
[2020-06-02 22:32:33] [INFO ] Computed 135 place invariants in 64 ms
Support contains 16 out of 502 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 502/502 places, 893/893 transitions.
Discarding 56 places :
Also discarding 0 output transitions
Graph (complete) has 1797 edges and 502 vertex of which 446 are kept as prefixes of interest. Removing 56 places using SCC suffix rule.40 ms
Symmetric choice reduction at 0 with 98 rule applications. Total rules 99 place count 446 transition count 893
Deduced a syphon composed of 98 places in 2 ms
Reduce places removed 98 places and 575 transitions.
Iterating global reduction 0 with 196 rules applied. Total rules applied 295 place count 348 transition count 318
Partial Free-agglomeration rule applied 7 times.
Drop transitions removed 7 transitions
Iterating global reduction 0 with 7 rules applied. Total rules applied 302 place count 348 transition count 318
Applied a total of 302 rules in 186 ms. Remains 348 /502 variables (removed 154) and now considering 318/893 (removed 575) transitions.
Finished structural reductions, in 1 iterations. Remains : 348/502 places, 318/893 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:32:33] [INFO ] Flow matrix only has 269 transitions (discarded 49 similar events)
// Phase 1: matrix 269 rows 348 cols
[2020-06-02 22:32:33] [INFO ] Computed 79 place invariants in 14 ms
Support contains 16 out of 348 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 348/348 places, 318/318 transitions.
Applied a total of 0 rules in 23 ms. Remains 348 /348 variables (removed 0) and now considering 318/318 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 348/348 places, 318/318 transitions.
Starting structural reductions, iteration 0 : 348/348 places, 318/318 transitions.
Applied a total of 0 rules in 17 ms. Remains 348 /348 variables (removed 0) and now considering 318/318 (removed 0) transitions.
[2020-06-02 22:32:33] [INFO ] Flow matrix only has 269 transitions (discarded 49 similar events)
// Phase 1: matrix 269 rows 348 cols
[2020-06-02 22:32:33] [INFO ] Computed 79 place invariants in 9 ms
[2020-06-02 22:32:34] [INFO ] Implicit Places using invariants in 1141 ms returned [22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 82, 83, 84, 85]
Discarding 64 places :
Implicit Place search using SMT only with invariants took 1146 ms to find 64 implicit places.
[2020-06-02 22:32:34] [INFO ] Redundant transitions in 15 ms returned []
[2020-06-02 22:32:34] [INFO ] Flow matrix only has 269 transitions (discarded 49 similar events)
// Phase 1: matrix 269 rows 284 cols
[2020-06-02 22:32:35] [INFO ] Computed 15 place invariants in 2 ms
[2020-06-02 22:32:35] [INFO ] Dead Transitions using invariants and state equation in 498 ms returned []
Starting structural reductions, iteration 1 : 284/348 places, 318/318 transitions.
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 284 transition count 310
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 16 place count 276 transition count 310
Performed 48 Post agglomeration using F-continuation condition.Transition count delta: 48
Deduced a syphon composed of 48 places in 1 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 2 with 96 rules applied. Total rules applied 112 place count 228 transition count 262
Applied a total of 112 rules in 55 ms. Remains 228 /284 variables (removed 56) and now considering 262/318 (removed 56) transitions.
[2020-06-02 22:32:35] [INFO ] Flow matrix only has 213 transitions (discarded 49 similar events)
// Phase 1: matrix 213 rows 228 cols
[2020-06-02 22:32:35] [INFO ] Computed 15 place invariants in 3 ms
[2020-06-02 22:32:35] [INFO ] Implicit Places using invariants in 339 ms returned []
[2020-06-02 22:32:35] [INFO ] Flow matrix only has 213 transitions (discarded 49 similar events)
// Phase 1: matrix 213 rows 228 cols
[2020-06-02 22:32:35] [INFO ] Computed 15 place invariants in 1 ms
[2020-06-02 22:32:36] [INFO ] State equation strengthened by 56 read => feed constraints.
[2020-06-02 22:32:36] [INFO ] Implicit Places using invariants and state equation in 1056 ms returned []
Implicit Place search using SMT with State Equation took 1400 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 228/348 places, 262/318 transitions.
Finished random walk after 0 steps, including 0 resets, run visited all 0 properties in 2 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:32:36] [INFO ] Flow matrix only has 213 transitions (discarded 49 similar events)
// Phase 1: matrix 213 rows 228 cols
[2020-06-02 22:32:36] [INFO ] Computed 15 place invariants in 1 ms
Support contains 16 out of 228 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 228/228 places, 262/262 transitions.
Applied a total of 0 rules in 33 ms. Remains 228 /228 variables (removed 0) and now considering 262/262 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 228/228 places, 262/262 transitions.
Starting structural reductions, iteration 0 : 228/228 places, 262/262 transitions.
Applied a total of 0 rules in 12 ms. Remains 228 /228 variables (removed 0) and now considering 262/262 (removed 0) transitions.
[2020-06-02 22:32:37] [INFO ] Flow matrix only has 213 transitions (discarded 49 similar events)
// Phase 1: matrix 213 rows 228 cols
[2020-06-02 22:32:37] [INFO ] Computed 15 place invariants in 1 ms
[2020-06-02 22:32:37] [INFO ] Implicit Places using invariants in 387 ms returned []
[2020-06-02 22:32:37] [INFO ] Flow matrix only has 213 transitions (discarded 49 similar events)
// Phase 1: matrix 213 rows 228 cols
[2020-06-02 22:32:37] [INFO ] Computed 15 place invariants in 2 ms
[2020-06-02 22:32:37] [INFO ] State equation strengthened by 56 read => feed constraints.
[2020-06-02 22:32:38] [INFO ] Implicit Places using invariants and state equation in 944 ms returned []
Implicit Place search using SMT with State Equation took 1343 ms to find 0 implicit places.
[2020-06-02 22:32:38] [INFO ] Redundant transitions in 24 ms returned []
[2020-06-02 22:32:38] [INFO ] Flow matrix only has 213 transitions (discarded 49 similar events)
// Phase 1: matrix 213 rows 228 cols
[2020-06-02 22:32:38] [INFO ] Computed 15 place invariants in 1 ms
[2020-06-02 22:32:38] [INFO ] Dead Transitions using invariants and state equation in 226 ms returned []
Finished structural reductions, in 1 iterations. Remains : 228/228 places, 262/262 transitions.
Finished random walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Discarding 7 places :
Also discarding 0 output transitions
Graph (complete) has 641 edges and 228 vertex of which 221 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.1 ms
Ensure Unique test removed 49 transitions
Reduce isomorphic transitions removed 49 transitions.
Iterating post reduction 0 with 49 rules applied. Total rules applied 50 place count 221 transition count 213
Partial Free-agglomeration rule applied 14 times.
Drop transitions removed 14 transitions
Iterating global reduction 1 with 14 rules applied. Total rules applied 64 place count 221 transition count 213
Applied a total of 64 rules in 23 ms. Remains 221 /228 variables (removed 7) and now considering 213/262 (removed 49) transitions.
// Phase 1: matrix 213 rows 221 cols
[2020-06-02 22:32:38] [INFO ] Computed 8 place invariants in 1 ms
[2020-06-02 22:32:38] [INFO ] Export to MCC properties in file /home/mcc/execution/UpperBounds.sr.xml took 1 ms.
[2020-06-02 22:32:38] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 10 ms.
info: Time: 3600 - MCC
vrfy: Checking UpperBounds @ NeoElection-COL-8 @ 3570 seconds

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

FORMULA NeoElection-COL-8-UpperBounds-11 8 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA NeoElection-COL-8-UpperBounds-13 8 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 3567
rslt: Output for UpperBounds @ NeoElection-COL-8

{
"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=3570",
"--localtimelimit=0",
"--json=UpperBounds.json",
"--jsoninclude=formula,formulastat,net"
],
"starttime": "Tue Jun 2 22:32:39 2020
",
"timelimit": 3570
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1189
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": -1,
"cont": 1,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 0,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 0,
"visible_transitions": 0
},
"processed": "MAX(p227 + p226 + p225 + p224 + p223 + p222 + p221 + p220)",
"processed_size": 58,
"rewrites": 0
},
"result":
{
"edges": 16,
"markings": 17,
"produced_by": "search",
"value": 8
},
"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": 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": 8,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 8,
"visible_transitions": 0
},
"processed": "MAX(p227 + p226 + p225 + p224 + p223 + p222 + p221 + p220)",
"processed_size": 58,
"rewrites": 0
},
"result":
{
"edges": 16,
"markings": 17,
"produced_by": "search",
"value": 8
},
"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": 3567
},
"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": 8,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 8,
"visible_transitions": 0
},
"processed": "MAX(p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7)",
"processed_size": 42,
"rewrites": 0
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "search",
"value": 8
},
"task":
{
"compoundnumber": 2,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "bound preserving/insertion"
},
"type": "dfs"
},
"type": "bound",
"workflow": "search"
}
}
],
"exit":
{
"error": null,
"memory": 17576,
"runtime": 3.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "UpperBounds.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "MAX(*) : MAX(*) : MAX(*)"
},
"net":
{
"arcs": 1259,
"conflict_clusters": 32,
"places": 228,
"places_significant": 213,
"singleton_clusters": 0,
"transitions": 262
},
"result":
{
"preliminary_value": "8 8 8 ",
"value": "8 8 8 "
},
"task":
{
"type": "compound"
}
}
lola: LoLA will run for 3570 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: 490/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 7296
lola: finding significant places
lola: 228 places, 262 transitions, 213 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(p227 + p226 + p225 + p224 + p223 + p222 + p221 + p220) : MAX(p227 + p226 + p225 + p224 + p223 + p222 + p221 + p220) : MAX(p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7)
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 1189 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(p227 + p226 + p225 + p224 + p223 + p222 + p221 + p220)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(p227 + p226 + p225 + p224 + p223 + p222 + p221 + p220)
lola: processed formula length: 58
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: 8
lola: SUBRESULT
lola: result: 8
lola: produced by: state space
lola: The maximum value of the given expression is 8
lola: 17 markings, 16 edges
lola: ========================================
lola: subprocess 1 will run for 1783 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(p227 + p226 + p225 + p224 + p223 + p222 + p221 + p220)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(p227 + p226 + p225 + p224 + p223 + p222 + p221 + p220)
lola: processed formula length: 58
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: 8
lola: SUBRESULT
lola: result: 8
lola: produced by: state space
lola: The maximum value of the given expression is 8
lola: 17 markings, 16 edges
lola: ========================================
lola: subprocess 2 will run for 3567 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7)
lola: processed formula length: 42
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: 8
lola: SUBRESULT
lola: result: 8
lola: produced by: state space
lola: The maximum value of the given expression is 8
lola: 0 markings, 0 edges
lola: ========================================
lola: RESULT
lola:
SUMMARY: 8 8 8
lola:
preliminary result: 8 8 8
lola: memory consumption: 17576 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-8"
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-8, 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-158987852900269"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/NeoElection-COL-8.tgz
mv NeoElection-COL-8 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 ;