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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 280K
-rw-r--r-- 1 mcc users 3.8K Apr 30 13:04 CTLCardinality.txt
-rw-r--r-- 1 mcc users 18K Apr 30 13:04 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.7K Apr 30 13:04 CTLFireability.txt
-rw-r--r-- 1 mcc users 14K 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.5K Apr 30 13:04 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K 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 16K Apr 30 13:04 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.7K Apr 30 13:04 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 23K 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 17K Apr 30 13:04 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Apr 30 13:04 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K 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 108K 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-7-UpperBounds-00
FORMULA_NAME NeoElection-COL-7-UpperBounds-01
FORMULA_NAME NeoElection-COL-7-UpperBounds-02
FORMULA_NAME NeoElection-COL-7-UpperBounds-03
FORMULA_NAME NeoElection-COL-7-UpperBounds-04
FORMULA_NAME NeoElection-COL-7-UpperBounds-05
FORMULA_NAME NeoElection-COL-7-UpperBounds-06
FORMULA_NAME NeoElection-COL-7-UpperBounds-07
FORMULA_NAME NeoElection-COL-7-UpperBounds-08
FORMULA_NAME NeoElection-COL-7-UpperBounds-09
FORMULA_NAME NeoElection-COL-7-UpperBounds-10
FORMULA_NAME NeoElection-COL-7-UpperBounds-11
FORMULA_NAME NeoElection-COL-7-UpperBounds-12
FORMULA_NAME NeoElection-COL-7-UpperBounds-13
FORMULA_NAME NeoElection-COL-7-UpperBounds-14
FORMULA_NAME NeoElection-COL-7-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1591137080743

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-02 22:31:23] [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:31:23] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-02 22:31:23] [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:31:24] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 1026 ms
[2020-06-02 22:31:24] [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:31:24] [INFO ] Detected 4 constant HL places corresponding to 472 PT places.
[2020-06-02 22:31:24] [INFO ] Imported 18 HL places and 22 HL transitions for a total of 7128 PT places and 22272.0 transition bindings in 85 ms.
[2020-06-02 22:31:24] [INFO ] Computed order based on color domains.
[2020-06-02 22:31:25] [INFO ] Unfolded HLPN to a Petri net with 7128 places and 13428 transitions in 263 ms.
[2020-06-02 22:31:25] [INFO ] Unfolded HLPN properties in 1 ms.
Deduced a syphon composed of 6688 places in 43 ms
Reduce places removed 6730 places and 12818 transitions.
Reduce places removed 15 places and 0 transitions.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 441 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:31:25] [INFO ] Flatten gal took : 212 ms
FORMULA NeoElection-COL-7-UpperBounds-14 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NeoElection-COL-7-UpperBounds-11 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NeoElection-COL-7-UpperBounds-09 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NeoElection-COL-7-UpperBounds-07 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NeoElection-COL-7-UpperBounds-06 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NeoElection-COL-7-UpperBounds-05 42 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NeoElection-COL-7-UpperBounds-04 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NeoElection-COL-7-UpperBounds-01 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NeoElection-COL-7-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:31:25] [INFO ] Flow matrix only has 574 transitions (discarded 36 similar events)
// Phase 1: matrix 574 rows 383 cols
[2020-06-02 22:31:25] [INFO ] Computed 104 place invariants in 62 ms
Support contains 231 out of 383 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 383/383 places, 610/610 transitions.
Discarding 42 places :
Also discarding 0 output transitions
Graph (complete) has 1310 edges and 383 vertex of which 341 are kept as prefixes of interest. Removing 42 places using SCC suffix rule.25 ms
Symmetric choice reduction at 0 with 35 rule applications. Total rules 36 place count 341 transition count 610
Deduced a syphon composed of 35 places in 0 ms
Reduce places removed 35 places and 315 transitions.
Iterating global reduction 0 with 70 rules applied. Total rules applied 106 place count 306 transition count 295
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 0 with 14 rules applied. Total rules applied 120 place count 299 transition count 288
Applied a total of 120 rules in 67 ms. Remains 299 /383 variables (removed 84) and now considering 288/610 (removed 322) transitions.
Finished structural reductions, in 1 iterations. Remains : 299/383 places, 288/610 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:31:25] [INFO ] Flow matrix only has 252 transitions (discarded 36 similar events)
// Phase 1: matrix 252 rows 299 cols
[2020-06-02 22:31:25] [INFO ] Computed 62 place invariants in 8 ms
Support contains 231 out of 299 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 299/299 places, 288/288 transitions.
Applied a total of 0 rules in 10 ms. Remains 299 /299 variables (removed 0) and now considering 288/288 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 299/299 places, 288/288 transitions.
Starting structural reductions, iteration 0 : 299/299 places, 288/288 transitions.
Applied a total of 0 rules in 9 ms. Remains 299 /299 variables (removed 0) and now considering 288/288 (removed 0) transitions.
[2020-06-02 22:31:25] [INFO ] Flow matrix only has 252 transitions (discarded 36 similar events)
// Phase 1: matrix 252 rows 299 cols
[2020-06-02 22:31:25] [INFO ] Computed 62 place invariants in 7 ms
[2020-06-02 22:31:26] [INFO ] Implicit Places using invariants in 526 ms returned [19, 20, 21, 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]
Discarding 49 places :
Implicit Place search using SMT only with invariants took 538 ms to find 49 implicit places.
[2020-06-02 22:31:26] [INFO ] Redundant transitions in 18 ms returned []
[2020-06-02 22:31:26] [INFO ] Flow matrix only has 252 transitions (discarded 36 similar events)
// Phase 1: matrix 252 rows 250 cols
[2020-06-02 22:31:26] [INFO ] Computed 13 place invariants in 4 ms
[2020-06-02 22:31:26] [INFO ] Dead Transitions using invariants and state equation in 430 ms returned []
Starting structural reductions, iteration 1 : 250/299 places, 288/288 transitions.
Applied a total of 0 rules in 9 ms. Remains 250 /250 variables (removed 0) and now considering 288/288 (removed 0) transitions.
[2020-06-02 22:31:27] [INFO ] Redundant transitions in 4 ms returned []
[2020-06-02 22:31:27] [INFO ] Flow matrix only has 252 transitions (discarded 36 similar events)
// Phase 1: matrix 252 rows 250 cols
[2020-06-02 22:31:27] [INFO ] Computed 13 place invariants in 2 ms
[2020-06-02 22:31:27] [INFO ] Dead Transitions using invariants and state equation in 354 ms returned []
Finished structural reductions, in 2 iterations. Remains : 250/299 places, 288/288 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:31:27] [INFO ] Flow matrix only has 252 transitions (discarded 36 similar events)
// Phase 1: matrix 252 rows 250 cols
[2020-06-02 22:31:27] [INFO ] Computed 13 place invariants in 2 ms
Support contains 231 out of 250 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 250/250 places, 288/288 transitions.
Applied a total of 0 rules in 8 ms. Remains 250 /250 variables (removed 0) and now considering 288/288 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 250/250 places, 288/288 transitions.
Starting structural reductions, iteration 0 : 250/250 places, 288/288 transitions.
Applied a total of 0 rules in 9 ms. Remains 250 /250 variables (removed 0) and now considering 288/288 (removed 0) transitions.
[2020-06-02 22:31:27] [INFO ] Flow matrix only has 252 transitions (discarded 36 similar events)
// Phase 1: matrix 252 rows 250 cols
[2020-06-02 22:31:27] [INFO ] Computed 13 place invariants in 2 ms
[2020-06-02 22:31:27] [INFO ] Implicit Places using invariants in 86 ms returned []
[2020-06-02 22:31:27] [INFO ] Flow matrix only has 252 transitions (discarded 36 similar events)
// Phase 1: matrix 252 rows 250 cols
[2020-06-02 22:31:27] [INFO ] Computed 13 place invariants in 2 ms
[2020-06-02 22:31:27] [INFO ] State equation strengthened by 57 read => feed constraints.
[2020-06-02 22:31:27] [INFO ] Implicit Places using invariants and state equation in 377 ms returned []
Implicit Place search using SMT with State Equation took 467 ms to find 0 implicit places.
[2020-06-02 22:31:27] [INFO ] Redundant transitions in 5 ms returned []
[2020-06-02 22:31:27] [INFO ] Flow matrix only has 252 transitions (discarded 36 similar events)
// Phase 1: matrix 252 rows 250 cols
[2020-06-02 22:31:27] [INFO ] Computed 13 place invariants in 3 ms
[2020-06-02 22:31:28] [INFO ] Dead Transitions using invariants and state equation in 290 ms returned []
Finished structural reductions, in 1 iterations. Remains : 250/250 places, 288/288 transitions.
Finished random walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Discarding 6 places :
Also discarding 0 output transitions
Graph (complete) has 571 edges and 250 vertex of which 244 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.2 ms
Ensure Unique test removed 36 transitions
Reduce isomorphic transitions removed 36 transitions.
Iterating post reduction 0 with 36 rules applied. Total rules applied 37 place count 244 transition count 252
Applied a total of 37 rules in 7 ms. Remains 244 /250 variables (removed 6) and now considering 252/288 (removed 36) transitions.
// Phase 1: matrix 252 rows 244 cols
[2020-06-02 22:31:28] [INFO ] Computed 7 place invariants in 2 ms
[2020-06-02 22:31:28] [INFO ] Export to MCC properties in file /home/mcc/execution/UpperBounds.sr.xml took 2 ms.
[2020-06-02 22:31:28] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 8 ms.
info: Time: 3600 - MCC
vrfy: Checking UpperBounds @ NeoElection-COL-7 @ 3570 seconds

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

FORMULA NeoElection-COL-7-UpperBounds-10 7 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA NeoElection-COL-7-UpperBounds-12 7 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA NeoElection-COL-7-UpperBounds-13 7 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA NeoElection-COL-7-UpperBounds-02 7 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA NeoElection-COL-7-UpperBounds-15 7 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA NeoElection-COL-7-UpperBounds-03 42 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 3566
rslt: Output for UpperBounds @ NeoElection-COL-7

{
"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:31:28 2020
",
"timelimit": 3570
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 509
},
"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": 7,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 7,
"visible_transitions": 0
},
"processed": "MAX(p0 + p1 + p2 + p3 + p4 + p5 + p6)",
"processed_size": 37,
"rewrites": 0
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "search",
"value": 7
},
"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": 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": 7,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 7,
"visible_transitions": 0
},
"processed": "MAX(p0 + p1 + p2 + p3 + p4 + p5 + p6)",
"processed_size": 37,
"rewrites": 0
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "search",
"value": 7
},
"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": 713
},
"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": 7,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 7,
"visible_transitions": 0
},
"processed": "MAX(p0 + p1 + p2 + p3 + p4 + p5 + p6)",
"processed_size": 37,
"rewrites": 0
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "search",
"value": 7
},
"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": 891
},
"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": 7,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 7,
"visible_transitions": 0
},
"processed": "MAX(p187 + p188 + p189 + p190 + p191 + p192 + p193)",
"processed_size": 51,
"rewrites": 0
},
"result":
{
"edges": 315,
"markings": 316,
"produced_by": "search",
"value": 7
},
"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": 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": 0,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 49,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 49,
"visible_transitions": 0
},
"processed": "MAX(p201 + p202 + p203 + p204 + p205 + p206 + p208 + p209 + p210 + p211 + p212 + p213 + p215 + p216 + p217 + p218 + p219 + p220 + p222 + p223 + p224 + p225 + p226 + p227 + p229 + p230 + p231 + p232 + p233 + p234 + p236 + p237 + p238 + p239 + p240 + p241 + p243 + p244 + p245 + p246 + p247 + p248 + p249 + p242 + p235 + p228 + p221 + p214 + p207)",
"processed_size": 345,
"rewrites": 0
},
"result":
{
"edges": 7,
"markings": 8,
"produced_by": "search",
"value": 7
},
"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": 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": 49,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 49,
"visible_transitions": 0
},
"processed": "MAX(p201 + p202 + p203 + p204 + p205 + p206 + p208 + p209 + p210 + p211 + p212 + p213 + p215 + p216 + p217 + p218 + p219 + p220 + p222 + p223 + p224 + p225 + p226 + p227 + p229 + p230 + p231 + p232 + p233 + p234 + p236 + p237 + p238 + p239 + p240 + p241 + p243 + p244 + p245 + p246 + p247 + p248 + p249 + p242 + p235 + p228 + p221 + p214 + p207)",
"processed_size": 345,
"rewrites": 0
},
"result":
{
"edges": 7,
"markings": 8,
"produced_by": "search",
"value": 7
},
"task":
{
"compoundnumber": 5,
"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": 168,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 168,
"visible_transitions": 0
},
"processed": "MAX(p99 + p100 + p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109 + p110 + p111 + p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119 + p120 + p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128 + p129 + p130 + p131 + p132 + p133 + p134 + p135 + p136 + p137 + p138 + p139 + p140 + p141 + p142 + p143 + p144 + p145 + p146 + p147 + p148 + p149 + p150 + p151 + p152 + p153 + p154 + p155 + p156 + p157 + p158 + p159 + p160 + p161 + p162 + p163 + p164 + p165 + p166 + p167 + p168 + p169 + p170 + p171 + p172 + p173 + p174 + p175 + p176 + p177 + p178 + p179 + p180 + p181 + p182 + p183 + p184 + p185 + p186 + p98 + p97 + p96 + p95 + p94 + p93 + p92 + p91 + p90 + p89 + p88 + p87 + 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)",
"processed_size": 1097,
"rewrites": 0
},
"result":
{
"edges": 49,
"markings": 50,
"produced_by": "search",
"value": 42
},
"task":
{
"compoundnumber": 6,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "bound preserving/insertion"
},
"type": "dfs"
},
"type": "bound",
"workflow": "search"
}
}
],
"exit":
{
"error": null,
"memory": 18876,
"runtime": 4.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "UpperBounds.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "MAX(*) : MAX(*) : MAX(*) : MAX(*) : MAX(*) : MAX(*) : MAX(*)"
},
"net":
{
"arcs": 1233,
"conflict_clusters": 70,
"places": 250,
"places_significant": 237,
"singleton_clusters": 0,
"transitions": 288
},
"result":
{
"preliminary_value": "7 42 7 7 7 7 7 ",
"value": "7 42 7 7 7 7 7 "
},
"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: 538/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 8000
lola: finding significant places
lola: 250 places, 288 transitions, 237 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(p201 + p202 + p203 + p204 + p205 + p206 + p208 + p209 + p210 + p211 + p212 + p213 + p215 + p216 + p217 + p218 + p219 + p220 + p222 + p223 + p224 + p225 + p226 + p227 + p229 + p230 + p231 + p232 + p233 + p234 + p236 + p237 + p238 + p239 + p240 + p241 + p243 + p244 + p245 + p246 + p247 + p248 + p249 + p242 + p235 + p228 + p221 + p214 + p207) : MAX(p99 + p100 + p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109 + p110 + p111 + p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119 + p120 + p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128 + p129 + p130 + p131 + p132 + p133 + p134 + p135 + p136 + p137 + p138 + p139 + p140 + p141 + p142 + p143 + p144 + p145 + p146 + p147 + p148 + p149 + p150 + p151 + p152 + p153 + p154 + p155 + p156 + p157 + p158 + p159 + p160 + p161 + p162 + p163 + p164 + p165 + p166 + p167 + p168 + p169 + p170 + p171 + p172 + p173 + p174 + p175 + p176 + p177 + p178 + p179 + p180 + p181 + p182 + p183 + p184 + p185 + p186 + p98 + p97 + p96 + p95 + p94 + p93 + p92 + p91 + p90 + p89 + p88 + p87 + 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) : MAX(p0 + p1 + p2 + p3 + p4 + p5 + p6) : MAX(p0 + p1 + p2 + p3 + p4 + p5 + p6) : MAX(p0 + p1 + p2 + p3 + p4 + p5 + p6) : MAX(p187 + p188 + p189 + p190 + p191 + p192 + p193) : MAX(p201 + p202 + p203 + p204 + p205 + p206 + p208 + p209 + p210 + p211 + p212 + p213 + p215 + p216 + p217 + p218 + p219 + p220 + p222 + p223 + p224 + p225 + p226 + p227 + p229 + p230 + p231 + p232 + p233 + p234 + p236 + p237 + p238 + p239 + p240 + p241 + p243 + p244 + p245 + p246 + p247 + p248 + p249 + p242 + p235 + p228 + p221 + p214 + p207)
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 509 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(p0 + p1 + p2 + p3 + p4 + p5 + p6)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(p0 + p1 + p2 + p3 + p4 + p5 + p6)
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: 7
lola: SUBRESULT
lola: result: 7
lola: produced by: state space
lola: The maximum value of the given expression is 7
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 1 will run for 594 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(p0 + p1 + p2 + p3 + p4 + p5 + p6)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(p0 + p1 + p2 + p3 + p4 + p5 + p6)
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: 7
lola: SUBRESULT
lola: result: 7
lola: produced by: state space
lola: The maximum value of the given expression is 7
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 2 will run for 713 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(p0 + p1 + p2 + p3 + p4 + p5 + p6)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(p0 + p1 + p2 + p3 + p4 + p5 + p6)
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: 7
lola: SUBRESULT
lola: result: 7
lola: produced by: state space
lola: The maximum value of the given expression is 7
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 3 will run for 891 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(p187 + p188 + p189 + p190 + p191 + p192 + p193)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(p187 + p188 + p189 + p190 + p191 + p192 + p193)
lola: processed formula length: 51
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: 7
lola: SUBRESULT
lola: result: 7
lola: produced by: state space
lola: The maximum value of the given expression is 7
lola: 316 markings, 315 edges
lola: ========================================
lola: subprocess 4 will run for 1189 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(p201 + p202 + p203 + p204 + p205 + p206 + p208 + p209 + p210 + p211 + p212 + p213 + p215 + p216 + p217 + p218 + p219 + p220 + p222 + p223 + p224 + p225 + p226 + p227 + p229 + p230 + p231 + p232 + p233 + p234 + p236 + p237 + p238 + p239 + p240 + p241 + p243 + p244 + p245 + p246 + p247 + p248 + p249 + p242 + p235 + p228 + p221 + p214 + p207)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(p201 + p202 + p203 + p204 + p205 + p206 + p208 + p209 + p210 + p211 + p212 + p213 + p215 + p216 + p217 + p218 + p219 + p220 + p222 + p223 + p224 + p225 + p226 + p227 + p229 + p230 + p231 + p232 + p233 + p234 + p236 + p237 + p238 + p239 + p240 + p241 + p243 + p244 + p245 + p246 + p247 + p248 + p249 + p242 + p235 + p228 + p221 + p214 + p207)
lola: processed formula length: 345
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: 7
lola: SUBRESULT
lola: result: 7
lola: produced by: state space
lola: The maximum value of the given expression is 7
lola: 8 markings, 7 edges
lola: ========================================
lola: subprocess 5 will run for 1783 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(p201 + p202 + p203 + p204 + p205 + p206 + p208 + p209 + p210 + p211 + p212 + p213 + p215 + p216 + p217 + p218 + p219 + p220 + p222 + p223 + p224 + p225 + p226 + p227 + p229 + p230 + p231 + p232 + p233 + p234 + p236 + p237 + p238 + p239 + p240 + p241 + p243 + p244 + p245 + p246 + p247 + p248 + p249 + p242 + p235 + p228 + p221 + p214 + p207)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(p201 + p202 + p203 + p204 + p205 + p206 + p208 + p209 + p210 + p211 + p212 + p213 + p215 + p216 + p217 + p218 + p219 + p220 + p222 + p223 + p224 + p225 + p226 + p227 + p229 + p230 + p231 + p232 + p233 + p234 + p236 + p237 + p238 + p239 + p240 + p241 + p243 + p244 + p245 + p246 + p247 + p248 + p249 + p242 + p235 + p228 + p221 + p214 + p207)
lola: processed formula length: 345
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: 7
lola: SUBRESULT
lola: result: 7
lola: produced by: state space
lola: The maximum value of the given expression is 7
lola: 8 markings, 7 edges
lola: ========================================
lola: subprocess 6 will run for 3566 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(p99 + p100 + p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109 + p110 + p111 + p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119 + p120 + p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128 + p129 + p130 + p131 + p132 + p133 + p134 + p135 + p136 + p137 + p138 + p139 + p140 + p141 + p142 + p143 + p144 + p145 + p146 + p147 + p148 + p149 + p150 + p151 + p152 + p153 + p154 + p155 ... (shortened)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(p99 + p100 + p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109 + p110 + p111 + p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119 + p120 + p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128 + p129 + p130 + p131 + p132 + p133 + p134 + p135 + p136 + p137 + p138 + p139 + p140 + p141 + p142 + p143 + p144 + p145 + p146 + p147 + p148 + p149 + p150 + p151 + p152 + p153 + p154 + p155 ... (shortened)
lola: processed formula length: 1097
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: 42
lola: SUBRESULT
lola: result: 42
lola: produced by: state space
lola: The maximum value of the given expression is 42
lola: 50 markings, 49 edges
lola: ========================================
lola: RESULT
lola:
SUMMARY: 7 42 7 7 7 7 7
lola:
preliminary result: 7 42 7 7 7 7 7
lola: memory consumption: 18876 KB
lola: time consumption: 4 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-7"
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-7, 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-158987852900261"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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