Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2020-input.r178-tajo-158987881900141.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2020-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itslola
Input is DNAwalker-PT-08ringLL, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r178-tajo-158987881900141
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 288K
-rw-r--r-- 1 mcc users 4.0K Mar 31 04:57 CTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Mar 31 04:57 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Mar 29 20:53 CTLFireability.txt
-rw-r--r-- 1 mcc users 12K Mar 29 20:53 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 24 05:37 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.3K Apr 8 14:52 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 28 14:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Apr 8 14:52 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Apr 28 14:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.1K Mar 28 13:41 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 22K Mar 28 13:41 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.3K Mar 27 06:26 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 22K Mar 27 06:26 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 28 14:49 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Mar 28 14:49 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 equiv_col
-rw-r--r-- 1 mcc users 9 Mar 24 05:37 instance
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 iscolored
-rw-r--r-- 1 mcc users 112K Mar 24 05:37 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 DNAwalker-PT-08ringLL-UpperBounds-00
FORMULA_NAME DNAwalker-PT-08ringLL-UpperBounds-01
FORMULA_NAME DNAwalker-PT-08ringLL-UpperBounds-02
FORMULA_NAME DNAwalker-PT-08ringLL-UpperBounds-03
FORMULA_NAME DNAwalker-PT-08ringLL-UpperBounds-04
FORMULA_NAME DNAwalker-PT-08ringLL-UpperBounds-05
FORMULA_NAME DNAwalker-PT-08ringLL-UpperBounds-06
FORMULA_NAME DNAwalker-PT-08ringLL-UpperBounds-07
FORMULA_NAME DNAwalker-PT-08ringLL-UpperBounds-08
FORMULA_NAME DNAwalker-PT-08ringLL-UpperBounds-09
FORMULA_NAME DNAwalker-PT-08ringLL-UpperBounds-10
FORMULA_NAME DNAwalker-PT-08ringLL-UpperBounds-11
FORMULA_NAME DNAwalker-PT-08ringLL-UpperBounds-12
FORMULA_NAME DNAwalker-PT-08ringLL-UpperBounds-13
FORMULA_NAME DNAwalker-PT-08ringLL-UpperBounds-14
FORMULA_NAME DNAwalker-PT-08ringLL-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1591205733831

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-03 17:35:36] [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 17:35:36] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-03 17:35:36] [INFO ] Load time of PNML (sax parser for PT used): 61 ms
[2020-06-03 17:35:36] [INFO ] Transformed 27 places.
[2020-06-03 17:35:36] [INFO ] Transformed 260 transitions.
[2020-06-03 17:35:36] [INFO ] Parsed PT model containing 27 places and 260 transitions in 117 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 11 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 17:35:36] [INFO ] Flatten gal took : 60 ms
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 17:35:37] [INFO ] Flow matrix only has 259 transitions (discarded 1 similar events)
// Phase 1: matrix 259 rows 27 cols
[2020-06-03 17:35:37] [INFO ] Computed 0 place invariants in 22 ms
Support contains 12 out of 27 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 27/27 places, 260/260 transitions.
Drop transitions removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 27 transition count 254
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 26 transition count 253
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 1 with 1 rules applied. Total rules applied 8 place count 25 transition count 252
Applied a total of 8 rules in 62 ms. Remains 25 /27 variables (removed 2) and now considering 252/260 (removed 8) transitions.
// Phase 1: matrix 252 rows 25 cols
[2020-06-03 17:35:37] [INFO ] Computed 0 place invariants in 5 ms
[2020-06-03 17:35:37] [INFO ] Dead Transitions using invariants and state equation in 338 ms returned []
Finished structural reductions, in 1 iterations. Remains : 25/27 places, 252/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 )
// Phase 1: matrix 252 rows 25 cols
[2020-06-03 17:35:37] [INFO ] Computed 0 place invariants in 1 ms
Support contains 12 out of 25 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 25/25 places, 252/252 transitions.
Applied a total of 0 rules in 4 ms. Remains 25 /25 variables (removed 0) and now considering 252/252 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 25/25 places, 252/252 transitions.
Starting structural reductions, iteration 0 : 25/25 places, 252/252 transitions.
Applied a total of 0 rules in 26 ms. Remains 25 /25 variables (removed 0) and now considering 252/252 (removed 0) transitions.
// Phase 1: matrix 252 rows 25 cols
[2020-06-03 17:35:37] [INFO ] Computed 0 place invariants in 1 ms
[2020-06-03 17:35:37] [INFO ] Implicit Places using invariants in 60 ms returned []
// Phase 1: matrix 252 rows 25 cols
[2020-06-03 17:35:37] [INFO ] Computed 0 place invariants in 2 ms
[2020-06-03 17:35:37] [INFO ] State equation strengthened by 50 read => feed constraints.
[2020-06-03 17:35:37] [INFO ] Implicit Places using invariants and state equation in 187 ms returned [9]
Discarding 1 places :
Drop transitions removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Implicit Place search using SMT with State Equation took 250 ms to find 1 implicit places.
[2020-06-03 17:35:37] [INFO ] Redundant transitions in 73 ms returned []
// Phase 1: matrix 245 rows 24 cols
[2020-06-03 17:35:37] [INFO ] Computed 0 place invariants in 1 ms
[2020-06-03 17:35:38] [INFO ] Dead Transitions using invariants and state equation in 154 ms returned []
Starting structural reductions, iteration 1 : 24/25 places, 245/252 transitions.
Applied a total of 0 rules in 7 ms. Remains 24 /24 variables (removed 0) and now considering 245/245 (removed 0) transitions.
[2020-06-03 17:35:38] [INFO ] Redundant transitions in 65 ms returned []
// Phase 1: matrix 245 rows 24 cols
[2020-06-03 17:35:38] [INFO ] Computed 0 place invariants in 4 ms
[2020-06-03 17:35:38] [INFO ] Dead Transitions using invariants and state equation in 183 ms returned []
Finished structural reductions, in 2 iterations. Remains : 24/25 places, 245/252 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 )
// Phase 1: matrix 245 rows 24 cols
[2020-06-03 17:35:38] [INFO ] Computed 0 place invariants in 1 ms
Support contains 12 out of 24 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 24/24 places, 245/245 transitions.
Applied a total of 0 rules in 4 ms. Remains 24 /24 variables (removed 0) and now considering 245/245 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 24/24 places, 245/245 transitions.
Starting structural reductions, iteration 0 : 24/24 places, 245/245 transitions.
Applied a total of 0 rules in 17 ms. Remains 24 /24 variables (removed 0) and now considering 245/245 (removed 0) transitions.
// Phase 1: matrix 245 rows 24 cols
[2020-06-03 17:35:38] [INFO ] Computed 0 place invariants in 0 ms
[2020-06-03 17:35:38] [INFO ] Implicit Places using invariants in 19 ms returned []
// Phase 1: matrix 245 rows 24 cols
[2020-06-03 17:35:38] [INFO ] Computed 0 place invariants in 1 ms
[2020-06-03 17:35:38] [INFO ] State equation strengthened by 50 read => feed constraints.
[2020-06-03 17:35:38] [INFO ] Implicit Places using invariants and state equation in 159 ms returned []
Implicit Place search using SMT with State Equation took 181 ms to find 0 implicit places.
[2020-06-03 17:35:38] [INFO ] Redundant transitions in 59 ms returned []
// Phase 1: matrix 245 rows 24 cols
[2020-06-03 17:35:38] [INFO ] Computed 0 place invariants in 1 ms
[2020-06-03 17:35:38] [INFO ] Dead Transitions using invariants and state equation in 191 ms returned []
Finished structural reductions, in 1 iterations. Remains : 24/24 places, 245/245 transitions.
Finished random walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Applied a total of 0 rules in 3 ms. Remains 24 /24 variables (removed 0) and now considering 245/245 (removed 0) transitions.
// Phase 1: matrix 245 rows 24 cols
[2020-06-03 17:35:38] [INFO ] Computed 0 place invariants in 1 ms
[2020-06-03 17:35:38] [INFO ] Export to MCC properties in file /home/mcc/execution/UpperBounds.sr.xml took 2 ms.
[2020-06-03 17:35:38] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 5 ms.
info: Time: 3600 - MCC
vrfy: Checking UpperBounds @ DNAwalker-PT-08ringLL @ 3570 seconds

FORMULA DNAwalker-PT-08ringLL-UpperBounds-00 2 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DNAwalker-PT-08ringLL-UpperBounds-01 2 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DNAwalker-PT-08ringLL-UpperBounds-02 2 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DNAwalker-PT-08ringLL-UpperBounds-03 2 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DNAwalker-PT-08ringLL-UpperBounds-04 1 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DNAwalker-PT-08ringLL-UpperBounds-05 2 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DNAwalker-PT-08ringLL-UpperBounds-06 2 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DNAwalker-PT-08ringLL-UpperBounds-07 2 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DNAwalker-PT-08ringLL-UpperBounds-08 2 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DNAwalker-PT-08ringLL-UpperBounds-09 2 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DNAwalker-PT-08ringLL-UpperBounds-10 2 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DNAwalker-PT-08ringLL-UpperBounds-11 2 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DNAwalker-PT-08ringLL-UpperBounds-12 2 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DNAwalker-PT-08ringLL-UpperBounds-13 2 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DNAwalker-PT-08ringLL-UpperBounds-14 1 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DNAwalker-PT-08ringLL-UpperBounds-15 2 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 2159
rslt: Output for UpperBounds @ DNAwalker-PT-08ringLL

{
"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 17:35:39 2020
",
"timelimit": 3570
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 222
},
"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": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "MAX(p14)",
"processed_size": 8,
"rewrites": 0
},
"result":
{
"edges": 43462483,
"markings": 12163282,
"produced_by": "search",
"value": 2
},
"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": 231
},
"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": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "MAX(p5)",
"processed_size": 7,
"rewrites": 0
},
"result":
{
"edges": 26858644,
"markings": 6800536,
"produced_by": "search",
"value": 2
},
"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": 243
},
"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": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "MAX(p12)",
"processed_size": 8,
"rewrites": 0
},
"result":
{
"edges": 43019175,
"markings": 9795373,
"produced_by": "search",
"value": 2
},
"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": 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": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "MAX(p13)",
"processed_size": 8,
"rewrites": 0
},
"result":
{
"edges": 43303967,
"markings": 10666207,
"produced_by": "search",
"value": 2
},
"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": 268
},
"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": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "MAX(p6)",
"processed_size": 7,
"rewrites": 0
},
"result":
{
"edges": 0,
"markings": 1,
"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": 289
},
"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": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "MAX(p21)",
"processed_size": 8,
"rewrites": 0
},
"result":
{
"edges": 43078323,
"markings": 9609688,
"produced_by": "search",
"value": 2
},
"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": 309
},
"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": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "MAX(p19)",
"processed_size": 8,
"rewrites": 0
},
"result":
{
"edges": 80549213,
"markings": 12796457,
"produced_by": "search",
"value": 2
},
"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": 327
},
"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": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "MAX(p20)",
"processed_size": 8,
"rewrites": 0
},
"result":
{
"edges": 42661623,
"markings": 10054590,
"produced_by": "search",
"value": 2
},
"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": 355
},
"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": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "MAX(p18)",
"processed_size": 8,
"rewrites": 0
},
"result":
{
"edges": 42469275,
"markings": 9703927,
"produced_by": "search",
"value": 2
},
"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": 392
},
"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": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "MAX(p20)",
"processed_size": 8,
"rewrites": 0
},
"result":
{
"edges": 42661623,
"markings": 10054590,
"produced_by": "search",
"value": 2
},
"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": 441
},
"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": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "MAX(p1)",
"processed_size": 7,
"rewrites": 0
},
"result":
{
"edges": 29911623,
"markings": 8472867,
"produced_by": "search",
"value": 2
},
"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": 515
},
"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": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "MAX(p19)",
"processed_size": 8,
"rewrites": 0
},
"result":
{
"edges": 80549213,
"markings": 12796457,
"produced_by": "search",
"value": 2
},
"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": 607
},
"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": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "MAX(p1)",
"processed_size": 7,
"rewrites": 0
},
"result":
{
"edges": 29911623,
"markings": 8472867,
"produced_by": "search",
"value": 2
},
"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": 784
},
"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": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "MAX(p14)",
"processed_size": 8,
"rewrites": 0
},
"result":
{
"edges": 43462483,
"markings": 12163282,
"produced_by": "search",
"value": 2
},
"task":
{
"compoundnumber": 13,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "bound preserving/insertion"
},
"type": "dfs"
},
"type": "bound",
"workflow": "search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1129
},
"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": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "MAX(p4)",
"processed_size": 7,
"rewrites": 0
},
"result":
{
"edges": 0,
"markings": 1,
"produced_by": "search",
"value": 1
},
"task":
{
"compoundnumber": 14,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "bound preserving/insertion"
},
"type": "dfs"
},
"type": "bound",
"workflow": "search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 2228
},
"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": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "MAX(p16)",
"processed_size": 8,
"rewrites": 0
},
"result":
{
"edges": 28137885,
"markings": 6683178,
"produced_by": "search",
"value": 2
},
"task":
{
"compoundnumber": 15,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "bound preserving/insertion"
},
"type": "dfs"
},
"type": "bound",
"workflow": "search"
}
}
],
"exit":
{
"error": null,
"memory": 19480,
"runtime": 1411.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(*) : MAX(*) : MAX(*)"
},
"net":
{
"arcs": 717,
"conflict_clusters": 5,
"places": 24,
"places_significant": 24,
"singleton_clusters": 0,
"transitions": 245
},
"result":
{
"preliminary_value": "2 2 2 2 1 2 2 2 2 2 2 2 2 2 1 2 ",
"value": "2 2 2 2 1 2 2 2 2 2 2 2 2 2 1 2 "
},
"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: 269/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 768
lola: finding significant places
lola: 24 places, 245 transitions, 24 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(p14) : MAX(p5) : MAX(p12) : MAX(p13) : MAX(p6) : MAX(p21) : MAX(p19) : MAX(p20) : MAX(p18) : MAX(p20) : MAX(p1) : MAX(p19) : MAX(p1) : MAX(p14) : MAX(p4) : MAX(p16)
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 222 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(p14)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(p14)
lola: processed formula length: 8
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: 0 markings, 0 edges, 0 markings/sec, 0 secs
lola: 0 markings, 0 edges, 0 markings/sec, 5 secs
lola: 0 markings, 0 edges, 0 markings/sec, 10 secs
lola: 0 markings, 0 edges, 0 markings/sec, 15 secs
lola: 0 markings, 0 edges, 0 markings/sec, 20 secs
lola: 0 markings, 0 edges, 0 markings/sec, 25 secs
lola: Structural Bound: 4294967295
lola: 1173071 markings, 3210415 edges, 234614 markings/sec, 30 secs
lola: 2199081 markings, 6635926 edges, 205202 markings/sec, 35 secs
lola: 3203092 markings, 10071995 edges, 200802 markings/sec, 40 secs
lola: 4153055 markings, 13592414 edges, 189993 markings/sec, 45 secs
lola: 5173499 markings, 17033537 edges, 204089 markings/sec, 50 secs
lola: 6192033 markings, 20341805 edges, 203707 markings/sec, 55 secs
lola: 7156804 markings, 23700055 edges, 192954 markings/sec, 60 secs
lola: 8111762 markings, 27098681 edges, 190992 markings/sec, 65 secs
lola: 9015036 markings, 30146606 edges, 180655 markings/sec, 70 secs
lola: 9843788 markings, 33192850 edges, 165750 markings/sec, 75 secs
lola: 10665216 markings, 36272020 edges, 164286 markings/sec, 80 secs
lola: 11483278 markings, 39573085 edges, 163612 markings/sec, 85 secs
lola: SUBRESULT
lola: result: 2
lola: produced by: state space
lola: The maximum value of the given expression is 2
lola: 12163282 markings, 43462483 edges
lola: ========================================
lola: subprocess 1 will run for 231 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(p5)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(p5)
lola: processed formula length: 7
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: 0 markings, 0 edges, 0 markings/sec, 0 secs
lola: 0 markings, 0 edges, 0 markings/sec, 5 secs
lola: 0 markings, 0 edges, 0 markings/sec, 10 secs
lola: 0 markings, 0 edges, 0 markings/sec, 15 secs
lola: 0 markings, 0 edges, 0 markings/sec, 20 secs
lola: Structural Bound: 4294967295
lola: 2 markings, 1 edges, 0 markings/sec, 25 secs
lola: 967564 markings, 3193512 edges, 193512 markings/sec, 30 secs
lola: 1855392 markings, 6772840 edges, 177566 markings/sec, 35 secs
lola: 2687780 markings, 10145551 edges, 166478 markings/sec, 40 secs
lola: 3549888 markings, 13455272 edges, 172422 markings/sec, 45 secs
lola: 4341627 markings, 16900477 edges, 158348 markings/sec, 50 secs
lola: 5170271 markings, 20348970 edges, 165729 markings/sec, 55 secs
lola: 5975487 markings, 23907829 edges, 161043 markings/sec, 60 secs
lola: SUBRESULT
lola: result: 2
lola: produced by: state space
lola: The maximum value of the given expression is 2
lola: 6800536 markings, 26858644 edges
lola: ========================================
lola: subprocess 2 will run for 243 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(p12)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(p12)
lola: processed formula length: 8
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: 0 markings, 0 edges, 0 markings/sec, 0 secs
lola: 0 markings, 0 edges, 0 markings/sec, 5 secs
lola: 0 markings, 0 edges, 0 markings/sec, 10 secs
lola: 0 markings, 0 edges, 0 markings/sec, 15 secs
lola: 0 markings, 0 edges, 0 markings/sec, 20 secs
lola: Structural Bound: 4294967295
lola: 4149 markings, 7130 edges, 830 markings/sec, 25 secs
lola: 957904 markings, 3269565 edges, 190751 markings/sec, 30 secs
lola: 1829794 markings, 6838581 edges, 174378 markings/sec, 35 secs
lola: 2684508 markings, 10473533 edges, 170943 markings/sec, 40 secs
lola: 3478018 markings, 13967777 edges, 158702 markings/sec, 45 secs
lola: 4281298 markings, 17446996 edges, 160656 markings/sec, 50 secs
lola: 5128636 markings, 20798400 edges, 169468 markings/sec, 55 secs
lola: 5926879 markings, 24348553 edges, 159649 markings/sec, 60 secs
lola: 6684986 markings, 27712395 edges, 151621 markings/sec, 65 secs
lola: 7479437 markings, 31294791 edges, 158890 markings/sec, 70 secs
lola: 8265652 markings, 34896280 edges, 157243 markings/sec, 75 secs
lola: 9022931 markings, 38689709 edges, 151456 markings/sec, 80 secs
lola: 9704920 markings, 42622407 edges, 136398 markings/sec, 85 secs
lola: SUBRESULT
lola: result: 2
lola: produced by: state space
lola: The maximum value of the given expression is 2
lola: 9795373 markings, 43019175 edges
lola: ========================================
lola: subprocess 3 will run for 254 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(p13)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(p13)
lola: processed formula length: 8
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: 0 markings, 0 edges, 0 markings/sec, 0 secs
lola: 0 markings, 0 edges, 0 markings/sec, 5 secs
lola: 0 markings, 0 edges, 0 markings/sec, 10 secs
lola: 0 markings, 0 edges, 0 markings/sec, 15 secs
lola: 0 markings, 0 edges, 0 markings/sec, 20 secs
lola: 0 markings, 0 edges, 0 markings/sec, 25 secs
lola: Structural Bound: 4294967295
lola: 932266 markings, 2915648 edges, 186453 markings/sec, 30 secs
lola: 1786839 markings, 6065001 edges, 170915 markings/sec, 35 secs
lola: 2675281 markings, 9650949 edges, 177688 markings/sec, 40 secs
lola: 3419443 markings, 12767508 edges, 148832 markings/sec, 45 secs
lola: 4238693 markings, 15790934 edges, 163850 markings/sec, 50 secs
lola: 5013930 markings, 18801871 edges, 155047 markings/sec, 55 secs
lola: 5828777 markings, 21811409 edges, 162969 markings/sec, 60 secs
lola: 6552234 markings, 24849354 edges, 144691 markings/sec, 65 secs
lola: 7289859 markings, 27826375 edges, 147525 markings/sec, 70 secs
lola: 8107831 markings, 31190686 edges, 163594 markings/sec, 75 secs
lola: 8960934 markings, 34755563 edges, 170621 markings/sec, 80 secs
lola: 9782330 markings, 38561201 edges, 164279 markings/sec, 85 secs
lola: 10480903 markings, 42453954 edges, 139715 markings/sec, 90 secs
lola: SUBRESULT
lola: result: 2
lola: produced by: state space
lola: The maximum value of the given expression is 2
lola: 10666207 markings, 43303967 edges
lola: ========================================
lola: subprocess 4 will run for 268 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(p6)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(p6)
lola: processed formula length: 7
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: 0 markings, 0 edges, 0 markings/sec, 0 secs
lola: 0 markings, 0 edges, 0 markings/sec, 5 secs
lola: 0 markings, 0 edges, 0 markings/sec, 10 secs
lola: 0 markings, 0 edges, 0 markings/sec, 15 secs
lola: 0 markings, 0 edges, 0 markings/sec, 20 secs
lola: Structural Bound: 4294967295
lola: SUBRESULT
lola: result: 1
lola: produced by: state space
lola: The maximum value of the given expression is 1
lola: 1 markings, 0 edges
lola: ========================================
lola: subprocess 5 will run for 289 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(p21)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(p21)
lola: processed formula length: 8
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: 0 markings, 0 edges, 0 markings/sec, 0 secs
lola: 0 markings, 0 edges, 0 markings/sec, 5 secs
lola: 0 markings, 0 edges, 0 markings/sec, 10 secs
lola: 0 markings, 0 edges, 0 markings/sec, 15 secs
lola: 0 markings, 0 edges, 0 markings/sec, 20 secs
lola: Structural Bound: 4294967295
lola: 1853 markings, 2556 edges, 371 markings/sec, 25 secs
lola: 857617 markings, 3250820 edges, 171153 markings/sec, 30 secs
lola: 1687678 markings, 6616352 edges, 166012 markings/sec, 35 secs
lola: 2439168 markings, 9984329 edges, 150298 markings/sec, 40 secs
lola: 3055042 markings, 13226659 edges, 123175 markings/sec, 45 secs
lola: 3767939 markings, 16349568 edges, 142579 markings/sec, 50 secs
lola: 4381723 markings, 19296273 edges, 122757 markings/sec, 55 secs
lola: 5086415 markings, 22205157 edges, 140938 markings/sec, 60 secs
lola: 5767667 markings, 25518581 edges, 136250 markings/sec, 65 secs
lola: 6521873 markings, 28911209 edges, 150841 markings/sec, 70 secs
lola: 7293208 markings, 32399910 edges, 154267 markings/sec, 75 secs
lola: 8063448 markings, 35921735 edges, 154048 markings/sec, 80 secs
lola: 8873020 markings, 39528701 edges, 161914 markings/sec, 85 secs
lola: SUBRESULT
lola: result: 2
lola: produced by: state space
lola: The maximum value of the given expression is 2
lola: 9609688 markings, 43078323 edges
lola: ========================================
lola: subprocess 6 will run for 309 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(p19)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(p19)
lola: processed formula length: 8
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: 0 markings, 0 edges, 0 markings/sec, 0 secs
lola: 0 markings, 0 edges, 0 markings/sec, 5 secs
lola: 0 markings, 0 edges, 0 markings/sec, 10 secs
lola: 0 markings, 0 edges, 0 markings/sec, 15 secs
lola: 0 markings, 0 edges, 0 markings/sec, 20 secs
lola: Structural Bound: 4294967295
lola: 403 markings, 626 edges, 81 markings/sec, 25 secs
lola: 685827 markings, 3196997 edges, 137085 markings/sec, 30 secs
lola: 1308529 markings, 6494294 edges, 124540 markings/sec, 35 secs
lola: 1917891 markings, 9972575 edges, 121872 markings/sec, 40 secs
lola: 2533961 markings, 13506291 edges, 123214 markings/sec, 45 secs
lola: 3135509 markings, 17136334 edges, 120310 markings/sec, 50 secs
lola: 3659100 markings, 20865979 edges, 104718 markings/sec, 55 secs
lola: 4174627 markings, 24486553 edges, 103105 markings/sec, 60 secs
lola: 4778599 markings, 27760492 edges, 120794 markings/sec, 65 secs
lola: 5280313 markings, 30904735 edges, 100343 markings/sec, 70 secs
lola: 5709513 markings, 34128097 edges, 85840 markings/sec, 75 secs
lola: 6248589 markings, 36911092 edges, 107815 markings/sec, 80 secs
lola: 6745819 markings, 39837246 edges, 99446 markings/sec, 85 secs
lola: 7288394 markings, 43113634 edges, 108515 markings/sec, 90 secs
lola: 7756820 markings, 46585682 edges, 93685 markings/sec, 95 secs
lola: 8277081 markings, 49707357 edges, 104052 markings/sec, 100 secs
lola: 8789501 markings, 53273150 edges, 102484 markings/sec, 105 secs
lola: 9369085 markings, 56620504 edges, 115917 markings/sec, 110 secs
lola: 9899582 markings, 60339608 edges, 106099 markings/sec, 115 secs
lola: 10390206 markings, 63532112 edges, 98125 markings/sec, 120 secs
lola: 10884973 markings, 66800531 edges, 98953 markings/sec, 125 secs
lola: 11363560 markings, 70008199 edges, 95717 markings/sec, 130 secs
lola: 11907111 markings, 73891904 edges, 108710 markings/sec, 135 secs
lola: 12434289 markings, 77825665 edges, 105436 markings/sec, 140 secs
lola: SUBRESULT
lola: result: 2
lola: produced by: state space
lola: The maximum value of the given expression is 2
lola: 12796457 markings, 80549213 edges
lola: ========================================
lola: subprocess 7 will run for 327 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(p20)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(p20)
lola: processed formula length: 8
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: 0 markings, 0 edges, 0 markings/sec, 0 secs
lola: 0 markings, 0 edges, 0 markings/sec, 5 secs
lola: 0 markings, 0 edges, 0 markings/sec, 10 secs
lola: 0 markings, 0 edges, 0 markings/sec, 15 secs
lola: 0 markings, 0 edges, 0 markings/sec, 20 secs
lola: Structural Bound: 4294967295
lola: 113 markings, 116 edges, 23 markings/sec, 25 secs
lola: 825509 markings, 2845890 edges, 165079 markings/sec, 30 secs
lola: 1639778 markings, 5978508 edges, 162854 markings/sec, 35 secs
lola: 2445024 markings, 9151108 edges, 161049 markings/sec, 40 secs
lola: 3183454 markings, 12794450 edges, 147686 markings/sec, 45 secs
lola: 4019552 markings, 16147741 edges, 167220 markings/sec, 50 secs
lola: 4829082 markings, 19568802 edges, 161906 markings/sec, 55 secs
lola: 5674972 markings, 22941760 edges, 169178 markings/sec, 60 secs
lola: 6443863 markings, 26316883 edges, 153778 markings/sec, 65 secs
lola: 7206299 markings, 29482273 edges, 152487 markings/sec, 70 secs
lola: 7868263 markings, 32302181 edges, 132393 markings/sec, 75 secs
lola: 8570141 markings, 35296843 edges, 140376 markings/sec, 80 secs
lola: 9291276 markings, 38461465 edges, 144227 markings/sec, 85 secs
lola: 9946920 markings, 41877078 edges, 131129 markings/sec, 90 secs
lola: SUBRESULT
lola: result: 2
lola: produced by: state space
lola: The maximum value of the given expression is 2
lola: 10054590 markings, 42661623 edges
lola: ========================================
lola: subprocess 8 will run for 355 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(p18)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(p18)
lola: processed formula length: 8
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: 0 markings, 0 edges, 0 markings/sec, 0 secs
lola: 0 markings, 0 edges, 0 markings/sec, 5 secs
lola: 0 markings, 0 edges, 0 markings/sec, 10 secs
lola: 0 markings, 0 edges, 0 markings/sec, 15 secs
lola: 0 markings, 0 edges, 0 markings/sec, 20 secs
lola: Structural Bound: 4294967295
lola: 1657 markings, 1961 edges, 331 markings/sec, 25 secs
lola: 844482 markings, 3053533 edges, 168565 markings/sec, 30 secs
lola: 1680220 markings, 6355588 edges, 167148 markings/sec, 35 secs
lola: 2467627 markings, 9895301 edges, 157481 markings/sec, 40 secs
lola: 3223681 markings, 13248022 edges, 151211 markings/sec, 45 secs
lola: 3969036 markings, 16513121 edges, 149071 markings/sec, 50 secs
lola: 4649751 markings, 19309120 edges, 136143 markings/sec, 55 secs
lola: 5376417 markings, 22235180 edges, 145333 markings/sec, 60 secs
lola: 6041275 markings, 25150277 edges, 132972 markings/sec, 65 secs
lola: 6665414 markings, 27824880 edges, 124828 markings/sec, 70 secs
lola: 7354076 markings, 30822278 edges, 137732 markings/sec, 75 secs
lola: 8030357 markings, 33818379 edges, 135256 markings/sec, 80 secs
lola: 8733405 markings, 37101421 edges, 140610 markings/sec, 85 secs
lola: 9472742 markings, 40892036 edges, 147867 markings/sec, 90 secs
lola: SUBRESULT
lola: result: 2
lola: produced by: state space
lola: The maximum value of the given expression is 2
lola: 9703927 markings, 42469275 edges
lola: ========================================
lola: subprocess 9 will run for 392 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(p20)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(p20)
lola: processed formula length: 8
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: 0 markings, 0 edges, 0 markings/sec, 0 secs
lola: 0 markings, 0 edges, 0 markings/sec, 5 secs
lola: 0 markings, 0 edges, 0 markings/sec, 10 secs
lola: 0 markings, 0 edges, 0 markings/sec, 15 secs
lola: 0 markings, 0 edges, 0 markings/sec, 20 secs
lola: Structural Bound: 4294967295
lola: 2059 markings, 2602 edges, 412 markings/sec, 25 secs
lola: 805530 markings, 2767417 edges, 160694 markings/sec, 30 secs
lola: 1557523 markings, 5618941 edges, 150399 markings/sec, 35 secs
lola: 2360568 markings, 8729924 edges, 160609 markings/sec, 40 secs
lola: 2995117 markings, 11941931 edges, 126910 markings/sec, 45 secs
lola: 3721139 markings, 14781028 edges, 145204 markings/sec, 50 secs
lola: 4389777 markings, 17982646 edges, 133728 markings/sec, 55 secs
lola: 5208595 markings, 21088539 edges, 163764 markings/sec, 60 secs
lola: 5895023 markings, 24013466 edges, 137286 markings/sec, 65 secs
lola: 6553795 markings, 26825977 edges, 131754 markings/sec, 70 secs
lola: 7261602 markings, 29692154 edges, 141561 markings/sec, 75 secs
lola: 7937538 markings, 32625579 edges, 135187 markings/sec, 80 secs
lola: 8610423 markings, 35454249 edges, 134577 markings/sec, 85 secs
lola: 9355572 markings, 38745104 edges, 149030 markings/sec, 90 secs
lola: 10000917 markings, 42274668 edges, 129069 markings/sec, 95 secs
lola: SUBRESULT
lola: result: 2
lola: produced by: state space
lola: The maximum value of the given expression is 2
lola: 10054590 markings, 42661623 edges
lola: ========================================
lola: subprocess 10 will run for 441 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(p1)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(p1)
lola: processed formula length: 7
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: 0 markings, 0 edges, 0 markings/sec, 0 secs
lola: 0 markings, 0 edges, 0 markings/sec, 5 secs
lola: 0 markings, 0 edges, 0 markings/sec, 10 secs
lola: 0 markings, 0 edges, 0 markings/sec, 15 secs
lola: 0 markings, 0 edges, 0 markings/sec, 20 secs
lola: Structural Bound: 4294967295
lola: 2 markings, 1 edges, 0 markings/sec, 25 secs
lola: 1142711 markings, 3254816 edges, 228542 markings/sec, 30 secs
lola: 2254386 markings, 6568581 edges, 222335 markings/sec, 35 secs
lola: 3205525 markings, 10033203 edges, 190228 markings/sec, 40 secs
lola: 4149214 markings, 13541680 edges, 188738 markings/sec, 45 secs
lola: 5157476 markings, 16774978 edges, 201652 markings/sec, 50 secs
lola: 6062459 markings, 20078407 edges, 180997 markings/sec, 55 secs
lola: 7021482 markings, 23531465 edges, 191805 markings/sec, 60 secs
lola: 7945737 markings, 27097116 edges, 184851 markings/sec, 65 secs
lola: SUBRESULT
lola: result: 2
lola: produced by: state space
lola: The maximum value of the given expression is 2
lola: 8472867 markings, 29911623 edges
lola: ========================================
lola: subprocess 11 will run for 515 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(p19)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(p19)
lola: processed formula length: 8
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: 0 markings, 0 edges, 0 markings/sec, 0 secs
lola: 0 markings, 0 edges, 0 markings/sec, 5 secs
lola: 0 markings, 0 edges, 0 markings/sec, 10 secs
lola: 0 markings, 0 edges, 0 markings/sec, 15 secs
lola: 0 markings, 0 edges, 0 markings/sec, 20 secs
lola: Structural Bound: 4294967295
lola: 31 markings, 63 edges, 6 markings/sec, 25 secs
lola: 682124 markings, 3173185 edges, 136419 markings/sec, 30 secs
lola: 1287699 markings, 6407459 edges, 121115 markings/sec, 35 secs
lola: 1891193 markings, 9846396 edges, 120699 markings/sec, 40 secs
lola: 2473374 markings, 13165348 edges, 116436 markings/sec, 45 secs
lola: 3019104 markings, 16390734 edges, 109146 markings/sec, 50 secs
lola: 3516246 markings, 19793109 edges, 99428 markings/sec, 55 secs
lola: 3994494 markings, 23604771 edges, 95650 markings/sec, 60 secs
lola: 4621254 markings, 26920386 edges, 125352 markings/sec, 65 secs
lola: 5200048 markings, 30419698 edges, 115759 markings/sec, 70 secs
lola: 5732665 markings, 34323876 edges, 106523 markings/sec, 75 secs
lola: 6330691 markings, 37394855 edges, 119605 markings/sec, 80 secs
lola: 6911795 markings, 40810030 edges, 116221 markings/sec, 85 secs
lola: 7475360 markings, 44414836 edges, 112713 markings/sec, 90 secs
lola: 7987150 markings, 48048914 edges, 102358 markings/sec, 95 secs
lola: 8539618 markings, 51457508 edges, 110494 markings/sec, 100 secs
lola: 9017206 markings, 54485557 edges, 95518 markings/sec, 105 secs
lola: 9552451 markings, 57762649 edges, 107049 markings/sec, 110 secs
lola: 10081271 markings, 61396347 edges, 105764 markings/sec, 115 secs
lola: 10613501 markings, 64876376 edges, 106446 markings/sec, 120 secs
lola: 11106800 markings, 68268972 edges, 98660 markings/sec, 125 secs
lola: 11612324 markings, 71770452 edges, 101105 markings/sec, 130 secs
lola: 12151964 markings, 75668589 edges, 107928 markings/sec, 135 secs
lola: 12657336 markings, 79505438 edges, 101074 markings/sec, 140 secs
lola: SUBRESULT
lola: result: 2
lola: produced by: state space
lola: The maximum value of the given expression is 2
lola: 12796457 markings, 80549213 edges
lola: ========================================
lola: subprocess 12 will run for 607 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(p1)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(p1)
lola: processed formula length: 7
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: 0 markings, 0 edges, 0 markings/sec, 0 secs
lola: 0 markings, 0 edges, 0 markings/sec, 5 secs
lola: 0 markings, 0 edges, 0 markings/sec, 10 secs
lola: 0 markings, 0 edges, 0 markings/sec, 15 secs
lola: 0 markings, 0 edges, 0 markings/sec, 20 secs
lola: 0 markings, 0 edges, 0 markings/sec, 25 secs
lola: Structural Bound: 4294967295
lola: 1067925 markings, 2994280 edges, 213585 markings/sec, 30 secs
lola: 2144840 markings, 6196758 edges, 215383 markings/sec, 35 secs
lola: 3062952 markings, 9495021 edges, 183622 markings/sec, 40 secs
lola: 3988027 markings, 13071407 edges, 185015 markings/sec, 45 secs
lola: 5027599 markings, 16277340 edges, 207914 markings/sec, 50 secs
lola: 5930352 markings, 19684827 edges, 180551 markings/sec, 55 secs
lola: 6894462 markings, 23155278 edges, 192822 markings/sec, 60 secs
lola: 7814804 markings, 26577814 edges, 184068 markings/sec, 65 secs
lola: SUBRESULT
lola: result: 2
lola: produced by: state space
lola: The maximum value of the given expression is 2
lola: 8472867 markings, 29911623 edges
lola: ========================================
lola: subprocess 13 will run for 784 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(p14)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(p14)
lola: processed formula length: 8
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: 0 markings, 0 edges, 0 markings/sec, 0 secs
lola: 0 markings, 0 edges, 0 markings/sec, 5 secs
lola: 0 markings, 0 edges, 0 markings/sec, 10 secs
lola: 0 markings, 0 edges, 0 markings/sec, 15 secs
lola: 0 markings, 0 edges, 0 markings/sec, 20 secs
lola: 0 markings, 0 edges, 0 markings/sec, 25 secs
lola: Structural Bound: 4294967295
lola: 1181472 markings, 3235160 edges, 236294 markings/sec, 30 secs
lola: 2196184 markings, 6627649 edges, 202942 markings/sec, 35 secs
lola: 3166286 markings, 9927393 edges, 194020 markings/sec, 40 secs
lola: 4045839 markings, 13278444 edges, 175911 markings/sec, 45 secs
lola: 4976828 markings, 16292964 edges, 186198 markings/sec, 50 secs
lola: 5914669 markings, 19415705 edges, 187568 markings/sec, 55 secs
lola: 6877323 markings, 22611672 edges, 192531 markings/sec, 60 secs
lola: 7813812 markings, 25983823 edges, 187298 markings/sec, 65 secs
lola: 8733089 markings, 29177427 edges, 183855 markings/sec, 70 secs
lola: 9605814 markings, 32332899 edges, 174545 markings/sec, 75 secs
lola: 10509455 markings, 35660817 edges, 180728 markings/sec, 80 secs
lola: 11426219 markings, 39350800 edges, 183353 markings/sec, 85 secs
lola: 12128431 markings, 43204992 edges, 140442 markings/sec, 90 secs
lola: SUBRESULT
lola: result: 2
lola: produced by: state space
lola: The maximum value of the given expression is 2
lola: 12163282 markings, 43462483 edges
lola: ========================================
lola: subprocess 14 will run for 1129 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(p4)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(p4)
lola: processed formula length: 7
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: 0 markings, 0 edges, 0 markings/sec, 0 secs
lola: 0 markings, 0 edges, 0 markings/sec, 5 secs
lola: 0 markings, 0 edges, 0 markings/sec, 10 secs
lola: 0 markings, 0 edges, 0 markings/sec, 15 secs
lola: 0 markings, 0 edges, 0 markings/sec, 20 secs
lola: 0 markings, 0 edges, 0 markings/sec, 25 secs
lola: Structural Bound: 4294967295
lola: SUBRESULT
lola: result: 1
lola: produced by: state space
lola: The maximum value of the given expression is 1
lola: 1 markings, 0 edges
lola: ========================================
lola: subprocess 15 will run for 2228 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(p16)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(p16)
lola: processed formula length: 8
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: 0 markings, 0 edges, 0 markings/sec, 0 secs
lola: 0 markings, 0 edges, 0 markings/sec, 5 secs
lola: 0 markings, 0 edges, 0 markings/sec, 10 secs
lola: 0 markings, 0 edges, 0 markings/sec, 15 secs
lola: 0 markings, 0 edges, 0 markings/sec, 20 secs
lola: Structural Bound: 4294967295
lola: 0 markings, 0 edges, 0 markings/sec, 25 secs
lola: 995854 markings, 3461840 edges, 199171 markings/sec, 30 secs
lola: 1859943 markings, 7204502 edges, 172818 markings/sec, 35 secs
lola: 2742148 markings, 10729345 edges, 176441 markings/sec, 40 secs
lola: 3648387 markings, 14224535 edges, 181248 markings/sec, 45 secs
lola: 4459176 markings, 17746866 edges, 162158 markings/sec, 50 secs
lola: 5300629 markings, 21307586 edges, 168291 markings/sec, 55 secs
lola: 6137924 markings, 25102053 edges, 167459 markings/sec, 60 secs
lola: SUBRESULT
lola: result: 2
lola: produced by: state space
lola: The maximum value of the given expression is 2
lola: 6683178 markings, 28137885 edges
lola: RESULT
lola:
SUMMARY: 2 2 2 2 1 2 2 2 2 2 2 2 2 2 1 2
lola:
preliminary result: 2 2 2 2 1 2 2 2 2 2 2 2 2 2 1 2
lola: ========================================
lola: memory consumption: 19480 KB
lola: time consumption: 1411 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="DNAwalker-PT-08ringLL"
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 DNAwalker-PT-08ringLL, 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 r178-tajo-158987881900141"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/DNAwalker-PT-08ringLL.tgz
mv DNAwalker-PT-08ringLL 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 ;