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-158987871800413.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 PolyORBLF-PT-S02J04T06, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r176-tajo-158987871800413
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.1M
-rw-r--r-- 1 mcc users 5.5K Apr 12 05:37 CTLCardinality.txt
-rw-r--r-- 1 mcc users 21K Apr 12 05:37 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.1K Apr 11 04:53 CTLFireability.txt
-rw-r--r-- 1 mcc users 33K Apr 11 04:53 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 24 05:37 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.9K Apr 14 12:45 LTLCardinality.txt
-rw-r--r-- 1 mcc users 33K Apr 28 14:02 LTLCardinality.xml
-rw-r--r-- 1 mcc users 6.5K Apr 14 12:45 LTLFireability.txt
-rw-r--r-- 1 mcc users 30K Apr 28 14:02 LTLFireability.xml
-rw-r--r-- 1 mcc users 5.2K Apr 10 12:35 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 18K Apr 10 12:35 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.5K Apr 9 17:44 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 31K Apr 9 17:44 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.7K Apr 10 22:21 UpperBounds.txt
-rw-r--r-- 1 mcc users 5.5K Apr 10 22:21 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 24 05:37 equiv_col
-rw-r--r-- 1 mcc users 10 Mar 24 05:37 instance
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 iscolored
-rw-r--r-- 1 mcc users 862K 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 PolyORBLF-PT-S02J04T06-UpperBounds-00
FORMULA_NAME PolyORBLF-PT-S02J04T06-UpperBounds-01
FORMULA_NAME PolyORBLF-PT-S02J04T06-UpperBounds-02
FORMULA_NAME PolyORBLF-PT-S02J04T06-UpperBounds-03
FORMULA_NAME PolyORBLF-PT-S02J04T06-UpperBounds-04
FORMULA_NAME PolyORBLF-PT-S02J04T06-UpperBounds-05
FORMULA_NAME PolyORBLF-PT-S02J04T06-UpperBounds-06
FORMULA_NAME PolyORBLF-PT-S02J04T06-UpperBounds-07
FORMULA_NAME PolyORBLF-PT-S02J04T06-UpperBounds-08
FORMULA_NAME PolyORBLF-PT-S02J04T06-UpperBounds-09
FORMULA_NAME PolyORBLF-PT-S02J04T06-UpperBounds-10
FORMULA_NAME PolyORBLF-PT-S02J04T06-UpperBounds-11
FORMULA_NAME PolyORBLF-PT-S02J04T06-UpperBounds-12
FORMULA_NAME PolyORBLF-PT-S02J04T06-UpperBounds-13
FORMULA_NAME PolyORBLF-PT-S02J04T06-UpperBounds-14
FORMULA_NAME PolyORBLF-PT-S02J04T06-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1591151286056

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-03 02:28:08] [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 02:28:08] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-03 02:28:08] [INFO ] Load time of PNML (sax parser for PT used): 185 ms
[2020-06-03 02:28:08] [INFO ] Transformed 476 places.
[2020-06-03 02:28:08] [INFO ] Transformed 920 transitions.
[2020-06-03 02:28:08] [INFO ] Parsed PT model containing 476 places and 920 transitions in 269 ms.
Ensure Unique test removed 96 transitions
Reduce redundant transitions removed 96 transitions.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 42 ms.
Finished random walk after 0 steps, including 0 resets, run visited all 0 properties in 14 ms. (steps per millisecond=0 )
[2020-06-03 02:28:09] [INFO ] Flatten gal took : 191 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 02:28:09] [INFO ] Flow matrix only has 812 transitions (discarded 12 similar events)
// Phase 1: matrix 812 rows 476 cols
[2020-06-03 02:28:09] [INFO ] Computed 46 place invariants in 70 ms
Support contains 53 out of 476 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 476/476 places, 824/824 transitions.
Ensure Unique test removed 2 places
Performed 42 Post agglomeration using F-continuation condition.Transition count delta: 42
Iterating post reduction 0 with 44 rules applied. Total rules applied 44 place count 474 transition count 782
Reduce places removed 42 places and 0 transitions.
Iterating post reduction 1 with 42 rules applied. Total rules applied 86 place count 432 transition count 782
Performed 35 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 35 Pre rules applied. Total rules applied 86 place count 432 transition count 747
Deduced a syphon composed of 35 places in 4 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 2 with 70 rules applied. Total rules applied 156 place count 397 transition count 747
Performed 23 Post agglomeration using F-continuation condition.Transition count delta: 23
Deduced a syphon composed of 23 places in 2 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 2 with 46 rules applied. Total rules applied 202 place count 374 transition count 724
Free-agglomeration rule (complex) applied 10 times.
Iterating global reduction 2 with 10 rules applied. Total rules applied 212 place count 374 transition count 714
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 222 place count 364 transition count 714
Applied a total of 222 rules in 206 ms. Remains 364 /476 variables (removed 112) and now considering 714/824 (removed 110) transitions.
[2020-06-03 02:28:09] [INFO ] Flow matrix only has 702 transitions (discarded 12 similar events)
// Phase 1: matrix 702 rows 364 cols
[2020-06-03 02:28:09] [INFO ] Computed 44 place invariants in 19 ms
[2020-06-03 02:28:11] [INFO ] Dead Transitions using invariants and state equation in 2135 ms returned [81, 217, 236, 270, 349, 379, 396, 406, 424, 448, 450, 628, 629, 630, 632, 634, 635, 636, 638, 639, 640, 641, 646, 647, 649, 651, 652, 653, 654, 655, 656, 657, 659, 664, 665, 666, 667, 670, 671, 672, 673, 674, 675, 676, 683, 684, 685, 686, 687, 688, 690, 692, 693, 694, 695, 696, 698, 699, 700, 701, 702, 703, 705, 707, 708, 709]
Found 66 dead transitions using SMT.
Drop transitions removed 66 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 66 transitions :[709, 708, 707, 705, 703, 702, 701, 700, 699, 698, 696, 695, 694, 693, 692, 690, 688, 687, 686, 685, 684, 683, 676, 675, 674, 673, 672, 671, 670, 667, 666, 665, 664, 659, 657, 656, 655, 654, 653, 652, 651, 649, 647, 646, 641, 640, 639, 638, 636, 635, 634, 632, 630, 629, 628, 450, 448, 424, 406, 396, 379, 349, 270, 236, 217, 81]
Starting structural reductions, iteration 1 : 364/476 places, 648/824 transitions.
Reduce places removed 2 places and 12 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 362 transition count 636
Reduce places removed 12 places and 12 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 14 place count 350 transition count 624
Applied a total of 14 rules in 42 ms. Remains 350 /364 variables (removed 14) and now considering 624/648 (removed 24) transitions.
Finished structural reductions, in 2 iterations. Remains : 350/476 places, 624/824 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 02:28:12] [INFO ] Flow matrix only has 612 transitions (discarded 12 similar events)
// Phase 1: matrix 612 rows 350 cols
[2020-06-03 02:28:12] [INFO ] Computed 44 place invariants in 44 ms
Support contains 53 out of 350 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 350/350 places, 624/624 transitions.
Applied a total of 0 rules in 39 ms. Remains 350 /350 variables (removed 0) and now considering 624/624 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 350/350 places, 624/624 transitions.
Starting structural reductions, iteration 0 : 350/350 places, 624/624 transitions.
Applied a total of 0 rules in 24 ms. Remains 350 /350 variables (removed 0) and now considering 624/624 (removed 0) transitions.
[2020-06-03 02:28:12] [INFO ] Flow matrix only has 612 transitions (discarded 12 similar events)
// Phase 1: matrix 612 rows 350 cols
[2020-06-03 02:28:12] [INFO ] Computed 44 place invariants in 10 ms
[2020-06-03 02:28:13] [INFO ] Implicit Places using invariants in 1301 ms returned [84, 173, 199, 202, 309, 318]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 1318 ms to find 6 implicit places.
[2020-06-03 02:28:13] [INFO ] Redundant transitions in 59 ms returned []
[2020-06-03 02:28:13] [INFO ] Flow matrix only has 612 transitions (discarded 12 similar events)
// Phase 1: matrix 612 rows 344 cols
[2020-06-03 02:28:13] [INFO ] Computed 38 place invariants in 7 ms
[2020-06-03 02:28:15] [INFO ] Dead Transitions using invariants and state equation in 1597 ms returned []
Starting structural reductions, iteration 1 : 344/350 places, 624/624 transitions.
Applied a total of 0 rules in 22 ms. Remains 344 /344 variables (removed 0) and now considering 624/624 (removed 0) transitions.
[2020-06-03 02:28:15] [INFO ] Redundant transitions in 18 ms returned []
[2020-06-03 02:28:15] [INFO ] Flow matrix only has 612 transitions (discarded 12 similar events)
// Phase 1: matrix 612 rows 344 cols
[2020-06-03 02:28:15] [INFO ] Computed 38 place invariants in 7 ms
[2020-06-03 02:28:16] [INFO ] Dead Transitions using invariants and state equation in 1458 ms returned []
Finished structural reductions, in 2 iterations. Remains : 344/350 places, 624/624 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 02:28:16] [INFO ] Flow matrix only has 612 transitions (discarded 12 similar events)
// Phase 1: matrix 612 rows 344 cols
[2020-06-03 02:28:16] [INFO ] Computed 38 place invariants in 7 ms
Support contains 53 out of 344 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 344/344 places, 624/624 transitions.
Applied a total of 0 rules in 12 ms. Remains 344 /344 variables (removed 0) and now considering 624/624 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 344/344 places, 624/624 transitions.
Starting structural reductions, iteration 0 : 344/344 places, 624/624 transitions.
Applied a total of 0 rules in 11 ms. Remains 344 /344 variables (removed 0) and now considering 624/624 (removed 0) transitions.
[2020-06-03 02:28:16] [INFO ] Flow matrix only has 612 transitions (discarded 12 similar events)
// Phase 1: matrix 612 rows 344 cols
[2020-06-03 02:28:16] [INFO ] Computed 38 place invariants in 30 ms
[2020-06-03 02:28:17] [INFO ] Implicit Places using invariants in 667 ms returned []
[2020-06-03 02:28:17] [INFO ] Flow matrix only has 612 transitions (discarded 12 similar events)
// Phase 1: matrix 612 rows 344 cols
[2020-06-03 02:28:17] [INFO ] Computed 38 place invariants in 6 ms
[2020-06-03 02:28:18] [INFO ] State equation strengthened by 78 read => feed constraints.
[2020-06-03 02:28:24] [INFO ] Implicit Places using invariants and state equation in 6956 ms returned []
Implicit Place search using SMT with State Equation took 7624 ms to find 0 implicit places.
[2020-06-03 02:28:24] [INFO ] Redundant transitions in 5 ms returned []
[2020-06-03 02:28:24] [INFO ] Flow matrix only has 612 transitions (discarded 12 similar events)
// Phase 1: matrix 612 rows 344 cols
[2020-06-03 02:28:24] [INFO ] Computed 38 place invariants in 8 ms
[2020-06-03 02:28:26] [INFO ] Dead Transitions using invariants and state equation in 1934 ms returned []
Finished structural reductions, in 1 iterations. Remains : 344/344 places, 624/624 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 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 0 with 12 rules applied. Total rules applied 12 place count 344 transition count 612
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 1 with 12 rules applied. Total rules applied 24 place count 338 transition count 612
Free-agglomeration rule applied 6 times.
Iterating global reduction 1 with 6 rules applied. Total rules applied 30 place count 338 transition count 606
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 36 place count 332 transition count 606
Free-agglomeration rule (complex) applied 5 times.
Iterating global reduction 2 with 5 rules applied. Total rules applied 41 place count 332 transition count 601
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 46 place count 327 transition count 601
Partial Post-agglomeration rule applied 23 times.
Drop transitions removed 23 transitions
Iterating global reduction 3 with 23 rules applied. Total rules applied 69 place count 327 transition count 601
Drop transitions removed 11 transitions
Redundant transition composition rules discarded 11 transitions
Iterating global reduction 3 with 11 rules applied. Total rules applied 80 place count 327 transition count 590
Applied a total of 80 rules in 94 ms. Remains 327 /344 variables (removed 17) and now considering 590/624 (removed 34) transitions.
// Phase 1: matrix 590 rows 327 cols
[2020-06-03 02:28:26] [INFO ] Computed 38 place invariants in 34 ms
[2020-06-03 02:28:26] [INFO ] Export to MCC properties in file /home/mcc/execution/UpperBounds.sr.xml took 3 ms.
[2020-06-03 02:28:26] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 29 ms.
info: Time: 3600 - MCC
vrfy: Checking UpperBounds @ PolyORBLF-PT-S02J04T06 @ 3570 seconds

FORMULA PolyORBLF-PT-S02J04T06-UpperBounds-01 1 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA PolyORBLF-PT-S02J04T06-UpperBounds-08 1 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA PolyORBLF-PT-S02J04T06-UpperBounds-09 1 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA PolyORBLF-PT-S02J04T06-UpperBounds-10 1 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA PolyORBLF-PT-S02J04T06-UpperBounds-11 1 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA PolyORBLF-PT-S02J04T06-UpperBounds-12 10 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA PolyORBLF-PT-S02J04T06-UpperBounds-13 1 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA PolyORBLF-PT-S02J04T06-UpperBounds-14 1 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA PolyORBLF-PT-S02J04T06-UpperBounds-15 2 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA PolyORBLF-PT-S02J04T06-UpperBounds-00 2 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA PolyORBLF-PT-S02J04T06-UpperBounds-06 1 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA PolyORBLF-PT-S02J04T06-UpperBounds-07 1 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA PolyORBLF-PT-S02J04T06-UpperBounds-02 5 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA PolyORBLF-PT-S02J04T06-UpperBounds-04 1 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA PolyORBLF-PT-S02J04T06-UpperBounds-05 1 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA PolyORBLF-PT-S02J04T06-UpperBounds-03 1 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 3181
rslt: Output for UpperBounds @ PolyORBLF-PT-S02J04T06

{
"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 02:28:26 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(p6)",
"processed_size": 7,
"rewrites": 0
},
"result":
{
"edges": 61,
"markings": 62,
"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(p149)",
"processed_size": 9,
"rewrites": 0
},
"result":
{
"edges": 515,
"markings": 515,
"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(p104)",
"processed_size": 9,
"rewrites": 0
},
"result":
{
"edges": 60,
"markings": 61,
"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(p7)",
"processed_size": 7,
"rewrites": 0
},
"result":
{
"edges": 23128,
"markings": 22410,
"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(p116)",
"processed_size": 9,
"rewrites": 0
},
"result":
{
"edges": 96,
"markings": 97,
"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(p253)",
"processed_size": 9,
"rewrites": 0
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "search",
"value": 10
},
"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(p9)",
"processed_size": 7,
"rewrites": 0
},
"result":
{
"edges": 45,
"markings": 46,
"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(p194)",
"processed_size": 9,
"rewrites": 0
},
"result":
{
"edges": 35,
"markings": 36,
"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(p306)",
"processed_size": 9,
"rewrites": 0
},
"result":
{
"edges": 113,
"markings": 114,
"produced_by": "search",
"value": 2
},
"task":
{
"compoundnumber": 8,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "bound preserving/insertion"
},
"type": "dfs"
},
"type": "bound",
"workflow": "search"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 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": 6,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 6,
"visible_transitions": 0
},
"processed": "MAX(p154 + p163 + p192 + p315 + p75 + p65)",
"processed_size": 42,
"rewrites": 0
},
"result":
{
"edges": 32,
"markings": 33,
"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": 6,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 6,
"visible_transitions": 0
},
"processed": "MAX(p165 + p181 + p204 + p247 + p295 + p63)",
"processed_size": 43,
"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": 891
},
"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": 6,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 6,
"visible_transitions": 0
},
"processed": "MAX(p103 + p143 + p158 + p343 + p20 + p40)",
"processed_size": 42,
"rewrites": 0
},
"result":
{
"edges": 37011828,
"markings": 22501560,
"produced_by": "search",
"value": 5
},
"task":
{
"compoundnumber": 12,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "bound preserving/insertion"
},
"type": "dfs"
},
"type": "bound",
"workflow": "search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1060
},
"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": 6,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 6,
"visible_transitions": 0
},
"processed": "MAX(p218 + p89 + p270 + p286 + p303 + p333)",
"processed_size": 43,
"rewrites": 0
},
"result":
{
"edges": 19,
"markings": 20,
"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": 1590
},
"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": 6,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 6,
"visible_transitions": 0
},
"processed": "MAX(p2 + p115 + p151 + p185 + p341 + p78)",
"processed_size": 41,
"rewrites": 0
},
"result":
{
"edges": 8,
"markings": 9,
"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": 3181
},
"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": 12,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 12,
"visible_transitions": 0
},
"processed": "MAX(p161 + p202 + p256 + p262 + p305 + p76 + p316 + p335 + p10 + p47 + p50 + p58)",
"processed_size": 81,
"rewrites": 0
},
"result":
{
"edges": 25,
"markings": 26,
"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": 22944,
"runtime": 389.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": 2953,
"conflict_clusters": 68,
"places": 344,
"places_significant": 306,
"singleton_clusters": 0,
"transitions": 624
},
"result":
{
"preliminary_value": "2 1 5 1 1 1 1 1 1 1 1 1 10 1 1 2 ",
"value": "2 1 5 1 1 1 1 1 1 1 1 1 10 1 1 2 "
},
"task":
{
"type": "compound"
}
}
lola: LoLA will run for 3570 seconds at most (--timelimit)
lola: NET
lola: input: PNML file (--pnml)
lola: reading net from model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file model.pnml
lola: 968/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 11008
lola: finding significant places
lola: 344 places, 624 transitions, 306 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(p220 + p318) : MAX(p6) : MAX(p103 + p143 + p158 + p343 + p20 + p40) : MAX(p161 + p202 + p256 + p262 + p305 + p76 + p316 + p335 + p10 + p47 + p50 + p58) : MAX(p218 + p89 + p270 + p286 + p303 + p333) : MAX(p2 + p115 + p151 + p185 + p341 + p78) : MAX(p154 + p163 + p192 + p315 + p75 + p65) : MAX(p165 + p181 + p204 + p247 + p295 + p63) : MAX(p149) : MAX(p104) : MAX(p7) : MAX(p116) : MAX(p253) : MAX(p9) : MAX(p194) : MAX(p306)
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(p6)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(p6)
lola: processed formula length: 7
lola: 0 rewrites
lola: closed formula file UpperBounds.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using bound preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: RUNNING
lola: Structural Bound: 1
lola: SUBRESULT
lola: result: 1
lola: produced by: state space
lola: The maximum value of the given expression is 1
lola: 62 markings, 61 edges
lola: ========================================
lola: subprocess 1 will run for 237 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(p149)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(p149)
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: 515 markings, 515 edges
lola: ========================================
lola: subprocess 2 will run for 254 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(p104)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(p104)
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: 61 markings, 60 edges
lola: ========================================
lola: subprocess 3 will run for 274 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: 22410 markings, 23128 edges
lola: ========================================
lola: subprocess 4 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(p116)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(p116)
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: 97 markings, 96 edges
lola: ========================================
lola: subprocess 5 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(p253)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(p253)
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: 10
lola: SUBRESULT
lola: result: 10
lola: produced by: state space
lola: The maximum value of the given expression is 10
lola: 0 markings, 0 edges
lola: subprocess 6 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(p9)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(p9)
lola: processed formula length: 7
lola: 0 rewrites
lola: closed formula file UpperBounds.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using bound preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: RUNNING
lola: ========================================
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: 46 markings, 45 edges
lola: ========================================
lola: subprocess 7 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(p194)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(p194)
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: 36 markings, 35 edges
lola: ========================================
lola: subprocess 8 will run for 445 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(p306)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(p306)
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: 114 markings, 113 edges
lola: ========================================
lola: subprocess 9 will run for 509 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(p220 + p318)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(p220 + p318)
lola: processed formula length: 16
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: 0 markings, 0 edges
lola: ========================================
lola: subprocess 10 will run for 594 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(p154 + p163 + p192 + p315 + p75 + p65)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(p154 + p163 + p192 + p315 + p75 + p65)
lola: processed formula length: 42
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: 33 markings, 32 edges
lola: ========================================
lola: subprocess 11 will run for 712 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(p165 + p181 + p204 + p247 + p295 + p63)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(p165 + p181 + p204 + p247 + p295 + p63)
lola: processed formula length: 43
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: subprocess 12 will run for 891 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(p103 + p143 + p158 + p343 + p20 + p40)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(p103 + p143 + p158 + p343 + p20 + p40)
lola: processed formula length: 42
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: 6
lola: 289537 markings, 354842 edges, 57907 markings/sec, 0 secs
lola: 598186 markings, 750047 edges, 61730 markings/sec, 5 secs
lola: 907223 markings, 1149518 edges, 61807 markings/sec, 10 secs
lola: 1217707 markings, 1551198 edges, 62097 markings/sec, 15 secs
lola: 1505924 markings, 1933692 edges, 57643 markings/sec, 20 secs
lola: 1817009 markings, 2347263 edges, 62217 markings/sec, 25 secs
lola: 2130196 markings, 2760893 edges, 62637 markings/sec, 30 secs
lola: 2443450 markings, 3176301 edges, 62651 markings/sec, 35 secs
lola: 2767108 markings, 3609608 edges, 64732 markings/sec, 40 secs
lola: 3087046 markings, 4036182 edges, 63988 markings/sec, 45 secs
lola: 3405170 markings, 4476128 edges, 63625 markings/sec, 50 secs
lola: 3720058 markings, 4919752 edges, 62978 markings/sec, 55 secs
lola: 4033260 markings, 5362405 edges, 62640 markings/sec, 60 secs
lola: 4344278 markings, 5812676 edges, 62204 markings/sec, 65 secs
lola: 4651601 markings, 6273603 edges, 61465 markings/sec, 70 secs
lola: 4968377 markings, 6715407 edges, 63355 markings/sec, 75 secs
lola: 5269573 markings, 7201321 edges, 60239 markings/sec, 80 secs
lola: 5582789 markings, 7665108 edges, 62643 markings/sec, 85 secs
lola: 5891265 markings, 8132444 edges, 61695 markings/sec, 90 secs
lola: 6202881 markings, 8608169 edges, 62323 markings/sec, 95 secs
lola: 6516811 markings, 9066878 edges, 62786 markings/sec, 100 secs
lola: 6824434 markings, 9541472 edges, 61525 markings/sec, 105 secs
lola: 7121568 markings, 10035680 edges, 59427 markings/sec, 110 secs
lola: 7415885 markings, 10538877 edges, 58863 markings/sec, 115 secs
lola: 7705559 markings, 11041272 edges, 57935 markings/sec, 120 secs
lola: 7995757 markings, 11559030 edges, 58040 markings/sec, 125 secs
lola: 8301704 markings, 12035879 edges, 61189 markings/sec, 130 secs
lola: 8599296 markings, 12528745 edges, 59518 markings/sec, 135 secs
lola: 8891228 markings, 13004163 edges, 58386 markings/sec, 140 secs
lola: 9182326 markings, 13465116 edges, 58220 markings/sec, 145 secs
lola: 9473085 markings, 13924775 edges, 58152 markings/sec, 150 secs
lola: 9753320 markings, 14362373 edges, 56047 markings/sec, 155 secs
lola: 10048103 markings, 14822392 edges, 58957 markings/sec, 160 secs
lola: 10341808 markings, 15291318 edges, 58741 markings/sec, 165 secs
lola: 10637006 markings, 15769384 edges, 59040 markings/sec, 170 secs
lola: 10931743 markings, 16242235 edges, 58947 markings/sec, 175 secs
lola: 11230554 markings, 16696874 edges, 59762 markings/sec, 180 secs
lola: 11524573 markings, 17156176 edges, 58804 markings/sec, 185 secs
lola: 11823627 markings, 17605441 edges, 59811 markings/sec, 190 secs
lola: 12126569 markings, 18059351 edges, 60588 markings/sec, 195 secs
lola: 12431179 markings, 18504571 edges, 60922 markings/sec, 200 secs
lola: 12732052 markings, 18957022 edges, 60175 markings/sec, 205 secs
lola: 13034703 markings, 19402145 edges, 60530 markings/sec, 210 secs
lola: 13335617 markings, 19849908 edges, 60183 markings/sec, 215 secs
lola: 13642519 markings, 20293199 edges, 61380 markings/sec, 220 secs
lola: 13940668 markings, 20756691 edges, 59630 markings/sec, 225 secs
lola: 14234958 markings, 21242786 edges, 58858 markings/sec, 230 secs
lola: 14531454 markings, 21736747 edges, 59299 markings/sec, 235 secs
lola: 14826266 markings, 22222625 edges, 58962 markings/sec, 240 secs
lola: 15118869 markings, 22711868 edges, 58521 markings/sec, 245 secs
lola: 15410899 markings, 23215933 edges, 58406 markings/sec, 250 secs
lola: 15702066 markings, 23719853 edges, 58233 markings/sec, 255 secs
lola: 15992577 markings, 24223334 edges, 58102 markings/sec, 260 secs
lola: 16283883 markings, 24724573 edges, 58261 markings/sec, 265 secs
lola: 16577397 markings, 25210670 edges, 58703 markings/sec, 270 secs
lola: 16872407 markings, 25698097 edges, 59002 markings/sec, 275 secs
lola: 17151931 markings, 26162806 edges, 55905 markings/sec, 280 secs
lola: 17430161 markings, 26651426 edges, 55646 markings/sec, 285 secs
lola: 17713377 markings, 27149665 edges, 56643 markings/sec, 290 secs
lola: 17997771 markings, 27662416 edges, 56879 markings/sec, 295 secs
lola: 18282534 markings, 28174940 edges, 56953 markings/sec, 300 secs
lola: 18568439 markings, 28680681 edges, 57181 markings/sec, 305 secs
lola: 18853773 markings, 29195022 edges, 57067 markings/sec, 310 secs
lola: 19137677 markings, 29723702 edges, 56781 markings/sec, 315 secs
lola: 19418095 markings, 30262702 edges, 56084 markings/sec, 320 secs
lola: 19699227 markings, 30794578 edges, 56226 markings/sec, 325 secs
lola: 19978609 markings, 31334392 edges, 55876 markings/sec, 330 secs
lola: 20258799 markings, 31873015 edges, 56038 markings/sec, 335 secs
lola: 20514325 markings, 32417637 edges, 51105 markings/sec, 340 secs
lola: 20780231 markings, 32958429 edges, 53181 markings/sec, 345 secs
lola: 21048761 markings, 33520708 edges, 53706 markings/sec, 350 secs
lola: 21316900 markings, 34103024 edges, 53628 markings/sec, 355 secs
lola: 21580281 markings, 34690761 edges, 52676 markings/sec, 360 secs
lola: 21841342 markings, 35306471 edges, 52212 markings/sec, 365 secs
lola: 22100125 markings, 35929590 edges, 51757 markings/sec, 370 secs
lola: 22352740 markings, 36576266 edges, 50523 markings/sec, 375 secs
lola: SUBRESULT
lola: result: 5
lola: produced by: state space
lola: The maximum value of the given expression is 5
lola: 22501560 markings, 37011828 edges
lola: ========================================
lola: subprocess 13 will run for 1060 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(p218 + p89 + p270 + p286 + p303 + p333)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(p218 + p89 + p270 + p286 + p303 + p333)
lola: processed formula length: 43
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: 20 markings, 19 edges
lola: ========================================
lola: subprocess 14 will run for 1590 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(p2 + p115 + p151 + p185 + p341 + p78)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(p2 + p115 + p151 + p185 + p341 + p78)
lola: processed formula length: 41
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 15 will run for 3181 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(p161 + p202 + p256 + p262 + p305 + p76 + p316 + p335 + p10 + p47 + p50 + p58)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(p161 + p202 + p256 + p262 + p305 + p76 + p316 + p335 + p10 + p47 + p50 + p58)
lola: processed formula length: 81
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: 26 markings, 25 edges
lola: RESULT
lola:
SUMMARY: 2 1 5 1 1 1 1 1 1 1 1 1 10 1 1 2
lola:
preliminary result: 2 1 5 1 1 1 1 1 1 1 1 1 10 1 1 2
lola: ========================================
lola: memory consumption: 22944 KB
lola: time consumption: 389 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="PolyORBLF-PT-S02J04T06"
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 PolyORBLF-PT-S02J04T06, 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-158987871800413"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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