About the Execution of ITS-LoLa for CSRepetitions-PT-02
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 15742.950 | 3600000.00 | 14329.00 | 148.80 | FFFFFFFFTFFFFFFT | 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.r182-oct2-158987914200660.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fko/mcc2020-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
............................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itslola
Input is CSRepetitions-PT-02, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r182-oct2-158987914200660
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 296K
-rw-r--r-- 1 mcc users 7.7K Apr 27 15:14 CTLCardinality.txt
-rw-r--r-- 1 mcc users 30K Apr 27 15:14 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.0K Apr 27 15:14 CTLFireability.txt
-rw-r--r-- 1 mcc users 25K Apr 27 15:14 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Apr 27 15:14 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.0K Apr 27 15:14 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 7.3K Apr 27 15:14 LTLCardinality.txt
-rw-r--r-- 1 mcc users 35K Apr 28 14:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K Apr 27 15:14 LTLFireability.txt
-rw-r--r-- 1 mcc users 26K Apr 28 14:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 5.3K Apr 27 15:14 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 20K Apr 27 15:14 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.2K Apr 27 15:14 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 34K Apr 27 15:14 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.3K Apr 27 15:14 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.7K Apr 27 15:14 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Apr 27 15:14 equiv_col
-rw-r--r-- 1 mcc users 3 Apr 27 15:14 instance
-rw-r--r-- 1 mcc users 6 Apr 27 15:14 iscolored
-rw-r--r-- 1 mcc users 26K Apr 27 15:14 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of booleans
BOOL_VECTOR
here is the order used to build the result vector(from text file)
FORMULA_NAME CSRepetitions-PT-02-CTLFireability-00
FORMULA_NAME CSRepetitions-PT-02-CTLFireability-01
FORMULA_NAME CSRepetitions-PT-02-CTLFireability-02
FORMULA_NAME CSRepetitions-PT-02-CTLFireability-03
FORMULA_NAME CSRepetitions-PT-02-CTLFireability-04
FORMULA_NAME CSRepetitions-PT-02-CTLFireability-05
FORMULA_NAME CSRepetitions-PT-02-CTLFireability-06
FORMULA_NAME CSRepetitions-PT-02-CTLFireability-07
FORMULA_NAME CSRepetitions-PT-02-CTLFireability-08
FORMULA_NAME CSRepetitions-PT-02-CTLFireability-09
FORMULA_NAME CSRepetitions-PT-02-CTLFireability-10
FORMULA_NAME CSRepetitions-PT-02-CTLFireability-11
FORMULA_NAME CSRepetitions-PT-02-CTLFireability-12
FORMULA_NAME CSRepetitions-PT-02-CTLFireability-13
FORMULA_NAME CSRepetitions-PT-02-CTLFireability-14
FORMULA_NAME CSRepetitions-PT-02-CTLFireability-15
=== Now, execution of the tool begins
BK_START 1591171184542
bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-03 07:59:47] [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-03 07:59:48] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-03 07:59:48] [INFO ] Load time of PNML (sax parser for PT used): 45 ms
[2020-06-03 07:59:48] [INFO ] Transformed 23 places.
[2020-06-03 07:59:48] [INFO ] Transformed 28 transitions.
[2020-06-03 07:59:48] [INFO ] Parsed PT model containing 23 places and 28 transitions in 89 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 37 ms.
Incomplete random walk after 100000 steps, including 5587 resets, run finished after 140 ms. (steps per millisecond=714 ) properties seen :[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
// Phase 1: matrix 28 rows 23 cols
[2020-06-03 07:59:48] [INFO ] Computed 6 place invariants in 3 ms
[2020-06-03 07:59:48] [INFO ] [Real]Absence check using 6 positive place invariants in 28 ms returned unsat
Successfully simplified 1 atomic propositions for a total of 1 simplifications.
[2020-06-03 07:59:48] [INFO ] Initial state reduction rules for CTL removed 5 formulas.
[2020-06-03 07:59:48] [INFO ] Flatten gal took : 45 ms
[2020-06-03 07:59:48] [INFO ] Initial state reduction rules for CTL removed 5 formulas.
[2020-06-03 07:59:48] [INFO ] Flatten gal took : 5 ms
FORMULA CSRepetitions-PT-02-CTLFireability-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CSRepetitions-PT-02-CTLFireability-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CSRepetitions-PT-02-CTLFireability-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CSRepetitions-PT-02-CTLFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CSRepetitions-PT-02-CTLFireability-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-06-03 07:59:48] [INFO ] Export to MCC properties in file /home/mcc/execution/CTLFireability.sr.xml took 4 ms.
[2020-06-03 07:59:48] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 0 ms.
info: Time: 3600 - MCC
vrfy: Checking CTLFireability @ CSRepetitions-PT-02 @ 3570 seconds
FORMULA CSRepetitions-PT-02-CTLFireability-00 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA CSRepetitions-PT-02-CTLFireability-02 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA CSRepetitions-PT-02-CTLFireability-04 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA CSRepetitions-PT-02-CTLFireability-05 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA CSRepetitions-PT-02-CTLFireability-06 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA CSRepetitions-PT-02-CTLFireability-07 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA CSRepetitions-PT-02-CTLFireability-08 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA CSRepetitions-PT-02-CTLFireability-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA CSRepetitions-PT-02-CTLFireability-09 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA CSRepetitions-PT-02-CTLFireability-03 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA CSRepetitions-PT-02-CTLFireability-01 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 3567
rslt: Output for CTLFireability @ CSRepetitions-PT-02
{
"build":
{
"architecture": 64,
"assertions": false,
"build_hostname": "mcc2019",
"build_system": "x86_64-unknown-linux-gnu",
"optimizations": true,
"package_version": "2.0",
"svn_version": "3189M"
},
"call":
{
"exec_host": "mcc2020",
"markinglimit": null,
"parameters":
[
"--pnmlnet",
"model.pnml",
"--xmlformula",
"--formula=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": "Wed Jun 3 07:59:49 2020
",
"timelimit": 3570
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 324
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 3,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 1,
"aconj": 37,
"adisj": 4,
"aneg": 0,
"comp": 72,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 72,
"taut": 0,
"tconj": 0,
"tdisj": 6,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 19,
"visible_transitions": 0
},
"processed": "AG((AX((((1 <= p9) AND (1 <= p13)) OR ((1 <= p14) AND (1 <= p15)) OR ((1 <= p10) AND (1 <= p11)) OR ((1 <= p5) AND (1 <= p14)) OR ((1 <= p2) AND (1 <= p9)) OR ((1 <= p7) AND (1 <= p12)) OR ((1 <= p1) AND (1 <= p12)) OR ((1 <= p10) AND (1 <= p18)))) OR (AF((((1 <= p4) AND (1 <= p8)) OR ((1 <= p17) AND (1 <= p19)) OR ((1 <= p0) AND (1 <= p17)) OR ((1 <= p16) AND (1 <= p17)) OR ((1 <= p4) AND (1 <= p17)) OR ((1 <= p8) AND (1 <= p19)) OR ((1 <= p0) AND (1 <= p8)) OR ((1 <= p8) AND (1 <= p16)))) OR (((1 <= p14) AND (1 <= p20)) OR (((1 <= p9) AND (1 <= p20)) OR (((1 <= p10) AND (1 <= p20)) OR (((1 <= p12) AND (1 <= p20)) OR ((((1 <= p4) AND (1 <= p8)) OR ((1 <= p17) AND (1 <= p19)) OR ((1 <= p0) AND (1 <= p17)) OR ((1 <= p16) AND (1 <= p17)) OR ((1 <= p4) AND (1 <= p17)) OR ((1 <= p8) AND (1 <= p19)) OR ((1 <= p0) AND (1 <= p8)) OR ((1 <= p8) AND (1 <= p16))) AND (((1 <= p9) AND (1 <= p13)) OR ((1 <= p14) AND (1 <= p15)) OR ((1 <= p10) AND (1 <= p11)) OR ((1 <= p5) AND (1 <= p14)) OR ((1 <= p2) AND (1 <= p9)) OR ((1 <= p7) AND (1 <= p12)) OR ((1 <= p1) AND (1 <= p12)) OR ((1 <= p10) AND (1 <= p18)))))))))))",
"processed_size": 1146,
"rewrites": 35
},
"net":
{
"conflict_clusters": 6,
"singleton_clusters": 0
},
"result":
{
"edges": 95,
"markings": 67,
"produced_by": "CTL model checker",
"value": false
},
"task":
{
"compoundnumber": 0,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 356
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 356
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 4,
"adisj": 1,
"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": 9,
"visible_transitions": 0
},
"processed": "(((1 <= p14) AND (1 <= p20)) OR ((1 <= p9) AND (1 <= p20)) OR ((1 <= p10) AND (1 <= p20)) OR ((1 <= p12) AND (1 <= p20)) OR (1 <= p3) OR (1 <= p21) OR (1 <= p6) OR (1 <= p22))",
"processed_size": 182,
"rewrites": 35
},
"result":
{
"edges": 8,
"markings": 9,
"produced_by": "tscc_search",
"value": false
},
"task":
{
"compoundnumber": 1,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "tscc preserving/always up"
}
},
"stateequation":
{
"literals": 128,
"problems": 16
},
"store":
{
"type": "dfs/tscc"
},
"type": "liveness",
"workflow": "stateequation"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 396
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 2,
"E": 0,
"F": 0,
"G": 0,
"U": 1,
"X": 1,
"aconj": 8,
"adisj": 2,
"aneg": 0,
"comp": 20,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 20,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 16,
"visible_transitions": 0
},
"processed": "A (X (A ((((1 <= p16) OR (1 <= p0) OR (1 <= p19) OR (1 <= p4)) U (((1 <= p9) AND (1 <= p13)) OR ((1 <= p14) AND (1 <= p15)) OR ((1 <= p10) AND (1 <= p11)) OR ((1 <= p5) AND (1 <= p14)) OR ((1 <= p2) AND (1 <= p9)) OR ((1 <= p7) AND (1 <= p12)) OR ((1 <= p1) AND (1 <= p12)) OR ((1 <= p10) AND (1 <= p18)))))))",
"processed_size": 319,
"rewrites": 37
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "state space / EXER",
"value": false
},
"task":
{
"compoundnumber": 2,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl",
"visible": 16
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 4,
"problems": 4
},
"type": "universal_until_from_successors",
"workflow": "stateequation"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 1,
"type": "boolean"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 396
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 2,
"F": 1,
"G": 1,
"U": 0,
"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": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "EX(AG(EF((((1 <= p14) AND (1 <= p20)) OR ((1 <= p9) AND (1 <= p20)) OR ((1 <= p10) AND (1 <= p20)) OR ((1 <= p12) AND (1 <= p20))))))",
"processed_size": 136,
"rewrites": 35
},
"net":
{
"conflict_clusters": 6,
"singleton_clusters": 0
},
"result":
{
"edges": 55,
"markings": 26,
"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": 445
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 445
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 4,
"adisj": 1,
"aneg": 0,
"comp": 8,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 8,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "E (F ((((1 <= p14) AND (1 <= p20)) OR ((1 <= p9) AND (1 <= p20)) OR ((1 <= p10) AND (1 <= p20)) OR ((1 <= p12) AND (1 <= p20)))))",
"processed_size": 132,
"rewrites": 33
},
"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"
},
"type": "reachability",
"workflow": "stateequation||search"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 509
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 9,
"adisj": 2,
"aneg": 0,
"comp": 20,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 20,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 6,
"visible_transitions": 0
},
"processed": "E (F ((((1 <= p16) OR (1 <= p0) OR (1 <= p19) OR (1 <= p4)) AND (((1 <= p4) AND (1 <= p8)) OR ((1 <= p17) AND (1 <= p19)) OR ((1 <= p0) AND (1 <= p17)) OR ((1 <= p16) AND (1 <= p17)) OR ((1 <= p4) AND (1 <= p17)) OR ((1 <= p8) AND (1 <= p19)) OR ((1 <= p0) AND (1 <= p8)) OR ((1 <= p8) AND (1 <= p16))))))",
"processed_size": 315,
"rewrites": 33
},
"result":
{
"edges": 2,
"markings": 3,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 4,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 96,
"problems": 32
},
"type": "reachability",
"workflow": "stateequation||search"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 594
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 8,
"adisj": 1,
"aneg": 1,
"comp": 16,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 16,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 12,
"visible_transitions": 0
},
"processed": "(((p9 <= 0) OR (p13 <= 0)) AND ((p14 <= 0) OR (p15 <= 0)) AND ((p10 <= 0) OR (p11 <= 0)) AND ((p5 <= 0) OR (p14 <= 0)) AND ((p2 <= 0) OR (p9 <= 0)) AND ((p7 <= 0) OR (p12 <= 0)) AND ((p1 <= 0) OR (p12 <= 0)) AND ((p10 <= 0) OR (p18 <= 0)))",
"processed_size": 247,
"rewrites": 35
},
"result":
{
"edges": 8,
"markings": 9,
"produced_by": "state space / EG",
"value": false
},
"task":
{
"compoundnumber": 5,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 24
},
"threads": 1,
"type": "dfs"
},
"type": "eventual_occurrence",
"workflow": "stateequation"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 713
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 9,
"aneg": 0,
"comp": 20,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 20,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 16,
"visible_transitions": 0
},
"processed": "((1 <= p16) OR (1 <= p0) OR (1 <= p19) OR (1 <= p4) OR (((p9 <= 0) OR (p13 <= 0)) AND ((p14 <= 0) OR (p15 <= 0)) AND ((p10 <= 0) OR (p11 <= 0)) AND ((p5 <= 0) OR (p14 <= 0)) AND ((p2 <= 0) OR (p9 <= 0)) AND ((p7 <= 0) OR (p12 <= 0)) AND ((p1 <= 0) OR (p12 <= 0)) AND ((p10 <= 0) OR (p18 <= 0))))",
"processed_size": 307,
"rewrites": 32
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 6,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 891
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 1,
"aconj": 8,
"adisj": 1,
"aneg": 0,
"comp": 16,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 16,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 12,
"visible_transitions": 0
},
"processed": "AX((((1 <= p9) AND (1 <= p13)) OR ((1 <= p14) AND (1 <= p15)) OR ((1 <= p10) AND (1 <= p11)) OR ((1 <= p5) AND (1 <= p14)) OR ((1 <= p2) AND (1 <= p9)) OR ((1 <= p7) AND (1 <= p12)) OR ((1 <= p1) AND (1 <= p12)) OR ((1 <= p10) AND (1 <= p18))))",
"processed_size": 251,
"rewrites": 33
},
"net":
{
"conflict_clusters": 6,
"singleton_clusters": 0
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "CTL model checker",
"value": false
},
"task":
{
"compoundnumber": 7,
"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": 3,
"type": "boolean"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 509
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 8,
"adisj": 1,
"aneg": 1,
"comp": 16,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 16,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 12,
"visible_transitions": 0
},
"processed": "(((p9 <= 0) OR (p13 <= 0)) AND ((p14 <= 0) OR (p15 <= 0)) AND ((p10 <= 0) OR (p11 <= 0)) AND ((p5 <= 0) OR (p14 <= 0)) AND ((p2 <= 0) OR (p9 <= 0)) AND ((p7 <= 0) OR (p12 <= 0)) AND ((p1 <= 0) OR (p12 <= 0)) AND ((p10 <= 0) OR (p18 <= 0)))",
"processed_size": 247,
"rewrites": 35
},
"result":
{
"edges": 7,
"markings": 8,
"produced_by": "state space /EXEG",
"value": false
},
"task":
{
"compoundnumber": 4,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "invisibility based",
"visible": 16
},
"threads": 1,
"type": "dfs"
},
"type": "invariance_from_all_successors",
"workflow": "stateequation"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 594
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 2,
"E": 1,
"F": 1,
"G": 0,
"U": 1,
"X": 1,
"aconj": 25,
"adisj": 3,
"aneg": 0,
"comp": 52,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 52,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 22,
"visible_transitions": 0
},
"processed": "E((AF((((1 <= p9) AND (1 <= p13)) OR ((1 <= p14) AND (1 <= p15)) OR ((1 <= p10) AND (1 <= p11)) OR ((1 <= p5) AND (1 <= p14)) OR ((1 <= p2) AND (1 <= p9)) OR ((1 <= p7) AND (1 <= p12)) OR ((1 <= p1) AND (1 <= p12)) OR ((1 <= p10) AND (1 <= p18)))) OR ((p3 <= 0) AND (p21 <= 0) AND (p6 <= 0) AND (p22 <= 0) AND (((1 <= p4) AND (1 <= p8)) OR ((1 <= p17) AND (1 <= p19)) OR ((1 <= p0) AND (1 <= p17)) OR ((1 <= p16) AND (1 <= p17)) OR ((1 <= p4) AND (1 <= p17)) OR ((1 <= p8) AND (1 <= p19)) OR ((1 <= p0) AND (1 <= p8)) OR ((1 <= p8) AND (1 <= p16))))) U AX((((1 <= p4) AND (1 <= p8)) OR ((1 <= p17) AND (1 <= p19)) OR ((1 <= p0) AND (1 <= p17)) OR ((1 <= p16) AND (1 <= p17)) OR ((1 <= p4) AND (1 <= p17)) OR ((1 <= p8) AND (1 <= p19)) OR ((1 <= p0) AND (1 <= p8)) OR ((1 <= p8) AND (1 <= p16)))))",
"processed_size": 817,
"rewrites": 35
},
"net":
{
"conflict_clusters": 6,
"singleton_clusters": 0
},
"result":
{
"edges": 9,
"markings": 9,
"produced_by": "CTL model checker",
"value": false
},
"task":
{
"compoundnumber": 5,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 713
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 2,
"E": 1,
"F": 1,
"G": 1,
"U": 0,
"X": 1,
"aconj": 1,
"adisj": 0,
"aneg": 2,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "AG((AF((p0 <= 0)) OR EX(((p10 <= 0) OR (p20 <= 0)))))",
"processed_size": 54,
"rewrites": 35
},
"net":
{
"conflict_clusters": 6,
"singleton_clusters": 0
},
"result":
{
"edges": 49729,
"markings": 7424,
"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"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 891
},
"child":
[
{
"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": 1,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "((p8 <= 0) OR (p19 <= 0))",
"processed_size": 26,
"rewrites": 32
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 7,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1189
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 1,
"aneg": 2,
"comp": 6,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 6,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "E ((((1 <= p4) AND (1 <= p8)) R ((p8 <= 0) OR (p16 <= 0) OR (p7 <= 0) OR (p12 <= 0))))",
"processed_size": 89,
"rewrites": 35
},
"result":
{
"edges": 7,
"markings": 8,
"produced_by": "state space /ER",
"value": true
},
"task":
{
"compoundnumber": 8,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl",
"visible": 14
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 4,
"problems": 4
},
"type": "existential_release",
"workflow": "stateequation"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1783
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 1,
"aconj": 2,
"adisj": 1,
"aneg": 0,
"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": 4,
"visible_transitions": 0
},
"processed": "AX((((1 <= p8) AND (1 <= p16)) OR ((1 <= p2) AND (1 <= p9)) OR (p16 <= 0)))",
"processed_size": 77,
"rewrites": 33
},
"net":
{
"conflict_clusters": 6,
"singleton_clusters": 0
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "CTL model checker",
"value": true
},
"task":
{
"compoundnumber": 9,
"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": 7,
"type": "boolean"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1189
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 2,
"adisj": 1,
"aneg": 0,
"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": 4,
"visible_transitions": 0
},
"processed": "(((1 <= p3) AND (1 <= p21)) OR ((1 <= p21) AND (1 <= p9) AND (1 <= p13)))",
"processed_size": 74,
"rewrites": 35
},
"result":
{
"edges": 11,
"markings": 12,
"produced_by": "tscc_search",
"value": false
},
"task":
{
"compoundnumber": 8,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "tscc preserving/always up"
}
},
"stateequation":
{
"literals": 5,
"problems": 2
},
"store":
{
"type": "dfs/tscc"
},
"type": "liveness",
"workflow": "stateequation"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1783
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 8,
"adisj": 1,
"aneg": 1,
"comp": 16,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 16,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 12,
"visible_transitions": 0
},
"processed": "(((p9 <= 0) OR (p13 <= 0)) AND ((p14 <= 0) OR (p15 <= 0)) AND ((p10 <= 0) OR (p11 <= 0)) AND ((p5 <= 0) OR (p14 <= 0)) AND ((p2 <= 0) OR (p9 <= 0)) AND ((p7 <= 0) OR (p12 <= 0)) AND ((p1 <= 0) OR (p12 <= 0)) AND ((p10 <= 0) OR (p18 <= 0)))",
"processed_size": 247,
"rewrites": 35
},
"result":
{
"edges": 8,
"markings": 9,
"produced_by": "state space / EG",
"value": false
},
"task":
{
"compoundnumber": 9,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 24
},
"threads": 1,
"type": "dfs"
},
"type": "eventual_occurrence",
"workflow": "stateequation"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3567
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 8,
"adisj": 1,
"aneg": 1,
"comp": 16,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 16,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 12,
"visible_transitions": 0
},
"processed": "(((p9 <= 0) OR (p13 <= 0)) AND ((p14 <= 0) OR (p15 <= 0)) AND ((p10 <= 0) OR (p11 <= 0)) AND ((p5 <= 0) OR (p14 <= 0)) AND ((p2 <= 0) OR (p9 <= 0)) AND ((p7 <= 0) OR (p12 <= 0)) AND ((p1 <= 0) OR (p12 <= 0)) AND ((p10 <= 0) OR (p18 <= 0)))",
"processed_size": 247,
"rewrites": 35
},
"result":
{
"edges": 8,
"markings": 9,
"produced_by": "state space / EG",
"value": false
},
"task":
{
"compoundnumber": 10,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 24
},
"threads": 1,
"type": "dfs"
},
"type": "eventual_occurrence",
"workflow": "stateequation"
}
}
],
"exit":
{
"error": null,
"memory": 68740,
"runtime": 3.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "CTLFireability.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "A(G((A(X(**)) OR (A(F(**)) OR (** OR (** OR (** OR (** OR **)))))))) : A(F(**)) : (A(G(E(F(**)))) OR A(X(A((** U **))))) : A(F(**)) : E(X(A(G(E(F(**)))))) : (A(F(**)) OR (E(F(**)) AND (A(X(**)) AND (E(F(**)) AND **)))) : A(X(A(F(**)))) : E(((A(F(**)) OR **) U A(X(**)))) : A(G((A(F(*)) OR E(X(*))))) : A(G(E(F(**)))) : (A(X(**)) AND (E((* R *)) AND **))"
},
"net":
{
"arcs": 92,
"conflict_clusters": 6,
"places": 23,
"places_significant": 17,
"singleton_clusters": 0,
"transitions": 28
},
"result":
{
"preliminary_value": "no no no no no no no no yes no yes ",
"value": "no no no no no no no no yes no yes "
},
"task":
{
"type": "compound"
}
}
lola: LoLA will run for 3570 seconds at most (--timelimit)
lola: NET
lola: input: PNML file (--pnml)
lola: reading net from model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file model.pnml
lola: 51/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 736
lola: finding significant places
lola: 23 places, 28 transitions, 17 significant places
lola: compute conflict clusters
lola: computed conflict clusters
lola: Computing conflicting sets
lola: Computing back conflicting sets
lola: TASK
lola: Reading formula in XML format (--xmlformula)
lola: reading pnml
lola: reading formula from CTLFireability.xml
lola: A (G (((((((A (X ((((1 <= p9) AND (1 <= p13)) OR ((1 <= p14) AND (1 <= p15)) OR ((1 <= p10) AND (1 <= p11)) OR ((1 <= p5) AND (1 <= p14)) OR ((1 <= p2) AND (1 <= p9)) OR ((1 <= p7) AND (1 <= p12)) OR ((1 <= p1) AND (1 <= p12)) OR ((1 <= p10) AND (1 <= p18))))) OR A (F ((((1 <= p4) AND (1 <= p8)) OR ((1 <= p17) AND (1 <= p19)) OR ((1 <= p0) AND (1 <= p17)) OR ((1 <= p16) AND (1 <= p17)) OR ((1 <= p4) AND (1 <= p17)) OR ((1 <= p8) AND (1 <= p19)) OR ((1 <= p0) AND (1 <= p8)) OR ((1 <= p8) AND (1 <= p16)))))) OR ((1 <= p14) AND (1 <= p20))) OR ((1 <= p9) AND (1 <= p20))) OR ((1 <= p10) AND (1 <= p20))) OR ((1 <= p12) AND (1 <= p20))) OR ((((1 <= p4) AND (1 <= p8)) OR ((1 <= p17) AND (1 <= p19)) OR ((1 <= p0) AND (1 <= p17)) OR ((1 <= p16) AND (1 <= p17)) OR ((1 <= p4) AND (1 <= p17)) OR ((1 <= p8) AND (1 <= p19)) OR ((1 <= p0) AND (1 <= p8)) OR ((1 <= p8) AND (1 <= p16))) AND (((1 <= p9) AND (1 <= p13)) OR ((1 <= p14) AND (1 <= p15)) OR ((1 <= p10) AND (1 <= p11)) OR ((1 <= p5) AND (1 <= p14)) OR ((1 <= p2) AND (1 <= p9)) OR ((1 <= p7) AND (1 <= p12)) OR ((1 <= p1) AND (1 <= p12)) OR ((1 <= p10) AND (1 <= p18))))))) : A (F ((((1 <= p9) AND (1 <= p13)) OR ((1 <= p14) AND (1 <= p15)) OR ((1 <= p10) AND (1 <= p11)) OR ((1 <= p5) AND (1 <= p14)) OR ((1 <= p2) AND (1 <= p9)) OR ((1 <= p7) AND (1 <= p12)) OR ((1 <= p1) AND (1 <= p12)) OR ((1 <= p10) AND (1 <= p18))))) : (A (G (E (F ((((1 <= p14) AND (1 <= p20)) OR ((1 <= p9) AND (1 <= p20)) OR ((1 <= p10) AND (1 <= p20)) OR ((1 <= p12) AND (1 <= p20)) OR (1 <= p3) OR (1 <= p21) OR (1 <= p6) OR (1 <= p22)))))) OR A (X (A ((((1 <= p16) OR (1 <= p0) OR (1 <= p19) OR (1 <= p4)) U (((1 <= p9) AND (1 <= p13)) OR ((1 <= p14) AND (1 <= p15)) OR ((1 <= p10) AND (1 <= p11)) OR ((1 <= p5) AND (1 <= p14)) OR ((1 <= p2) AND (1 <= p9)) OR ((1 <= p7) AND (1 <= p12)) OR ((1 <= p1) AND (1 <= p12)) OR ((1 <= p10) AND (1 <= p18)))))))) : A (F ((((1 <= p9) AND (1 <= p13)) OR ((1 <= p14) AND (1 <= p15)) OR ((1 <= p10) AND (1 <= p11)) OR ((1 <= p5) AND (1 <= p14)) OR ((1 <= p2) AND (1 <= p9)) OR ((1 <= p7) AND (1 <= p12)) OR ((1 <= p1) AND (1 <= p12)) OR ((1 <= p10) AND (1 <= p18))))) : E (X (A (G (E (F ((((1 <= p14) AND (1 <= p20)) OR ((1 <= p9) AND (1 <= p20)) OR ((1 <= p10) AND (1 <= p20)) OR ((1 <= p12) AND (1 <= p20))))))))) : (A (F ((((1 <= p9) AND (1 <= p13)) OR ((1 <= p14) AND (1 <= p15)) OR ((1 <= p10) AND (1 <= p11)) OR ((1 <= p5) AND (1 <= p14)) OR ((1 <= p2) AND (1 <= p9)) OR ((1 <= p7) AND (1 <= p12)) OR ((1 <= p1) AND (1 <= p12)) OR ((1 <= p10) AND (1 <= p18))))) OR (((E (F ((((1 <= p16) OR (1 <= p0) OR (1 <= p19) OR (1 <= p4)) AND (((1 <= p4) AND (1 <= p8)) OR ((1 <= p17) AND (1 <= p19)) OR ((1 <= p0) AND (1 <= p17)) OR ((1 <= p16) AND (1 <= p17)) OR ((1 <= p4) AND (1 <= p17)) OR ((1 <= p8) AND (1 <= p19)) OR ((1 <= p0) AND (1 <= p8)) OR ((1 <= p8) AND (1 <= p16)))))) AND A (X ((((1 <= p9) AND (1 <= p13)) OR ((1 <= p14) AND (1 <= p15)) OR ((1 <= p10) AND (1 <= p11)) OR ((1 <= p5) AND (1 <= p14)) OR ((1 <= p2) AND (1 <= p9)) OR ((1 <= p7) AND (1 <= p12)) OR ((1 <= p1) AND (1 <= p12)) OR ((1 <= p10) AND (1 <= p18)))))) AND E (F ((((1 <= p14) AND (1 <= p20)) OR ((1 <= p9) AND (1 <= p20)) OR ((1 <= p10) AND (1 <= p20)) OR ((1 <= p12) AND (1 <= p20)))))) AND ((1 <= p16) OR (1 <= p0) OR (1 <= p19) OR (1 <= p4) OR (((p9 <= 0) OR (p13 <= 0)) AND ((p14 <= 0) OR (p15 <= 0)) AND ((p10 <= 0) OR (p11 <= 0)) AND ((p5 <= 0) OR (p14 <= 0)) AND ((p2 <= 0) OR (p9 <= 0)) AND ((p7 <= 0) OR (p12 <= 0)) AND ((p1 <= 0) OR (p12 <= 0)) AND ((p10 <= 0) OR (p18 <= 0)))))) : A (X (A (F ((((1 <= p9) AND (1 <= p13)) OR ((1 <= p14) AND (1 <= p15)) OR ((1 <= p10) AND (1 <= p11)) OR ((1 <= p5) AND (1 <= p14)) OR ((1 <= p2) AND (1 <= p9)) OR ((1 <= p7) AND (1 <= p12)) OR ((1 <= p1) AND (1 <= p12)) OR ((1 <= p10) AND (1 <= p18))))))) : E (((A (F ((((1 <= p9) AND (1 <= p13)) OR ((1 <= p14) AND (1 <= p15)) OR ((1 <= p10) AND (1 <= p11)) OR ((1 <= p5) AND (1 <= p14)) OR ((1 <= p2) AND (1 <= p9)) OR ((1 <= p7) AND (1 <= p12)) OR ((1 <= p1) AND (1 <= p12)) OR ((1 <= p10) AND (1 <= p18))))) OR ((p3 <= 0) AND (p21 <= 0) AND (p6 <= 0) AND (p22 <= 0) AND (((1 <= p4) AND (1 <= p8)) OR ((1 <= p17) AND (1 <= p19)) OR ((1 <= p0) AND (1 <= p17)) OR ((1 <= p16) AND (1 <= p17)) OR ((1 <= p4) AND (1 <= p17)) OR ((1 <= p8) AND (1 <= p19)) OR ((1 <= p0) AND (1 <= p8)) OR ((1 <= p8) AND (1 <= p16))))) U A (X ((((1 <= p4) AND (1 <= p8)) OR ((1 <= p17) AND (1 <= p19)) OR ((1 <= p0) AND (1 <= p17)) OR ((1 <= p16) AND (1 <= p17)) OR ((1 <= p4) AND (1 <= p17)) OR ((1 <= p8) AND (1 <= p19)) OR ((1 <= p0) AND (1 <= p8)) OR ((1 <= p8) AND (1 <= p16))))))) : NOT(E (F ((E (G ((1 <= p0))) AND A (X (((1 <= p10) AND (1 <= p20)))))))) : A (G (E (F ((((1 <= p3) AND (1 <= p21)) OR ((1 <= p21) AND (1 <= p9) AND (1 <= p13))))))) : ((A (X ((((1 <= p8) AND (1 <= p16)) OR ((1 <= p2) AND (1 <= p9)) OR (p16 <= 0)))) AND NOT(A ((((p4 <= 0) OR (p8 <= 0)) U ((1 <= p8) AND (1 <= p16) AND (1 <= p7) AND (1 <= p12)))))) AND ((p8 <= 0) OR (p19 <= 0)))
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
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:315
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:335
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: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 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((A (X ((((1 <= p9) AND (1 <= p13)) OR ((1 <= p14) AND (1 <= p15)) OR ((1 <= p10) AND (1 <= p11)) OR ((1 <= p5) AND (1 <= p14)) OR ((1 <= p2) AND (1 <= p9)) OR ((1 <= p7) AND (1 <= p12)) OR ((1 <= p1) AND (1 <= p12)) OR ((1 <= p10) AND (1 <= p18))))) OR (A (F ((((1 <= p4) AND (1 <= p8)) OR ((1 <= p17) AND (1 <= p19)) OR ((1 <= p0) AND (1 <= p17)) OR ((1 <= p16) AND (1 <= p17)) OR (... (shortened)
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:813
lola: processed formula: AG((AX((((1 <= p9) AND (1 <= p13)) OR ((1 <= p14) AND (1 <= p15)) OR ((1 <= p10) AND (1 <= p11)) OR ((1 <= p5) AND (1 <= p14)) OR ((1 <= p2) AND (1 <= p9)) OR ((1 <= p7) AND (1 <= p12)) OR ((1 <= p1) AND (1 <= p12)) OR ((1 <= p10) AND (1 <= p18)))) OR (AF((((1 <= p4) AND (1 <= p8)) OR ((1 <= p17) AND (1 <= p19)) OR ((1 <= p0) AND (1 <= p17)) OR ((1 <= p16) AND (1 <= p17)) OR ((1 <= p4) ... (shortened)
lola: processed formula length: 1146
lola: 35 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: 67 markings, 95 edges
lola: ========================================
lola: subprocess 1 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (G (E (F ((((1 <= p14) AND (1 <= p20)) OR ((1 <= p9) AND (1 <= p20)) OR ((1 <= p10) AND (1 <= p20)) OR ((1 <= p12) AND (1 <= p20)) OR (1 <= p3) OR (1 <= p21) OR (1 <= p6) OR (1 <= p22)))))) OR A (X (A ((((1 <= p16) OR (1 <= p0) OR (1 <= p19) OR (1 <= p4)) U (((1 <= p9) AND (1 <= p13)) OR ((1 <= p14) AND (1 <= p15)) OR ((1 <= p10) AND (1 <= p11)) OR ((1 <= p5) AND (1 <= p14)) OR ((... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 1 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (E (F ((((1 <= p14) AND (1 <= p20)) OR ((1 <= p9) AND (1 <= p20)) OR ((1 <= p10) AND (1 <= p20)) OR ((1 <= p12) AND (1 <= p20)) OR (1 <= p3) OR (1 <= p21) OR (1 <= p6) OR (1 <= p22))))))
lola: ========================================
lola: SUBTASK
lola: checking liveness
lola: rewrite Frontend/Parser/formula_rewrite.k:603
lola: rewrite Frontend/Parser/formula_rewrite.k:613
lola: rewrite Frontend/Parser/formula_rewrite.k:703
lola: processed formula: (((1 <= p14) AND (1 <= p20)) OR ((1 <= p9) AND (1 <= p20)) OR ((1 <= p10) AND (1 <= p20)) OR ((1 <= p12) AND (1 <= p20)) OR (1 <= p3) OR (1 <= p21) OR (1 <= p6) OR (1 <= p22))
lola: processed formula length: 182
lola: 35 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
lola: using tscc preserving stubborn set method (--stubborn)
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 1
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: state equation task get result rewrite finished id 1
lola: state equation task get result unparse finished++ id 1
lola: formula 1: (((1 <= p14) AND (1 <= p20)) OR ((1 <= p9) AND (1 <= p20)) OR ((1 <= p10) AND (1 <= p20)) OR ((1 <= p12) AND (1 <= p20)) OR (1 <= p3) OR (1 <= p21) OR (1 <= p6) OR (1 <= p22))
lola: state equation task get result unparse finished id 1
lola: state equation: Generated DNF with 12 literals and 8 conjunctive subformulas
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: SUBRESULT
lola: result: no
lola: produced by: tscc_search
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (((p14 <= 0) OR (p20 <= 0)) AND ((p9 <= 0) OR (p20 <= 0)) AND ((p10 <= 0) OR (p20 <= 0)) AND ((p12 <= 0) OR (p20 <= 0)) AND (p3 <= 0) AND (p21 <= 0) AND (p6 <= 0) AND (p22 <= 0))
lola: The predicate is not live.
lola: 9 markings, 8 edges
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 128 literals and 16 conjunctive subformulas
lola: ========================================
lola: subprocess 2 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (A ((((1 <= p16) OR (1 <= p0) OR (1 <= p19) OR (1 <= p4)) U (((1 <= p9) AND (1 <= p13)) OR ((1 <= p14) AND (1 <= p15)) OR ((1 <= p10) AND (1 <= p11)) OR ((1 <= p5) AND (1 <= p14)) OR ((1 <= p2) AND (1 <= p9)) OR ((1 <= p7) AND (1 <= p12)) OR ((1 <= p1) AND (1 <= p12)) OR ((1 <= p10) AND (1 <= p18)))))))
lola: ========================================
lola: SUBTASK
lola: checking universal until from successors
lola: rewrite Frontend/Parser/formula_rewrite.k:577
lola: rewrite Frontend/Parser/formula_rewrite.k:756
lola: rewrite Frontend/Parser/formula_rewrite.k:691
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: A (X (A ((((1 <= p16) OR (1 <= p0) OR (1 <= p19) OR (1 <= p4)) U (((1 <= p9) AND (1 <= p13)) OR ((1 <= p14) AND (1 <= p15)) OR ((1 <= p10) AND (1 <= p11)) OR ((1 <= p5) AND (1 <= p14)) OR ((1 <= p2) AND (1 <= p9)) OR ((1 <= p7) AND (1 <= p12)) OR ((1 <= p1) AND (1 <= p12)) OR ((1 <= p10) AND (1 <= p18)))))))
lola: processed formula length: 319
lola: 37 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 / EXER)
lola: state space: using reachability graph (EXER version) (--search=depth)
lola: state space: using ltl preserving stubborn set method (--stubborn=tarjan)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: 1
lola: SUBRESULT
lola: result: no
lola: produced by: state space / EXER
lola: Predicate Phi does not hild until Predicate Psi on all paths from successors.
lola: 0 markings, 0 edges
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:753
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 <= p16) OR (1 <= p0) OR (1 <= p19) OR (1 <= p4))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 4 literals and 4 conjunctive subformulas
lola: state equation: write sara problem file to CTLFireability-2-0.sara
lola: state equation: calling and running sara
sara: try reading problem file CTLFireability-2-0.sara.
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: subprocess 2 will run for 396 seconds at most (--localtimelimit=0)
lola: lola: ================================================================================
lola: ...considering subproblem: E (X (A (G (E (F ((((1 <= p14) AND (1 <= p20)) OR ((1 <= p9) AND (1 <= p20)) OR ((1 <= p10) AND (1 <= p20)) OR ((1 <= p12) AND (1 <= p20)))))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:806
lola: rewrite Frontend/Parser/formula_rewrite.k:813
lola: rewrite Frontend/Parser/formula_rewrite.k:807
lola: processed formula: EX(AG(EF((((1 <= p14) AND (1 <= p20)) OR ((1 <= p9) AND (1 <= p20)) OR ((1 <= p10) AND (1 <= p20)) OR ((1 <= p12) AND (1 <= p20))))))
lola: processed formula length: 136
lola: 35 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: 26 markings, 55 edges
lola: ========================================
lola: subprocess 3 will run for 445 seconds at most (--localtimelimit=0)
lola: ========================================
sara: error: :117: error near 'TRANSITION': syntax error, unexpected KEY_TRANSITION, expecting SEMICOLON or COMMA
sara: error while reading Petri net from file -- aborting [#04]
sara: see manual for a documentation of this error
sara: last error message: No such file or directory
lola: ...considering subproblem: (A (F ((((1 <= p9) AND (1 <= p13)) OR ((1 <= p14) AND (1 <= p15)) OR ((1 <= p10) AND (1 <= p11)) OR ((1 <= p5) AND (1 <= p14)) OR ((1 <= p2) AND (1 <= p9)) OR ((1 <= p7) AND (1 <= p12)) OR ((1 <= p1) AND (1 <= p12)) OR ((1 <= p10) AND (1 <= p18))))) OR (E (F ((((1 <= p16) OR (1 <= p0) OR (1 <= p19) OR (1 <= p4)) AND (((1 <= p4) AND (1 <= p8)) OR ((1 <= p17) AND (1 <= p19)) OR ((1 <= p0... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 3 will run for 445 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((((1 <= p14) AND (1 <= p20)) OR ((1 <= p9) AND (1 <= p20)) OR ((1 <= p10) AND (1 <= p20)) OR ((1 <= p12) AND (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 <= p14) AND (1 <= p20)) OR ((1 <= p9) AND (1 <= p20)) OR ((1 <= p10) AND (1 <= p20)) OR ((1 <= p12) AND (1 <= p20)))))
lola: processed formula length: 132
lola: 33 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: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 2 markings, 1 edges
lola: ========================================
lola: subprocess 4 will run for 509 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((((1 <= p16) OR (1 <= p0) OR (1 <= p19) OR (1 <= p4)) AND (((1 <= p4) AND (1 <= p8)) OR ((1 <= p17) AND (1 <= p19)) OR ((1 <= p0) AND (1 <= p17)) OR ((1 <= p16) AND (1 <= p17)) OR ((1 <= p4) AND (1 <= p17)) OR ((1 <= p8) AND (1 <= p19)) OR ((1 <= p0) AND (1 <= p8)) OR ((1 <= p8) AND (1 <= p16))))))
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 <= p16) OR (1 <= p0) OR (1 <= p19) OR (1 <= p4)) AND (((1 <= p4) AND (1 <= p8)) OR ((1 <= p17) AND (1 <= p19)) OR ((1 <= p0) AND (1 <= p17)) OR ((1 <= p16) AND (1 <= p17)) OR ((1 <= p4) AND (1 <= p17)) OR ((1 <= p8) AND (1 <= p19)) OR ((1 <= p0) AND (1 <= p8)) OR ((1 <= p8) AND (1 <= p16))))))
lola: processed formula length: 315
lola: 33 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: formula 0: (((1 <= p16) OR (1 <= p0) OR (1 <= p19) OR (1 <= p4)) AND (((1 <= p4) AND (1 <= p8)) OR ((1 <= p17) AND (1 <= p19)) OR ((1 <= p0) AND (1 <= p17)) OR ((1 <= p16) AND (1 <= p17)) OR ((1 <= p4) AND (1 <= p17)) OR ((1 <= p8) AND (1 <= p19)) OR ((1 <= p0) AND (1 <= p8)) OR ((1 <= p8) AND (1 <= p16))))
lola: The predicate is reachable.
lola: 3 markings, 2 edges
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 96 literals and 32 conjunctive subformulas
lola: ========================================
lola: subprocess 5 will run for 594 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F ((((1 <= p9) AND (1 <= p13)) OR ((1 <= p14) AND (1 <= p15)) OR ((1 <= p10) AND (1 <= p11)) OR ((1 <= p5) AND (1 <= p14)) OR ((1 <= p2) AND (1 <= p9)) OR ((1 <= p7) AND (1 <= p12)) OR ((1 <= p1) AND (1 <= p12)) OR ((1 <= p10) AND (1 <= p18)))))
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: (((p9 <= 0) OR (p13 <= 0)) AND ((p14 <= 0) OR (p15 <= 0)) AND ((p10 <= 0) OR (p11 <= 0)) AND ((p5 <= 0) OR (p14 <= 0)) AND ((p2 <= 0) OR (p9 <= 0)) AND ((p7 <= 0) OR (p12 <= 0)) AND ((p1 <= 0) OR (p12 <= 0)) AND ((p10 <= 0) OR (p18 <= 0)))
lola: processed formula length: 247
lola: 35 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 <= p9) AND (1 <= p13)) OR ((1 <= p14) AND (1 <= p15)) OR ((1 <= p10) AND (1 <= p11)) OR ((1 <= p5) AND (1 <= p14)) OR ((1 <= p2) AND (1 <= p9)) OR ((1 <= p7) AND (1 <= p12)) OR ((1 <= p1) AND (1 <= p12)) OR ((1 <= p10) AND (1 <= p18)))
lola: state equation task get result unparse finished id 0
lola: SUBRESULT
lola: result: no
lola: produced by: state space / EG
lola: The predicate does not eventually occur.
lola: 9 markings, 8 edges
lola: ========================================
lola: subprocess 6 will run for 713 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((1 <= p16) OR (1 <= p0) OR (1 <= p19) OR (1 <= p4) OR (((p9 <= 0) OR (p13 <= 0)) AND ((p14 <= 0) OR (p15 <= 0)) AND ((p10 <= 0) OR (p11 <= 0)) AND ((p5 <= 0) OR (p14 <= 0)) AND ((p2 <= 0) OR (p9 <= 0)) AND ((p7 <= 0) OR (p12 <= 0)) AND ((p1 <= 0) OR (p12 <= 0)) AND ((p10 <= 0) OR (p18 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((1 <= p16) OR (1 <= p0) OR (1 <= p19) OR (1 <= p4) OR (((p9 <= 0) OR (p13 <= 0)) AND ((p14 <= 0) OR (p15 <= 0)) AND ((p10 <= 0) OR (p11 <= 0)) AND ((p5 <= 0) OR (p14 <= 0)) AND ((p2 <= 0) OR (p9 <= 0)) AND ((p7 <= 0) OR (p12 <= 0)) AND ((p1 <= 0) OR (p12 <= 0)) AND ((p10 <= 0) OR (p18 <= 0))))
lola: processed formula length: 307
lola: 32 rewrites
lola: closed formula file CTLFireability.xml
lola: processed formula with 20 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 7 will run for 891 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X ((((1 <= p9) AND (1 <= p13)) OR ((1 <= p14) AND (1 <= p15)) OR ((1 <= p10) AND (1 <= p11)) OR ((1 <= p5) AND (1 <= p14)) OR ((1 <= p2) AND (1 <= p9)) OR ((1 <= p7) AND (1 <= p12)) OR ((1 <= p1) AND (1 <= p12)) OR ((1 <= p10) AND (1 <= p18)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:812
lola: processed formula: AX((((1 <= p9) AND (1 <= p13)) OR ((1 <= p14) AND (1 <= p15)) OR ((1 <= p10) AND (1 <= p11)) OR ((1 <= p5) AND (1 <= p14)) OR ((1 <= p2) AND (1 <= p9)) OR ((1 <= p7) AND (1 <= p12)) OR ((1 <= p1) AND (1 <= p12)) OR ((1 <= p10) AND (1 <= p18))))
lola: processed formula length: 251
lola: 33 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: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 0 markings, 0 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: subprocess 4 will run for 509 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (A (F ((((1 <= p9) AND (1 <= p13)) OR ((1 <= p14) AND (1 <= p15)) OR ((1 <= p10) AND (1 <= p11)) OR ((1 <= p5) AND (1 <= p14)) OR ((1 <= p2) AND (1 <= p9)) OR ((1 <= p7) AND (1 <= p12)) OR ((1 <= p1) AND (1 <= p12)) OR ((1 <= p10) AND (1 <= p18)))))))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence from all successors
lola: rewrite Frontend/Parser/formula_rewrite.k:584
lola: rewrite Frontend/Parser/formula_rewrite.k:754
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: (((p9 <= 0) OR (p13 <= 0)) AND ((p14 <= 0) OR (p15 <= 0)) AND ((p10 <= 0) OR (p11 <= 0)) AND ((p5 <= 0) OR (p14 <= 0)) AND ((p2 <= 0) OR (p9 <= 0)) AND ((p7 <= 0) OR (p12 <= 0)) AND ((p1 <= 0) OR (p12 <= 0)) AND ((p10 <= 0) OR (p18 <= 0)))
lola: processed formula length: 247
lola: 35 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 /EXEG)
lola: state space: using reachability graph (EXEG version) (--search=depth)
lola: state space: using invisibility based 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 /EXEG
lola: The predicate does not eventually occur from all successors.
lola: 8 markings, 7 edges
lola: ========================================
lola: subprocess 5 will run for 594 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (((A (F ((((1 <= p9) AND (1 <= p13)) OR ((1 <= p14) AND (1 <= p15)) OR ((1 <= p10) AND (1 <= p11)) OR ((1 <= p5) AND (1 <= p14)) OR ((1 <= p2) AND (1 <= p9)) OR ((1 <= p7) AND (1 <= p12)) OR ((1 <= p1) AND (1 <= p12)) OR ((1 <= p10) AND (1 <= p18))))) OR ((p3 <= 0) AND (p21 <= 0) AND (p6 <= 0) AND (p22 <= 0) AND (((1 <= p4) AND (1 <= p8)) OR ((1 <= p17) AND (1 <= p19)) OR ((1 <= p0) AND... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:811
lola: rewrite Frontend/Parser/formula_rewrite.k:812
lola: rewrite Frontend/Parser/formula_rewrite.k:809
lola: processed formula: E((AF((((1 <= p9) AND (1 <= p13)) OR ((1 <= p14) AND (1 <= p15)) OR ((1 <= p10) AND (1 <= p11)) OR ((1 <= p5) AND (1 <= p14)) OR ((1 <= p2) AND (1 <= p9)) OR ((1 <= p7) AND (1 <= p12)) OR ((1 <= p1) AND (1 <= p12)) OR ((1 <= p10) AND (1 <= p18)))) OR ((p3 <= 0) AND (p21 <= 0) AND (p6 <= 0) AND (p22 <= 0) AND (((1 <= p4) AND (1 <= p8)) OR ((1 <= p17) AND (1 <= p19)) OR ((1 <= p0) AND (1 <=... (shortened)
lola: processed formula length: 817
lola: 35 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: 9 markings, 9 edges
lola: ========================================
lola: subprocess 6 will run for 713 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((A (F ((p0 <= 0))) OR E (X (((p10 <= 0) OR (p20 <= 0)))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:811
lola: rewrite Frontend/Parser/formula_rewrite.k:807
lola: rewrite Frontend/Parser/formula_rewrite.k:813
lola: processed formula: AG((AF((p0 <= 0)) OR EX(((p10 <= 0) OR (p20 <= 0)))))
lola: processed formula length: 54
lola: 35 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: ========================================
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 7424 markings, 49729 edges
lola: ========================================
lola: subprocess 7 will run for 891 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (X ((((1 <= p8) AND (1 <= p16)) OR ((1 <= p2) AND (1 <= p9)) OR (p16 <= 0)))) AND (E ((((1 <= p4) AND (1 <= p8)) R ((p8 <= 0) OR (p16 <= 0) OR (p7 <= 0) OR (p12 <= 0)))) AND ((p8 <= 0) OR (p19 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 7 will run for 891 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((p8 <= 0) OR (p19 <= 0))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((p8 <= 0) OR (p19 <= 0))
lola: processed formula length: 26
lola: 32 rewrites
lola: closed formula file CTLFireability.xml
lola: processed formula with 2 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 8 will run for 1189 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E ((((1 <= p4) AND (1 <= p8)) R ((p8 <= 0) OR (p16 <= 0) OR (p7 <= 0) OR (p12 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking existential release
lola: rewrite Frontend/Parser/formula_rewrite.k:576
lola: rewrite Frontend/Parser/formula_rewrite.k:736
lola: rewrite Frontend/Parser/formula_rewrite.k:696
lola: processed formula: E ((((1 <= p4) AND (1 <= p8)) R ((p8 <= 0) OR (p16 <= 0) OR (p7 <= 0) OR (p12 <= 0))))
lola: processed formula length: 89
lola: 35 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /ER)
lola: state space: using reachability graph (ER version) (--search=depth)
lola: state space: using ltl preserving stubborn set method (--stubborn=tarjan)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k: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 <= p8) AND (1 <= p16) AND (1 <= p7) AND (1 <= p12))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 4 literals and 1 conjunctive subformulas
lola: 1
lola: SUBRESULT
lola: result: yes
lola: produced by: state space /ER
lola: There is a path where Predicate Phi releases Predicate Psi.
lola: 8 markings, 7 edges
lola: ========================================
lola: subprocess 9 will run for 1783 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X ((((1 <= p8) AND (1 <= p16)) OR ((1 <= p2) AND (1 <= p9)) OR (p16 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:812
lola: processed formula: AX((((1 <= p8) AND (1 <= p16)) OR ((1 <= p2) AND (1 <= p9)) OR (p16 <= 0)))
lola: processed formula length: 77
lola: 33 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 8 will run for 1189 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (E (F ((((1 <= p3) AND (1 <= p21)) OR ((1 <= p21) AND (1 <= p9) AND (1 <= p13)))))))
lola: ========================================
lola: SUBTASK
lola: checking liveness
lola: rewrite Frontend/Parser/formula_rewrite.k:603
lola: rewrite Frontend/Parser/formula_rewrite.k:613
lola: rewrite Frontend/Parser/formula_rewrite.k:703
lola: processed formula: (((1 <= p3) AND (1 <= p21)) OR ((1 <= p21) AND (1 <= p9) AND (1 <= p13)))
lola: processed formula length: 74
lola: 35 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
lola: using tscc preserving stubborn set method (--stubborn)
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: (((p3 <= 0) OR (p21 <= 0)) AND ((p21 <= 0) OR (p9 <= 0) OR (p13 <= 0)))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 12 literals and 6 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: formula 1: (((1 <= p3) AND (1 <= p21)) OR ((1 <= p21) AND (1 <= p9) AND (1 <= p13)))
lola: state equation task get result unparse finished id 1
lola: state equation: Generated DNF with 5 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to CTLFireability-8-1.sara
lola: SUBRESULT
lola: result: no
lola: produced by: tscc_search
lola: state equation: calling and running sara
sara: try reading problem file CTLFireability-8-1.sara.
sara: error: :117: error near 'TRANSITION': syntax error, unexpected KEY_TRANSITION, expecting SEMICOLON or COMMA
sara: error while reading Petri net from file -- aborting [#04]
sara: see manual for a documentation of this error
sara: last error message: No such file or directory
lola: The predicate is not live.
lola: 12 markings, 11 edges
lola: ========================================
lola: subprocess 9 will run for 1783 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F ((((1 <= p9) AND (1 <= p13)) OR ((1 <= p14) AND (1 <= p15)) OR ((1 <= p10) AND (1 <= p11)) OR ((1 <= p5) AND (1 <= p14)) OR ((1 <= p2) AND (1 <= p9)) OR ((1 <= p7) AND (1 <= p12)) OR ((1 <= p1) AND (1 <= p12)) OR ((1 <= p10) AND (1 <= p18)))))
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: (((p9 <= 0) OR (p13 <= 0)) AND ((p14 <= 0) OR (p15 <= 0)) AND ((p10 <= 0) OR (p11 <= 0)) AND ((p5 <= 0) OR (p14 <= 0)) AND ((p2 <= 0) OR (p9 <= 0)) AND ((p7 <= 0) OR (p12 <= 0)) AND ((p1 <= 0) OR (p12 <= 0)) AND ((p10 <= 0) OR (p18 <= 0)))
lola: processed formula length: 247
lola: 35 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: 9 markings, 8 edges
lola: ========================================
lola: subprocess 10 will run for 3567 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F ((((1 <= p9) AND (1 <= p13)) OR ((1 <= p14) AND (1 <= p15)) OR ((1 <= p10) AND (1 <= p11)) OR ((1 <= p5) AND (1 <= p14)) OR ((1 <= p2) AND (1 <= p9)) OR ((1 <= p7) AND (1 <= p12)) OR ((1 <= p1) AND (1 <= p12)) OR ((1 <= p10) AND (1 <= p18)))))
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: (((p9 <= 0) OR (p13 <= 0)) AND ((p14 <= 0) OR (p15 <= 0)) AND ((p10 <= 0) OR (p11 <= 0)) AND ((p5 <= 0) OR (p14 <= 0)) AND ((p2 <= 0) OR (p9 <= 0)) AND ((p7 <= 0) OR (p12 <= 0)) AND ((p1 <= 0) OR (p12 <= 0)) AND ((p10 <= 0) OR (p18 <= 0)))
lola: processed formula length: 247
lola: 35 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: 9 markings, 8 edges
lola: ========================================
lola: RESULT
lola:
SUMMARY: no no no no no no no no yes no yes
lola:
preliminary result: no no no no no no no no yes no yes
lola: memory consumption: 68740 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="CSRepetitions-PT-02"
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 CSRepetitions-PT-02, 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 r182-oct2-158987914200660"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/CSRepetitions-PT-02.tgz
mv CSRepetitions-PT-02 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 '
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 ;