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-158987914100613.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 CSRepetitions-COL-02, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r182-oct2-158987914100613
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 204K
-rw-r--r-- 1 mcc users 4.4K Apr 27 15:14 CTLCardinality.txt
-rw-r--r-- 1 mcc users 21K Apr 27 15:14 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.9K Apr 27 15:14 CTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 27 15:14 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Apr 27 15:14 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 4.6K Apr 27 15:14 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Apr 28 14:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.7K Apr 27 15:14 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 28 14:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Apr 27 15:14 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 18K Apr 27 15:14 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.8K Apr 27 15:14 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 21K Apr 27 15:14 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Apr 27 15:14 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Apr 27 15:14 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Apr 27 15:14 equiv_pt
-rw-r--r-- 1 mcc users 3 Apr 27 15:14 instance
-rw-r--r-- 1 mcc users 5 Apr 27 15:14 iscolored
-rw-r--r-- 1 mcc users 13K Apr 27 15:14 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 CSRepetitions-COL-02-UpperBounds-00
FORMULA_NAME CSRepetitions-COL-02-UpperBounds-01
FORMULA_NAME CSRepetitions-COL-02-UpperBounds-02
FORMULA_NAME CSRepetitions-COL-02-UpperBounds-03
FORMULA_NAME CSRepetitions-COL-02-UpperBounds-04
FORMULA_NAME CSRepetitions-COL-02-UpperBounds-05
FORMULA_NAME CSRepetitions-COL-02-UpperBounds-06
FORMULA_NAME CSRepetitions-COL-02-UpperBounds-07
FORMULA_NAME CSRepetitions-COL-02-UpperBounds-08
FORMULA_NAME CSRepetitions-COL-02-UpperBounds-09
FORMULA_NAME CSRepetitions-COL-02-UpperBounds-10
FORMULA_NAME CSRepetitions-COL-02-UpperBounds-11
FORMULA_NAME CSRepetitions-COL-02-UpperBounds-12
FORMULA_NAME CSRepetitions-COL-02-UpperBounds-13
FORMULA_NAME CSRepetitions-COL-02-UpperBounds-14
FORMULA_NAME CSRepetitions-COL-02-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1591168040427

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-03 07:07:22] [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 07:07:22] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-03 07:07:22] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
SLF4J: Failed to load class "org.slf4j.impl.StaticLoggerBinder".
SLF4J: Defaulting to no-operation (NOP) logger implementation
SLF4J: See http://www.slf4j.org/codes.html#StaticLoggerBinder for further details.
[2020-06-03 07:07:22] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 456 ms
[2020-06-03 07:07:22] [INFO ] sort/places :
Server->serverWaiting,
Computation->serverAnwering,
Dot->requestBufferSlots,
Client->clientSending,requestBuffer,clientWaiting,

[2020-06-03 07:07:22] [INFO ] Imported 6 HL places and 5 HL transitions for a total of 23 PT places and 28.0 transition bindings in 11 ms.
[2020-06-03 07:07:22] [INFO ] Computed order based on color domains.
[2020-06-03 07:07:22] [INFO ] Unfolded HLPN to a Petri net with 23 places and 28 transitions in 4 ms.
[2020-06-03 07:07:22] [INFO ] Unfolded HLPN properties in 0 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 12 ms.
Finished random walk after 0 steps, including 0 resets, run visited all 0 properties in 2 ms. (steps per millisecond=0 )
[2020-06-03 07:07:22] [INFO ] Flatten gal took : 17 ms
Finished random walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished probabilistic random walk after 0 steps, run visited all 0 properties in 0 ms. (steps per millisecond=0 )
// Phase 1: matrix 28 rows 23 cols
[2020-06-03 07:07:23] [INFO ] Computed 6 place invariants in 3 ms
Support contains 23 out of 23 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 23/23 places, 28/28 transitions.
Applied a total of 0 rules in 6 ms. Remains 23 /23 variables (removed 0) and now considering 28/28 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 23/23 places, 28/28 transitions.
Finished random walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
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 28 rows 23 cols
[2020-06-03 07:07:23] [INFO ] Computed 6 place invariants in 0 ms
Support contains 23 out of 23 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 23/23 places, 28/28 transitions.
Applied a total of 0 rules in 1 ms. Remains 23 /23 variables (removed 0) and now considering 28/28 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 23/23 places, 28/28 transitions.
Starting structural reductions, iteration 0 : 23/23 places, 28/28 transitions.
Applied a total of 0 rules in 1 ms. Remains 23 /23 variables (removed 0) and now considering 28/28 (removed 0) transitions.
// Phase 1: matrix 28 rows 23 cols
[2020-06-03 07:07:23] [INFO ] Computed 6 place invariants in 1 ms
[2020-06-03 07:07:23] [INFO ] Implicit Places using invariants in 88 ms returned []
// Phase 1: matrix 28 rows 23 cols
[2020-06-03 07:07:23] [INFO ] Computed 6 place invariants in 1 ms
[2020-06-03 07:07:23] [INFO ] State equation strengthened by 4 read => feed constraints.
[2020-06-03 07:07:23] [INFO ] Implicit Places using invariants and state equation in 34 ms returned []
Implicit Place search using SMT with State Equation took 123 ms to find 0 implicit places.
[2020-06-03 07:07:23] [INFO ] Redundant transitions in 16 ms returned []
// Phase 1: matrix 28 rows 23 cols
[2020-06-03 07:07:23] [INFO ] Computed 6 place invariants in 1 ms
[2020-06-03 07:07:23] [INFO ] Dead Transitions using invariants and state equation in 35 ms returned []
Finished structural reductions, in 1 iterations. Remains : 23/23 places, 28/28 transitions.
Applied a total of 0 rules in 1 ms. Remains 23 /23 variables (removed 0) and now considering 28/28 (removed 0) transitions.
// Phase 1: matrix 28 rows 23 cols
[2020-06-03 07:07:23] [INFO ] Computed 6 place invariants in 1 ms
[2020-06-03 07:07:23] [INFO ] Export to MCC properties in file /home/mcc/execution/UpperBounds.sr.xml took 1 ms.
[2020-06-03 07:07:23] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 1 ms.
info: Time: 3600 - MCC
vrfy: Checking UpperBounds @ CSRepetitions-COL-02 @ 3570 seconds

FORMULA CSRepetitions-COL-02-UpperBounds-12 2 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA CSRepetitions-COL-02-UpperBounds-13 2 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA CSRepetitions-COL-02-UpperBounds-02 2 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA CSRepetitions-COL-02-UpperBounds-09 2 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA CSRepetitions-COL-02-UpperBounds-04 2 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA CSRepetitions-COL-02-UpperBounds-05 4 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA CSRepetitions-COL-02-UpperBounds-06 4 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA CSRepetitions-COL-02-UpperBounds-07 2 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA CSRepetitions-COL-02-UpperBounds-08 4 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA CSRepetitions-COL-02-UpperBounds-01 4 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA CSRepetitions-COL-02-UpperBounds-10 4 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA CSRepetitions-COL-02-UpperBounds-00 2 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA CSRepetitions-COL-02-UpperBounds-03 4 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA CSRepetitions-COL-02-UpperBounds-14 4 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA CSRepetitions-COL-02-UpperBounds-11 2 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA CSRepetitions-COL-02-UpperBounds-15 2 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 3567
rslt: Output for UpperBounds @ CSRepetitions-COL-02

{
"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 07:07:23 2020
",
"timelimit": 3570
},
"child":
[

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

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 254
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 0,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "MAX(p9 + p10)",
"processed_size": 13,
"rewrites": 0
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "search",
"value": 2
},
"task":
{
"compoundnumber": 2,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "bound preserving/insertion"
},
"type": "dfs"
},
"type": "bound",
"workflow": "search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 274
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 0,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "MAX(p9 + p10)",
"processed_size": 13,
"rewrites": 0
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "search",
"value": 2
},
"task":
{
"compoundnumber": 3,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "bound preserving/insertion"
},
"type": "dfs"
},
"type": "bound",
"workflow": "search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 297
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 0,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "MAX(p5 + p6 + p7 + p8)",
"processed_size": 22,
"rewrites": 0
},
"result":
{
"edges": 3,
"markings": 4,
"produced_by": "search",
"value": 2
},
"task":
{
"compoundnumber": 4,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "bound preserving/insertion"
},
"type": "dfs"
},
"type": "bound",
"workflow": "search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 324
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 0,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "MAX(p14 + p13 + p12 + p11)",
"processed_size": 26,
"rewrites": 0
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "search",
"value": 4
},
"task":
{
"compoundnumber": 5,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "bound preserving/insertion"
},
"type": "dfs"
},
"type": "bound",
"workflow": "search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 356
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 0,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "MAX(p1 + p2 + p3 + p4)",
"processed_size": 22,
"rewrites": 0
},
"result":
{
"edges": 4,
"markings": 5,
"produced_by": "search",
"value": 4
},
"task":
{
"compoundnumber": 6,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "bound preserving/insertion"
},
"type": "dfs"
},
"type": "bound",
"workflow": "search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 396
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 0,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "MAX(p5 + p6 + p7 + p8)",
"processed_size": 22,
"rewrites": 0
},
"result":
{
"edges": 3,
"markings": 4,
"produced_by": "search",
"value": 2
},
"task":
{
"compoundnumber": 7,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "bound preserving/insertion"
},
"type": "dfs"
},
"type": "bound",
"workflow": "search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 445
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 0,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "MAX(p1 + p2 + p3 + p4)",
"processed_size": 22,
"rewrites": 0
},
"result":
{
"edges": 4,
"markings": 5,
"produced_by": "search",
"value": 4
},
"task":
{
"compoundnumber": 8,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "bound preserving/insertion"
},
"type": "dfs"
},
"type": "bound",
"workflow": "search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 509
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 0,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "MAX(p14 + p13 + p12 + p11)",
"processed_size": 26,
"rewrites": 0
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "search",
"value": 4
},
"task":
{
"compoundnumber": 9,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "bound preserving/insertion"
},
"type": "dfs"
},
"type": "bound",
"workflow": "search"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 891
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 0,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "MAX(p1 + p2 + p3 + p4)",
"processed_size": 22,
"rewrites": 0
},
"result":
{
"edges": 4,
"markings": 5,
"produced_by": "search",
"value": 4
},
"task":
{
"compoundnumber": 12,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "bound preserving/insertion"
},
"type": "dfs"
},
"type": "bound",
"workflow": "search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 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": 4,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "MAX(p14 + p13 + p12 + p11)",
"processed_size": 26,
"rewrites": 0
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "search",
"value": 4
},
"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": 1783
},
"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": 8,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 8,
"visible_transitions": 0
},
"processed": "MAX(p20 + p19 + p18 + p17 + p15 + p16 + p21 + p22)",
"processed_size": 50,
"rewrites": 0
},
"result":
{
"edges": 6,
"markings": 6,
"produced_by": "search",
"value": 2
},
"task":
{
"compoundnumber": 14,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "bound preserving/insertion"
},
"type": "dfs"
},
"type": "bound",
"workflow": "search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3567
},
"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": 8,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 8,
"visible_transitions": 0
},
"processed": "MAX(p20 + p19 + p18 + p17 + p15 + p16 + p21 + p22)",
"processed_size": 50,
"rewrites": 0
},
"result":
{
"edges": 6,
"markings": 6,
"produced_by": "search",
"value": 2
},
"task":
{
"compoundnumber": 15,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "bound preserving/insertion"
},
"type": "dfs"
},
"type": "bound",
"workflow": "search"
}
}
],
"exit":
{
"error": null,
"memory": 18472,
"runtime": 3.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "UpperBounds.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "MAX(*) : MAX(*) : MAX(*) : MAX(*) : MAX(*) : MAX(*) : MAX(*) : MAX(*) : MAX(*) : MAX(*) : MAX(*) : MAX(*) : MAX(*) : MAX(*) : MAX(*) : MAX(*)"
},
"net":
{
"arcs": 92,
"conflict_clusters": 6,
"places": 23,
"places_significant": 17,
"singleton_clusters": 0,
"transitions": 28
},
"result":
{
"preliminary_value": "2 4 2 4 2 4 4 2 4 2 4 2 2 2 4 2 ",
"value": "2 4 2 4 2 4 4 2 4 2 4 2 2 2 4 2 "
},
"task":
{
"type": "compound"
}
}
lola: LoLA will run for 3570 seconds at most (--timelimit)
lola: NET
lola: input: PNML file (--pnml)
lola: reading net from model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file model.pnml
lola: 51/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 736
lola: finding significant places
lola: 23 places, 28 transitions, 17 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(p5 + p6 + p7 + p8) : MAX(p14 + p13 + p12 + p11) : MAX(p9 + p10) : MAX(p1 + p2 + p3 + p4) : MAX(p5 + p6 + p7 + p8) : MAX(p14 + p13 + p12 + p11) : MAX(p1 + p2 + p3 + p4) : MAX(p5 + p6 + p7 + p8) : MAX(p1 + p2 + p3 + p4) : MAX(p9 + p10) : MAX(p1 + p2 + p3 + p4) : MAX(p20 + p19 + p18 + p17 + p15 + p16 + p21 + p22) : MAX(p0) : MAX(p0) : MAX(p14 + p13 + p12 + p11) : MAX(p20 + p19 + p18 + p17 + p15 + p16 + p21 + p22)
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 222 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(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: 2
lola: SUBRESULT
lola: result: 2
lola: produced by: state space
lola: The maximum value of the given expression is 2
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 1 will run for 237 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: 2
lola: SUBRESULT
lola: result: 2
lola: produced by: state space
lola: The maximum value of the given expression is 2
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 2 will run for 254 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(p9 + p10)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(p9 + p10)
lola: processed formula length: 13
lola: 0 rewrites
lola: closed formula file UpperBounds.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using bound preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: RUNNING
lola: Structural Bound: 2
lola: SUBRESULT
lola: result: 2
lola: produced by: state space
lola: The maximum value of the given expression is 2
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 3 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(p9 + p10)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(p9 + p10)
lola: processed formula length: 13
lola: 0 rewrites
lola: closed formula file UpperBounds.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using bound preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: RUNNING
lola: Structural Bound: 2
lola: SUBRESULT
lola: result: 2
lola: produced by: state space
lola: The maximum value of the given expression is 2
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 4 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(p5 + p6 + p7 + p8)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(p5 + p6 + p7 + p8)
lola: processed formula length: 22
lola: 0 rewrites
lola: closed formula file UpperBounds.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using bound preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: RUNNING
lola: Structural Bound: 2
lola: SUBRESULT
lola: result: 2
lola: produced by: state space
lola: The maximum value of the given expression is 2
lola: 4 markings, 3 edges
lola: ========================================
lola: subprocess 5 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(p14 + p13 + p12 + p11)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(p14 + p13 + p12 + p11)
lola: processed formula length: 26
lola: 0 rewrites
lola: closed formula file UpperBounds.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using bound preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: RUNNING
lola: Structural Bound: 4
lola: SUBRESULT
lola: result: 4
lola: produced by: state space
lola: The maximum value of the given expression is 4
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 6 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(p1 + p2 + p3 + p4)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(p1 + p2 + p3 + p4)
lola: processed formula length: 22
lola: 0 rewrites
lola: closed formula file UpperBounds.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using bound preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: RUNNING
lola: Structural Bound: 4
lola: SUBRESULT
lola: result: 4
lola: produced by: state space
lola: The maximum value of the given expression is 4
lola: 5 markings, 4 edges
lola: ========================================
lola: subprocess 7 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(p5 + p6 + p7 + p8)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(p5 + p6 + p7 + p8)
lola: processed formula length: 22
lola: 0 rewrites
lola: closed formula file UpperBounds.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using bound preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: RUNNING
lola: Structural Bound: 2
lola: SUBRESULT
lola: result: 2
lola: produced by: state space
lola: The maximum value of the given expression is 2
lola: 4 markings, 3 edges
lola: ========================================
lola: subprocess 8 will run for 445 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(p1 + p2 + p3 + p4)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(p1 + p2 + p3 + p4)
lola: processed formula length: 22
lola: 0 rewrites
lola: closed formula file UpperBounds.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using bound preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: RUNNING
lola: Structural Bound: 4
lola: SUBRESULT
lola: result: 4
lola: produced by: state space
lola: The maximum value of the given expression is 4
lola: 5 markings, 4 edges
lola: ========================================
lola: subprocess 9 will run for 509 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(p14 + p13 + p12 + p11)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(p14 + p13 + p12 + p11)
lola: processed formula length: 26
lola: 0 rewrites
lola: closed formula file UpperBounds.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using bound preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: RUNNING
lola: Structural Bound: 4
lola: SUBRESULT
lola: result: 4
lola: produced by: state space
lola: The maximum value of the given expression is 4
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 10 will run for 594 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(p1 + p2 + p3 + p4)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(p1 + p2 + p3 + p4)
lola: processed formula length: 22
lola: 0 rewrites
lola: closed formula file UpperBounds.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using bound preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: RUNNING
lola: Structural Bound: 4
lola: SUBRESULT
lola: result: 4
lola: produced by: state space
lola: The maximum value of the given expression is 4
lola: 5 markings, 4 edges
lola: ========================================
lola: subprocess 11 will run for 713 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(p5 + p6 + p7 + p8)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(p5 + p6 + p7 + p8)
lola: processed formula length: 22
lola: 0 rewrites
lola: closed formula file UpperBounds.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using bound preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: RUNNING
lola: Structural Bound: 2
lola: SUBRESULT
lola: result: 2
lola: produced by: state space
lola: The maximum value of the given expression is 2
lola: 4 markings, 3 edges
lola: ========================================
lola: subprocess 12 will run for 891 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(p1 + p2 + p3 + p4)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(p1 + p2 + p3 + p4)
lola: processed formula length: 22
lola: 0 rewrites
lola: closed formula file UpperBounds.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using bound preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: RUNNING
lola: Structural Bound: 4
lola: SUBRESULT
lola: result: 4
lola: produced by: state space
lola: The maximum value of the given expression is 4
lola: 5 markings, 4 edges
lola: ========================================
lola: subprocess 13 will run for 1189 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(p14 + p13 + p12 + p11)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(p14 + p13 + p12 + p11)
lola: processed formula length: 26
lola: 0 rewrites
lola: closed formula file UpperBounds.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using bound preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: RUNNING
lola: Structural Bound: 4
lola: SUBRESULT
lola: result: 4
lola: produced by: state space
lola: The maximum value of the given expression is 4
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 14 will run for 1783 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(p20 + p19 + p18 + p17 + p15 + p16 + p21 + p22)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(p20 + p19 + p18 + p17 + p15 + p16 + p21 + p22)
lola: processed formula length: 50
lola: 0 rewrites
lola: closed formula file UpperBounds.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using bound preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: RUNNING
lola: Structural Bound: 2
lola: SUBRESULT
lola: result: 2
lola: produced by: state space
lola: The maximum value of the given expression is 2
lola: 6 markings, 6 edges
lola: ========================================
lola: subprocess 15 will run for 3567 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(p20 + p19 + p18 + p17 + p15 + p16 + p21 + p22)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(p20 + p19 + p18 + p17 + p15 + p16 + p21 + p22)
lola: processed formula length: 50
lola: 0 rewrites
lola: closed formula file UpperBounds.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using bound preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: RUNNING
lola: Structural Bound: 2
lola: SUBRESULT
lola: result: 2
lola: produced by: state space
lola: The maximum value of the given expression is 2
lola: 6 markings, 6 edges
lola: ========================================
lola: RESULT
lola:
SUMMARY: 2 4 2 4 2 4 4 2 4 2 4 2 2 2 4 2
lola:
preliminary result: 2 4 2 4 2 4 4 2 4 2 4 2 2 2 4 2
lola: memory consumption: 18472 KB
lola: time consumption: 3 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="CSRepetitions-COL-02"
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 CSRepetitions-COL-02, 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-158987914100613"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/CSRepetitions-COL-02.tgz
mv CSRepetitions-COL-02 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 ;