About the Execution of ITS-LoLa for PolyORBNT-PT-S05J20
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 15742.650 | 3600000.00 | 96444.00 | 99.80 | 1 4 1 4 1 4 2 4 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.r176-tajo-158987872200637.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 PolyORBNT-PT-S05J20, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r176-tajo-158987872200637
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.9M
-rw-r--r-- 1 mcc users 5.5K Apr 12 05:59 CTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Apr 12 05:59 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.3K Apr 11 05:42 CTLFireability.txt
-rw-r--r-- 1 mcc users 34K Apr 11 05:42 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 24 05:37 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 8.2K Apr 14 12:46 LTLCardinality.txt
-rw-r--r-- 1 mcc users 37K Apr 28 14:02 LTLCardinality.xml
-rw-r--r-- 1 mcc users 34K Apr 14 12:46 LTLFireability.txt
-rw-r--r-- 1 mcc users 100K Apr 28 14:02 LTLFireability.xml
-rw-r--r-- 1 mcc users 6.9K Apr 10 12:55 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 25K Apr 10 12:55 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.5K Apr 9 18:34 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 32K Apr 9 18:34 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 7.1K Apr 10 22:23 UpperBounds.txt
-rw-r--r-- 1 mcc users 14K Apr 10 22:23 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 24 05:37 equiv_col
-rw-r--r-- 1 mcc users 7 Mar 24 05:37 instance
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 iscolored
-rw-r--r-- 1 mcc users 1.6M 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 PolyORBNT-PT-S05J20-UpperBounds-00
FORMULA_NAME PolyORBNT-PT-S05J20-UpperBounds-01
FORMULA_NAME PolyORBNT-PT-S05J20-UpperBounds-02
FORMULA_NAME PolyORBNT-PT-S05J20-UpperBounds-03
FORMULA_NAME PolyORBNT-PT-S05J20-UpperBounds-04
FORMULA_NAME PolyORBNT-PT-S05J20-UpperBounds-05
FORMULA_NAME PolyORBNT-PT-S05J20-UpperBounds-06
FORMULA_NAME PolyORBNT-PT-S05J20-UpperBounds-07
FORMULA_NAME PolyORBNT-PT-S05J20-UpperBounds-08
FORMULA_NAME PolyORBNT-PT-S05J20-UpperBounds-09
FORMULA_NAME PolyORBNT-PT-S05J20-UpperBounds-10
FORMULA_NAME PolyORBNT-PT-S05J20-UpperBounds-11
FORMULA_NAME PolyORBNT-PT-S05J20-UpperBounds-12
FORMULA_NAME PolyORBNT-PT-S05J20-UpperBounds-13
FORMULA_NAME PolyORBNT-PT-S05J20-UpperBounds-14
FORMULA_NAME PolyORBNT-PT-S05J20-UpperBounds-15
=== Now, execution of the tool begins
BK_START 1591171291731
bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-03 08:01:33] [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 08:01:33] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-03 08:01:33] [INFO ] Load time of PNML (sax parser for PT used): 140 ms
[2020-06-03 08:01:34] [INFO ] Transformed 349 places.
[2020-06-03 08:01:34] [INFO ] Transformed 1210 transitions.
[2020-06-03 08:01:34] [INFO ] Parsed PT model containing 349 places and 1210 transitions in 188 ms.
Ensure Unique test removed 655 transitions
Reduce redundant transitions removed 655 transitions.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 25 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 08:01:34] [INFO ] Flatten gal took : 96 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 08:01:34] [INFO ] Flow matrix only has 551 transitions (discarded 4 similar events)
// Phase 1: matrix 551 rows 349 cols
[2020-06-03 08:01:34] [INFO ] Computed 62 place invariants in 35 ms
Support contains 156 out of 349 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 349/349 places, 555/555 transitions.
Ensure Unique test removed 5 places
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 344 transition count 553
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 9 place count 342 transition count 553
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 9 place count 342 transition count 549
Deduced a syphon composed of 4 places in 2 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 17 place count 338 transition count 549
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 21 place count 336 transition count 547
Applied a total of 21 rules in 87 ms. Remains 336 /349 variables (removed 13) and now considering 547/555 (removed 8) transitions.
[2020-06-03 08:01:34] [INFO ] Flow matrix only has 543 transitions (discarded 4 similar events)
// Phase 1: matrix 543 rows 336 cols
[2020-06-03 08:01:34] [INFO ] Computed 57 place invariants in 14 ms
[2020-06-03 08:01:35] [INFO ] Dead Transitions using invariants and state equation in 1127 ms returned [309, 310, 311, 312, 313, 315, 316, 317, 318, 319, 322, 323, 324, 326, 327, 328, 329, 330, 332, 336, 339, 340, 341, 342, 344, 345, 346, 347, 348, 349, 350, 351, 353, 354, 355, 357, 359, 360, 361, 362, 363, 364, 365, 366, 367, 369, 370, 371, 372, 373, 374, 375, 376, 379, 380, 381, 383, 384, 386, 387, 388, 389, 390, 391, 392, 393, 394, 395, 397, 398, 399, 400, 401, 402, 403, 404, 405, 407, 408, 411, 412, 415, 416, 417, 420, 421, 424, 425, 426, 427, 429, 430, 431, 432, 433]
Found 95 dead transitions using SMT.
Drop transitions removed 95 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 95 transitions :[433, 432, 431, 430, 429, 427, 426, 425, 424, 421, 420, 417, 416, 415, 412, 411, 408, 407, 405, 404, 403, 402, 401, 400, 399, 398, 397, 395, 394, 393, 392, 391, 390, 389, 388, 387, 386, 384, 383, 381, 380, 379, 376, 375, 374, 373, 372, 371, 370, 369, 367, 366, 365, 364, 363, 362, 361, 360, 359, 357, 355, 354, 353, 351, 350, 349, 348, 347, 346, 345, 344, 342, 341, 340, 339, 336, 332, 330, 329, 328, 327, 326, 324, 323, 322, 319, 318, 317, 316, 315, 313, 312, 311, 310, 309]
Starting structural reductions, iteration 1 : 336/349 places, 452/555 transitions.
Applied a total of 0 rules in 21 ms. Remains 336 /336 variables (removed 0) and now considering 452/452 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 336/349 places, 452/555 transitions.
Finished random walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished probabilistic random walk after 0 steps, run visited all 0 properties in 0 ms. (steps per millisecond=0 )
[2020-06-03 08:01:35] [INFO ] Flow matrix only has 448 transitions (discarded 4 similar events)
// Phase 1: matrix 448 rows 336 cols
[2020-06-03 08:01:35] [INFO ] Computed 57 place invariants in 13 ms
Support contains 156 out of 336 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 336/336 places, 452/452 transitions.
Applied a total of 0 rules in 17 ms. Remains 336 /336 variables (removed 0) and now considering 452/452 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 336/336 places, 452/452 transitions.
Starting structural reductions, iteration 0 : 336/336 places, 452/452 transitions.
Applied a total of 0 rules in 11 ms. Remains 336 /336 variables (removed 0) and now considering 452/452 (removed 0) transitions.
[2020-06-03 08:01:35] [INFO ] Flow matrix only has 448 transitions (discarded 4 similar events)
// Phase 1: matrix 448 rows 336 cols
[2020-06-03 08:01:35] [INFO ] Computed 57 place invariants in 8 ms
[2020-06-03 08:01:36] [INFO ] Implicit Places using invariants in 391 ms returned []
[2020-06-03 08:01:36] [INFO ] Flow matrix only has 448 transitions (discarded 4 similar events)
// Phase 1: matrix 448 rows 336 cols
[2020-06-03 08:01:36] [INFO ] Computed 57 place invariants in 16 ms
[2020-06-03 08:01:36] [INFO ] State equation strengthened by 1 read => feed constraints.
[2020-06-03 08:01:38] [INFO ] Implicit Places using invariants and state equation in 2784 ms returned []
Implicit Place search using SMT with State Equation took 3177 ms to find 0 implicit places.
[2020-06-03 08:01:38] [INFO ] Redundant transitions in 36 ms returned []
[2020-06-03 08:01:38] [INFO ] Flow matrix only has 448 transitions (discarded 4 similar events)
// Phase 1: matrix 448 rows 336 cols
[2020-06-03 08:01:38] [INFO ] Computed 57 place invariants in 13 ms
[2020-06-03 08:01:39] [INFO ] Dead Transitions using invariants and state equation in 811 ms returned []
Finished structural reductions, in 1 iterations. Remains : 336/336 places, 452/452 transitions.
Finished random walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 336 transition count 448
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 4 place count 336 transition count 447
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 6 place count 335 transition count 447
Free-agglomeration rule applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 335 transition count 446
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 8 place count 334 transition count 446
Free-agglomeration rule (complex) applied 4 times.
Iterating global reduction 2 with 4 rules applied. Total rules applied 12 place count 334 transition count 442
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 16 place count 330 transition count 442
Applied a total of 16 rules in 62 ms. Remains 330 /336 variables (removed 6) and now considering 442/452 (removed 10) transitions.
// Phase 1: matrix 442 rows 330 cols
[2020-06-03 08:01:39] [INFO ] Computed 57 place invariants in 7 ms
[2020-06-03 08:01:39] [INFO ] Export to MCC properties in file /home/mcc/execution/UpperBounds.sr.xml took 7 ms.
[2020-06-03 08:01:39] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 7 ms.
info: Time: 3600 - MCC
vrfy: Checking UpperBounds @ PolyORBNT-PT-S05J20 @ 3570 seconds
FORMULA PolyORBNT-PT-S05J20-UpperBounds-00 1 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA PolyORBNT-PT-S05J20-UpperBounds-02 1 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA PolyORBNT-PT-S05J20-UpperBounds-06 2 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA PolyORBNT-PT-S05J20-UpperBounds-07 4 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA PolyORBNT-PT-S05J20-UpperBounds-08 1 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA PolyORBNT-PT-S05J20-UpperBounds-09 1 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA PolyORBNT-PT-S05J20-UpperBounds-10 1 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA PolyORBNT-PT-S05J20-UpperBounds-11 1 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA PolyORBNT-PT-S05J20-UpperBounds-12 1 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA PolyORBNT-PT-S05J20-UpperBounds-13 1 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA PolyORBNT-PT-S05J20-UpperBounds-14 1 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA PolyORBNT-PT-S05J20-UpperBounds-15 1 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA PolyORBNT-PT-S05J20-UpperBounds-03 4 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA PolyORBNT-PT-S05J20-UpperBounds-04 1 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA PolyORBNT-PT-S05J20-UpperBounds-01 4 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA PolyORBNT-PT-S05J20-UpperBounds-05 4 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 3491
rslt: Output for UpperBounds @ PolyORBNT-PT-S05J20
{
"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 08:01:40 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(p111)",
"processed_size": 9,
"rewrites": 0
},
"result":
{
"edges": 11,
"markings": 12,
"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(p181)",
"processed_size": 9,
"rewrites": 0
},
"result":
{
"edges": 0,
"markings": 0,
"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(p328)",
"processed_size": 9,
"rewrites": 0
},
"result":
{
"edges": 15,
"markings": 16,
"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": 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(p58)",
"processed_size": 8,
"rewrites": 0
},
"result":
{
"edges": 9,
"markings": 10,
"produced_by": "search",
"value": 4
},
"task":
{
"compoundnumber": 3,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "bound preserving/insertion"
},
"type": "dfs"
},
"type": "bound",
"workflow": "search"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 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(p110)",
"processed_size": 9,
"rewrites": 0
},
"result":
{
"edges": 8,
"markings": 9,
"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(p114)",
"processed_size": 9,
"rewrites": 0
},
"result":
{
"edges": 0,
"markings": 0,
"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(p287)",
"processed_size": 9,
"rewrites": 0
},
"result":
{
"edges": 6891,
"markings": 2985,
"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": 396
},
"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(p84)",
"processed_size": 8,
"rewrites": 0
},
"result":
{
"edges": 896576,
"markings": 417488,
"produced_by": "search",
"value": 1
},
"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": 445
},
"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(p307)",
"processed_size": 9,
"rewrites": 0
},
"result":
{
"edges": 10,
"markings": 11,
"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": 509
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 0,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "MAX(p227)",
"processed_size": 9,
"rewrites": 0
},
"result":
{
"edges": 10,
"markings": 11,
"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": 594
},
"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(p129)",
"processed_size": 9,
"rewrites": 0
},
"result":
{
"edges": 27,
"markings": 28,
"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": 712
},
"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(p135)",
"processed_size": 9,
"rewrites": 0
},
"result":
{
"edges": 10,
"markings": 11,
"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": 890
},
"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": 21,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 21,
"visible_transitions": 0
},
"processed": "MAX(p110 + p135 + p145 + p148 + p158 + p170 + p182 + p195 + p215 + p248 + p250 + p264 + p309 + p17 + p25 + p43 + p41 + p42 + p80 + p82 + p86)",
"processed_size": 141,
"rewrites": 0
},
"result":
{
"edges": 4388550,
"markings": 2119842,
"produced_by": "search",
"value": 4
},
"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": 1180
},
"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": 22,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 22,
"visible_transitions": 0
},
"processed": "MAX(p122 + p128 + p139 + p153 + p162 + p169 + p193 + p198 + p252 + p269 + p272 + p274 + p302 + p303 + p319 + p12 + p13 + p27 + p56 + p66 + p68 + p98)",
"processed_size": 149,
"rewrites": 0
},
"result":
{
"edges": 2,
"markings": 3,
"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": 1770
},
"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": 105,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 105,
"visible_transitions": 0
},
"processed": "MAX(p2 + p5 + p6 + p7 + p9 + p102 + p104 + p106 + p108 + p109 + p112 + p117 + p119 + p120 + p124 + p125 + p130 + p136 + p138 + p141 + p144 + p149 + p150 + p160 + p161 + p163 + p165 + p167 + p168 + p171 + p175 + p179 + p189 + p190 + p192 + p196 + p201 + p202 + p205 + p206 + p214 + p216 + p224 + p227 + p228 + p231 + p233 + p238 + p242 + p245 + p246 + p247 + p251 + p253 + p254 + p258 + p259 + p261 + p265 + p270 + p273 + p275 + p276 + p280 + p281 + p291 + p294 + p298 + p299 + p306 + p307 + p311 + p312 + p318 + p326 + p334 + p11 + p14 + p26 + p28 + p36 + p38 + p31 + p21 + p48 + p50 + p331 + p53 + p57 + p59 + p60 + p325 + p63 + p313 + p65 + p305 + p70 + p301 + p73 + p75 + p76 + p79 + p240 + p90 + p91)",
"processed_size": 704,
"rewrites": 0
},
"result":
{
"edges": 4388550,
"markings": 2119842,
"produced_by": "search",
"value": 4
},
"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": 3516
},
"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": 105,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 105,
"visible_transitions": 0
},
"processed": "MAX(p2 + p5 + p6 + p7 + p9 + p102 + p104 + p106 + p108 + p109 + p112 + p117 + p119 + p120 + p124 + p125 + p130 + p136 + p138 + p141 + p144 + p149 + p150 + p160 + p161 + p163 + p165 + p167 + p168 + p171 + p175 + p179 + p189 + p190 + p192 + p196 + p201 + p202 + p205 + p206 + p214 + p216 + p224 + p227 + p228 + p231 + p233 + p238 + p242 + p245 + p246 + p247 + p251 + p253 + p254 + p258 + p259 + p261 + p265 + p270 + p273 + p275 + p276 + p280 + p281 + p291 + p294 + p298 + p299 + p306 + p307 + p311 + p312 + p318 + p326 + p334 + p11 + p14 + p26 + p28 + p36 + p38 + p31 + p21 + p48 + p50 + p331 + p53 + p57 + p59 + p60 + p325 + p63 + p313 + p65 + p305 + p70 + p301 + p73 + p75 + p76 + p79 + p240 + p90 + p91)",
"processed_size": 704,
"rewrites": 0
},
"result":
{
"edges": 4388550,
"markings": 2119842,
"produced_by": "search",
"value": 4
},
"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": 21680,
"runtime": 78.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": 2201,
"conflict_clusters": 76,
"places": 336,
"places_significant": 279,
"singleton_clusters": 0,
"transitions": 452
},
"result":
{
"preliminary_value": "1 4 1 4 1 4 2 4 1 1 1 1 1 1 1 1 ",
"value": "1 4 1 4 1 4 2 4 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: 788/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 10752
lola: finding significant places
lola: 336 places, 452 transitions, 279 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(p111) : MAX(p2 + p5 + p6 + p7 + p9 + p102 + p104 + p106 + p108 + p109 + p112 + p117 + p119 + p120 + p124 + p125 + p130 + p136 + p138 + p141 + p144 + p149 + p150 + p160 + p161 + p163 + p165 + p167 + p168 + p171 + p175 + p179 + p189 + p190 + p192 + p196 + p201 + p202 + p205 + p206 + p214 + p216 + p224 + p227 + p228 + p231 + p233 + p238 + p242 + p245 + p246 + p247 + p251 + p253 + p254 + p258 + p259 + p261 + p265 + p270 + p273 + p275 + p276 + p280 + p281 + p291 + p294 + p298 + p299 + p306 + p307 + p311 + p312 + p318 + p326 + p334 + p11 + p14 + p26 + p28 + p36 + p38 + p31 + p21 + p48 + p50 + p331 + p53 + p57 + p59 + p60 + p325 + p63 + p313 + p65 + p305 + p70 + p301 + p73 + p75 + p76 + p79 + p240 + p90 + p91) : MAX(p181) : MAX(p110 + p135 + p145 + p148 + p158 + p170 + p182 + p195 + p215 + p248 + p250 + p264 + p309 + p17 + p25 + p43 + p41 + p42 + p80 + p82 + p86) : MAX(p122 + p128 + p139 + p153 + p162 + p169 + p193 + p198 + p252 + p269 + p272 + p274 + p302 + p303 + p319 + p12 + p13 + p27 + p56 + p66 + p68 + p98) : MAX(p2 + p5 + p6 + p7 + p9 + p102 + p104 + p106 + p108 + p109 + p112 + p117 + p119 + p120 + p124 + p125 + p130 + p136 + p138 + p141 + p144 + p149 + p150 + p160 + p161 + p163 + p165 + p167 + p168 + p171 + p175 + p179 + p189 + p190 + p192 + p196 + p201 + p202 + p205 + p206 + p214 + p216 + p224 + p227 + p228 + p231 + p233 + p238 + p242 + p245 + p246 + p247 + p251 + p253 + p254 + p258 + p259 + p261 + p265 + p270 + p273 + p275 + p276 + p280 + p281 + p291 + p294 + p298 + p299 + p306 + p307 + p311 + p312 + p318 + p326 + p334 + p11 + p14 + p26 + p28 + p36 + p38 + p31 + p21 + p48 + p50 + p331 + p53 + p57 + p59 + p60 + p325 + p63 + p313 + p65 + p305 + p70 + p301 + p73 + p75 + p76 + p79 + p240 + p90 + p91) : MAX(p328) : MAX(p58) : MAX(p110) : MAX(p114) : MAX(p287) : MAX(p84) : MAX(p307) : MAX(p227) : MAX(p129) : MAX(p135)
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(p111)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(p111)
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: 12 markings, 11 edges
lola: ========================================
lola: subprocess 1 will run for 237 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(p181)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(p181)
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: 0 markings, 0 edges
lola: ========================================
lola: subprocess 2 will run for 254 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(p328)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(p328)
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: 2
lola: SUBRESULT
lola: result: 2
lola: produced by: state space
lola: The maximum value of the given expression is 2
lola: 16 markings, 15 edges
lola: ========================================
lola: subprocess 3 will run for 274 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: 4
lola: SUBRESULT
lola: result: 4
lola: produced by: state space
lola: The maximum value of the given expression is 4
lola: 10 markings, 9 edges
lola: ========================================
lola: subprocess 4 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(p110)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(p110)
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: 9 markings, 8 edges
lola: ========================================
lola: subprocess 5 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(p114)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(p114)
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: 0 markings, 0 edges
lola: ========================================
lola: subprocess 6 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(p287)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(p287)
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: 2985 markings, 6891 edges
lola: ========================================
lola: subprocess 7 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(p84)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(p84)
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: 417488 markings, 896576 edges
lola: ========================================
lola: subprocess 8 will run for 445 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(p307)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(p307)
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: 11 markings, 10 edges
lola: ========================================
lola: subprocess 9 will run for 509 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(p227)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(p227)
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: 11 markings, 10 edges
lola: ========================================
lola: subprocess 10 will run for 594 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(p129)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(p129)
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: 28 markings, 27 edges
lola: ========================================
lola: subprocess 11 will run for 712 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(p135)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(p135)
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: 11 markings, 10 edges
lola: ========================================
lola: subprocess 12 will run for 890 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(p110 + p135 + p145 + p148 + p158 + p170 + p182 + p195 + p215 + p248 + p250 + p264 + p309 + p17 + p25 + p43 + p41 + p42 + p80 + p82 + p86)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(p110 + p135 + p145 + p148 + p158 + p170 + p182 + p195 + p215 + p248 + p250 + p264 + p309 + p17 + p25 + p43 + p41 + p42 + p80 + p82 + p86)
lola: processed formula length: 141
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: 4
lola: 442086 markings, 925534 edges, 88417 markings/sec, 0 secs
lola: 921057 markings, 1894804 edges, 95794 markings/sec, 5 secs
lola: 1395726 markings, 2847766 edges, 94934 markings/sec, 10 secs
lola: 1866200 markings, 3818891 edges, 94095 markings/sec, 15 secs
lola: SUBRESULT
lola: result: 4
lola: produced by: state space
lola: The maximum value of the given expression is 4
lola: 2119842 markings, 4388550 edges
lola: ========================================
lola: subprocess 13 will run for 1180 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(p122 + p128 + p139 + p153 + p162 + p169 + p193 + p198 + p252 + p269 + p272 + p274 + p302 + p303 + p319 + p12 + p13 + p27 + p56 + p66 + p68 + p98)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(p122 + p128 + p139 + p153 + p162 + p169 + p193 + p198 + p252 + p269 + p272 + p274 + p302 + p303 + p319 + p12 + p13 + p27 + p56 + p66 + p68 + p98)
lola: processed formula length: 149
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: 3 markings, 2 edges
lola: ========================================
lola: subprocess 14 will run for 1770 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(p2 + p5 + p6 + p7 + p9 + p102 + p104 + p106 + p108 + p109 + p112 + p117 + p119 + p120 + p124 + p125 + p130 + p136 + p138 + p141 + p144 + p149 + p150 + p160 + p161 + p163 + p165 + p167 + p168 + p171 + p175 + p179 + p189 + p190 + p192 + p196 + p201 + p202 + p205 + p206 + p214 + p216 + p224 + p227 + p228 + p231 + p233 + p238 + p242 + p245 + p246 + p247 + p251 + p253 + p254 + p258 + p259 + p261 + ... (shortened)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(p2 + p5 + p6 + p7 + p9 + p102 + p104 + p106 + p108 + p109 + p112 + p117 + p119 + p120 + p124 + p125 + p130 + p136 + p138 + p141 + p144 + p149 + p150 + p160 + p161 + p163 + p165 + p167 + p168 + p171 + p175 + p179 + p189 + p190 + p192 + p196 + p201 + p202 + p205 + p206 + p214 + p216 + p224 + p227 + p228 + p231 + p233 + p238 + p242 + p245 + p246 + p247 + p251 + p253 + p254 + p258 + p259 + p261 + ... (shortened)
lola: processed formula length: 704
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: 4
lola: 390904 markings, 815888 edges, 78181 markings/sec, 0 secs
lola: 859056 markings, 1768395 edges, 93630 markings/sec, 5 secs
lola: 1324492 markings, 2702764 edges, 93087 markings/sec, 10 secs
lola: 1786667 markings, 3652833 edges, 92435 markings/sec, 15 secs
lola: SUBRESULT
lola: result: 4
lola: produced by: state space
lola: The maximum value of the given expression is 4
lola: 2119842 markings, 4388550 edges
lola: ========================================
lola: subprocess 15 will run for 3516 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(p2 + p5 + p6 + p7 + p9 + p102 + p104 + p106 + p108 + p109 + p112 + p117 + p119 + p120 + p124 + p125 + p130 + p136 + p138 + p141 + p144 + p149 + p150 + p160 + p161 + p163 + p165 + p167 + p168 + p171 + p175 + p179 + p189 + p190 + p192 + p196 + p201 + p202 + p205 + p206 + p214 + p216 + p224 + p227 + p228 + p231 + p233 + p238 + p242 + p245 + p246 + p247 + p251 + p253 + p254 + p258 + p259 + p261 + ... (shortened)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(p2 + p5 + p6 + p7 + p9 + p102 + p104 + p106 + p108 + p109 + p112 + p117 + p119 + p120 + p124 + p125 + p130 + p136 + p138 + p141 + p144 + p149 + p150 + p160 + p161 + p163 + p165 + p167 + p168 + p171 + p175 + p179 + p189 + p190 + p192 + p196 + p201 + p202 + p205 + p206 + p214 + p216 + p224 + p227 + p228 + p231 + p233 + p238 + p242 + p245 + p246 + p247 + p251 + p253 + p254 + p258 + p259 + p261 + ... (shortened)
lola: processed formula length: 704
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: 4
lola: 371468 markings, 773621 edges, 74294 markings/sec, 0 secs
lola: 846816 markings, 1743981 edges, 95070 markings/sec, 5 secs
lola: 1313204 markings, 2679496 edges, 93278 markings/sec, 10 secs
lola: 1778918 markings, 3635402 edges, 93143 markings/sec, 15 secs
lola: SUBRESULT
lola: result: 4
lola: produced by: state space
lola: The maximum value of the given expression is 4
lola: 2119842 markings, 4388550 edges
lola: ========================================
lola: RESULT
lola:
SUMMARY: 1 4 1 4 1 4 2 4 1 1 1 1 1 1 1 1
lola:
preliminary result: 1 4 1 4 1 4 2 4 1 1 1 1 1 1 1 1
lola: memory consumption: 21680 KB
lola: time consumption: 78 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="PolyORBNT-PT-S05J20"
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 PolyORBNT-PT-S05J20, 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 r176-tajo-158987872200637"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/PolyORBNT-PT-S05J20.tgz
mv PolyORBNT-PT-S05J20 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 '
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 ;