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-159033477400412.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 ShieldPPPs-PT-002A, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r211-tajo-159033477400412
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 184K
-rw-r--r-- 1 mcc users 3.4K May 14 01:34 CTLCardinality.txt
-rw-r--r-- 1 mcc users 19K May 14 01:34 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K May 13 18:56 CTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 13 18:56 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.2K May 14 10:02 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 14 10:02 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K May 14 10:02 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 14 10:02 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 May 12 20:42 NewModel
-rw-r--r-- 1 mcc users 3.3K May 13 13:53 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 18K May 13 13:53 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.6K May 13 08:37 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 16K May 13 08:37 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 13 16:53 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K 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 5 May 12 20:42 instance
-rw-r--r-- 1 mcc users 6 May 12 20:42 iscolored
-rw-r--r-- 1 mcc users 18K 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 ShieldPPPs-PT-002A-CTLFireability-00
FORMULA_NAME ShieldPPPs-PT-002A-CTLFireability-01
FORMULA_NAME ShieldPPPs-PT-002A-CTLFireability-02
FORMULA_NAME ShieldPPPs-PT-002A-CTLFireability-03
FORMULA_NAME ShieldPPPs-PT-002A-CTLFireability-04
FORMULA_NAME ShieldPPPs-PT-002A-CTLFireability-05
FORMULA_NAME ShieldPPPs-PT-002A-CTLFireability-06
FORMULA_NAME ShieldPPPs-PT-002A-CTLFireability-07
FORMULA_NAME ShieldPPPs-PT-002A-CTLFireability-08
FORMULA_NAME ShieldPPPs-PT-002A-CTLFireability-09
FORMULA_NAME ShieldPPPs-PT-002A-CTLFireability-10
FORMULA_NAME ShieldPPPs-PT-002A-CTLFireability-11
FORMULA_NAME ShieldPPPs-PT-002A-CTLFireability-12
FORMULA_NAME ShieldPPPs-PT-002A-CTLFireability-13
FORMULA_NAME ShieldPPPs-PT-002A-CTLFireability-14
FORMULA_NAME ShieldPPPs-PT-002A-CTLFireability-15

=== Now, execution of the tool begins

BK_START 1591304339748

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-04 20:59:01] [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 20:59:01] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-04 20:59:01] [INFO ] Load time of PNML (sax parser for PT used): 37 ms
[2020-06-04 20:59:01] [INFO ] Transformed 65 places.
[2020-06-04 20:59:01] [INFO ] Transformed 55 transitions.
[2020-06-04 20:59:01] [INFO ] Found NUPN structural information;
[2020-06-04 20:59:01] [INFO ] Parsed PT model containing 65 places and 55 transitions in 83 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 15 ms.
Incomplete random walk after 100000 steps, including 555 resets, run finished after 162 ms. (steps per millisecond=617 ) properties seen :[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1]
// Phase 1: matrix 55 rows 65 cols
[2020-06-04 20:59:01] [INFO ] Computed 23 place invariants in 5 ms
[2020-06-04 20:59:01] [INFO ] [Real]Absence check using 23 positive place invariants in 39 ms returned unsat
Successfully simplified 1 atomic propositions for a total of 1 simplifications.
[2020-06-04 20:59:01] [INFO ] Flatten gal took : 57 ms
[2020-06-04 20:59:01] [INFO ] Flatten gal took : 9 ms
[2020-06-04 20:59:01] [INFO ] Export to MCC properties in file /home/mcc/execution/CTLFireability.sr.xml took 4 ms.
[2020-06-04 20:59:01] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 1 ms.
info: Time: 3600 - MCC
vrfy: Checking CTLFireability @ ShieldPPPs-PT-002A @ 3570 seconds

FORMULA ShieldPPPs-PT-002A-CTLFireability-01 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldPPPs-PT-002A-CTLFireability-02 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldPPPs-PT-002A-CTLFireability-06 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldPPPs-PT-002A-CTLFireability-09 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldPPPs-PT-002A-CTLFireability-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldPPPs-PT-002A-CTLFireability-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldPPPs-PT-002A-CTLFireability-07 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldPPPs-PT-002A-CTLFireability-03 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldPPPs-PT-002A-CTLFireability-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldPPPs-PT-002A-CTLFireability-04 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldPPPs-PT-002A-CTLFireability-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldPPPs-PT-002A-CTLFireability-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldPPPs-PT-002A-CTLFireability-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldPPPs-PT-002A-CTLFireability-05 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldPPPs-PT-002A-CTLFireability-08 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldPPPs-PT-002A-CTLFireability-00 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 2823
rslt: Output for CTLFireability @ ShieldPPPs-PT-002A

{
"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 20:59:02 2020
",
"timelimit": 3570
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 222
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 3,
"E": 2,
"F": 1,
"G": 1,
"U": 1,
"X": 2,
"aconj": 4,
"adisj": 0,
"aneg": 0,
"comp": 7,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 7,
"taut": 0,
"tconj": 1,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 7,
"visible_transitions": 0
},
"processed": "(E(AX(((1 <= p8) AND (1 <= p28))) U AF(((1 <= p34) AND (1 <= p61)))) OR (((1 <= p51)) AND AG(EX(((1 <= p16) AND (1 <= p31))))))",
"processed_size": 127,
"rewrites": 52
},
"net":
{
"conflict_clusters": 25,
"singleton_clusters": 0
},
"result":
{
"edges": 1580476,
"markings": 621578,
"produced_by": "CTL model checker",
"value": true
},
"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": 237
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 2,
"E": 1,
"F": 1,
"G": 0,
"U": 1,
"X": 1,
"aconj": 4,
"adisj": 1,
"aneg": 0,
"comp": 8,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 8,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 8,
"visible_transitions": 0
},
"processed": "A((EF(((1 <= p36) AND (1 <= p55))) OR ((1 <= p37) AND (1 <= p54))) U AX((((1 <= p12) AND (1 <= p14)) OR ((1 <= p6) AND (1 <= p22)))))",
"processed_size": 134,
"rewrites": 50
},
"net":
{
"conflict_clusters": 25,
"singleton_clusters": 0
},
"result":
{
"edges": 768,
"markings": 259,
"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": 254
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 2,
"F": 0,
"G": 1,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 1,
"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": "EG(EX(((p63 <= 0))))",
"processed_size": 20,
"rewrites": 49
},
"net":
{
"conflict_clusters": 25,
"singleton_clusters": 0
},
"result":
{
"edges": 259,
"markings": 259,
"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": 274
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 1,
"aconj": 1,
"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(EX(((1 <= p52))))",
"processed_size": 20,
"rewrites": 49
},
"net":
{
"conflict_clusters": 25,
"singleton_clusters": 0
},
"result":
{
"edges": 25409,
"markings": 8943,
"produced_by": "CTL model checker",
"value": false
},
"task":
{
"compoundnumber": 3,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 297
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 2,
"adisj": 2,
"aneg": 0,
"comp": 11,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 11,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 11,
"visible_transitions": 0
},
"processed": "(((p59 <= 0) OR ((1 <= p36) AND (1 <= p55))) AND ((p4 <= 0) OR (p25 <= 0) OR ((1 <= p7) AND (1 <= p9) AND (1 <= p44) AND (1 <= p63) AND (1 <= p47) AND (1 <= p62))))",
"processed_size": 167,
"rewrites": 48
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"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": 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": "((1 <= p48) AND (1 <= p50))",
"processed_size": 27,
"rewrites": 50
},
"result":
{
"edges": 276,
"markings": 274,
"produced_by": "state space /EGEF",
"value": true
},
"task":
{
"compoundnumber": 5,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving",
"visible": 1
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 2,
"problems": 2
},
"type": "possible_preservation_of_reachability",
"workflow": "stateequation"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 356
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 0,
"G": 0,
"U": 0,
"X": 1,
"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": "EX(((p13 <= 0) OR (p32 <= 0)))",
"processed_size": 31,
"rewrites": 48
},
"net":
{
"conflict_clusters": 25,
"singleton_clusters": 0
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "CTL model checker",
"value": true
},
"task":
{
"compoundnumber": 6,
"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": 4,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 324
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"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": "A (G (((p37 <= 0) OR (p53 <= 0))))",
"processed_size": 35,
"rewrites": 49
},
"result":
{
"edges": 18,
"markings": 19,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 5,
"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": 356
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"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": "((p53 <= 0))",
"processed_size": 12,
"rewrites": 50
},
"result":
{
"edges": 189,
"markings": 176,
"produced_by": "state space / EG",
"value": false
},
"task":
{
"compoundnumber": 6,
"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": 396
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 1,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 2,
"adisj": 0,
"aneg": 2,
"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": "EG(A(((p49 <= 0) OR (p58 <= 0)) R ((p8 <= 0) OR (p28 <= 0))))",
"processed_size": 63,
"rewrites": 49
},
"net":
{
"conflict_clusters": 25,
"singleton_clusters": 0
},
"result":
{
"edges": 2399406,
"markings": 979147,
"produced_by": "CTL model checker",
"value": true
},
"task":
{
"compoundnumber": 7,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 445
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 1,
"F": 2,
"G": 0,
"U": 0,
"X": 0,
"aconj": 2,
"adisj": 1,
"aneg": 0,
"comp": 7,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 7,
"taut": 0,
"tconj": 2,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 7,
"visible_transitions": 0
},
"processed": "EF((((1 <= p47) AND (1 <= p64)) AND (AF(((1 <= p5) AND (1 <= p24) AND (1 <= p27))) AND ((p4 <= 0) OR (p25 <= 0)))))",
"processed_size": 116,
"rewrites": 49
},
"net":
{
"conflict_clusters": 25,
"singleton_clusters": 0
},
"result":
{
"edges": 1238542,
"markings": 230063,
"produced_by": "CTL model checker",
"value": true
},
"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": 509
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 3,
"E": 0,
"F": 1,
"G": 2,
"U": 0,
"X": 0,
"aconj": 2,
"adisj": 3,
"aneg": 0,
"comp": 9,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 9,
"taut": 0,
"tconj": 4,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 9,
"visible_transitions": 0
},
"processed": "AF((AG(((1 <= p43) AND (1 <= p45))) AND (AG(((1 <= p52))) AND (((p62 <= 0)) AND (((p28 <= 0)) AND ((p49 <= 0) OR (p58 <= 0) OR (p38 <= 0) OR (p40 <= 0)))))))",
"processed_size": 160,
"rewrites": 50
},
"net":
{
"conflict_clusters": 25,
"singleton_clusters": 0
},
"result":
{
"edges": 543,
"markings": 259,
"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": 593
},
"formula":
{
"count":
{
"A": 3,
"E": 0,
"F": 1,
"G": 0,
"U": 2,
"X": 0,
"aconj": 4,
"adisj": 0,
"aneg": 0,
"comp": 10,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 10,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 9,
"visible_transitions": 0
},
"processed": "A(A(((1 <= p46)) U ((1 <= p48) AND (1 <= p50))) U (AF(((1 <= p49) AND (1 <= p58))) OR ((1 <= p39) AND (1 <= p59) AND (1 <= p46) AND (1 <= p43) AND (1 <= p45))))",
"processed_size": 160,
"rewrites": 50
},
"net":
{
"conflict_clusters": 25,
"singleton_clusters": 0
},
"result":
{
"edges": 268,
"markings": 266,
"produced_by": "CTL model checker",
"value": false
},
"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": 712
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 3,
"adisj": 1,
"aneg": 2,
"comp": 5,
"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": 5,
"visible_transitions": 0
},
"processed": "A ((((p39 <= 0) OR (p59 <= 0)) R (((p37 <= 0) OR (p54 <= 0)) AND ((p58 <= 0)))))",
"processed_size": 82,
"rewrites": 52
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "state space /EU",
"value": true
},
"task":
{
"compoundnumber": 11,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "eu preserving",
"visible": 3
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 3,
"problems": 2
},
"type": "universal_release",
"workflow": "stateequation"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 890
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"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": "((1 <= p39) AND (1 <= p60))",
"processed_size": 27,
"rewrites": 51
},
"result":
{
"edges": 274,
"markings": 272,
"produced_by": "state space /EGEF",
"value": false
},
"task":
{
"compoundnumber": 12,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving",
"visible": 3
},
"threads": 1,
"type": "dfs"
},
"type": "eventual_invariance",
"workflow": "stateequation"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1187
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"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": "((p49 <= 0) OR (p58 <= 0) OR (p28 <= 0))",
"processed_size": 42,
"rewrites": 50
},
"result":
{
"edges": 259,
"markings": 259,
"produced_by": "state space /EGEF",
"value": true
},
"task":
{
"compoundnumber": 13,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving",
"visible": 3
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 3,
"problems": 3
},
"type": "possible_preservation_of_reachability",
"workflow": "stateequation"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1781
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 0,
"U": 1,
"X": 0,
"aconj": 2,
"adisj": 0,
"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": "(F (((1 <= p8) AND (1 <= p29))) U ((1 <= p49) AND (1 <= p60)))",
"processed_size": 62,
"rewrites": 56
},
"result":
{
"edges": 41200,
"markings": 15612,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 14,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "existential single path",
"workflow": "product automaton"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3563
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 1,
"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": "((p46 <= 0))",
"processed_size": 12,
"rewrites": 50
},
"result":
{
"edges": 0,
"markings": 1,
"produced_by": "state space / EG",
"value": true
},
"task":
{
"compoundnumber": 15,
"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"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": null
},
"task":
{
"compoundnumber": 15,
"type": "boolean"
}
},

{
"child":
[

{
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 1,
"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": "((p46 <= 0))",
"processed_size": 12,
"rewrites": 50
},
"result":
{
"edges": 0,
"markings": 1,
"produced_by": "state space / EG",
"value": true
},
"task":
{
"compoundnumber": 16,
"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"
}
},

{
"formula":
{
"count":
{
"A": 1,
"E": 1,
"F": 1,
"G": 1,
"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": "AF(EG(((1 <= p38) AND (1 <= p40))))",
"processed_size": 35,
"rewrites": 49
},
"net":
{
"conflict_clusters": 25,
"singleton_clusters": 0
},
"result":
{
"edges": 827418343,
"markings": 201401456,
"produced_by": "CTL model checker",
"value": false
},
"task":
{
"compoundnumber": 17,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
}
],
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 16,
"type": "boolean"
}
}
],
"exit":
{
"error": null,
"memory": 44068,
"runtime": 747.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "CTLFireability.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "(A(F(*)) AND A(F(E(G(**))))) : (E((A(X(**)) U A(F(**)))) OR (** AND A(G(E(X(**)))))) : A(((E(F(**)) OR **) U A(X(**)))) : E(G(A((* R *)))) : A(F((A(G(**)) AND (A(G(**)) AND (** AND (** AND **)))))) : E(G(E(F(*)))) : E(G(E(X(**)))) : A(F(**)) : E((E(G(*)) R *)) : A(F(E(X(**)))) : E(F((** AND (A(F(**)) AND **)))) : A((A((** U **)) U (A(F(**)) OR **))) : A(F(A(G(*)))) : A((* R *)) : (E(G(E(F(**)))) AND (E(X(*)) AND (** AND **))) : A(G(*))"
},
"net":
{
"arcs": 206,
"conflict_clusters": 25,
"places": 65,
"places_significant": 42,
"singleton_clusters": 0,
"transitions": 55
},
"result":
{
"preliminary_value": "no yes no yes no yes yes no yes no yes no no yes yes no ",
"value": "no yes no yes no yes yes no yes no yes no no yes 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: 120/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 2080
lola: finding significant places
lola: 65 places, 55 transitions, 42 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: LP says that atomic proposition is always true: (p46 <= 1)
lola: LP says that atomic proposition is always true: (p38 <= 1)
lola: LP says that atomic proposition is always true: (p40 <= 1)
lola: LP says that atomic proposition is always true: (p8 <= 1)
lola: LP says that atomic proposition is always true: (p28 <= 1)
lola: LP says that atomic proposition is always true: (p34 <= 1)
lola: LP says that atomic proposition is always true: (p61 <= 1)
lola: LP says that atomic proposition is always true: (p51 <= 1)
lola: LP says that atomic proposition is always true: (p16 <= 1)
lola: LP says that atomic proposition is always true: (p31 <= 1)
lola: LP says that atomic proposition is always true: (p36 <= 1)
lola: LP says that atomic proposition is always true: (p55 <= 1)
lola: LP says that atomic proposition is always true: (p37 <= 1)
lola: LP says that atomic proposition is always true: (p54 <= 1)
lola: LP says that atomic proposition is always true: (p12 <= 1)
lola: LP says that atomic proposition is always true: (p14 <= 1)
lola: LP says that atomic proposition is always true: (p6 <= 1)
lola: LP says that atomic proposition is always true: (p22 <= 1)
lola: LP says that atomic proposition is always true: (p49 <= 1)
lola: LP says that atomic proposition is always true: (p58 <= 1)
lola: LP says that atomic proposition is always true: (p8 <= 1)
lola: LP says that atomic proposition is always true: (p28 <= 1)
lola: LP says that atomic proposition is always true: (p43 <= 1)
lola: LP says that atomic proposition is always true: (p45 <= 1)
lola: LP says that atomic proposition is always true: (p52 <= 1)
lola: LP says that atomic proposition is always true: (p62 <= 1)
lola: LP says that atomic proposition is always true: (p28 <= 1)
lola: LP says that atomic proposition is always true: (p49 <= 1)
lola: LP says that atomic proposition is always true: (p58 <= 1)
lola: LP says that atomic proposition is always true: (p38 <= 1)
lola: LP says that atomic proposition is always true: (p40 <= 1)
lola: LP says that atomic proposition is always true: (p49 <= 1)
lola: LP says that atomic proposition is always true: (p58 <= 1)
lola: LP says that atomic proposition is always true: (p28 <= 1)
lola: LP says that atomic proposition is always true: (p63 <= 1)
lola: LP says that atomic proposition is always true: (p53 <= 1)
lola: LP says that atomic proposition is always true: (p8 <= 1)
lola: LP says that atomic proposition is always true: (p29 <= 1)
lola: LP says that atomic proposition is always true: (p49 <= 1)
lola: LP says that atomic proposition is always true: (p60 <= 1)
lola: LP says that atomic proposition is always true: (p52 <= 1)
lola: LP says that atomic proposition is always true: (p47 <= 1)
lola: LP says that atomic proposition is always true: (p64 <= 1)
lola: LP says that atomic proposition is always true: (p5 <= 1)
lola: LP says that atomic proposition is always true: (p24 <= 1)
lola: LP says that atomic proposition is always true: (p27 <= 1)
lola: LP says that atomic proposition is always true: (p4 <= 1)
lola: LP says that atomic proposition is always true: (p25 <= 1)
lola: LP says that atomic proposition is always true: (p46 <= 1)
lola: LP says that atomic proposition is always true: (p48 <= 1)
lola: LP says that atomic proposition is always true: (p50 <= 1)
lola: LP says that atomic proposition is always true: (p49 <= 1)
lola: LP says that atomic proposition is always true: (p58 <= 1)
lola: LP says that atomic proposition is always true: (p39 <= 1)
lola: LP says that atomic proposition is always true: (p59 <= 1)
lola: LP says that atomic proposition is always true: (p46 <= 1)
lola: LP says that atomic proposition is always true: (p43 <= 1)
lola: LP says that atomic proposition is always true: (p45 <= 1)
lola: LP says that atomic proposition is always true: (p39 <= 1)
lola: LP says that atomic proposition is always true: (p60 <= 1)
lola: LP says that atomic proposition is always true: (p39 <= 1)
lola: LP says that atomic proposition is always true: (p59 <= 1)
lola: LP says that atomic proposition is always true: (p37 <= 1)
lola: LP says that atomic proposition is always true: (p54 <= 1)
lola: LP says that atomic proposition is always true: (p58 <= 1)
lola: LP says that atomic proposition is always true: (p48 <= 1)
lola: LP says that atomic proposition is always true: (p50 <= 1)
lola: LP says that atomic proposition is always true: (p13 <= 1)
lola: LP says that atomic proposition is always true: (p32 <= 1)
lola: LP says that atomic proposition is always true: (p59 <= 1)
lola: LP says that atomic proposition is always true: (p36 <= 1)
lola: LP says that atomic proposition is always true: (p55 <= 1)
lola: LP says that atomic proposition is always true: (p4 <= 1)
lola: LP says that atomic proposition is always true: (p25 <= 1)
lola: LP says that atomic proposition is always true: (p7 <= 1)
lola: LP says that atomic proposition is always true: (p9 <= 1)
lola: LP says that atomic proposition is always true: (p44 <= 1)
lola: LP says that atomic proposition is always true: (p63 <= 1)
lola: LP says that atomic proposition is always true: (p47 <= 1)
lola: LP says that atomic proposition is always true: (p62 <= 1)
lola: LP says that atomic proposition is always true: (p37 <= 1)
lola: LP says that atomic proposition is always true: (p53 <= 1)
lola: (NOT(E (G (((p46 <= 0))))) AND A (F (E (G (((1 <= p38) AND (1 <= p40))))))) : (E ((A (X (((1 <= p8) AND (1 <= p28)))) U A (F (((1 <= p34) AND (1 <= p61)))))) OR (((1 <= p51)) AND A (G (E (X (((1 <= p16) AND (1 <= p31)))))))) : A (((E (F (((1 <= p36) AND (1 <= p55)))) OR ((1 <= p37) AND (1 <= p54))) U A (X ((((1 <= p12) AND (1 <= p14)) OR ((1 <= p6) AND (1 <= p22))))))) : NOT(A (F (E ((((1 <= p49) AND (1 <= p58)) U ((1 <= p8) AND (1 <= p28))))))) : A (F (((((A (G (((1 <= p43) AND (1 <= p45)))) AND A (G (((1 <= p52))))) AND ((p62 <= 0))) AND ((p28 <= 0))) AND ((p49 <= 0) OR (p58 <= 0) OR (p38 <= 0) OR (p40 <= 0))))) : NOT(A (F (A (G (((1 <= p49) AND (1 <= p58) AND (1 <= p28))))))) : E (G (E (X (((p63 <= 0)))))) : A (F (((1 <= p53)))) : NOT(A ((A (F (((1 <= p8) AND (1 <= p29)))) U ((1 <= p49) AND (1 <= p60))))) : A (F (E (X (((1 <= p52)))))) : E (F (((((1 <= p47) AND (1 <= p64)) AND A (F (((1 <= p5) AND (1 <= p24) AND (1 <= p27))))) AND ((p4 <= 0) OR (p25 <= 0))))) : A ((A ((((1 <= p46)) U ((1 <= p48) AND (1 <= p50)))) U (A (F (((1 <= p49) AND (1 <= p58)))) OR ((1 <= p39) AND (1 <= p59) AND (1 <= p46) AND (1 <= p43) AND (1 <= p45))))) : A (F (NOT(E (F (((1 <= p39) AND (1 <= p60))))))) : (E (G ((0 <= 0))) AND NOT(E ((((1 <= p39) AND (1 <= p59)) U (((1 <= p37) AND (1 <= p54)) OR ((1 <= p58))))))) : (((E (G (E (F (((1 <= p48) AND (1 <= p50)))))) AND NOT(A (X (((1 <= p13) AND (1 <= p32)))))) AND ((p59 <= 0) OR ((1 <= p36) AND (1 <= p55)))) AND ((p4 <= 0) OR (p25 <= 0) OR ((1 <= p7) AND (1 <= p9) AND (1 <= p44) AND (1 <= p63) AND (1 <= p47) AND (1 <= p62)))) : NOT(E (F (((1 <= p37) AND (1 <= p53)))))
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:338
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:338
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: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:160
lola: rewrite Frontend/Parser/formula_rewrite.k:148
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:338
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:116
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:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:326
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 222 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E ((A (X (((1 <= p8) AND (1 <= p28)))) U A (F (((1 <= p34) AND (1 <= p61)))))) OR (((1 <= p51)) AND A (G (E (X (((1 <= p16) AND (1 <= p31))))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:812
lola: rewrite Frontend/Parser/formula_rewrite.k:811
lola: rewrite Frontend/Parser/formula_rewrite.k:809
lola: rewrite Frontend/Parser/formula_rewrite.k:807
lola: rewrite Frontend/Parser/formula_rewrite.k:813
lola: processed formula: (E(AX(((1 <= p8) AND (1 <= p28))) U AF(((1 <= p34) AND (1 <= p61)))) OR (((1 <= p51)) AND AG(EX(((1 <= p16) AND (1 <= p31))))))
lola: processed formula length: 127
lola: 52 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: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 621578 markings, 1580476 edges
lola: ========================================
lola: subprocess 1 will run for 237 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (((E (F (((1 <= p36) AND (1 <= p55)))) OR ((1 <= p37) AND (1 <= p54))) U A (X ((((1 <= p12) AND (1 <= p14)) OR ((1 <= p6) AND (1 <= p22)))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:806
lola: rewrite Frontend/Parser/formula_rewrite.k:812
lola: rewrite Frontend/Parser/formula_rewrite.k:814
lola: processed formula: A((EF(((1 <= p36) AND (1 <= p55))) OR ((1 <= p37) AND (1 <= p54))) U AX((((1 <= p12) AND (1 <= p14)) OR ((1 <= p6) AND (1 <= p22)))))
lola: processed formula length: 134
lola: 50 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: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 259 markings, 768 edges
lola: ========================================
lola: subprocess 2 will run for 254 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G (E (X (((p63 <= 0))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:807
lola: rewrite Frontend/Parser/formula_rewrite.k:808
lola: processed formula: EG(EX(((p63 <= 0))))
lola: processed formula length: 20
lola: 49 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: 259 markings, 259 edges
lola: ========================================
lola: subprocess 3 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (E (X (((1 <= p52))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:807
lola: rewrite Frontend/Parser/formula_rewrite.k:811
lola: processed formula: AF(EX(((1 <= p52))))
lola: processed formula length: 20
lola: 49 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: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 8943 markings, 25409 edges
lola: ========================================
lola: subprocess 4 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E (G (E (F (((1 <= p48) AND (1 <= p50)))))) AND (E (X (((p13 <= 0) OR (p32 <= 0)))) AND (((p59 <= 0) OR ((1 <= p36) AND (1 <= p55))) AND ((p4 <= 0) OR (p25 <= 0) OR ((1 <= p7) AND (1 <= p9) AND (1 <= p44) AND (1 <= p63) AND (1 <= p47) AND (1 <= p62))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 4 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (((p59 <= 0) OR ((1 <= p36) AND (1 <= p55))) AND ((p4 <= 0) OR (p25 <= 0) OR ((1 <= p7) AND (1 <= p9) AND (1 <= p44) AND (1 <= p63) AND (1 <= p47) AND (1 <= p62))))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: rewrite Frontend/Parser/formula_rewrite.k:793
lola: processed formula: (((p59 <= 0) OR ((1 <= p36) AND (1 <= p55))) AND ((p4 <= 0) OR (p25 <= 0) OR ((1 <= p7) AND (1 <= p9) AND (1 <= p44) AND (1 <= p63) AND (1 <= p47) AND (1 <= p62))))
lola: processed formula length: 167
lola: 48 rewrites
lola: closed formula file CTLFireability.xml
lola: processed formula with 11 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 5 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G (E (F (((1 <= p48) AND (1 <= p50))))))
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: ((1 <= p48) AND (1 <= p50))
lola: processed formula length: 27
lola: 50 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: ((p48 <= 0) OR (p50 <= 0))
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 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: SUBRESULT
lola: result: yes
lola: produced by: state space /EGEF
lola: Reachability of the predicate is possibly preserved.
lola: 274 markings, 276 edges
lola: formula 1: ((1 <= p48) AND (1 <= p50))
lola: state equation task get result unparse finished id 1
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: ========================================
lola: subprocess 6 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (X (((p13 <= 0) OR (p32 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:807
lola: processed formula: EX(((p13 <= 0) OR (p32 <= 0)))
lola: processed formula length: 31
lola: 48 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 0 significant temporal operators and needs 0 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: 0 markings, 0 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 5 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((p37 <= 0) OR (p53 <= 0))))
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:788
lola: processed formula: A (G (((p37 <= 0) OR (p53 <= 0))))
lola: processed formula length: 35
lola: 49 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:721
lola: rewrite Frontend/Parser/formula_rewrite.k:788
lola: SUBRESULT
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((1 <= p37) AND (1 <= p53))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 19 markings, 18 edges
lola: ========================================
lola: subprocess 6 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (((1 <= p53))))
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: ((p53 <= 0))
lola: processed formula length: 12
lola: 50 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: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 <= p53))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space / EG
lola: The predicate does not eventually occur.
lola: 176 markings, 189 edges
lola: ========================================
lola: subprocess 7 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G (A ((((p49 <= 0) OR (p58 <= 0)) R ((p8 <= 0) OR (p28 <= 0))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:815
lola: rewrite Frontend/Parser/formula_rewrite.k:808
lola: processed formula: EG(A(((p49 <= 0) OR (p58 <= 0)) R ((p8 <= 0) OR (p28 <= 0))))
lola: processed formula length: 63
lola: 49 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: 979147 markings, 2399406 edges
lola: ========================================
lola: subprocess 8 will run for 445 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((((1 <= p47) AND (1 <= p64)) AND (A (F (((1 <= p5) AND (1 <= p24) AND (1 <= p27)))) AND ((p4 <= 0) OR (p25 <= 0))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:811
lola: rewrite Frontend/Parser/formula_rewrite.k:806
lola: processed formula: EF((((1 <= p47) AND (1 <= p64)) AND (AF(((1 <= p5) AND (1 <= p24) AND (1 <= p27))) AND ((p4 <= 0) OR (p25 <= 0)))))
lola: processed formula length: 116
lola: 49 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: 230063 markings, 1238542 edges
lola: ========================================
lola: subprocess 9 will run for 509 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F ((A (G (((1 <= p43) AND (1 <= p45)))) AND (A (G (((1 <= p52)))) AND (((p62 <= 0)) AND (((p28 <= 0)) AND ((p49 <= 0) OR (p58 <= 0) OR (p38 <= 0) OR (p40 <= 0))))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:813
lola: rewrite Frontend/Parser/formula_rewrite.k:813
lola: rewrite Frontend/Parser/formula_rewrite.k:811
lola: processed formula: AF((AG(((1 <= p43) AND (1 <= p45))) AND (AG(((1 <= p52))) AND (((p62 <= 0)) AND (((p28 <= 0)) AND ((p49 <= 0) OR (p58 <= 0) OR (p38 <= 0) OR (p40 <= 0)))))))
lola: processed formula length: 160
lola: 50 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: 259 markings, 543 edges
lola: ========================================
lola: subprocess 10 will run for 593 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A ((A ((((1 <= p46)) U ((1 <= p48) AND (1 <= p50)))) U (A (F (((1 <= p49) AND (1 <= p58)))) OR ((1 <= p39) AND (1 <= p59) AND (1 <= p46) AND (1 <= p43) AND (1 <= p45)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:814
lola: rewrite Frontend/Parser/formula_rewrite.k:811
lola: rewrite Frontend/Parser/formula_rewrite.k:814
lola: processed formula: A(A(((1 <= p46)) U ((1 <= p48) AND (1 <= p50))) U (AF(((1 <= p49) AND (1 <= p58))) OR ((1 <= p39) AND (1 <= p59) AND (1 <= p46) AND (1 <= p43) AND (1 <= p45))))
lola: processed formula length: 160
lola: 50 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: 266 markings, 268 edges
lola: ========================================
lola: subprocess 11 will run for 712 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A ((((p39 <= 0) OR (p59 <= 0)) R (((p37 <= 0) OR (p54 <= 0)) AND ((p58 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking universal release
lola: rewrite Frontend/Parser/formula_rewrite.k:619
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: rewrite Frontend/Parser/formula_rewrite.k:737
lola: rewrite Frontend/Parser/formula_rewrite.k:693
lola: rewrite Frontend/Parser/formula_rewrite.k:788
lola: rewrite Frontend/Parser/formula_rewrite.k:788
lola: processed formula: A ((((p39 <= 0) OR (p59 <= 0)) R (((p37 <= 0) OR (p54 <= 0)) AND ((p58 <= 0)))))
lola: processed formula length: 82
lola: 52 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 /EU)
lola: state space: using reachability graph (EU version) (--search=depth)
lola: state space: using eu preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:711
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: (((1 <= p37) AND (1 <= p54)) OR ((1 <= p58)))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 3 literals and 2 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space /EU
lola: Predicate Phi releases Predicate Psi on all paths.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 12 will run for 890 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (A (G (((p39 <= 0) OR (p60 <= 0))))))
lola: ========================================
lola: SUBTASK
lola: checking eventual invariance
lola: rewrite Frontend/Parser/formula_rewrite.k:594
lola: rewrite Frontend/Parser/formula_rewrite.k:629
lola: rewrite Frontend/Parser/formula_rewrite.k:758
lola: rewrite Frontend/Parser/formula_rewrite.k:788
lola: processed formula: ((1 <= p39) AND (1 <= p60))
lola: processed formula length: 27
lola: 51 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: SUBRESULT
lola: result: no
lola: produced by: state space /EGEF
lola: The predicate is not eventually invariant.
lola: 272 markings, 274 edges
lola: ========================================
lola: subprocess 13 will run for 1187 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G (E (F (((p49 <= 0) OR (p58 <= 0) OR (p28 <= 0))))))
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: ((p49 <= 0) OR (p58 <= 0) OR (p28 <= 0))
lola: processed formula length: 42
lola: 50 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:788
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((1 <= p49) AND (1 <= p58) AND (1 <= p28))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 3 literals and 1 conjunctive subformulas
lola: state equation task get result started, id 1
lola: SUBRESULT
lola: result: yes
lola: produced by: state space /EGEF
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: state equation task get result rewrite finished id 1
lola: Reachability of the predicate is possibly preserved.
lola: state equation task get result unparse finished++ id 1
lola: formula 1: ((p49 <= 0) OR (p58 <= 0) OR (p28 <= 0))
lola: state equation task get result unparse finished id 1
lola: 259 markings, 259 edges
lola: state equation: Generated DNF with 3 literals and 3 conjunctive subformulas
lola: state equation: write sara problem file to CTLFireability-13-1.sara
lola: ========================================
lola: subprocess 14 will run for 1781 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E ((E (G (((p8 <= 0) OR (p29 <= 0)))) R ((p49 <= 0) OR (p60 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking an existential CTL formula with single witness path (use LTL...)
lola: rewrite Frontend/Parser/formula_rewrite.k:658
lola: rewrite Frontend/Parser/formula_rewrite.k:659
lola: rewrite Frontend/Parser/formula_rewrite.k:664
lola: rewrite Frontend/Parser/formula_rewrite.k:659
lola: rewrite Frontend/Parser/formula_rewrite.k:662
lola: rewrite Frontend/Parser/formula_rewrite.k:674
lola: rewrite Frontend/Parser/formula_rewrite.k:674
lola: rewrite Frontend/Parser/formula_rewrite.k:679
lola: rewrite Frontend/Parser/formula_rewrite.k:679
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: (F (((1 <= p8) AND (1 <= p29))) U ((1 <= p49) AND (1 <= p60)))
lola: processed formula length: 62
lola: 56 rewrites
lola: closed formula file CTLFireability.xml
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The existential single path CTL formula holds.
lola: 15612 markings, 41200 edges
lola: ========================================
lola: subprocess 15 will run for 3563 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (F (((1 <= p46)))) AND A (F (E (G (((1 <= p38) AND (1 <= p40)))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 15 will run for 3563 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (((1 <= p46))))
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:788
lola: processed formula: ((p46 <= 0))
lola: processed formula length: 12
lola: 50 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: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 <= p46))
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-15-0.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space / EG
lola: The predicate eventually occurs.
lola: 1 markings, 0 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: (A (F (((1 <= p46)))) AND A (F (E (G (((1 <= p38) AND (1 <= p40)))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: ...considering subproblem: A (F (((1 <= p46))))
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:788
lola: processed formula: ((p46 <= 0))
lola: processed formula length: 12
lola: 50 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:700
lola: SUBRESULT
lola: result: yes
lola: produced by: state space / EG
lola: The predicate eventually occurs.
lola: 1 markings, 0 edges
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((1 <= p46))
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-16-0.sara
lola: ========================================
lola: ========================================
lola: ...considering subproblem: A (F (E (G (((1 <= p38) AND (1 <= p40))))))
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 <= p38) AND (1 <= p40))))
lola: processed formula length: 35
lola: 49 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: 2061271 markings, 6713106 edges, 412254 markings/sec, 0 secs
lola: 3909233 markings, 13044434 edges, 369592 markings/sec, 5 secs
lola: 5785165 markings, 19519164 edges, 375186 markings/sec, 10 secs
lola: 7533755 markings, 26195733 edges, 349718 markings/sec, 15 secs
lola: 9218346 markings, 32696751 edges, 336918 markings/sec, 20 secs
lola: 10857006 markings, 38838340 edges, 327732 markings/sec, 25 secs
lola: 12255567 markings, 44497106 edges, 279712 markings/sec, 30 secs
lola: 13655706 markings, 50149380 edges, 280028 markings/sec, 35 secs
lola: 15042193 markings, 55624385 edges, 277297 markings/sec, 40 secs
lola: 16593488 markings, 61797472 edges, 310259 markings/sec, 45 secs
lola: 18069225 markings, 68016604 edges, 295147 markings/sec, 50 secs
lola: 19609998 markings, 74174902 edges, 308155 markings/sec, 55 secs
lola: 21190769 markings, 80465569 edges, 316154 markings/sec, 60 secs
lola: 22937442 markings, 87172907 edges, 349335 markings/sec, 65 secs
lola: 24296043 markings, 92662526 edges, 271720 markings/sec, 70 secs
lola: 25674802 markings, 98377508 edges, 275752 markings/sec, 75 secs
lola: 27199208 markings, 104354492 edges, 304881 markings/sec, 80 secs
lola: 28669683 markings, 110372036 edges, 294095 markings/sec, 85 secs
lola: 30137785 markings, 116323863 edges, 293620 markings/sec, 90 secs
lola: 31557312 markings, 122207073 edges, 283905 markings/sec, 95 secs
lola: 33005707 markings, 128042227 edges, 289679 markings/sec, 100 secs
lola: 34551692 markings, 133824186 edges, 309197 markings/sec, 105 secs
lola: 35925524 markings, 139293545 edges, 274766 markings/sec, 110 secs
lola: 37304317 markings, 145028459 edges, 275759 markings/sec, 115 secs
lola: 38881996 markings, 151149218 edges, 315536 markings/sec, 120 secs
lola: 40336298 markings, 156844059 edges, 290860 markings/sec, 125 secs
lola: 41813608 markings, 162719660 edges, 295462 markings/sec, 130 secs
lola: 43415690 markings, 168761788 edges, 320416 markings/sec, 135 secs
lola: 44616255 markings, 173697783 edges, 240113 markings/sec, 140 secs
lola: 45834383 markings, 178577002 edges, 243626 markings/sec, 145 secs
lola: 47102610 markings, 183821886 edges, 253645 markings/sec, 150 secs
lola: 48460017 markings, 189346150 edges, 271481 markings/sec, 155 secs
lola: 49737664 markings, 194543017 edges, 255529 markings/sec, 160 secs
lola: 51011694 markings, 199728402 edges, 254806 markings/sec, 165 secs
lola: 52220318 markings, 204611424 edges, 241725 markings/sec, 170 secs
lola: 53654842 markings, 209982178 edges, 286905 markings/sec, 175 secs
lola: 54942445 markings, 215153635 edges, 257521 markings/sec, 180 secs
lola: 56241123 markings, 220358035 edges, 259736 markings/sec, 185 secs
lola: 57516311 markings, 225840937 edges, 255038 markings/sec, 190 secs
lola: 58916319 markings, 231497027 edges, 280002 markings/sec, 195 secs
lola: 60249173 markings, 236913511 edges, 266571 markings/sec, 200 secs
lola: 61605145 markings, 242397123 edges, 271194 markings/sec, 205 secs
lola: 62842152 markings, 247592798 edges, 247401 markings/sec, 210 secs
lola: 64175180 markings, 253086582 edges, 266606 markings/sec, 215 secs
lola: 65512355 markings, 258773241 edges, 267435 markings/sec, 220 secs
lola: 66993551 markings, 264774423 edges, 296239 markings/sec, 225 secs
lola: 68445867 markings, 270601498 edges, 290463 markings/sec, 230 secs
lola: 69763887 markings, 276202062 edges, 263604 markings/sec, 235 secs
lola: 71126213 markings, 281771218 edges, 272465 markings/sec, 240 secs
lola: 72429428 markings, 287296071 edges, 260643 markings/sec, 245 secs
lola: 73850117 markings, 293208014 edges, 284138 markings/sec, 250 secs
lola: 75098918 markings, 298285366 edges, 249760 markings/sec, 255 secs
lola: 76335844 markings, 303437619 edges, 247385 markings/sec, 260 secs
lola: 77713550 markings, 308787213 edges, 275541 markings/sec, 265 secs
lola: 79049916 markings, 313972308 edges, 267273 markings/sec, 270 secs
lola: 80241879 markings, 318858508 edges, 238393 markings/sec, 275 secs
lola: 81598598 markings, 324366809 edges, 271344 markings/sec, 280 secs
lola: 82778426 markings, 329372624 edges, 235966 markings/sec, 285 secs
lola: 84009912 markings, 334475318 edges, 246297 markings/sec, 290 secs
lola: 85279389 markings, 339856006 edges, 253895 markings/sec, 295 secs
lola: 86722499 markings, 345481426 edges, 288622 markings/sec, 300 secs
lola: 88064108 markings, 350671950 edges, 268322 markings/sec, 305 secs
lola: 89616416 markings, 356532661 edges, 310462 markings/sec, 310 secs
lola: 91273263 markings, 362980241 edges, 331369 markings/sec, 315 secs
lola: 92895874 markings, 369192449 edges, 324522 markings/sec, 320 secs
lola: 94303079 markings, 374804374 edges, 281441 markings/sec, 325 secs
lola: 95670157 markings, 380403608 edges, 273416 markings/sec, 330 secs
lola: 96940487 markings, 386300208 edges, 254066 markings/sec, 335 secs
lola: 98285422 markings, 391963136 edges, 268987 markings/sec, 340 secs
lola: 99571557 markings, 397713641 edges, 257227 markings/sec, 345 secs
lola: 100889105 markings, 403523872 edges, 263510 markings/sec, 350 secs
lola: 102219877 markings, 409396633 edges, 266154 markings/sec, 355 secs
lola: 103612551 markings, 415343947 edges, 278535 markings/sec, 360 secs
lola: 104852313 markings, 420940558 edges, 247952 markings/sec, 365 secs
lola: 106078096 markings, 426737224 edges, 245157 markings/sec, 370 secs
lola: 107340542 markings, 432416995 edges, 252489 markings/sec, 375 secs
lola: 108637131 markings, 438062446 edges, 259318 markings/sec, 380 secs
lola: 110008554 markings, 443792589 edges, 274285 markings/sec, 385 secs
lola: 111566519 markings, 449739096 edges, 311593 markings/sec, 390 secs
lola: 113034030 markings, 455718299 edges, 293502 markings/sec, 395 secs
lola: 114395150 markings, 461060134 edges, 272224 markings/sec, 400 secs
lola: 115627749 markings, 466055894 edges, 246520 markings/sec, 405 secs
lola: 116829112 markings, 470925166 edges, 240273 markings/sec, 410 secs
lola: 118074943 markings, 475931462 edges, 249166 markings/sec, 415 secs
lola: 119297738 markings, 480871030 edges, 244559 markings/sec, 420 secs
lola: 120524970 markings, 485932964 edges, 245446 markings/sec, 425 secs
lola: 121786769 markings, 491495521 edges, 252360 markings/sec, 430 secs
lola: 122905316 markings, 496500937 edges, 223709 markings/sec, 435 secs
lola: 124019654 markings, 501488208 edges, 222868 markings/sec, 440 secs
lola: 125080322 markings, 506313219 edges, 212134 markings/sec, 445 secs
lola: 126530607 markings, 512056414 edges, 290057 markings/sec, 450 secs
lola: 128052918 markings, 517893344 edges, 304462 markings/sec, 455 secs
lola: 129229643 markings, 522553020 edges, 235345 markings/sec, 460 secs
lola: 130493137 markings, 527848094 edges, 252699 markings/sec, 465 secs
lola: 131762591 markings, 532912028 edges, 253891 markings/sec, 470 secs
lola: 132931540 markings, 537852185 edges, 233790 markings/sec, 475 secs
lola: 134254966 markings, 543285706 edges, 264685 markings/sec, 480 secs
lola: 135599875 markings, 548824784 edges, 268982 markings/sec, 485 secs
lola: 136954966 markings, 554403790 edges, 271018 markings/sec, 490 secs
lola: 138170892 markings, 559498792 edges, 243185 markings/sec, 495 secs
lola: 139342712 markings, 564612432 edges, 234364 markings/sec, 500 secs
lola: 140423229 markings, 569692443 edges, 216103 markings/sec, 505 secs
lola: 141540272 markings, 574637184 edges, 223409 markings/sec, 510 secs
lola: 142877434 markings, 580166752 edges, 267432 markings/sec, 515 secs
lola: 144222448 markings, 585842278 edges, 269003 markings/sec, 520 secs
lola: 145602612 markings, 591526166 edges, 276033 markings/sec, 525 secs
lola: 146870989 markings, 596882700 edges, 253675 markings/sec, 530 secs
lola: 148131348 markings, 602361391 edges, 252072 markings/sec, 535 secs
lola: 149513678 markings, 608134335 edges, 276466 markings/sec, 540 secs
lola: 150874781 markings, 614017022 edges, 272221 markings/sec, 545 secs
lola: 152182709 markings, 619797264 edges, 261586 markings/sec, 550 secs
lola: 153458993 markings, 625243172 edges, 255257 markings/sec, 555 secs
lola: 154741177 markings, 630405269 edges, 256437 markings/sec, 560 secs
lola: 156066840 markings, 635817205 edges, 265133 markings/sec, 565 secs
lola: 157406507 markings, 641150317 edges, 267933 markings/sec, 570 secs
lola: 158720381 markings, 646514823 edges, 262775 markings/sec, 575 secs
lola: 160039720 markings, 651774728 edges, 263868 markings/sec, 580 secs
lola: 161403948 markings, 657124901 edges, 272846 markings/sec, 585 secs
lola: 162762625 markings, 662575806 edges, 271735 markings/sec, 590 secs
lola: 164068974 markings, 668011447 edges, 261270 markings/sec, 595 secs
lola: 165414939 markings, 673338732 edges, 269193 markings/sec, 600 secs
lola: 166610722 markings, 678246521 edges, 239157 markings/sec, 605 secs
lola: 167804964 markings, 683129559 edges, 238848 markings/sec, 610 secs
lola: 169247855 markings, 689128488 edges, 288578 markings/sec, 615 secs
lola: 170647552 markings, 695313743 edges, 279939 markings/sec, 620 secs
lola: 171926385 markings, 701043190 edges, 255767 markings/sec, 625 secs
lola: 173170200 markings, 706530858 edges, 248763 markings/sec, 630 secs
lola: 174438224 markings, 712122750 edges, 253605 markings/sec, 635 secs
lola: 175668447 markings, 717763663 edges, 246045 markings/sec, 640 secs
lola: 176880956 markings, 723291996 edges, 242502 markings/sec, 645 secs
lola: 178180560 markings, 729028878 edges, 259921 markings/sec, 650 secs
lola: 179407367 markings, 734803026 edges, 245361 markings/sec, 655 secs
lola: 180543551 markings, 740541540 edges, 227237 markings/sec, 660 secs
lola: 181742147 markings, 745949519 edges, 239719 markings/sec, 665 secs
lola: 182852321 markings, 751058726 edges, 222035 markings/sec, 670 secs
lola: 183987612 markings, 756318946 edges, 227058 markings/sec, 675 secs
lola: 185344543 markings, 761951847 edges, 271386 markings/sec, 680 secs
lola: 186717564 markings, 767695666 edges, 274604 markings/sec, 685 secs
lola: 188043510 markings, 773186061 edges, 265189 markings/sec, 690 secs
lola: 189471787 markings, 779023903 edges, 285655 markings/sec, 695 secs
lola: 190801205 markings, 784574593 edges, 265884 markings/sec, 700 secs
lola: 192337476 markings, 790629358 edges, 307254 markings/sec, 705 secs
lola: 193942445 markings, 797121510 edges, 320994 markings/sec, 710 secs
lola: 195405335 markings, 803237076 edges, 292578 markings/sec, 715 secs
lola: 196805545 markings, 809177365 edges, 280042 markings/sec, 720 secs
lola: 198509792 markings, 815700322 edges, 340849 markings/sec, 725 secs
lola: 199988876 markings, 821779246 edges, 295817 markings/sec, 730 secs
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 201401456 markings, 827418343 edges
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: ========================================
lola: RESULT
lola:
SUMMARY: no yes no yes no yes yes no yes no yes no no yes yes no
lola:
preliminary result: no yes no yes no yes yes no yes no yes no no yes yes no
lola: memory consumption: 44068 KB
lola: time consumption: 747 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="ShieldPPPs-PT-002A"
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 ShieldPPPs-PT-002A, 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-159033477400412"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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