About the Execution of ITS-LoLa for DNAwalker-PT-08ringLL
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 15740.450 | 3600000.00 | 1593293.00 | 378.30 | FFFFFFFFFTFFTTFF | 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.r178-tajo-158987881900140.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 DNAwalker-PT-08ringLL, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r178-tajo-158987881900140
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 296K
-rw-r--r-- 1 mcc users 4.0K Mar 31 04:57 CTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Mar 31 04:57 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Mar 29 20:53 CTLFireability.txt
-rw-r--r-- 1 mcc users 12K Mar 29 20:53 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 24 05:37 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 5.6K Mar 24 05:37 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.3K Apr 8 14:52 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 28 14:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Apr 8 14:52 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Apr 28 14:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.1K Mar 28 13:41 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 22K Mar 28 13:41 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.3K Mar 27 06:26 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 22K Mar 27 06:26 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 28 14:49 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Mar 28 14:49 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 equiv_col
-rw-r--r-- 1 mcc users 9 Mar 24 05:37 instance
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 iscolored
-rw-r--r-- 1 mcc users 112K 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 DNAwalker-PT-08ringLL-CTLFireability-00
FORMULA_NAME DNAwalker-PT-08ringLL-CTLFireability-01
FORMULA_NAME DNAwalker-PT-08ringLL-CTLFireability-02
FORMULA_NAME DNAwalker-PT-08ringLL-CTLFireability-03
FORMULA_NAME DNAwalker-PT-08ringLL-CTLFireability-04
FORMULA_NAME DNAwalker-PT-08ringLL-CTLFireability-05
FORMULA_NAME DNAwalker-PT-08ringLL-CTLFireability-06
FORMULA_NAME DNAwalker-PT-08ringLL-CTLFireability-07
FORMULA_NAME DNAwalker-PT-08ringLL-CTLFireability-08
FORMULA_NAME DNAwalker-PT-08ringLL-CTLFireability-09
FORMULA_NAME DNAwalker-PT-08ringLL-CTLFireability-10
FORMULA_NAME DNAwalker-PT-08ringLL-CTLFireability-11
FORMULA_NAME DNAwalker-PT-08ringLL-CTLFireability-12
FORMULA_NAME DNAwalker-PT-08ringLL-CTLFireability-13
FORMULA_NAME DNAwalker-PT-08ringLL-CTLFireability-14
FORMULA_NAME DNAwalker-PT-08ringLL-CTLFireability-15
=== Now, execution of the tool begins
BK_START 1591205434873
bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-03 17:30:36] [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 17:30:36] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-03 17:30:36] [INFO ] Load time of PNML (sax parser for PT used): 49 ms
[2020-06-03 17:30:36] [INFO ] Transformed 27 places.
[2020-06-03 17:30:36] [INFO ] Transformed 260 transitions.
[2020-06-03 17:30:36] [INFO ] Parsed PT model containing 27 places and 260 transitions in 84 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 12 ms.
Incomplete random walk after 100000 steps, including 7998 resets, run finished after 314 ms. (steps per millisecond=318 ) properties seen :[1, 1, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-06-03 17:30:36] [INFO ] Flow matrix only has 259 transitions (discarded 1 similar events)
// Phase 1: matrix 259 rows 27 cols
[2020-06-03 17:30:36] [INFO ] Computed 0 place invariants in 5 ms
[2020-06-03 17:30:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 17:30:37] [INFO ] [Real]Absence check using state equation in 91 ms returned sat
[2020-06-03 17:30:37] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 17:30:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 17:30:37] [INFO ] [Nat]Absence check using state equation in 152 ms returned unsat
[2020-06-03 17:30:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 17:30:37] [INFO ] [Real]Absence check using state equation in 72 ms returned sat
[2020-06-03 17:30:37] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 17:30:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 17:30:37] [INFO ] [Nat]Absence check using state equation in 133 ms returned unsat
[2020-06-03 17:30:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 17:30:37] [INFO ] [Real]Absence check using state equation in 68 ms returned sat
[2020-06-03 17:30:37] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 17:30:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 17:30:37] [INFO ] [Nat]Absence check using state equation in 228 ms returned unsat
[2020-06-03 17:30:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 17:30:37] [INFO ] [Real]Absence check using state equation in 78 ms returned sat
[2020-06-03 17:30:37] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 17:30:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 17:30:38] [INFO ] [Nat]Absence check using state equation in 304 ms returned unsat
Successfully simplified 4 atomic propositions for a total of 4 simplifications.
[2020-06-03 17:30:38] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2020-06-03 17:30:38] [INFO ] Flatten gal took : 55 ms
[2020-06-03 17:30:38] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2020-06-03 17:30:38] [INFO ] Flatten gal took : 16 ms
FORMULA DNAwalker-PT-08ringLL-CTLFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-06-03 17:30:38] [INFO ] Export to MCC properties in file /home/mcc/execution/CTLFireability.sr.xml took 4 ms.
[2020-06-03 17:30:38] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 4 ms.
info: Time: 3600 - MCC
vrfy: Checking CTLFireability @ DNAwalker-PT-08ringLL @ 3570 seconds
FORMULA DNAwalker-PT-08ringLL-CTLFireability-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA DNAwalker-PT-08ringLL-CTLFireability-01 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA DNAwalker-PT-08ringLL-CTLFireability-07 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA DNAwalker-PT-08ringLL-CTLFireability-09 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA DNAwalker-PT-08ringLL-CTLFireability-00 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA DNAwalker-PT-08ringLL-CTLFireability-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA DNAwalker-PT-08ringLL-CTLFireability-03 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA DNAwalker-PT-08ringLL-CTLFireability-08 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA DNAwalker-PT-08ringLL-CTLFireability-05 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA DNAwalker-PT-08ringLL-CTLFireability-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA DNAwalker-PT-08ringLL-CTLFireability-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA DNAwalker-PT-08ringLL-CTLFireability-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA DNAwalker-PT-08ringLL-CTLFireability-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA DNAwalker-PT-08ringLL-CTLFireability-04 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA DNAwalker-PT-08ringLL-CTLFireability-06 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 2008
rslt: Output for CTLFireability @ DNAwalker-PT-08ringLL
{
"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 17:30:38 2020
",
"timelimit": 3570
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 195
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 0,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 0,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 0,
"visible_transitions": 0
},
"processed": "NOT DEADLOCK",
"processed_size": 12,
"rewrites": 46
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 0,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 209
},
"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": "AX(AX(EF(((1 <= p19) AND (2 <= p21)))))",
"processed_size": 39,
"rewrites": 49
},
"net":
{
"conflict_clusters": 7,
"singleton_clusters": 0
},
"result":
{
"edges": 4300199,
"markings": 572062,
"produced_by": "CTL model checker",
"value": false
},
"task":
{
"compoundnumber": 1,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 225
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 2,
"E": 0,
"F": 1,
"G": 0,
"U": 0,
"X": 1,
"aconj": 3,
"adisj": 1,
"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": "AF((AX((((2 <= p9) AND (1 <= p26)) OR ((2 <= p7) AND (1 <= p26)))) OR ((1 <= p1) AND (2 <= p15))))",
"processed_size": 99,
"rewrites": 48
},
"net":
{
"conflict_clusters": 7,
"singleton_clusters": 0
},
"result":
{
"edges": 6,
"markings": 6,
"produced_by": "CTL model checker",
"value": false
},
"task":
{
"compoundnumber": 3,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 246
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 1,
"F": 0,
"G": 1,
"U": 0,
"X": 1,
"aconj": 1,
"adisj": 0,
"aneg": 1,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "AG(EX(((p5 <= 1) OR (p25 <= 0))))",
"processed_size": 34,
"rewrites": 48
},
"net":
{
"conflict_clusters": 7,
"singleton_clusters": 0
},
"result":
{
"edges": 237024906,
"markings": 27950678,
"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": 253
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 1,
"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": "AX(EF(((2 <= p12) AND (1 <= p14))))",
"processed_size": 35,
"rewrites": 48
},
"net":
{
"conflict_clusters": 7,
"singleton_clusters": 0
},
"result":
{
"edges": 415361,
"markings": 64752,
"produced_by": "CTL model checker",
"value": false
},
"task":
{
"compoundnumber": 5,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 281
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 1,
"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": "EF(AX(((2 <= p16) AND (1 <= p17))))",
"processed_size": 35,
"rewrites": 48
},
"net":
{
"conflict_clusters": 7,
"singleton_clusters": 0
},
"result":
{
"edges": 237024906,
"markings": 27950678,
"produced_by": "CTL model checker",
"value": false
},
"task":
{
"compoundnumber": 6,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 292
},
"exit":
{
"localtimelimitreached": false
},
"result":
{
"edges": 14922020,
"markings": 2795865,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 7,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "deadlock preserving/insertion"
},
"treads": 1,
"type": "dfs"
},
"type": "deadlock",
"workflow": "search"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 328
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 1,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "((p16 <= 1) OR (p19 <= 0))",
"processed_size": 27,
"rewrites": 49
},
"result":
{
"edges": 11,
"markings": 11,
"produced_by": "state space / EG",
"value": false
},
"task":
{
"compoundnumber": 8,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 58
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 2,
"problems": 2
},
"type": "eventual_occurrence",
"workflow": "stateequation"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 383
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 1,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "((p11 <= 1) OR (p16 <= 0))",
"processed_size": 27,
"rewrites": 49
},
"result":
{
"edges": 12,
"markings": 12,
"produced_by": "state space / EG",
"value": false
},
"task":
{
"compoundnumber": 9,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 61
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 2,
"problems": 2
},
"type": "eventual_occurrence",
"workflow": "stateequation"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 459
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"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": "(((2 <= p3) AND (1 <= p5)) OR (1 <= p20))",
"processed_size": 42,
"rewrites": 50
},
"result":
{
"edges": 11,
"markings": 11,
"produced_by": "state space /EFEG",
"value": false
},
"task":
{
"compoundnumber": 10,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 47
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 3,
"problems": 2
},
"type": "eventual_occurrence_from_all_states",
"workflow": "stateequation"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 574
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 1,
"aneg": 1,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "E (G ((((1 <= p1) AND (2 <= p13)) OR (p1 <= 1) OR (p7 <= 0))))",
"processed_size": 64,
"rewrites": 47
},
"result":
{
"edges": 10,
"markings": 10,
"produced_by": "state space / EG",
"value": true
},
"task":
{
"compoundnumber": 11,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 78
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 6,
"problems": 2
},
"type": "possible_preservation",
"workflow": "stateequation"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 766
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 2,
"E": 1,
"F": 2,
"G": 1,
"U": 0,
"X": 0,
"aconj": 4,
"adisj": 0,
"aneg": 0,
"comp": 8,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 8,
"taut": 0,
"tconj": 0,
"tdisj": 3,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 7,
"visible_transitions": 0
},
"processed": "AG((EF(((1 <= p7) AND (2 <= p25))) OR (AF(((1 <= p9) AND (2 <= p12))) OR (((1 <= p14) AND (2 <= p17)) OR ((2 <= p9) AND (1 <= p16))))))",
"processed_size": 135,
"rewrites": 49
},
"net":
{
"conflict_clusters": 7,
"singleton_clusters": 0
},
"result":
{
"edges": 42989570,
"markings": 5419627,
"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": 1136
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1136
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 3,
"adisj": 1,
"aneg": 0,
"comp": 9,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 9,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 7,
"visible_transitions": 0
},
"processed": "(((2 <= p0) AND (1 <= p5)) OR ((1 <= p23) AND (2 <= p25) AND ((1 <= p16) OR ((2 <= p21) AND (1 <= p25) AND (2 <= p16) AND (1 <= p26)))))",
"processed_size": 137,
"rewrites": 47
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 13,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 2273
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 1,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "((p1 <= 1) OR (p9 <= 0))",
"processed_size": 25,
"rewrites": 50
},
"result":
{
"edges": 11,
"markings": 11,
"produced_by": "state space /EFEG",
"value": false
},
"task":
{
"compoundnumber": 14,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 29
},
"threads": 1,
"type": "dfs"
},
"type": "eventual_occurrence_from_all_states",
"workflow": "stateequation"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 13,
"type": "boolean"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 2273
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 2273
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "((1 <= p17) OR ((1 <= p3) AND (2 <= p11)))",
"processed_size": 42,
"rewrites": 47
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 14,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "(2 <= p0)",
"processed_size": 9,
"rewrites": 46
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 16,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 1,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "((p25 <= 0) OR (p26 <= 1))",
"processed_size": 27,
"rewrites": 49
},
"result":
{
"edges": 11,
"markings": 11,
"produced_by": "state space / EG",
"value": false
},
"task":
{
"compoundnumber": 17,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 40
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 2,
"problems": 2
},
"type": "eventual_occurrence",
"workflow": "stateequation"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 14,
"type": "boolean"
}
},
{
"formula":
{
"count":
{
"A": 0,
"E": 3,
"F": 1,
"G": 1,
"U": 0,
"X": 1,
"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": "EF(EG(EX(((1 <= p1) AND (2 <= p11)))))",
"processed_size": 38,
"rewrites": 49
},
"net":
{
"conflict_clusters": 7,
"singleton_clusters": 0
},
"result":
{
"edges": 291822266,
"markings": 27950678,
"produced_by": "CTL model checker",
"value": false
},
"task":
{
"compoundnumber": 15,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
}
],
"exit":
{
"error": null,
"memory": 39536,
"runtime": 1562.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "CTLFireability.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "A(X(E(F(**)))) : A(X(A(X(E(F(**)))))) : E(F(DEADLOCK)) : (A(F(*)) AND (E(G(*)) AND (** AND (** AND (A(F(**)) OR (** OR **)))))) : A(F(**)) : E(F(E(G(E(X(**)))))) : A(F((A(X(**)) OR **))) : A(F(**)) : A(G(E(X(*)))) : (A(G(A(F(**)))) OR (** OR **)) : A(G(A(F(*)))) : E(G(*)) : NODEADLOCK : E(F(A(X(**)))) : A(G((E(F(**)) OR (A(F(**)) OR (** OR **)))))"
},
"net":
{
"arcs": 760,
"conflict_clusters": 7,
"places": 27,
"places_significant": 27,
"singleton_clusters": 0,
"transitions": 260
},
"result":
{
"preliminary_value": "no no no no no no no no yes no no yes yes no no ",
"value": "no no no no no no no no yes no no yes yes no no "
},
"task":
{
"type": "compound"
}
}
lola: LoLA will run for 3570 seconds at most (--timelimit)
lola: NET
lola: input: PNML file (--pnml)
lola: reading net from model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file model.pnml
lola: 287/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 864
lola: finding significant places
lola: 27 places, 260 transitions, 27 significant places
lola: compute conflict clusters
lola: computed conflict clusters
lola: Computing conflicting sets
lola: Computing back conflicting sets
lola: TASK
lola: Reading formula in XML format (--xmlformula)
lola: reading pnml
lola: reading formula from CTLFireability.xml
lola: A (X (E (F (A (F (((2 <= p12) AND (1 <= p14)))))))) : A (X (A (X (E (F (((1 <= p19) AND (2 <= p21)))))))) : E (F (A (X ((1 <= 0))))) : ((((NOT(E (G (((2 <= p17) AND (1 <= p21))))) AND NOT(A (F (((1 <= p11) AND (2 <= p15)))))) AND (2 <= p0)) AND (1 <= p26)) AND ((A (F (((1 <= p25) AND (2 <= p26)))) OR (1 <= p17)) OR ((1 <= p3) AND (2 <= p11)))) : A (F (((2 <= p11) AND (1 <= p16)))) : E (F (E (G (E (X (((1 <= p1) AND (2 <= p11)))))))) : A (F ((A (X ((((2 <= p9) AND (1 <= p26)) OR ((2 <= p7) AND (1 <= p26))))) OR ((1 <= p1) AND (2 <= p15))))) : A (F (((2 <= p16) AND (1 <= p19)))) : NOT(E (F (A (X (((2 <= p5) AND (1 <= p25))))))) : (((A (G (A (F (((2 <= p1) AND (1 <= p9)))))) OR ((2 <= p0) AND (1 <= p5))) OR (E (G ((1 <= 0))) AND NOT(A (F (((2 <= p1) AND (1 <= p25))))))) OR ((1 <= p23) AND (2 <= p25) AND ((1 <= p16) OR ((2 <= p21) AND (1 <= p25) AND (2 <= p16) AND (1 <= p26))))) : A (G (NOT(E (G ((((2 <= p3) AND (1 <= p5)) OR (1 <= p20))))))) : NOT(A (F ((((p1 <= 0) OR (p13 <= 1)) AND (2 <= p1) AND (1 <= p7))))) : E (X ((E (G ((0 <= 0))) OR ((E (G (((1 <= p15) AND (2 <= p16)))) AND (1 <= p14)) AND (2 <= p15))))) : E (F (A (X (((2 <= p16) AND (1 <= p17)))))) : A (G ((((E (F (((1 <= p7) AND (2 <= p25)))) OR A (F (((1 <= p9) AND (2 <= p12))))) OR ((1 <= p14) AND (2 <= p17))) OR ((2 <= p9) AND (1 <= p16)))))
lola: rewrite Frontend/Parser/formula_rewrite.k:455
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:139
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:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k: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:323
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:118
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:121
lola: rewrite Frontend/Parser/formula_rewrite.k:254
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:100
lola: rewrite Frontend/Parser/formula_rewrite.k:160
lola: rewrite Frontend/Parser/formula_rewrite.k:148
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:124
lola: rewrite Frontend/Parser/formula_rewrite.k:130
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: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 195 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: NOT DEADLOCK
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: NOT DEADLOCK
lola: processed formula length: 12
lola: 46 rewrites
lola: closed formula file CTLFireability.xml
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 1 will run for 209 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (A (X (E (F (((1 <= p19) AND (2 <= p21))))))))
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:812
lola: processed formula: AX(AX(EF(((1 <= p19) AND (2 <= p21)))))
lola: processed formula length: 39
lola: 49 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 572062 markings, 4300199 edges
lola: ========================================
lola: subprocess 2 will run for 225 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (E (G (E (X (((1 <= p1) AND (2 <= p11))))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:807
lola: rewrite Frontend/Parser/formula_rewrite.k:808
lola: rewrite Frontend/Parser/formula_rewrite.k:806
lola: processed formula: EF(EG(EX(((1 <= p1) AND (2 <= p11)))))
lola: processed formula length: 38
lola: 49 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: 721218 markings, 6904607 edges, 144244 markings/sec, 0 secs
lola: 1323971 markings, 13029439 edges, 120551 markings/sec, 5 secs
lola: 1972434 markings, 19492067 edges, 129693 markings/sec, 10 secs
lola: 2542433 markings, 25106405 edges, 114000 markings/sec, 15 secs
lola: 3030680 markings, 29737658 edges, 97649 markings/sec, 20 secs
lola: 3600101 markings, 35372678 edges, 113884 markings/sec, 25 secs
lola: 4180296 markings, 41392109 edges, 116039 markings/sec, 30 secs
lola: 4804722 markings, 47691976 edges, 124885 markings/sec, 35 secs
lola: 5421021 markings, 53989219 edges, 123260 markings/sec, 40 secs
lola: 5971041 markings, 59561124 edges, 110004 markings/sec, 45 secs
lola: 6602439 markings, 65782503 edges, 126280 markings/sec, 50 secs
lola: 7213026 markings, 71906866 edges, 122117 markings/sec, 55 secs
lola: 7810435 markings, 77945559 edges, 119482 markings/sec, 60 secs
lola: 8339155 markings, 83342084 edges, 105744 markings/sec, 65 secs
lola: 8767472 markings, 87774537 edges, 85663 markings/sec, 70 secs
lola: 9254746 markings, 92571236 edges, 97455 markings/sec, 75 secs
lola: 9759535 markings, 97746176 edges, 100958 markings/sec, 80 secs
lola: 10270873 markings, 103059341 edges, 102268 markings/sec, 85 secs
lola: 10696588 markings, 107417606 edges, 85143 markings/sec, 90 secs
lola: 11224263 markings, 112622131 edges, 105535 markings/sec, 95 secs
lola: 11656271 markings, 117462375 edges, 86402 markings/sec, 100 secs
lola: 12104945 markings, 122383881 edges, 89735 markings/sec, 105 secs
lola: 12463960 markings, 126235944 edges, 71803 markings/sec, 110 secs
lola: 12984877 markings, 131489844 edges, 104183 markings/sec, 115 secs
lola: 13467352 markings, 136172877 edges, 96495 markings/sec, 120 secs
lola: 13949021 markings, 141140393 edges, 96334 markings/sec, 125 secs
lola: 14514256 markings, 146910124 edges, 113047 markings/sec, 130 secs
lola: 14937575 markings, 151306326 edges, 84664 markings/sec, 135 secs
lola: 15407749 markings, 156113815 edges, 94035 markings/sec, 140 secs
lola: 15836470 markings, 160344341 edges, 85744 markings/sec, 145 secs
lola: 16307688 markings, 165300865 edges, 94244 markings/sec, 150 secs
lola: 16833080 markings, 170527592 edges, 105078 markings/sec, 155 secs
lola: 17292050 markings, 175557245 edges, 91794 markings/sec, 160 secs
lola: 17865111 markings, 181530974 edges, 114612 markings/sec, 165 secs
lola: 18401285 markings, 187174610 edges, 107235 markings/sec, 170 secs
lola: 18879352 markings, 192152553 edges, 95613 markings/sec, 175 secs
lola: 19402573 markings, 197771423 edges, 104644 markings/sec, 180 secs
lola: 19970369 markings, 203636878 edges, 113559 markings/sec, 185 secs
lola: 20540184 markings, 209528353 edges, 113963 markings/sec, 190 secs
lola: 21061027 markings, 214911936 edges, 104169 markings/sec, 195 secs
lola: 21577213 markings, 220697827 edges, 103237 markings/sec, 200 secs
lola: 22127018 markings, 226291370 edges, 109961 markings/sec, 205 secs
lola: 22576104 markings, 231285373 edges, 89817 markings/sec, 210 secs
lola: 23117253 markings, 236859636 edges, 108230 markings/sec, 215 secs
lola: local time limit reached - aborting
lola:
preliminary result: unknown no unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown yes unknown unknown
lola: memory consumption: 2859940 KB
lola: time consumption: 861 seconds
lola: print data as JSON (--json)
lola: writing JSON to CTLFireability.json
lola: closed JSON file CTLFireability.json
lola: caught signal User defined signal 2 - aborting LoLA
lola:
preliminary result: unknown no unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown yes unknown unknown
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 3 will run for 225 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F ((A (X ((((2 <= p9) AND (1 <= p26)) OR ((2 <= p7) AND (1 <= p26))))) OR ((1 <= p1) AND (2 <= p15)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:812
lola: rewrite Frontend/Parser/formula_rewrite.k:811
lola: processed formula: AF((AX((((2 <= p9) AND (1 <= p26)) OR ((2 <= p7) AND (1 <= p26)))) OR ((1 <= p1) AND (2 <= p15))))
lola: processed formula length: 99
lola: 48 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 6 markings, 6 edges
lola: ========================================
lola: subprocess 4 will run for 246 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (E (X (((p5 <= 1) OR (p25 <= 0))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:807
lola: rewrite Frontend/Parser/formula_rewrite.k:813
lola: processed formula: AG(EX(((p5 <= 1) OR (p25 <= 0))))
lola: processed formula length: 34
lola: 48 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: 1131845 markings, 8603494 edges, 226369 markings/sec, 0 secs
lola: 2127301 markings, 16480571 edges, 199091 markings/sec, 5 secs
lola: 3072838 markings, 23904113 edges, 189107 markings/sec, 10 secs
lola: 3933851 markings, 30734177 edges, 172203 markings/sec, 15 secs
lola: 4662179 markings, 36668103 edges, 145666 markings/sec, 20 secs
lola: 5440624 markings, 43135917 edges, 155689 markings/sec, 25 secs
lola: 6085466 markings, 48413367 edges, 128968 markings/sec, 30 secs
lola: 6844808 markings, 54324906 edges, 151868 markings/sec, 35 secs
lola: 7645292 markings, 60840081 edges, 160097 markings/sec, 40 secs
lola: 8497980 markings, 67947573 edges, 170538 markings/sec, 45 secs
lola: 9278051 markings, 74314675 edges, 156014 markings/sec, 50 secs
lola: 10146870 markings, 81476138 edges, 173764 markings/sec, 55 secs
lola: 10952764 markings, 88176526 edges, 161179 markings/sec, 60 secs
lola: 11761257 markings, 95446642 edges, 161699 markings/sec, 65 secs
lola: 12477804 markings, 102046411 edges, 143309 markings/sec, 70 secs
lola: 13366973 markings, 109032593 edges, 177834 markings/sec, 75 secs
lola: 14151166 markings, 115391997 edges, 156839 markings/sec, 80 secs
lola: 14960660 markings, 122092639 edges, 161899 markings/sec, 85 secs
lola: 15627123 markings, 127755848 edges, 133293 markings/sec, 90 secs
lola: 16392072 markings, 133932685 edges, 152990 markings/sec, 95 secs
lola: 17123213 markings, 139995196 edges, 146228 markings/sec, 100 secs
lola: 17885127 markings, 146609704 edges, 152383 markings/sec, 105 secs
lola: 18641391 markings, 153131478 edges, 151253 markings/sec, 110 secs
lola: 19312168 markings, 159104625 edges, 134155 markings/sec, 115 secs
lola: 20155946 markings, 165956013 edges, 168756 markings/sec, 120 secs
lola: 20875978 markings, 172187875 edges, 144006 markings/sec, 125 secs
lola: 21651464 markings, 178995522 edges, 155097 markings/sec, 130 secs
lola: 22379740 markings, 185295437 edges, 145655 markings/sec, 135 secs
lola: 23103764 markings, 191519436 edges, 144805 markings/sec, 140 secs
lola: 23846196 markings, 197931850 edges, 148486 markings/sec, 145 secs
lola: 24445030 markings, 203619090 edges, 119767 markings/sec, 150 secs
lola: 25204162 markings, 210538026 edges, 151826 markings/sec, 155 secs
lola: 25927799 markings, 217246463 edges, 144727 markings/sec, 160 secs
lola: 26642174 markings, 224432140 edges, 142875 markings/sec, 165 secs
lola: 27411688 markings, 231842787 edges, 153903 markings/sec, 170 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 27950678 markings, 237024906 edges
lola: ========================================
lola: subprocess 5 will run for 253 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (E (F (((2 <= p12) AND (1 <= p14))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:806
lola: rewrite Frontend/Parser/formula_rewrite.k:812
lola: processed formula: AX(EF(((2 <= p12) AND (1 <= p14))))
lola: processed formula length: 35
lola: 48 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 64752 markings, 415361 edges
lola: subprocess 6 will run for 281 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (A (X (((2 <= p16) AND (1 <= p17))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:812
lola: rewrite Frontend/Parser/formula_rewrite.k:806
lola: processed formula: EF(AX(((2 <= p16) AND (1 <= p17))))
lola: processed formula length: 35
lola: 48 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: ========================================
lola: 995651 markings, 7487792 edges, 199130 markings/sec, 0 secs
lola: 1819320 markings, 14008327 edges, 164734 markings/sec, 5 secs
lola: 2558785 markings, 19934431 edges, 147893 markings/sec, 10 secs
lola: 3240863 markings, 25256398 edges, 136416 markings/sec, 15 secs
lola: 3977056 markings, 31110735 edges, 147239 markings/sec, 20 secs
lola: 4652309 markings, 36587163 edges, 135051 markings/sec, 25 secs
lola: 5528978 markings, 43848496 edges, 175334 markings/sec, 30 secs
lola: 6387283 markings, 50811136 edges, 171661 markings/sec, 35 secs
lola: 7175576 markings, 57082128 edges, 157659 markings/sec, 40 secs
lola: 7934417 markings, 63290600 edges, 151768 markings/sec, 45 secs
lola: 8714382 markings, 69778454 edges, 155993 markings/sec, 50 secs
lola: 9467264 markings, 75901487 edges, 150576 markings/sec, 55 secs
lola: 10234170 markings, 82253592 edges, 153381 markings/sec, 60 secs
lola: 10933690 markings, 88017541 edges, 139904 markings/sec, 65 secs
lola: 11671669 markings, 94604673 edges, 147596 markings/sec, 70 secs
lola: 12393332 markings, 101135805 edges, 144333 markings/sec, 75 secs
lola: 13221133 markings, 108019415 edges, 165560 markings/sec, 80 secs
lola: 14038322 markings, 114578430 edges, 163438 markings/sec, 85 secs
lola: 14879556 markings, 121477076 edges, 168247 markings/sec, 90 secs
lola: 15586473 markings, 127477094 edges, 141383 markings/sec, 95 secs
lola: 16470420 markings, 134508590 edges, 176789 markings/sec, 100 secs
lola: 17213427 markings, 140893189 edges, 148601 markings/sec, 105 secs
lola: 17959821 markings, 147311053 edges, 149279 markings/sec, 110 secs
lola: 18643885 markings, 153156594 edges, 136813 markings/sec, 115 secs
lola: 19261704 markings, 158733889 edges, 123564 markings/sec, 120 secs
lola: 20064883 markings, 165241211 edges, 160636 markings/sec, 125 secs
lola: 20739724 markings, 171107639 edges, 134968 markings/sec, 130 secs
lola: 21484469 markings, 177489919 edges, 148949 markings/sec, 135 secs
lola: 22214221 markings, 183817685 edges, 145950 markings/sec, 140 secs
lola: 22910268 markings, 189787203 edges, 139209 markings/sec, 145 secs
lola: 23618454 markings, 195887550 edges, 141637 markings/sec, 150 secs
lola: 24225848 markings, 201469557 edges, 121479 markings/sec, 155 secs
lola: 24888426 markings, 207476905 edges, 132516 markings/sec, 160 secs
lola: 25530822 markings, 213507501 edges, 128479 markings/sec, 165 secs
lola: 26180521 markings, 219782946 edges, 129940 markings/sec, 170 secs
lola: 26844198 markings, 226385355 edges, 132735 markings/sec, 175 secs
lola: 27613483 markings, 233757088 edges, 153857 markings/sec, 180 secs
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 27950678 markings, 237024906 edges
lola: ========================================
lola: subprocess 7 will run for 292 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (DEADLOCK))
lola: ========================================
lola: SUBTASK
lola: checking reachability of deadlocks
lola: Planning: workflow for deadlock check: search (--findpath=off,--siphontrap=off)
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 deadlock preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: RUNNING
lola: 355520 markings, 1430902 edges, 71104 markings/sec, 0 secs
lola: 691927 markings, 2967931 edges, 67281 markings/sec, 5 secs
lola: 1018651 markings, 4521306 edges, 65345 markings/sec, 10 secs
lola: 1313824 markings, 6107606 edges, 59035 markings/sec, 15 secs
lola: 1636637 markings, 7825446 edges, 64563 markings/sec, 20 secs
lola: 1957088 markings, 9690107 edges, 64090 markings/sec, 25 secs
lola: 2272874 markings, 11519425 edges, 63157 markings/sec, 30 secs
lola: 2580138 markings, 13445903 edges, 61453 markings/sec, 35 secs
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The net does not have deadlocks.
lola: 2795865 markings, 14922020 edges
lola: ========================================
lola: subprocess 8 will run for 328 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (((2 <= p16) AND (1 <= p19))))
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: ((p16 <= 1) OR (p19 <= 0))
lola: processed formula length: 27
lola: 49 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / 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: formula 0: ((2 <= p16) AND (1 <= p19))
lola: state equation task get result unparse finished id 0
lola: The predicate does not eventually occur.
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: 11 markings, 11 edges
lola: subprocess 9 will run for 383 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (((2 <= p11) AND (1 <= p16))))
lola: ========================================
lola: SUBTASK
lola: 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: ((p11 <= 1) OR (p16 <= 0))
lola: processed formula length: 27
lola: 49 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:700
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((2 <= p11) AND (1 <= p16))
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 does not eventually occur.
lola: 12 markings, 12 edges
lola: ========================================
lola: subprocess 10 will run for 459 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (A (F ((((p3 <= 1) OR (p5 <= 0)) AND (p20 <= 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: (((2 <= p3) AND (1 <= p5)) OR (1 <= p20))
lola: processed formula length: 42
lola: 50 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /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: rewrite Frontend/Parser/formula_rewrite.k:700
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (((p3 <= 1) OR (p5 <= 0)) AND (p20 <= 0))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 4 literals and 2 conjunctive subformulas
lola: state equation task get result started, id 1
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 1
lola: state equation task get result unparse finished++ id 1
lola: formula 1: (((2 <= p3) AND (1 <= p5)) OR (1 <= p20))
lola: state equation task get result unparse finished id 1
lola: state equation: Generated DNF with 3 literals and 2 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space /EFEG
lola: The predicate does not eventually occur from all states.
lola: 11 markings, 11 edges
lola: ========================================
lola: subprocess 11 will run for 574 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G ((((1 <= p1) AND (2 <= p13)) OR (p1 <= 1) OR (p7 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation
lola: rewrite Frontend/Parser/formula_rewrite.k:583
lola: processed formula: E (G ((((1 <= p1) AND (2 <= p13)) OR (p1 <= 1) OR (p7 <= 0))))
lola: processed formula length: 64
lola: 47 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: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: produced by: state space / EG
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: (((p1 <= 0) OR (p13 <= 1)) AND (2 <= p1) AND (1 <= p7))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 6 literals and 2 conjunctive subformulas
lola: 10 markings, 10 edges
lola: ========================================
lola: subprocess 12 will run for 766 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((E (F (((1 <= p7) AND (2 <= p25)))) OR (A (F (((1 <= p9) AND (2 <= p12)))) OR (((1 <= p14) AND (2 <= p17)) OR ((2 <= p9) AND (1 <= p16)))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:806
lola: rewrite Frontend/Parser/formula_rewrite.k:811
lola: rewrite Frontend/Parser/formula_rewrite.k:813
lola: processed formula: AG((EF(((1 <= p7) AND (2 <= p25))) OR (AF(((1 <= p9) AND (2 <= p12))) OR (((1 <= p14) AND (2 <= p17)) OR ((2 <= p9) AND (1 <= p16))))))
lola: processed formula length: 135
lola: 49 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 3 significant temporal operators and needs 13 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: 1183912 markings, 9004397 edges, 236782 markings/sec, 0 secs
lola: 2198179 markings, 17022038 edges, 202853 markings/sec, 5 secs
lola: 3259351 markings, 25412490 edges, 212234 markings/sec, 10 secs
lola: 4264562 markings, 33571231 edges, 201042 markings/sec, 15 secs
lola: 5324638 markings, 42155356 edges, 212015 markings/sec, 20 secs
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 5419627 markings, 42989570 edges
lola: ========================================
lola: subprocess 13 will run for 1136 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (G (A (F (((2 <= p1) AND (1 <= p9)))))) OR (((2 <= p0) AND (1 <= p5)) OR ((1 <= p23) AND (2 <= p25) AND ((1 <= p16) OR ((2 <= p21) AND (1 <= p25) AND (2 <= p16) AND (1 <= p26))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 13 will run for 1136 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (((2 <= p0) AND (1 <= p5)) OR ((1 <= p23) AND (2 <= p25) AND ((1 <= p16) OR ((2 <= p21) AND (1 <= p25) AND (2 <= p16) AND (1 <= p26)))))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: rewrite Frontend/Parser/formula_rewrite.k:797
lola: processed formula: (((2 <= p0) AND (1 <= p5)) OR ((1 <= p23) AND (2 <= p25) AND ((1 <= p16) OR ((2 <= p21) AND (1 <= p25) AND (2 <= p16) AND (1 <= p26)))))
lola: processed formula length: 137
lola: 47 rewrites
lola: closed formula file CTLFireability.xml
lola: processed formula with 9 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 14 will run for 2273 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (A (F (((2 <= p1) AND (1 <= p9))))))
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:787
lola: processed formula: ((p1 <= 1) OR (p9 <= 0))
lola: processed formula length: 25
lola: 50 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /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: rewrite Frontend/Parser/formula_rewrite.k:700
lola: SUBRESULT
lola: result: no
lola: produced by: state space /EFEG
lola: state equation task get result started, id 1
lola: The predicate does not eventually occur from all states.
lola: 11 markings, 11 edges
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((2 <= p1) AND (1 <= p9))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 14 will run for 2273 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (F (((p17 <= 1) OR (p21 <= 0)))) AND (E (G (((p11 <= 0) OR (p15 <= 1)))) AND ((2 <= p0) AND ((1 <= p26) AND (A (F (((1 <= p25) AND (2 <= p26)))) OR ((1 <= p17) OR ((1 <= p3) AND (2 <= p11))))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 14 will run for 2273 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((1 <= p17) OR ((1 <= p3) AND (2 <= p11)))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: rewrite Frontend/Parser/formula_rewrite.k:797
lola: processed formula: ((1 <= p17) OR ((1 <= p3) AND (2 <= p11)))
lola: processed formula length: 42
lola: 47 rewrites
lola: closed formula file CTLFireability.xml
lola: processed formula with 3 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: Child process aborted or communication problem between parent and child process
lola: subprocess 16 will run for 1 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (2 <= p0)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (2 <= p0)
lola: processed formula length: 9
lola: 46 rewrites
lola: closed formula file CTLFireability.xml
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 17 will run for 1 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (((1 <= p25) AND (2 <= p26))))
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: ((p25 <= 0) OR (p26 <= 1))
lola: processed formula length: 27
lola: 49 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / 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: The predicate does not eventually occur.
lola: 11 markings, 11 edges
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((1 <= p25) AND (2 <= p26))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: state equation: write sara problem file to CTLFireability-17-0.sara
lola: ========================================
lola: ...considering subproblem: E (F (E (G (E (X (((1 <= p1) AND (2 <= p11))))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:807
lola: rewrite Frontend/Parser/formula_rewrite.k:808
lola: rewrite Frontend/Parser/formula_rewrite.k:806
lola: processed formula: EF(EG(EX(((1 <= p1) AND (2 <= p11)))))
lola: processed formula length: 38
lola: 49 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: 688643 markings, 6595674 edges, 137729 markings/sec, 0 secs
lola: 1281861 markings, 12542055 edges, 118644 markings/sec, 5 secs
lola: 1876267 markings, 18467626 edges, 118881 markings/sec, 10 secs
lola: 2453828 markings, 24115941 edges, 115512 markings/sec, 15 secs
lola: 3009242 markings, 29536033 edges, 111083 markings/sec, 20 secs
lola: 3617502 markings, 35526882 edges, 121652 markings/sec, 25 secs
lola: 4182712 markings, 41420493 edges, 113042 markings/sec, 30 secs
lola: 4798349 markings, 47620783 edges, 123127 markings/sec, 35 secs
lola: 5394368 markings, 53716583 edges, 119204 markings/sec, 40 secs
lola: 5917302 markings, 59095978 edges, 104587 markings/sec, 45 secs
lola: 6489528 markings, 64723666 edges, 114445 markings/sec, 50 secs
lola: 7029545 markings, 70007593 edges, 108003 markings/sec, 55 secs
lola: 7529129 markings, 75064803 edges, 99917 markings/sec, 60 secs
lola: 8069141 markings, 80728981 edges, 108002 markings/sec, 65 secs
lola: 8636837 markings, 86399500 edges, 113539 markings/sec, 70 secs
lola: 9189298 markings, 91902025 edges, 110492 markings/sec, 75 secs
lola: 9774111 markings, 97865857 edges, 116963 markings/sec, 80 secs
lola: 10331790 markings, 103682466 edges, 111536 markings/sec, 85 secs
lola: 10890948 markings, 109258051 edges, 111832 markings/sec, 90 secs
lola: 11454634 markings, 115267267 edges, 112737 markings/sec, 95 secs
lola: 11974051 markings, 120877200 edges, 103883 markings/sec, 100 secs
lola: 12397936 markings, 125395079 edges, 84777 markings/sec, 105 secs
lola: 12922966 markings, 130866609 edges, 105006 markings/sec, 110 secs
lola: 13474858 markings, 136256122 edges, 110378 markings/sec, 115 secs
lola: 13969472 markings, 141387417 edges, 98923 markings/sec, 120 secs
lola: 14493214 markings, 146695396 edges, 104748 markings/sec, 125 secs
lola: 15005203 markings, 151965051 edges, 102398 markings/sec, 130 secs
lola: 15477103 markings, 156798940 edges, 94380 markings/sec, 135 secs
lola: 16062177 markings, 162679264 edges, 117015 markings/sec, 140 secs
lola: 16578144 markings, 167864521 edges, 103193 markings/sec, 145 secs
lola: 17065062 markings, 173011752 edges, 97384 markings/sec, 150 secs
lola: 17527522 markings, 177822934 edges, 92492 markings/sec, 155 secs
lola: 17997428 markings, 183063175 edges, 93981 markings/sec, 160 secs
lola: 18477978 markings, 188005375 edges, 96110 markings/sec, 165 secs
lola: 18909336 markings, 192489447 edges, 86272 markings/sec, 170 secs
lola: 19385582 markings, 197617149 edges, 95249 markings/sec, 175 secs
lola: 19883869 markings, 202858179 edges, 99657 markings/sec, 180 secs
lola: 20449143 markings, 208552384 edges, 113055 markings/sec, 185 secs
lola: 20950770 markings, 213840380 edges, 100325 markings/sec, 190 secs
lola: 21490551 markings, 219740396 edges, 107956 markings/sec, 195 secs
lola: 22032067 markings, 225318738 edges, 108303 markings/sec, 200 secs
lola: 22464073 markings, 230151941 edges, 86401 markings/sec, 205 secs
lola: 23003548 markings, 235607695 edges, 107895 markings/sec, 210 secs
lola: 23494191 markings, 240782534 edges, 98129 markings/sec, 215 secs
lola: 23985137 markings, 246093202 edges, 98189 markings/sec, 220 secs
lola: 24384410 markings, 250921446 edges, 79855 markings/sec, 225 secs
lola: 24937570 markings, 256798170 edges, 110632 markings/sec, 230 secs
lola: 25415981 markings, 262371519 edges, 95682 markings/sec, 235 secs
lola: 25922450 markings, 268075809 edges, 101294 markings/sec, 240 secs
lola: 26398749 markings, 273965659 edges, 95260 markings/sec, 245 secs
lola: 26902294 markings, 279907856 edges, 100709 markings/sec, 250 secs
lola: 27453059 markings, 286120080 edges, 110153 markings/sec, 255 secs
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 27950678 markings, 291822266 edges
lola: RESULT
lola:
SUMMARY: no no no no no no no no yes no no yes yes no no
lola:
preliminary result: no no no no no no no no yes no no yes yes no no
lola: ========================================
lola: memory consumption: 39536 KB
lola: time consumption: 1562 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="DNAwalker-PT-08ringLL"
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 DNAwalker-PT-08ringLL, 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 r178-tajo-158987881900140"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/DNAwalker-PT-08ringLL.tgz
mv DNAwalker-PT-08ringLL 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 ;