Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2020-input.r211-tajo-159033476900020.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2020-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
.....................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itslola
Input is SatelliteMemory-PT-X01500Y0046, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r211-tajo-159033476900020
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 176K
-rw-r--r-- 1 mcc users 3.1K May 14 00:28 CTLCardinality.txt
-rw-r--r-- 1 mcc users 16K May 14 00:28 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K May 13 17:40 CTLFireability.txt
-rw-r--r-- 1 mcc users 15K May 13 17:40 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K May 14 10:01 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 14 10:01 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K May 14 10:01 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K May 14 10:01 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 May 12 20:42 NewModel
-rw-r--r-- 1 mcc users 4.1K May 13 13:07 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 22K May 13 13:07 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.7K May 13 07:37 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 15K May 13 07:37 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K May 13 16:53 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 13 16:53 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 12 20:42 equiv_col
-rw-r--r-- 1 mcc users 12 May 12 20:42 instance
-rw-r--r-- 1 mcc users 6 May 12 20:42 iscolored
-rwxr-xr-x 1 mcc users 5.5K May 12 20:42 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 SatelliteMemory-PT-X01500Y0046-CTLFireability-00
FORMULA_NAME SatelliteMemory-PT-X01500Y0046-CTLFireability-01
FORMULA_NAME SatelliteMemory-PT-X01500Y0046-CTLFireability-02
FORMULA_NAME SatelliteMemory-PT-X01500Y0046-CTLFireability-03
FORMULA_NAME SatelliteMemory-PT-X01500Y0046-CTLFireability-04
FORMULA_NAME SatelliteMemory-PT-X01500Y0046-CTLFireability-05
FORMULA_NAME SatelliteMemory-PT-X01500Y0046-CTLFireability-06
FORMULA_NAME SatelliteMemory-PT-X01500Y0046-CTLFireability-07
FORMULA_NAME SatelliteMemory-PT-X01500Y0046-CTLFireability-08
FORMULA_NAME SatelliteMemory-PT-X01500Y0046-CTLFireability-09
FORMULA_NAME SatelliteMemory-PT-X01500Y0046-CTLFireability-10
FORMULA_NAME SatelliteMemory-PT-X01500Y0046-CTLFireability-11
FORMULA_NAME SatelliteMemory-PT-X01500Y0046-CTLFireability-12
FORMULA_NAME SatelliteMemory-PT-X01500Y0046-CTLFireability-13
FORMULA_NAME SatelliteMemory-PT-X01500Y0046-CTLFireability-14
FORMULA_NAME SatelliteMemory-PT-X01500Y0046-CTLFireability-15

=== Now, execution of the tool begins

BK_START 1591284163036

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-04 15:22:45] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -timeout, 3600, -rebuildPNML]
[2020-06-04 15:22:45] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-04 15:22:45] [INFO ] Load time of PNML (sax parser for PT used): 23 ms
[2020-06-04 15:22:45] [INFO ] Transformed 13 places.
[2020-06-04 15:22:45] [INFO ] Transformed 10 transitions.
[2020-06-04 15:22:45] [INFO ] Parsed PT model containing 13 places and 10 transitions in 61 ms.
Reduce places removed 1 places and 0 transitions.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 15 ms.
Incomplete random walk after 100000 steps, including 0 resets, run finished after 124 ms. (steps per millisecond=806 ) properties seen :[1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1]
// Phase 1: matrix 10 rows 12 cols
[2020-06-04 15:22:45] [INFO ] Computed 6 place invariants in 3 ms
[2020-06-04 15:22:45] [INFO ] [Real]Absence check using 6 positive place invariants in 15 ms returned unsat
[2020-06-04 15:22:45] [INFO ] [Real]Absence check using 6 positive place invariants in 3 ms returned unsat
Successfully simplified 2 atomic propositions for a total of 2 simplifications.
[2020-06-04 15:22:45] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2020-06-04 15:22:45] [INFO ] Flatten gal took : 24 ms
[2020-06-04 15:22:45] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2020-06-04 15:22:45] [INFO ] Flatten gal took : 4 ms
FORMULA SatelliteMemory-PT-X01500Y0046-CTLFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-06-04 15:22:45] [INFO ] Export to MCC properties in file /home/mcc/execution/CTLFireability.sr.xml took 2 ms.
[2020-06-04 15:22:45] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 0 ms.
info: Time: 3600 - MCC
vrfy: Checking CTLFireability @ SatelliteMemory-PT-X01500Y0046 @ 3570 seconds

FORMULA SatelliteMemory-PT-X01500Y0046-CTLFireability-00 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA SatelliteMemory-PT-X01500Y0046-CTLFireability-04 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA SatelliteMemory-PT-X01500Y0046-CTLFireability-05 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA SatelliteMemory-PT-X01500Y0046-CTLFireability-08 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA SatelliteMemory-PT-X01500Y0046-CTLFireability-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA SatelliteMemory-PT-X01500Y0046-CTLFireability-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA SatelliteMemory-PT-X01500Y0046-CTLFireability-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA SatelliteMemory-PT-X01500Y0046-CTLFireability-09 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA SatelliteMemory-PT-X01500Y0046-CTLFireability-03 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA SatelliteMemory-PT-X01500Y0046-CTLFireability-01 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA SatelliteMemory-PT-X01500Y0046-CTLFireability-06 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA SatelliteMemory-PT-X01500Y0046-CTLFireability-07 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA SatelliteMemory-PT-X01500Y0046-CTLFireability-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA SatelliteMemory-PT-X01500Y0046-CTLFireability-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA SatelliteMemory-PT-X01500Y0046-CTLFireability-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 3422
rslt: Output for CTLFireability @ SatelliteMemory-PT-X01500Y0046

{
"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=CTLFireability.xml",
"--mcc",
"--donotcomputecapacities",
"--encoder=simplecompressed",
"--check=modelchecking",
"--stubborn=tarjan",
"--stateequation=par",
"--quickchecks",
"--timelimit=3570",
"--localtimelimit=0",
"--preference=force_ctl",
"--json=CTLFireability.json",
"--jsoninclude=formula,formulastat,net"
],
"starttime": "Thu Jun 4 15:22:46 2020
",
"timelimit": 3570
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 237
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 3,
"F": 0,
"G": 1,
"U": 2,
"X": 1,
"aconj": 2,
"adisj": 1,
"aneg": 0,
"comp": 9,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 9,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 7,
"visible_transitions": 0
},
"processed": "(E(((p1 <= 0) OR (p3 <= 0) OR (p7 <= 0) OR (p10 <= 0)) U AG(((1408 <= p3) AND (92 <= p6)))) AND E((1 <= p7) U EX(((1 <= p0) AND (1 <= p8)))))",
"processed_size": 144,
"rewrites": 15
},
"net":
{
"conflict_clusters": 3,
"singleton_clusters": 0
},
"result":
{
"edges": 11281,
"markings": 5636,
"produced_by": "CTL model checker",
"value": false
},
"task":
{
"compoundnumber": 0,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 254
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 2,
"E": 1,
"F": 1,
"G": 1,
"U": 0,
"X": 1,
"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": "EF(AX(AG((1 <= p7))))",
"processed_size": 21,
"rewrites": 14
},
"net":
{
"conflict_clusters": 3,
"singleton_clusters": 0
},
"result":
{
"edges": 67646993,
"markings": 16913270,
"produced_by": "CTL model checker",
"value": false
},
"task":
{
"compoundnumber": 1,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 271
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 1,
"F": 0,
"G": 1,
"U": 0,
"X": 1,
"aconj": 1,
"adisj": 0,
"aneg": 1,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "AG(EX(((p3 <= 0) OR (p9 <= 0) OR (p5 <= 1499))))",
"processed_size": 50,
"rewrites": 13
},
"net":
{
"conflict_clusters": 3,
"singleton_clusters": 0
},
"result":
{
"edges": 46503906,
"markings": 16913270,
"produced_by": "CTL model checker",
"value": true
},
"task":
{
"compoundnumber": 2,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 290
},
"child":
[

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 317
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 2,
"F": 0,
"G": 1,
"U": 0,
"X": 2,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "AG((EX((1 <= p2)) OR EX(((1408 <= p3) AND (1408 <= p5)))))",
"processed_size": 58,
"rewrites": 14
},
"net":
{
"conflict_clusters": 3,
"singleton_clusters": 0
},
"result":
{
"edges": 46503906,
"markings": 16913270,
"produced_by": "CTL model checker",
"value": true
},
"task":
{
"compoundnumber": 4,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": true
},
"task":
{
"compoundnumber": 3,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 314
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 1,
"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": "EF(AX((1 <= p7)))",
"processed_size": 17,
"rewrites": 13
},
"net":
{
"conflict_clusters": 3,
"singleton_clusters": 0
},
"result":
{
"edges": 46503906,
"markings": 16913270,
"produced_by": "CTL model checker",
"value": false
},
"task":
{
"compoundnumber": 4,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 342
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 1,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "EF(AX(((p4 <= 0) OR (p6 <= 0) OR (p8 <= 0))))",
"processed_size": 47,
"rewrites": 13
},
"net":
{
"conflict_clusters": 3,
"singleton_clusters": 0
},
"result":
{
"edges": 16493,
"markings": 11996,
"produced_by": "CTL model checker",
"value": true
},
"task":
{
"compoundnumber": 5,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 380
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 1,
"aneg": 0,
"comp": 2,
"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": "E (F (((1500 <= p11) OR (1500 <= p5))))",
"processed_size": 40,
"rewrites": 12
},
"result":
{
"edges": 2817,
"markings": 2818,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 6,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 2,
"problems": 2
},
"type": "reachability",
"workflow": "stateequation||search"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 489
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 1,
"F": 1,
"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": "AF(EG((1 <= p7)))",
"processed_size": 17,
"rewrites": 13
},
"net":
{
"conflict_clusters": 3,
"singleton_clusters": 0
},
"result":
{
"edges": 7947312,
"markings": 7936047,
"produced_by": "CTL model checker",
"value": false
},
"task":
{
"compoundnumber": 8,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 570
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 3,
"E": 0,
"F": 2,
"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": "AF(AG(AF((1 <= p2))))",
"processed_size": 21,
"rewrites": 14
},
"net":
{
"conflict_clusters": 3,
"singleton_clusters": 0
},
"result":
{
"edges": 12011,
"markings": 12004,
"produced_by": "CTL model checker",
"value": false
},
"task":
{
"compoundnumber": 9,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 684
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 1,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 1,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "EG(AF(((p7 <= 0) AND ((p3 <= 0) OR (p9 <= 0)))))",
"processed_size": 49,
"rewrites": 13
},
"net":
{
"conflict_clusters": 3,
"singleton_clusters": 0
},
"result":
{
"edges": 25340,
"markings": 14075,
"produced_by": "CTL model checker",
"value": true
},
"task":
{
"compoundnumber": 10,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 855
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 2,
"F": 2,
"G": 1,
"U": 0,
"X": 0,
"aconj": 2,
"adisj": 1,
"aneg": 0,
"comp": 8,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 8,
"taut": 0,
"tconj": 1,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "EG((EF((((1408 <= p3) AND (1408 <= p5)) OR ((1 <= p1) AND (1 <= p3) AND (1 <= p7) AND (1 <= p10)))) AND ((1 <= p7) OR AF((1 <= p7)))))",
"processed_size": 135,
"rewrites": 14
},
"net":
{
"conflict_clusters": 3,
"singleton_clusters": 0
},
"result":
{
"edges": 5642,
"markings": 5633,
"produced_by": "CTL model checker",
"value": false
},
"task":
{
"compoundnumber": 11,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1140
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 0,
"U": 1,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 2,
"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 (((p11 <= 1499) U (1 <= p7)))",
"processed_size": 31,
"rewrites": 16
},
"result":
{
"edges": 2817,
"markings": 2817,
"produced_by": "state space /ER",
"value": false
},
"task":
{
"compoundnumber": 12,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl",
"visible": 3
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "universal_until",
"workflow": "stateequation"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1711
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"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": "(1500 <= p5)",
"processed_size": 12,
"rewrites": 14
},
"result":
{
"edges": 16496,
"markings": 11998,
"produced_by": "state space /EGEF",
"value": true
},
"task":
{
"compoundnumber": 13,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving",
"visible": 2
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "possible_preservation_of_reachability",
"workflow": "stateequation"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3422
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3422
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 1,
"comp": 2,
"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": "E (G (((p3 <= 1407) OR (p5 <= 1407))))",
"processed_size": 39,
"rewrites": 12
},
"result":
{
"edges": 4,
"markings": 4,
"produced_by": "state space / EG",
"value": true
},
"task":
{
"compoundnumber": 14,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 6
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 2,
"problems": 2
},
"type": "possible_preservation",
"workflow": "stateequation"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": null
},
"task":
{
"compoundnumber": 14,
"type": "boolean"
}
},

{
"child":
[

{
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 1,
"comp": 2,
"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": "E (G (((p3 <= 1407) OR (p5 <= 1407))))",
"processed_size": 39,
"rewrites": 12
},
"result":
{
"edges": 4,
"markings": 4,
"produced_by": "state space / EG",
"value": true
},
"task":
{
"compoundnumber": 15,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 6
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 2,
"problems": 2
},
"type": "possible_preservation",
"workflow": "stateequation"
}
},

{
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 0,
"U": 1,
"X": 0,
"aconj": 1,
"adisj": 1,
"aneg": 0,
"comp": 6,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 6,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 6,
"visible_transitions": 0
},
"processed": "A ((((p3 <= 1407) OR (p5 <= 1407) OR ((1 <= p0) AND (1 <= p8)) OR (1500 <= p11)) U (1 <= p7)))",
"processed_size": 97,
"rewrites": 16
},
"result":
{
"edges": 2815,
"markings": 2816,
"produced_by": "state space /ER",
"value": false
},
"task":
{
"compoundnumber": 16,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl",
"visible": 7
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 5,
"problems": 4
},
"type": "universal_until",
"workflow": "stateequation"
}
}
],
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 15,
"type": "boolean"
}
}
],
"exit":
{
"error": null,
"memory": 24160,
"runtime": 148.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "CTLFireability.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "(E((** U A(G(**)))) AND E((** U E(X(**))))) : A(F(A(G(A(F(**)))))) : A(F(E(G(**)))) : E(F(A(X(A(G(**)))))) : A(G(E(X(*)))) : E(G(A(F(**)))) : E(G((E(F(**)) AND (** OR A(F(**)))))) : (A(G((E(X(**)) OR E(X(**))))) AND E(F(**))) : A(F(**)) : E(F(A(X(**)))) : E(F(A(X(**)))) : E(G(E(F(**)))) : (E(G(*)) AND A((** U **))) : E(F(**)) : A((** U **))"
},
"net":
{
"arcs": 38,
"conflict_clusters": 3,
"places": 12,
"places_significant": 6,
"singleton_clusters": 0,
"transitions": 10
},
"result":
{
"preliminary_value": "no no no no yes yes no yes no no yes yes no yes no ",
"value": "no no no no yes yes no yes no no yes yes no yes no "
},
"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: 22/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 384
lola: finding significant places
lola: 12 places, 10 transitions, 6 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 CTLFireability.xml
lola: (E ((((p1 <= 0) OR (p3 <= 0) OR (p7 <= 0) OR (p10 <= 0)) U A (G (((1408 <= p3) AND (92 <= p6)))))) AND E (((1 <= p7) U E (X (((1 <= p0) AND (1 <= p8))))))) : A (F (A (G (A (F ((1 <= p2))))))) : A (F (E (G ((1 <= p7))))) : E (F (A (G (A (X ((1 <= p7))))))) : A (G (NOT(A (X (((1 <= p3) AND (1 <= p9) AND (1500 <= p5))))))) : E (G (A (F (((p7 <= 0) AND ((p3 <= 0) OR (p9 <= 0))))))) : E (G ((E (F ((((1408 <= p3) AND (1408 <= p5)) OR ((1 <= p1) AND (1 <= p3) AND (1 <= p7) AND (1 <= p10))))) AND ((1 <= p7) OR A (F ((1 <= p7))))))) : (A (G ((E (X ((1 <= p2))) OR E (X (((1408 <= p3) AND (1408 <= p5))))))) AND E (F (E (F (((1 <= p0) AND (1 <= p8))))))) : A (F ((1 <= p7))) : A (F (E (F (A (X ((1 <= p7))))))) : E (F (A (X (((p4 <= 0) OR (p6 <= 0) OR (p8 <= 0)))))) : E (G (E (G (E (F ((1500 <= p5))))))) : (NOT(A (F (A (F (((1408 <= p3) AND (1408 <= p5))))))) AND A ((((p3 <= 1407) OR (p5 <= 1407) OR ((1 <= p0) AND (1 <= p8)) OR (1500 <= p11)) U (1 <= p7)))) : E (F (((1500 <= p11) OR (1500 <= p5)))) : A (((p11 <= 1499) U (1 <= p7)))
lola: rewrite Frontend/Parser/formula_rewrite.k:398
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:401
lola: rewrite Frontend/Parser/formula_rewrite.k:449
lola: rewrite Frontend/Parser/formula_rewrite.k:461
lola: rewrite Frontend/Parser/formula_rewrite.k:392
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 237 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E ((((p1 <= 0) OR (p3 <= 0) OR (p7 <= 0) OR (p10 <= 0)) U A (G (((1408 <= p3) AND (92 <= p6)))))) AND E (((1 <= p7) U E (X (((1 <= p0) AND (1 <= p8)))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:813
lola: rewrite Frontend/Parser/formula_rewrite.k:809
lola: rewrite Frontend/Parser/formula_rewrite.k:807
lola: rewrite Frontend/Parser/formula_rewrite.k:809
lola: processed formula: (E(((p1 <= 0) OR (p3 <= 0) OR (p7 <= 0) OR (p10 <= 0)) U AG(((1408 <= p3) AND (92 <= p6)))) AND E((1 <= p7) U EX(((1 <= p0) AND (1 <= p8)))))
lola: processed formula length: 144
lola: 15 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 3 significant temporal operators and needs 13 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 5636 markings, 11281 edges
lola: ========================================
lola: subprocess 1 will run for 254 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (A (X (A (G ((1 <= p7)))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:813
lola: rewrite Frontend/Parser/formula_rewrite.k:812
lola: rewrite Frontend/Parser/formula_rewrite.k:806
lola: processed formula: EF(AX(AG((1 <= p7))))
lola: processed formula length: 21
lola: 14 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: 3090248 markings, 8883445 edges, 618050 markings/sec, 0 secs
lola: 6341495 markings, 18231289 edges, 650249 markings/sec, 5 secs
lola: 9209603 markings, 26477545 edges, 573622 markings/sec, 10 secs
lola: 11976672 markings, 34433300 edges, 553414 markings/sec, 15 secs
lola: 14832247 markings, 42643525 edges, 571115 markings/sec, 20 secs
lola: 16911968 markings, 50039427 edges, 415944 markings/sec, 25 secs
lola: 16912372 markings, 55502168 edges, 81 markings/sec, 30 secs
lola: 16912870 markings, 62224278 edges, 100 markings/sec, 35 secs
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 16913270 markings, 67646993 edges
lola: ========================================
lola: subprocess 2 will run for 271 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (E (X (((p3 <= 0) OR (p9 <= 0) OR (p5 <= 1499))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:807
lola: rewrite Frontend/Parser/formula_rewrite.k:813
lola: processed formula: AG(EX(((p3 <= 0) OR (p9 <= 0) OR (p5 <= 1499))))
lola: processed formula length: 50
lola: 13 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: 4253103 markings, 6910394 edges, 850621 markings/sec, 0 secs
lola: 8257085 markings, 13417602 edges, 800796 markings/sec, 5 secs
lola: 12042248 markings, 19568475 edges, 757033 markings/sec, 10 secs
lola: 16264440 markings, 26430995 edges, 844438 markings/sec, 15 secs
lola: 16912194 markings, 31932280 edges, 129551 markings/sec, 20 secs
lola: 16912722 markings, 39061647 edges, 106 markings/sec, 25 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 16913270 markings, 46503906 edges
lola: ========================================
lola: subprocess 3 will run for 290 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (G ((E (X ((1 <= p2))) OR E (X (((1408 <= p3) AND (1408 <= p5))))))) AND E (F (((1 <= p0) AND (1 <= p8)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 3 will run for 290 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((1 <= p0) AND (1 <= p8))))
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 (((1 <= p0) AND (1 <= p8))))
lola: processed formula length: 33
lola: 12 rewrites
lola: closed formula file CTLFireability.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: SUBRESULT
lola: formula 0: ((1 <= p0) AND (1 <= p8))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 2 markings, 1 edges
lola: state equation: write sara problem file to CTLFireability-3-0.sara
lola: subprocess 4 will run for 317 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((E (X ((1 <= p2))) OR E (X (((1408 <= p3) AND (1408 <= p5)))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:807
lola: rewrite Frontend/Parser/formula_rewrite.k:807
lola: rewrite Frontend/Parser/formula_rewrite.k:813
lola: processed formula: AG((EX((1 <= p2)) OR EX(((1408 <= p3) AND (1408 <= p5)))))
lola: processed formula length: 58
lola: 14 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: ========================================
lola: 4618501 markings, 7503597 edges, 923700 markings/sec, 0 secs
lola: 9110194 markings, 14803445 edges, 898339 markings/sec, 5 secs
lola: 13183130 markings, 21423834 edges, 814587 markings/sec, 10 secs
lola: 16911894 markings, 27876835 edges, 745753 markings/sec, 15 secs
lola: 16912456 markings, 35486683 edges, 112 markings/sec, 20 secs
lola: 16913008 markings, 42930354 edges, 110 markings/sec, 25 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 16913270 markings, 46503906 edges
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: ========================================
lola: subprocess 4 will run for 314 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (A (X ((1 <= p7)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:812
lola: rewrite Frontend/Parser/formula_rewrite.k:806
lola: processed formula: EF(AX((1 <= p7)))
lola: processed formula length: 17
lola: 13 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: 4854572 markings, 7887773 edges, 970914 markings/sec, 0 secs
lola: 9654376 markings, 15688878 edges, 959961 markings/sec, 5 secs
lola: 14235580 markings, 23133835 edges, 916241 markings/sec, 10 secs
lola: 16912108 markings, 30788604 edges, 535306 markings/sec, 15 secs
lola: 16912766 markings, 39670646 edges, 132 markings/sec, 20 secs
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 16913270 markings, 46503906 edges
lola: ========================================
lola: subprocess 5 will run for 342 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (A (X (((p4 <= 0) OR (p6 <= 0) OR (p8 <= 0))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:812
lola: rewrite Frontend/Parser/formula_rewrite.k:806
lola: processed formula: EF(AX(((p4 <= 0) OR (p6 <= 0) OR (p8 <= 0))))
lola: processed formula length: 47
lola: 13 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 11996 markings, 16493 edges
lola: ========================================
lola: subprocess 6 will run for 380 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((1500 <= p11) OR (1500 <= p5))))
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 (((1500 <= p11) OR (1500 <= p5))))
lola: processed formula length: 40
lola: 12 rewrites
lola: closed formula file CTLFireability.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: ((1500 <= p11) OR (1500 <= p5))
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 CTLFireability-6-0.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: state equation: calling and running sara
lola: The predicate is reachable.
lola: 2818 markings, 2817 edges
lola: ========================================
lola: subprocess 7 will run for 428 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F ((1 <= p7)))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:584
lola: rewrite Frontend/Parser/formula_rewrite.k:749
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: (p7 <= 0)
lola: processed formula length: 9
lola: 14 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
sara: try reading problem file CTLFireability-6-0.sara.
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:700
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (1 <= p7)
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 CTLFireability-7-0.sara
sara: place or transition ordering is non-deterministic
lola: state equation: calling and running sara
sara: try reading problem file CTLFireability-7-0.sara.
sara: place or transition ordering is non-deterministic

lola: SUBRESULT
lola: result: no
lola: produced by: state space / EG
lola: The predicate does not eventually occur.
lola: 2817 markings, 2817 edges
lola: ========================================
lola: subprocess 8 will run for 489 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (E (G ((1 <= p7)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:808
lola: rewrite Frontend/Parser/formula_rewrite.k:811
lola: processed formula: AF(EG((1 <= p7)))
lola: processed formula length: 17
lola: 13 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).

lola: 7101994 markings, 7112649 edges, 1420399 markings/sec, 0 secs
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 7936047 markings, 7947312 edges
lola: ========================================
lola: subprocess 9 will run for 570 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (A (G (A (F ((1 <= p2)))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:811
lola: rewrite Frontend/Parser/formula_rewrite.k:813
lola: rewrite Frontend/Parser/formula_rewrite.k:811
lola: processed formula: AF(AG(AF((1 <= p2))))
lola: processed formula length: 21
lola: 14 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 3 significant temporal operators and needs 13 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 12004 markings, 12011 edges
lola: ========================================
lola: subprocess 10 will run for 684 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G (A (F (((p7 <= 0) AND ((p3 <= 0) OR (p9 <= 0)))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:811
lola: rewrite Frontend/Parser/formula_rewrite.k:808
lola: processed formula: EG(AF(((p7 <= 0) AND ((p3 <= 0) OR (p9 <= 0)))))
lola: processed formula length: 49
lola: 13 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 14075 markings, 25340 edges
lola: ========================================
lola: subprocess 11 will run for 855 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G ((E (F ((((1408 <= p3) AND (1408 <= p5)) OR ((1 <= p1) AND (1 <= p3) AND (1 <= p7) AND (1 <= p10))))) AND ((1 <= p7) OR A (F ((1 <= p7)))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:806
lola: rewrite Frontend/Parser/formula_rewrite.k:811
lola: rewrite Frontend/Parser/formula_rewrite.k:808
lola: processed formula: EG((EF((((1408 <= p3) AND (1408 <= p5)) OR ((1 <= p1) AND (1 <= p3) AND (1 <= p7) AND (1 <= p10)))) AND ((1 <= p7) OR AF((1 <= p7)))))
lola: processed formula length: 135
lola: 14 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 3 significant temporal operators and needs 13 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 5633 markings, 5642 edges
lola: ========================================
lola: subprocess 12 will run for 1140 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (((p11 <= 1499) U (1 <= p7)))
lola: ========================================
lola: SUBTASK
lola: checking universal until
lola: rewrite Frontend/Parser/formula_rewrite.k:577
lola: rewrite Frontend/Parser/formula_rewrite.k:735
lola: rewrite Frontend/Parser/formula_rewrite.k:695
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: A (((p11 <= 1499) U (1 <= p7)))
lola: processed formula length: 31
lola: 16 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /ER)
lola: state space: using reachability graph (ER version) (--search=depth)
lola: state space: using ltl preserving stubborn set method (--stubborn=tarjan)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
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:700
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (p11 <= 1499)
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 CTLFireability-12-0.sara
lola: state equation: calling and running sara
sara: try reading problem file CTLFireability-12-0.sara.
sara: place or transition ordering is non-deterministic

lola: 1
lola: SUBRESULT
lola: result: no
lola: produced by: state space /ER
lola: Predicate Phi does not hild until Predicate Psi on all paths.
lola: 2817 markings, 2817 edges
lola: ========================================
lola: subprocess 13 will run for 1711 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G (E (F ((1500 <= p5)))))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation of reachability
lola: rewrite Frontend/Parser/formula_rewrite.k:593
lola: rewrite Frontend/Parser/formula_rewrite.k:628
lola: rewrite Frontend/Parser/formula_rewrite.k:731
lola: processed formula: (1500 <= p5)
lola: processed formula length: 12
lola: 14 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /EGEF)
lola: state space: using reachability graph (EGEF version) (--search=depth)
lola: state space: using ctl preserving stubborn set method (--stubborn=tarjan)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
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: (p5 <= 1499)
lola: state equation task get result unparse finished id 0
lola: state equation task get result started, id 1
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: state equation task get result rewrite finished id 1
lola: state equation task get result unparse finished++ id 1
lola: formula 1: (1500 <= p5)
lola: state equation task get result unparse finished id 1
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to CTLFireability-13-1.sara
lola: state equation: write sara problem file to CTLFireability-13-0.sara
lola: state equation: calling and running sara
lola: state equation: calling and running sara
sara: try reading problem file CTLFireability-13-1.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space /EGEF
lola: sara: place or transition ordering is non-deterministic
Reachability of the predicate is possibly preserved.
lola: 11998 markings, 16496 edges
lola: ========================================
lola: subprocess 14 will run for 3422 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E (G (((p3 <= 1407) OR (p5 <= 1407)))) AND A ((((p3 <= 1407) OR (p5 <= 1407) OR ((1 <= p0) AND (1 <= p8)) OR (1500 <= p11)) U (1 <= p7))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 14 will run for 3422 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G (((p3 <= 1407) OR (p5 <= 1407))))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation
lola: rewrite Frontend/Parser/formula_rewrite.k:583
lola: processed formula: E (G (((p3 <= 1407) OR (p5 <= 1407))))
lola: processed formula length: 39
lola: 12 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
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:788
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: SUBRESULT
lola: result: yes
lola: produced by: state space / EG
lola: formula 0: ((1408 <= p3) AND (1408 <= p5))
lola: state equation task get result unparse finished id 0
lola: The predicate is possibly preserved.
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: 4 markings, 4 edges
lola: ========================================
lola: Child process aborted or communication problem between parent and child process
lola: SUBRESULT
lola: result: unknown
lola: The Boolean predicate may be true or false.
lola: ========================================
lola: ========================================
lola: ...considering subproblem: (E (G (((p3 <= 1407) OR (p5 <= 1407)))) AND A ((((p3 <= 1407) OR (p5 <= 1407) OR ((1 <= p0) AND (1 <= p8)) OR (1500 <= p11)) U (1 <= p7))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: ...considering subproblem: E (G (((p3 <= 1407) OR (p5 <= 1407))))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation
lola: rewrite Frontend/Parser/formula_rewrite.k:583
lola: processed formula: E (G (((p3 <= 1407) OR (p5 <= 1407))))
lola: processed formula length: 39
lola: 12 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
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:788
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((1408 <= p3) AND (1408 <= p5))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space / EG
lola: The predicate is possibly preserved.
lola: 4 markings, 4 edges
lola: state equation: write sara problem file to CTLFireability-15-0.sara
lola: ========================================
lola: state equation: calling and running sara
lola: ========================================
lola: ...considering subproblem: A ((((p3 <= 1407) OR (p5 <= 1407) OR ((1 <= p0) AND (1 <= p8)) OR (1500 <= p11)) U (1 <= p7)))
lola: ========================================
lola: SUBTASK
lola: checking universal until
lola: rewrite Frontend/Parser/formula_rewrite.k:577
lola: rewrite Frontend/Parser/formula_rewrite.k:735
lola: rewrite Frontend/Parser/formula_rewrite.k:695
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: A ((((p3 <= 1407) OR (p5 <= 1407) OR ((1 <= p0) AND (1 <= p8)) OR (1500 <= p11)) U (1 <= p7)))
lola: processed formula length: 97
lola: 16 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /ER)
lola: state space: using reachability graph (ER version) (--search=depth)
lola: state space: using ltl preserving stubborn set method (--stubborn=tarjan)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
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:700
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((p3 <= 1407) OR (p5 <= 1407) OR ((1 <= p0) AND (1 <= p8)) OR (1500 <= p11))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 5 literals and 4 conjunctive subformulas
sara: try reading problem file CTLFireability-15-0.sara.
lola: state equation: write sara problem file to CTLFireability-16-0.sara
lola: 1
lola: sara: SUBRESULTplace or transition ordering is non-deterministic

lola: result: no
lola: produced by: state space /ER
lola: Predicate Phi does not hild until Predicate Psi on all paths.
lola: 2816 markings, 2815 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: RESULT
lola:
SUMMARY: no no no no yes yes no yes no no yes yes no yes no
lola:
preliminary result: no no no no yes yes no yes no no yes yes no yes no
lola: memory consumption: 24160 KB
lola: time consumption: 148 seconds
lola: print data as JSON (--json)
lola: writing JSON to CTLFireability.json
lola: closed JSON file CTLFireability.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="SatelliteMemory-PT-X01500Y0046"
export BK_EXAMINATION="CTLFireability"
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 SatelliteMemory-PT-X01500Y0046, examination is CTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r211-tajo-159033476900020"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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