fond
Model Checking Contest 2019
9th edition, Prague, Czech Republic, April 7, 2019 (TOOLympics)
Execution of r209-smll-155381375500116
Last Updated
Apr 15, 2019

About the Execution of LoLA for CloudOpsManagement-PT-10240by05120

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
15919.290 720801.00 719354.00 4677.10 TF?FTTTFFFFFFTFT normal

Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2019-input.r209-smll-155381375500116.qcow2', fmt=qcow2 size=4294967296 backing_file='/data/fkordon/mcc2019-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
..................
=====================================================================
Generated by BenchKit 2-3957
Executing tool lola
Input is CloudOpsManagement-PT-10240by05120, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r209-smll-155381375500116
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 188K
-rw-r--r-- 1 mcc users 4.0K Mar 26 06:41 CTLCardinality.txt
-rw-r--r-- 1 mcc users 19K Mar 26 06:41 CTLCardinality.xml
-rw-r--r-- 1 mcc users 3.4K Mar 26 06:35 CTLFireability.txt
-rw-r--r-- 1 mcc users 20K Mar 26 06:35 CTLFireability.xml
-rw-r--r-- 1 mcc users 2.6K Mar 26 06:26 LTLCardinality.txt
-rw-r--r-- 1 mcc users 9.3K Mar 26 06:26 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Mar 26 06:26 LTLFireability.txt
-rw-r--r-- 1 mcc users 9.8K Mar 26 06:26 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Mar 25 21:32 NewModel
-rw-r--r-- 1 mcc users 4.5K Mar 26 06:26 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 21K Mar 26 06:26 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 125 Mar 26 06:21 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 363 Mar 26 06:21 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 3.4K Mar 26 06:24 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 26 06:24 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.0K Mar 26 06:26 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.0K Mar 26 06:26 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 25 21:32 equiv_col

-rw-r--r-- 1 mcc users 13 Mar 25 21:32 instance
-rw-r--r-- 1 mcc users 6 Mar 25 21:32 iscolored
-rw-r--r-- 1 mcc users 17K Mar 25 21:32 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME CloudOpsManagement-PT-10240by05120-ReachabilityCardinality-00
FORMULA_NAME CloudOpsManagement-PT-10240by05120-ReachabilityCardinality-01
FORMULA_NAME CloudOpsManagement-PT-10240by05120-ReachabilityCardinality-02
FORMULA_NAME CloudOpsManagement-PT-10240by05120-ReachabilityCardinality-03
FORMULA_NAME CloudOpsManagement-PT-10240by05120-ReachabilityCardinality-04
FORMULA_NAME CloudOpsManagement-PT-10240by05120-ReachabilityCardinality-05
FORMULA_NAME CloudOpsManagement-PT-10240by05120-ReachabilityCardinality-06
FORMULA_NAME CloudOpsManagement-PT-10240by05120-ReachabilityCardinality-07
FORMULA_NAME CloudOpsManagement-PT-10240by05120-ReachabilityCardinality-08
FORMULA_NAME CloudOpsManagement-PT-10240by05120-ReachabilityCardinality-09
FORMULA_NAME CloudOpsManagement-PT-10240by05120-ReachabilityCardinality-10
FORMULA_NAME CloudOpsManagement-PT-10240by05120-ReachabilityCardinality-11
FORMULA_NAME CloudOpsManagement-PT-10240by05120-ReachabilityCardinality-12
FORMULA_NAME CloudOpsManagement-PT-10240by05120-ReachabilityCardinality-13
FORMULA_NAME CloudOpsManagement-PT-10240by05120-ReachabilityCardinality-14
FORMULA_NAME CloudOpsManagement-PT-10240by05120-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1554054502040

info: Time: 3600 - MCC
vrfy: Checking ReachabilityCardinality @ CloudOpsManagement-PT-10240by05120 @ 3570 seconds

FORMULA CloudOpsManagement-PT-10240by05120-ReachabilityCardinality-04 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA CloudOpsManagement-PT-10240by05120-ReachabilityCardinality-08 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA CloudOpsManagement-PT-10240by05120-ReachabilityCardinality-09 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA CloudOpsManagement-PT-10240by05120-ReachabilityCardinality-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA CloudOpsManagement-PT-10240by05120-ReachabilityCardinality-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA CloudOpsManagement-PT-10240by05120-ReachabilityCardinality-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA CloudOpsManagement-PT-10240by05120-ReachabilityCardinality-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA CloudOpsManagement-PT-10240by05120-ReachabilityCardinality-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA CloudOpsManagement-PT-10240by05120-ReachabilityCardinality-05 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA CloudOpsManagement-PT-10240by05120-ReachabilityCardinality-03 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA CloudOpsManagement-PT-10240by05120-ReachabilityCardinality-01 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA CloudOpsManagement-PT-10240by05120-ReachabilityCardinality-07 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA CloudOpsManagement-PT-10240by05120-ReachabilityCardinality-00 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA CloudOpsManagement-PT-10240by05120-ReachabilityCardinality-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA CloudOpsManagement-PT-10240by05120-ReachabilityCardinality-06 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA CloudOpsManagement-PT-10240by05120-ReachabilityCardinality-02 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 2850
rslt: Output for ReachabilityCardinality @ CloudOpsManagement-PT-10240by05120

{
"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": "mcc2019",
"markinglimit": null,
"parameters":
[
"--pnmlnet",
"model.pnml",
"--xmlformula",
"--formula=ReachabilityCardinality.xml",
"--mcc",
"--donotcomputecapacities",
"--encoder=simplecompressed",
"--check=modelchecking",
"--stubborn=tarjan",
"--stateequation=par",
"--timelimit=3570",
"--localtimelimit=0",
"--json=ReachabilityCardinality.json",
"--jsoninclude=formula,formulastat,net"
],
"starttime": "Sun Mar 31 17:48:22 2019
",
"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": 0,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 0,
"visible_transitions": 0
},
"processed": "TRUE",
"processed_size": 4,
"rewrites": 21
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 0,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"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": 0,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 0,
"visible_transitions": 0
},
"processed": "FALSE",
"processed_size": 5,
"rewrites": 21
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 1,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"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": 0,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 0,
"visible_transitions": 0
},
"processed": "FALSE",
"processed_size": 5,
"rewrites": 21
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 2,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"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": 0,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 0,
"visible_transitions": 0
},
"processed": "FALSE",
"processed_size": 5,
"rewrites": 21
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 3,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"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": 0,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 0,
"visible_transitions": 0
},
"processed": "FALSE",
"processed_size": 5,
"rewrites": 21
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 4,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"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": 0,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 0,
"visible_transitions": 0
},
"processed": "TRUE",
"processed_size": 4,
"rewrites": 21
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 5,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"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": 0,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 0,
"visible_transitions": 0
},
"processed": "TRUE",
"processed_size": 4,
"rewrites": 21
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 6,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 396
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"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": "A (G ((3 <= Bounder1)))",
"processed_size": 23,
"rewrites": 23
},
"result":
{
"edges": 10238,
"markings": 10239,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 7,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "invariance",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 445
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"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": "E (F ((OsNotInstalled <= 0)))",
"processed_size": 29,
"rewrites": 22
},
"result":
{
"edges": 5120,
"markings": 5121,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 8,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "reachability",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 509
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"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": "A (G ((OsContainer + 1 <= OsNotInstalled)))",
"processed_size": 43,
"rewrites": 23
},
"result":
{
"edges": 2560,
"markings": 2561,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 9,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "invariance",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 654
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 1,
"aneg": 0,
"comp": 4,
"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": "A (G (((Wsr3Deployed <= 1) OR ((1 <= ScStopped) AND (3 <= ServerContainer)) OR (3 <= Bounder1))))",
"processed_size": 99,
"rewrites": 23
},
"result":
{
"edges": 25634,
"markings": 20502,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 11,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 6,
"problems": 2
},
"type": "invariance",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 818
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 1,
"aneg": 0,
"comp": 2,
"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": "A (G (((Wsr1Deployed <= OsRunning) OR (Wsr2Deployed <= Bounder1))))",
"processed_size": 68,
"rewrites": 23
},
"result":
{
"edges": 105118803,
"markings": 52602933,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 12,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 2,
"problems": 2
},
"type": "invariance",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1047
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 2,
"adisj": 2,
"aneg": 0,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 5,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "E (F (((((ScStopped <= ScUnavailable) AND (2 <= OsRunning)) OR (ScUnavailable <= 2)) AND ((ContainerDown <= 0)))))",
"processed_size": 115,
"rewrites": 22
},
"result":
{
"edges": 15352,
"markings": 15353,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 13,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 5,
"problems": 2
},
"type": "reachability",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1570
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 1,
"aneg": 0,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 7,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 6,
"visible_transitions": 0
},
"processed": "A (G (((Wsr1NotDeployed + 1 <= Bounder1) OR (Wsr3Deployed + 1 <= Wsr2Deployed) OR ((2 <= Bounder1) AND (OsAvailable <= ScUnavailable)))))",
"processed_size": 139,
"rewrites": 23
},
"result":
{
"edges": 10239,
"markings": 10240,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 14,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 6,
"problems": 2
},
"type": "invariance",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3141
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 2,
"adisj": 1,
"aneg": 0,
"comp": 5,
"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": "E (F (((Bounder1 <= SwContainer) AND (Wsr1Started + 1 <= ScUnavailable) AND (((1 <= Container) AND (1 <= Wsr3Deployed)) OR (WSRuntime1 <= Wsr2Deployed)))))",
"processed_size": 156,
"rewrites": 22
},
"result":
{
"edges": 15361,
"markings": 15362,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 15,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 7,
"problems": 2
},
"type": "reachability",
"workflow": "stateequation||search"
}
}
],
"exit":
{
"error": null,
"memory": 22384,
"runtime": 720.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "ReachabilityCardinality.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "E(F(**)) : A(G(**)) : E(F(**)) : A(G(**)) : TRUE : E(F(**)) : E(F(**)) : A(G(**)) : FALSE : FALSE : FALSE : FALSE : A(G(**)) : TRUE : A(G(**)) : TRUE"
},
"net":
{
"arcs": 94,
"conflict_clusters": 11,
"places": 27,
"places_significant": 16,
"singleton_clusters": 0,
"transitions": 29
},
"result":
{
"preliminary_value": "yes no unknown no yes yes yes no no no no no no yes no yes ",
"value": "yes no unknown no yes yes yes no no no no no no yes no yes "
},
"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: 56/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 864
lola: finding significant places
lola: 27 places, 29 transitions, 16 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 ReachabilityCardinality.xml
lola: LP says that atomic proposition is always true: (2 <= Wsr2NotDeployed)
lola: LP says that atomic proposition is always true: (1 <= Wsr1NotDeployed)
lola: LP says that atomic proposition is always true: (OsNotInstalled <= Wsr3NotDeployed)
lola: LP says that atomic proposition is always true: (3 <= Wsr1NotDeployed)
lola: LP says that atomic proposition is always true: (2 <= Wsr2NotDeployed)
lola: LP says that atomic proposition is always true: (Wsr1Started <= ScWorking)
lola: LP says that atomic proposition is always false: (Wsr1NotDeployed <= WSRuntime1)
lola: LP says that atomic proposition is always true: (1 <= Wsr3NotDeployed)
lola: LP says that atomic proposition is always true: (1 <= Wsr3NotDeployed)
lola: LP says that atomic proposition is always true: (2 <= Wsr1NotDeployed)
lola: LP says that atomic proposition is always true: (3 <= Wsr2NotDeployed)
lola: E (F (((((ScStopped <= ScUnavailable) AND (2 <= OsRunning)) OR (ScUnavailable <= 2)) AND ((ContainerDown <= 0))))) : A (G (((Wsr3Deployed <= 1) OR ((1 <= ScStopped) AND (3 <= ServerContainer)) OR (3 <= Bounder1)))) : E (F (((Wsr1NotDeployed <= ContainerDown) OR (3 <= Wsr1Deployed)))) : A (G ((OsContainer + 1 <= OsNotInstalled))) : A (G ((OsNotInstalled <= Wsr3NotDeployed))) : E (F ((OsNotInstalled <= 0))) : E (F (((Bounder1 <= SwContainer) AND (Wsr1Started + 1 <= ScUnavailable) AND (((1 <= Container) AND (1 <= Wsr3Deployed)) OR (WSRuntime1 <= Wsr2Deployed))))) : A (G (((Wsr1Deployed <= OsRunning) OR (Wsr2Deployed <= Bounder1)))) : E (F (())) : E (F (())) : E (F (())) : E (F ((Wsr3NotDeployed <= 0))) : A (G (((Wsr1NotDeployed + 1 <= Bounder1) OR (Wsr3Deployed + 1 <= Wsr2Deployed) OR ((2 <= Bounder1) AND (OsAvailable <= ScUnavailable))))) : A (G (())) : A (G ((3 <= Bounder1))) : A (G (()))
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:160
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:157
lola: rewrite Frontend/Parser/formula_rewrite.k:148
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:157
lola: rewrite Frontend/Parser/formula_rewrite.k:148
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:157
lola: rewrite Frontend/Parser/formula_rewrite.k:148
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:157
lola: rewrite Frontend/Parser/formula_rewrite.k:148
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:160
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:160
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 222 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: TRUE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: TRUE
lola: processed formula length: 4
lola: 21 rewrites
lola: closed formula file ReachabilityCardinality.xml
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 1 will run for 237 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: FALSE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FALSE
lola: processed formula length: 5
lola: 21 rewrites
lola: closed formula file ReachabilityCardinality.xml
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 2 will run for 254 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: FALSE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FALSE
lola: processed formula length: 5
lola: 21 rewrites
lola: closed formula file ReachabilityCardinality.xml
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 3 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: FALSE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FALSE
lola: processed formula length: 5
lola: 21 rewrites
lola: closed formula file ReachabilityCardinality.xml
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 4 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: FALSE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FALSE
lola: processed formula length: 5
lola: 21 rewrites
lola: closed formula file ReachabilityCardinality.xml
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 5 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: TRUE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: TRUE
lola: processed formula length: 4
lola: 21 rewrites
lola: closed formula file ReachabilityCardinality.xml
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 6 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: TRUE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: TRUE
lola: processed formula length: 4
lola: 21 rewrites
lola: closed formula file ReachabilityCardinality.xml
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 7 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((3 <= Bounder1)))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: A (G ((3 <= Bounder1)))
lola: processed formula length: 23
lola: 23 rewrites
lola: closed formula file ReachabilityCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (Bounder1 <= 2)
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to ReachabilityCardinality-7-0.sara
lola: state equation: calling and running sara
sara: try reading problem file ReachabilityCardinality-7-0.sara.
sara: place or transition ordering is non-deterministic
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 10239 markings, 10238 edges
lola: ========================================
lola: subprocess 8 will run for 445 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((OsNotInstalled <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: processed formula: E (F ((OsNotInstalled <= 0)))
lola: processed formula length: 29
lola: 22 rewrites
lola: closed formula file ReachabilityCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (OsNotInstalled <= 0)
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to ReachabilityCardinality-8-0.sara
lola: state equation: calling and running sara
sara: try reading problem file ReachabilityCardinality-8-0.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 5121 markings, 5120 edges
lola: ========================================
lola: subprocess 9 will run for 509 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((OsContainer + 1 <= OsNotInstalled)))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: A (G ((OsContainer + 1 <= OsNotInstalled)))
lola: processed formula length: 43
lola: 23 rewrites
lola: closed formula file ReachabilityCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (OsNotInstalled <= OsContainer)
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to ReachabilityCardinality-9-0.sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 2561 markings, 2560 edges
lola: ========================================
lola: subprocess 10 will run for 594 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((Wsr1NotDeployed <= ContainerDown) OR (3 <= Wsr1Deployed))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: processed formula: E (F (((Wsr1NotDeployed <= ContainerDown) OR (3 <= Wsr1Deployed))))
lola: processed formula length: 68
lola: 22 rewrites
lola: closed formula file ReachabilityCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((Wsr1NotDeployed <= ContainerDown) OR (3 <= Wsr1Deployed))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 2 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to ReachabilityCardinality-10-0.sara
lola: state equation: calling and running sara
sara: try reading problem file ReachabilityCardinality-10-0.sara.
sara: place or transition ordering is non-deterministic
lola: sara is running 0 secs || 2905701 markings, 4599704 edges, 581140 markings/sec, 0 secs
lola: sara is running 5 secs || 5699358 markings, 9021094 edges, 558731 markings/sec, 5 secs
lola: sara is running 10 secs || 8444892 markings, 13370287 edges, 549107 markings/sec, 10 secs
lola: sara is running 15 secs || 11197928 markings, 17730731 edges, 550607 markings/sec, 15 secs
lola: sara is running 20 secs || 13880609 markings, 21975393 edges, 536536 markings/sec, 20 secs
lola: sara is running 25 secs || 16572255 markings, 26238623 edges, 538329 markings/sec, 25 secs
lola: sara is running 30 secs || 19283112 markings, 30530675 edges, 542171 markings/sec, 30 secs
lola: sara is running 35 secs || 21954582 markings, 34763637 edges, 534294 markings/sec, 35 secs
lola: sara is running 40 secs || 24585932 markings, 38930260 edges, 526270 markings/sec, 40 secs
lola: sara is running 45 secs || 27211638 markings, 43085363 edges, 525141 markings/sec, 45 secs
lola: sara is running 50 secs || 29803816 markings, 47189689 edges, 518436 markings/sec, 50 secs
lola: sara is running 55 secs || 32414858 markings, 51326320 edges, 522208 markings/sec, 55 secs
lola: sara is running 60 secs || 35109065 markings, 55593395 edges, 538841 markings/sec, 60 secs
lola: sara is running 65 secs || 37755005 markings, 59782938 edges, 529188 markings/sec, 65 secs
lola: sara is running 70 secs || 40366222 markings, 63915273 edges, 522243 markings/sec, 70 secs
lola: sara is running 75 secs || 42959142 markings, 68021086 edges, 518584 markings/sec, 75 secs
lola: sara is running 80 secs || 45522955 markings, 72081373 edges, 512763 markings/sec, 80 secs
lola: sara is running 85 secs || 48094064 markings, 76153538 edges, 514222 markings/sec, 85 secs
lola: sara is running 90 secs || 50692951 markings, 80267375 edges, 519777 markings/sec, 90 secs
lola: sara is running 95 secs || 53276591 markings, 84358336 edges, 516728 markings/sec, 95 secs
lola: sara is running 100 secs || 55876467 markings, 88478777 edges, 519975 markings/sec, 100 secs
lola: sara is running 105 secs || 58563065 markings, 92729314 edges, 537320 markings/sec, 105 secs
lola: sara is running 110 secs || 61238454 markings, 96968154 edges, 535078 markings/sec, 110 secs
lola: sara is running 115 secs || 63941579 markings, 101248605 edges, 540625 markings/sec, 115 secs
lola: sara is running 120 secs || 66706012 markings, 105626148 edges, 552887 markings/sec, 120 secs
lola: sara is running 125 secs || 69432264 markings, 109941295 edges, 545250 markings/sec, 125 secs
lola: sara is running 130 secs || 72146194 markings, 114237959 edges, 542786 markings/sec, 130 secs
lola: sara is running 135 secs || 74783259 markings, 118414186 edges, 527413 markings/sec, 135 secs
lola: sara is running 140 secs || 77361221 markings, 122496630 edges, 515592 markings/sec, 140 secs
lola: sara is running 145 secs || 79954324 markings, 126601790 edges, 518621 markings/sec, 145 secs
lola: sara is running 150 secs || 82552709 markings, 130719243 edges, 519677 markings/sec, 150 secs
lola: sara is running 155 secs || 85131962 markings, 134802381 edges, 515851 markings/sec, 155 secs
lola: sara is running 160 secs || 87676444 markings, 138831469 edges, 508896 markings/sec, 160 secs
lola: sara is running 165 secs || 90208283 markings, 142839602 edges, 506368 markings/sec, 165 secs
lola: sara is running 170 secs || 92715489 markings, 146810778 edges, 501441 markings/sec, 170 secs
lola: sara is running 175 secs || 95280745 markings, 150874165 edges, 513051 markings/sec, 175 secs
lola: sara is running 180 secs || 98012740 markings, 155197925 edges, 546399 markings/sec, 180 secs
lola: sara is running 185 secs || 100691110 markings, 159441240 edges, 535674 markings/sec, 185 secs
lola: sara is running 190 secs || 103328598 markings, 163616870 edges, 527498 markings/sec, 190 secs
lola: sara is running 195 secs || 106298896 markings, 168319851 edges, 594060 markings/sec, 195 secs
lola: sara is running 200 secs || 109704403 markings, 173710211 edges, 681101 markings/sec, 200 secs
lola: sara is running 205 secs || 113085071 markings, 179063193 edges, 676134 markings/sec, 205 secs
lola: sara is running 210 secs || 116405162 markings, 184322381 edges, 664018 markings/sec, 210 secs
lola: sara is running 215 secs || 119654801 markings, 189467216 edges, 649928 markings/sec, 215 secs
lola: sara is running 220 secs || 122929803 markings, 194655224 edges, 655000 markings/sec, 220 secs
lola: sara is running 225 secs || 126135903 markings, 199730688 edges, 641220 markings/sec, 225 secs
lola: sara is running 230 secs || 129367838 markings, 204849981 edges, 646387 markings/sec, 230 secs
lola: sara is running 235 secs || 132575226 markings, 209927319 edges, 641478 markings/sec, 235 secs
lola: sara is running 240 secs || 135760194 markings, 214970914 edges, 636994 markings/sec, 240 secs
lola: sara is running 245 secs || 138943898 markings, 220012572 edges, 636741 markings/sec, 245 secs
lola: sara is running 250 secs || 142085197 markings, 224985548 edges, 628260 markings/sec, 250 secs
lola: sara is running 255 secs || 145216568 markings, 229944749 edges, 626274 markings/sec, 255 secs
lola: sara is running 260 secs || 148369488 markings, 234938877 edges, 630584 markings/sec, 260 secs
lola: sara is running 265 secs || 151455856 markings, 239824262 edges, 617274 markings/sec, 265 secs
lola: sara is running 270 secs || 154569351 markings, 244755281 edges, 622699 markings/sec, 270 secs
lola: sara is running 275 secs || 156166287 markings, 247283695 edges, 319387 markings/sec, 275 secs
lola: sara is running 280 secs || 156295613 markings, 247487921 edges, 25865 markings/sec, 280 secs
lola: sara is running 285 secs || 156320768 markings, 247530759 edges, 5031 markings/sec, 285 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 11 will run for 654 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((Wsr3Deployed <= 1) OR ((1 <= ScStopped) AND (3 <= ServerContainer)) OR (3 <= Bounder1))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: A (G (((Wsr3Deployed <= 1) OR ((1 <= ScStopped) AND (3 <= ServerContainer)) OR (3 <= Bounder1))))
lola: processed formula length: 99
lola: 23 rewrites
lola: closed formula file ReachabilityCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((2 <= Wsr3Deployed) AND ((ScStopped <= 0) OR (ServerContainer <= 2)) AND (Bounder1 <= 2))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 6 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to ReachabilityCardinality-11-0.sara
lola: state equation: calling and running sara
sara: try reading problem file ReachabilityCardinality-11-0.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 20502 markings, 25634 edges
lola: ========================================
lola: subprocess 12 will run for 818 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((Wsr1Deployed <= OsRunning) OR (Wsr2Deployed <= Bounder1))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: A (G (((Wsr1Deployed <= OsRunning) OR (Wsr2Deployed <= Bounder1))))
lola: processed formula length: 68
lola: 23 rewrites
lola: closed formula file ReachabilityCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((OsRunning + 1 <= Wsr1Deployed) AND (Bounder1 + 1 <= Wsr2Deployed))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to ReachabilityCardinality-12-0.sara
lola: state equation: calling and running sara
sara: try reading problem file ReachabilityCardinality-12-0.sara.
sara: place or transition ordering is non-deterministic
lola: sara is running 0 secs || 2171359 markings, 4264730 edges, 434272 markings/sec, 0 secs
lola: sara is running 5 secs || 4318249 markings, 8556846 edges, 429378 markings/sec, 5 secs
lola: sara is running 10 secs || 6327904 markings, 12575555 edges, 401931 markings/sec, 10 secs
lola: sara is running 15 secs || 8362229 markings, 16643975 edges, 406865 markings/sec, 15 secs
lola: sara is running 20 secs || 10420980 markings, 20761701 edges, 411750 markings/sec, 20 secs
lola: sara is running 25 secs || 12445138 markings, 24808803 edges, 404832 markings/sec, 25 secs
lola: sara is running 30 secs || 14459240 markings, 28838833 edges, 402820 markings/sec, 30 secs
lola: sara is running 35 secs || 16468339 markings, 32854757 edges, 401820 markings/sec, 35 secs
lola: sara is running 40 secs || 18459911 markings, 36839461 edges, 398314 markings/sec, 40 secs
lola: sara is running 45 secs || 20490000 markings, 40898349 edges, 406018 markings/sec, 45 secs
lola: sara is running 50 secs || 22501274 markings, 44920881 edges, 402255 markings/sec, 50 secs
lola: sara is running 55 secs || 24391024 markings, 48699595 edges, 377950 markings/sec, 55 secs
lola: sara is running 60 secs || 26350991 markings, 52619437 edges, 391993 markings/sec, 60 secs
lola: sara is running 65 secs || 28348537 markings, 56615328 edges, 399509 markings/sec, 65 secs
lola: sara is running 70 secs || 30298458 markings, 60514814 edges, 389984 markings/sec, 70 secs
lola: sara is running 75 secs || 32208869 markings, 64336516 edges, 382082 markings/sec, 75 secs
lola: sara is running 80 secs || 34117159 markings, 68150144 edges, 381658 markings/sec, 80 secs
lola: sara is running 85 secs || 36089967 markings, 72095600 edges, 394562 markings/sec, 85 secs
lola: sara is running 90 secs || 38019596 markings, 75955445 edges, 385926 markings/sec, 90 secs
lola: sara is running 95 secs || 39959145 markings, 79834778 edges, 387910 markings/sec, 95 secs
lola: sara is running 100 secs || 41871909 markings, 83659508 edges, 382553 markings/sec, 100 secs
lola: sara is running 105 secs || 43890839 markings, 87699128 edges, 403786 markings/sec, 105 secs
lola: sara is running 110 secs || 45905915 markings, 91726402 edges, 403015 markings/sec, 110 secs
lola: sara is running 115 secs || 47798537 markings, 95512212 edges, 378524 markings/sec, 115 secs
lola: sara is running 120 secs || 49859229 markings, 99634236 edges, 412138 markings/sec, 120 secs
lola: sara is running 125 secs || 51933005 markings, 103780951 edges, 414755 markings/sec, 125 secs
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 52602933 markings, 105118803 edges
lola: ========================================
lola: subprocess 13 will run for 1047 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((((ScStopped <= ScUnavailable) AND (2 <= OsRunning)) OR (ScUnavailable <= 2)) AND ((ContainerDown <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: processed formula: E (F (((((ScStopped <= ScUnavailable) AND (2 <= OsRunning)) OR (ScUnavailable <= 2)) AND ((ContainerDown <= 0)))))
lola: processed formula length: 115
lola: 22 rewrites
lola: closed formula file ReachabilityCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((((ScStopped <= ScUnavailable) AND (2 <= OsRunning)) OR (ScUnavailable <= 2)) AND ((ContainerDown <= 0)))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 5 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to ReachabilityCardinality-13-0.sara
lola: state equation: calling and running sara
sara: try reading problem file ReachabilityCardinality-13-0.sara.
sara: place or transition ordering is non-deterministic
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 15353 markings, 15352 edges
lola: ========================================
lola: subprocess 14 will run for 1570 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((Wsr1NotDeployed + 1 <= Bounder1) OR (Wsr3Deployed + 1 <= Wsr2Deployed) OR ((2 <= Bounder1) AND (OsAvailable <= ScUnavailable)))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: A (G (((Wsr1NotDeployed + 1 <= Bounder1) OR (Wsr3Deployed + 1 <= Wsr2Deployed) OR ((2 <= Bounder1) AND (OsAvailable <= ScUnavailable)))))
lola: processed formula length: 139
lola: 23 rewrites
lola: closed formula file ReachabilityCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((Bounder1 <= Wsr1NotDeployed) AND (Wsr2Deployed <= Wsr3Deployed) AND ((Bounder1 <= 1) OR (ScUnavailable + 1 <= OsAvailable)))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 6 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to ReachabilityCardinality-14-0.sara
lola: state equation: calling and running sara
sara: try reading problem file ReachabilityCardinality-14-0.sara.
sara: place or transition ordering is non-deterministic
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 10240 markings, 10239 edges
lola: ========================================
lola: subprocess 15 will run for 3141 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((Bounder1 <= SwContainer) AND (Wsr1Started + 1 <= ScUnavailable) AND (((1 <= Container) AND (1 <= Wsr3Deployed)) OR (WSRuntime1 <= Wsr2Deployed)))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: processed formula: E (F (((Bounder1 <= SwContainer) AND (Wsr1Started + 1 <= ScUnavailable) AND (((1 <= Container) AND (1 <= Wsr3Deployed)) OR (WSRuntime1 <= Wsr2Deployed)))))
lola: processed formula length: 156
lola: 22 rewrites
lola: closed formula file ReachabilityCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((Bounder1 <= SwContainer) AND (Wsr1Started + 1 <= ScUnavailable) AND (((1 <= Container) AND (1 <= Wsr3Deployed)) OR (WSRuntime1 <= Wsr2Deployed)))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 7 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to ReachabilityCardinality-15-0.sara
lola: state equation: calling and running sara
sara: try reading problem file ReachabilityCardinality-15-0.sara.
sara: place or transition ordering is non-deterministic
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 15362 markings, 15361 edges
lola: ========================================
lola: ========================================
lola: ...considering subproblem: E (F (((Wsr1NotDeployed <= ContainerDown) OR (3 <= Wsr1Deployed))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: processed formula: E (F (((Wsr1NotDeployed <= ContainerDown) OR (3 <= Wsr1Deployed))))
lola: processed formula length: 68
lola: 22 rewrites
lola: closed formula file ReachabilityCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((Wsr1NotDeployed <= ContainerDown) OR (3 <= Wsr1Deployed))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 2 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to ReachabilityCardinality-16-0.sara
lola: state equation: calling and running sara
sara: try reading problem file ReachabilityCardinality-16-0.sara.
sara: place or transition ordering is non-deterministic
lola: sara is running 0 secs || 2804130 markings, 4437091 edges, 560826 markings/sec, 0 secs
lola: sara is running 5 secs || 5700228 markings, 9022399 edges, 579220 markings/sec, 5 secs
lola: sara is running 10 secs || 8550185 markings, 13538483 edges, 569991 markings/sec, 10 secs
lola: sara is running 15 secs || 11393953 markings, 18040165 edges, 568754 markings/sec, 15 secs
lola: sara is running 20 secs || 14189958 markings, 22465390 edges, 559201 markings/sec, 20 secs
lola: sara is running 25 secs || 16996818 markings, 26911384 edges, 561372 markings/sec, 25 secs
lola: sara is running 30 secs || 19796635 markings, 31347132 edges, 559963 markings/sec, 30 secs
lola: sara is running 35 secs || 22515185 markings, 35650720 edges, 543710 markings/sec, 35 secs
lola: sara is running 40 secs || 25147261 markings, 39819468 edges, 526415 markings/sec, 40 secs
lola: sara is running 45 secs || 27751404 markings, 43941188 edges, 520829 markings/sec, 45 secs
lola: sara is running 50 secs || 30339302 markings, 48038536 edges, 517580 markings/sec, 50 secs
lola: sara is running 55 secs || 33018383 markings, 52282918 edges, 535816 markings/sec, 55 secs
lola: sara is running 60 secs || 35749997 markings, 56606108 edges, 546323 markings/sec, 60 secs
lola: sara is running 65 secs || 38426758 markings, 60847009 edges, 535352 markings/sec, 65 secs
lola: sara is running 70 secs || 41108531 markings, 65090308 edges, 536355 markings/sec, 70 secs
lola: sara is running 75 secs || 43738246 markings, 69255512 edges, 525943 markings/sec, 75 secs
lola: sara is running 80 secs || 46295117 markings, 73306316 edges, 511374 markings/sec, 80 secs
lola: sara is running 85 secs || 48904058 markings, 77435232 edges, 521788 markings/sec, 85 secs
lola: sara is running 90 secs || 51479525 markings, 81513936 edges, 515093 markings/sec, 90 secs
lola: sara is running 95 secs || 54020970 markings, 85536478 edges, 508289 markings/sec, 95 secs
lola: sara is running 100 secs || 56579150 markings, 89589246 edges, 511636 markings/sec, 100 secs
lola: sara is running 105 secs || 59093822 markings, 93571626 edges, 502934 markings/sec, 105 secs
lola: sara is running 110 secs || 61623276 markings, 97576178 edges, 505891 markings/sec, 110 secs
lola: sara is running 115 secs || 64188086 markings, 101638890 edges, 512962 markings/sec, 115 secs
lola: sara is running 120 secs || 66790284 markings, 105757693 edges, 520440 markings/sec, 120 secs
lola: sara is running 125 secs || 69362013 markings, 109830788 edges, 514346 markings/sec, 125 secs
lola: sara is running 130 secs || 71909012 markings, 113861662 edges, 509400 markings/sec, 130 secs
lola: sara is running 135 secs || 74432300 markings, 117858151 edges, 504658 markings/sec, 135 secs
lola: sara is running 140 secs || 76924087 markings, 121805013 edges, 498357 markings/sec, 140 secs
lola: sara is running 145 secs || 79423962 markings, 125765192 edges, 499975 markings/sec, 145 secs
lola: sara is running 150 secs || 81978006 markings, 129806634 edges, 510809 markings/sec, 150 secs
lola: sara is running 155 secs || 84484395 markings, 133776588 edges, 501278 markings/sec, 155 secs
lola: sara is running 160 secs || 86954197 markings, 137686531 edges, 493960 markings/sec, 160 secs
lola: sara is running 165 secs || 89457578 markings, 141651967 edges, 500676 markings/sec, 165 secs
lola: sara is running 170 secs || 91918270 markings, 145548251 edges, 492138 markings/sec, 170 secs
lola: sara is running 175 secs || 94337630 markings, 149377404 edges, 483872 markings/sec, 175 secs
lola: sara is running 180 secs || 97084428 markings, 153728491 edges, 549360 markings/sec, 180 secs
lola: sara is running 185 secs || 99763182 markings, 157971068 edges, 535751 markings/sec, 185 secs
lola: sara is running 190 secs || 102420389 markings, 162178826 edges, 531441 markings/sec, 190 secs
lola: sara is running 195 secs || 105193956 markings, 166570078 edges, 554713 markings/sec, 195 secs
lola: sara is running 200 secs || 108640787 markings, 172027616 edges, 689366 markings/sec, 200 secs
lola: sara is running 205 secs || 112036132 markings, 177402645 edges, 679069 markings/sec, 205 secs
lola: sara is running 210 secs || 115377052 markings, 182695893 edges, 668184 markings/sec, 210 secs
lola: sara is running 215 secs || 118664986 markings, 187899426 edges, 657587 markings/sec, 215 secs
lola: sara is running 220 secs || 121962883 markings, 193122875 edges, 659579 markings/sec, 220 secs
lola: sara is running 225 secs || 125204353 markings, 198256561 edges, 648294 markings/sec, 225 secs
lola: sara is running 230 secs || 128420364 markings, 203346852 edges, 643202 markings/sec, 230 secs
lola: sara is running 235 secs || 131680968 markings, 208514144 edges, 652121 markings/sec, 235 secs
lola: sara is running 240 secs || 134864134 markings, 213552728 edges, 636633 markings/sec, 240 secs
lola: sara is running 245 secs || 138062964 markings, 218619578 edges, 639766 markings/sec, 245 secs
lola: sara is running 250 secs || 141242111 markings, 223654283 edges, 635829 markings/sec, 250 secs
lola: sara is running 255 secs || 144364972 markings, 228598564 edges, 624572 markings/sec, 255 secs
lola: sara is running 260 secs || 147545524 markings, 233633253 edges, 636110 markings/sec, 260 secs
lola: sara is running 265 secs || 150684946 markings, 238606429 edges, 627884 markings/sec, 265 secs
lola: sara is running 270 secs || 153797022 markings, 243534108 edges, 622415 markings/sec, 270 secs
lola: sara is running 275 secs || 156298178 markings, 247491769 edges, 500231 markings/sec, 275 secs
lola: sara is running 280 secs || 156308854 markings, 247512118 edges, 2135 markings/sec, 280 secs
lola: sara is running 285 secs || 156322020 markings, 247532636 edges, 2633 markings/sec, 285 secs
lola: Child process aborted or communication problem between parent and child process
lola: RESULT
lola:
SUMMARY: yes no unknown no yes yes yes no no no no no no yes no yes
lola:
preliminary result: yes no unknown no yes yes yes no no no no no no yes no yes
lola: memory consumption: 22384 KB
lola: time consumption: 720 seconds
lola: print data as JSON (--json)
lola: writing JSON to ReachabilityCardinality.json
lola: closed JSON file ReachabilityCardinality.json
rslt: finished

BK_STOP 1554055222841

--------------------
content from stderr:

grep: GenericPropertiesVerdict.xml: No such file or directory
grep: GenericPropertiesVerdict.xml: No such file or directory

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="CloudOpsManagement-PT-10240by05120"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="lola"
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-3957"
echo " Executing tool lola"
echo " Input is CloudOpsManagement-PT-10240by05120, examination is ReachabilityCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r209-smll-155381375500116"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/CloudOpsManagement-PT-10240by05120.tgz
mv CloudOpsManagement-PT-10240by05120 execution
cd execution
if [ "ReachabilityCardinality" = "GlobalProperties" ] ; then
rm -f GenericPropertiesVerdict.xml
fi
if [ "ReachabilityCardinality" = "UpperBounds" ] ; 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 [ "ReachabilityCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityCardinality" != "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 "ReachabilityCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityCardinality.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 '' ReachabilityCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
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 ;