fond
Model Checking Contest 2020
10th edition, Paris, France, June 23, 2020
Execution of r174-csrt-158987852800141
Last Updated
Jun 28, 2020

About the Execution of ITS-LoLa for NQueens-PT-12

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
15744.650 3600000.00 12742.00 137.10 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 normal

Execution Chart

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

Trace from the execution

Formatting '/local/x2003239/mcc2020-input.r174-csrt-158987852800141.qcow2', fmt=qcow2 size=4294967296 backing_file=/local/x2003239/mcc2020-input.qcow2 encryption=off 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 NQueens-PT-12, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r174-csrt-158987852800141
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 296K
-rw-r--r-- 1 mcc users 3.5K Apr 8 13:12 CTLCardinality.txt
-rw-r--r-- 1 mcc users 20K Apr 8 13:12 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.7K Apr 7 16:39 CTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 7 16:39 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 24 05:37 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.5K Apr 14 12:43 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 28 14:01 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Apr 14 12:43 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 28 14:01 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Apr 6 19:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 18K Apr 6 19:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.9K Apr 6 02:50 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 15K Apr 6 02:50 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 6 20:24 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Apr 6 20:24 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 24 05:37 instance
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 iscolored
-rw-r--r-- 1 mcc users 127K 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 NQueens-PT-12-UpperBounds-00
FORMULA_NAME NQueens-PT-12-UpperBounds-01
FORMULA_NAME NQueens-PT-12-UpperBounds-02
FORMULA_NAME NQueens-PT-12-UpperBounds-03
FORMULA_NAME NQueens-PT-12-UpperBounds-04
FORMULA_NAME NQueens-PT-12-UpperBounds-05
FORMULA_NAME NQueens-PT-12-UpperBounds-06
FORMULA_NAME NQueens-PT-12-UpperBounds-07
FORMULA_NAME NQueens-PT-12-UpperBounds-08
FORMULA_NAME NQueens-PT-12-UpperBounds-09
FORMULA_NAME NQueens-PT-12-UpperBounds-10
FORMULA_NAME NQueens-PT-12-UpperBounds-11
FORMULA_NAME NQueens-PT-12-UpperBounds-12
FORMULA_NAME NQueens-PT-12-UpperBounds-13
FORMULA_NAME NQueens-PT-12-UpperBounds-14
FORMULA_NAME NQueens-PT-12-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1591130969530

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-02 20:49:31] [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-02 20:49:31] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-02 20:49:32] [INFO ] Load time of PNML (sax parser for PT used): 89 ms
[2020-06-02 20:49:32] [INFO ] Transformed 216 places.
[2020-06-02 20:49:32] [INFO ] Transformed 144 transitions.
[2020-06-02 20:49:32] [INFO ] Parsed PT model containing 216 places and 144 transitions in 183 ms.
Reduce places removed 2 places and 0 transitions.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 23 ms.
Finished random walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
[2020-06-02 20:49:32] [INFO ] Flatten gal took : 88 ms
FORMULA NQueens-PT-12-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Finished random walk after 0 steps, including 0 resets, run visited all 0 properties in 2 ms. (steps per millisecond=0 )
Finished probabilistic random walk after 0 steps, run visited all 0 properties in 0 ms. (steps per millisecond=0 )
// Phase 1: matrix 144 rows 214 cols
[2020-06-02 20:49:32] [INFO ] Computed 70 place invariants in 34 ms
Support contains 14 out of 214 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 214/214 places, 144/144 transitions.
Discarding 141 places :
Also discarding 0 output transitions
Graph (complete) has 576 edges and 214 vertex of which 73 are kept as prefixes of interest. Removing 141 places using SCC suffix rule.8 ms
Drop transitions removed 107 transitions
Reduce isomorphic transitions removed 107 transitions.
Iterating post reduction 0 with 107 rules applied. Total rules applied 108 place count 73 transition count 37
Ensure Unique test removed 2 places
Iterating post reduction 1 with 2 rules applied. Total rules applied 110 place count 71 transition count 37
Applied a total of 110 rules in 21 ms. Remains 71 /214 variables (removed 143) and now considering 37/144 (removed 107) transitions.
Finished structural reductions, in 1 iterations. Remains : 71/214 places, 37/144 transitions.
Finished random walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished probabilistic random walk after 0 steps, run visited all 0 properties in 0 ms. (steps per millisecond=0 )
// Phase 1: matrix 37 rows 71 cols
[2020-06-02 20:49:32] [INFO ] Computed 34 place invariants in 1 ms
Support contains 14 out of 71 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 71/71 places, 37/37 transitions.
Applied a total of 0 rules in 2 ms. Remains 71 /71 variables (removed 0) and now considering 37/37 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 71/71 places, 37/37 transitions.
Starting structural reductions, iteration 0 : 71/71 places, 37/37 transitions.
Applied a total of 0 rules in 2 ms. Remains 71 /71 variables (removed 0) and now considering 37/37 (removed 0) transitions.
// Phase 1: matrix 37 rows 71 cols
[2020-06-02 20:49:32] [INFO ] Computed 34 place invariants in 1 ms
[2020-06-02 20:49:32] [INFO ] Implicit Places using invariants in 252 ms returned [14, 27, 29, 32, 40, 47, 49, 55, 56, 70]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 255 ms to find 10 implicit places.
[2020-06-02 20:49:32] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 37 rows 61 cols
[2020-06-02 20:49:32] [INFO ] Computed 24 place invariants in 2 ms
[2020-06-02 20:49:32] [INFO ] Dead Transitions using invariants and state equation in 58 ms returned []
Starting structural reductions, iteration 1 : 61/71 places, 37/37 transitions.
Applied a total of 0 rules in 3 ms. Remains 61 /61 variables (removed 0) and now considering 37/37 (removed 0) transitions.
[2020-06-02 20:49:33] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 37 rows 61 cols
[2020-06-02 20:49:33] [INFO ] Computed 24 place invariants in 2 ms
[2020-06-02 20:49:33] [INFO ] Dead Transitions using invariants and state equation in 60 ms returned []
Finished structural reductions, in 2 iterations. Remains : 61/71 places, 37/37 transitions.
Finished random walk after 0 steps, including 0 resets, run visited all 0 properties in 2 ms. (steps per millisecond=0 )
Finished probabilistic random walk after 0 steps, run visited all 0 properties in 0 ms. (steps per millisecond=0 )
// Phase 1: matrix 37 rows 61 cols
[2020-06-02 20:49:33] [INFO ] Computed 24 place invariants in 1 ms
Support contains 14 out of 61 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 61/61 places, 37/37 transitions.
Applied a total of 0 rules in 3 ms. Remains 61 /61 variables (removed 0) and now considering 37/37 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 61/61 places, 37/37 transitions.
Starting structural reductions, iteration 0 : 61/61 places, 37/37 transitions.
Applied a total of 0 rules in 2 ms. Remains 61 /61 variables (removed 0) and now considering 37/37 (removed 0) transitions.
// Phase 1: matrix 37 rows 61 cols
[2020-06-02 20:49:33] [INFO ] Computed 24 place invariants in 1 ms
[2020-06-02 20:49:33] [INFO ] Implicit Places using invariants in 106 ms returned []
// Phase 1: matrix 37 rows 61 cols
[2020-06-02 20:49:33] [INFO ] Computed 24 place invariants in 1 ms
[2020-06-02 20:49:33] [INFO ] Implicit Places using invariants and state equation in 136 ms returned [14, 29, 31, 32, 33, 43, 45, 46]
Discarding 8 places :
Implicit Place search using SMT with State Equation took 246 ms to find 8 implicit places.
[2020-06-02 20:49:33] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 37 rows 53 cols
[2020-06-02 20:49:33] [INFO ] Computed 16 place invariants in 1 ms
[2020-06-02 20:49:33] [INFO ] Dead Transitions using invariants and state equation in 57 ms returned []
Starting structural reductions, iteration 1 : 53/61 places, 37/37 transitions.
Applied a total of 0 rules in 3 ms. Remains 53 /53 variables (removed 0) and now considering 37/37 (removed 0) transitions.
[2020-06-02 20:49:33] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 37 rows 53 cols
[2020-06-02 20:49:33] [INFO ] Computed 16 place invariants in 1 ms
[2020-06-02 20:49:33] [INFO ] Dead Transitions using invariants and state equation in 53 ms returned []
Finished structural reductions, in 2 iterations. Remains : 53/61 places, 37/37 transitions.
Finished random walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished probabilistic random walk after 0 steps, run visited all 0 properties in 0 ms. (steps per millisecond=0 )
// Phase 1: matrix 37 rows 53 cols
[2020-06-02 20:49:33] [INFO ] Computed 16 place invariants in 0 ms
Support contains 14 out of 53 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 53/53 places, 37/37 transitions.
Applied a total of 0 rules in 1 ms. Remains 53 /53 variables (removed 0) and now considering 37/37 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 53/53 places, 37/37 transitions.
Starting structural reductions, iteration 0 : 53/53 places, 37/37 transitions.
Applied a total of 0 rules in 2 ms. Remains 53 /53 variables (removed 0) and now considering 37/37 (removed 0) transitions.
// Phase 1: matrix 37 rows 53 cols
[2020-06-02 20:49:33] [INFO ] Computed 16 place invariants in 0 ms
[2020-06-02 20:49:33] [INFO ] Implicit Places using invariants in 75 ms returned []
// Phase 1: matrix 37 rows 53 cols
[2020-06-02 20:49:33] [INFO ] Computed 16 place invariants in 0 ms
[2020-06-02 20:49:33] [INFO ] Implicit Places using invariants and state equation in 102 ms returned []
Implicit Place search using SMT with State Equation took 179 ms to find 0 implicit places.
[2020-06-02 20:49:33] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 37 rows 53 cols
[2020-06-02 20:49:33] [INFO ] Computed 16 place invariants in 1 ms
[2020-06-02 20:49:33] [INFO ] Dead Transitions using invariants and state equation in 47 ms returned []
Finished structural reductions, in 1 iterations. Remains : 53/53 places, 37/37 transitions.
Finished random walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Applied a total of 0 rules in 1 ms. Remains 53 /53 variables (removed 0) and now considering 37/37 (removed 0) transitions.
// Phase 1: matrix 37 rows 53 cols
[2020-06-02 20:49:33] [INFO ] Computed 16 place invariants in 1 ms
[2020-06-02 20:49:33] [INFO ] Export to MCC properties in file /home/mcc/execution/UpperBounds.sr.xml took 2 ms.
[2020-06-02 20:49:33] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 2 ms.
info: Time: 3600 - MCC
vrfy: Checking UpperBounds @ NQueens-PT-12 @ 3570 seconds

FORMULA NQueens-PT-12-UpperBounds-00 1 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA NQueens-PT-12-UpperBounds-02 1 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA NQueens-PT-12-UpperBounds-03 1 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA NQueens-PT-12-UpperBounds-04 1 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA NQueens-PT-12-UpperBounds-05 1 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA NQueens-PT-12-UpperBounds-06 1 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA NQueens-PT-12-UpperBounds-07 1 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA NQueens-PT-12-UpperBounds-08 1 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA NQueens-PT-12-UpperBounds-09 1 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA NQueens-PT-12-UpperBounds-10 1 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA NQueens-PT-12-UpperBounds-11 1 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

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

FORMULA NQueens-PT-12-UpperBounds-13 1 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA NQueens-PT-12-UpperBounds-14 1 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA NQueens-PT-12-UpperBounds-15 1 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 3567
rslt: Output for UpperBounds @ NQueens-PT-12

{
"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": "Tue Jun 2 20:49:34 2020
",
"timelimit": 3570
},
"child":
[

{
"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(p2)",
"processed_size": 7,
"rewrites": 0
},
"result":
{
"edges": 1,
"markings": 2,
"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": 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(p39)",
"processed_size": 8,
"rewrites": 0
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "search",
"value": 1
},
"task":
{
"compoundnumber": 1,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "bound preserving/insertion"
},
"type": "dfs"
},
"type": "bound",
"workflow": "search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 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(p0)",
"processed_size": 7,
"rewrites": 0
},
"result":
{
"edges": 1,
"markings": 2,
"produced_by": "search",
"value": 1
},
"task":
{
"compoundnumber": 2,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "bound preserving/insertion"
},
"type": "dfs"
},
"type": "bound",
"workflow": "search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 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(p3)",
"processed_size": 7,
"rewrites": 0
},
"result":
{
"edges": 1,
"markings": 2,
"produced_by": "search",
"value": 1
},
"task":
{
"compoundnumber": 3,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "bound preserving/insertion"
},
"type": "dfs"
},
"type": "bound",
"workflow": "search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 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(p5)",
"processed_size": 7,
"rewrites": 0
},
"result":
{
"edges": 1,
"markings": 2,
"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": 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(p1)",
"processed_size": 7,
"rewrites": 0
},
"result":
{
"edges": 1,
"markings": 2,
"produced_by": "search",
"value": 1
},
"task":
{
"compoundnumber": 5,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "bound preserving/insertion"
},
"type": "dfs"
},
"type": "bound",
"workflow": "search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 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(p38)",
"processed_size": 8,
"rewrites": 0
},
"result":
{
"edges": 0,
"markings": 0,
"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": 446
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 0,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "MAX(p8)",
"processed_size": 7,
"rewrites": 0
},
"result":
{
"edges": 1,
"markings": 2,
"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": 509
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 0,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "MAX(p6)",
"processed_size": 7,
"rewrites": 0
},
"result":
{
"edges": 1,
"markings": 2,
"produced_by": "search",
"value": 1
},
"task":
{
"compoundnumber": 8,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "bound preserving/insertion"
},
"type": "dfs"
},
"type": "bound",
"workflow": "search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 594
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 0,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "MAX(p26)",
"processed_size": 8,
"rewrites": 0
},
"result":
{
"edges": 0,
"markings": 0,
"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": 713
},
"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": 1,
"markings": 2,
"produced_by": "search",
"value": 1
},
"task":
{
"compoundnumber": 10,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "bound preserving/insertion"
},
"type": "dfs"
},
"type": "bound",
"workflow": "search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 892
},
"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": 1,
"markings": 2,
"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": 1189
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 0,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "MAX(p17)",
"processed_size": 8,
"rewrites": 0
},
"result":
{
"edges": 0,
"markings": 0,
"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": 1784
},
"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(p4)",
"processed_size": 7,
"rewrites": 0
},
"result":
{
"edges": 1,
"markings": 2,
"produced_by": "search",
"value": 1
},
"task":
{
"compoundnumber": 13,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "bound preserving/insertion"
},
"type": "dfs"
},
"type": "bound",
"workflow": "search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3568
},
"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": 1,
"markings": 2,
"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"
}
}
],
"exit":
{
"error": null,
"memory": 18476,
"runtime": 2.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(*)"
},
"net":
{
"arcs": 138,
"conflict_clusters": 11,
"places": 53,
"places_significant": 37,
"singleton_clusters": 0,
"transitions": 37
},
"result":
{
"preliminary_value": "1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 ",
"value": "1 1 1 1 1 1 1 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: 90/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 1696
lola: finding significant places
lola: 53 places, 37 transitions, 37 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(p2) : MAX(p39) : MAX(p0) : MAX(p3) : MAX(p5) : MAX(p1) : MAX(p38) : MAX(p8) : MAX(p6) : MAX(p26) : MAX(p9) : MAX(p6) : MAX(p17) : MAX(p4) : MAX(p7)
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 237 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(p2)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(p2)
lola: processed formula length: 7
lola: 0 rewrites
lola: closed formula file UpperBounds.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using bound preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: RUNNING
lola: Structural Bound: 1
lola: SUBRESULT
lola: result: 1
lola: produced by: state space
lola: The maximum value of the given expression is 1
lola: 2 markings, 1 edges
lola: ========================================
lola: subprocess 1 will run for 254 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(p39)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(p39)
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: 0 markings, 0 edges
lola: ========================================
lola: subprocess 2 will run for 274 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: 1
lola: SUBRESULT
lola: result: 1
lola: produced by: state space
lola: The maximum value of the given expression is 1
lola: 2 markings, 1 edges
lola: ========================================
lola: subprocess 3 will run for 297 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: 2 markings, 1 edges
lola: ========================================
lola: subprocess 4 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(p5)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(p5)
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: 2 markings, 1 edges
lola: ========================================
lola: subprocess 5 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(p1)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(p1)
lola: processed formula length: 7
lola: 0 rewrites
lola: closed formula file UpperBounds.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using bound preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: RUNNING
lola: Structural Bound: 1
lola: SUBRESULT
lola: result: 1
lola: produced by: state space
lola: The maximum value of the given expression is 1
lola: 2 markings, 1 edges
lola: ========================================
lola: subprocess 6 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(p38)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(p38)
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: 0 markings, 0 edges
lola: ========================================
lola: subprocess 7 will run for 446 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(p8)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(p8)
lola: processed formula length: 7
lola: 0 rewrites
lola: closed formula file UpperBounds.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using bound preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: RUNNING
lola: Structural Bound: 1
lola: SUBRESULT
lola: result: 1
lola: produced by: state space
lola: The maximum value of the given expression is 1
lola: 2 markings, 1 edges
lola: ========================================
lola: subprocess 8 will run for 509 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: 2 markings, 1 edges
lola: ========================================
lola: subprocess 9 will run for 594 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(p26)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(p26)
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: 0 markings, 0 edges
lola: ========================================
lola: subprocess 10 will run for 713 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: Structural Bound: 1
lola: SUBRESULT
lola: result: 1
lola: produced by: state space
lola: The maximum value of the given expression is 1
lola: 2 markings, 1 edges
lola: ========================================
lola: subprocess 11 will run for 892 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: 2 markings, 1 edges
lola: ========================================
lola: subprocess 12 will run for 1189 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(p17)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(p17)
lola: processed formula length: 8
lola: 0 rewrites
lola: closed formula file UpperBounds.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using bound preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: RUNNING
lola: Structural Bound: 1
lola: SUBRESULT
lola: result: 1
lola: produced by: state space
lola: The maximum value of the given expression is 1
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 13 will run for 1784 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(p4)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(p4)
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: 2 markings, 1 edges
lola: ========================================
lola: subprocess 14 will run for 3568 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: 2 markings, 1 edges
lola: ========================================
lola: RESULT
lola:
SUMMARY: 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1
lola:
preliminary result: 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1
lola: memory consumption: 18476 KB
lola: time consumption: 2 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="NQueens-PT-12"
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 NQueens-PT-12, 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 r174-csrt-158987852800141"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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