Execution Chart

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

Trace from the execution

Formatting '/data/fko/mcc2020-input.r182-oct2-158987913800381.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fko/mcc2020-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.........................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itslola
Input is BridgeAndVehicles-PT-V50P50N10, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r182-oct2-158987913800381
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.5M
-rw-r--r-- 1 mcc users 6.9K Mar 26 02:32 CTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Mar 26 02:32 CTLCardinality.xml
-rw-r--r-- 1 mcc users 92K Mar 25 21:28 CTLFireability.txt
-rw-r--r-- 1 mcc users 271K Mar 25 21:28 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 24 05:37 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 14K Apr 8 14:43 LTLCardinality.txt
-rw-r--r-- 1 mcc users 55K Apr 28 14:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 47K Apr 8 14:43 LTLFireability.txt
-rw-r--r-- 1 mcc users 156K Apr 28 14:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.8K Mar 25 17:30 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 33K Mar 25 17:30 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 61K Mar 25 13:04 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 178K Mar 25 13:04 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 3.0K Mar 25 17:55 UpperBounds.txt
-rw-r--r-- 1 mcc users 6.2K Mar 25 17:55 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 1.5M 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 BridgeAndVehicles-PT-V50P50N10-UpperBounds-00
FORMULA_NAME BridgeAndVehicles-PT-V50P50N10-UpperBounds-01
FORMULA_NAME BridgeAndVehicles-PT-V50P50N10-UpperBounds-02
FORMULA_NAME BridgeAndVehicles-PT-V50P50N10-UpperBounds-03
FORMULA_NAME BridgeAndVehicles-PT-V50P50N10-UpperBounds-04
FORMULA_NAME BridgeAndVehicles-PT-V50P50N10-UpperBounds-05
FORMULA_NAME BridgeAndVehicles-PT-V50P50N10-UpperBounds-06
FORMULA_NAME BridgeAndVehicles-PT-V50P50N10-UpperBounds-07
FORMULA_NAME BridgeAndVehicles-PT-V50P50N10-UpperBounds-08
FORMULA_NAME BridgeAndVehicles-PT-V50P50N10-UpperBounds-09
FORMULA_NAME BridgeAndVehicles-PT-V50P50N10-UpperBounds-10
FORMULA_NAME BridgeAndVehicles-PT-V50P50N10-UpperBounds-11
FORMULA_NAME BridgeAndVehicles-PT-V50P50N10-UpperBounds-12
FORMULA_NAME BridgeAndVehicles-PT-V50P50N10-UpperBounds-13
FORMULA_NAME BridgeAndVehicles-PT-V50P50N10-UpperBounds-14
FORMULA_NAME BridgeAndVehicles-PT-V50P50N10-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1591148470022

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-03 01:41:12] [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 01:41:12] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-03 01:41:12] [INFO ] Load time of PNML (sax parser for PT used): 113 ms
[2020-06-03 01:41:12] [INFO ] Transformed 128 places.
[2020-06-03 01:41:12] [INFO ] Transformed 1328 transitions.
[2020-06-03 01:41:12] [INFO ] Parsed PT model containing 128 places and 1328 transitions in 157 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 30 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 01:41:12] [INFO ] Flatten gal took : 124 ms
FORMULA BridgeAndVehicles-PT-V50P50N10-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-PT-V50P50N10-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
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 01:41:12] [INFO ] Flow matrix only has 250 transitions (discarded 1078 similar events)
// Phase 1: matrix 250 rows 128 cols
[2020-06-03 01:41:12] [INFO ] Computed 7 place invariants in 10 ms
Support contains 12 out of 128 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 128/128 places, 1328/1328 transitions.
Discarding 1 places :
Also discarding 0 output transitions
Graph (complete) has 1222 edges and 128 vertex of which 127 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.9 ms
Applied a total of 1 rules in 157 ms. Remains 127 /128 variables (removed 1) and now considering 1328/1328 (removed 0) transitions.
[2020-06-03 01:41:13] [INFO ] Flow matrix only has 250 transitions (discarded 1078 similar events)
// Phase 1: matrix 250 rows 127 cols
[2020-06-03 01:41:13] [INFO ] Computed 6 place invariants in 4 ms
[2020-06-03 01:41:13] [INFO ] Dead Transitions using invariants and state equation in 969 ms returned []
Finished structural reductions, in 1 iterations. Remains : 127/128 places, 1328/1328 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 01:41:14] [INFO ] Flow matrix only has 250 transitions (discarded 1078 similar events)
// Phase 1: matrix 250 rows 127 cols
[2020-06-03 01:41:14] [INFO ] Computed 6 place invariants in 3 ms
Support contains 12 out of 127 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 127/127 places, 1328/1328 transitions.
Applied a total of 0 rules in 72 ms. Remains 127 /127 variables (removed 0) and now considering 1328/1328 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 127/127 places, 1328/1328 transitions.
Starting structural reductions, iteration 0 : 127/127 places, 1328/1328 transitions.
Applied a total of 0 rules in 89 ms. Remains 127 /127 variables (removed 0) and now considering 1328/1328 (removed 0) transitions.
[2020-06-03 01:41:14] [INFO ] Flow matrix only has 250 transitions (discarded 1078 similar events)
// Phase 1: matrix 250 rows 127 cols
[2020-06-03 01:41:14] [INFO ] Computed 6 place invariants in 2 ms
[2020-06-03 01:41:14] [INFO ] Implicit Places using invariants in 226 ms returned []
[2020-06-03 01:41:14] [INFO ] Flow matrix only has 250 transitions (discarded 1078 similar events)
// Phase 1: matrix 250 rows 127 cols
[2020-06-03 01:41:14] [INFO ] Computed 6 place invariants in 3 ms
[2020-06-03 01:41:14] [INFO ] State equation strengthened by 22 read => feed constraints.
[2020-06-03 01:41:15] [INFO ] Implicit Places using invariants and state equation in 694 ms returned [52, 109]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 931 ms to find 2 implicit places.
[2020-06-03 01:41:15] [INFO ] Redundant transitions in 63 ms returned []
[2020-06-03 01:41:15] [INFO ] Flow matrix only has 250 transitions (discarded 1078 similar events)
// Phase 1: matrix 250 rows 125 cols
[2020-06-03 01:41:15] [INFO ] Computed 5 place invariants in 2 ms
[2020-06-03 01:41:15] [INFO ] Dead Transitions using invariants and state equation in 715 ms returned []
Starting structural reductions, iteration 1 : 125/127 places, 1328/1328 transitions.
Applied a total of 0 rules in 64 ms. Remains 125 /125 variables (removed 0) and now considering 1328/1328 (removed 0) transitions.
[2020-06-03 01:41:15] [INFO ] Redundant transitions in 42 ms returned []
[2020-06-03 01:41:15] [INFO ] Flow matrix only has 250 transitions (discarded 1078 similar events)
// Phase 1: matrix 250 rows 125 cols
[2020-06-03 01:41:15] [INFO ] Computed 5 place invariants in 1 ms
[2020-06-03 01:41:16] [INFO ] Dead Transitions using invariants and state equation in 696 ms returned []
Finished structural reductions, in 2 iterations. Remains : 125/127 places, 1328/1328 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 01:41:16] [INFO ] Flow matrix only has 250 transitions (discarded 1078 similar events)
// Phase 1: matrix 250 rows 125 cols
[2020-06-03 01:41:16] [INFO ] Computed 5 place invariants in 1 ms
Support contains 12 out of 125 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 125/125 places, 1328/1328 transitions.
Applied a total of 0 rules in 55 ms. Remains 125 /125 variables (removed 0) and now considering 1328/1328 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 125/125 places, 1328/1328 transitions.
Starting structural reductions, iteration 0 : 125/125 places, 1328/1328 transitions.
Applied a total of 0 rules in 55 ms. Remains 125 /125 variables (removed 0) and now considering 1328/1328 (removed 0) transitions.
[2020-06-03 01:41:16] [INFO ] Flow matrix only has 250 transitions (discarded 1078 similar events)
// Phase 1: matrix 250 rows 125 cols
[2020-06-03 01:41:16] [INFO ] Computed 5 place invariants in 1 ms
[2020-06-03 01:41:17] [INFO ] Implicit Places using invariants in 220 ms returned []
[2020-06-03 01:41:17] [INFO ] Flow matrix only has 250 transitions (discarded 1078 similar events)
// Phase 1: matrix 250 rows 125 cols
[2020-06-03 01:41:17] [INFO ] Computed 5 place invariants in 1 ms
[2020-06-03 01:41:17] [INFO ] State equation strengthened by 22 read => feed constraints.
[2020-06-03 01:41:17] [INFO ] Implicit Places using invariants and state equation in 623 ms returned []
Implicit Place search using SMT with State Equation took 844 ms to find 0 implicit places.
[2020-06-03 01:41:17] [INFO ] Redundant transitions in 20 ms returned []
[2020-06-03 01:41:17] [INFO ] Flow matrix only has 250 transitions (discarded 1078 similar events)
// Phase 1: matrix 250 rows 125 cols
[2020-06-03 01:41:17] [INFO ] Computed 5 place invariants in 1 ms
[2020-06-03 01:41:18] [INFO ] Dead Transitions using invariants and state equation in 625 ms returned []
Finished structural reductions, in 1 iterations. Remains : 125/125 places, 1328/1328 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 1078 transitions
Reduce isomorphic transitions removed 1078 transitions.
Iterating post reduction 0 with 1078 rules applied. Total rules applied 1078 place count 125 transition count 250
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 1 with 4 rules applied. Total rules applied 1082 place count 123 transition count 248
Applied a total of 1082 rules in 9 ms. Remains 123 /125 variables (removed 2) and now considering 248/1328 (removed 1080) transitions.
// Phase 1: matrix 248 rows 123 cols
[2020-06-03 01:41:18] [INFO ] Computed 5 place invariants in 0 ms
[2020-06-03 01:41:18] [INFO ] Export to MCC properties in file /home/mcc/execution/UpperBounds.sr.xml took 2 ms.
[2020-06-03 01:41:18] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 11 ms.
info: Time: 3600 - MCC
vrfy: Checking UpperBounds @ BridgeAndVehicles-PT-V50P50N10 @ 3570 seconds

FORMULA BridgeAndVehicles-PT-V50P50N10-UpperBounds-00 50 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA BridgeAndVehicles-PT-V50P50N10-UpperBounds-01 50 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA BridgeAndVehicles-PT-V50P50N10-UpperBounds-02 10 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA BridgeAndVehicles-PT-V50P50N10-UpperBounds-03 50 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA BridgeAndVehicles-PT-V50P50N10-UpperBounds-04 50 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA BridgeAndVehicles-PT-V50P50N10-UpperBounds-06 10 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA BridgeAndVehicles-PT-V50P50N10-UpperBounds-08 1 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA BridgeAndVehicles-PT-V50P50N10-UpperBounds-09 1 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA BridgeAndVehicles-PT-V50P50N10-UpperBounds-10 1 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA BridgeAndVehicles-PT-V50P50N10-UpperBounds-11 1 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA BridgeAndVehicles-PT-V50P50N10-UpperBounds-12 1 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA BridgeAndVehicles-PT-V50P50N10-UpperBounds-13 1 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA BridgeAndVehicles-PT-V50P50N10-UpperBounds-14 1 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA BridgeAndVehicles-PT-V50P50N10-UpperBounds-15 1 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 2997
rslt: Output for UpperBounds @ BridgeAndVehicles-PT-V50P50N10

{
"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 01:41:18 2020
",
"timelimit": 3570
},
"child":
[

{
"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(p0)",
"processed_size": 7,
"rewrites": 0
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "search",
"value": 50
},
"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": 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(p54)",
"processed_size": 8,
"rewrites": 0
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "search",
"value": 50
},
"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": 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": 53671983,
"markings": 15955989,
"produced_by": "search",
"value": 10
},
"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": 298
},
"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(p53)",
"processed_size": 8,
"rewrites": 0
},
"result":
{
"edges": 220,
"markings": 221,
"produced_by": "search",
"value": 50
},
"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": 328
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 0,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "MAX(p53)",
"processed_size": 8,
"rewrites": 0
},
"result":
{
"edges": 220,
"markings": 221,
"produced_by": "search",
"value": 50
},
"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": 364
},
"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": 53671983,
"markings": 15955989,
"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": 374
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 0,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "MAX(p16)",
"processed_size": 8,
"rewrites": 0
},
"result":
{
"edges": 16,
"markings": 17,
"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": 428
},
"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(p82)",
"processed_size": 8,
"rewrites": 0
},
"result":
{
"edges": 29,
"markings": 30,
"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": 499
},
"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(p86)",
"processed_size": 8,
"rewrites": 0
},
"result":
{
"edges": 33,
"markings": 34,
"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": 599
},
"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(p67)",
"processed_size": 8,
"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": 749
},
"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": 7,
"markings": 8,
"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": 999
},
"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(p97)",
"processed_size": 8,
"rewrites": 0
},
"result":
{
"edges": 44,
"markings": 45,
"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": 1498
},
"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(p107)",
"processed_size": 9,
"rewrites": 0
},
"result":
{
"edges": 54,
"markings": 55,
"produced_by": "search",
"value": 1
},
"task":
{
"compoundnumber": 12,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "bound preserving/insertion"
},
"type": "dfs"
},
"type": "bound",
"workflow": "search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 2997
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 0,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "MAX(p3)",
"processed_size": 7,
"rewrites": 0
},
"result":
{
"edges": 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"
}
}
],
"exit":
{
"error": null,
"memory": 42032,
"runtime": 573.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(*)"
},
"net":
{
"arcs": 9807,
"conflict_clusters": 4,
"places": 125,
"places_significant": 120,
"singleton_clusters": 0,
"transitions": 1328
},
"result":
{
"preliminary_value": "50 50 10 50 50 10 1 1 1 1 1 1 1 1 ",
"value": "50 50 10 50 50 10 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: 1453/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 4000
lola: finding significant places
lola: 125 places, 1328 transitions, 120 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(p0) : MAX(p54) : MAX(p110) : MAX(p53) : MAX(p53) : MAX(p110) : MAX(p16) : MAX(p82) : MAX(p86) : MAX(p67) : MAX(p7) : MAX(p97) : MAX(p107) : MAX(p3)
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 254 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(p0)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(p0)
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: 50
lola: SUBRESULT
lola: result: 50
lola: produced by: state space
lola: The maximum value of the given expression is 50
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 1 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(p54)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(p54)
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: 50
lola: SUBRESULT
lola: result: 50
lola: produced by: state space
lola: The maximum value of the given expression is 50
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 2 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: 50
lola: 292369 markings, 753471 edges, 58474 markings/sec, 0 secs
lola: 591967 markings, 1759122 edges, 59920 markings/sec, 5 secs
lola: 892116 markings, 2795515 edges, 60030 markings/sec, 10 secs
lola: 1184176 markings, 3771229 edges, 58412 markings/sec, 15 secs
lola: 1488055 markings, 4606098 edges, 60776 markings/sec, 20 secs
lola: 1779495 markings, 5603711 edges, 58288 markings/sec, 25 secs
lola: 2073381 markings, 6612038 edges, 58777 markings/sec, 30 secs
lola: 2366878 markings, 7622374 edges, 58699 markings/sec, 35 secs
lola: 2660864 markings, 8640011 edges, 58797 markings/sec, 40 secs
lola: 2945705 markings, 9603907 edges, 56968 markings/sec, 45 secs
lola: 3240928 markings, 10603006 edges, 59045 markings/sec, 50 secs
lola: 3536864 markings, 11622736 edges, 59187 markings/sec, 55 secs
lola: 3826199 markings, 12605545 edges, 57867 markings/sec, 60 secs
lola: 4128732 markings, 13395098 edges, 60507 markings/sec, 65 secs
lola: 4416214 markings, 14380153 edges, 57496 markings/sec, 70 secs
lola: 4699891 markings, 15352947 edges, 56735 markings/sec, 75 secs
lola: 4986923 markings, 16338561 edges, 57406 markings/sec, 80 secs
lola: 5265158 markings, 17295638 edges, 55647 markings/sec, 85 secs
lola: 5534089 markings, 18221835 edges, 53786 markings/sec, 90 secs
lola: 5804486 markings, 19154457 edges, 54079 markings/sec, 95 secs
lola: 6074868 markings, 20079593 edges, 54076 markings/sec, 100 secs
lola: 6341335 markings, 20985405 edges, 53293 markings/sec, 105 secs
lola: 6617678 markings, 21930919 edges, 55269 markings/sec, 110 secs
lola: 6894964 markings, 22882125 edges, 55457 markings/sec, 115 secs
lola: 7173477 markings, 23841548 edges, 55703 markings/sec, 120 secs
lola: 7454992 markings, 24814503 edges, 56303 markings/sec, 125 secs
lola: 7733504 markings, 25765585 edges, 55702 markings/sec, 130 secs
lola: 8013396 markings, 26707888 edges, 55978 markings/sec, 135 secs
lola: 8301981 markings, 27696761 edges, 57717 markings/sec, 140 secs
lola: 8586035 markings, 28672378 edges, 56811 markings/sec, 145 secs
lola: 8883114 markings, 29489708 edges, 59416 markings/sec, 150 secs
lola: 9156765 markings, 30367941 edges, 54730 markings/sec, 155 secs
lola: 9419825 markings, 31270219 edges, 52612 markings/sec, 160 secs
lola: 9684993 markings, 32179722 edges, 53034 markings/sec, 165 secs
lola: 9947222 markings, 33080079 edges, 52446 markings/sec, 170 secs
lola: 10211289 markings, 33988052 edges, 52813 markings/sec, 175 secs
lola: 10471992 markings, 34882383 edges, 52141 markings/sec, 180 secs
lola: 10737110 markings, 35793989 edges, 53024 markings/sec, 185 secs
lola: 11002459 markings, 36706178 edges, 53070 markings/sec, 190 secs
lola: 11265178 markings, 37603785 edges, 52544 markings/sec, 195 secs
lola: 11530689 markings, 38512340 edges, 53102 markings/sec, 200 secs
lola: 11798380 markings, 39429870 edges, 53538 markings/sec, 205 secs
lola: 12069231 markings, 40359641 edges, 54170 markings/sec, 210 secs
lola: 12338261 markings, 41283757 edges, 53806 markings/sec, 215 secs
lola: 12610729 markings, 42221518 edges, 54494 markings/sec, 220 secs
lola: 12883124 markings, 43159976 edges, 54479 markings/sec, 225 secs
lola: 13156490 markings, 44101421 edges, 54673 markings/sec, 230 secs
lola: 13425702 markings, 45018110 edges, 53842 markings/sec, 235 secs
lola: 13698201 markings, 45947382 edges, 54500 markings/sec, 240 secs
lola: 13976958 markings, 46901330 edges, 55751 markings/sec, 245 secs
lola: 14255351 markings, 47858422 edges, 55679 markings/sec, 250 secs
lola: 14533260 markings, 48817080 edges, 55582 markings/sec, 255 secs
lola: 14816354 markings, 49795730 edges, 56619 markings/sec, 260 secs
lola: 15091070 markings, 50721950 edges, 54943 markings/sec, 265 secs
lola: 15377245 markings, 51692672 edges, 57235 markings/sec, 270 secs
lola: 15665518 markings, 52687656 edges, 57655 markings/sec, 275 secs
lola: 15947631 markings, 53644253 edges, 56423 markings/sec, 280 secs
lola: SUBRESULT
lola: result: 10
lola: produced by: state space
lola: The maximum value of the given expression is 10
lola: 15955989 markings, 53671983 edges
lola: ========================================
lola: subprocess 3 will run for 298 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(p53)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(p53)
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: 50
lola: SUBRESULT
lola: result: 50
lola: produced by: state space
lola: The maximum value of the given expression is 50
lola: 221 markings, 220 edges
lola: ========================================
lola: subprocess 4 will run for 328 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(p53)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(p53)
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: 50
lola: SUBRESULT
lola: result: 50
lola: produced by: state space
lola: The maximum value of the given expression is 50
lola: 221 markings, 220 edges
lola: subprocess 5 will run for 364 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: ========================================
lola: Structural Bound: 50
lola: 290698 markings, 749908 edges, 58140 markings/sec, 0 secs
lola: 580424 markings, 1720185 edges, 57945 markings/sec, 5 secs
lola: 871528 markings, 2724408 edges, 58221 markings/sec, 10 secs
lola: 1152195 markings, 3676116 edges, 56133 markings/sec, 15 secs
lola: 1442717 markings, 4451697 edges, 58104 markings/sec, 20 secs
lola: 1719406 markings, 5397215 edges, 55338 markings/sec, 25 secs
lola: 2000792 markings, 6362051 edges, 56277 markings/sec, 30 secs
lola: 2282834 markings, 7332805 edges, 56408 markings/sec, 35 secs
lola: 2563690 markings, 8303560 edges, 56171 markings/sec, 40 secs
lola: 2844563 markings, 9268525 edges, 56175 markings/sec, 45 secs
lola: 3121516 markings, 10198519 edges, 55391 markings/sec, 50 secs
lola: 3410558 markings, 11184887 edges, 57808 markings/sec, 55 secs
lola: 3702362 markings, 12200195 edges, 58361 markings/sec, 60 secs
lola: 3989273 markings, 13019027 edges, 57382 markings/sec, 65 secs
lola: 4273584 markings, 13890736 edges, 56862 markings/sec, 70 secs
lola: 4546100 markings, 14825701 edges, 54503 markings/sec, 75 secs
lola: 4821731 markings, 15771454 edges, 55126 markings/sec, 80 secs
lola: 5101319 markings, 16732483 edges, 55918 markings/sec, 85 secs
lola: 5380021 markings, 17691804 edges, 55740 markings/sec, 90 secs
lola: 5659235 markings, 18654076 edges, 55843 markings/sec, 95 secs
lola: 5936541 markings, 19608909 edges, 55461 markings/sec, 100 secs
lola: 6206254 markings, 20524430 edges, 53943 markings/sec, 105 secs
lola: 6484967 markings, 21476742 edges, 55743 markings/sec, 110 secs
lola: 6756038 markings, 22406112 edges, 54214 markings/sec, 115 secs
lola: 7035851 markings, 23367459 edges, 55963 markings/sec, 120 secs
lola: 7319729 markings, 24347298 edges, 56776 markings/sec, 125 secs
lola: 7605997 markings, 25334541 edges, 57254 markings/sec, 130 secs
lola: 7883905 markings, 26269677 edges, 55582 markings/sec, 135 secs
lola: 8172516 markings, 27251011 edges, 57722 markings/sec, 140 secs
lola: 8463887 markings, 28262119 edges, 58274 markings/sec, 145 secs
lola: 8749752 markings, 29166380 edges, 57173 markings/sec, 150 secs
lola: 9047460 markings, 29993501 edges, 59542 markings/sec, 155 secs
lola: 9326096 markings, 30948285 edges, 55727 markings/sec, 160 secs
lola: 9604749 markings, 31904823 edges, 55731 markings/sec, 165 secs
lola: 9883031 markings, 32858939 edges, 55656 markings/sec, 170 secs
lola: 10160072 markings, 33811333 edges, 55408 markings/sec, 175 secs
lola: 10434714 markings, 34754812 edges, 54928 markings/sec, 180 secs
lola: 10709759 markings, 35700271 edges, 55009 markings/sec, 185 secs
lola: 10984889 markings, 36645148 edges, 55026 markings/sec, 190 secs
lola: 11257809 markings, 37578322 edges, 54584 markings/sec, 195 secs
lola: 11532466 markings, 38518603 edges, 54931 markings/sec, 200 secs
lola: 11809906 markings, 39468522 edges, 55488 markings/sec, 205 secs
lola: 12087764 markings, 40423103 edges, 55572 markings/sec, 210 secs
lola: 12364567 markings, 41374190 edges, 55361 markings/sec, 215 secs
lola: 12642089 markings, 42329066 edges, 55504 markings/sec, 220 secs
lola: 12919499 markings, 43285531 edges, 55482 markings/sec, 225 secs
lola: 13197251 markings, 44241153 edges, 55550 markings/sec, 230 secs
lola: 13470254 markings, 45168711 edges, 54601 markings/sec, 235 secs
lola: 13746872 markings, 46114088 edges, 55324 markings/sec, 240 secs
lola: 14027450 markings, 47075423 edges, 56116 markings/sec, 245 secs
lola: 14309166 markings, 48043500 edges, 56343 markings/sec, 250 secs
lola: 14591709 markings, 49019107 edges, 56509 markings/sec, 255 secs
lola: 14875540 markings, 49999237 edges, 56766 markings/sec, 260 secs
lola: 15150339 markings, 50922615 edges, 54960 markings/sec, 265 secs
lola: 15436278 markings, 51894673 edges, 57188 markings/sec, 270 secs
lola: 15720200 markings, 52879089 edges, 56784 markings/sec, 275 secs
lola: SUBRESULT
lola: result: 10
lola: produced by: state space
lola: The maximum value of the given expression is 10
lola: 15955989 markings, 53671983 edges
lola: subprocess 6 will run for 374 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ========================================
lola: ...considering subproblem: MAX(p16)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(p16)
lola: processed formula length: 8
lola: 0 rewrites
lola: closed formula file UpperBounds.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using bound preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: RUNNING
lola: Structural Bound: 1
lola: SUBRESULT
lola: result: 1
lola: produced by: state space
lola: The maximum value of the given expression is 1
lola: 17 markings, 16 edges
lola: ========================================
lola: subprocess 7 will run for 428 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(p82)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(p82)
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: 30 markings, 29 edges
lola: ========================================
lola: subprocess 8 will run for 499 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(p86)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(p86)
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: 34 markings, 33 edges
lola: ========================================
lola: subprocess 9 will run for 599 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(p67)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(p67)
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: 11 markings, 10 edges
lola: ========================================
lola: subprocess 10 will run for 749 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: 8 markings, 7 edges
lola: ========================================
lola: subprocess 11 will run for 999 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(p97)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(p97)
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: 45 markings, 44 edges
lola: ========================================
lola: subprocess 12 will run for 1498 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(p107)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(p107)
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: 55 markings, 54 edges
lola: ========================================
lola: subprocess 13 will run for 2997 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(p3)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(p3)
lola: processed formula length: 7
lola: 0 rewrites
lola: closed formula file UpperBounds.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using bound preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: RUNNING
lola: 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: RESULT
lola:
SUMMARY: 50 50 10 50 50 10 1 1 1 1 1 1 1 1
lola:
preliminary result: 50 50 10 50 50 10 1 1 1 1 1 1 1 1
lola: memory consumption: 42032 KB
lola: time consumption: 573 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="BridgeAndVehicles-PT-V50P50N10"
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 BridgeAndVehicles-PT-V50P50N10, 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 r182-oct2-158987913800381"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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