Execution Chart

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

Trace from the execution

Formatting '/data/fko/mcc2020-input.r184-oct2-158987928800613.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fko/mcc2020-input.qcow2 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 LamportFastMutEx-COL-5, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r184-oct2-158987928800613
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 208K
-rw-r--r-- 1 mcc users 3.3K 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 3.1K Apr 30 13:04 CTLFireability.txt
-rw-r--r-- 1 mcc users 20K 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.4K 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.2K 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 3.6K Apr 30 13:04 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 18K Apr 30 13:04 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.9K 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 41K 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 LamportFastMutEx-COL-5-UpperBounds-00
FORMULA_NAME LamportFastMutEx-COL-5-UpperBounds-01
FORMULA_NAME LamportFastMutEx-COL-5-UpperBounds-02
FORMULA_NAME LamportFastMutEx-COL-5-UpperBounds-03
FORMULA_NAME LamportFastMutEx-COL-5-UpperBounds-04
FORMULA_NAME LamportFastMutEx-COL-5-UpperBounds-05
FORMULA_NAME LamportFastMutEx-COL-5-UpperBounds-06
FORMULA_NAME LamportFastMutEx-COL-5-UpperBounds-07
FORMULA_NAME LamportFastMutEx-COL-5-UpperBounds-08
FORMULA_NAME LamportFastMutEx-COL-5-UpperBounds-09
FORMULA_NAME LamportFastMutEx-COL-5-UpperBounds-10
FORMULA_NAME LamportFastMutEx-COL-5-UpperBounds-11
FORMULA_NAME LamportFastMutEx-COL-5-UpperBounds-12
FORMULA_NAME LamportFastMutEx-COL-5-UpperBounds-13
FORMULA_NAME LamportFastMutEx-COL-5-UpperBounds-14
FORMULA_NAME LamportFastMutEx-COL-5-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1591215674461

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-03 20:21:16] [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-03 20:21:16] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-03 20:21:16] [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-03 20:21:16] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 526 ms
[2020-06-03 20:21:16] [INFO ] sort/places :
pid * pid->wait,done,
pid * bool->b,
pid->P-start_1,x,y,P-setx_3,P-setbi_5,P-ify0_4,P-sety_9,P-ifxi_10,P-setbi_11,P-fordo_12,P-await_13,P-ifyi_15,P-awaity,P-CS_21,P-setbi_24,

[2020-06-03 20:21:17] [INFO ] Imported 18 HL places and 17 HL transitions for a total of 174 PT places and 396.0 transition bindings in 35 ms.
[2020-06-03 20:21:17] [INFO ] Computed order based on color domains.
[2020-06-03 20:21:17] [INFO ] Unfolded HLPN to a Petri net with 174 places and 318 transitions in 33 ms.
[2020-06-03 20:21:17] [INFO ] Unfolded HLPN properties in 0 ms.
Deduced a syphon composed of 37 places in 2 ms
Reduce places removed 37 places and 58 transitions.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 47 ms.
Finished random walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
[2020-06-03 20:21:17] [INFO ] Flatten gal took : 48 ms
FORMULA LamportFastMutEx-COL-5-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LamportFastMutEx-COL-5-UpperBounds-04 1 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-03 20:21:17] [INFO ] Flow matrix only has 200 transitions (discarded 60 similar events)
// Phase 1: matrix 200 rows 137 cols
[2020-06-03 20:21:17] [INFO ] Computed 37 place invariants in 7 ms
Support contains 60 out of 137 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 137/137 places, 260/260 transitions.
Applied a total of 0 rules in 14 ms. Remains 137 /137 variables (removed 0) and now considering 260/260 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 137/137 places, 260/260 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-03 20:21:17] [INFO ] Flow matrix only has 200 transitions (discarded 60 similar events)
// Phase 1: matrix 200 rows 137 cols
[2020-06-03 20:21:17] [INFO ] Computed 37 place invariants in 3 ms
Support contains 60 out of 137 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 137/137 places, 260/260 transitions.
Applied a total of 0 rules in 7 ms. Remains 137 /137 variables (removed 0) and now considering 260/260 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 137/137 places, 260/260 transitions.
Starting structural reductions, iteration 0 : 137/137 places, 260/260 transitions.
Applied a total of 0 rules in 17 ms. Remains 137 /137 variables (removed 0) and now considering 260/260 (removed 0) transitions.
[2020-06-03 20:21:17] [INFO ] Flow matrix only has 200 transitions (discarded 60 similar events)
// Phase 1: matrix 200 rows 137 cols
[2020-06-03 20:21:17] [INFO ] Computed 37 place invariants in 4 ms
[2020-06-03 20:21:17] [INFO ] Implicit Places using invariants in 411 ms returned []
[2020-06-03 20:21:17] [INFO ] Flow matrix only has 200 transitions (discarded 60 similar events)
// Phase 1: matrix 200 rows 137 cols
[2020-06-03 20:21:17] [INFO ] Computed 37 place invariants in 1 ms
[2020-06-03 20:21:17] [INFO ] State equation strengthened by 65 read => feed constraints.
[2020-06-03 20:21:18] [INFO ] Implicit Places using invariants and state equation in 424 ms returned []
Implicit Place search using SMT with State Equation took 837 ms to find 0 implicit places.
[2020-06-03 20:21:18] [INFO ] Redundant transitions in 6 ms returned []
[2020-06-03 20:21:18] [INFO ] Flow matrix only has 200 transitions (discarded 60 similar events)
// Phase 1: matrix 200 rows 137 cols
[2020-06-03 20:21:18] [INFO ] Computed 37 place invariants in 1 ms
[2020-06-03 20:21:18] [INFO ] Dead Transitions using invariants and state equation in 209 ms returned []
Finished structural reductions, in 1 iterations. Remains : 137/137 places, 260/260 transitions.
Finished random walk after 0 steps, including 0 resets, run visited all 0 properties in 2 ms. (steps per millisecond=0 )
Ensure Unique test removed 60 transitions
Reduce isomorphic transitions removed 60 transitions.
Iterating post reduction 0 with 60 rules applied. Total rules applied 60 place count 137 transition count 200
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -20
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 1 with 10 rules applied. Total rules applied 70 place count 132 transition count 220
Partial Free-agglomeration rule applied 5 times.
Drop transitions removed 5 transitions
Iterating global reduction 1 with 5 rules applied. Total rules applied 75 place count 132 transition count 220
Applied a total of 75 rules in 13 ms. Remains 132 /137 variables (removed 5) and now considering 220/260 (removed 40) transitions.
// Phase 1: matrix 220 rows 132 cols
[2020-06-03 20:21:18] [INFO ] Computed 37 place invariants in 1 ms
[2020-06-03 20:21:18] [INFO ] Export to MCC properties in file /home/mcc/execution/UpperBounds.sr.xml took 1 ms.
[2020-06-03 20:21:18] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 5 ms.
info: Time: 3600 - MCC
vrfy: Checking UpperBounds @ LamportFastMutEx-COL-5 @ 3570 seconds

FORMULA LamportFastMutEx-COL-5-UpperBounds-00 5 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

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

FORMULA LamportFastMutEx-COL-5-UpperBounds-02 5 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA LamportFastMutEx-COL-5-UpperBounds-03 4 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA LamportFastMutEx-COL-5-UpperBounds-06 1 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

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

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

FORMULA LamportFastMutEx-COL-5-UpperBounds-09 4 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA LamportFastMutEx-COL-5-UpperBounds-10 5 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA LamportFastMutEx-COL-5-UpperBounds-11 5 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA LamportFastMutEx-COL-5-UpperBounds-12 5 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA LamportFastMutEx-COL-5-UpperBounds-13 5 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA LamportFastMutEx-COL-5-UpperBounds-15 5 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA LamportFastMutEx-COL-5-UpperBounds-05 20 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 3019
rslt: Output for UpperBounds @ LamportFastMutEx-COL-5

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

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 274
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 0,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 5,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "MAX(p127 + p128 + p129 + p130 + p131)",
"processed_size": 37,
"rewrites": 0
},
"result":
{
"edges": 30766706,
"markings": 9591427,
"produced_by": "search",
"value": 1
},
"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": 292
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 0,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 5,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "MAX(p0 + p1 + p2 + p3 + p4)",
"processed_size": 27,
"rewrites": 0
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "search",
"value": 5
},
"task":
{
"compoundnumber": 2,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "bound preserving/insertion"
},
"type": "dfs"
},
"type": "bound",
"workflow": "search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 319
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 0,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 5,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "MAX(p87 + p88 + p89 + p90 + p91)",
"processed_size": 32,
"rewrites": 0
},
"result":
{
"edges": 41542969,
"markings": 11665309,
"produced_by": "search",
"value": 4
},
"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": 343
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 0,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 5,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "MAX(p127 + p128 + p129 + p130 + p131)",
"processed_size": 37,
"rewrites": 0
},
"result":
{
"edges": 30766706,
"markings": 9591427,
"produced_by": "search",
"value": 1
},
"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": 375
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 0,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 5,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "MAX(p87 + p88 + p89 + p90 + p91)",
"processed_size": 32,
"rewrites": 0
},
"result":
{
"edges": 41542969,
"markings": 11665309,
"produced_by": "search",
"value": 4
},
"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": 412
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 0,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 5,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "MAX(p122 + p123 + p124 + p125 + p126)",
"processed_size": 37,
"rewrites": 0
},
"result":
{
"edges": 50574383,
"markings": 11865168,
"produced_by": "search",
"value": 4
},
"task":
{
"compoundnumber": 6,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "bound preserving/insertion"
},
"type": "dfs"
},
"type": "bound",
"workflow": "search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 458
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 0,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 5,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "MAX(p87 + p88 + p89 + p90 + p91)",
"processed_size": 32,
"rewrites": 0
},
"result":
{
"edges": 41542969,
"markings": 11665309,
"produced_by": "search",
"value": 4
},
"task":
{
"compoundnumber": 7,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "bound preserving/insertion"
},
"type": "dfs"
},
"type": "bound",
"workflow": "search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 521
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 0,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 5,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "MAX(p132 + p133 + p134 + p135 + p136)",
"processed_size": 37,
"rewrites": 0
},
"result":
{
"edges": 30,
"markings": 31,
"produced_by": "search",
"value": 5
},
"task":
{
"compoundnumber": 8,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "bound preserving/insertion"
},
"type": "dfs"
},
"type": "bound",
"workflow": "search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 625
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 0,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 5,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "MAX(p47 + p48 + p49 + p50 + p51)",
"processed_size": 32,
"rewrites": 0
},
"result":
{
"edges": 6901858,
"markings": 3414684,
"produced_by": "search",
"value": 5
},
"task":
{
"compoundnumber": 9,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "bound preserving/insertion"
},
"type": "dfs"
},
"type": "bound",
"workflow": "search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 778
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 0,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 5,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "MAX(p47 + p48 + p49 + p50 + p51)",
"processed_size": 32,
"rewrites": 0
},
"result":
{
"edges": 6901858,
"markings": 3414684,
"produced_by": "search",
"value": 5
},
"task":
{
"compoundnumber": 10,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "bound preserving/insertion"
},
"type": "dfs"
},
"type": "bound",
"workflow": "search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1032
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 0,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 5,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "MAX(p27 + p28 + p29 + p30 + p31)",
"processed_size": 32,
"rewrites": 0
},
"result":
{
"edges": 5,
"markings": 6,
"produced_by": "search",
"value": 5
},
"task":
{
"compoundnumber": 11,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "bound preserving/insertion"
},
"type": "dfs"
},
"type": "bound",
"workflow": "search"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3098
},
"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": 25,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 25,
"visible_transitions": 0
},
"processed": "MAX(p69 + p68 + p67 + p66 + p65 + p64 + p63 + p62 + p70 + p71 + p72 + p73 + p74 + p75 + p76 + p77 + p78 + p79 + p80 + p81 + p82 + p83 + p84 + p85 + p86)",
"processed_size": 152,
"rewrites": 0
},
"result":
{
"edges": 41542969,
"markings": 11665309,
"produced_by": "search",
"value": 20
},
"task":
{
"compoundnumber": 13,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "bound preserving/insertion"
},
"type": "dfs"
},
"type": "bound",
"workflow": "search"
}
}
],
"exit":
{
"error": null,
"memory": 20368,
"runtime": 551.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "UpperBounds.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "MAX(*) : MAX(*) : MAX(*) : MAX(*) : MAX(*) : MAX(*) : MAX(*) : MAX(*) : MAX(*) : MAX(*) : MAX(*) : MAX(*) : MAX(*) : MAX(*)"
},
"net":
{
"arcs": 1120,
"conflict_clusters": 8,
"places": 137,
"places_significant": 100,
"singleton_clusters": 0,
"transitions": 260
},
"result":
{
"preliminary_value": "5 1 5 4 20 1 4 4 4 5 5 5 5 5 ",
"value": "5 1 5 4 20 1 4 4 4 5 5 5 5 5 "
},
"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: 397/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 4384
lola: finding significant places
lola: 137 places, 260 transitions, 100 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(p132 + p133 + p134 + p135 + p136) : MAX(p127 + p128 + p129 + p130 + p131) : MAX(p0 + p1 + p2 + p3 + p4) : MAX(p87 + p88 + p89 + p90 + p91) : MAX(p69 + p68 + p67 + p66 + p65 + p64 + p63 + p62 + p70 + p71 + p72 + p73 + p74 + p75 + p76 + p77 + p78 + p79 + p80 + p81 + p82 + p83 + p84 + p85 + p86) : MAX(p127 + p128 + p129 + p130 + p131) : MAX(p87 + p88 + p89 + p90 + p91) : MAX(p122 + p123 + p124 + p125 + p126) : MAX(p87 + p88 + p89 + p90 + p91) : MAX(p132 + p133 + p134 + p135 + p136) : MAX(p47 + p48 + p49 + p50 + p51) : MAX(p47 + p48 + p49 + p50 + p51) : MAX(p27 + p28 + p29 + p30 + p31) : MAX(p0 + p1 + p2 + p3 + p4)
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 254 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(p132 + p133 + p134 + p135 + p136)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(p132 + p133 + p134 + p135 + p136)
lola: processed formula length: 37
lola: 0 rewrites
lola: closed formula file UpperBounds.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using bound preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: RUNNING
lola: Structural Bound: 5
lola: SUBRESULT
lola: result: 5
lola: produced by: state space
lola: The maximum value of the given expression is 5
lola: 31 markings, 30 edges
lola: ========================================
lola: subprocess 1 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(p127 + p128 + p129 + p130 + p131)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(p127 + p128 + p129 + p130 + p131)
lola: processed formula length: 37
lola: 0 rewrites
lola: closed formula file UpperBounds.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using bound preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: RUNNING
lola: Structural Bound: 5
lola: 1337671 markings, 2264244 edges, 267534 markings/sec, 0 secs
lola: 2459960 markings, 4848794 edges, 224458 markings/sec, 5 secs
lola: 3534302 markings, 7427310 edges, 214868 markings/sec, 10 secs
lola: 4556118 markings, 10064707 edges, 204363 markings/sec, 15 secs
lola: 5534791 markings, 12741383 edges, 195735 markings/sec, 20 secs
lola: 6485610 markings, 15464889 edges, 190164 markings/sec, 25 secs
lola: 7431018 markings, 18201264 edges, 189082 markings/sec, 30 secs
lola: 8325271 markings, 20969056 edges, 178851 markings/sec, 35 secs
lola: 8991852 markings, 23958075 edges, 133316 markings/sec, 40 secs
lola: 9380550 markings, 27058988 edges, 77740 markings/sec, 45 secs
lola: 9588322 markings, 30540428 edges, 41554 markings/sec, 50 secs
lola: SUBRESULT
lola: result: 1
lola: produced by: state space
lola: The maximum value of the given expression is 1
lola: 9591427 markings, 30766706 edges
lola: ========================================
lola: subprocess 2 will run for 292 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(p0 + p1 + p2 + p3 + p4)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(p0 + p1 + p2 + p3 + p4)
lola: processed formula length: 27
lola: 0 rewrites
lola: closed formula file UpperBounds.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using bound preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: RUNNING
lola: Structural Bound: 5
lola: SUBRESULT
lola: result: 5
lola: produced by: state space
lola: The maximum value of the given expression is 5
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 3 will run for 319 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(p87 + p88 + p89 + p90 + p91)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(p87 + p88 + p89 + p90 + p91)
lola: processed formula length: 32
lola: 0 rewrites
lola: closed formula file UpperBounds.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using bound preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: RUNNING
lola: Structural Bound: 5
lola: 1064961 markings, 2199819 edges, 212992 markings/sec, 0 secs
lola: 1958724 markings, 4675728 edges, 178753 markings/sec, 5 secs
lola: 2798373 markings, 7216103 edges, 167930 markings/sec, 10 secs
lola: 3607309 markings, 9829220 edges, 161787 markings/sec, 15 secs
lola: 4393644 markings, 12412643 edges, 157267 markings/sec, 20 secs
lola: 5170598 markings, 14982876 edges, 155391 markings/sec, 25 secs
lola: 5944928 markings, 17585912 edges, 154866 markings/sec, 30 secs
lola: 6710306 markings, 20207199 edges, 153076 markings/sec, 35 secs
lola: 7460395 markings, 22898509 edges, 150018 markings/sec, 40 secs
lola: 8204652 markings, 25571321 edges, 148851 markings/sec, 45 secs
lola: 8933903 markings, 28161003 edges, 145850 markings/sec, 50 secs
lola: 9654929 markings, 30775121 edges, 144205 markings/sec, 55 secs
lola: 10339243 markings, 33451032 edges, 136863 markings/sec, 60 secs
lola: 10851256 markings, 36165463 edges, 102403 markings/sec, 65 secs
lola: 11321151 markings, 38850020 edges, 93979 markings/sec, 70 secs
lola: SUBRESULT
lola: result: 4
lola: produced by: state space
lola: The maximum value of the given expression is 4
lola: 11665309 markings, 41542969 edges
lola: ========================================
lola: subprocess 4 will run for 343 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(p127 + p128 + p129 + p130 + p131)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(p127 + p128 + p129 + p130 + p131)
lola: processed formula length: 37
lola: 0 rewrites
lola: closed formula file UpperBounds.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using bound preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: RUNNING
lola: Structural Bound: 5
lola: 1342760 markings, 2278226 edges, 268552 markings/sec, 0 secs
lola: 2464839 markings, 4859475 edges, 224416 markings/sec, 5 secs
lola: 3542202 markings, 7446807 edges, 215473 markings/sec, 10 secs
lola: 4566033 markings, 10087246 edges, 204766 markings/sec, 15 secs
lola: 5546070 markings, 12779129 edges, 196007 markings/sec, 20 secs
lola: 6498051 markings, 15506012 edges, 190396 markings/sec, 25 secs
lola: 7447603 markings, 18247519 edges, 189910 markings/sec, 30 secs
lola: 8338397 markings, 21018922 edges, 178159 markings/sec, 35 secs
lola: 8999492 markings, 24008698 edges, 132219 markings/sec, 40 secs
lola: 9384990 markings, 27107711 edges, 77100 markings/sec, 45 secs
lola: 9589471 markings, 30605964 edges, 40896 markings/sec, 50 secs
lola: SUBRESULT
lola: result: 1
lola: produced by: state space
lola: The maximum value of the given expression is 1
lola: 9591427 markings, 30766706 edges
lola: ========================================
lola: subprocess 5 will run for 375 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(p87 + p88 + p89 + p90 + p91)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(p87 + p88 + p89 + p90 + p91)
lola: processed formula length: 32
lola: 0 rewrites
lola: closed formula file UpperBounds.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using bound preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: RUNNING
lola: Structural Bound: 5
lola: 1089711 markings, 2261288 edges, 217942 markings/sec, 0 secs
lola: 1993211 markings, 4782898 edges, 180700 markings/sec, 5 secs
lola: 2846104 markings, 7368281 edges, 170579 markings/sec, 10 secs
lola: 3667826 markings, 10024210 edges, 164344 markings/sec, 15 secs
lola: 4466093 markings, 12652540 edges, 159653 markings/sec, 20 secs
lola: 5254520 markings, 15263214 edges, 157685 markings/sec, 25 secs
lola: 6034243 markings, 17885443 edges, 155945 markings/sec, 30 secs
lola: 6804632 markings, 20545364 edges, 154078 markings/sec, 35 secs
lola: 7558285 markings, 23259422 edges, 150731 markings/sec, 40 secs
lola: 8307715 markings, 25934157 edges, 149886 markings/sec, 45 secs
lola: 9041285 markings, 28545023 edges, 146714 markings/sec, 50 secs
lola: 9759571 markings, 31180394 edges, 143657 markings/sec, 55 secs
lola: 10416218 markings, 33872901 edges, 131329 markings/sec, 60 secs
lola: 10933670 markings, 36598681 edges, 103490 markings/sec, 65 secs
lola: 11397299 markings, 39338362 edges, 92726 markings/sec, 70 secs
lola: SUBRESULT
lola: result: 4
lola: produced by: state space
lola: The maximum value of the given expression is 4
lola: 11665309 markings, 41542969 edges
lola: ========================================
lola: subprocess 6 will run for 412 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(p122 + p123 + p124 + p125 + p126)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(p122 + p123 + p124 + p125 + p126)
lola: processed formula length: 37
lola: 0 rewrites
lola: closed formula file UpperBounds.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using bound preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: RUNNING
lola: Structural Bound: 5
lola: 829963 markings, 2600656 edges, 165993 markings/sec, 0 secs
lola: 1609578 markings, 5187673 edges, 155923 markings/sec, 5 secs
lola: 2369903 markings, 7773862 edges, 152065 markings/sec, 10 secs
lola: 3106691 markings, 10401428 edges, 147358 markings/sec, 15 secs
lola: 3837342 markings, 13149609 edges, 146130 markings/sec, 20 secs
lola: 4560566 markings, 16010686 edges, 144645 markings/sec, 25 secs
lola: 5272812 markings, 18772071 edges, 142449 markings/sec, 30 secs
lola: 5965364 markings, 21444834 edges, 138510 markings/sec, 35 secs
lola: 6637585 markings, 24102431 edges, 134444 markings/sec, 40 secs
lola: 7299449 markings, 26744267 edges, 132373 markings/sec, 45 secs
lola: 7947312 markings, 29394271 edges, 129573 markings/sec, 50 secs
lola: 8586078 markings, 32073217 edges, 127753 markings/sec, 55 secs
lola: 9219369 markings, 34775834 edges, 126658 markings/sec, 60 secs
lola: 9849002 markings, 37486437 edges, 125927 markings/sec, 65 secs
lola: 10470292 markings, 40197754 edges, 124258 markings/sec, 70 secs
lola: 11100983 markings, 42989044 edges, 126138 markings/sec, 75 secs
lola: 11636983 markings, 45772053 edges, 107200 markings/sec, 80 secs
lola: 11819211 markings, 48708563 edges, 36446 markings/sec, 85 secs
lola: SUBRESULT
lola: result: 4
lola: produced by: state space
lola: The maximum value of the given expression is 4
lola: 11865168 markings, 50574383 edges
lola: ========================================
lola: subprocess 7 will run for 458 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(p87 + p88 + p89 + p90 + p91)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(p87 + p88 + p89 + p90 + p91)
lola: processed formula length: 32
lola: 0 rewrites
lola: closed formula file UpperBounds.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using bound preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: RUNNING
lola: Structural Bound: 5
lola: 1095707 markings, 2276005 edges, 219141 markings/sec, 0 secs
lola: 2000357 markings, 4804352 edges, 180930 markings/sec, 5 secs
lola: 2855544 markings, 7409486 edges, 171037 markings/sec, 10 secs
lola: 3674727 markings, 10054473 edges, 163837 markings/sec, 15 secs
lola: 4474844 markings, 12679168 edges, 160023 markings/sec, 20 secs
lola: 5258674 markings, 15275688 edges, 156766 markings/sec, 25 secs
lola: 6037477 markings, 17895087 edges, 155761 markings/sec, 30 secs
lola: 6803039 markings, 20538865 edges, 153112 markings/sec, 35 secs
lola: 7555702 markings, 23249677 edges, 150533 markings/sec, 40 secs
lola: 8304341 markings, 25923286 edges, 149728 markings/sec, 45 secs
lola: 9037736 markings, 28531036 edges, 146679 markings/sec, 50 secs
lola: 9750727 markings, 31151039 edges, 142598 markings/sec, 55 secs
lola: 10402089 markings, 33796717 edges, 130272 markings/sec, 60 secs
lola: 10908762 markings, 36463848 edges, 101335 markings/sec, 65 secs
lola: 11360185 markings, 39103922 edges, 90285 markings/sec, 70 secs
lola: SUBRESULT
lola: result: 4
lola: produced by: state space
lola: The maximum value of the given expression is 4
lola: 11665309 markings, 41542969 edges
lola: ========================================
lola: subprocess 8 will run for 521 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(p132 + p133 + p134 + p135 + p136)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(p132 + p133 + p134 + p135 + p136)
lola: processed formula length: 37
lola: 0 rewrites
lola: closed formula file UpperBounds.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using bound preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: RUNNING
lola: Structural Bound: 5
lola: SUBRESULT
lola: result: 5
lola: produced by: state space
lola: The maximum value of the given expression is 5
lola: 31 markings, 30 edges
lola: subprocess 9 will run for 625 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(p47 + p48 + p49 + p50 + p51)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(p47 + p48 + p49 + p50 + p51)
lola: processed formula length: 32
lola: 0 rewrites
lola: closed formula file UpperBounds.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using bound preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: RUNNING
lola: ========================================
lola: Structural Bound: 5
lola: 1385228 markings, 2246690 edges, 277046 markings/sec, 0 secs
lola: 2525256 markings, 4751257 edges, 228006 markings/sec, 5 secs
lola: SUBRESULT
lola: result: 5
lola: produced by: state space
lola: The maximum value of the given expression is 5
lola: 3414684 markings, 6901858 edges
lola: subprocess 10 will run for 778 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(p47 + p48 + p49 + p50 + p51)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(p47 + p48 + p49 + p50 + p51)
lola: processed formula length: 32
lola: 0 rewrites
lola: closed formula file UpperBounds.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using bound preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: RUNNING
lola: ========================================
lola: Structural Bound: 5
lola: 1374936 markings, 2223529 edges, 274987 markings/sec, 0 secs
lola: 2515400 markings, 4730184 edges, 228093 markings/sec, 5 secs
lola: SUBRESULT
lola: result: 5
lola: produced by: state space
lola: The maximum value of the given expression is 5
lola: 3414684 markings, 6901858 edges
lola: ========================================
lola: subprocess 11 will run for 1032 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(p27 + p28 + p29 + p30 + p31)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(p27 + p28 + p29 + p30 + p31)
lola: processed formula length: 32
lola: 0 rewrites
lola: closed formula file UpperBounds.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using bound preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: RUNNING
lola: Structural Bound: 5
lola: SUBRESULT
lola: result: 5
lola: produced by: state space
lola: The maximum value of the given expression is 5
lola: 6 markings, 5 edges
lola: subprocess 12 will run for 1549 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(p0 + p1 + p2 + p3 + p4)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: ========================================
lola: processed formula: MAX(p0 + p1 + p2 + p3 + p4)
lola: processed formula length: 27
lola: 0 rewrites
lola: closed formula file UpperBounds.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using bound preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: RUNNING
lola: Structural Bound: 5
lola: SUBRESULT
lola: result: 5
lola: produced by: state space
lola: The maximum value of the given expression is 5
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 13 will run for 3098 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(p69 + p68 + p67 + p66 + p65 + p64 + p63 + p62 + p70 + p71 + p72 + p73 + p74 + p75 + p76 + p77 + p78 + p79 + p80 + p81 + p82 + p83 + p84 + p85 + p86)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(p69 + p68 + p67 + p66 + p65 + p64 + p63 + p62 + p70 + p71 + p72 + p73 + p74 + p75 + p76 + p77 + p78 + p79 + p80 + p81 + p82 + p83 + p84 + p85 + p86)
lola: processed formula length: 152
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: 25
lola: 1077193 markings, 2227411 edges, 215439 markings/sec, 0 secs
lola: 1985454 markings, 4760050 edges, 181652 markings/sec, 5 secs
lola: 2846232 markings, 7368804 edges, 172156 markings/sec, 10 secs
lola: 3671573 markings, 10040467 edges, 165068 markings/sec, 15 secs
lola: 4472689 markings, 12672047 edges, 160223 markings/sec, 20 secs
lola: 5258811 markings, 15276160 edges, 157224 markings/sec, 25 secs
lola: 6036004 markings, 17890544 edges, 155439 markings/sec, 30 secs
lola: 6801834 markings, 20534572 edges, 153166 markings/sec, 35 secs
lola: 7551593 markings, 23231840 edges, 149952 markings/sec, 40 secs
lola: 8294102 markings, 25888096 edges, 148502 markings/sec, 45 secs
lola: 9019503 markings, 28466400 edges, 145080 markings/sec, 50 secs
lola: 9730729 markings, 31074301 edges, 142245 markings/sec, 55 secs
lola: 10388421 markings, 33720197 edges, 131538 markings/sec, 60 secs
lola: 10890743 markings, 36376762 edges, 100464 markings/sec, 65 secs
lola: 11344312 markings, 39006112 edges, 90714 markings/sec, 70 secs
lola: SUBRESULT
lola: result: 20
lola: produced by: state space
lola: The maximum value of the given expression is 20
lola: 11665309 markings, 41542969 edges
lola: RESULT
lola:
SUMMARY: 5 1 5 4 20 1 4 4 4 5 5 5 5 5
lola:
preliminary result: 5 1 5 4 20 1 4 4 4 5 5 5 5 5
lola: ========================================
lola: memory consumption: 20368 KB
lola: time consumption: 551 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="LamportFastMutEx-COL-5"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="itslola"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itslola"
echo " Input is LamportFastMutEx-COL-5, examination is UpperBounds"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r184-oct2-158987928800613"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/LamportFastMutEx-COL-5.tgz
mv LamportFastMutEx-COL-5 execution
cd execution
if [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "UpperBounds" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] || [ "UpperBounds" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "UpperBounds" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "UpperBounds" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "UpperBounds.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property UpperBounds.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "UpperBounds.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' UpperBounds.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] ; then
echo "FORMULA_NAME UpperBounds"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;