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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 248K
-rw-r--r-- 1 mcc users 3.8K Apr 30 13:04 CTLCardinality.txt
-rw-r--r-- 1 mcc users 19K Apr 30 13:04 CTLCardinality.xml
-rw-r--r-- 1 mcc users 3.2K Apr 30 13:04 CTLFireability.txt
-rw-r--r-- 1 mcc users 19K 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.8K 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.5K Apr 30 13:04 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 30 13:04 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.3K Apr 30 13:04 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 20K 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 75K 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-3-UpperBounds-00
FORMULA_NAME NeoElection-COL-3-UpperBounds-01
FORMULA_NAME NeoElection-COL-3-UpperBounds-02
FORMULA_NAME NeoElection-COL-3-UpperBounds-03
FORMULA_NAME NeoElection-COL-3-UpperBounds-04
FORMULA_NAME NeoElection-COL-3-UpperBounds-05
FORMULA_NAME NeoElection-COL-3-UpperBounds-06
FORMULA_NAME NeoElection-COL-3-UpperBounds-07
FORMULA_NAME NeoElection-COL-3-UpperBounds-08
FORMULA_NAME NeoElection-COL-3-UpperBounds-09
FORMULA_NAME NeoElection-COL-3-UpperBounds-10
FORMULA_NAME NeoElection-COL-3-UpperBounds-11
FORMULA_NAME NeoElection-COL-3-UpperBounds-12
FORMULA_NAME NeoElection-COL-3-UpperBounds-13
FORMULA_NAME NeoElection-COL-3-UpperBounds-14
FORMULA_NAME NeoElection-COL-3-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1591135684536

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-02 22:08:08] [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:08:08] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-02 22:08:08] [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:08:09] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 1536 ms
[2020-06-02 22:08:09] [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:08:09] [INFO ] Detected 4 constant HL places corresponding to 60 PT places.
[2020-06-02 22:08:09] [INFO ] Imported 18 HL places and 22 HL transitions for a total of 972 PT places and 1808.0 transition bindings in 53 ms.
[2020-06-02 22:08:09] [INFO ] Computed order based on color domains.
[2020-06-02 22:08:10] [INFO ] Unfolded HLPN to a Petri net with 972 places and 964 transitions in 92 ms.
[2020-06-02 22:08:10] [INFO ] Unfolded HLPN properties in 2 ms.
Deduced a syphon composed of 892 places in 3 ms
Reduce places removed 898 places and 906 transitions.
Reduce places removed 7 places and 0 transitions.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 137 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:08:10] [INFO ] Flatten gal took : 58 ms
FORMULA NeoElection-COL-3-UpperBounds-15 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NeoElection-COL-3-UpperBounds-14 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NeoElection-COL-3-UpperBounds-13 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NeoElection-COL-3-UpperBounds-11 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NeoElection-COL-3-UpperBounds-09 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NeoElection-COL-3-UpperBounds-08 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NeoElection-COL-3-UpperBounds-06 9 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NeoElection-COL-3-UpperBounds-03 3 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NeoElection-COL-3-UpperBounds-01 3 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:08:10] [INFO ] Flow matrix only has 54 transitions (discarded 4 similar events)
// Phase 1: matrix 54 rows 67 cols
[2020-06-02 22:08:10] [INFO ] Computed 20 place invariants in 6 ms
Support contains 39 out of 67 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 67/67 places, 58/58 transitions.
Discarding 6 places :
Also discarding 0 output transitions
Graph (complete) has 172 edges and 67 vertex of which 61 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.6 ms
Symmetric choice reduction at 0 with 3 rule applications. Total rules 4 place count 61 transition count 58
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 9 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 10 place count 58 transition count 49
Applied a total of 10 rules in 61 ms. Remains 58 /67 variables (removed 9) and now considering 49/58 (removed 9) transitions.
Finished structural reductions, in 1 iterations. Remains : 58/67 places, 49/58 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:08:10] [INFO ] Flow matrix only has 45 transitions (discarded 4 similar events)
// Phase 1: matrix 45 rows 58 cols
[2020-06-02 22:08:10] [INFO ] Computed 14 place invariants in 38 ms
Support contains 39 out of 58 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 58/58 places, 49/49 transitions.
Applied a total of 0 rules in 3 ms. Remains 58 /58 variables (removed 0) and now considering 49/49 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 58/58 places, 49/49 transitions.
Starting structural reductions, iteration 0 : 58/58 places, 49/49 transitions.
Applied a total of 0 rules in 3 ms. Remains 58 /58 variables (removed 0) and now considering 49/49 (removed 0) transitions.
[2020-06-02 22:08:10] [INFO ] Flow matrix only has 45 transitions (discarded 4 similar events)
// Phase 1: matrix 45 rows 58 cols
[2020-06-02 22:08:10] [INFO ] Computed 14 place invariants in 2 ms
[2020-06-02 22:08:10] [INFO ] Implicit Places using invariants in 438 ms returned [7, 8, 9, 10, 11, 12, 13, 14, 15]
Discarding 9 places :
Implicit Place search using SMT only with invariants took 442 ms to find 9 implicit places.
[2020-06-02 22:08:10] [INFO ] Redundant transitions in 1 ms returned []
[2020-06-02 22:08:10] [INFO ] Flow matrix only has 45 transitions (discarded 4 similar events)
// Phase 1: matrix 45 rows 49 cols
[2020-06-02 22:08:10] [INFO ] Computed 5 place invariants in 3 ms
[2020-06-02 22:08:11] [INFO ] Dead Transitions using invariants and state equation in 111 ms returned []
Starting structural reductions, iteration 1 : 49/58 places, 49/49 transitions.
Applied a total of 0 rules in 10 ms. Remains 49 /49 variables (removed 0) and now considering 49/49 (removed 0) transitions.
[2020-06-02 22:08:11] [INFO ] Redundant transitions in 1 ms returned []
[2020-06-02 22:08:11] [INFO ] Flow matrix only has 45 transitions (discarded 4 similar events)
// Phase 1: matrix 45 rows 49 cols
[2020-06-02 22:08:11] [INFO ] Computed 5 place invariants in 5 ms
[2020-06-02 22:08:11] [INFO ] Dead Transitions using invariants and state equation in 80 ms returned []
Finished structural reductions, in 2 iterations. Remains : 49/58 places, 49/49 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:08:11] [INFO ] Flow matrix only has 45 transitions (discarded 4 similar events)
// Phase 1: matrix 45 rows 49 cols
[2020-06-02 22:08:11] [INFO ] Computed 5 place invariants in 1 ms
Support contains 39 out of 49 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 49/49 places, 49/49 transitions.
Applied a total of 0 rules in 8 ms. Remains 49 /49 variables (removed 0) and now considering 49/49 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 49/49 places, 49/49 transitions.
Starting structural reductions, iteration 0 : 49/49 places, 49/49 transitions.
Applied a total of 0 rules in 1 ms. Remains 49 /49 variables (removed 0) and now considering 49/49 (removed 0) transitions.
[2020-06-02 22:08:11] [INFO ] Flow matrix only has 45 transitions (discarded 4 similar events)
// Phase 1: matrix 45 rows 49 cols
[2020-06-02 22:08:11] [INFO ] Computed 5 place invariants in 0 ms
[2020-06-02 22:08:11] [INFO ] Implicit Places using invariants in 64 ms returned []
[2020-06-02 22:08:11] [INFO ] Flow matrix only has 45 transitions (discarded 4 similar events)
// Phase 1: matrix 45 rows 49 cols
[2020-06-02 22:08:11] [INFO ] Computed 5 place invariants in 2 ms
[2020-06-02 22:08:11] [INFO ] State equation strengthened by 7 read => feed constraints.
[2020-06-02 22:08:11] [INFO ] Implicit Places using invariants and state equation in 73 ms returned []
Implicit Place search using SMT with State Equation took 142 ms to find 0 implicit places.
[2020-06-02 22:08:11] [INFO ] Redundant transitions in 1 ms returned []
[2020-06-02 22:08:11] [INFO ] Flow matrix only has 45 transitions (discarded 4 similar events)
// Phase 1: matrix 45 rows 49 cols
[2020-06-02 22:08:11] [INFO ] Computed 5 place invariants in 1 ms
[2020-06-02 22:08:11] [INFO ] Dead Transitions using invariants and state equation in 50 ms returned []
Finished structural reductions, in 1 iterations. Remains : 49/49 places, 49/49 transitions.
Finished random walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Discarding 2 places :
Also discarding 0 output transitions
Graph (complete) has 96 edges and 49 vertex of which 47 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 5 place count 47 transition count 45
Applied a total of 5 rules in 3 ms. Remains 47 /49 variables (removed 2) and now considering 45/49 (removed 4) transitions.
// Phase 1: matrix 45 rows 47 cols
[2020-06-02 22:08:11] [INFO ] Computed 3 place invariants in 1 ms
[2020-06-02 22:08:11] [INFO ] Export to MCC properties in file /home/mcc/execution/UpperBounds.sr.xml took 1 ms.
[2020-06-02 22:08:11] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 2 ms.
info: Time: 3600 - MCC
vrfy: Checking UpperBounds @ NeoElection-COL-3 @ 3570 seconds

FORMULA NeoElection-COL-3-UpperBounds-00 3 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

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

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

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

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

FORMULA NeoElection-COL-3-UpperBounds-04 6 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA NeoElection-COL-3-UpperBounds-05 6 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-3

{
"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:08:11 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": 3,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "MAX(p0 + p1 + p2)",
"processed_size": 17,
"rewrites": 0
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "search",
"value": 3
},
"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
},
"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": 3,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "MAX(p37 + p38 + p39)",
"processed_size": 20,
"rewrites": 0
},
"result":
{
"edges": 42,
"markings": 43,
"produced_by": "search",
"value": 3
},
"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
},
"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": 3,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "MAX(p0 + p1 + p2)",
"processed_size": 17,
"rewrites": 0
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "search",
"value": 3
},
"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": 9,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 9,
"visible_transitions": 0
},
"processed": "MAX(p47 + p46 + p40 + p41 + p44 + p43 + p42 + p45 + p48)",
"processed_size": 56,
"rewrites": 0
},
"result":
{
"edges": 3,
"markings": 4,
"produced_by": "search",
"value": 3
},
"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": 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": 24,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 24,
"visible_transitions": 0
},
"processed": "MAX(p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29 + p30)",
"processed_size": 143,
"rewrites": 0
},
"result":
{
"edges": 9,
"markings": 10,
"produced_by": "search",
"value": 6
},
"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": 24,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 24,
"visible_transitions": 0
},
"processed": "MAX(p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29 + p30)",
"processed_size": 143,
"rewrites": 0
},
"result":
{
"edges": 9,
"markings": 10,
"produced_by": "search",
"value": 6
},
"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
},
"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": 24,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 24,
"visible_transitions": 0
},
"processed": "MAX(p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29 + p30)",
"processed_size": 143,
"rewrites": 0
},
"result":
{
"edges": 9,
"markings": 10,
"produced_by": "search",
"value": 6
},
"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": 17176,
"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": 185,
"conflict_clusters": 21,
"places": 49,
"places_significant": 44,
"singleton_clusters": 0,
"transitions": 49
},
"result":
{
"preliminary_value": "3 3 6 6 6 3 3 ",
"value": "3 3 6 6 6 3 3 "
},
"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: 98/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 1568
lola: finding significant places
lola: 49 places, 49 transitions, 44 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(p0 + p1 + p2) : MAX(p37 + p38 + p39) : MAX(p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29 + p30) : MAX(p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29 + p30) : MAX(p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29 + p30) : MAX(p0 + p1 + p2) : MAX(p47 + p46 + p40 + p41 + p44 + p43 + p42 + p45 + p48)
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)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(p0 + p1 + p2)
lola: processed formula length: 17
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: 3
lola: SUBRESULT
lola: result: 3
lola: produced by: state space
lola: The maximum value of the given expression is 3
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 1 will run for 594 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(p37 + p38 + p39)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(p37 + p38 + p39)
lola: processed formula length: 20
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: 3
lola: SUBRESULT
lola: result: 3
lola: produced by: state space
lola: The maximum value of the given expression is 3
lola: 43 markings, 42 edges
lola: ========================================
lola: subprocess 2 will run for 713 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(p0 + p1 + p2)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(p0 + p1 + p2)
lola: processed formula length: 17
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: 3
lola: SUBRESULT
lola: result: 3
lola: produced by: state space
lola: The maximum value of the given expression is 3
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 3 will run for 891 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(p47 + p46 + p40 + p41 + p44 + p43 + p42 + p45 + p48)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(p47 + p46 + p40 + p41 + p44 + p43 + p42 + p45 + p48)
lola: processed formula length: 56
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: 3
lola: SUBRESULT
lola: result: 3
lola: produced by: state space
lola: The maximum value of the given expression is 3
lola: 4 markings, 3 edges
lola: ========================================
lola: subprocess 4 will run for 1188 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29 + p30)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29 + p30)
lola: processed formula length: 143
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: 6
lola: SUBRESULT
lola: result: 6
lola: produced by: state space
lola: The maximum value of the given expression is 6
lola: 10 markings, 9 edges
lola: ========================================
lola: subprocess 5 will run for 1783 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29 + p30)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29 + p30)
lola: processed formula length: 143
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: 6
lola: SUBRESULT
lola: result: 6
lola: produced by: state space
lola: The maximum value of the given expression is 6
lola: 10 markings, 9 edges
lola: ========================================
lola: subprocess 6 will run for 3566 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29 + p30)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29 + p30)
lola: processed formula length: 143
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: 6
lola: SUBRESULT
lola: result: 6
lola: produced by: state space
lola: The maximum value of the given expression is 6
lola: 10 markings, 9 edges
lola: ========================================
lola: RESULT
lola:
SUMMARY: 3 3 6 6 6 3 3
lola:
preliminary result: 3 3 6 6 6 3 3
lola: memory consumption: 17176 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-3"
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-3, 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-158987852900229"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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