About the Execution of ITS-LoLa for ShieldRVt-PT-002B
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 15741.570 | 3600000.00 | 394395.00 | 4829.20 | TF??TTFT??T???TT | 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.r211-tajo-159033478200948.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 ShieldRVt-PT-002B, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r211-tajo-159033478200948
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 212K
-rw-r--r-- 1 mcc users 3.7K May 14 02:35 CTLCardinality.txt
-rw-r--r-- 1 mcc users 21K May 14 02:35 CTLCardinality.xml
-rw-r--r-- 1 mcc users 3.1K May 13 20:09 CTLFireability.txt
-rw-r--r-- 1 mcc users 25K May 13 20:09 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K May 14 10:05 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K May 14 10:05 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K May 14 10:05 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 14 10:05 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 May 12 20:42 NewModel
-rw-r--r-- 1 mcc users 3.3K May 13 14:38 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 17K May 13 14:38 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.4K May 13 09:27 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 13K May 13 09:27 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 13 16:53 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K May 13 16:53 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 12 20:42 equiv_col
-rw-r--r-- 1 mcc users 5 May 12 20:42 instance
-rw-r--r-- 1 mcc users 6 May 12 20:42 iscolored
-rw-r--r-- 1 mcc users 24K May 12 20:42 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of booleans
BOOL_VECTOR
here is the order used to build the result vector(from text file)
FORMULA_NAME ShieldRVt-PT-002B-CTLFireability-00
FORMULA_NAME ShieldRVt-PT-002B-CTLFireability-01
FORMULA_NAME ShieldRVt-PT-002B-CTLFireability-02
FORMULA_NAME ShieldRVt-PT-002B-CTLFireability-03
FORMULA_NAME ShieldRVt-PT-002B-CTLFireability-04
FORMULA_NAME ShieldRVt-PT-002B-CTLFireability-05
FORMULA_NAME ShieldRVt-PT-002B-CTLFireability-06
FORMULA_NAME ShieldRVt-PT-002B-CTLFireability-07
FORMULA_NAME ShieldRVt-PT-002B-CTLFireability-08
FORMULA_NAME ShieldRVt-PT-002B-CTLFireability-09
FORMULA_NAME ShieldRVt-PT-002B-CTLFireability-10
FORMULA_NAME ShieldRVt-PT-002B-CTLFireability-11
FORMULA_NAME ShieldRVt-PT-002B-CTLFireability-12
FORMULA_NAME ShieldRVt-PT-002B-CTLFireability-13
FORMULA_NAME ShieldRVt-PT-002B-CTLFireability-14
FORMULA_NAME ShieldRVt-PT-002B-CTLFireability-15
=== Now, execution of the tool begins
BK_START 1591335630515
bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-05 05:40:32] [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-05 05:40:32] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-05 05:40:32] [INFO ] Load time of PNML (sax parser for PT used): 38 ms
[2020-06-05 05:40:32] [INFO ] Transformed 103 places.
[2020-06-05 05:40:32] [INFO ] Transformed 103 transitions.
[2020-06-05 05:40:32] [INFO ] Found NUPN structural information;
[2020-06-05 05:40:32] [INFO ] Parsed PT model containing 103 places and 103 transitions in 73 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 17 ms.
Incomplete random walk after 100000 steps, including 47 resets, run finished after 155 ms. (steps per millisecond=645 ) properties seen :[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 0, 1, 1, 0, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 0, 1, 1, 1, 0, 1]
// Phase 1: matrix 103 rows 103 cols
[2020-06-05 05:40:32] [INFO ] Computed 9 place invariants in 5 ms
[2020-06-05 05:40:32] [INFO ] [Real]Absence check using 9 positive place invariants in 20 ms returned sat
[2020-06-05 05:40:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 05:40:32] [INFO ] [Real]Absence check using state equation in 57 ms returned sat
[2020-06-05 05:40:32] [INFO ] Deduced a trap composed of 13 places in 79 ms
[2020-06-05 05:40:32] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 103 ms
[2020-06-05 05:40:32] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 05:40:32] [INFO ] [Nat]Absence check using 9 positive place invariants in 24 ms returned sat
[2020-06-05 05:40:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-05 05:40:32] [INFO ] [Nat]Absence check using state equation in 52 ms returned sat
[2020-06-05 05:40:32] [INFO ] Deduced a trap composed of 13 places in 37 ms
[2020-06-05 05:40:32] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 54 ms
[2020-06-05 05:40:32] [INFO ] Computed and/alt/rep : 102/151/102 causal constraints in 13 ms.
[2020-06-05 05:40:33] [INFO ] Added : 95 causal constraints over 19 iterations in 155 ms. Result :unsat
[2020-06-05 05:40:33] [INFO ] [Real]Absence check using 9 positive place invariants in 8 ms returned sat
[2020-06-05 05:40:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 05:40:33] [INFO ] [Real]Absence check using state equation in 52 ms returned sat
[2020-06-05 05:40:33] [INFO ] Deduced a trap composed of 25 places in 24 ms
[2020-06-05 05:40:33] [INFO ] Deduced a trap composed of 21 places in 27 ms
[2020-06-05 05:40:33] [INFO ] Deduced a trap composed of 25 places in 21 ms
[2020-06-05 05:40:33] [INFO ] Deduced a trap composed of 21 places in 19 ms
[2020-06-05 05:40:33] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 134 ms
[2020-06-05 05:40:33] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 05:40:33] [INFO ] [Nat]Absence check using 9 positive place invariants in 12 ms returned sat
[2020-06-05 05:40:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-05 05:40:33] [INFO ] [Nat]Absence check using state equation in 54 ms returned sat
[2020-06-05 05:40:33] [INFO ] Deduced a trap composed of 25 places in 20 ms
[2020-06-05 05:40:33] [INFO ] Deduced a trap composed of 21 places in 23 ms
[2020-06-05 05:40:33] [INFO ] Deduced a trap composed of 25 places in 23 ms
[2020-06-05 05:40:33] [INFO ] Deduced a trap composed of 12 places in 18 ms
[2020-06-05 05:40:33] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 104 ms
[2020-06-05 05:40:33] [INFO ] Computed and/alt/rep : 102/151/102 causal constraints in 12 ms.
[2020-06-05 05:40:33] [INFO ] Added : 100 causal constraints over 21 iterations in 172 ms. Result :sat
[2020-06-05 05:40:33] [INFO ] [Real]Absence check using 9 positive place invariants in 6 ms returned sat
[2020-06-05 05:40:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 05:40:33] [INFO ] [Real]Absence check using state equation in 46 ms returned sat
[2020-06-05 05:40:33] [INFO ] Deduced a trap composed of 12 places in 17 ms
[2020-06-05 05:40:33] [INFO ] Deduced a trap composed of 20 places in 20 ms
[2020-06-05 05:40:33] [INFO ] Deduced a trap composed of 21 places in 17 ms
[2020-06-05 05:40:33] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 70 ms
[2020-06-05 05:40:33] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 05:40:33] [INFO ] [Nat]Absence check using 9 positive place invariants in 24 ms returned sat
[2020-06-05 05:40:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-05 05:40:33] [INFO ] [Nat]Absence check using state equation in 50 ms returned sat
[2020-06-05 05:40:33] [INFO ] Deduced a trap composed of 12 places in 32 ms
[2020-06-05 05:40:33] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 41 ms
[2020-06-05 05:40:33] [INFO ] Computed and/alt/rep : 102/151/102 causal constraints in 7 ms.
[2020-06-05 05:40:34] [INFO ] Added : 95 causal constraints over 20 iterations in 125 ms. Result :sat
[2020-06-05 05:40:34] [INFO ] [Real]Absence check using 9 positive place invariants in 5 ms returned sat
[2020-06-05 05:40:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 05:40:34] [INFO ] [Real]Absence check using state equation in 37 ms returned sat
[2020-06-05 05:40:34] [INFO ] Deduced a trap composed of 13 places in 20 ms
[2020-06-05 05:40:34] [INFO ] Deduced a trap composed of 27 places in 19 ms
[2020-06-05 05:40:34] [INFO ] Deduced a trap composed of 19 places in 18 ms
[2020-06-05 05:40:34] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 3 trap constraints in 67 ms
[2020-06-05 05:40:34] [INFO ] [Real]Absence check using 9 positive place invariants in 5 ms returned sat
[2020-06-05 05:40:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 05:40:34] [INFO ] [Real]Absence check using state equation in 38 ms returned sat
[2020-06-05 05:40:34] [INFO ] Deduced a trap composed of 12 places in 10 ms
[2020-06-05 05:40:34] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 16 ms
[2020-06-05 05:40:34] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 05:40:34] [INFO ] [Nat]Absence check using 9 positive place invariants in 17 ms returned sat
[2020-06-05 05:40:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-05 05:40:34] [INFO ] [Nat]Absence check using state equation in 39 ms returned sat
[2020-06-05 05:40:34] [INFO ] Deduced a trap composed of 12 places in 13 ms
[2020-06-05 05:40:34] [INFO ] Deduced a trap composed of 19 places in 23 ms
[2020-06-05 05:40:34] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 47 ms
[2020-06-05 05:40:34] [INFO ] Computed and/alt/rep : 102/151/102 causal constraints in 6 ms.
[2020-06-05 05:40:34] [INFO ] Added : 95 causal constraints over 19 iterations in 116 ms. Result :unsat
[2020-06-05 05:40:34] [INFO ] [Real]Absence check using 9 positive place invariants in 18 ms returned sat
[2020-06-05 05:40:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 05:40:34] [INFO ] [Real]Absence check using state equation in 36 ms returned sat
[2020-06-05 05:40:34] [INFO ] Deduced a trap composed of 26 places in 28 ms
[2020-06-05 05:40:34] [INFO ] Deduced a trap composed of 27 places in 25 ms
[2020-06-05 05:40:34] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 61 ms
[2020-06-05 05:40:34] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 05:40:34] [INFO ] [Nat]Absence check using 9 positive place invariants in 24 ms returned sat
[2020-06-05 05:40:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-05 05:40:34] [INFO ] [Nat]Absence check using state equation in 57 ms returned sat
[2020-06-05 05:40:34] [INFO ] Deduced a trap composed of 21 places in 45 ms
[2020-06-05 05:40:34] [INFO ] Deduced a trap composed of 23 places in 46 ms
[2020-06-05 05:40:34] [INFO ] Deduced a trap composed of 23 places in 23 ms
[2020-06-05 05:40:34] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 138 ms
[2020-06-05 05:40:34] [INFO ] Computed and/alt/rep : 102/151/102 causal constraints in 4 ms.
[2020-06-05 05:40:34] [INFO ] Added : 85 causal constraints over 17 iterations in 98 ms. Result :unsat
[2020-06-05 05:40:34] [INFO ] [Real]Absence check using 9 positive place invariants in 4 ms returned unsat
Successfully simplified 5 atomic propositions for a total of 5 simplifications.
[2020-06-05 05:40:35] [INFO ] Flatten gal took : 44 ms
[2020-06-05 05:40:35] [INFO ] Flatten gal took : 13 ms
[2020-06-05 05:40:35] [INFO ] Export to MCC properties in file /home/mcc/execution/CTLFireability.sr.xml took 5 ms.
[2020-06-05 05:40:35] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 2 ms.
info: Time: 3600 - MCC
vrfy: Checking CTLFireability @ ShieldRVt-PT-002B @ 3570 seconds
FORMULA ShieldRVt-PT-002B-CTLFireability-00 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA ShieldRVt-PT-002B-CTLFireability-07 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA ShieldRVt-PT-002B-CTLFireability-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA ShieldRVt-PT-002B-CTLFireability-04 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA ShieldRVt-PT-002B-CTLFireability-06 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA ShieldRVt-PT-002B-CTLFireability-05 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA ShieldRVt-PT-002B-CTLFireability-01 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA ShieldRVt-PT-002B-CTLFireability-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA ShieldRVt-PT-002B-CTLFireability-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 0
rslt: Output for CTLFireability @ ShieldRVt-PT-002B
{
"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": "Fri Jun 5 05:40:35 2020
",
"timelimit": 3570
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 222
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 2,
"E": 1,
"F": 1,
"G": 0,
"U": 1,
"X": 1,
"aconj": 1,
"adisj": 1,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "E(AF(((p31 <= 0))) U AX(((1 <= p94) AND (1 <= p48))))",
"processed_size": 53,
"rewrites": 59
},
"net":
{
"conflict_clusters": 91,
"singleton_clusters": 0
},
"result":
{
"edges": 2594038,
"markings": 566128,
"produced_by": "CTL model checker",
"value": true
},
"task":
{
"compoundnumber": 0,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 237
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 237
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 2,
"adisj": 1,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "E (G ((((1 <= p25)) OR ((1 <= p85)))))",
"processed_size": 39,
"rewrites": 57
},
"result":
{
"edges": 0,
"markings": 1,
"produced_by": "state space / EG",
"value": false
},
"task":
{
"compoundnumber": 1,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 4
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 2,
"problems": 2
},
"type": "possible_preservation",
"workflow": "stateequation"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 254
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 1,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "E (G (((p68 <= 0))))",
"processed_size": 20,
"rewrites": 57
},
"result":
{
"edges": 76,
"markings": 76,
"produced_by": "state space / EG",
"value": true
},
"task":
{
"compoundnumber": 2,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 2
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "possible_preservation",
"workflow": "stateequation"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 274
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 2,
"adisj": 0,
"aneg": 2,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "A ((((p51 <= 0)) R ((p41 <= 0))))",
"processed_size": 33,
"rewrites": 61
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "state space /EU",
"value": true
},
"task":
{
"compoundnumber": 3,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "eu preserving",
"visible": 1
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "universal_release",
"workflow": "stateequation"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": true
},
"task":
{
"compoundnumber": 1,
"type": "boolean"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 254
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 254
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 1,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "A (G (((p15 <= 0))))",
"processed_size": 20,
"rewrites": 58
},
"result":
{
"edges": 160,
"markings": 156,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 2,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "invariance",
"workflow": "stateequation||search"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 274
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 1,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "E (G (((p13 <= 0) OR (p67 <= 0) OR (p101 <= 0))))",
"processed_size": 51,
"rewrites": 57
},
"result":
{
"edges": 77,
"markings": 77,
"produced_by": "state space / EG",
"value": true
},
"task":
{
"compoundnumber": 3,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 10
},
"threads": 1,
"type": "dfs"
},
"type": "possible_preservation",
"workflow": "stateequation"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 296
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 1,
"aconj": 1,
"adisj": 0,
"aneg": 1,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "AX(((p61 <= 0)))",
"processed_size": 16,
"rewrites": 57
},
"net":
{
"conflict_clusters": 91,
"singleton_clusters": 0
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "CTL model checker",
"value": true
},
"task":
{
"compoundnumber": 4,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 323
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 0,
"G": 0,
"U": 0,
"X": 1,
"aconj": 1,
"adisj": 0,
"aneg": 1,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "EX(((p17 <= 0)))",
"processed_size": 16,
"rewrites": 57
},
"net":
{
"conflict_clusters": 91,
"singleton_clusters": 0
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "CTL model checker",
"value": true
},
"task":
{
"compoundnumber": 5,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": true
},
"task":
{
"compoundnumber": 2,
"type": "boolean"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 274
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 1,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "E (G (((p93 <= 0))))",
"processed_size": 20,
"rewrites": 57
},
"result":
{
"edges": 94,
"markings": 94,
"produced_by": "state space / EG",
"value": true
},
"task":
{
"compoundnumber": 3,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 2
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "possible_preservation",
"workflow": "stateequation"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 296
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 2,
"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": "(((1 <= p31)) OR ((1 <= p51)))",
"processed_size": 31,
"rewrites": 60
},
"result":
{
"edges": 40,
"markings": 40,
"produced_by": "state space /EFEG",
"value": false
},
"task":
{
"compoundnumber": 4,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 2
},
"threads": 1,
"type": "dfs"
},
"type": "eventual_occurrence_from_all_states",
"workflow": "stateequation"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 323
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 2,
"F": 1,
"G": 0,
"U": 1,
"X": 0,
"aconj": 2,
"adisj": 0,
"aneg": 1,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "E(EF(((p92 <= 0))) U ((1 <= p3)))",
"processed_size": 33,
"rewrites": 58
},
"net":
{
"conflict_clusters": 91,
"singleton_clusters": 0
},
"result":
{
"edges": 4540,
"markings": 1314,
"produced_by": "CTL model checker",
"value": true
},
"task":
{
"compoundnumber": 5,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 356
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 3,
"E": 0,
"F": 1,
"G": 1,
"U": 1,
"X": 0,
"aconj": 3,
"adisj": 2,
"aneg": 1,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "A((AF(((1 <= p83))) OR (((p60 <= 0)) AND ((p39 <= 0)))) U AG(((p17 <= 0))))",
"processed_size": 75,
"rewrites": 59
},
"net":
{
"conflict_clusters": 91,
"singleton_clusters": 0
},
"result":
{
"edges": 3379,
"markings": 1314,
"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"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 400
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 0,
"G": 0,
"U": 1,
"X": 0,
"aconj": 2,
"adisj": 5,
"aneg": 0,
"comp": 7,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 7,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 7,
"visible_transitions": 0
},
"processed": "E ((((p21 <= 0) OR (p44 <= 0) OR (((p79 <= 0)) AND ((p42 <= 0)))) U (((p31 <= 0)) AND ((p86 <= 0)) AND (1 <= p11))))",
"processed_size": 118,
"rewrites": 59
},
"result":
{
"edges": 2036,
"markings": 863,
"produced_by": "state space /EU",
"value": true
},
"task":
{
"compoundnumber": 8,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "eu preserving",
"visible": 4
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 3,
"problems": 3
},
"type": "existential_until",
"workflow": "stateequation"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 458
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 458
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "E (G (((1 <= p72))))",
"processed_size": 20,
"rewrites": 57
},
"result":
{
"edges": 0,
"markings": 1,
"produced_by": "state space / EG",
"value": false
},
"task":
{
"compoundnumber": 9,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 2
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "possible_preservation",
"workflow": "stateequation"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 534
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 1,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "E (G (((p74 <= 0))))",
"processed_size": 20,
"rewrites": 57
},
"result":
{
"edges": 94,
"markings": 94,
"produced_by": "state space / EG",
"value": true
},
"task":
{
"compoundnumber": 10,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 2
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "possible_preservation",
"workflow": "stateequation"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": true
},
"task":
{
"compoundnumber": 9,
"type": "boolean"
}
}
],
"exit":
{
"error": null,
"memory": 49012,
"runtime": 3570.000000,
"signal": null,
"timelimitreached": true
},
"files":
{
"formula": "CTLFireability.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "E((A(F(**)) U A(X(**)))) : A(((A(F(**)) OR **) U A(G(*)))) : (E(G((** OR E(G(**))))) OR (** OR (** OR (E(G(*)) AND **)))) : (** OR (E(F(**)) AND (A((** U **)) OR A(F(**))))) : E(G(*)) : E((E(F(*)) U **)) : A(G(A(F(*)))) : (E(G(*)) AND (A((* R *)) OR (E(G(**)) OR A(X(**))))) : (** AND (E(F(A(G(**)))) AND (** AND (A(F(**)) OR **)))) : (A(G(**)) OR (** OR (** AND A(G(*))))) : E((** U **)) : (** AND (A(F(**)) OR (A(F(**)) AND **))) : A(G((** OR (E(F(**)) OR **)))) : (E(F((A(F(**)) AND A(G(**))))) AND A((** U **))) : (E(X(*)) AND (A(G(*)) OR (A(X(*)) AND E(G(*))))) : (E(G(**)) OR E(G(**)))"
},
"net":
{
"arcs": 242,
"conflict_clusters": 91,
"places": 103,
"places_significant": 94,
"singleton_clusters": 0,
"transitions": 103
},
"result":
{
"interim_value": "yes no unknown unknown yes yes no yes unknown unknown yes unknown unknown unknown yes yes ",
"preliminary_value": "yes no unknown unknown yes yes no yes unknown unknown yes unknown unknown unknown 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: 206/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 3296
lola: finding significant places
lola: 103 places, 103 transitions, 94 significant places
lola: compute conflict clusters
lola: computed conflict clusters
lola: Computing conflicting sets
lola: Computing back conflicting sets
lola: TASK
lola: Reading formula in XML format (--xmlformula)
lola: reading pnml
lola: reading formula from CTLFireability.xml
lola: LP says that atomic proposition is always true: (p31 <= 1)
lola: LP says that atomic proposition is always true: (p94 <= 1)
lola: LP says that atomic proposition is always true: (p48 <= 1)
lola: LP says that atomic proposition is always true: (p83 <= 1)
lola: LP says that atomic proposition is always true: (p60 <= 1)
lola: LP says that atomic proposition is always true: (p39 <= 1)
lola: LP says that atomic proposition is always true: (p17 <= 1)
lola: LP says that atomic proposition is always true: (p1 <= 1)
lola: LP says that atomic proposition is always true: (p80 <= 1)
lola: LP says that atomic proposition is always true: (p37 <= 1)
lola: LP says that atomic proposition is always true: (p37 <= 1)
lola: LP says that atomic proposition is always true: (p30 <= 1)
lola: LP says that atomic proposition is always true: (p26 <= 1)
lola: LP says that atomic proposition is always true: (p49 <= 1)
lola: LP says that atomic proposition is always true: (p69 <= 1)
lola: LP says that atomic proposition is always true: (p11 <= 1)
lola: LP says that atomic proposition is always true: (p72 <= 1)
lola: LP says that atomic proposition is always true: (p89 <= 1)
lola: LP says that atomic proposition is always true: (p101 <= 1)
lola: LP says that atomic proposition is always true: (p37 <= 1)
lola: LP says that atomic proposition is always true: (p7 <= 1)
lola: LP says that atomic proposition is always true: (p63 <= 1)
lola: LP says that atomic proposition is always true: (p21 <= 1)
lola: LP says that atomic proposition is always true: (p29 <= 1)
lola: LP says that atomic proposition is always true: (p92 <= 1)
lola: LP says that atomic proposition is always true: (p54 <= 1)
lola: LP says that atomic proposition is always true: (p8 <= 1)
lola: LP says that atomic proposition is always true: (p45 <= 1)
lola: LP says that atomic proposition is always true: (p93 <= 1)
lola: LP says that atomic proposition is always true: (p92 <= 1)
lola: LP says that atomic proposition is always true: (p3 <= 1)
lola: LP says that atomic proposition is always true: (p31 <= 1)
lola: LP says that atomic proposition is always true: (p51 <= 1)
lola: LP says that atomic proposition is always true: (p68 <= 1)
lola: LP says that atomic proposition is always true: (p51 <= 1)
lola: LP says that atomic proposition is always true: (p41 <= 1)
lola: LP says that atomic proposition is always true: (p25 <= 1)
lola: LP says that atomic proposition is always true: (p85 <= 1)
lola: LP says that atomic proposition is always true: (p26 <= 1)
lola: LP says that atomic proposition is always true: (p62 <= 1)
lola: LP says that atomic proposition is always true: (p93 <= 1)
lola: LP says that atomic proposition is always true: (p25 <= 1)
lola: LP says that atomic proposition is always true: (p85 <= 1)
lola: LP says that atomic proposition is always true: (p61 <= 1)
lola: LP says that atomic proposition is always true: (p39 <= 1)
lola: LP says that atomic proposition is always true: (p41 <= 1)
lola: LP says that atomic proposition is always true: (p12 <= 1)
lola: LP says that atomic proposition is always true: (p76 <= 1)
lola: LP says that atomic proposition is always true: (p13 <= 1)
lola: LP says that atomic proposition is always true: (p67 <= 1)
lola: LP says that atomic proposition is always true: (p101 <= 1)
lola: LP says that atomic proposition is always true: (p29 <= 1)
lola: LP says that atomic proposition is always true: (p4 <= 1)
lola: LP says that atomic proposition is always true: (p18 <= 1)
lola: LP says that atomic proposition is always true: (p52 <= 1)
lola: LP says that atomic proposition is always true: (p1 <= 1)
lola: LP says that atomic proposition is always true: (p3 <= 1)
lola: LP says that atomic proposition is always true: (p21 <= 1)
lola: LP says that atomic proposition is always true: (p44 <= 1)
lola: LP says that atomic proposition is always true: (p79 <= 1)
lola: LP says that atomic proposition is always true: (p42 <= 1)
lola: LP says that atomic proposition is always true: (p31 <= 1)
lola: LP says that atomic proposition is always true: (p86 <= 1)
lola: LP says that atomic proposition is always true: (p11 <= 1)
lola: LP says that atomic proposition is always true: (p70 <= 1)
lola: LP says that atomic proposition is always true: (p90 <= 1)
lola: LP says that atomic proposition is always true: (p14 <= 1)
lola: LP says that atomic proposition is always true: (p39 <= 1)
lola: LP says that atomic proposition is always true: (p66 <= 1)
lola: LP says that atomic proposition is always true: (p56 <= 1)
lola: LP says that atomic proposition is always true: (p63 <= 1)
lola: LP says that atomic proposition is always true: (p98 <= 1)
lola: LP says that atomic proposition is always true: (p20 <= 1)
lola: LP says that atomic proposition is always true: (p86 <= 1)
lola: LP says that atomic proposition is always true: (p30 <= 1)
lola: LP says that atomic proposition is always true: (p70 <= 1)
lola: LP says that atomic proposition is always true: (p27 <= 1)
lola: LP says that atomic proposition is always true: (p2 <= 1)
lola: LP says that atomic proposition is always true: (p35 <= 1)
lola: LP says that atomic proposition is always true: (p85 <= 1)
lola: LP says that atomic proposition is always true: (p0 <= 1)
lola: LP says that atomic proposition is always true: (p64 <= 1)
lola: LP says that atomic proposition is always true: (p16 <= 1)
lola: LP says that atomic proposition is always true: (p99 <= 1)
lola: LP says that atomic proposition is always true: (p93 <= 1)
lola: LP says that atomic proposition is always true: (p93 <= 1)
lola: LP says that atomic proposition is always true: (p17 <= 1)
lola: LP says that atomic proposition is always true: (p15 <= 1)
lola: LP says that atomic proposition is always true: (p61 <= 1)
lola: LP says that atomic proposition is always true: (p13 <= 1)
lola: LP says that atomic proposition is always true: (p67 <= 1)
lola: LP says that atomic proposition is always true: (p101 <= 1)
lola: LP says that atomic proposition is always true: (p74 <= 1)
lola: LP says that atomic proposition is always true: (p72 <= 1)
lola: E ((A (F (((p31 <= 0)))) U A (X (((1 <= p94) AND (1 <= p48)))))) : A (((A (F (((1 <= p83)))) OR (((p60 <= 0)) AND ((p39 <= 0)))) U NOT(E (F (((1 <= p17))))))) : (((E (G (((((1 <= p1)) OR ((1 <= p80)) OR ((1 <= p37))) OR E (G (((1 <= p37))))))) OR ((1 <= p30))) OR ((1 <= p26))) OR (NOT(A (F (((1 <= p49))))) AND (((1 <= p69) AND ((p11 <= 0))) OR (((p72 <= 0)) AND ((p89 <= 0) OR (p101 <= 0)))))) : (((1 <= p37)) OR (E (F ((((1 <= p7)) OR ((1 <= p63)) OR ((1 <= p21) AND (1 <= p29))))) AND (A ((((1 <= p92)) U ((1 <= p54)))) OR A (F ((((1 <= p8)) OR ((1 <= p45)))))))) : NOT(A (F (((1 <= p93))))) : E ((NOT(A (G (((1 <= p92))))) U ((1 <= p3)))) : A (G (NOT(E (G ((((1 <= p31)) OR ((1 <= p51)))))))) : (NOT(A (F (((1 <= p68))))) AND ((NOT(E ((((1 <= p51)) U ((1 <= p41))))) OR E (G ((((1 <= p25)) OR ((1 <= p85)))))) OR A (X (((p26 <= 0)))))) : (((((p62 <= 0)) AND E (F (A (G (((1 <= p93))))))) AND ((p25 <= 0))) AND (A (F ((((1 <= p85)) OR ((1 <= p61))))) OR ((1 <= p39) AND ((p41 <= 0) OR ((1 <= p12) AND (1 <= p76)))))) : ((E (G (A (G (((1 <= p13) AND (1 <= p67) AND (1 <= p101) AND (1 <= p29)))))) OR ((1 <= p4) AND (1 <= p18) AND (1 <= p52))) OR (((p1 <= 0)) AND NOT(E (F (((1 <= p3))))))) : E ((((p21 <= 0) OR (p44 <= 0) OR (((p79 <= 0)) AND ((p42 <= 0)))) U (((p31 <= 0)) AND ((p86 <= 0)) AND (1 <= p11)))) : (((((p70 <= 0)) AND ((p90 <= 0))) AND (NOT(A (X (((1 <= p14) AND (1 <= p39))))) OR NOT(E (G ((1 <= 0)))))) AND (A (F ((((1 <= p66)) OR ((1 <= p56))))) OR (A (F (((1 <= p63)))) AND (((1 <= p98)) OR ((1 <= p20)) OR (p86 <= 0))))) : A (G (((((p70 <= 0) OR ((1 <= p30))) OR E (F (((1 <= p27))))) OR ((1 <= p2) AND (1 <= p35))))) : (E (F ((A (F (((1 <= p85)))) AND A (G (((1 <= p0))))))) AND A ((((1 <= p64) AND (1 <= p16) AND ((p99 <= 0))) U ((p93 <= 0) OR (p93 <= 0))))) : (NOT(A (X (((1 <= p17))))) AND (NOT(E (F (((1 <= p15))))) OR (NOT(E (X (((1 <= p61))))) AND NOT(A (F (((1 <= p13) AND (1 <= p67) AND (1 <= p101)))))))) : (E (G (((p74 <= 0)))) OR E (G (((1 <= p72)))))
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:254
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:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
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:323
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:338
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k: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:476
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:254
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:98
lola: rewrite Frontend/Parser/formula_rewrite.k:163
lola: rewrite Frontend/Parser/formula_rewrite.k:148
lola: rewrite Frontend/Parser/formula_rewrite.k:282
lola: rewrite Frontend/Parser/formula_rewrite.k:123
lola: rewrite Frontend/Parser/formula_rewrite.k:115
lola: rewrite Frontend/Parser/formula_rewrite.k:254
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:326
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
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:323
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 222 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E ((A (F (((p31 <= 0)))) U A (X (((1 <= p94) AND (1 <= p48))))))
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(((p31 <= 0))) U AX(((1 <= p94) AND (1 <= p48))))
lola: processed formula length: 53
lola: 59 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 566128 markings, 2594038 edges
lola: ========================================
lola: subprocess 1 will run for 237 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E (G (((p68 <= 0)))) AND (A ((((p51 <= 0)) R ((p41 <= 0)))) OR (E (G ((((1 <= p25)) OR ((1 <= p85))))) OR A (X (((p26 <= 0)))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 1 will run for 237 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G ((((1 <= p25)) OR ((1 <= p85)))))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation
lola: rewrite Frontend/Parser/formula_rewrite.k:583
lola: processed formula: E (G ((((1 <= p25)) OR ((1 <= p85)))))
lola: processed formula length: 39
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: 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: state equation task get result unparse finished++ id 0
lola: formula 0: (((p25 <= 0)) AND ((p85 <= 0)))
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: no
lola: produced by: state space / EG
lola: The predicate is not possibly preserved.
lola: 1 markings, 0 edges
lola: ========================================
lola: subprocess 2 will run for 254 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G (((p68 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation
lola: rewrite Frontend/Parser/formula_rewrite.k:583
lola: processed formula: E (G (((p68 <= 0))))
lola: processed formula length: 20
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: 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 <= p68))
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: 76 markings, 76 edges
lola: ========================================
lola: subprocess 3 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A ((((p51 <= 0)) R ((p41 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking universal release
lola: rewrite Frontend/Parser/formula_rewrite.k:619
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: rewrite Frontend/Parser/formula_rewrite.k:737
lola: rewrite Frontend/Parser/formula_rewrite.k:693
lola: rewrite Frontend/Parser/formula_rewrite.k:788
lola: rewrite Frontend/Parser/formula_rewrite.k:788
lola: processed formula: A ((((p51 <= 0)) R ((p41 <= 0))))
lola: processed formula length: 33
lola: 61 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /EU)
lola: state space: using reachability graph (EU version) (--search=depth)
lola: state space: using eu preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:788
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((1 <= p41))
lola: state equation task get result unparse finished id 0
lola: SUBRESULT
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: result: yes
lola: produced by: state space /EU
lola: Predicate Phi releases Predicate Psi on all paths.
lola: 0 markings, 0 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 2 will run for 254 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E (X (((p17 <= 0)))) AND (A (G (((p15 <= 0)))) OR (A (X (((p61 <= 0)))) AND E (G (((p13 <= 0) OR (p67 <= 0) OR (p101 <= 0)))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 2 will run for 254 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((p15 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:788
lola: processed formula: A (G (((p15 <= 0))))
lola: processed formula length: 20
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)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:788
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((1 <= p15))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 156 markings, 160 edges
lola: ========================================
lola: subprocess 3 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G (((p13 <= 0) OR (p67 <= 0) OR (p101 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation
lola: rewrite Frontend/Parser/formula_rewrite.k:583
lola: processed formula: E (G (((p13 <= 0) OR (p67 <= 0) OR (p101 <= 0))))
lola: processed formula length: 51
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: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:788
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: SUBRESULT
lola: result: yes
lola: produced by: state space / EG
lola: The predicate is possibly preserved.
lola: 77 markings, 77 edges
lola: ========================================
lola: subprocess 4 will run for 296 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (((p61 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:812
lola: processed formula: AX(((p61 <= 0)))
lola: processed formula length: 16
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 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: subprocess 5 will run for 323 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (X (((p17 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:807
lola: processed formula: EX(((p17 <= 0)))
lola: processed formula length: 16
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 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 3 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G (((p93 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation
lola: rewrite Frontend/Parser/formula_rewrite.k:583
lola: processed formula: E (G (((p93 <= 0))))
lola: processed formula length: 20
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: 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: yes
lola: produced by: state space / EG
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: The predicate is possibly preserved.
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((1 <= p93))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: 94 markings, 94 edges
lola: ========================================
lola: subprocess 4 will run for 296 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (A (F ((((p31 <= 0)) AND ((p51 <= 0)))))))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence from all states
lola: rewrite Frontend/Parser/formula_rewrite.k:599
lola: rewrite Frontend/Parser/formula_rewrite.k:634
lola: rewrite Frontend/Parser/formula_rewrite.k:734
lola: rewrite Frontend/Parser/formula_rewrite.k:788
lola: processed formula: (((1 <= p31)) OR ((1 <= p51)))
lola: processed formula length: 31
lola: 60 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 /EFEG)
lola: state space: using reachability graph (EFEG version) (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: state equation task get result started, id 1
lola: rewrite Frontend/Parser/formula_rewrite.k:700
lola: state equation task get result rewrite finished id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: state equation task get result unparse finished++ id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:788
lola: SUBRESULT
lola: result: no
lola: produced by: state space /EFEG
lola: The predicate does not eventually occur from all states.
lola: 40 markings, 40 edges
lola: ========================================
lola: subprocess 5 will run for 323 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E ((E (F (((p92 <= 0)))) U ((1 <= p3))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:806
lola: rewrite Frontend/Parser/formula_rewrite.k:809
lola: processed formula: E(EF(((p92 <= 0))) U ((1 <= p3)))
lola: processed formula length: 33
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: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 1314 markings, 4540 edges
lola: ========================================
lola: subprocess 6 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((((p70 <= 0) OR ((1 <= p30))) OR (E (F (((1 <= p27)))) OR ((1 <= p2) AND (1 <= p35))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:806
lola: rewrite Frontend/Parser/formula_rewrite.k:813
lola: processed formula: AG((((p70 <= 0) OR ((1 <= p30))) OR (EF(((1 <= p27))) OR ((1 <= p2) AND (1 <= p35)))))
lola: processed formula length: 87
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: 890457 markings, 3417808 edges, 178091 markings/sec, 0 secs
lola: 1616231 markings, 6716288 edges, 145155 markings/sec, 5 secs
lola: 2244819 markings, 9793330 edges, 125718 markings/sec, 10 secs
lola: 2832657 markings, 13080014 edges, 117568 markings/sec, 15 secs
lola: 3457381 markings, 16567517 edges, 124945 markings/sec, 20 secs
lola: 4155959 markings, 20325571 edges, 139716 markings/sec, 25 secs
lola: 4764653 markings, 23625916 edges, 121739 markings/sec, 30 secs
lola: 5415861 markings, 27225812 edges, 130242 markings/sec, 35 secs
lola: 6058697 markings, 30817786 edges, 128567 markings/sec, 40 secs
lola: 6700650 markings, 34538804 edges, 128391 markings/sec, 45 secs
lola: 7321981 markings, 38317460 edges, 124266 markings/sec, 50 secs
lola: 7923342 markings, 41806868 edges, 120272 markings/sec, 55 secs
lola: 8563990 markings, 45541330 edges, 128130 markings/sec, 60 secs
lola: 9168364 markings, 49307314 edges, 120875 markings/sec, 65 secs
lola: 9768245 markings, 53014777 edges, 119976 markings/sec, 70 secs
lola: 10361474 markings, 56656680 edges, 118646 markings/sec, 75 secs
lola: 10935023 markings, 60194639 edges, 114710 markings/sec, 80 secs
lola: 11526157 markings, 63953755 edges, 118227 markings/sec, 85 secs
lola: 12105660 markings, 67593760 edges, 115901 markings/sec, 90 secs
lola: 12726431 markings, 71468772 edges, 124154 markings/sec, 95 secs
lola: 13345345 markings, 75271561 edges, 123783 markings/sec, 100 secs
lola: 13946819 markings, 79021770 edges, 120295 markings/sec, 105 secs
lola: 14528311 markings, 82858498 edges, 116298 markings/sec, 110 secs
lola: 15157354 markings, 87000166 edges, 125809 markings/sec, 115 secs
lola: 15746106 markings, 90897606 edges, 117750 markings/sec, 120 secs
lola: 16328112 markings, 94834577 edges, 116401 markings/sec, 125 secs
lola: 16886718 markings, 98555831 edges, 111721 markings/sec, 130 secs
lola: 17349984 markings, 101817609 edges, 92653 markings/sec, 135 secs
lola: 17879704 markings, 105510097 edges, 105944 markings/sec, 140 secs
lola: 18441068 markings, 109428007 edges, 112273 markings/sec, 145 secs
lola: 18983516 markings, 113232617 edges, 108490 markings/sec, 150 secs
lola: 19535567 markings, 117248442 edges, 110410 markings/sec, 155 secs
lola: 20098632 markings, 121459162 edges, 112613 markings/sec, 160 secs
lola: 20652870 markings, 125411371 edges, 110848 markings/sec, 165 secs
lola: 21249917 markings, 129451468 edges, 119409 markings/sec, 170 secs
lola: 21860333 markings, 133610382 edges, 122083 markings/sec, 175 secs
lola: 22403975 markings, 137508886 edges, 108728 markings/sec, 180 secs
lola: 22954077 markings, 141477259 edges, 110020 markings/sec, 185 secs
lola: 23534759 markings, 145601693 edges, 116136 markings/sec, 190 secs
lola: 24083926 markings, 149468674 edges, 109833 markings/sec, 195 secs
lola: 24638016 markings, 153480154 edges, 110818 markings/sec, 200 secs
lola: 25178092 markings, 157433764 edges, 108015 markings/sec, 205 secs
lola: 25720379 markings, 161539206 edges, 108457 markings/sec, 210 secs
lola: 26306354 markings, 165728294 edges, 117195 markings/sec, 215 secs
lola: 26905470 markings, 170100500 edges, 119823 markings/sec, 220 secs
lola: 27504555 markings, 174518229 edges, 119817 markings/sec, 225 secs
lola: 28105633 markings, 179010335 edges, 120216 markings/sec, 230 secs
lola: 28724646 markings, 183428370 edges, 123803 markings/sec, 235 secs
lola: 29342462 markings, 187841767 edges, 123563 markings/sec, 240 secs
lola: 29939317 markings, 192165900 edges, 119371 markings/sec, 245 secs
lola: 30509846 markings, 196503496 edges, 114106 markings/sec, 250 secs
lola: 31128139 markings, 200885168 edges, 123659 markings/sec, 255 secs
lola: 31767670 markings, 205343522 edges, 127906 markings/sec, 260 secs
lola: 32383918 markings, 209735424 edges, 123250 markings/sec, 265 secs
lola: 33002878 markings, 214184002 edges, 123792 markings/sec, 270 secs
lola: 33613789 markings, 218622680 edges, 122182 markings/sec, 275 secs
lola: 34224036 markings, 223083571 edges, 122049 markings/sec, 280 secs
lola: 34821379 markings, 227548567 edges, 119469 markings/sec, 285 secs
lola: 35400016 markings, 231993857 edges, 115727 markings/sec, 290 secs
lola: 36041025 markings, 236556138 edges, 128202 markings/sec, 295 secs
lola: 36666359 markings, 241033598 edges, 125067 markings/sec, 300 secs
lola: 37291197 markings, 245637787 edges, 124968 markings/sec, 305 secs
lola: 37894388 markings, 250272386 edges, 120638 markings/sec, 310 secs
lola: 38472776 markings, 254917467 edges, 115678 markings/sec, 315 secs
lola: 39076370 markings, 259314436 edges, 120719 markings/sec, 320 secs
lola: 39659960 markings, 263724355 edges, 116718 markings/sec, 325 secs
lola: 40242505 markings, 268179606 edges, 116509 markings/sec, 330 secs
lola: 40852988 markings, 272678702 edges, 122097 markings/sec, 335 secs
lola: 41465640 markings, 277244968 edges, 122530 markings/sec, 340 secs
lola: 42072510 markings, 281879016 edges, 121374 markings/sec, 345 secs
lola: 42671744 markings, 286452749 edges, 119847 markings/sec, 350 secs
lola: local time limit reached - aborting
lola:
preliminary result: yes unknown unknown unknown yes yes no yes unknown unknown unknown unknown unknown unknown yes unknown
lola: memory consumption: 4084976 KB
lola: time consumption: 363 seconds
lola: print data as JSON (--json)
lola: writing JSON to CTLFireability.json
lola: closed JSON file CTLFireability.json
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 7 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (((A (F (((1 <= p83)))) OR (((p60 <= 0)) AND ((p39 <= 0)))) U A (G (((p17 <= 0))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:811
lola: rewrite Frontend/Parser/formula_rewrite.k:813
lola: rewrite Frontend/Parser/formula_rewrite.k:814
lola: processed formula: A((AF(((1 <= p83))) OR (((p60 <= 0)) AND ((p39 <= 0)))) U AG(((p17 <= 0))))
lola: processed formula length: 75
lola: 59 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 3 significant temporal operators and needs 13 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 1314 markings, 3379 edges
lola: ========================================
lola: subprocess 8 will run for 400 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E ((((p21 <= 0) OR (p44 <= 0) OR (((p79 <= 0)) AND ((p42 <= 0)))) U (((p31 <= 0)) AND ((p86 <= 0)) AND (1 <= p11))))
lola: ========================================
lola: SUBTASK
lola: checking existential until
lola: rewrite Frontend/Parser/formula_rewrite.k:618
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: rewrite Frontend/Parser/formula_rewrite.k:738
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: E ((((p21 <= 0) OR (p44 <= 0) OR (((p79 <= 0)) AND ((p42 <= 0)))) U (((p31 <= 0)) AND ((p86 <= 0)) AND (1 <= p11))))
lola: processed formula length: 118
lola: 59 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /EU)
lola: state space: using reachability graph (EU version) (--search=depth)
lola: state space: using eu preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (((p31 <= 0)) AND ((p86 <= 0)) AND (1 <= p11))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 3 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to CTLFireability-8-0.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space /EU
lola: There is a path where Predicate Phi holds until Predicate Psi.
lola: 863 markings, 2036 edges
lola: ========================================
lola: subprocess 9 will run for 458 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E (G (((p74 <= 0)))) OR E (G (((1 <= p72)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 9 will run for 458 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G (((1 <= p72))))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation
lola: rewrite Frontend/Parser/formula_rewrite.k:583
lola: processed formula: E (G (((1 <= p72))))
lola: processed formula length: 20
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: 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: state equation task get result unparse finished++ id 0
lola: formula 0: ((p72 <= 0))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to CTLFireability-9-0.sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space / EG
lola: The predicate is not possibly preserved.
lola: 1 markings, 0 edges
lola: ========================================
lola: subprocess 10 will run for 534 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G (((p74 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation
lola: rewrite Frontend/Parser/formula_rewrite.k:583
lola: processed formula: E (G (((p74 <= 0))))
lola: processed formula length: 20
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: 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: state equation task get result unparse finished++ id 0
lola: formula 0: ((1 <= p74))
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: 94 markings, 94 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 10 will run for 534 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((((p70 <= 0)) AND ((p90 <= 0))) AND (A (F ((((1 <= p66)) OR ((1 <= p56))))) OR (A (F (((1 <= p63)))) AND (((1 <= p98)) OR ((1 <= p20)) OR (p86 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: local time limit reached - aborting
lola:
preliminary result: yes no unknown unknown yes yes no yes unknown unknown yes unknown unknown unknown yes yes
lola: caught signal User defined signal 1 - aborting LoLA
lola: memory consumption: 49012 KB
lola: time consumption: 897 seconds
lola: print data as JSON (--json)
lola: writing JSON to CTLFireability.json
lola: closed JSON file CTLFireability.json
lola: time limit reached - aborting
lola:
preliminary result: yes no unknown unknown yes yes no yes unknown unknown yes unknown unknown unknown yes yes
lola:
preliminary result: yes no unknown unknown yes yes no yes unknown unknown yes unknown unknown unknown yes yes
lola: memory consumption: 49012 KB
lola: time consumption: 3570 seconds
lola: print data as JSON (--json)
lola: writing JSON to CTLFireability.json
lola: closed JSON file CTLFireability.json
rslt: finished
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16427456 kB
MemFree: 16097608 kB
After kill :
MemTotal: 16427456 kB
MemFree: 16097624 kB
--------------------
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="ShieldRVt-PT-002B"
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 ShieldRVt-PT-002B, examination is CTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r211-tajo-159033478200948"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/ShieldRVt-PT-002B.tgz
mv ShieldRVt-PT-002B 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 ;