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-158987882000165.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-11ringRR, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r178-tajo-158987882000165
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 280K
-rw-r--r-- 1 mcc users 3.4K Mar 31 04:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 19K Mar 31 04:58 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.7K Mar 29 20:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 29 20:54 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.1K Apr 8 14:52 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 28 14:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.2K Mar 28 13:42 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 16K Mar 28 13:42 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.0K Mar 27 06:26 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 19K 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-11ringRR-UpperBounds-00
FORMULA_NAME DNAwalker-PT-11ringRR-UpperBounds-01
FORMULA_NAME DNAwalker-PT-11ringRR-UpperBounds-02
FORMULA_NAME DNAwalker-PT-11ringRR-UpperBounds-03
FORMULA_NAME DNAwalker-PT-11ringRR-UpperBounds-04
FORMULA_NAME DNAwalker-PT-11ringRR-UpperBounds-05
FORMULA_NAME DNAwalker-PT-11ringRR-UpperBounds-06
FORMULA_NAME DNAwalker-PT-11ringRR-UpperBounds-07
FORMULA_NAME DNAwalker-PT-11ringRR-UpperBounds-08
FORMULA_NAME DNAwalker-PT-11ringRR-UpperBounds-09
FORMULA_NAME DNAwalker-PT-11ringRR-UpperBounds-10
FORMULA_NAME DNAwalker-PT-11ringRR-UpperBounds-11
FORMULA_NAME DNAwalker-PT-11ringRR-UpperBounds-12
FORMULA_NAME DNAwalker-PT-11ringRR-UpperBounds-13
FORMULA_NAME DNAwalker-PT-11ringRR-UpperBounds-14
FORMULA_NAME DNAwalker-PT-11ringRR-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1591206796510

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-03 17:53:18] [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:53:18] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-03 17:53:18] [INFO ] Load time of PNML (sax parser for PT used): 62 ms
[2020-06-03 17:53:18] [INFO ] Transformed 27 places.
[2020-06-03 17:53:18] [INFO ] Transformed 260 transitions.
[2020-06-03 17:53:18] [INFO ] Parsed PT model containing 27 places and 260 transitions in 97 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 10 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:53:18] [INFO ] Flatten gal took : 42 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:53:18] [INFO ] Flow matrix only has 259 transitions (discarded 1 similar events)
// Phase 1: matrix 259 rows 27 cols
[2020-06-03 17:53:18] [INFO ] Computed 0 place invariants in 6 ms
Support contains 14 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 34 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:53:18] [INFO ] Computed 0 place invariants in 2 ms
[2020-06-03 17:53:18] [INFO ] Dead Transitions using invariants and state equation in 226 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 2 ms. (steps per millisecond=0 )
Finished probabilistic random walk after 0 steps, run visited all 0 properties in 0 ms. (steps per millisecond=0 )
// Phase 1: matrix 252 rows 25 cols
[2020-06-03 17:53:18] [INFO ] Computed 0 place invariants in 2 ms
Support contains 14 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 6 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 8 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:53:18] [INFO ] Computed 0 place invariants in 1 ms
[2020-06-03 17:53:18] [INFO ] Implicit Places using invariants in 35 ms returned []
// Phase 1: matrix 252 rows 25 cols
[2020-06-03 17:53:18] [INFO ] Computed 0 place invariants in 3 ms
[2020-06-03 17:53:18] [INFO ] State equation strengthened by 41 read => feed constraints.
[2020-06-03 17:53:19] [INFO ] Implicit Places using invariants and state equation in 127 ms returned [19]
Discarding 1 places :
Drop transitions removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Implicit Place search using SMT with State Equation took 171 ms to find 1 implicit places.
[2020-06-03 17:53:19] [INFO ] Redundant transitions in 107 ms returned []
// Phase 1: matrix 247 rows 24 cols
[2020-06-03 17:53:19] [INFO ] Computed 0 place invariants in 4 ms
[2020-06-03 17:53:19] [INFO ] Dead Transitions using invariants and state equation in 129 ms returned []
Starting structural reductions, iteration 1 : 24/25 places, 247/252 transitions.
Applied a total of 0 rules in 19 ms. Remains 24 /24 variables (removed 0) and now considering 247/247 (removed 0) transitions.
[2020-06-03 17:53:19] [INFO ] Redundant transitions in 53 ms returned []
// Phase 1: matrix 247 rows 24 cols
[2020-06-03 17:53:19] [INFO ] Computed 0 place invariants in 1 ms
[2020-06-03 17:53:19] [INFO ] Dead Transitions using invariants and state equation in 128 ms returned []
Finished structural reductions, in 2 iterations. Remains : 24/25 places, 247/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 247 rows 24 cols
[2020-06-03 17:53:19] [INFO ] Computed 0 place invariants in 1 ms
Support contains 14 out of 24 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 24/24 places, 247/247 transitions.
Applied a total of 0 rules in 3 ms. Remains 24 /24 variables (removed 0) and now considering 247/247 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 24/24 places, 247/247 transitions.
Starting structural reductions, iteration 0 : 24/24 places, 247/247 transitions.
Applied a total of 0 rules in 2 ms. Remains 24 /24 variables (removed 0) and now considering 247/247 (removed 0) transitions.
// Phase 1: matrix 247 rows 24 cols
[2020-06-03 17:53:19] [INFO ] Computed 0 place invariants in 0 ms
[2020-06-03 17:53:19] [INFO ] Implicit Places using invariants in 29 ms returned []
// Phase 1: matrix 247 rows 24 cols
[2020-06-03 17:53:19] [INFO ] Computed 0 place invariants in 1 ms
[2020-06-03 17:53:19] [INFO ] State equation strengthened by 41 read => feed constraints.
[2020-06-03 17:53:19] [INFO ] Implicit Places using invariants and state equation in 85 ms returned []
Implicit Place search using SMT with State Equation took 115 ms to find 0 implicit places.
[2020-06-03 17:53:19] [INFO ] Redundant transitions in 33 ms returned []
// Phase 1: matrix 247 rows 24 cols
[2020-06-03 17:53:19] [INFO ] Computed 0 place invariants in 1 ms
[2020-06-03 17:53:19] [INFO ] Dead Transitions using invariants and state equation in 91 ms returned []
Finished structural reductions, in 1 iterations. Remains : 24/24 places, 247/247 transitions.
Finished random walk after 0 steps, including 0 resets, run visited all 0 properties in 2 ms. (steps per millisecond=0 )
Applied a total of 0 rules in 3 ms. Remains 24 /24 variables (removed 0) and now considering 247/247 (removed 0) transitions.
// Phase 1: matrix 247 rows 24 cols
[2020-06-03 17:53:19] [INFO ] Computed 0 place invariants in 1 ms
[2020-06-03 17:53:19] [INFO ] Export to MCC properties in file /home/mcc/execution/UpperBounds.sr.xml took 1 ms.
[2020-06-03 17:53:19] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 4 ms.
info: Time: 3600 - MCC
vrfy: Checking UpperBounds @ DNAwalker-PT-11ringRR @ 3570 seconds

FORMULA DNAwalker-PT-11ringRR-UpperBounds-00 2 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DNAwalker-PT-11ringRR-UpperBounds-01 2 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DNAwalker-PT-11ringRR-UpperBounds-02 2 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DNAwalker-PT-11ringRR-UpperBounds-03 2 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DNAwalker-PT-11ringRR-UpperBounds-04 2 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DNAwalker-PT-11ringRR-UpperBounds-05 2 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DNAwalker-PT-11ringRR-UpperBounds-06 2 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DNAwalker-PT-11ringRR-UpperBounds-07 2 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DNAwalker-PT-11ringRR-UpperBounds-08 1 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DNAwalker-PT-11ringRR-UpperBounds-09 2 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DNAwalker-PT-11ringRR-UpperBounds-10 2 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

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

FORMULA DNAwalker-PT-11ringRR-UpperBounds-12 2 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DNAwalker-PT-11ringRR-UpperBounds-13 1 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DNAwalker-PT-11ringRR-UpperBounds-14 2 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

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

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 223
},
"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": 30436913,
"markings": 7401710,
"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": 233
},
"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(p2)",
"processed_size": 7,
"rewrites": 0
},
"result":
{
"edges": 46178687,
"markings": 11042051,
"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": 242
},
"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": 45363118,
"markings": 10480818,
"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(p21)",
"processed_size": 8,
"rewrites": 0
},
"result":
{
"edges": 29980505,
"markings": 6901938,
"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": 269
},
"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(p7)",
"processed_size": 7,
"rewrites": 0
},
"result":
{
"edges": 45634484,
"markings": 10434253,
"produced_by": "search",
"value": 2
},
"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": 285
},
"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(p2)",
"processed_size": 7,
"rewrites": 0
},
"result":
{
"edges": 46178687,
"markings": 11042051,
"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": 304
},
"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": 45363118,
"markings": 10480818,
"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": 328
},
"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": 45331208,
"markings": 10050699,
"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": 357
},
"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(p10)",
"processed_size": 8,
"rewrites": 0
},
"result":
{
"edges": 0,
"markings": 1,
"produced_by": "search",
"value": 1
},
"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": 404
},
"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(p17)",
"processed_size": 8,
"rewrites": 0
},
"result":
{
"edges": 45780531,
"markings": 9925633,
"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": 456
},
"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(p3)",
"processed_size": 7,
"rewrites": 0
},
"result":
{
"edges": 45884583,
"markings": 10420095,
"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": 529
},
"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(p8)",
"processed_size": 7,
"rewrites": 0
},
"result":
{
"edges": 45708494,
"markings": 9909583,
"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": 637
},
"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(p9)",
"processed_size": 7,
"rewrites": 0
},
"result":
{
"edges": 28338474,
"markings": 6752676,
"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": 826
},
"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": 0,
"markings": 1,
"produced_by": "search",
"value": 1
},
"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": 1224
},
"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": 46651487,
"markings": 12586683,
"produced_by": "search",
"value": 2
},
"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": 2350
},
"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": 85453073,
"markings": 13074377,
"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": 19496,
"runtime": 1372.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": 719,
"conflict_clusters": 5,
"places": 24,
"places_significant": 24,
"singleton_clusters": 0,
"transitions": 247
},
"result":
{
"preliminary_value": "2 2 2 2 2 2 2 2 1 2 2 2 2 1 2 2 ",
"value": "2 2 2 2 2 2 2 2 1 2 2 2 2 1 2 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: 271/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 768
lola: finding significant places
lola: 24 places, 247 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(p13) : MAX(p2) : MAX(p19) : MAX(p21) : MAX(p7) : MAX(p2) : MAX(p19) : MAX(p20) : MAX(p10) : MAX(p17) : MAX(p3) : MAX(p8) : MAX(p9) : MAX(p12) : MAX(p1) : MAX(p6)
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 223 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: Structural Bound: 4294967295
lola: 742 markings, 793 edges, 148 markings/sec, 25 secs
lola: 1018415 markings, 3383066 edges, 203535 markings/sec, 30 secs
lola: 1912653 markings, 6626821 edges, 178848 markings/sec, 35 secs
lola: 2816233 markings, 10238164 edges, 180716 markings/sec, 40 secs
lola: 3711469 markings, 14035419 edges, 179047 markings/sec, 45 secs
lola: 4585373 markings, 17394392 edges, 174781 markings/sec, 50 secs
lola: 5367618 markings, 20685834 edges, 156449 markings/sec, 55 secs
lola: 6210797 markings, 24303514 edges, 168636 markings/sec, 60 secs
lola: 7047854 markings, 28322145 edges, 167411 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: 7401710 markings, 30436913 edges
lola: ========================================
lola: subprocess 1 will run for 233 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(p2)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(p2)
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: 3136 markings, 3722 edges, 627 markings/sec, 25 secs
lola: 894105 markings, 2973732 edges, 178194 markings/sec, 30 secs
lola: 1638704 markings, 5837681 edges, 148920 markings/sec, 35 secs
lola: 2465552 markings, 9031265 edges, 165370 markings/sec, 40 secs
lola: 3257607 markings, 12592629 edges, 158411 markings/sec, 45 secs
lola: 4047619 markings, 16281100 edges, 158002 markings/sec, 50 secs
lola: 4774552 markings, 19859346 edges, 145387 markings/sec, 55 secs
lola: 5655340 markings, 22935802 edges, 176158 markings/sec, 60 secs
lola: 6472384 markings, 26095322 edges, 163409 markings/sec, 65 secs
lola: 7187699 markings, 29138480 edges, 143063 markings/sec, 70 secs
lola: 7934426 markings, 32178685 edges, 149345 markings/sec, 75 secs
lola: 8635786 markings, 35697454 edges, 140272 markings/sec, 80 secs
lola: 9394797 markings, 39376955 edges, 151802 markings/sec, 85 secs
lola: 10263601 markings, 43243940 edges, 173761 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: 11042051 markings, 46178687 edges
lola: ========================================
lola: subprocess 2 will run for 242 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: 1785 markings, 2021 edges, 357 markings/sec, 25 secs
lola: 878012 markings, 3241176 edges, 175245 markings/sec, 30 secs
lola: 1792998 markings, 6524042 edges, 182997 markings/sec, 35 secs
lola: 2646528 markings, 10371963 edges, 170706 markings/sec, 40 secs
lola: 3556948 markings, 14267027 edges, 182084 markings/sec, 45 secs
lola: 4352569 markings, 17817958 edges, 159124 markings/sec, 50 secs
lola: 5173334 markings, 21006565 edges, 164153 markings/sec, 55 secs
lola: 6034440 markings, 24473473 edges, 172221 markings/sec, 60 secs
lola: 6956507 markings, 28122099 edges, 184413 markings/sec, 65 secs
lola: 7730206 markings, 31844235 edges, 154740 markings/sec, 70 secs
lola: 8578871 markings, 35457779 edges, 169733 markings/sec, 75 secs
lola: 9329516 markings, 38869922 edges, 150129 markings/sec, 80 secs
lola: 10173761 markings, 43154122 edges, 168849 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: 10480818 markings, 45363118 edges
lola: ========================================
lola: subprocess 3 will run for 254 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: 0 markings, 0 edges, 0 markings/sec, 25 secs
lola: Structural Bound: 4294967295
lola: 911091 markings, 3361902 edges, 182218 markings/sec, 30 secs
lola: 1787418 markings, 7010479 edges, 175265 markings/sec, 35 secs
lola: 2618154 markings, 10845383 edges, 166147 markings/sec, 40 secs
lola: 3456099 markings, 14410421 edges, 167589 markings/sec, 45 secs
lola: 4270202 markings, 17834816 edges, 162821 markings/sec, 50 secs
lola: 5081545 markings, 21382869 edges, 162269 markings/sec, 55 secs
lola: 5856498 markings, 25060896 edges, 154991 markings/sec, 60 secs
lola: 6725630 markings, 29046523 edges, 173826 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: 6901938 markings, 29980505 edges
lola: ========================================
lola: subprocess 4 will run for 269 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(p7)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(p7)
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: 920 markings, 1029 edges, 184 markings/sec, 25 secs
lola: 994910 markings, 3362954 edges, 198798 markings/sec, 30 secs
lola: 1826904 markings, 6513983 edges, 166399 markings/sec, 35 secs
lola: 2644748 markings, 9955868 edges, 163569 markings/sec, 40 secs
lola: 3451994 markings, 13628215 edges, 161449 markings/sec, 45 secs
lola: 4252276 markings, 17303036 edges, 160056 markings/sec, 50 secs
lola: 5131769 markings, 20807988 edges, 175899 markings/sec, 55 secs
lola: 6003639 markings, 24141869 edges, 174374 markings/sec, 60 secs
lola: 6817327 markings, 27610325 edges, 162738 markings/sec, 65 secs
lola: 7538392 markings, 30922460 edges, 144213 markings/sec, 70 secs
lola: 8262700 markings, 34468631 edges, 144862 markings/sec, 75 secs
lola: 9042144 markings, 38223396 edges, 155889 markings/sec, 80 secs
lola: 9724165 markings, 42298411 edges, 136404 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: 10434253 markings, 45634484 edges
lola: ========================================
lola: subprocess 5 will run for 285 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(p2)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(p2)
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: 976183 markings, 3267725 edges, 195237 markings/sec, 30 secs
lola: 1811305 markings, 6682192 edges, 167024 markings/sec, 35 secs
lola: 2753281 markings, 10247538 edges, 188395 markings/sec, 40 secs
lola: 3548609 markings, 13922726 edges, 159066 markings/sec, 45 secs
lola: 4388922 markings, 17807311 edges, 168063 markings/sec, 50 secs
lola: 5160388 markings, 21223312 edges, 154293 markings/sec, 55 secs
lola: 6017234 markings, 24345837 edges, 171369 markings/sec, 60 secs
lola: 6760604 markings, 27474838 edges, 148674 markings/sec, 65 secs
lola: 7649769 markings, 30980892 edges, 177833 markings/sec, 70 secs
lola: 8418047 markings, 34596389 edges, 153656 markings/sec, 75 secs
lola: 9198196 markings, 38405617 edges, 156030 markings/sec, 80 secs
lola: 10005092 markings, 42337769 edges, 161379 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: 11042051 markings, 46178687 edges
lola: ========================================
lola: subprocess 6 will run for 304 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: 3414 markings, 4490 edges, 683 markings/sec, 25 secs
lola: 964396 markings, 3532380 edges, 192196 markings/sec, 30 secs
lola: 1979921 markings, 7207113 edges, 203105 markings/sec, 35 secs
lola: 2824186 markings, 11140769 edges, 168853 markings/sec, 40 secs
lola: 3764090 markings, 15155401 edges, 187981 markings/sec, 45 secs
lola: 4629244 markings, 19167698 edges, 173031 markings/sec, 50 secs
lola: 5546499 markings, 22568140 edges, 183451 markings/sec, 55 secs
lola: 6399586 markings, 25859880 edges, 170617 markings/sec, 60 secs
lola: 7276038 markings, 29703635 edges, 175290 markings/sec, 65 secs
lola: 8096668 markings, 33386205 edges, 164126 markings/sec, 70 secs
lola: 8956741 markings, 37205460 edges, 172015 markings/sec, 75 secs
lola: 9875569 markings, 41394805 edges, 183766 markings/sec, 80 secs
lola: SUBRESULT
lola: result: 2
lola: produced by: state space
lola: The maximum value of the given expression is 2
lola: 10480818 markings, 45363118 edges
lola: ========================================
lola: subprocess 7 will run for 328 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: 3544 markings, 5029 edges, 709 markings/sec, 25 secs
lola: 891136 markings, 3376798 edges, 177518 markings/sec, 30 secs
lola: 1808888 markings, 6995149 edges, 183550 markings/sec, 35 secs
lola: 2627024 markings, 10852849 edges, 163627 markings/sec, 40 secs
lola: 3473358 markings, 14831709 edges, 169267 markings/sec, 45 secs
lola: 4261141 markings, 18737458 edges, 157557 markings/sec, 50 secs
lola: 5151545 markings, 22123613 edges, 178081 markings/sec, 55 secs
lola: 5984960 markings, 25663019 edges, 166683 markings/sec, 60 secs
lola: 6831341 markings, 29418440 edges, 169276 markings/sec, 65 secs
lola: 7620748 markings, 33229401 edges, 157881 markings/sec, 70 secs
lola: 8441043 markings, 37080577 edges, 164059 markings/sec, 75 secs
lola: 9253514 markings, 40942261 edges, 162494 markings/sec, 80 secs
lola: 10003332 markings, 45142001 edges, 149964 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: 10050699 markings, 45331208 edges
lola: ========================================
lola: subprocess 8 will run for 357 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(p10)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(p10)
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: 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: 1 markings, 0 edges, 0 markings/sec, 25 secs
lola: ========================================
lola: subprocess 9 will run for 404 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(p17)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(p17)
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: 938 markings, 1087 edges, 188 markings/sec, 25 secs
lola: 900621 markings, 3377210 edges, 179937 markings/sec, 30 secs
lola: 1782308 markings, 6875032 edges, 176337 markings/sec, 35 secs
lola: 2687839 markings, 10543290 edges, 181106 markings/sec, 40 secs
lola: 3553733 markings, 14343761 edges, 173179 markings/sec, 45 secs
lola: 4350638 markings, 18435927 edges, 159381 markings/sec, 50 secs
lola: 5170526 markings, 22019842 edges, 163978 markings/sec, 55 secs
lola: 5925342 markings, 25450513 edges, 150963 markings/sec, 60 secs
lola: 6728485 markings, 29038827 edges, 160629 markings/sec, 65 secs
lola: 7547154 markings, 32667800 edges, 163734 markings/sec, 70 secs
lola: 8315302 markings, 36519090 edges, 153630 markings/sec, 75 secs
lola: 9059281 markings, 40538990 edges, 148796 markings/sec, 80 secs
lola: 9768160 markings, 44728405 edges, 141776 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: 9925633 markings, 45780531 edges
lola: ========================================
lola: subprocess 10 will run for 456 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(p3)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(p3)
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: 1907 markings, 2219 edges, 381 markings/sec, 25 secs
lola: 927087 markings, 3313095 edges, 185036 markings/sec, 30 secs
lola: 1685511 markings, 6553492 edges, 151685 markings/sec, 35 secs
lola: 2563321 markings, 10060149 edges, 175562 markings/sec, 40 secs
lola: 3303067 markings, 13703218 edges, 147949 markings/sec, 45 secs
lola: 4101171 markings, 17558853 edges, 159621 markings/sec, 50 secs
lola: 4828145 markings, 20941145 edges, 145395 markings/sec, 55 secs
lola: 5635816 markings, 24030892 edges, 161534 markings/sec, 60 secs
lola: 6355022 markings, 27212695 edges, 143841 markings/sec, 65 secs
lola: 7167709 markings, 30539393 edges, 162537 markings/sec, 70 secs
lola: 7853705 markings, 33890490 edges, 137199 markings/sec, 75 secs
lola: 8572253 markings, 37566150 edges, 143710 markings/sec, 80 secs
lola: 9290861 markings, 41333021 edges, 143722 markings/sec, 85 secs
lola: 10277096 markings, 45102137 edges, 197247 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: 10420095 markings, 45884583 edges
lola: ========================================
lola: subprocess 11 will run for 529 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(p8)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(p8)
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: 1744 markings, 2206 edges, 349 markings/sec, 25 secs
lola: 903739 markings, 3268736 edges, 180399 markings/sec, 30 secs
lola: 1738047 markings, 6590157 edges, 166862 markings/sec, 35 secs
lola: 2524021 markings, 10338792 edges, 157195 markings/sec, 40 secs
lola: 3286094 markings, 13955782 edges, 152415 markings/sec, 45 secs
lola: 4103784 markings, 17587671 edges, 163538 markings/sec, 50 secs
lola: 4941167 markings, 21030623 edges, 167477 markings/sec, 55 secs
lola: 5721296 markings, 24334848 edges, 156026 markings/sec, 60 secs
lola: 6446268 markings, 27688740 edges, 144994 markings/sec, 65 secs
lola: 7093688 markings, 30954957 edges, 129484 markings/sec, 70 secs
lola: 7815123 markings, 34401031 edges, 144287 markings/sec, 75 secs
lola: 8549200 markings, 38005098 edges, 146815 markings/sec, 80 secs
lola: 9152292 markings, 41649170 edges, 120618 markings/sec, 85 secs
lola: 9852749 markings, 45403732 edges, 140091 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: 9909583 markings, 45708494 edges
lola: ========================================
lola: subprocess 12 will run for 637 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(p9)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(p9)
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: 2171 markings, 3449 edges, 434 markings/sec, 25 secs
lola: 942397 markings, 3143058 edges, 188045 markings/sec, 30 secs
lola: 1793643 markings, 6598096 edges, 170249 markings/sec, 35 secs
lola: 2680577 markings, 10209690 edges, 177387 markings/sec, 40 secs
lola: 3527376 markings, 13550271 edges, 169360 markings/sec, 45 secs
lola: 4286799 markings, 16561240 edges, 151885 markings/sec, 50 secs
lola: 5033416 markings, 19921865 edges, 149323 markings/sec, 55 secs
lola: 5810515 markings, 23331266 edges, 155420 markings/sec, 60 secs
lola: 6482064 markings, 27059439 edges, 134310 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: 6752676 markings, 28338474 edges
lola: ========================================
lola: subprocess 13 will run for 826 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: 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 14 will run for 1224 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: 1581 markings, 1698 edges, 316 markings/sec, 25 secs
lola: 1039406 markings, 3173779 edges, 207565 markings/sec, 30 secs
lola: 2053907 markings, 6505759 edges, 202900 markings/sec, 35 secs
lola: 3052607 markings, 9990627 edges, 199740 markings/sec, 40 secs
lola: 4045063 markings, 13553752 edges, 198491 markings/sec, 45 secs
lola: 5084629 markings, 17306655 edges, 207913 markings/sec, 50 secs
lola: 6053175 markings, 20771484 edges, 193709 markings/sec, 55 secs
lola: 6967479 markings, 23934799 edges, 182861 markings/sec, 60 secs
lola: 7811597 markings, 26717035 edges, 168824 markings/sec, 65 secs
lola: 8633807 markings, 29837484 edges, 164442 markings/sec, 70 secs
lola: 9586490 markings, 33148569 edges, 190537 markings/sec, 75 secs
lola: 10518089 markings, 36730906 edges, 186320 markings/sec, 80 secs
lola: 11478987 markings, 40470836 edges, 192180 markings/sec, 85 secs
lola: 12271996 markings, 44420743 edges, 158602 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: 12586683 markings, 46651487 edges
lola: ========================================
lola: subprocess 15 will run for 2350 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: 113 markings, 260 edges, 23 markings/sec, 25 secs
lola: 661340 markings, 3278583 edges, 132245 markings/sec, 30 secs
lola: 1275430 markings, 6693456 edges, 122818 markings/sec, 35 secs
lola: 1885409 markings, 9966387 edges, 121996 markings/sec, 40 secs
lola: 2463905 markings, 13463306 edges, 115699 markings/sec, 45 secs
lola: 3033814 markings, 17039617 edges, 113982 markings/sec, 50 secs
lola: 3609809 markings, 20681576 edges, 115199 markings/sec, 55 secs
lola: 4142592 markings, 24393138 edges, 106557 markings/sec, 60 secs
lola: 4691897 markings, 28069591 edges, 109861 markings/sec, 65 secs
lola: 5238779 markings, 31936841 edges, 109376 markings/sec, 70 secs
lola: 5774998 markings, 35833694 edges, 107244 markings/sec, 75 secs
lola: 6331371 markings, 39124722 edges, 111275 markings/sec, 80 secs
lola: 6909948 markings, 42251457 edges, 115715 markings/sec, 85 secs
lola: 7436411 markings, 45417105 edges, 105293 markings/sec, 90 secs
lola: 7976038 markings, 48643510 edges, 107925 markings/sec, 95 secs
lola: 8506244 markings, 52017323 edges, 106041 markings/sec, 100 secs
lola: 9002916 markings, 55480615 edges, 99334 markings/sec, 105 secs
lola: 9522773 markings, 58667023 edges, 103971 markings/sec, 110 secs
lola: 9985411 markings, 61956628 edges, 92528 markings/sec, 115 secs
lola: 10459171 markings, 65431009 edges, 94752 markings/sec, 120 secs
lola: 10955776 markings, 68865478 edges, 99321 markings/sec, 125 secs
lola: 11431606 markings, 72434337 edges, 95166 markings/sec, 130 secs
lola: 11908498 markings, 76183122 edges, 95378 markings/sec, 135 secs
lola: 12383450 markings, 80067305 edges, 94990 markings/sec, 140 secs
lola: 12868212 markings, 83929529 edges, 96952 markings/sec, 145 secs
lola: SUBRESULT
lola: result: 2
lola: produced by: state space
lola: The maximum value of the given expression is 2
lola: 13074377 markings, 85453073 edges
lola: RESULT
lola:
SUMMARY: 2 2 2 2 2 2 2 2 1 2 2 2 2 1 2 2
lola:
preliminary result: 2 2 2 2 2 2 2 2 1 2 2 2 2 1 2 2
lola: ========================================
lola: memory consumption: 19496 KB
lola: time consumption: 1372 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-11ringRR"
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-11ringRR, 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-158987882000165"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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