About the Execution of ITS-LoLa for QuasiCertifProtocol-PT-06
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 15743.020 | 3600000.00 | 105990.00 | 241.00 | TFFTFFFTTFTTFFTT | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/mnt/tpsp/fkordon/mcc2020-input.r176-tajo-158987872400788.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2020-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itslola
Input is QuasiCertifProtocol-PT-06, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r176-tajo-158987872400788
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 372K
-rw-r--r-- 1 mcc users 5.8K Apr 12 06:55 CTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Apr 12 06:55 CTLCardinality.xml
-rw-r--r-- 1 mcc users 3.2K Apr 11 07:55 CTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 11 07:55 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 24 05:37 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K Mar 24 05:37 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 5.8K Apr 14 12:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 33K Apr 28 14:02 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.1K Apr 14 12:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Apr 28 14:02 LTLFireability.xml
-rw-r--r-- 1 mcc users 6.0K Apr 10 13:51 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 10 13:51 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.5K Apr 9 20:24 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 15K Apr 9 20:24 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.6K Apr 10 22:24 UpperBounds.txt
-rw-r--r-- 1 mcc users 6.3K Apr 10 22:24 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 24 05:37 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 24 05:37 instance
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 iscolored
-rw-r--r-- 1 mcc users 153K Mar 24 05:37 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 QuasiCertifProtocol-PT-06-CTLFireability-00
FORMULA_NAME QuasiCertifProtocol-PT-06-CTLFireability-01
FORMULA_NAME QuasiCertifProtocol-PT-06-CTLFireability-02
FORMULA_NAME QuasiCertifProtocol-PT-06-CTLFireability-03
FORMULA_NAME QuasiCertifProtocol-PT-06-CTLFireability-04
FORMULA_NAME QuasiCertifProtocol-PT-06-CTLFireability-05
FORMULA_NAME QuasiCertifProtocol-PT-06-CTLFireability-06
FORMULA_NAME QuasiCertifProtocol-PT-06-CTLFireability-07
FORMULA_NAME QuasiCertifProtocol-PT-06-CTLFireability-08
FORMULA_NAME QuasiCertifProtocol-PT-06-CTLFireability-09
FORMULA_NAME QuasiCertifProtocol-PT-06-CTLFireability-10
FORMULA_NAME QuasiCertifProtocol-PT-06-CTLFireability-11
FORMULA_NAME QuasiCertifProtocol-PT-06-CTLFireability-12
FORMULA_NAME QuasiCertifProtocol-PT-06-CTLFireability-13
FORMULA_NAME QuasiCertifProtocol-PT-06-CTLFireability-14
FORMULA_NAME QuasiCertifProtocol-PT-06-CTLFireability-15
=== Now, execution of the tool begins
BK_START 1591181918978
bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-03 10:58:40] [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 10:58:40] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-03 10:58:40] [INFO ] Load time of PNML (sax parser for PT used): 53 ms
[2020-06-03 10:58:40] [INFO ] Transformed 270 places.
[2020-06-03 10:58:40] [INFO ] Transformed 116 transitions.
[2020-06-03 10:58:40] [INFO ] Parsed PT model containing 270 places and 116 transitions in 91 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 16 ms.
Incomplete random walk after 100000 steps, including 9832 resets, run finished after 381 ms. (steps per millisecond=262 ) properties seen :[1, 0, 0, 0, 0, 0, 1, 0, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 1, 1, 0, 0, 0, 0, 0, 1, 1, 1, 0, 0, 1, 0]
// Phase 1: matrix 116 rows 270 cols
[2020-06-03 10:58:41] [INFO ] Computed 155 place invariants in 21 ms
[2020-06-03 10:58:41] [INFO ] [Real]Absence check using 3 positive place invariants in 17 ms returned sat
[2020-06-03 10:58:41] [INFO ] [Real]Absence check using 3 positive and 152 generalized place invariants in 58 ms returned sat
[2020-06-03 10:58:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 10:58:41] [INFO ] [Real]Absence check using state equation in 155 ms returned sat
[2020-06-03 10:58:41] [INFO ] Computed and/alt/rep : 108/283/108 causal constraints in 17 ms.
[2020-06-03 10:58:41] [INFO ] Added : 18 causal constraints over 4 iterations in 110 ms. Result :sat
[2020-06-03 10:58:41] [INFO ] [Real]Absence check using 3 positive place invariants in 13 ms returned sat
[2020-06-03 10:58:41] [INFO ] [Real]Absence check using 3 positive and 152 generalized place invariants in 59 ms returned sat
[2020-06-03 10:58:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 10:58:42] [INFO ] [Real]Absence check using state equation in 242 ms returned unsat
[2020-06-03 10:58:42] [INFO ] [Real]Absence check using 3 positive place invariants in 6 ms returned sat
[2020-06-03 10:58:42] [INFO ] [Real]Absence check using 3 positive and 152 generalized place invariants in 55 ms returned sat
[2020-06-03 10:58:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 10:58:42] [INFO ] [Real]Absence check using state equation in 216 ms returned sat
[2020-06-03 10:58:42] [INFO ] Computed and/alt/rep : 108/283/108 causal constraints in 12 ms.
[2020-06-03 10:58:42] [INFO ] Added : 21 causal constraints over 5 iterations in 75 ms. Result :sat
[2020-06-03 10:58:42] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2020-06-03 10:58:42] [INFO ] [Real]Absence check using 3 positive and 152 generalized place invariants in 42 ms returned sat
[2020-06-03 10:58:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 10:58:42] [INFO ] [Real]Absence check using state equation in 159 ms returned sat
[2020-06-03 10:58:42] [INFO ] Computed and/alt/rep : 108/283/108 causal constraints in 10 ms.
[2020-06-03 10:58:42] [INFO ] Added : 43 causal constraints over 9 iterations in 90 ms. Result :sat
[2020-06-03 10:58:42] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2020-06-03 10:58:42] [INFO ] [Real]Absence check using 3 positive and 152 generalized place invariants in 36 ms returned sat
[2020-06-03 10:58:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 10:58:43] [INFO ] [Real]Absence check using state equation in 146 ms returned sat
[2020-06-03 10:58:43] [INFO ] Computed and/alt/rep : 108/283/108 causal constraints in 8 ms.
[2020-06-03 10:58:43] [INFO ] Added : 25 causal constraints over 5 iterations in 80 ms. Result :sat
[2020-06-03 10:58:43] [INFO ] [Real]Absence check using 3 positive place invariants in 7 ms returned sat
[2020-06-03 10:58:43] [INFO ] [Real]Absence check using 3 positive and 152 generalized place invariants in 63 ms returned sat
[2020-06-03 10:58:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 10:58:43] [INFO ] [Real]Absence check using state equation in 196 ms returned sat
[2020-06-03 10:58:43] [INFO ] Computed and/alt/rep : 108/283/108 causal constraints in 9 ms.
[2020-06-03 10:58:43] [INFO ] Added : 25 causal constraints over 5 iterations in 61 ms. Result :sat
[2020-06-03 10:58:43] [INFO ] [Real]Absence check using 3 positive place invariants in 8 ms returned sat
[2020-06-03 10:58:43] [INFO ] [Real]Absence check using 3 positive and 152 generalized place invariants in 66 ms returned sat
[2020-06-03 10:58:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 10:58:43] [INFO ] [Real]Absence check using state equation in 203 ms returned sat
[2020-06-03 10:58:43] [INFO ] Computed and/alt/rep : 108/283/108 causal constraints in 9 ms.
[2020-06-03 10:58:43] [INFO ] Added : 21 causal constraints over 5 iterations in 60 ms. Result :sat
[2020-06-03 10:58:44] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2020-06-03 10:58:44] [INFO ] [Real]Absence check using 3 positive and 152 generalized place invariants in 55 ms returned sat
[2020-06-03 10:58:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 10:58:44] [INFO ] [Real]Absence check using state equation in 196 ms returned sat
[2020-06-03 10:58:44] [INFO ] Computed and/alt/rep : 108/283/108 causal constraints in 8 ms.
[2020-06-03 10:58:44] [INFO ] Added : 50 causal constraints over 10 iterations in 143 ms. Result :sat
[2020-06-03 10:58:44] [INFO ] [Real]Absence check using 3 positive place invariants in 6 ms returned sat
[2020-06-03 10:58:44] [INFO ] [Real]Absence check using 3 positive and 152 generalized place invariants in 59 ms returned sat
[2020-06-03 10:58:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 10:58:44] [INFO ] [Real]Absence check using state equation in 228 ms returned sat
[2020-06-03 10:58:44] [INFO ] Computed and/alt/rep : 108/283/108 causal constraints in 8 ms.
[2020-06-03 10:58:44] [INFO ] Added : 27 causal constraints over 6 iterations in 76 ms. Result :sat
[2020-06-03 10:58:44] [INFO ] [Real]Absence check using 3 positive place invariants in 8 ms returned sat
[2020-06-03 10:58:44] [INFO ] [Real]Absence check using 3 positive and 152 generalized place invariants in 37 ms returned sat
[2020-06-03 10:58:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 10:58:45] [INFO ] [Real]Absence check using state equation in 243 ms returned sat
[2020-06-03 10:58:45] [INFO ] Computed and/alt/rep : 108/283/108 causal constraints in 8 ms.
[2020-06-03 10:58:45] [INFO ] Added : 20 causal constraints over 4 iterations in 66 ms. Result :sat
[2020-06-03 10:58:45] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2020-06-03 10:58:45] [INFO ] [Real]Absence check using 3 positive and 152 generalized place invariants in 51 ms returned sat
[2020-06-03 10:58:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 10:58:45] [INFO ] [Real]Absence check using state equation in 194 ms returned sat
[2020-06-03 10:58:45] [INFO ] Computed and/alt/rep : 108/283/108 causal constraints in 9 ms.
[2020-06-03 10:58:45] [INFO ] Added : 47 causal constraints over 10 iterations in 120 ms. Result :sat
[2020-06-03 10:58:45] [INFO ] [Real]Absence check using 3 positive place invariants in 6 ms returned sat
[2020-06-03 10:58:45] [INFO ] [Real]Absence check using 3 positive and 152 generalized place invariants in 56 ms returned sat
[2020-06-03 10:58:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 10:58:46] [INFO ] [Real]Absence check using state equation in 189 ms returned sat
[2020-06-03 10:58:46] [INFO ] Computed and/alt/rep : 108/283/108 causal constraints in 12 ms.
[2020-06-03 10:58:46] [INFO ] Added : 49 causal constraints over 10 iterations in 123 ms. Result :sat
[2020-06-03 10:58:46] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2020-06-03 10:58:46] [INFO ] [Real]Absence check using 3 positive and 152 generalized place invariants in 39 ms returned sat
[2020-06-03 10:58:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 10:58:46] [INFO ] [Real]Absence check using state equation in 144 ms returned sat
[2020-06-03 10:58:46] [INFO ] Computed and/alt/rep : 108/283/108 causal constraints in 8 ms.
[2020-06-03 10:58:46] [INFO ] Added : 26 causal constraints over 6 iterations in 67 ms. Result :sat
[2020-06-03 10:58:46] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2020-06-03 10:58:46] [INFO ] [Real]Absence check using 3 positive and 152 generalized place invariants in 49 ms returned sat
[2020-06-03 10:58:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 10:58:46] [INFO ] [Real]Absence check using state equation in 177 ms returned sat
[2020-06-03 10:58:46] [INFO ] Computed and/alt/rep : 108/283/108 causal constraints in 8 ms.
[2020-06-03 10:58:46] [INFO ] Added : 49 causal constraints over 10 iterations in 113 ms. Result :sat
[2020-06-03 10:58:46] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2020-06-03 10:58:46] [INFO ] [Real]Absence check using 3 positive and 152 generalized place invariants in 37 ms returned sat
[2020-06-03 10:58:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 10:58:47] [INFO ] [Real]Absence check using state equation in 136 ms returned sat
[2020-06-03 10:58:47] [INFO ] Computed and/alt/rep : 108/283/108 causal constraints in 6 ms.
[2020-06-03 10:58:47] [INFO ] Added : 27 causal constraints over 6 iterations in 54 ms. Result :sat
[2020-06-03 10:58:47] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2020-06-03 10:58:47] [INFO ] [Real]Absence check using 3 positive and 152 generalized place invariants in 32 ms returned unsat
[2020-06-03 10:58:47] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2020-06-03 10:58:47] [INFO ] [Real]Absence check using 3 positive and 152 generalized place invariants in 34 ms returned sat
[2020-06-03 10:58:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 10:58:47] [INFO ] [Real]Absence check using state equation in 112 ms returned unsat
Successfully simplified 3 atomic propositions for a total of 3 simplifications.
[2020-06-03 10:58:47] [INFO ] Flatten gal took : 45 ms
[2020-06-03 10:58:47] [INFO ] Flatten gal took : 19 ms
[2020-06-03 10:58:47] [INFO ] Export to MCC properties in file /home/mcc/execution/CTLFireability.sr.xml took 5 ms.
[2020-06-03 10:58:47] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 3 ms.
info: Time: 3600 - MCC
vrfy: Checking CTLFireability @ QuasiCertifProtocol-PT-06 @ 3570 seconds
FORMULA QuasiCertifProtocol-PT-06-CTLFireability-01 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA QuasiCertifProtocol-PT-06-CTLFireability-03 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA QuasiCertifProtocol-PT-06-CTLFireability-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA QuasiCertifProtocol-PT-06-CTLFireability-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA QuasiCertifProtocol-PT-06-CTLFireability-08 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA QuasiCertifProtocol-PT-06-CTLFireability-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA QuasiCertifProtocol-PT-06-CTLFireability-00 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA QuasiCertifProtocol-PT-06-CTLFireability-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA QuasiCertifProtocol-PT-06-CTLFireability-02 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA QuasiCertifProtocol-PT-06-CTLFireability-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA QuasiCertifProtocol-PT-06-CTLFireability-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA QuasiCertifProtocol-PT-06-CTLFireability-09 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA QuasiCertifProtocol-PT-06-CTLFireability-04 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA QuasiCertifProtocol-PT-06-CTLFireability-06 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA QuasiCertifProtocol-PT-06-CTLFireability-05 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA QuasiCertifProtocol-PT-06-CTLFireability-07 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 3481
rslt: Output for CTLFireability @ QuasiCertifProtocol-PT-06
{
"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 10:58:47 2020
",
"timelimit": 3570
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 222
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 222
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 1,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "EG(AF((1 <= p54)))",
"processed_size": 18,
"rewrites": 57
},
"net":
{
"conflict_clusters": 32,
"singleton_clusters": 0
},
"result":
{
"edges": 10,
"markings": 10,
"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"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 0,
"type": "boolean"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 237
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 2,
"E": 1,
"F": 2,
"G": 0,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "AF(AX(EF((1 <= p49))))",
"processed_size": 22,
"rewrites": 58
},
"net":
{
"conflict_clusters": 32,
"singleton_clusters": 0
},
"result":
{
"edges": 29014999,
"markings": 2271960,
"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": 252
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 1,
"F": 0,
"G": 1,
"U": 0,
"X": 1,
"aconj": 1,
"adisj": 1,
"aneg": 2,
"comp": 10,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 10,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 10,
"visible_transitions": 0
},
"processed": "EG((AX(((p17 <= 0) OR (p162 <= 0) OR (p179 <= 0) OR (p188 <= 0) OR (p196 <= 0) OR (p203 <= 0) OR (p209 <= 0) OR (p218 <= 0))) OR ((1 <= p0) AND (1 <= p35))))",
"processed_size": 164,
"rewrites": 57
},
"net":
{
"conflict_clusters": 32,
"singleton_clusters": 0
},
"result":
{
"edges": 9,
"markings": 10,
"produced_by": "CTL model checker",
"value": true
},
"task":
{
"compoundnumber": 2,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 271
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 2,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 2,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "AF(EX(AX(((1 <= p0) AND (1 <= p32)))))",
"processed_size": 38,
"rewrites": 58
},
"net":
{
"conflict_clusters": 32,
"singleton_clusters": 0
},
"result":
{
"edges": 15922698,
"markings": 2267723,
"produced_by": "CTL model checker",
"value": true
},
"task":
{
"compoundnumber": 3,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 291
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "E (F (((1 <= p0) AND (1 <= p22))))",
"processed_size": 34,
"rewrites": 56
},
"result":
{
"edges": 21,
"markings": 22,
"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": 2,
"problems": 2
},
"type": "reachability",
"workflow": "stateequation||search"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 318
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 3,
"adisj": 1,
"aneg": 0,
"comp": 14,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 14,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 14,
"visible_transitions": 0
},
"processed": "E (F ((((1 <= p39) AND (1 <= p256) AND (1 <= p40) AND (1 <= p224)) OR ((1 <= p109) AND (1 <= p110) AND (1 <= p111) AND (1 <= p121) AND (1 <= p122) AND (1 <= p123) AND (1 <= p124) AND (1 <= p170)) OR ((1 <= p43) AND (1 <= p221)))))",
"processed_size": 232,
"rewrites": 56
},
"result":
{
"edges": 10,
"markings": 11,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 5,
"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": 350
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 0,
"G": 1,
"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": "E (G ((p53 <= 0)))",
"processed_size": 18,
"rewrites": 56
},
"result":
{
"edges": 10,
"markings": 11,
"produced_by": "state space / EG",
"value": true
},
"task":
{
"compoundnumber": 6,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 3
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "possible_preservation",
"workflow": "stateequation"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 389
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 3,
"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": 19,
"visible_transitions": 0
},
"processed": "E (G (((p19 <= 0) OR (p177 <= 0) OR (p183 <= 0) OR (p186 <= 0) OR (p190 <= 0) OR (p197 <= 0) OR (p211 <= 0) OR (p220 <= 0) OR (p0 <= 0) OR (p5 <= 0) OR (((p0 <= 0) OR (p17 <= 0)) AND ((p20 <= 0) OR (p161 <= 0) OR (p180 <= 0) OR (p185 <= 0) OR (p195 <= 0) OR (p198 <= 0) OR (p210 <= 0) OR (p219 <= 0))))))",
"processed_size": 322,
"rewrites": 56
},
"result":
{
"edges": 10,
"markings": 11,
"produced_by": "state space / EG",
"value": true
},
"task":
{
"compoundnumber": 7,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 63
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 30,
"problems": 2
},
"type": "possible_preservation",
"workflow": "stateequation"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 437
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 7,
"adisj": 1,
"aneg": 0,
"comp": 56,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 56,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 56,
"visible_transitions": 0
},
"processed": "(((1 <= p21) AND (1 <= p176) AND (1 <= p181) AND (1 <= p192) AND (1 <= p199) AND (1 <= p202) AND (1 <= p205) AND (1 <= p214)) OR ((1 <= p18) AND (1 <= p163) AND (1 <= p174) AND (1 <= p187) AND (1 <= p193) AND (1 <= p204) AND (1 <= p216) AND (1 <= p217)) OR ((1 <= p24) AND (1 <= p173) AND (1 <= p182) AND (1 <= p191) AND (1 <= p194) AND (1 <= p201) AND (1 <= p206) AND (1 <= p215)) OR ((1 <= p17) AND (1 <= p162) AND (1 <= p179) AND (1 <= p188) AND (1 <= p196) AND (1 <= p203) AND (1 <= p209) AND (1 <= p218)) OR ((1 <= p20) AND (1 <= p161) AND (1 <= p180) AND (1 <= p185) AND (1 <= p195) AND (1 <= p198) AND (1 <= p210) AND (1 <= p219)) OR ((1 <= p22) AND (1 <= p175) AND (1 <= p178) AND (1 <= p184) AND (1 <= p189) AND (1 <= p200) AND (1 <= p212) AND (1 <= p213)) OR ((1 <= p19) AND (1 <= p177) AND (1 <= p183) AND (1 <= p186) AND (1 <= p190) AND (1 <= p197) AND (1 <= p211) AND (1 <= p220)))",
"processed_size": 900,
"rewrites": 58
},
"result":
{
"edges": 54,
"markings": 55,
"produced_by": "tscc_search",
"value": false
},
"task":
{
"compoundnumber": 8,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "tscc preserving/always up"
}
},
"stateequation":
{
"literals": 56,
"problems": 7
},
"store":
{
"type": "dfs/tscc"
},
"type": "liveness",
"workflow": "stateequation"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 500
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 1,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"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": "AF((EG((1 <= p53)) AND ((1 <= p42) AND (1 <= p249))))",
"processed_size": 53,
"rewrites": 57
},
"net":
{
"conflict_clusters": 32,
"singleton_clusters": 0
},
"result":
{
"edges": 19,
"markings": 10,
"produced_by": "CTL model checker",
"value": false
},
"task":
{
"compoundnumber": 9,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 583
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 2,
"E": 0,
"F": 1,
"G": 0,
"U": 1,
"X": 0,
"aconj": 3,
"adisj": 0,
"aneg": 0,
"comp": 6,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 6,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "A(((1 <= p0) AND (1 <= p38)) U (AF(((1 <= p0) AND (1 <= p16))) OR ((1 <= p37) AND (1 <= p223))))",
"processed_size": 96,
"rewrites": 57
},
"net":
{
"conflict_clusters": 32,
"singleton_clusters": 0
},
"result":
{
"edges": 10,
"markings": 10,
"produced_by": "CTL model checker",
"value": false
},
"task":
{
"compoundnumber": 10,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 700
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 2,
"E": 0,
"F": 2,
"G": 0,
"U": 0,
"X": 0,
"aconj": 3,
"adisj": 1,
"aneg": 0,
"comp": 6,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 6,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "AF((((1 <= p0) AND (1 <= p30)) AND AF((((1 <= p0) AND (1 <= p16)) OR ((1 <= p34) AND (1 <= p238))))))",
"processed_size": 102,
"rewrites": 57
},
"net":
{
"conflict_clusters": 32,
"singleton_clusters": 0
},
"result":
{
"edges": 9,
"markings": 10,
"produced_by": "CTL model checker",
"value": false
},
"task":
{
"compoundnumber": 11,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 875
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 1,
"F": 2,
"G": 0,
"U": 0,
"X": 0,
"aconj": 8,
"adisj": 8,
"aneg": 3,
"comp": 29,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 29,
"taut": 0,
"tconj": 2,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 16,
"visible_transitions": 0
},
"processed": "EF((AF((((p0 <= 0) OR (p52 <= 0)) AND ((p0 <= 0) OR (p50 <= 0)) AND ((p0 <= 0) OR (p51 <= 0)) AND ((p0 <= 0) OR (p48 <= 0)) AND ((p0 <= 0) OR (p45 <= 0)) AND ((p0 <= 0) OR (p47 <= 0)) AND ((p0 <= 0) OR (p46 <= 0)))) AND ((1 <= p49) AND (((1 <= p0) AND (1 <= p37)) OR ((1 <= p0) AND (1 <= p38)) OR ((1 <= p0) AND (1 <= p44)) OR ((1 <= p0) AND (1 <= p41)) OR ((1 <= p0) AND (1 <= p40)) OR ((1 <= p0) AND (1 <= p43)) OR ((1 <= p0) AND (1 <= p42))))))",
"processed_size": 460,
"rewrites": 57
},
"net":
{
"conflict_clusters": 32,
"singleton_clusters": 0
},
"result":
{
"edges": 18341858,
"markings": 2271960,
"produced_by": "CTL model checker",
"value": false
},
"task":
{
"compoundnumber": 12,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1160
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 2,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 8,
"adisj": 1,
"aneg": 2,
"comp": 22,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 22,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 16,
"visible_transitions": 0
},
"processed": "A(AG((((p0 <= 0) OR (p52 <= 0)) AND ((p0 <= 0) OR (p50 <= 0)) AND ((p0 <= 0) OR (p51 <= 0)) AND ((p0 <= 0) OR (p48 <= 0)) AND ((p0 <= 0) OR (p45 <= 0)) AND ((p0 <= 0) OR (p47 <= 0)) AND ((p0 <= 0) OR (p46 <= 0)))) R ((p60 <= 0) OR (p225 <= 0) OR (p226 <= 0) OR (p227 <= 0) OR (p228 <= 0) OR (p229 <= 0) OR (p230 <= 0) OR (p231 <= 0)))",
"processed_size": 348,
"rewrites": 57
},
"net":
{
"conflict_clusters": 32,
"singleton_clusters": 0
},
"result":
{
"edges": 86650,
"markings": 14648,
"produced_by": "CTL model checker",
"value": false
},
"task":
{
"compoundnumber": 13,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1741
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1741
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 7,
"adisj": 0,
"aneg": 0,
"comp": 14,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 14,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 8,
"visible_transitions": 0
},
"processed": "(((1 <= p0) AND (1 <= p37)) OR ((1 <= p0) AND (1 <= p38)) OR ((1 <= p0) AND (1 <= p44)) OR ((1 <= p0) AND (1 <= p41)) OR ((1 <= p0) AND (1 <= p40)) OR ((1 <= p0) AND (1 <= p43)) OR ((1 <= p0) AND (1 <= p42)))",
"processed_size": 208,
"rewrites": 66
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 14,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3482
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 7,
"adisj": 1,
"aneg": 1,
"comp": 14,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 14,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 14,
"visible_transitions": 0
},
"processed": "(((p36 <= 0) OR (p240 <= 0)) AND ((p35 <= 0) OR (p239 <= 0)) AND ((p33 <= 0) OR (p237 <= 0)) AND ((p34 <= 0) OR (p238 <= 0)) AND ((p39 <= 0) OR (p256 <= 0)) AND ((p30 <= 0) OR (p242 <= 0)) AND ((p29 <= 0) OR (p241 <= 0)))",
"processed_size": 228,
"rewrites": 58
},
"result":
{
"edges": 10,
"markings": 11,
"produced_by": "state space / EG",
"value": false
},
"task":
{
"compoundnumber": 15,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 22
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 14,
"problems": 7
},
"type": "eventual_occurrence",
"workflow": "stateequation"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 14,
"type": "boolean"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3482
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 0,
"U": 1,
"X": 0,
"aconj": 0,
"adisj": 2,
"aneg": 0,
"comp": 14,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 14,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 7,
"visible_transitions": 0
},
"processed": "(F (((1 <= p16) OR (1 <= p9) OR (1 <= p10) OR (1 <= p11) OR (1 <= p12) OR (1 <= p13) OR (1 <= p14))) U ((1 <= p16) OR (1 <= p9) OR (1 <= p10) OR (1 <= p11) OR (1 <= p12) OR (1 <= p13) OR (1 <= p14)))",
"processed_size": 211,
"rewrites": 64
},
"result":
{
"edges": 11,
"markings": 11,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 15,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "existential single path",
"workflow": "product automaton"
}
}
],
"exit":
{
"error": null,
"memory": 62804,
"runtime": 89.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "CTLFireability.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "E(G(*)) : (E(G(A(F(**)))) AND A(X(**))) : A(G(E(F(**)))) : A(F(A(X(E(F(**)))))) : E(F((A(F(*)) AND (* AND *)))) : (A(F(**)) OR (** OR (** OR (** OR (** OR (** OR (** OR **))))))) : A((A(G(*)) R *)) : E((E(G(*)) R *)) : E(F(**)) : A(F((** AND A(F(**))))) : E(G(**)) : E(G((A(X(*)) OR *))) : A((** U (A(F(**)) OR **))) : A(F((E(G(**)) AND (** AND **)))) : A(F(E(X(A(X(**)))))) : E(F(**))"
},
"net":
{
"arcs": 659,
"conflict_clusters": 32,
"places": 270,
"places_significant": 115,
"singleton_clusters": 0,
"transitions": 116
},
"result":
{
"preliminary_value": "yes no no yes no no no yes yes no yes yes no no yes yes ",
"value": "yes no no yes no no no yes yes no yes yes no no yes 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: 386/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 8640
lola: finding significant places
lola: 270 places, 116 transitions, 115 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: NOT(A (F ((1 <= p53)))) : (E (G (A (F ((1 <= p54))))) AND A (X ((((p32 <= 0) AND (p23 <= 0) AND (p25 <= 0) AND (p26 <= 0) AND (p27 <= 0) AND (p28 <= 0) AND (p31 <= 0)) OR ((1 <= p0) AND (1 <= p21)) OR ((1 <= p0) AND (1 <= p20)) OR ((1 <= p0) AND (1 <= p22)) OR ((1 <= p0) AND (1 <= p17)) OR ((1 <= p0) AND (1 <= p19)) OR ((1 <= p0) AND (1 <= p18)) OR ((1 <= p0) AND (1 <= p24)) OR ((1 <= p49) AND (1 <= p254) AND (1 <= p255) AND (1 <= p257) AND (1 <= p258) AND (1 <= p259) AND (1 <= p260) AND (1 <= p261)))))) : A (G (A (G (E (F ((((1 <= p21) AND (1 <= p176) AND (1 <= p181) AND (1 <= p192) AND (1 <= p199) AND (1 <= p202) AND (1 <= p205) AND (1 <= p214)) OR ((1 <= p18) AND (1 <= p163) AND (1 <= p174) AND (1 <= p187) AND (1 <= p193) AND (1 <= p204) AND (1 <= p216) AND (1 <= p217)) OR ((1 <= p24) AND (1 <= p173) AND (1 <= p182) AND (1 <= p191) AND (1 <= p194) AND (1 <= p201) AND (1 <= p206) AND (1 <= p215)) OR ((1 <= p17) AND (1 <= p162) AND (1 <= p179) AND (1 <= p188) AND (1 <= p196) AND (1 <= p203) AND (1 <= p209) AND (1 <= p218)) OR ((1 <= p20) AND (1 <= p161) AND (1 <= p180) AND (1 <= p185) AND (1 <= p195) AND (1 <= p198) AND (1 <= p210) AND (1 <= p219)) OR ((1 <= p22) AND (1 <= p175) AND (1 <= p178) AND (1 <= p184) AND (1 <= p189) AND (1 <= p200) AND (1 <= p212) AND (1 <= p213)) OR ((1 <= p19) AND (1 <= p177) AND (1 <= p183) AND (1 <= p186) AND (1 <= p190) AND (1 <= p197) AND (1 <= p211) AND (1 <= p220))))))))) : A (F (A (X (E (F ((1 <= p49))))))) : NOT(A (G (((E (G ((((1 <= p0) AND (1 <= p52)) OR ((1 <= p0) AND (1 <= p50)) OR ((1 <= p0) AND (1 <= p51)) OR ((1 <= p0) AND (1 <= p48)) OR ((1 <= p0) AND (1 <= p45)) OR ((1 <= p0) AND (1 <= p47)) OR ((1 <= p0) AND (1 <= p46))))) OR (p49 <= 0)) OR (((p0 <= 0) OR (p37 <= 0)) AND ((p0 <= 0) OR (p38 <= 0)) AND ((p0 <= 0) OR (p44 <= 0)) AND ((p0 <= 0) OR (p41 <= 0)) AND ((p0 <= 0) OR (p40 <= 0)) AND ((p0 <= 0) OR (p43 <= 0)) AND ((p0 <= 0) OR (p42 <= 0))))))) : (((((((A (F ((((1 <= p36) AND (1 <= p240)) OR ((1 <= p35) AND (1 <= p239)) OR ((1 <= p33) AND (1 <= p237)) OR ((1 <= p34) AND (1 <= p238)) OR ((1 <= p39) AND (1 <= p256)) OR ((1 <= p30) AND (1 <= p242)) OR ((1 <= p29) AND (1 <= p241))))) OR ((1 <= p0) AND (1 <= p37))) OR ((1 <= p0) AND (1 <= p38))) OR ((1 <= p0) AND (1 <= p44))) OR ((1 <= p0) AND (1 <= p41))) OR ((1 <= p0) AND (1 <= p40))) OR ((1 <= p0) AND (1 <= p43))) OR ((1 <= p0) AND (1 <= p42))) : NOT(E ((E (F ((((1 <= p0) AND (1 <= p52)) OR ((1 <= p0) AND (1 <= p50)) OR ((1 <= p0) AND (1 <= p51)) OR ((1 <= p0) AND (1 <= p48)) OR ((1 <= p0) AND (1 <= p45)) OR ((1 <= p0) AND (1 <= p47)) OR ((1 <= p0) AND (1 <= p46))))) U ((1 <= p60) AND (1 <= p225) AND (1 <= p226) AND (1 <= p227) AND (1 <= p228) AND (1 <= p229) AND (1 <= p230) AND (1 <= p231))))) : NOT(A ((A (F (((1 <= p16) OR (1 <= p9) OR (1 <= p10) OR (1 <= p11) OR (1 <= p12) OR (1 <= p13) OR (1 <= p14)))) U ((1 <= p16) OR (1 <= p9) OR (1 <= p10) OR (1 <= p11) OR (1 <= p12) OR (1 <= p13) OR (1 <= p14))))) : E (F (((1 <= p0) AND (1 <= p22)))) : A (F ((((1 <= p0) AND (1 <= p30)) AND A (F ((((1 <= p0) AND (1 <= p16)) OR ((1 <= p34) AND (1 <= p238)))))))) : E (G (((p19 <= 0) OR (p177 <= 0) OR (p183 <= 0) OR (p186 <= 0) OR (p190 <= 0) OR (p197 <= 0) OR (p211 <= 0) OR (p220 <= 0) OR (p0 <= 0) OR (p5 <= 0) OR (((p0 <= 0) OR (p17 <= 0)) AND ((p20 <= 0) OR (p161 <= 0) OR (p180 <= 0) OR (p185 <= 0) OR (p195 <= 0) OR (p198 <= 0) OR (p210 <= 0) OR (p219 <= 0)))))) : NOT(A (F ((E (X (((1 <= p17) AND (1 <= p162) AND (1 <= p179) AND (1 <= p188) AND (1 <= p196) AND (1 <= p203) AND (1 <= p209) AND (1 <= p218)))) AND ((p0 <= 0) OR (p35 <= 0)))))) : A ((((1 <= p0) AND (1 <= p38)) U (A (F (((1 <= p0) AND (1 <= p16)))) OR ((1 <= p37) AND (1 <= p223))))) : A (F (((E (G ((1 <= p53))) AND (1 <= p42)) AND (1 <= p249)))) : A (F (E (X (A (X (((1 <= p0) AND (1 <= p32)))))))) : E (F ((((1 <= p39) AND (1 <= p256) AND (1 <= p40) AND (1 <= p224)) OR ((1 <= p109) AND (1 <= p110) AND (1 <= p111) AND (1 <= p121) AND (1 <= p122) AND (1 <= p123) AND (1 <= p124) AND (1 <= p170)) OR ((1 <= p43) AND (1 <= p221)))))
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:389
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:318
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:318
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
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: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:326
lola: rewrite Frontend/Parser/formula_rewrite.k:338
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:338
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:323
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:335
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 222 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E (G (A (F ((1 <= p54))))) AND A (X ((((p32 <= 0) AND (p23 <= 0) AND (p25 <= 0) AND (p26 <= 0) AND (p27 <= 0) AND (p28 <= 0) AND (p31 <= 0)) OR ((1 <= p0) AND (1 <= p21)) OR ((1 <= p0) AND (1 <= p20)) OR ((1 <= p0) AND (1 <= p22)) OR ((1 <= p0) AND (1 <= p17)) OR ((1 <= p0) AND (1 <= p19)) OR ((1 <= p0) AND (1 <= p18)) OR ((1 <= p0) AND (1 <= p24)) OR ((1 <= p49) AND (1 <= p254) AND (1 <=... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 0 will run for 222 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G (A (F ((1 <= p54)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:811
lola: rewrite Frontend/Parser/formula_rewrite.k:808
lola: processed formula: EG(AF((1 <= p54)))
lola: processed formula length: 18
lola: 57 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: 10 markings, 10 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 1 will run for 237 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (A (X (E (F ((1 <= p49)))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:806
lola: rewrite Frontend/Parser/formula_rewrite.k:812
lola: rewrite Frontend/Parser/formula_rewrite.k:811
lola: processed formula: AF(AX(EF((1 <= p49))))
lola: processed formula length: 22
lola: 58 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: 534575 markings, 4090971 edges, 106915 markings/sec, 0 secs
lola: 1176251 markings, 8262072 edges, 128335 markings/sec, 5 secs
lola: 1554881 markings, 12303009 edges, 75726 markings/sec, 10 secs
lola: 1554884 markings, 16594311 edges, 1 markings/sec, 15 secs
lola: 1591862 markings, 20925180 edges, 7396 markings/sec, 20 secs
lola: 1979666 markings, 25231046 edges, 77561 markings/sec, 25 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 2271960 markings, 29014999 edges
lola: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G ((A (X (((p17 <= 0) OR (p162 <= 0) OR (p179 <= 0) OR (p188 <= 0) OR (p196 <= 0) OR (p203 <= 0) OR (p209 <= 0) OR (p218 <= 0)))) OR ((1 <= p0) AND (1 <= p35)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:812
lola: rewrite Frontend/Parser/formula_rewrite.k:808
lola: processed formula: EG((AX(((p17 <= 0) OR (p162 <= 0) OR (p179 <= 0) OR (p188 <= 0) OR (p196 <= 0) OR (p203 <= 0) OR (p209 <= 0) OR (p218 <= 0))) OR ((1 <= p0) AND (1 <= p35))))
lola: processed formula length: 164
lola: 57 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: 10 markings, 9 edges
lola: ========================================
lola: subprocess 3 will run for 271 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (E (X (A (X (((1 <= p0) AND (1 <= p32))))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:812
lola: rewrite Frontend/Parser/formula_rewrite.k:807
lola: rewrite Frontend/Parser/formula_rewrite.k:811
lola: processed formula: AF(EX(AX(((1 <= p0) AND (1 <= p32)))))
lola: processed formula length: 38
lola: 58 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: 473936 markings, 2709054 edges, 94787 markings/sec, 0 secs
lola: 885087 markings, 5463582 edges, 82230 markings/sec, 5 secs
lola: 1323327 markings, 8320053 edges, 87648 markings/sec, 10 secs
lola: 1687002 markings, 11079999 edges, 72735 markings/sec, 15 secs
lola: 1997465 markings, 13824516 edges, 62093 markings/sec, 20 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 2267723 markings, 15922698 edges
lola: ========================================
lola: subprocess 4 will run for 291 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((1 <= p0) AND (1 <= p22))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: processed formula: E (F (((1 <= p0) AND (1 <= p22))))
lola: processed formula length: 34
lola: 56 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 <= p0) AND (1 <= p22))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 22 markings, 21 edges
lola: ========================================
lola: subprocess 5 will run for 318 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((((1 <= p39) AND (1 <= p256) AND (1 <= p40) AND (1 <= p224)) OR ((1 <= p109) AND (1 <= p110) AND (1 <= p111) AND (1 <= p121) AND (1 <= p122) AND (1 <= p123) AND (1 <= p124) AND (1 <= p170)) OR ((1 <= p43) AND (1 <= p221)))))
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 <= p39) AND (1 <= p256) AND (1 <= p40) AND (1 <= p224)) OR ((1 <= p109) AND (1 <= p110) AND (1 <= p111) AND (1 <= p121) AND (1 <= p122) AND (1 <= p123) AND (1 <= p124) AND (1 <= p170)) OR ((1 <= p43) AND (1 <= p221)))))
lola: processed formula length: 232
lola: 56 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: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 11 markings, 10 edges
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (((1 <= p39) AND (1 <= p256) AND (1 <= p40) AND (1 <= p224)) OR ((1 <= p109) AND (1 <= p110) AND (1 <= p111) AND (1 <= p121) AND (1 <= p122) AND (1 <= p123) AND (1 <= p124) AND (1 <= p170)) OR ((1 <= p43) AND (1 <= p221)))
lola: ========================================
lola: subprocess 6 will run for 350 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G ((p53 <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation
lola: rewrite Frontend/Parser/formula_rewrite.k:583
lola: processed formula: E (G ((p53 <= 0)))
lola: processed formula length: 18
lola: 56 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:788
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (1 <= p53)
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space / EG
lola: The predicate is possibly preserved.
lola: 11 markings, 10 edges
lola: ========================================
lola: subprocess 7 will run for 389 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G (((p19 <= 0) OR (p177 <= 0) OR (p183 <= 0) OR (p186 <= 0) OR (p190 <= 0) OR (p197 <= 0) OR (p211 <= 0) OR (p220 <= 0) OR (p0 <= 0) OR (p5 <= 0) OR (((p0 <= 0) OR (p17 <= 0)) AND ((p20 <= 0) OR (p161 <= 0) OR (p180 <= 0) OR (p185 <= 0) OR (p195 <= 0) OR (p198 <= 0) OR (p210 <= 0) OR (p219 <= 0))))))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation
lola: rewrite Frontend/Parser/formula_rewrite.k:583
lola: processed formula: E (G (((p19 <= 0) OR (p177 <= 0) OR (p183 <= 0) OR (p186 <= 0) OR (p190 <= 0) OR (p197 <= 0) OR (p211 <= 0) OR (p220 <= 0) OR (p0 <= 0) OR (p5 <= 0) OR (((p0 <= 0) OR (p17 <= 0)) AND ((p20 <= 0) OR (p161 <= 0) OR (p180 <= 0) OR (p185 <= 0) OR (p195 <= 0) OR (p198 <= 0) OR (p210 <= 0) OR (p219 <= 0))))))
lola: processed formula length: 322
lola: 56 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:787
lola: state equation task get result rewrite finished id 0
lola: SUBRESULT
lola: result: yes
lola: produced by: state space / EG
lola: The predicate is possibly preserved.
lola: 11 markings, 10 edges
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((1 <= p19) AND (1 <= p177) AND (1 <= p183) AND (1 <= p186) AND (1 <= p190) AND (1 <= p197) AND (1 <= p211) AND (1 <= p220) AND (1 <= p0) AND (1 <= p5) AND (((1 <= p0) AND (1 <= p17)) OR ((1 <= p20) AND (1 <= p161) AND (1 <= p180) AND (1 <= p185) AND (1 <= p195) AND (1 <= p198) AND (1 <= p210) AND (1 <= p219))))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 30 literals and 2 conjunctive subformulas
lola: ========================================
lola: subprocess 8 will run for 437 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (E (F ((((1 <= p21) AND (1 <= p176) AND (1 <= p181) AND (1 <= p192) AND (1 <= p199) AND (1 <= p202) AND (1 <= p205) AND (1 <= p214)) OR ((1 <= p18) AND (1 <= p163) AND (1 <= p174) AND (1 <= p187) AND (1 <= p193) AND (1 <= p204) AND (1 <= p216) AND (1 <= p217)) OR ((1 <= p24) AND (1 <= p173) AND (1 <= p182) AND (1 <= p191) AND (1 <= p194) AND (1 <= p201) AND (1 <= p206) AND (1 <= p215)) OR ... (shortened)
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 <= p21) AND (1 <= p176) AND (1 <= p181) AND (1 <= p192) AND (1 <= p199) AND (1 <= p202) AND (1 <= p205) AND (1 <= p214)) OR ((1 <= p18) AND (1 <= p163) AND (1 <= p174) AND (1 <= p187) AND (1 <= p193) AND (1 <= p204) AND (1 <= p216) AND (1 <= p217)) OR ((1 <= p24) AND (1 <= p173) AND (1 <= p182) AND (1 <= p191) AND (1 <= p194) AND (1 <= p201) AND (1 <= p206) AND (1 <= p215)) OR ((1 <= p17) ... (shortened)
lola: processed formula length: 900
lola: 58 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: (((p21 <= 0) OR (p176 <= 0) OR (p181 <= 0) OR (p192 <= 0) OR (p199 <= 0) OR (p202 <= 0) OR (p205 <= 0) OR (p214 <= 0)) AND ((p18 <= 0) OR (p163 <= 0) OR (p174 <= 0) OR (p187 <= 0) OR (p193 <= 0) OR (p204 <= 0) OR (p216 <= 0) OR (p217 <= 0)) AND ((p24 <= 0) OR (p173 <= 0) OR (p182 <= 0) OR (p191 <= 0) OR (p194 <= 0) OR (p201 <= 0) OR (p206 <= 0) OR (p215 <= 0)) AND ((p17 <= 0) OR (p162 <= 0) OR (p179 <= 0) OR (p188 <= 0) OR (p196 <= 0) OR (p203 <= 0) OR (p209 <= 0) OR (p218 <= 0)) AND ((p20 <= 0) OR (p161 <= 0) OR (p180 <= 0) OR (p185 <= 0) OR (p195 <= 0) OR (p198 <= 0) OR (p210 <= 0) OR (p219 <= 0)) AND ((p22 <= 0) OR (p175 <= 0) OR (p178 <= 0) OR (p184 <= 0) OR (p189 <= 0) OR (p200 <= 0) OR (p212 <= 0) OR (p213 <= 0)) AND ((p19 <= 0) OR (p177 <= 0) OR (p183 <= 0) OR (p186 <= 0) OR (p190 <= 0) OR (p197 <= 0) OR (p211 <= 0) OR (p220 <= 0)))
lola: state equation task get result started, id 1
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: state equation task get result rewrite finished id 1
lola: SUBRESULT
lola: result: no
lola: produced by: tscc_search
lola: The predicate is not live.
lola: 55 markings, 54 edges
lola: state equation task get result unparse finished++ id 1
lola: formula 1: (((1 <= p21) AND (1 <= p176) AND (1 <= p181) AND (1 <= p192) AND (1 <= p199) AND (1 <= p202) AND (1 <= p205) AND (1 <= p214)) OR ((1 <= p18) AND (1 <= p163) AND (1 <= p174) AND (1 <= p187) AND (1 <= p193) AND (1 <= p204) AND (1 <= p216) AND (1 <= p217)) OR ((1 <= p24) AND (1 <= p173) AND (1 <= p182) AND (1 <= p191) AND (1 <= p194) AND (1 <= p201) AND (1 <= p206) AND (1 <= p215)) OR ((1 <= p17) AND (1 <= p162) AND (1 <= p179) AND (1 <= p188) AND (1 <= p196) AND (1 <= p203) AND (1 <= p209) AND (1 <= p218)) OR ((1 <= p20) AND (1 <= p161) AND (1 <= p180) AND (1 <= p185) AND (1 <= p195) AND (1 <= p198) AND (1 <= p210) AND (1 <= p219)) OR ((1 <= p22) AND (1 <= p175) AND (1 <= p178) AND (1 <= p184) AND (1 <= p189) AND (1 <= p200) AND (1 <= p212) AND (1 <= p213)) OR ((1 <= p19) AND (1 <= p177) AND (1 <= p183) AND (1 <= p186) AND (1 <= p190) AND (1 <= p197) AND (1 <= p211) AND (1 <= p220)))
lola: state equation task get result unparse finished id 1
lola: state equation: Generated DNF with 56 literals and 7 conjunctive subformulas
lola: ========================================
lola: subprocess 9 will run for 500 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F ((E (G ((1 <= p53))) AND ((1 <= p42) AND (1 <= p249)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:808
lola: rewrite Frontend/Parser/formula_rewrite.k:811
lola: processed formula: AF((EG((1 <= p53)) AND ((1 <= p42) AND (1 <= p249))))
lola: processed formula length: 53
lola: 57 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: 10 markings, 19 edges
lola: ========================================
lola: subprocess 10 will run for 583 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A ((((1 <= p0) AND (1 <= p38)) U (A (F (((1 <= p0) AND (1 <= p16)))) OR ((1 <= p37) AND (1 <= p223)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:811
lola: rewrite Frontend/Parser/formula_rewrite.k:814
lola: processed formula: A(((1 <= p0) AND (1 <= p38)) U (AF(((1 <= p0) AND (1 <= p16))) OR ((1 <= p37) AND (1 <= p223))))
lola: processed formula length: 96
lola: 57 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: 10 markings, 10 edges
lola: ========================================
lola: subprocess 11 will run for 700 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F ((((1 <= p0) AND (1 <= p30)) AND A (F ((((1 <= p0) AND (1 <= p16)) OR ((1 <= p34) AND (1 <= p238))))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:811
lola: rewrite Frontend/Parser/formula_rewrite.k:811
lola: processed formula: AF((((1 <= p0) AND (1 <= p30)) AND AF((((1 <= p0) AND (1 <= p16)) OR ((1 <= p34) AND (1 <= p238))))))
lola: processed formula length: 102
lola: 57 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: 10 markings, 9 edges
lola: ========================================
lola: subprocess 12 will run for 875 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((A (F ((((p0 <= 0) OR (p52 <= 0)) AND ((p0 <= 0) OR (p50 <= 0)) AND ((p0 <= 0) OR (p51 <= 0)) AND ((p0 <= 0) OR (p48 <= 0)) AND ((p0 <= 0) OR (p45 <= 0)) AND ((p0 <= 0) OR (p47 <= 0)) AND ((p0 <= 0) OR (p46 <= 0))))) AND ((1 <= p49) AND (((1 <= p0) AND (1 <= p37)) OR ((1 <= p0) AND (1 <= p38)) OR ((1 <= p0) AND (1 <= p44)) OR ((1 <= p0) AND (1 <= p41)) OR ((1 <= p0) AND (1 <= p40)... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:811
lola: rewrite Frontend/Parser/formula_rewrite.k:806
lola: processed formula: EF((AF((((p0 <= 0) OR (p52 <= 0)) AND ((p0 <= 0) OR (p50 <= 0)) AND ((p0 <= 0) OR (p51 <= 0)) AND ((p0 <= 0) OR (p48 <= 0)) AND ((p0 <= 0) OR (p45 <= 0)) AND ((p0 <= 0) OR (p47 <= 0)) AND ((p0 <= 0) OR (p46 <= 0)))) AND ((1 <= p49) AND (((1 <= p0) AND (1 <= p37)) OR ((1 <= p0) AND (1 <= p38)) OR ((1 <= p0) AND (1 <= p44)) OR ((1 <= p0) AND (1 <= p41)) OR ((1 <= p0) AND (1 <= p40)) OR (... (shortened)
lola: processed formula length: 460
lola: 57 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: 633305 markings, 4519818 edges, 126661 markings/sec, 0 secs
lola: 1231186 markings, 9046901 edges, 119576 markings/sec, 5 secs
lola: 1758413 markings, 13542343 edges, 105445 markings/sec, 10 secs
lola: 2235657 markings, 18003336 edges, 95449 markings/sec, 15 secs
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 2271960 markings, 18341858 edges
lola: ========================================
lola: subprocess 13 will run for 1160 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A ((A (G ((((p0 <= 0) OR (p52 <= 0)) AND ((p0 <= 0) OR (p50 <= 0)) AND ((p0 <= 0) OR (p51 <= 0)) AND ((p0 <= 0) OR (p48 <= 0)) AND ((p0 <= 0) OR (p45 <= 0)) AND ((p0 <= 0) OR (p47 <= 0)) AND ((p0 <= 0) OR (p46 <= 0))))) R ((p60 <= 0) OR (p225 <= 0) OR (p226 <= 0) OR (p227 <= 0) OR (p228 <= 0) OR (p229 <= 0) OR (p230 <= 0) OR (p231 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:813
lola: rewrite Frontend/Parser/formula_rewrite.k:815
lola: processed formula: A(AG((((p0 <= 0) OR (p52 <= 0)) AND ((p0 <= 0) OR (p50 <= 0)) AND ((p0 <= 0) OR (p51 <= 0)) AND ((p0 <= 0) OR (p48 <= 0)) AND ((p0 <= 0) OR (p45 <= 0)) AND ((p0 <= 0) OR (p47 <= 0)) AND ((p0 <= 0) OR (p46 <= 0)))) R ((p60 <= 0) OR (p225 <= 0) OR (p226 <= 0) OR (p227 <= 0) OR (p228 <= 0) OR (p229 <= 0) OR (p230 <= 0) OR (p231 <= 0)))
lola: processed formula length: 348
lola: 57 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: 14648 markings, 86650 edges
lola: ========================================
lola: subprocess 14 will run for 1741 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (F ((((1 <= p36) AND (1 <= p240)) OR ((1 <= p35) AND (1 <= p239)) OR ((1 <= p33) AND (1 <= p237)) OR ((1 <= p34) AND (1 <= p238)) OR ((1 <= p39) AND (1 <= p256)) OR ((1 <= p30) AND (1 <= p242)) OR ((1 <= p29) AND (1 <= p241))))) OR (((1 <= p0) AND (1 <= p37)) OR (((1 <= p0) AND (1 <= p38)) OR (((1 <= p0) AND (1 <= p44)) OR (((1 <= p0) AND (1 <= p41)) OR (((1 <= p0) AND (1 <= p40)) OR (((1... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 14 will run for 1741 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (((1 <= p0) AND (1 <= p37)) OR (((1 <= p0) AND (1 <= p38)) OR (((1 <= p0) AND (1 <= p44)) OR (((1 <= p0) AND (1 <= p41)) OR (((1 <= p0) AND (1 <= p40)) OR (((1 <= p0) AND (1 <= p43)) OR ((1 <= p0) AND (1 <= p42))))))))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: rewrite Frontend/Parser/formula_rewrite.k:797
lola: rewrite Frontend/Parser/formula_rewrite.k:797
lola: rewrite Frontend/Parser/formula_rewrite.k:798
lola: rewrite Frontend/Parser/formula_rewrite.k:797
lola: rewrite Frontend/Parser/formula_rewrite.k:798
lola: rewrite Frontend/Parser/formula_rewrite.k:797
lola: rewrite Frontend/Parser/formula_rewrite.k:798
lola: rewrite Frontend/Parser/formula_rewrite.k:797
lola: rewrite Frontend/Parser/formula_rewrite.k:798
lola: rewrite Frontend/Parser/formula_rewrite.k:797
lola: rewrite Frontend/Parser/formula_rewrite.k:798
lola: processed formula: (((1 <= p0) AND (1 <= p37)) OR ((1 <= p0) AND (1 <= p38)) OR ((1 <= p0) AND (1 <= p44)) OR ((1 <= p0) AND (1 <= p41)) OR ((1 <= p0) AND (1 <= p40)) OR ((1 <= p0) AND (1 <= p43)) OR ((1 <= p0) AND (1 <= p42)))
lola: processed formula length: 208
lola: 66 rewrites
lola: closed formula file CTLFireability.xml
lola: processed formula with 14 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 15 will run for 3482 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F ((((1 <= p36) AND (1 <= p240)) OR ((1 <= p35) AND (1 <= p239)) OR ((1 <= p33) AND (1 <= p237)) OR ((1 <= p34) AND (1 <= p238)) OR ((1 <= p39) AND (1 <= p256)) OR ((1 <= p30) AND (1 <= p242)) OR ((1 <= p29) AND (1 <= p241)))))
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: (((p36 <= 0) OR (p240 <= 0)) AND ((p35 <= 0) OR (p239 <= 0)) AND ((p33 <= 0) OR (p237 <= 0)) AND ((p34 <= 0) OR (p238 <= 0)) AND ((p39 <= 0) OR (p256 <= 0)) AND ((p30 <= 0) OR (p242 <= 0)) AND ((p29 <= 0) OR (p241 <= 0)))
lola: processed formula length: 228
lola: 58 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: SUBRESULT
lola: result: no
lola: produced by: state space / EG
lola: state equation task get result unparse finished++ id 0
lola: The predicate does not eventually occur.
lola: formula 0: (((1 <= p36) AND (1 <= p240)) OR ((1 <= p35) AND (1 <= p239)) OR ((1 <= p33) AND (1 <= p237)) OR ((1 <= p34) AND (1 <= p238)) OR ((1 <= p39) AND (1 <= p256)) OR ((1 <= p30) AND (1 <= p242)) OR ((1 <= p29) AND (1 <= p241)))
lola: 11 markings, 10 edges
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 14 literals and 7 conjunctive subformulas
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 15 will run for 3482 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E ((E (G (((p16 <= 0) AND (p9 <= 0) AND (p10 <= 0) AND (p11 <= 0) AND (p12 <= 0) AND (p13 <= 0) AND (p14 <= 0)))) R ((p16 <= 0) AND (p9 <= 0) AND (p10 <= 0) AND (p11 <= 0) AND (p12 <= 0) AND (p13 <= 0) AND (p14 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking an existential CTL formula with single witness path (use LTL...)
lola: rewrite Frontend/Parser/formula_rewrite.k:658
lola: rewrite Frontend/Parser/formula_rewrite.k:659
lola: rewrite Frontend/Parser/formula_rewrite.k:664
lola: rewrite Frontend/Parser/formula_rewrite.k:659
lola: rewrite Frontend/Parser/formula_rewrite.k:662
lola: rewrite Frontend/Parser/formula_rewrite.k:674
lola: rewrite Frontend/Parser/formula_rewrite.k:674
lola: rewrite Frontend/Parser/formula_rewrite.k:679
lola: rewrite Frontend/Parser/formula_rewrite.k:679
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: (F (((1 <= p16) OR (1 <= p9) OR (1 <= p10) OR (1 <= p11) OR (1 <= p12) OR (1 <= p13) OR (1 <= p14))) U ((1 <= p16) OR (1 <= p9) OR (1 <= p10) OR (1 <= p11) OR (1 <= p12) OR (1 <= p13) OR (1 <= p14)))
lola: processed formula length: 211
lola: 64 rewrites
lola: closed formula file CTLFireability.xml
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The existential single path CTL formula holds.
lola: 11 markings, 11 edges
lola: ========================================
lola: RESULT
lola:
SUMMARY: yes no no yes no no no yes yes no yes yes no no yes yes
lola:
preliminary result: yes no no yes no no no yes yes no yes yes no no yes yes
lola: memory consumption: 62804 KB
lola: time consumption: 89 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="QuasiCertifProtocol-PT-06"
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 QuasiCertifProtocol-PT-06, 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 r176-tajo-158987872400788"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/QuasiCertifProtocol-PT-06.tgz
mv QuasiCertifProtocol-PT-06 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 ;