About the Execution of ITS-LoLa for AirplaneLD-PT-0020
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 15741.800 | 3600000.00 | 20656.00 | 285.60 | FFFTFFFFFFFTTTFF | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2020-input.r166-smll-158987787400252.qcow2', fmt=qcow2 size=4294967296 backing_file='/data/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 AirplaneLD-PT-0020, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r166-smll-158987787400252
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 488K
-rw-r--r-- 1 mcc users 12K Mar 24 10:42 CTLCardinality.txt
-rw-r--r-- 1 mcc users 40K Mar 24 10:42 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K Mar 24 09:21 CTLFireability.txt
-rw-r--r-- 1 mcc users 29K Mar 24 09:21 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 24 05:37 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.2K Mar 24 05:37 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 14K Apr 8 14:40 LTLCardinality.txt
-rw-r--r-- 1 mcc users 50K Apr 29 06:16 LTLCardinality.xml
-rw-r--r-- 1 mcc users 6.1K Apr 8 14:40 LTLFireability.txt
-rw-r--r-- 1 mcc users 32K Apr 29 06:16 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.4K Mar 24 07:55 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 27K Mar 24 07:55 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.8K Mar 24 06:12 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 33K Mar 24 06:12 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.9K Mar 24 08:44 UpperBounds.txt
-rw-r--r-- 1 mcc users 5.8K Mar 24 08:44 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 24 05:37 equiv_col
-rw-r--r-- 1 mcc users 5 Mar 24 05:37 instance
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 iscolored
-rw-r--r-- 1 mcc users 169K 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 AirplaneLD-PT-0020-CTLFireability-00
FORMULA_NAME AirplaneLD-PT-0020-CTLFireability-01
FORMULA_NAME AirplaneLD-PT-0020-CTLFireability-02
FORMULA_NAME AirplaneLD-PT-0020-CTLFireability-03
FORMULA_NAME AirplaneLD-PT-0020-CTLFireability-04
FORMULA_NAME AirplaneLD-PT-0020-CTLFireability-05
FORMULA_NAME AirplaneLD-PT-0020-CTLFireability-06
FORMULA_NAME AirplaneLD-PT-0020-CTLFireability-07
FORMULA_NAME AirplaneLD-PT-0020-CTLFireability-08
FORMULA_NAME AirplaneLD-PT-0020-CTLFireability-09
FORMULA_NAME AirplaneLD-PT-0020-CTLFireability-10
FORMULA_NAME AirplaneLD-PT-0020-CTLFireability-11
FORMULA_NAME AirplaneLD-PT-0020-CTLFireability-12
FORMULA_NAME AirplaneLD-PT-0020-CTLFireability-13
FORMULA_NAME AirplaneLD-PT-0020-CTLFireability-14
FORMULA_NAME AirplaneLD-PT-0020-CTLFireability-15
=== Now, execution of the tool begins
BK_START 1591372973214
bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-05 16:02:55] [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 16:02:55] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-05 16:02:56] [INFO ] Load time of PNML (sax parser for PT used): 148 ms
[2020-06-05 16:02:56] [INFO ] Transformed 159 places.
[2020-06-05 16:02:56] [INFO ] Transformed 168 transitions.
[2020-06-05 16:02:56] [INFO ] Found NUPN structural information;
[2020-06-05 16:02:56] [INFO ] Parsed PT model containing 159 places and 168 transitions in 234 ms.
Reduce places removed 62 places and 0 transitions.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 51 ms.
Incomplete random walk after 100000 steps, including 12575 resets, run finished after 596 ms. (steps per millisecond=167 ) properties seen :[1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1]
// Phase 1: matrix 168 rows 97 cols
[2020-06-05 16:02:56] [INFO ] Computed 3 place invariants in 13 ms
[2020-06-05 16:02:56] [INFO ] [Real]Absence check using 2 positive place invariants in 18 ms returned unsat
[2020-06-05 16:02:57] [INFO ] [Real]Absence check using 2 positive place invariants in 6 ms returned sat
[2020-06-05 16:02:57] [INFO ] [Real]Absence check using 2 positive and 1 generalized place invariants in 3 ms returned sat
[2020-06-05 16:02:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 16:02:57] [INFO ] [Real]Absence check using state equation in 55 ms returned unsat
[2020-06-05 16:02:57] [INFO ] [Real]Absence check using 2 positive place invariants in 4 ms returned sat
[2020-06-05 16:02:57] [INFO ] [Real]Absence check using 2 positive and 1 generalized place invariants in 3 ms returned sat
[2020-06-05 16:02:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 16:02:57] [INFO ] [Real]Absence check using state equation in 97 ms returned unsat
Successfully simplified 3 atomic propositions for a total of 3 simplifications.
[2020-06-05 16:02:57] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
[2020-06-05 16:02:57] [INFO ] Flatten gal took : 98 ms
[2020-06-05 16:02:57] [INFO ] Initial state reduction rules for CTL removed 3 formulas.
[2020-06-05 16:02:57] [INFO ] Flatten gal took : 37 ms
FORMULA AirplaneLD-PT-0020-CTLFireability-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AirplaneLD-PT-0020-CTLFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AirplaneLD-PT-0020-CTLFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-06-05 16:02:57] [INFO ] Export to MCC properties in file /home/mcc/execution/CTLFireability.sr.xml took 10 ms.
[2020-06-05 16:02:57] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 4 ms.
info: Time: 3600 - MCC
vrfy: Checking CTLFireability @ AirplaneLD-PT-0020 @ 3570 seconds
FORMULA AirplaneLD-PT-0020-CTLFireability-03 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA AirplaneLD-PT-0020-CTLFireability-06 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA AirplaneLD-PT-0020-CTLFireability-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA AirplaneLD-PT-0020-CTLFireability-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA AirplaneLD-PT-0020-CTLFireability-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA AirplaneLD-PT-0020-CTLFireability-02 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA AirplaneLD-PT-0020-CTLFireability-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA AirplaneLD-PT-0020-CTLFireability-07 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA AirplaneLD-PT-0020-CTLFireability-09 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA AirplaneLD-PT-0020-CTLFireability-05 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA AirplaneLD-PT-0020-CTLFireability-08 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA AirplaneLD-PT-0020-CTLFireability-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA AirplaneLD-PT-0020-CTLFireability-00 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 3561
rslt: Output for CTLFireability @ AirplaneLD-PT-0020
{
"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 16:02:58 2020
",
"timelimit": 3570
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 274
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 274
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "((1 <= p87) AND (1 <= p96))",
"processed_size": 27,
"rewrites": 14
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 0,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 297
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 1,
"F": 0,
"G": 1,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 1,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "AX(EG(((p84 <= 0) OR (p95 <= 0))))",
"processed_size": 35,
"rewrites": 16
},
"net":
{
"conflict_clusters": 13,
"singleton_clusters": 0
},
"result":
{
"edges": 70786,
"markings": 36709,
"produced_by": "CTL model checker",
"value": true
},
"task":
{
"compoundnumber": 1,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": true
},
"task":
{
"compoundnumber": 0,
"type": "boolean"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 297
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 2,
"E": 1,
"F": 1,
"G": 1,
"U": 0,
"X": 1,
"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": "AX(AG(EF(((1 <= p21)))))",
"processed_size": 24,
"rewrites": 17
},
"net":
{
"conflict_clusters": 13,
"singleton_clusters": 0
},
"result":
{
"edges": 54,
"markings": 30,
"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": 324
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 1,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "A (G (((p29 <= 0) OR (p89 <= 0))))",
"processed_size": 35,
"rewrites": 16
},
"result":
{
"edges": 9,
"markings": 10,
"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": 2,
"problems": 2
},
"type": "invariance",
"workflow": "stateequation||search"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 356
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "E (F (((1 <= p37) AND (1 <= p89))))",
"processed_size": 35,
"rewrites": 15
},
"result":
{
"edges": 9,
"markings": 10,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 3,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 2,
"problems": 2
},
"type": "reachability",
"workflow": "stateequation||search"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 396
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 1,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "A (G (((p22 <= 0) OR (p89 <= 0))))",
"processed_size": 35,
"rewrites": 16
},
"result":
{
"edges": 9,
"markings": 10,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 4,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 2,
"problems": 2
},
"type": "invariance",
"workflow": "stateequation||search"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 445
},
"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 <= p83)) OR ((1 <= p0)))))",
"processed_size": 38,
"rewrites": 15
},
"result":
{
"edges": 39244,
"markings": 38485,
"produced_by": "state space / EG",
"value": false
},
"task":
{
"compoundnumber": 5,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 22
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 2,
"problems": 2
},
"type": "possible_preservation",
"workflow": "stateequation"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 509
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 2,
"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 ((((1 <= p39) AND (1 <= p89)) OR ((1 <= p42)))))",
"processed_size": 54,
"rewrites": 15
},
"result":
{
"edges": 1692,
"markings": 1693,
"produced_by": "state space / EG",
"value": false
},
"task":
{
"compoundnumber": 6,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 72
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 4,
"problems": 2
},
"type": "possible_preservation",
"workflow": "stateequation"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 594
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 3,
"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": 4,
"visible_transitions": 0
},
"processed": "((p21 <= 0) OR (((p86 <= 0)) AND ((p88 <= 0) OR (p96 <= 0))))",
"processed_size": 63,
"rewrites": 18
},
"result":
{
"edges": 1214674,
"markings": 303139,
"produced_by": "parallel",
"value": false
},
"task":
{
"compoundnumber": 7,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "tscc preserving/always up"
}
},
"stateequation":
{
"literals": 5,
"problems": 2
},
"store":
{
"type": "dfs/tscc"
},
"type": "possible_invariance",
"workflow": "stateequation"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 712
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 2,
"E": 0,
"F": 1,
"G": 1,
"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": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "AF((AG(((p18 <= 0) OR (p93 <= 0))) AND ((1 <= p0))))",
"processed_size": 53,
"rewrites": 16
},
"net":
{
"conflict_clusters": 13,
"singleton_clusters": 0
},
"result":
{
"edges": 34,
"markings": 14,
"produced_by": "CTL model checker",
"value": false
},
"task":
{
"compoundnumber": 8,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 890
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 3,
"F": 1,
"G": 1,
"U": 1,
"X": 0,
"aconj": 14,
"adisj": 2,
"aneg": 0,
"comp": 25,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 25,
"taut": 0,
"tconj": 3,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 15,
"visible_transitions": 0
},
"processed": "EG((E(((1 <= p85) AND (1 <= p95)) U (((1 <= p86)))) OR (EF(((1 <= p85) AND (1 <= p95))) AND (((1 <= p87)) AND (((1 <= p96)) AND (((1 <= p35) AND (1 <= p89)) OR ((1 <= p36) AND (1 <= p89)) OR ((1 <= p39) AND (1 <= p89)) OR ((1 <= p40) AND (1 <= p89)) OR ((1 <= p38) AND (1 <= p89)) OR ((1 <= p37) AND (1 <= p89)) OR ((1 <= p34) AND (1 <= p89)) OR ((1 <= p33) AND (1 <= p89)) OR ((1 <= p32) AND (1 <= p89))))))))",
"processed_size": 418,
"rewrites": 17
},
"net":
{
"conflict_clusters": 13,
"singleton_clusters": 0
},
"result":
{
"edges": 1257795,
"markings": 289296,
"produced_by": "CTL model checker",
"value": false
},
"task":
{
"compoundnumber": 9,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1187
},
"exit": null,
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 0,
"G": 0,
"U": 1,
"X": 0,
"aconj": 2,
"adisj": 1,
"aneg": 0,
"comp": 6,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 6,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 6,
"visible_transitions": 0
},
"processed": "E ((((1 <= p42) AND (1 <= p21) AND ((p51 <= 0) OR (p94 <= 0))) U ((1 <= p13) AND (1 <= p93))))",
"processed_size": 95,
"rewrites": 17
},
"result":
{
"edges": 844,
"markings": 357,
"produced_by": "state space /EU",
"value": false
},
"task":
{
"compoundnumber": 10,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "eu preserving",
"visible": 61
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 2,
"problems": 2
},
"type": "existential_until",
"workflow": "stateequation"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1781
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1780
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "E (F (((1 <= p53) AND (1 <= p94))))",
"processed_size": 35,
"rewrites": 15
},
"result":
{
"edges": 5,
"markings": 6,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 11,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 2,
"problems": 2
},
"type": "reachability",
"workflow": "stateequation||search"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": true
},
"task":
{
"compoundnumber": 11,
"type": "boolean"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3561
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3561
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 1,
"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 ((((1 <= p86)))))",
"processed_size": 22,
"rewrites": 15
},
"result":
{
"edges": 32842,
"markings": 32843,
"produced_by": "state space / EG",
"value": false
},
"task":
{
"compoundnumber": 12,
"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": false
},
"task":
{
"compoundnumber": 12,
"type": "boolean"
}
}
],
"exit":
{
"error": null,
"memory": 80268,
"runtime": 9.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "CTLFireability.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "(E(G(*)) AND A((* R *))) : E(G(**)) : (A(X(E(G(**)))) OR (** AND E(F(**)))) : E(G((E((** U **)) OR (E(F(**)) AND (** AND (** AND **)))))) : A(X(A(G(E(F(**)))))) : E(F(A(G(**)))) : E((** U **)) : A(F((A(G(**)) AND **))) : A(G(**)) : E(F(**)) : (E(F(**)) OR E(G(E((** U **))))) : A(G(**)) : E(G(*))"
},
"net":
{
"arcs": 470,
"conflict_clusters": 13,
"places": 97,
"places_significant": 94,
"singleton_clusters": 0,
"transitions": 168
},
"result":
{
"preliminary_value": "no no yes no no no no no no yes yes no no ",
"value": "no no yes no no no no 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: 265/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 3104
lola: finding significant places
lola: 97 places, 168 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: (p86 <= 1)
lola: LP says that atomic proposition is always true: (p86 <= 1)
lola: LP says that atomic proposition is always true: (p65 <= 1)
lola: LP says that atomic proposition is always true: (p94 <= 1)
lola: LP says that atomic proposition is always true: (p70 <= 1)
lola: LP says that atomic proposition is always true: (p94 <= 1)
lola: LP says that atomic proposition is always true: (p82 <= 1)
lola: LP says that atomic proposition is always true: (p94 <= 1)
lola: LP says that atomic proposition is always true: (p80 <= 1)
lola: LP says that atomic proposition is always true: (p94 <= 1)
lola: LP says that atomic proposition is always true: (p75 <= 1)
lola: LP says that atomic proposition is always true: (p94 <= 1)
lola: LP says that atomic proposition is always true: (p77 <= 1)
lola: LP says that atomic proposition is always true: (p94 <= 1)
lola: LP says that atomic proposition is always true: (p73 <= 1)
lola: LP says that atomic proposition is always true: (p94 <= 1)
lola: LP says that atomic proposition is always true: (p63 <= 1)
lola: LP says that atomic proposition is always true: (p94 <= 1)
lola: LP says that atomic proposition is always true: (p69 <= 1)
lola: LP says that atomic proposition is always true: (p94 <= 1)
lola: LP says that atomic proposition is always true: (p67 <= 1)
lola: LP says that atomic proposition is always true: (p94 <= 1)
lola: LP says that atomic proposition is always true: (p76 <= 1)
lola: LP says that atomic proposition is always true: (p94 <= 1)
lola: LP says that atomic proposition is always true: (p64 <= 1)
lola: LP says that atomic proposition is always true: (p94 <= 1)
lola: LP says that atomic proposition is always true: (p71 <= 1)
lola: LP says that atomic proposition is always true: (p94 <= 1)
lola: LP says that atomic proposition is always true: (p81 <= 1)
lola: LP says that atomic proposition is always true: (p94 <= 1)
lola: LP says that atomic proposition is always true: (p74 <= 1)
lola: LP says that atomic proposition is always true: (p94 <= 1)
lola: LP says that atomic proposition is always true: (p78 <= 1)
lola: LP says that atomic proposition is always true: (p94 <= 1)
lola: LP says that atomic proposition is always true: (p62 <= 1)
lola: LP says that atomic proposition is always true: (p94 <= 1)
lola: LP says that atomic proposition is always true: (p79 <= 1)
lola: LP says that atomic proposition is always true: (p94 <= 1)
lola: LP says that atomic proposition is always true: (p72 <= 1)
lola: LP says that atomic proposition is always true: (p94 <= 1)
lola: LP says that atomic proposition is always true: (p66 <= 1)
lola: LP says that atomic proposition is always true: (p94 <= 1)
lola: LP says that atomic proposition is always true: (p68 <= 1)
lola: LP says that atomic proposition is always true: (p94 <= 1)
lola: LP says that atomic proposition is always true: (p88 <= 1)
lola: LP says that atomic proposition is always true: (p96 <= 1)
lola: LP says that atomic proposition is always true: (p83 <= 1)
lola: LP says that atomic proposition is always true: (p0 <= 1)
lola: LP says that atomic proposition is always true: (p84 <= 1)
lola: LP says that atomic proposition is always true: (p95 <= 1)
lola: LP says that atomic proposition is always true: (p87 <= 1)
lola: LP says that atomic proposition is always true: (p96 <= 1)
lola: LP says that atomic proposition is always true: (p24 <= 1)
lola: LP says that atomic proposition is always true: (p89 <= 1)
lola: LP says that atomic proposition is always true: (p30 <= 1)
lola: LP says that atomic proposition is always true: (p89 <= 1)
lola: LP says that atomic proposition is always true: (p29 <= 1)
lola: LP says that atomic proposition is always true: (p89 <= 1)
lola: LP says that atomic proposition is always true: (p25 <= 1)
lola: LP says that atomic proposition is always true: (p89 <= 1)
lola: LP says that atomic proposition is always true: (p22 <= 1)
lola: LP says that atomic proposition is always true: (p89 <= 1)
lola: LP says that atomic proposition is always true: (p23 <= 1)
lola: LP says that atomic proposition is always true: (p89 <= 1)
lola: LP says that atomic proposition is always true: (p41 <= 1)
lola: LP says that atomic proposition is always true: (p89 <= 1)
lola: LP says that atomic proposition is always true: (p26 <= 1)
lola: LP says that atomic proposition is always true: (p89 <= 1)
lola: LP says that atomic proposition is always true: (p27 <= 1)
lola: LP says that atomic proposition is always true: (p89 <= 1)
lola: LP says that atomic proposition is always true: (p28 <= 1)
lola: LP says that atomic proposition is always true: (p89 <= 1)
lola: LP says that atomic proposition is always true: (p31 <= 1)
lola: LP says that atomic proposition is always true: (p89 <= 1)
lola: LP says that atomic proposition is always true: (p86 <= 1)
lola: LP says that atomic proposition is always true: (p86 <= 1)
lola: LP says that atomic proposition is always true: (p42 <= 1)
lola: LP says that atomic proposition is always true: (p42 <= 1)
lola: LP says that atomic proposition is always true: (p42 <= 1)
lola: LP says that atomic proposition is always true: (p42 <= 1)
lola: LP says that atomic proposition is always true: (p42 <= 1)
lola: LP says that atomic proposition is always true: (p42 <= 1)
lola: LP says that atomic proposition is always true: (p42 <= 1)
lola: LP says that atomic proposition is always true: (p42 <= 1)
lola: LP says that atomic proposition is always true: (p42 <= 1)
lola: LP says that atomic proposition is always true: (p42 <= 1)
lola: LP says that atomic proposition is always true: (p42 <= 1)
lola: LP says that atomic proposition is always true: (p42 <= 1)
lola: LP says that atomic proposition is always true: (p42 <= 1)
lola: LP says that atomic proposition is always true: (p42 <= 1)
lola: LP says that atomic proposition is always true: (p42 <= 1)
lola: LP says that atomic proposition is always true: (p42 <= 1)
lola: LP says that atomic proposition is always true: (p42 <= 1)
lola: LP says that atomic proposition is always true: (p42 <= 1)
lola: LP says that atomic proposition is always true: (p42 <= 1)
lola: LP says that atomic proposition is always true: (p42 <= 1)
lola: LP says that atomic proposition is always true: (p42 <= 1)
lola: LP says that atomic proposition is always true: (p42 <= 1)
lola: LP says that atomic proposition is always true: (p42 <= 1)
lola: LP says that atomic proposition is always true: (p42 <= 1)
lola: LP says that atomic proposition is always true: (p42 <= 1)
lola: LP says that atomic proposition is always true: (p42 <= 1)
lola: LP says that atomic proposition is always true: (p42 <= 1)
lola: LP says that atomic proposition is always true: (p42 <= 1)
lola: LP says that atomic proposition is always true: (p42 <= 1)
lola: LP says that atomic proposition is always true: (p42 <= 1)
lola: LP says that atomic proposition is always true: (p42 <= 1)
lola: LP says that atomic proposition is always true: (p42 <= 1)
lola: LP says that atomic proposition is always true: (p42 <= 1)
lola: LP says that atomic proposition is always true: (p42 <= 1)
lola: LP says that atomic proposition is always true: (p42 <= 1)
lola: LP says that atomic proposition is always true: (p42 <= 1)
lola: LP says that atomic proposition is always true: (p42 <= 1)
lola: LP says that atomic proposition is always true: (p42 <= 1)
lola: LP says that atomic proposition is always true: (p42 <= 1)
lola: LP says that atomic proposition is always true: (p42 <= 1)
lola: LP says that atomic proposition is always true: (p84 <= 1)
lola: LP says that atomic proposition is always true: (p95 <= 1)
lola: LP says that atomic proposition is always true: (p85 <= 1)
lola: LP says that atomic proposition is always true: (p95 <= 1)
lola: LP says that atomic proposition is always true: (p86 <= 1)
lola: LP says that atomic proposition is always true: (p86 <= 1)
lola: LP says that atomic proposition is always true: (p85 <= 1)
lola: LP says that atomic proposition is always true: (p95 <= 1)
lola: LP says that atomic proposition is always true: (p87 <= 1)
lola: LP says that atomic proposition is always true: (p96 <= 1)
lola: LP says that atomic proposition is always true: (p35 <= 1)
lola: LP says that atomic proposition is always true: (p89 <= 1)
lola: LP says that atomic proposition is always true: (p36 <= 1)
lola: LP says that atomic proposition is always true: (p89 <= 1)
lola: LP says that atomic proposition is always true: (p39 <= 1)
lola: LP says that atomic proposition is always true: (p89 <= 1)
lola: LP says that atomic proposition is always true: (p40 <= 1)
lola: LP says that atomic proposition is always true: (p89 <= 1)
lola: LP says that atomic proposition is always true: (p38 <= 1)
lola: LP says that atomic proposition is always true: (p89 <= 1)
lola: LP says that atomic proposition is always true: (p37 <= 1)
lola: LP says that atomic proposition is always true: (p89 <= 1)
lola: LP says that atomic proposition is always true: (p34 <= 1)
lola: LP says that atomic proposition is always true: (p89 <= 1)
lola: LP says that atomic proposition is always true: (p33 <= 1)
lola: LP says that atomic proposition is always true: (p89 <= 1)
lola: LP says that atomic proposition is always true: (p32 <= 1)
lola: LP says that atomic proposition is always true: (p89 <= 1)
lola: LP says that atomic proposition is always true: (p21 <= 1)
lola: LP says that atomic proposition is always true: (p21 <= 1)
lola: LP says that atomic proposition is always true: (p86 <= 1)
lola: LP says that atomic proposition is always true: (p88 <= 1)
lola: LP says that atomic proposition is always true: (p96 <= 1)
lola: LP says that atomic proposition is always true: (p42 <= 1)
lola: LP says that atomic proposition is always true: (p21 <= 1)
lola: LP says that atomic proposition is always true: (p51 <= 1)
lola: LP says that atomic proposition is always true: (p94 <= 1)
lola: LP says that atomic proposition is always true: (p13 <= 1)
lola: LP says that atomic proposition is always true: (p93 <= 1)
lola: LP says that atomic proposition is always true: (p18 <= 1)
lola: LP says that atomic proposition is always true: (p93 <= 1)
lola: LP says that atomic proposition is always true: (p0 <= 1)
lola: LP says that atomic proposition is always true: (p29 <= 1)
lola: LP says that atomic proposition is always true: (p89 <= 1)
lola: LP says that atomic proposition is always true: (p37 <= 1)
lola: LP says that atomic proposition is always true: (p89 <= 1)
lola: LP says that atomic proposition is always true: (p42 <= 1)
lola: LP says that atomic proposition is always true: (p53 <= 1)
lola: LP says that atomic proposition is always true: (p94 <= 1)
lola: LP says that atomic proposition is always true: (p6 <= 1)
lola: LP says that atomic proposition is always true: (p93 <= 1)
lola: LP says that atomic proposition is always true: (p0 <= 1)
lola: LP says that atomic proposition is always true: (p22 <= 1)
lola: LP says that atomic proposition is always true: (p89 <= 1)
lola: LP says that atomic proposition is always true: (p39 <= 1)
lola: LP says that atomic proposition is always true: (p89 <= 1)
lola: LP says that atomic proposition is always true: (p42 <= 1)
lola: LP says that atomic proposition is always true: (p42 <= 1)
lola: (NOT(A (F ((((p86 <= 0)))))) AND NOT(E (((((1 <= p65) AND (1 <= p94)) OR ((1 <= p70) AND (1 <= p94)) OR ((1 <= p82) AND (1 <= p94)) OR ((1 <= p80) AND (1 <= p94)) OR ((1 <= p75) AND (1 <= p94)) OR ((1 <= p77) AND (1 <= p94)) OR ((1 <= p73) AND (1 <= p94)) OR ((1 <= p63) AND (1 <= p94)) OR ((1 <= p69) AND (1 <= p94)) OR ((1 <= p67) AND (1 <= p94)) OR ((1 <= p76) AND (1 <= p94)) OR ((1 <= p64) AND (1 <= p94)) OR ((1 <= p71) AND (1 <= p94)) OR ((1 <= p81) AND (1 <= p94)) OR ((1 <= p74) AND (1 <= p94)) OR ((1 <= p78) AND (1 <= p94)) OR ((1 <= p62) AND (1 <= p94)) OR ((1 <= p79) AND (1 <= p94)) OR ((1 <= p72) AND (1 <= p94)) OR ((1 <= p66) AND (1 <= p94)) OR ((1 <= p68) AND (1 <= p94))) U ((1 <= p88) AND (1 <= p96)))))) : E (G ((((1 <= p83)) OR ((1 <= p0))))) : (A (X (E (G (((p84 <= 0) OR (p95 <= 0)))))) OR (((1 <= p87) AND (1 <= p96)) AND E (F ((((((1 <= p24) AND (1 <= p89)) OR ((1 <= p30) AND (1 <= p89)) OR ((1 <= p29) AND (1 <= p89)) OR ((1 <= p25) AND (1 <= p89)) OR ((1 <= p22) AND (1 <= p89)) OR ((1 <= p23) AND (1 <= p89)) OR ((1 <= p41) AND (1 <= p89)) OR ((1 <= p26) AND (1 <= p89)) OR ((1 <= p27) AND (1 <= p89)) OR ((1 <= p28) AND (1 <= p89)) OR ((1 <= p31) AND (1 <= p89))) AND (((1 <= p86)))) OR ((1 <= p42)) OR ((1 <= p84) AND (1 <= p95))))))) : E (G ((E ((((1 <= p85) AND (1 <= p95)) U (((1 <= p86))))) OR (((E (F (((1 <= p85) AND (1 <= p95)))) AND ((1 <= p87))) AND ((1 <= p96))) AND (((1 <= p35) AND (1 <= p89)) OR ((1 <= p36) AND (1 <= p89)) OR ((1 <= p39) AND (1 <= p89)) OR ((1 <= p40) AND (1 <= p89)) OR ((1 <= p38) AND (1 <= p89)) OR ((1 <= p37) AND (1 <= p89)) OR ((1 <= p34) AND (1 <= p89)) OR ((1 <= p33) AND (1 <= p89)) OR ((1 <= p32) AND (1 <= p89))))))) : A (X (A (G (E (F (((1 <= p21)))))))) : E (F (A (G (((1 <= p21) AND (((1 <= p86)) OR ((1 <= p88) AND (1 <= p96)))))))) : E ((((1 <= p42) AND (1 <= p21) AND ((p51 <= 0) OR (p94 <= 0))) U ((1 <= p13) AND (1 <= p93)))) : A (F ((A (G (((p18 <= 0) OR (p93 <= 0)))) AND ((1 <= p0))))) : A (G (((p29 <= 0) OR (p89 <= 0)))) : E (F (((1 <= p37) AND (1 <= p89)))) : (A ((E (F (((1 <= p42)))) U E (F (((1 <= p53) AND (1 <= p94)))))) OR E (G (E ((((1 <= p6) AND (1 <= p93)) U ((1 <= p0))))))) : A (G (((p22 <= 0) OR (p89 <= 0)))) : NOT(A (F ((((p39 <= 0) OR (p89 <= 0)) AND ((p42 <= 0))))))
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:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:452
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 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (X (E (G (((p84 <= 0) OR (p95 <= 0)))))) OR (((1 <= p87) AND (1 <= p96)) AND E (F ((((((1 <= p24) AND (1 <= p89)) OR ((1 <= p30) AND (1 <= p89)) OR ((1 <= p29) AND (1 <= p89)) OR ((1 <= p25) AND (1 <= p89)) OR ((1 <= p22) AND (1 <= p89)) OR ((1 <= p23) AND (1 <= p89)) OR ((1 <= p41) AND (1 <= p89)) OR ((1 <= p26) AND (1 <= p89)) OR ((1 <= p27) AND (1 <= p89)) OR ((1 <= p28) AND (1 <= ... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 0 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((1 <= p87) AND (1 <= p96))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((1 <= p87) AND (1 <= p96))
lola: processed formula length: 27
lola: 14 rewrites
lola: closed formula file CTLFireability.xml
lola: processed formula with 2 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 1 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (E (G (((p84 <= 0) OR (p95 <= 0))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:808
lola: rewrite Frontend/Parser/formula_rewrite.k:812
lola: processed formula: AX(EG(((p84 <= 0) OR (p95 <= 0))))
lola: processed formula length: 35
lola: 16 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 36709 markings, 70786 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 1 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (A (G (E (F (((1 <= p21))))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:806
lola: rewrite Frontend/Parser/formula_rewrite.k:813
lola: rewrite Frontend/Parser/formula_rewrite.k:812
lola: processed formula: AX(AG(EF(((1 <= p21)))))
lola: processed formula length: 24
lola: 17 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 30 markings, 54 edges
lola: ========================================
lola: subprocess 2 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((p29 <= 0) OR (p89 <= 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:787
lola: processed formula: A (G (((p29 <= 0) OR (p89 <= 0))))
lola: processed formula length: 35
lola: 16 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: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 <= p29) AND (1 <= p89))
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
lola: The predicate is not invariant.
lola: 10 markings, 9 edges
lola: ========================================
lola: subprocess 3 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((1 <= p37) AND (1 <= p89))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: processed formula: E (F (((1 <= p37) AND (1 <= p89))))
lola: processed formula length: 35
lola: 15 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((1 <= p37) AND (1 <= p89))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 10 markings, 9 edges
lola: ========================================
lola: subprocess 4 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((p22 <= 0) OR (p89 <= 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:787
lola: processed formula: A (G (((p22 <= 0) OR (p89 <= 0))))
lola: processed formula length: 35
lola: 16 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: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 <= p22) AND (1 <= p89))
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
lola: The predicate is not invariant.
lola: 10 markings, 9 edges
lola: ========================================
lola: subprocess 5 will run for 445 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G ((((1 <= p83)) OR ((1 <= p0)))))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation
lola: rewrite Frontend/Parser/formula_rewrite.k:583
lola: processed formula: E (G ((((1 <= p83)) OR ((1 <= p0)))))
lola: processed formula length: 38
lola: 15 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: (((p83 <= 0)) AND ((p0 <= 0)))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to CTLFireability-5-0.sara
lola: state equation: calling and running sara
sara: try reading problem file CTLFireability-5-0.sara.
sara: place or transition ordering is non-deterministic
lola: state equation 0: solution produced
lola: SUBRESULT
lola: result: no
lola: produced by: state space / EG
lola: The predicate is not possibly preserved.
lola: 38485 markings, 39244 edges
lola: ========================================
lola: subprocess 6 will run for 509 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G ((((1 <= p39) AND (1 <= p89)) OR ((1 <= p42)))))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation
lola: rewrite Frontend/Parser/formula_rewrite.k:583
lola: processed formula: E (G ((((1 <= p39) AND (1 <= p89)) OR ((1 <= p42)))))
lola: processed formula length: 54
lola: 15 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: (((p39 <= 0) OR (p89 <= 0)) AND ((p42 <= 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: write sara problem file to CTLFireability-6-0.sara
lola: state equation: calling and running sara
sara: try reading problem file CTLFireability-6-0.sara.
sara: place or transition ordering is non-deterministic
lola: state equation 0: solution produced
lola: SUBRESULT
lola: result: no
lola: produced by: state space / EG
lola: The predicate is not possibly preserved.
lola: 1693 markings, 1692 edges
lola: ========================================
lola: subprocess 7 will run for 594 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (A (G (((1 <= p21) AND (((1 <= p86)) OR ((1 <= p88) AND (1 <= p96))))))))
lola: ========================================
lola: SUBTASK
lola: checking possible invariance
lola: rewrite Frontend/Parser/formula_rewrite.k:604
lola: rewrite Frontend/Parser/formula_rewrite.k:614
lola: rewrite Frontend/Parser/formula_rewrite.k:726
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: ((p21 <= 0) OR (((p86 <= 0)) AND ((p88 <= 0) OR (p96 <= 0))))
lola: processed formula length: 63
lola: 18 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using tscc preserving stubborn set method (--stubborn)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:700
lola: state equation task get result rewrite finished id 0
lola: state equation task get result started, id 1
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: state equation task get result rewrite finished id 1
lola: state equation task get result unparse finished++ id 1
lola: formula 1: ((p21 <= 0) OR (((p86 <= 0)) AND ((p88 <= 0) OR (p96 <= 0))))
lola: state equation task get result unparse finished id 1
lola: state equation: Generated DNF with 5 literals and 3 conjunctive subformulas
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((1 <= p21) AND (((1 <= p86)) OR ((1 <= p88) AND (1 <= p96))))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 5 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to CTLFireability-7-0.sara
lola: state equation: write sara problem file to CTLFireability-7-1.sara
lola: state equation: calling and running sara
lola: state equation: calling and running sara
sara: try reading problem file CTLFireability-7-0.sara.
sara: try reading problem file CTLFireability-7-1.sara.
sara: place or transition ordering is non-deterministic
sara: place or transition ordering is non-deterministic
lola: state equation 0: solution produced
lola: state equation 1: solution produced
lola: SUBRESULT
lola: result: no
lola: produced by: parallel
lola: The predicate is not possibly invariant.
lola: 303139 markings, 1214674 edges
lola: ========================================
lola: subprocess 8 will run for 712 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F ((A (G (((p18 <= 0) OR (p93 <= 0)))) AND ((1 <= p0)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:813
lola: rewrite Frontend/Parser/formula_rewrite.k:811
lola: processed formula: AF((AG(((p18 <= 0) OR (p93 <= 0))) AND ((1 <= p0))))
lola: processed formula length: 53
lola: 16 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 14 markings, 34 edges
lola: ========================================
lola: subprocess 9 will run for 890 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G ((E ((((1 <= p85) AND (1 <= p95)) U (((1 <= p86))))) OR (E (F (((1 <= p85) AND (1 <= p95)))) AND (((1 <= p87)) AND (((1 <= p96)) AND (((1 <= p35) AND (1 <= p89)) OR ((1 <= p36) AND (1 <= p89)) OR ((1 <= p39) AND (1 <= p89)) OR ((1 <= p40) AND (1 <= p89)) OR ((1 <= p38) AND (1 <= p89)) OR ((1 <= p37) AND (1 <= p89)) OR ((1 <= p34) AND (1 <= p89)) OR ((1 <= p33) AND (1 <= p89)) OR ((1 <... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:809
lola: rewrite Frontend/Parser/formula_rewrite.k:806
lola: rewrite Frontend/Parser/formula_rewrite.k:808
lola: processed formula: EG((E(((1 <= p85) AND (1 <= p95)) U (((1 <= p86)))) OR (EF(((1 <= p85) AND (1 <= p95))) AND (((1 <= p87)) AND (((1 <= p96)) AND (((1 <= p35) AND (1 <= p89)) OR ((1 <= p36) AND (1 <= p89)) OR ((1 <= p39) AND (1 <= p89)) OR ((1 <= p40) AND (1 <= p89)) OR ((1 <= p38) AND (1 <= p89)) OR ((1 <= p37) AND (1 <= p89)) OR ((1 <= p34) AND (1 <= p89)) OR ((1 <= p33) AND (1 <= p89)) OR ((1 <= p32) AND... (shortened)
lola: processed formula length: 418
lola: 17 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: 289296 markings, 1257795 edges
lola: ========================================
lola: subprocess 10 will run for 1187 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E ((((1 <= p42) AND (1 <= p21) AND ((p51 <= 0) OR (p94 <= 0))) U ((1 <= p13) AND (1 <= p93))))
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 ((((1 <= p42) AND (1 <= p21) AND ((p51 <= 0) OR (p94 <= 0))) U ((1 <= p13) AND (1 <= p93))))
lola: processed formula length: 95
lola: 17 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: ((1 <= p13) AND (1 <= p93))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to CTLFireability-10-0.sara
lola: state equation: calling and running sara
sara: try reading problem file CTLFireability-10-0.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space /EU
lola: There is no path where Predicate Phi holds until Predicate Psi.
lola: 357 markings, 844 edges
lola: ========================================
lola: subprocess 11 will run for 1781 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E (F (((1 <= p53) AND (1 <= p94)))) OR E (G (E ((((1 <= p6) AND (1 <= p93)) U ((1 <= p0)))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 11 will run for 1780 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((1 <= p53) AND (1 <= p94))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: processed formula: E (F (((1 <= p53) AND (1 <= p94))))
lola: processed formula length: 35
lola: 15 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((1 <= p53) AND (1 <= p94))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 6 markings, 5 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 12 will run for 3561 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E (G ((((1 <= p86))))) AND A (((((p65 <= 0) OR (p94 <= 0)) AND ((p70 <= 0) OR (p94 <= 0)) AND ((p82 <= 0) OR (p94 <= 0)) AND ((p80 <= 0) OR (p94 <= 0)) AND ((p75 <= 0) OR (p94 <= 0)) AND ((p77 <= 0) OR (p94 <= 0)) AND ((p73 <= 0) OR (p94 <= 0)) AND ((p63 <= 0) OR (p94 <= 0)) AND ((p69 <= 0) OR (p94 <= 0)) AND ((p67 <= 0) OR (p94 <= 0)) AND ((p76 <= 0) OR (p94 <= 0)) AND ((p64 <= 0) OR ... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 12 will run for 3561 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G ((((1 <= p86)))))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation
lola: rewrite Frontend/Parser/formula_rewrite.k:583
lola: processed formula: E (G ((((1 <= p86)))))
lola: processed formula length: 22
lola: 15 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: (((p86 <= 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-12-0.sara
lola: state equation: calling and running sara
sara: try reading problem file CTLFireability-12-0.sara.
sara: place or transition ordering is non-deterministic
lola: state equation 0: solution produced
lola: SUBRESULT
lola: result: no
lola: produced by: state space / EG
lola: The predicate is not possibly preserved.
lola: 32843 markings, 32842 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: RESULT
lola:
SUMMARY: no no yes no no no no no no yes yes no no
lola:
preliminary result: no no yes no no no no no no yes yes no no
lola: memory consumption: 80268 KB
lola: time consumption: 9 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="AirplaneLD-PT-0020"
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 AirplaneLD-PT-0020, 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 r166-smll-158987787400252"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/AirplaneLD-PT-0020.tgz
mv AirplaneLD-PT-0020 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 ;