fond
Model Checking Contest 2020
10th edition, Paris, France, June 23, 2020
Execution of r211-tajo-159033478401085
Last Updated
Jun 28, 2020

About the Execution of ITS-LoLa for ShieldRVt-PT-100A

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
15789.590 3600000.00 861479.00 13740.10 1 1 1 1 1 1 1 ? 1 1 1 1 1 1 1 1 normal

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.r211-tajo-159033478401085.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 ShieldRVt-PT-100A, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r211-tajo-159033478401085
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 444K
-rw-r--r-- 1 mcc users 3.5K May 14 03:37 CTLCardinality.txt
-rw-r--r-- 1 mcc users 20K May 14 03:37 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K May 13 21:12 CTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 13 21:12 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K May 14 10:05 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 14 10:05 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K May 14 10:05 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 14 10:05 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 May 12 20:42 NewModel
-rw-r--r-- 1 mcc users 3.4K May 13 14:56 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 17K May 13 14:56 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.4K May 13 10:13 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 14K May 13 10:13 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 13 16:53 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 13 16:53 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 12 20:42 equiv_col
-rw-r--r-- 1 mcc users 5 May 12 20:42 instance
-rw-r--r-- 1 mcc users 6 May 12 20:42 iscolored
-rw-r--r-- 1 mcc users 273K May 12 20:42 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 ShieldRVt-PT-100A-UpperBounds-00
FORMULA_NAME ShieldRVt-PT-100A-UpperBounds-01
FORMULA_NAME ShieldRVt-PT-100A-UpperBounds-02
FORMULA_NAME ShieldRVt-PT-100A-UpperBounds-03
FORMULA_NAME ShieldRVt-PT-100A-UpperBounds-04
FORMULA_NAME ShieldRVt-PT-100A-UpperBounds-05
FORMULA_NAME ShieldRVt-PT-100A-UpperBounds-06
FORMULA_NAME ShieldRVt-PT-100A-UpperBounds-07
FORMULA_NAME ShieldRVt-PT-100A-UpperBounds-08
FORMULA_NAME ShieldRVt-PT-100A-UpperBounds-09
FORMULA_NAME ShieldRVt-PT-100A-UpperBounds-10
FORMULA_NAME ShieldRVt-PT-100A-UpperBounds-11
FORMULA_NAME ShieldRVt-PT-100A-UpperBounds-12
FORMULA_NAME ShieldRVt-PT-100A-UpperBounds-13
FORMULA_NAME ShieldRVt-PT-100A-UpperBounds-14
FORMULA_NAME ShieldRVt-PT-100A-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1591341053401

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-05 07:10:55] [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-05 07:10:55] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-05 07:10:56] [INFO ] Load time of PNML (sax parser for PT used): 172 ms
[2020-06-05 07:10:56] [INFO ] Transformed 803 places.
[2020-06-05 07:10:56] [INFO ] Transformed 803 transitions.
[2020-06-05 07:10:56] [INFO ] Found NUPN structural information;
[2020-06-05 07:10:56] [INFO ] Parsed PT model containing 803 places and 803 transitions in 250 ms.
Ensure Unique test removed 1 transitions
Reduce redundant transitions removed 1 transitions.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 76 ms.
Finished random walk after 0 steps, including 0 resets, run visited all 0 properties in 2 ms. (steps per millisecond=0 )
[2020-06-05 07:10:56] [INFO ] Flatten gal took : 300 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 )
// Phase 1: matrix 802 rows 803 cols
[2020-06-05 07:10:56] [INFO ] Computed 401 place invariants in 46 ms
Support contains 16 out of 803 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 803/803 places, 802/802 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 802 transition count 801
Partial Free-agglomeration rule applied 96 times.
Drop transitions removed 96 transitions
Iterating global reduction 0 with 96 rules applied. Total rules applied 98 place count 802 transition count 801
Drop transitions removed 96 transitions
Redundant transition composition rules discarded 96 transitions
Iterating global reduction 0 with 96 rules applied. Total rules applied 194 place count 802 transition count 705
Applied a total of 194 rules in 435 ms. Remains 802 /803 variables (removed 1) and now considering 705/802 (removed 97) transitions.
Finished structural reductions, in 1 iterations. Remains : 802/803 places, 705/802 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 705 rows 802 cols
[2020-06-05 07:10:57] [INFO ] Computed 401 place invariants in 4 ms
Support contains 16 out of 802 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 802/802 places, 705/705 transitions.
Applied a total of 0 rules in 60 ms. Remains 802 /802 variables (removed 0) and now considering 705/705 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 802/802 places, 705/705 transitions.
Starting structural reductions, iteration 0 : 802/802 places, 705/705 transitions.
Applied a total of 0 rules in 27 ms. Remains 802 /802 variables (removed 0) and now considering 705/705 (removed 0) transitions.
// Phase 1: matrix 705 rows 802 cols
[2020-06-05 07:10:57] [INFO ] Computed 401 place invariants in 3 ms
[2020-06-05 07:10:58] [INFO ] Implicit Places using invariants in 1337 ms returned [795]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 1340 ms to find 1 implicit places.
[2020-06-05 07:10:59] [INFO ] Redundant transitions in 483 ms returned []
// Phase 1: matrix 705 rows 801 cols
[2020-06-05 07:10:59] [INFO ] Computed 400 place invariants in 30 ms
[2020-06-05 07:11:00] [INFO ] Dead Transitions using invariants and state equation in 1489 ms returned []
Starting structural reductions, iteration 1 : 801/802 places, 705/705 transitions.
Applied a total of 0 rules in 51 ms. Remains 801 /801 variables (removed 0) and now considering 705/705 (removed 0) transitions.
[2020-06-05 07:11:01] [INFO ] Redundant transitions in 334 ms returned []
// Phase 1: matrix 705 rows 801 cols
[2020-06-05 07:11:01] [INFO ] Computed 400 place invariants in 3 ms
[2020-06-05 07:11:06] [INFO ] Dead Transitions using invariants and state equation in 5062 ms returned []
Finished structural reductions, in 2 iterations. Remains : 801/802 places, 705/705 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 705 rows 801 cols
[2020-06-05 07:11:06] [INFO ] Computed 400 place invariants in 5 ms
Support contains 16 out of 801 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 801/801 places, 705/705 transitions.
Applied a total of 0 rules in 45 ms. Remains 801 /801 variables (removed 0) and now considering 705/705 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 801/801 places, 705/705 transitions.
Starting structural reductions, iteration 0 : 801/801 places, 705/705 transitions.
Applied a total of 0 rules in 31 ms. Remains 801 /801 variables (removed 0) and now considering 705/705 (removed 0) transitions.
// Phase 1: matrix 705 rows 801 cols
[2020-06-05 07:11:06] [INFO ] Computed 400 place invariants in 4 ms
[2020-06-05 07:11:07] [INFO ] Implicit Places using invariants in 1311 ms returned []
// Phase 1: matrix 705 rows 801 cols
[2020-06-05 07:11:07] [INFO ] Computed 400 place invariants in 2 ms
[2020-06-05 07:11:12] [INFO ] Implicit Places using invariants and state equation in 4980 ms returned []
Implicit Place search using SMT with State Equation took 6302 ms to find 0 implicit places.
[2020-06-05 07:11:13] [INFO ] Redundant transitions in 293 ms returned []
// Phase 1: matrix 705 rows 801 cols
[2020-06-05 07:11:13] [INFO ] Computed 400 place invariants in 4 ms
[2020-06-05 07:11:14] [INFO ] Dead Transitions using invariants and state equation in 1534 ms returned []
Finished structural reductions, in 1 iterations. Remains : 801/801 places, 705/705 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 31 ms. Remains 801 /801 variables (removed 0) and now considering 705/705 (removed 0) transitions.
// Phase 1: matrix 705 rows 801 cols
[2020-06-05 07:11:14] [INFO ] Computed 400 place invariants in 4 ms
[2020-06-05 07:11:14] [INFO ] Export to MCC properties in file /home/mcc/execution/UpperBounds.sr.xml took 4 ms.
[2020-06-05 07:11:14] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 15 ms.
info: Time: 3600 - MCC
vrfy: Checking UpperBounds @ ShieldRVt-PT-100A @ 3570 seconds

FORMULA ShieldRVt-PT-100A-UpperBounds-00 1 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldRVt-PT-100A-UpperBounds-01 1 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldRVt-PT-100A-UpperBounds-02 1 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldRVt-PT-100A-UpperBounds-03 1 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldRVt-PT-100A-UpperBounds-04 1 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldRVt-PT-100A-UpperBounds-05 1 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldRVt-PT-100A-UpperBounds-06 1 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldRVt-PT-100A-UpperBounds-08 1 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldRVt-PT-100A-UpperBounds-09 1 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldRVt-PT-100A-UpperBounds-10 1 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldRVt-PT-100A-UpperBounds-11 1 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldRVt-PT-100A-UpperBounds-12 1 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldRVt-PT-100A-UpperBounds-13 1 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldRVt-PT-100A-UpperBounds-14 1 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldRVt-PT-100A-UpperBounds-15 1 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldRVt-PT-100A-UpperBounds-07 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 2820
rslt: Output for UpperBounds @ ShieldRVt-PT-100A

{
"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": "Fri Jun 5 07:11:15 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(p771)",
"processed_size": 9,
"rewrites": 0
},
"result":
{
"edges": 328,
"markings": 291,
"produced_by": "search",
"value": 1
},
"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": 237
},
"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(p218)",
"processed_size": 9,
"rewrites": 0
},
"result":
{
"edges": 1,
"markings": 2,
"produced_by": "search",
"value": 1
},
"task":
{
"compoundnumber": 1,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "bound preserving/insertion"
},
"type": "dfs"
},
"type": "bound",
"workflow": "search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 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(p794)",
"processed_size": 9,
"rewrites": 0
},
"result":
{
"edges": 1,
"markings": 2,
"produced_by": "search",
"value": 1
},
"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": 274
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 0,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "MAX(p534)",
"processed_size": 9,
"rewrites": 0
},
"result":
{
"edges": 1,
"markings": 2,
"produced_by": "search",
"value": 1
},
"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": 297
},
"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(p137)",
"processed_size": 9,
"rewrites": 0
},
"result":
{
"edges": 85,
"markings": 86,
"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": 324
},
"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(p134)",
"processed_size": 9,
"rewrites": 0
},
"result":
{
"edges": 1,
"markings": 2,
"produced_by": "search",
"value": 1
},
"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": 356
},
"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(p485)",
"processed_size": 9,
"rewrites": 0
},
"result":
{
"edges": 42,
"markings": 43,
"produced_by": "search",
"value": 1
},
"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": 399
},
"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(p624)",
"processed_size": 9,
"rewrites": 0
},
"result":
{
"edges": 1,
"markings": 2,
"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": 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(p786)",
"processed_size": 9,
"rewrites": 0
},
"result":
{
"edges": 1,
"markings": 2,
"produced_by": "search",
"value": 1
},
"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": 532
},
"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(p336)",
"processed_size": 9,
"rewrites": 0
},
"result":
{
"edges": 1,
"markings": 2,
"produced_by": "search",
"value": 1
},
"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": 638
},
"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(p223)",
"processed_size": 9,
"rewrites": 0
},
"result":
{
"edges": 74,
"markings": 75,
"produced_by": "search",
"value": 1
},
"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": 798
},
"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(p725)",
"processed_size": 9,
"rewrites": 0
},
"result":
{
"edges": 12,
"markings": 13,
"produced_by": "search",
"value": 1
},
"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": 1064
},
"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(p58)",
"processed_size": 8,
"rewrites": 0
},
"result":
{
"edges": 1,
"markings": 2,
"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": 1596
},
"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": 101,
"markings": 102,
"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": 3191
},
"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(p236)",
"processed_size": 9,
"rewrites": 0
},
"result":
{
"edges": 1,
"markings": 2,
"produced_by": "search",
"value": 1
},
"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": 3320,
"runtime": 750.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": 3205,
"conflict_clusters": 202,
"places": 801,
"places_significant": 401,
"singleton_clusters": 0,
"transitions": 705
},
"result":
{
"preliminary_value": "1 1 1 1 1 1 1 unknown 1 1 1 1 1 1 1 1 ",
"value": "1 1 1 1 1 1 1 unknown 1 1 1 1 1 1 1 1 "
},
"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: 1506/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 25632
lola: finding significant places
lola: 801 places, 705 transitions, 401 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(p771) : MAX(p218) : MAX(p794) : MAX(p534) : MAX(p137) : MAX(p134) : MAX(p485) : MAX(p171) : MAX(p624) : MAX(p786) : MAX(p336) : MAX(p223) : MAX(p725) : MAX(p58) : MAX(p7) : MAX(p236)
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(p771)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(p771)
lola: processed formula length: 9
lola: 0 rewrites
lola: closed formula file UpperBounds.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using bound preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: RUNNING
lola: Structural Bound: 1
lola: SUBRESULT
lola: result: 1
lola: produced by: state space
lola: The maximum value of the given expression is 1
lola: 291 markings, 328 edges
lola: ========================================
lola: subprocess 1 will run for 237 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(p218)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(p218)
lola: processed formula length: 9
lola: 0 rewrites
lola: closed formula file UpperBounds.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using bound preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: RUNNING
lola: Structural Bound: 1
lola: SUBRESULT
lola: result: 1
lola: produced by: state space
lola: The maximum value of the given expression is 1
lola: 2 markings, 1 edges
lola: ========================================
lola: subprocess 2 will run for 254 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(p794)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(p794)
lola: processed formula length: 9
lola: 0 rewrites
lola: closed formula file UpperBounds.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using bound preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: RUNNING
lola: Structural Bound: 1
lola: SUBRESULT
lola: result: 1
lola: produced by: state space
lola: The maximum value of the given expression is 1
lola: 2 markings, 1 edges
lola: subprocess 3 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(p534)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(p534)
lola: processed formula length: 9
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: ========================================
lola: RUNNING
lola: Structural Bound: 1
lola: SUBRESULT
lola: result: 1
lola: produced by: state space
lola: The maximum value of the given expression is 1
lola: 2 markings, 1 edges
lola: ========================================
lola: subprocess 4 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(p137)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(p137)
lola: processed formula length: 9
lola: 0 rewrites
lola: closed formula file UpperBounds.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using bound preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: RUNNING
lola: Structural Bound: 1
lola: SUBRESULT
lola: result: 1
lola: produced by: state space
lola: The maximum value of the given expression is 1
lola: 86 markings, 85 edges
lola: ========================================
lola: subprocess 5 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(p134)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(p134)
lola: processed formula length: 9
lola: 0 rewrites
lola: closed formula file UpperBounds.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using bound preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: RUNNING
lola: Structural Bound: 1
lola: SUBRESULT
lola: result: 1
lola: produced by: state space
lola: The maximum value of the given expression is 1
lola: 2 markings, 1 edges
lola: ========================================
lola: subprocess 6 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(p485)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(p485)
lola: processed formula length: 9
lola: 0 rewrites
lola: closed formula file UpperBounds.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using bound preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: RUNNING
lola: Structural Bound: 1
lola: SUBRESULT
lola: result: 1
lola: produced by: state space
lola: The maximum value of the given expression is 1
lola: 43 markings, 42 edges
lola: ========================================
lola: subprocess 7 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(p171)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(p171)
lola: processed formula length: 9
lola: 0 rewrites
lola: closed formula file UpperBounds.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using bound preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: RUNNING
lola: Structural Bound: 1
lola: 839642 markings, 839641 edges, 167928 markings/sec, 0 secs
lola: 1700194 markings, 1700193 edges, 172110 markings/sec, 5 secs
lola: 2582438 markings, 2582438 edges, 176449 markings/sec, 10 secs
lola: 3480519 markings, 3480519 edges, 179616 markings/sec, 15 secs
lola: 4390504 markings, 4390503 edges, 181997 markings/sec, 20 secs
lola: 5282201 markings, 5282201 edges, 178339 markings/sec, 25 secs
lola: 6171384 markings, 6171383 edges, 177837 markings/sec, 30 secs
lola: 6969361 markings, 6969360 edges, 159595 markings/sec, 35 secs
lola: 7760910 markings, 7760910 edges, 158310 markings/sec, 40 secs
lola: 8584731 markings, 8584731 edges, 164764 markings/sec, 45 secs
lola: 9455608 markings, 9455612 edges, 174175 markings/sec, 50 secs
lola: 10196084 markings, 10196084 edges, 148095 markings/sec, 55 secs
lola: 11083839 markings, 11083838 edges, 177551 markings/sec, 60 secs
lola: 11988346 markings, 11988345 edges, 180901 markings/sec, 65 secs
lola: 12838265 markings, 12838265 edges, 169984 markings/sec, 70 secs
lola: 13734292 markings, 13734292 edges, 179205 markings/sec, 75 secs
lola: 14576621 markings, 14576621 edges, 168466 markings/sec, 80 secs
lola: 15424388 markings, 15424388 edges, 169553 markings/sec, 85 secs
lola: 16321988 markings, 16321988 edges, 179520 markings/sec, 90 secs
lola: 17201375 markings, 17201375 edges, 175877 markings/sec, 95 secs
lola: 18072500 markings, 18072500 edges, 174225 markings/sec, 100 secs
lola: 18867370 markings, 18867369 edges, 158974 markings/sec, 105 secs
lola: 19753023 markings, 19753023 edges, 177131 markings/sec, 110 secs
lola: 20603654 markings, 20603654 edges, 170126 markings/sec, 115 secs
lola: 21466956 markings, 21466956 edges, 172660 markings/sec, 120 secs
lola: 22223270 markings, 22223270 edges, 151263 markings/sec, 125 secs
lola: 23036874 markings, 23036875 edges, 162721 markings/sec, 130 secs
lola: 23825985 markings, 23825985 edges, 157822 markings/sec, 135 secs
lola: 24637091 markings, 24637091 edges, 162221 markings/sec, 140 secs
lola: 25418583 markings, 25418582 edges, 156298 markings/sec, 145 secs
lola: 26197221 markings, 26197220 edges, 155728 markings/sec, 150 secs
lola: 27007963 markings, 27007963 edges, 162148 markings/sec, 155 secs
lola: 27882682 markings, 27882681 edges, 174944 markings/sec, 160 secs
lola: 28742100 markings, 28742099 edges, 171884 markings/sec, 165 secs
lola: 29610338 markings, 29610337 edges, 173648 markings/sec, 170 secs
lola: 30496592 markings, 30496592 edges, 177251 markings/sec, 175 secs
lola: 31379935 markings, 31379935 edges, 176669 markings/sec, 180 secs
lola: 32261493 markings, 32261493 edges, 176312 markings/sec, 185 secs
lola: 33138420 markings, 33138419 edges, 175385 markings/sec, 190 secs
lola: 34007861 markings, 34007861 edges, 173888 markings/sec, 195 secs
lola: 34866817 markings, 34866817 edges, 171791 markings/sec, 200 secs
lola: 35733200 markings, 35733199 edges, 173277 markings/sec, 205 secs
lola: 36594998 markings, 36594998 edges, 172360 markings/sec, 210 secs
lola: 37484041 markings, 37484041 edges, 177809 markings/sec, 215 secs
lola: 38342304 markings, 38342304 edges, 171653 markings/sec, 220 secs
lola: 39219802 markings, 39219801 edges, 175500 markings/sec, 225 secs
lola: 40117544 markings, 40117544 edges, 179548 markings/sec, 230 secs
lola: 41021982 markings, 41021982 edges, 180888 markings/sec, 235 secs
lola: 41916245 markings, 41916245 edges, 178853 markings/sec, 240 secs
lola: 42810850 markings, 42810849 edges, 178921 markings/sec, 245 secs
lola: 43702353 markings, 43702352 edges, 178301 markings/sec, 250 secs
lola: 44554085 markings, 44554085 edges, 170346 markings/sec, 255 secs
lola: 45474517 markings, 45474516 edges, 184086 markings/sec, 260 secs
lola: 46248271 markings, 46248404 edges, 154751 markings/sec, 265 secs
lola: 46887728 markings, 46887814 edges, 127891 markings/sec, 270 secs
lola: 47628806 markings, 47628934 edges, 148216 markings/sec, 275 secs
lola: 48302968 markings, 48302968 edges, 134832 markings/sec, 280 secs
lola: 48974403 markings, 48974405 edges, 134287 markings/sec, 285 secs
lola: 49494111 markings, 49494110 edges, 103942 markings/sec, 290 secs
lola: 50220857 markings, 50220856 edges, 145349 markings/sec, 295 secs
lola: 50854372 markings, 50854371 edges, 126703 markings/sec, 300 secs
lola: 51302991 markings, 51302991 edges, 89724 markings/sec, 305 secs
lola: 51992996 markings, 51992996 edges, 138001 markings/sec, 310 secs
lola: 52572486 markings, 52572486 edges, 115898 markings/sec, 315 secs
lola: 53372270 markings, 53372270 edges, 159957 markings/sec, 320 secs
lola: 53894890 markings, 53894889 edges, 104524 markings/sec, 325 secs
lola: 54603929 markings, 54603928 edges, 141808 markings/sec, 330 secs
lola: 55158216 markings, 55158218 edges, 110857 markings/sec, 335 secs
lola: 55718134 markings, 55718133 edges, 111984 markings/sec, 340 secs
lola: 56277019 markings, 56277018 edges, 111777 markings/sec, 345 secs
lola: 56714716 markings, 56714801 edges, 87539 markings/sec, 350 secs
lola: 57372207 markings, 57372206 edges, 131498 markings/sec, 355 secs
lola: 57685417 markings, 57685417 edges, 62642 markings/sec, 360 secs
lola: 58105839 markings, 58105883 edges, 84084 markings/sec, 365 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 8 will run for 399 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(p624)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(p624)
lola: processed formula length: 9
lola: 0 rewrites
lola: closed formula file UpperBounds.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using bound preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: RUNNING
lola: Structural Bound: 1
lola: SUBRESULT
lola: result: 1
lola: produced by: state space
lola: The maximum value of the given expression is 1
lola: 2 markings, 1 edges
lola: ========================================
lola: subprocess 9 will run for 456 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(p786)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(p786)
lola: processed formula length: 9
lola: 0 rewrites
lola: closed formula file UpperBounds.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using bound preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: RUNNING
lola: Structural Bound: 1
lola: SUBRESULT
lola: result: 1
lola: produced by: state space
lola: The maximum value of the given expression is 1
lola: 2 markings, 1 edges
lola: ========================================
lola: subprocess 10 will run for 532 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(p336)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(p336)
lola: processed formula length: 9
lola: 0 rewrites
lola: closed formula file UpperBounds.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using bound preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: RUNNING
lola: Structural Bound: 1
lola: SUBRESULT
lola: result: 1
lola: produced by: state space
lola: The maximum value of the given expression is 1
lola: 2 markings, 1 edges
lola: ========================================
lola: subprocess 11 will run for 638 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(p223)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(p223)
lola: processed formula length: 9
lola: 0 rewrites
lola: closed formula file UpperBounds.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using bound preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: RUNNING
lola: Structural Bound: 1
lola: SUBRESULT
lola: result: 1
lola: produced by: state space
lola: The maximum value of the given expression is 1
lola: 75 markings, 74 edges
lola: ========================================
lola: subprocess 12 will run for 798 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(p725)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(p725)
lola: processed formula length: 9
lola: 0 rewrites
lola: closed formula file UpperBounds.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using bound preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: RUNNING
lola: Structural Bound: 1
lola: SUBRESULT
lola: result: 1
lola: produced by: state space
lola: The maximum value of the given expression is 1
lola: 13 markings, 12 edges
lola: ========================================
lola: subprocess 13 will run for 1064 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(p58)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(p58)
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: Structural Bound: 1
lola: SUBRESULT
lola: result: 1
lola: produced by: state space
lola: The maximum value of the given expression is 1
lola: 2 markings, 1 edges
lola: ========================================
lola: subprocess 14 will run for 1596 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: Structural Bound: 1
lola: SUBRESULT
lola: result: 1
lola: produced by: state space
lola: The maximum value of the given expression is 1
lola: 102 markings, 101 edges
lola: ========================================
lola: subprocess 15 will run for 3191 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(p236)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(p236)
lola: processed formula length: 9
lola: 0 rewrites
lola: closed formula file UpperBounds.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using bound preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: RUNNING
lola: Structural Bound: 1
lola: SUBRESULT
lola: result: 1
lola: produced by: state space
lola: The maximum value of the given expression is 1
lola: 2 markings, 1 edges
lola: ========================================
lola: ...considering subproblem: MAX(p171)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(p171)
lola: processed formula length: 9
lola: 0 rewrites
lola: closed formula file UpperBounds.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using bound preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: RUNNING
lola: ========================================
lola: Structural Bound: 1
lola: 847429 markings, 847429 edges, 169486 markings/sec, 0 secs
lola: 1706512 markings, 1706512 edges, 171817 markings/sec, 5 secs
lola: 2616861 markings, 2616860 edges, 182070 markings/sec, 10 secs
lola: 3531552 markings, 3531552 edges, 182938 markings/sec, 15 secs
lola: 4456256 markings, 4456256 edges, 184941 markings/sec, 20 secs
lola: 5369452 markings, 5369452 edges, 182639 markings/sec, 25 secs
lola: 6290485 markings, 6290485 edges, 184207 markings/sec, 30 secs
lola: 7197517 markings, 7197517 edges, 181406 markings/sec, 35 secs
lola: 8118301 markings, 8118301 edges, 184157 markings/sec, 40 secs
lola: 9025376 markings, 9025375 edges, 181415 markings/sec, 45 secs
lola: 9929578 markings, 9929577 edges, 180840 markings/sec, 50 secs
lola: 10833808 markings, 10833808 edges, 180846 markings/sec, 55 secs
lola: 11752453 markings, 11752452 edges, 183729 markings/sec, 60 secs
lola: 12654670 markings, 12654669 edges, 180443 markings/sec, 65 secs
lola: 13563841 markings, 13563841 edges, 181834 markings/sec, 70 secs
lola: 14451294 markings, 14451293 edges, 177491 markings/sec, 75 secs
lola: 15373250 markings, 15373249 edges, 184391 markings/sec, 80 secs
lola: 16292110 markings, 16292109 edges, 183772 markings/sec, 85 secs
lola: 17199380 markings, 17199380 edges, 181454 markings/sec, 90 secs
lola: 18090302 markings, 18090301 edges, 178184 markings/sec, 95 secs
lola: 18973333 markings, 18973334 edges, 176606 markings/sec, 100 secs
lola: 19835003 markings, 19835002 edges, 172334 markings/sec, 105 secs
lola: 20621470 markings, 20621470 edges, 157293 markings/sec, 110 secs
lola: 21404495 markings, 21404495 edges, 156605 markings/sec, 115 secs
lola: 22237890 markings, 22237889 edges, 166679 markings/sec, 120 secs
lola: 23144017 markings, 23144016 edges, 181225 markings/sec, 125 secs
lola: 24048614 markings, 24048614 edges, 180919 markings/sec, 130 secs
lola: 24836068 markings, 24836067 edges, 157491 markings/sec, 135 secs
lola: 25646756 markings, 25646755 edges, 162138 markings/sec, 140 secs
lola: 26432681 markings, 26432680 edges, 157185 markings/sec, 145 secs
lola: 27223088 markings, 27223087 edges, 158081 markings/sec, 150 secs
lola: 28088805 markings, 28088805 edges, 173143 markings/sec, 155 secs
lola: 28977563 markings, 28977562 edges, 177752 markings/sec, 160 secs
lola: 29873871 markings, 29873871 edges, 179262 markings/sec, 165 secs
lola: 30796395 markings, 30796395 edges, 184505 markings/sec, 170 secs
lola: 31708861 markings, 31708860 edges, 182493 markings/sec, 175 secs
lola: 32622439 markings, 32622438 edges, 182716 markings/sec, 180 secs
lola: 33532098 markings, 33532097 edges, 181932 markings/sec, 185 secs
lola: 34428678 markings, 34428677 edges, 179316 markings/sec, 190 secs
lola: 35317656 markings, 35317656 edges, 177796 markings/sec, 195 secs
lola: 36211712 markings, 36211711 edges, 178811 markings/sec, 200 secs
lola: 37105830 markings, 37105829 edges, 178824 markings/sec, 205 secs
lola: 38014717 markings, 38014716 edges, 181777 markings/sec, 210 secs
lola: 38913209 markings, 38913209 edges, 179698 markings/sec, 215 secs
lola: 39809918 markings, 39809917 edges, 179342 markings/sec, 220 secs
lola: 40709148 markings, 40709147 edges, 179846 markings/sec, 225 secs
lola: 41603435 markings, 41603434 edges, 178857 markings/sec, 230 secs
lola: 42502256 markings, 42502256 edges, 179764 markings/sec, 235 secs
lola: 43401264 markings, 43401264 edges, 179802 markings/sec, 240 secs
lola: 44305920 markings, 44305920 edges, 180931 markings/sec, 245 secs
lola: 45234242 markings, 45234241 edges, 185664 markings/sec, 250 secs
lola: 46132684 markings, 46132733 edges, 179688 markings/sec, 255 secs
lola: 46614327 markings, 46614340 edges, 96329 markings/sec, 260 secs
lola: 47227251 markings, 47227267 edges, 122585 markings/sec, 265 secs
lola: 47939595 markings, 47939594 edges, 142469 markings/sec, 270 secs
lola: 48524550 markings, 48524550 edges, 116991 markings/sec, 275 secs
lola: 49322352 markings, 49322352 edges, 159560 markings/sec, 280 secs
lola: 50060123 markings, 50060123 edges, 147554 markings/sec, 285 secs
lola: 50737928 markings, 50737931 edges, 135561 markings/sec, 290 secs
lola: 51463042 markings, 51463041 edges, 145023 markings/sec, 295 secs
lola: 51955391 markings, 51955390 edges, 98470 markings/sec, 300 secs
lola: 52375321 markings, 52375320 edges, 83986 markings/sec, 305 secs
lola: 52827241 markings, 52827240 edges, 90384 markings/sec, 310 secs
lola: 53427396 markings, 53427396 edges, 120031 markings/sec, 315 secs
lola: 53832843 markings, 53832843 edges, 81089 markings/sec, 320 secs
lola: 54202108 markings, 54202108 edges, 73853 markings/sec, 325 secs
lola: 54818458 markings, 54818458 edges, 123270 markings/sec, 330 secs
lola: 55301163 markings, 55301162 edges, 96541 markings/sec, 335 secs
lola: 55860193 markings, 55860193 edges, 111806 markings/sec, 340 secs
lola: 56344534 markings, 56344533 edges, 96868 markings/sec, 345 secs
lola: 56943820 markings, 56943819 edges, 119857 markings/sec, 350 secs
lola: 57426555 markings, 57426555 edges, 96547 markings/sec, 355 secs
lola: 57880066 markings, 57880076 edges, 90702 markings/sec, 360 secs
lola: Child process aborted or communication problem between parent and child process
lola: RESULT
lola:
SUMMARY: 1 1 1 1 1 1 1 unknown 1 1 1 1 1 1 1 1
lola:
preliminary result: 1 1 1 1 1 1 1 unknown 1 1 1 1 1 1 1 1
lola: memory consumption: 3320 KB
lola: time consumption: 750 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="ShieldRVt-PT-100A"
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 ShieldRVt-PT-100A, 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 r211-tajo-159033478401085"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/ShieldRVt-PT-100A.tgz
mv ShieldRVt-PT-100A 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 ;