fond

jQuery Multi Level CSS Menu Css3Menu.com

Model Checking Contest 2020
10th edition, Paris, France, June 23, 2020
Execution of r186-oct2-158987938700260
Last Updated
Jun 28, 2020

About the Execution of ITS-LoLa for RwMutex-PT-r0010w0050

Execution Summary
Max Memory
Used (MB)		 Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
15735.900 3600000.00 12760.00 96.40 TTTFFTFTTTFFFFFF normal

Execution Chart

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

Trace from the execution

Formatting '/data/fko/mcc2020-input.r186-oct2-158987938700260.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fko/mcc2020-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itslola
Input is RwMutex-PT-r0010w0050, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r186-oct2-158987938700260
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 260K
-rw-r--r-- 1 mcc users 3.9K Apr 12 11:01 CTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Apr 12 11:01 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 11 12:08 CTLFireability.txt
-rw-r--r-- 1 mcc users 13K Apr 11 12:08 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 24 05:38 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.1K Mar 24 05:38 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.0K Apr 14 12:50 LTLCardinality.txt
-rw-r--r-- 1 mcc users 21K Apr 28 14:02 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Apr 14 12:50 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 28 14:02 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Apr 10 16:35 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 18K Apr 10 16:35 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 9 23:01 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 11K Apr 9 23:01 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 10 22:28 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 10 22:28 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 24 05:38 equiv_col
-rw-r--r-- 1 mcc users 11 Mar 24 05:38 instance
-rw-r--r-- 1 mcc users 6 Mar 24 05:38 iscolored
-rw-r--r-- 1 mcc users 88K Mar 24 05:38 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 RwMutex-PT-r0010w0050-CTLFireability-00
FORMULA_NAME RwMutex-PT-r0010w0050-CTLFireability-01
FORMULA_NAME RwMutex-PT-r0010w0050-CTLFireability-02
FORMULA_NAME RwMutex-PT-r0010w0050-CTLFireability-03
FORMULA_NAME RwMutex-PT-r0010w0050-CTLFireability-04
FORMULA_NAME RwMutex-PT-r0010w0050-CTLFireability-05
FORMULA_NAME RwMutex-PT-r0010w0050-CTLFireability-06
FORMULA_NAME RwMutex-PT-r0010w0050-CTLFireability-07
FORMULA_NAME RwMutex-PT-r0010w0050-CTLFireability-08
FORMULA_NAME RwMutex-PT-r0010w0050-CTLFireability-09
FORMULA_NAME RwMutex-PT-r0010w0050-CTLFireability-10
FORMULA_NAME RwMutex-PT-r0010w0050-CTLFireability-11
FORMULA_NAME RwMutex-PT-r0010w0050-CTLFireability-12
FORMULA_NAME RwMutex-PT-r0010w0050-CTLFireability-13
FORMULA_NAME RwMutex-PT-r0010w0050-CTLFireability-14
FORMULA_NAME RwMutex-PT-r0010w0050-CTLFireability-15

=== Now, execution of the tool begins

BK_START 1591232779256

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-04 01:06:21] [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 01:06:21] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-04 01:06:21] [INFO ] Load time of PNML (sax parser for PT used): 61 ms
[2020-06-04 01:06:21] [INFO ] Transformed 130 places.
[2020-06-04 01:06:21] [INFO ] Transformed 120 transitions.
[2020-06-04 01:06:21] [INFO ] Parsed PT model containing 130 places and 120 transitions in 100 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 12 ms.
Incomplete random walk after 100000 steps, including 0 resets, run finished after 527 ms. (steps per millisecond=189 ) properties seen :[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
// Phase 1: matrix 120 rows 130 cols
[2020-06-04 01:06:22] [INFO ] Computed 70 place invariants in 9 ms
[2020-06-04 01:06:22] [INFO ] [Real]Absence check using 70 positive place invariants in 14 ms returned unsat
Successfully simplified 1 atomic propositions for a total of 1 simplifications.
[2020-06-04 01:06:22] [INFO ] Initial state reduction rules for CTL removed 8 formulas.
[2020-06-04 01:06:22] [INFO ] Flatten gal took : 80 ms
[2020-06-04 01:06:22] [INFO ] Initial state reduction rules for CTL removed 8 formulas.
[2020-06-04 01:06:22] [INFO ] Flatten gal took : 36 ms
FORMULA RwMutex-PT-r0010w0050-CTLFireability-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RwMutex-PT-r0010w0050-CTLFireability-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RwMutex-PT-r0010w0050-CTLFireability-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RwMutex-PT-r0010w0050-CTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RwMutex-PT-r0010w0050-CTLFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RwMutex-PT-r0010w0050-CTLFireability-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RwMutex-PT-r0010w0050-CTLFireability-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RwMutex-PT-r0010w0050-CTLFireability-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-06-04 01:06:22] [INFO ] Export to MCC properties in file /home/mcc/execution/CTLFireability.sr.xml took 3 ms.
[2020-06-04 01:06:22] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 4 ms.
info: Time: 3600 - MCC
vrfy: Checking CTLFireability @ RwMutex-PT-r0010w0050 @ 3570 seconds

FORMULA RwMutex-PT-r0010w0050-CTLFireability-03 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA RwMutex-PT-r0010w0050-CTLFireability-08 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA RwMutex-PT-r0010w0050-CTLFireability-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA RwMutex-PT-r0010w0050-CTLFireability-05 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA RwMutex-PT-r0010w0050-CTLFireability-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA RwMutex-PT-r0010w0050-CTLFireability-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA RwMutex-PT-r0010w0050-CTLFireability-09 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA RwMutex-PT-r0010w0050-CTLFireability-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 3567
rslt: Output for CTLFireability @ RwMutex-PT-r0010w0050

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

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 445
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 1,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 12,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 12,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 12,
"visible_transitions": 0
},
"processed": "AX((EF((1 <= p121)) OR ((1 <= p67) AND (1 <= p100) AND (1 <= p101) AND (1 <= p102) AND (1 <= p103) AND (1 <= p104) AND (1 <= p105) AND (1 <= p106) AND (1 <= p107) AND (1 <= p109) AND (1 <= p110))))",
"processed_size": 197,
"rewrites": 10
},
"net":
{
"conflict_clusters": 61,
"singleton_clusters": 0
},
"result":
{
"edges": 10266,
"markings": 1074,
"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": 509
},
"formula":
{
"count":
{
"A": 1,
"E": 1,
"F": 0,
"G": 0,
"U": 1,
"X": 1,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 12,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 12,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 12,
"visible_transitions": 0
},
"processed": "AX(E(((1 <= p71) AND (1 <= p100) AND (1 <= p101) AND (1 <= p102) AND (1 <= p103) AND (1 <= p104) AND (1 <= p105) AND (1 <= p106) AND (1 <= p107) AND (1 <= p109) AND (1 <= p110)) U (1 <= p126)))",
"processed_size": 193,
"rewrites": 10
},
"net":
{
"conflict_clusters": 61,
"singleton_clusters": 0
},
"result":
{
"edges": 0,
"markings": 1,
"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"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 0,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 509
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 2,
"E": 2,
"F": 1,
"G": 0,
"U": 1,
"X": 2,
"aconj": 3,
"adisj": 0,
"aneg": 0,
"comp": 33,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 33,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 13,
"visible_transitions": 0
},
"processed": "(A(EX(((1 <= p62) AND (1 <= p100) AND (1 <= p101) AND (1 <= p102) AND (1 <= p103) AND (1 <= p104) AND (1 <= p105) AND (1 <= p106) AND (1 <= p107) AND (1 <= p109) AND (1 <= p110))) U ((1 <= p68) AND (1 <= p100) AND (1 <= p101) AND (1 <= p102) AND (1 <= p103) AND (1 <= p104) AND (1 <= p105) AND (1 <= p106) AND (1 <= p107) AND (1 <= p109) AND (1 <= p110))) AND EX(AF(((1 <= p23) AND (1 <= p100) AND (1 <= p101) AND (1 <= p102) AND (1 <= p103) AND (1 <= p104) AND (1 <= p105) AND (1 <= p106) AND (1 <= p107) AND (1 <= p109) AND (1 <= p110)))))",
"processed_size": 541,
"rewrites": 12
},
"net":
{
"conflict_clusters": 61,
"singleton_clusters": 0
},
"result":
{
"edges": 12,
"markings": 9,
"produced_by": "CTL model checker",
"value": true
},
"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": 594
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 3,
"F": 3,
"G": 0,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 2,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "EF((EX((1 <= p121)) AND (AF((1 <= p6)) AND EF((1 <= p25)))))",
"processed_size": 60,
"rewrites": 12
},
"net":
{
"conflict_clusters": 61,
"singleton_clusters": 0
},
"result":
{
"edges": 10346,
"markings": 1074,
"produced_by": "CTL model checker",
"value": false
},
"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": 713
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "E (F ((1 <= p20)))",
"processed_size": 18,
"rewrites": 9
},
"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": 1,
"problems": 1
},
"type": "reachability",
"workflow": "stateequation||search"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1189
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 3,
"aneg": 1,
"comp": 34,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 34,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 14,
"visible_transitions": 0
},
"processed": "((p30 <= 0) OR ((1 <= p68) AND (1 <= p100) AND (1 <= p101) AND (1 <= p102) AND (1 <= p103) AND (1 <= p104) AND (1 <= p105) AND (1 <= p106) AND (1 <= p107) AND (1 <= p109) AND (1 <= p110)) OR ((1 <= p66) AND (1 <= p100) AND (1 <= p101) AND (1 <= p102) AND (1 <= p103) AND (1 <= p104) AND (1 <= p105) AND (1 <= p106) AND (1 <= p107) AND (1 <= p109) AND (1 <= p110)) OR ((1 <= p37) AND (1 <= p100) AND (1 <= p101) AND (1 <= p102) AND (1 <= p103) AND (1 <= p104) AND (1 <= p105) AND (1 <= p106) AND (1 <= p107) AND (1 <= p109) AND (1 <= p110)))",
"processed_size": 543,
"rewrites": 11
},
"result":
{
"edges": 5,
"markings": 5,
"produced_by": "state space / EG",
"value": false
},
"task":
{
"compoundnumber": 5,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 120
},
"threads": 1,
"type": "dfs"
},
"type": "eventual_occurrence",
"workflow": "stateequation"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1783
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 1,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 12,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 12,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 12,
"visible_transitions": 0
},
"processed": "G ((((1 <= p83) AND (1 <= p100) AND (1 <= p101) AND (1 <= p102) AND (1 <= p103) AND (1 <= p104) AND (1 <= p105) AND (1 <= p106) AND (1 <= p107) AND (1 <= p109) AND (1 <= p110)) U (1 <= p90)))",
"processed_size": 191,
"rewrites": 17
},
"result":
{
"edges": 6,
"markings": 6,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 6,
"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": 3567
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 1,
"X": 0,
"aconj": 3,
"adisj": 1,
"aneg": 0,
"comp": 26,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 26,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 15,
"visible_transitions": 0
},
"processed": "((G (((1 <= p61) AND (1 <= p100) AND (1 <= p101) AND (1 <= p102) AND (1 <= p103) AND (1 <= p104) AND (1 <= p105) AND (1 <= p106) AND (1 <= p107) AND (1 <= p109) AND (1 <= p110))) AND (((1 <= p47) AND (1 <= p100) AND (1 <= p101) AND (1 <= p102) AND (1 <= p103) AND (1 <= p104) AND (1 <= p105) AND (1 <= p106) AND (1 <= p107) AND (1 <= p109) AND (1 <= p110)) OR ((1 <= p25) AND (1 <= p86) AND (1 <= p104)))) U (1 <= p16))",
"processed_size": 420,
"rewrites": 10
},
"result":
{
"edges": 6,
"markings": 6,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 7,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "universal single path",
"workflow": "product automaton"
}
}
],
"exit":
{
"error": null,
"memory": 50044,
"runtime": 3.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "CTLFireability.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "(A(X(E((** U **)))) AND A(X((E(F(**)) OR **)))) : E(F(**)) : (A((E(X(**)) U **)) AND E(X(A(F(**))))) : E(F(E((* R *)))) : A(F(**)) : A(F(**)) : A(((A(G(**)) AND **) U **)) : E(F((E(X(**)) AND (A(F(**)) AND E(F(**))))))"
},
"net":
{
"arcs": 1260,
"conflict_clusters": 61,
"places": 130,
"places_significant": 60,
"singleton_clusters": 0,
"transitions": 120
},
"result":
{
"preliminary_value": "no yes yes yes no no no no ",
"value": "no yes yes yes no no no 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: 250/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 130
lola: finding significant places
lola: 130 places, 120 transitions, 60 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: A (X ((E ((((1 <= p71) AND (1 <= p100) AND (1 <= p101) AND (1 <= p102) AND (1 <= p103) AND (1 <= p104) AND (1 <= p105) AND (1 <= p106) AND (1 <= p107) AND (1 <= p109) AND (1 <= p110)) U (1 <= p126))) AND (E (F ((1 <= p121))) OR ((1 <= p67) AND (1 <= p100) AND (1 <= p101) AND (1 <= p102) AND (1 <= p103) AND (1 <= p104) AND (1 <= p105) AND (1 <= p106) AND (1 <= p107) AND (1 <= p109) AND (1 <= p110)))))) : E (F (A (((1 <= 0) U (1 <= p20))))) : (A ((E (X (((1 <= p62) AND (1 <= p100) AND (1 <= p101) AND (1 <= p102) AND (1 <= p103) AND (1 <= p104) AND (1 <= p105) AND (1 <= p106) AND (1 <= p107) AND (1 <= p109) AND (1 <= p110)))) U ((1 <= p68) AND (1 <= p100) AND (1 <= p101) AND (1 <= p102) AND (1 <= p103) AND (1 <= p104) AND (1 <= p105) AND (1 <= p106) AND (1 <= p107) AND (1 <= p109) AND (1 <= p110)))) AND E (X (A (F (((1 <= p23) AND (1 <= p100) AND (1 <= p101) AND (1 <= p102) AND (1 <= p103) AND (1 <= p104) AND (1 <= p105) AND (1 <= p106) AND (1 <= p107) AND (1 <= p109) AND (1 <= p110))))))) : E (F (NOT(A ((((1 <= p83) AND (1 <= p100) AND (1 <= p101) AND (1 <= p102) AND (1 <= p103) AND (1 <= p104) AND (1 <= p105) AND (1 <= p106) AND (1 <= p107) AND (1 <= p109) AND (1 <= p110)) U (1 <= p90)))))) : A (F ((1 <= p90))) : A (F (((1 <= p30) AND ((p68 <= 0) OR (p100 <= 0) OR (p101 <= 0) OR (p102 <= 0) OR (p103 <= 0) OR (p104 <= 0) OR (p105 <= 0) OR (p106 <= 0) OR (p107 <= 0) OR (p109 <= 0) OR (p110 <= 0)) AND ((p66 <= 0) OR (p100 <= 0) OR (p101 <= 0) OR (p102 <= 0) OR (p103 <= 0) OR (p104 <= 0) OR (p105 <= 0) OR (p106 <= 0) OR (p107 <= 0) OR (p109 <= 0) OR (p110 <= 0)) AND ((p37 <= 0) OR (p100 <= 0) OR (p101 <= 0) OR (p102 <= 0) OR (p103 <= 0) OR (p104 <= 0) OR (p105 <= 0) OR (p106 <= 0) OR (p107 <= 0) OR (p109 <= 0) OR (p110 <= 0))))) : A (((A (G (((1 <= p61) AND (1 <= p100) AND (1 <= p101) AND (1 <= p102) AND (1 <= p103) AND (1 <= p104) AND (1 <= p105) AND (1 <= p106) AND (1 <= p107) AND (1 <= p109) AND (1 <= p110)))) AND (((1 <= p47) AND (1 <= p100) AND (1 <= p101) AND (1 <= p102) AND (1 <= p103) AND (1 <= p104) AND (1 <= p105) AND (1 <= p106) AND (1 <= p107) AND (1 <= p109) AND (1 <= p110)) OR ((1 <= p25) AND (1 <= p86) AND (1 <= p104)))) U (1 <= p16))) : E (F (((E (X ((1 <= p121))) AND A (F ((1 <= p6)))) AND E (F ((1 <= p25))))))
lola: rewrite Frontend/Parser/formula_rewrite.k:551
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:184
lola: rewrite Frontend/Parser/formula_rewrite.k:323
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: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 445 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (X (E ((((1 <= p71) AND (1 <= p100) AND (1 <= p101) AND (1 <= p102) AND (1 <= p103) AND (1 <= p104) AND (1 <= p105) AND (1 <= p106) AND (1 <= p107) AND (1 <= p109) AND (1 <= p110)) U (1 <= p126))))) AND A (X ((E (F ((1 <= p121))) OR ((1 <= p67) AND (1 <= p100) AND (1 <= p101) AND (1 <= p102) AND (1 <= p103) AND (1 <= p104) AND (1 <= p105) AND (1 <= p106) AND (1 <= p107) AND (1 <= p109) AND (1 <... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 0 will run for 445 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X ((E (F ((1 <= p121))) OR ((1 <= p67) AND (1 <= p100) AND (1 <= p101) AND (1 <= p102) AND (1 <= p103) AND (1 <= p104) AND (1 <= p105) AND (1 <= p106) AND (1 <= p107) AND (1 <= p109) AND (1 <= p110)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:806
lola: rewrite Frontend/Parser/formula_rewrite.k:812
lola: processed formula: AX((EF((1 <= p121)) OR ((1 <= p67) AND (1 <= p100) AND (1 <= p101) AND (1 <= p102) AND (1 <= p103) AND (1 <= p104) AND (1 <= p105) AND (1 <= p106) AND (1 <= p107) AND (1 <= p109) AND (1 <= p110))))
lola: processed formula length: 197
lola: 10 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: 1074 markings, 10266 edges
lola: ========================================
lola: subprocess 1 will run for 509 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (E ((((1 <= p71) AND (1 <= p100) AND (1 <= p101) AND (1 <= p102) AND (1 <= p103) AND (1 <= p104) AND (1 <= p105) AND (1 <= p106) AND (1 <= p107) AND (1 <= p109) AND (1 <= p110)) U (1 <= p126)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:809
lola: rewrite Frontend/Parser/formula_rewrite.k:812
lola: processed formula: AX(E(((1 <= p71) AND (1 <= p100) AND (1 <= p101) AND (1 <= p102) AND (1 <= p103) AND (1 <= p104) AND (1 <= p105) AND (1 <= p106) AND (1 <= p107) AND (1 <= p109) AND (1 <= p110)) U (1 <= p126)))
lola: processed formula length: 193
lola: 10 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: 1 markings, 0 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 1 will run for 509 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A ((E (X (((1 <= p62) AND (1 <= p100) AND (1 <= p101) AND (1 <= p102) AND (1 <= p103) AND (1 <= p104) AND (1 <= p105) AND (1 <= p106) AND (1 <= p107) AND (1 <= p109) AND (1 <= p110)))) U ((1 <= p68) AND (1 <= p100) AND (1 <= p101) AND (1 <= p102) AND (1 <= p103) AND (1 <= p104) AND (1 <= p105) AND (1 <= p106) AND (1 <= p107) AND (1 <= p109) AND (1 <= p110)))) AND E (X (A (F (((1 <= p23) AND (1 <=... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:807
lola: rewrite Frontend/Parser/formula_rewrite.k:814
lola: rewrite Frontend/Parser/formula_rewrite.k:811
lola: rewrite Frontend/Parser/formula_rewrite.k:807
lola: processed formula: (A(EX(((1 <= p62) AND (1 <= p100) AND (1 <= p101) AND (1 <= p102) AND (1 <= p103) AND (1 <= p104) AND (1 <= p105) AND (1 <= p106) AND (1 <= p107) AND (1 <= p109) AND (1 <= p110))) U ((1 <= p68) AND (1 <= p100) AND (1 <= p101) AND (1 <= p102) AND (1 <= p103) AND (1 <= p104) AND (1 <= p105) AND (1 <= p106) AND (1 <= p107) AND (1 <= p109) AND (1 <= p110))) AND EX(AF(((1 <= p23) AND (1 <= p100) AND (1... (shortened)
lola: processed formula length: 541
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: 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: 9 markings, 12 edges
lola: ========================================
lola: subprocess 2 will run for 594 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((E (X ((1 <= p121))) AND (A (F ((1 <= p6))) AND E (F ((1 <= p25)))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:807
lola: rewrite Frontend/Parser/formula_rewrite.k:811
lola: rewrite Frontend/Parser/formula_rewrite.k:806
lola: rewrite Frontend/Parser/formula_rewrite.k:806
lola: processed formula: EF((EX((1 <= p121)) AND (AF((1 <= p6)) AND EF((1 <= p25)))))
lola: processed formula length: 60
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: 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: 1074 markings, 10346 edges
lola: ========================================
lola: subprocess 3 will run for 713 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((1 <= p20)))
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 <= p20)))
lola: processed formula length: 18
lola: 9 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: (1 <= p20)
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: 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: state equation: calling and running sara
lola: ========================================
lola: subprocess 4 will run for 891 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F ((1 <= p90)))
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: (p90 <= 0)
lola: processed formula length: 10
lola: 11 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 <= p90)
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: 2 markings, 2 edges
lola: state equation: write sara problem file to CTLFireability-4-0.sara
lola: state equation: calling and running sara
sara: try reading problem file CTLFireability-3-0.sara.
sara: try reading problem file CTLFireability-4-0.sara.
sara: place or transition ordering is non-deterministic

sara: place or transition ordering is non-deterministic

lola: ========================================
lola: subprocess 5 will run for 1189 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (((1 <= p30) AND ((p68 <= 0) OR (p100 <= 0) OR (p101 <= 0) OR (p102 <= 0) OR (p103 <= 0) OR (p104 <= 0) OR (p105 <= 0) OR (p106 <= 0) OR (p107 <= 0) OR (p109 <= 0) OR (p110 <= 0)) AND ((p66 <= 0) OR (p100 <= 0) OR (p101 <= 0) OR (p102 <= 0) OR (p103 <= 0) OR (p104 <= 0) OR (p105 <= 0) OR (p106 <= 0) OR (p107 <= 0) OR (p109 <= 0) OR (p110 <= 0)) AND ((p37 <= 0) OR (p100 <=... (shortened)
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: ((p30 <= 0) OR ((1 <= p68) AND (1 <= p100) AND (1 <= p101) AND (1 <= p102) AND (1 <= p103) AND (1 <= p104) AND (1 <= p105) AND (1 <= p106) AND (1 <= p107) AND (1 <= p109) AND (1 <= p110)) OR ((1 <= p66) AND (1 <= p100) AND (1 <= p101) AND (1 <= p102) AND (1 <= p103) AND (1 <= p104) AND (1 <= p105) AND (1 <= p106) AND (1 <= p107) AND (1 <= p109) AND (1 <= p110)) OR ((1 <= p37) AND (1 <= p100) AN... (shortened)
lola: processed formula length: 543
lola: 11 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: SUBRESULT
lola: result: no
lola: produced by: state space / EG
lola: The predicate does not eventually occur.
lola: 5 markings, 5 edges
lola: ========================================
lola: subprocess 6 will run for 1783 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (E ((((p83 <= 0) OR (p100 <= 0) OR (p101 <= 0) OR (p102 <= 0) OR (p103 <= 0) OR (p104 <= 0) OR (p105 <= 0) OR (p106 <= 0) OR (p107 <= 0) OR (p109 <= 0) OR (p110 <= 0)) R (p90 <= 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:661
lola: rewrite Frontend/Parser/formula_rewrite.k:659
lola: rewrite Frontend/Parser/formula_rewrite.k:664
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: G ((((1 <= p83) AND (1 <= p100) AND (1 <= p101) AND (1 <= p102) AND (1 <= p103) AND (1 <= p104) AND (1 <= p105) AND (1 <= p106) AND (1 <= p107) AND (1 <= p109) AND (1 <= p110)) U (1 <= p90)))
lola: processed formula length: 191
lola: 17 rewrites
lola: closed formula file CTLFireability.xml
lola: the resulting Büchi automaton has 3 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: 6 markings, 6 edges
lola: ========================================
lola: subprocess 7 will run for 3567 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (((A (G (((1 <= p61) AND (1 <= p100) AND (1 <= p101) AND (1 <= p102) AND (1 <= p103) AND (1 <= p104) AND (1 <= p105) AND (1 <= p106) AND (1 <= p107) AND (1 <= p109) AND (1 <= p110)))) AND (((1 <= p47) AND (1 <= p100) AND (1 <= p101) AND (1 <= p102) AND (1 <= p103) AND (1 <= p104) AND (1 <= p105) AND (1 <= p106) AND (1 <= p107) AND (1 <= p109) AND (1 <= p110)) OR ((1 <= p25) AND (1 <= p86) AND (... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a universal CTL formula with single counterexample path (use LTL...)
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: ((G (((1 <= p61) AND (1 <= p100) AND (1 <= p101) AND (1 <= p102) AND (1 <= p103) AND (1 <= p104) AND (1 <= p105) AND (1 <= p106) AND (1 <= p107) AND (1 <= p109) AND (1 <= p110))) AND (((1 <= p47) AND (1 <= p100) AND (1 <= p101) AND (1 <= p102) AND (1 <= p103) AND (1 <= p104) AND (1 <= p105) AND (1 <= p106) AND (1 <= p107) AND (1 <= p109) AND (1 <= p110)) OR ((1 <= p25) AND (1 <= p86) AND (1 <= p1... (shortened)
lola: processed formula length: 420
lola: 10 rewrites
lola: closed formula file CTLFireability.xml
lola: the resulting Büchi automaton has 3 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: no
lola: produced by: LTL model checker
lola: The universal single path CTL formula does not hold.
lola: 6 markings, 6 edges
lola: ========================================
lola: RESULT
lola:
SUMMARY: no yes yes yes no no no no
lola:
preliminary result: no yes yes yes no no no no
lola: memory consumption: 50044 KB
lola: time consumption: 3 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="RwMutex-PT-r0010w0050"
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 RwMutex-PT-r0010w0050, 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 r186-oct2-158987938700260"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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