About the Execution of ITS-LoLa for DiscoveryGPU-PT-08b
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 15741.120 | 3600000.00 | 19936.00 | 113.10 | TTTFTTTTTFFFTTTT | 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-158987882600628.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 DiscoveryGPU-PT-08b, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r178-tajo-158987882600628
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 244K
-rw-r--r-- 1 mcc users 3.5K Mar 31 06:49 CTLCardinality.txt
-rw-r--r-- 1 mcc users 19K Mar 31 06:49 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Mar 29 23:19 CTLFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 29 23:19 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 24 05:37 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K Mar 24 05:37 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K Apr 8 14:49 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Apr 28 14:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Apr 8 14:49 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 28 14:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Mar 28 14:35 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 18K Mar 28 14:35 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.7K Mar 27 07:35 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 16K Mar 27 07:35 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 28 14:50 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Mar 28 14:50 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 24 05:37 instance
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 iscolored
-rw-r--r-- 1 mcc users 61K 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 DiscoveryGPU-PT-08b-CTLFireability-00
FORMULA_NAME DiscoveryGPU-PT-08b-CTLFireability-01
FORMULA_NAME DiscoveryGPU-PT-08b-CTLFireability-02
FORMULA_NAME DiscoveryGPU-PT-08b-CTLFireability-03
FORMULA_NAME DiscoveryGPU-PT-08b-CTLFireability-04
FORMULA_NAME DiscoveryGPU-PT-08b-CTLFireability-05
FORMULA_NAME DiscoveryGPU-PT-08b-CTLFireability-06
FORMULA_NAME DiscoveryGPU-PT-08b-CTLFireability-07
FORMULA_NAME DiscoveryGPU-PT-08b-CTLFireability-08
FORMULA_NAME DiscoveryGPU-PT-08b-CTLFireability-09
FORMULA_NAME DiscoveryGPU-PT-08b-CTLFireability-10
FORMULA_NAME DiscoveryGPU-PT-08b-CTLFireability-11
FORMULA_NAME DiscoveryGPU-PT-08b-CTLFireability-12
FORMULA_NAME DiscoveryGPU-PT-08b-CTLFireability-13
FORMULA_NAME DiscoveryGPU-PT-08b-CTLFireability-14
FORMULA_NAME DiscoveryGPU-PT-08b-CTLFireability-15
=== Now, execution of the tool begins
BK_START 1591232098787
bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-04 00:55:01] [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-04 00:55:01] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-04 00:55:01] [INFO ] Load time of PNML (sax parser for PT used): 88 ms
[2020-06-04 00:55:01] [INFO ] Transformed 240 places.
[2020-06-04 00:55:01] [INFO ] Transformed 254 transitions.
[2020-06-04 00:55:01] [INFO ] Found NUPN structural information;
[2020-06-04 00:55:01] [INFO ] Parsed PT model containing 240 places and 254 transitions in 158 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 28 ms.
Incomplete random walk after 100000 steps, including 389 resets, run finished after 286 ms. (steps per millisecond=349 ) properties seen :[0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1]
// Phase 1: matrix 254 rows 240 cols
[2020-06-04 00:55:02] [INFO ] Computed 10 place invariants in 13 ms
[2020-06-04 00:55:02] [INFO ] [Real]Absence check using 10 positive place invariants in 25 ms returned unsat
[2020-06-04 00:55:02] [INFO ] [Real]Absence check using 10 positive place invariants in 80 ms returned sat
[2020-06-04 00:55:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 00:55:02] [INFO ] [Real]Absence check using state equation in 228 ms returned sat
[2020-06-04 00:55:02] [INFO ] Computed and/alt/rep : 253/608/253 causal constraints in 40 ms.
[2020-06-04 00:55:02] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 00:55:03] [INFO ] [Nat]Absence check using 10 positive place invariants in 107 ms returned sat
[2020-06-04 00:55:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 00:55:03] [INFO ] [Nat]Absence check using state equation in 124 ms returned sat
[2020-06-04 00:55:03] [INFO ] Computed and/alt/rep : 253/608/253 causal constraints in 18 ms.
[2020-06-04 00:55:04] [INFO ] Added : 176 causal constraints over 36 iterations in 754 ms. Result :sat
[2020-06-04 00:55:04] [INFO ] [Real]Absence check using 10 positive place invariants in 22 ms returned unsat
Successfully simplified 2 atomic propositions for a total of 2 simplifications.
[2020-06-04 00:55:04] [INFO ] Flatten gal took : 91 ms
[2020-06-04 00:55:04] [INFO ] Flatten gal took : 17 ms
[2020-06-04 00:55:04] [INFO ] Export to MCC properties in file /home/mcc/execution/CTLFireability.sr.xml took 4 ms.
[2020-06-04 00:55:04] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 8 ms.
info: Time: 3600 - MCC
vrfy: Checking CTLFireability @ DiscoveryGPU-PT-08b @ 3570 seconds
FORMULA DiscoveryGPU-PT-08b-CTLFireability-00 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA DiscoveryGPU-PT-08b-CTLFireability-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA DiscoveryGPU-PT-08b-CTLFireability-04 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA DiscoveryGPU-PT-08b-CTLFireability-07 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA DiscoveryGPU-PT-08b-CTLFireability-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA DiscoveryGPU-PT-08b-CTLFireability-02 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA DiscoveryGPU-PT-08b-CTLFireability-01 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA DiscoveryGPU-PT-08b-CTLFireability-08 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA DiscoveryGPU-PT-08b-CTLFireability-03 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA DiscoveryGPU-PT-08b-CTLFireability-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA DiscoveryGPU-PT-08b-CTLFireability-09 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA DiscoveryGPU-PT-08b-CTLFireability-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA DiscoveryGPU-PT-08b-CTLFireability-06 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA DiscoveryGPU-PT-08b-CTLFireability-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA DiscoveryGPU-PT-08b-CTLFireability-05 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA DiscoveryGPU-PT-08b-CTLFireability-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 3565
rslt: Output for CTLFireability @ DiscoveryGPU-PT-08b
{
"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",
"--safe",
"--check=modelchecking",
"--stubborn=tarjan",
"--stateequation=par",
"--quickchecks",
"--timelimit=3570",
"--localtimelimit=0",
"--preference=force_ctl",
"--json=CTLFireability.json",
"--jsoninclude=formula,formulastat,net"
],
"starttime": "Thu Jun 4 00:55:04 2020
",
"timelimit": 3570
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 222
},
"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": "TRUE",
"processed_size": 4,
"rewrites": 31
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 0,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 237
},
"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": "TRUE",
"processed_size": 4,
"rewrites": 31
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 1,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 254
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 2,
"E": 1,
"F": 1,
"G": 0,
"U": 1,
"X": 1,
"aconj": 6,
"adisj": 3,
"aneg": 0,
"comp": 12,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 12,
"taut": 0,
"tconj": 1,
"tdisj": 2,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 10,
"visible_transitions": 0
},
"processed": "(A((((1 <= p124) AND (1 <= p238)) OR ((1 <= p204)) OR (p205 <= 0) OR (p238 <= 0)) U AX(((1 <= p58)))) OR (((p194 <= 0) OR (p231 <= 0)) AND (EF((((1 <= p33)) OR ((1 <= p32) AND (1 <= p231)))) OR ((1 <= p114)))))",
"processed_size": 215,
"rewrites": 34
},
"net":
{
"conflict_clusters": 168,
"singleton_clusters": 0
},
"result":
{
"edges": 227,
"markings": 168,
"produced_by": "CTL model checker",
"value": true
},
"task":
{
"compoundnumber": 2,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 274
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 2,
"E": 2,
"F": 2,
"G": 0,
"U": 1,
"X": 1,
"aconj": 2,
"adisj": 1,
"aneg": 0,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "A(AX(((p9 <= 0))) U (EF(((1 <= p191) AND (1 <= p238))) AND EF(((1 <= p74)))))",
"processed_size": 77,
"rewrites": 35
},
"net":
{
"conflict_clusters": 168,
"singleton_clusters": 0
},
"result":
{
"edges": 305,
"markings": 205,
"produced_by": "CTL model checker",
"value": true
},
"task":
{
"compoundnumber": 3,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 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": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "EX(AG(((p40 <= 0))))",
"processed_size": 20,
"rewrites": 33
},
"net":
{
"conflict_clusters": 168,
"singleton_clusters": 0
},
"result":
{
"edges": 1245,
"markings": 864,
"produced_by": "CTL model checker",
"value": false
},
"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": 324
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 324
},
"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": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "((1 <= p3) AND (1 <= p217) AND (1 <= p231))",
"processed_size": 43,
"rewrites": 31
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 5,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 356
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 0,
"U": 1,
"X": 0,
"aconj": 2,
"adisj": 2,
"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": "A (((((p101 <= 0)) AND ((p58 <= 0))) U ((1 <= p233))))",
"processed_size": 54,
"rewrites": 36
},
"result":
{
"edges": 19,
"markings": 20,
"produced_by": "state space /ER",
"value": true
},
"task":
{
"compoundnumber": 6,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl",
"visible": 5
},
"threads": 1,
"type": "dfs"
},
"type": "universal_until",
"workflow": "stateequation"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": true
},
"task":
{
"compoundnumber": 5,
"type": "boolean"
}
},
{
"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 <= p83) AND (1 <= p238))))",
"processed_size": 36,
"rewrites": 32
},
"result":
{
"edges": 21,
"markings": 22,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 6,
"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": 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 <= p158) AND (1 <= p231))))",
"processed_size": 37,
"rewrites": 32
},
"result":
{
"edges": 25,
"markings": 26,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 7,
"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": 445
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 1,
"F": 1,
"G": 0,
"U": 1,
"X": 0,
"aconj": 2,
"adisj": 0,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "E(AF(((1 <= p130))) U ((1 <= p137) AND (1 <= p238)))",
"processed_size": 52,
"rewrites": 33
},
"net":
{
"conflict_clusters": 168,
"singleton_clusters": 0
},
"result":
{
"edges": 29,
"markings": 28,
"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": 509
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 2,
"F": 0,
"G": 2,
"U": 1,
"X": 0,
"aconj": 2,
"adisj": 2,
"aneg": 0,
"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": "A(EG((((1 <= p2)) OR ((1 <= p218) AND (1 <= p238)))) U EG(((p90 <= 0))))",
"processed_size": 73,
"rewrites": 34
},
"net":
{
"conflict_clusters": 168,
"singleton_clusters": 0
},
"result":
{
"edges": 29,
"markings": 28,
"produced_by": "CTL model checker",
"value": true
},
"task":
{
"compoundnumber": 9,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 594
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 3,
"E": 0,
"F": 2,
"G": 0,
"U": 1,
"X": 0,
"aconj": 7,
"adisj": 1,
"aneg": 0,
"comp": 8,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 8,
"taut": 0,
"tconj": 4,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 8,
"visible_transitions": 0
},
"processed": "A(AF(((1 <= p54))) U (AF(((1 <= p61) AND (1 <= p231))) AND (((1 <= p27)) AND (((1 <= p207)) AND (((1 <= p238)) AND (((1 <= p204)) OR ((1 <= p71))))))))",
"processed_size": 152,
"rewrites": 34
},
"net":
{
"conflict_clusters": 168,
"singleton_clusters": 0
},
"result":
{
"edges": 3084,
"markings": 908,
"produced_by": "CTL model checker",
"value": false
},
"task":
{
"compoundnumber": 10,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 713
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 2,
"E": 1,
"F": 1,
"G": 2,
"U": 0,
"X": 0,
"aconj": 4,
"adisj": 2,
"aneg": 0,
"comp": 8,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 8,
"taut": 0,
"tconj": 0,
"tdisj": 2,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 8,
"visible_transitions": 0
},
"processed": "EG((AG(((1 <= p193))) OR (AF(((p189 <= 0))) OR ((1 <= p221) AND (1 <= p231) AND (1 <= p97) AND (1 <= p238) AND (((1 <= p191)) OR ((1 <= p34)))))))",
"processed_size": 147,
"rewrites": 34
},
"net":
{
"conflict_clusters": 168,
"singleton_clusters": 0
},
"result":
{
"edges": 85,
"markings": 28,
"produced_by": "CTL model checker",
"value": true
},
"task":
{
"compoundnumber": 11,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 891
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 891
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 1,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "((p150 <= 0))",
"processed_size": 13,
"rewrites": 31
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 12,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1188
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 2,
"adisj": 1,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "E (F ((((1 <= p137) AND (1 <= p238)) OR ((1 <= p69)))))",
"processed_size": 56,
"rewrites": 32
},
"result":
{
"edges": 19,
"markings": 20,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 13,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 3,
"problems": 2
},
"type": "reachability",
"workflow": "stateequation||search"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": true
},
"task":
{
"compoundnumber": 12,
"type": "boolean"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1188
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 0,
"U": 1,
"X": 0,
"aconj": 2,
"adisj": 0,
"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": "(F (((1 <= p152) AND (1 <= p71))) U ((1 <= p7)))",
"processed_size": 48,
"rewrites": 33
},
"result":
{
"edges": 34,
"markings": 34,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 13,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "universal single path",
"workflow": "product automaton"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1782
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1782
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"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 (F (((1 <= p235))))",
"processed_size": 21,
"rewrites": 32
},
"result":
{
"edges": 36,
"markings": 37,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 14,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"type": "reachability",
"workflow": "stateequation||search"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3565
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 1,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "((p134 <= 0))",
"processed_size": 13,
"rewrites": 31
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 15,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": true
},
"task":
{
"compoundnumber": 14,
"type": "boolean"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3565
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3565
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 3,
"adisj": 1,
"aneg": 2,
"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": "A (((((p155 <= 0)) AND ((p71 <= 0))) R ((p103 <= 0))))",
"processed_size": 54,
"rewrites": 36
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "state space /EU",
"value": true
},
"task":
{
"compoundnumber": 15,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "eu preserving",
"visible": 4
},
"threads": 1,
"type": "dfs"
},
"type": "universal_release",
"workflow": "stateequation"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": null
},
"task":
{
"compoundnumber": 15,
"type": "boolean"
}
},
{
"child":
[
{
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 3,
"adisj": 1,
"aneg": 2,
"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": "A (((((p155 <= 0)) AND ((p71 <= 0))) R ((p103 <= 0))))",
"processed_size": 54,
"rewrites": 36
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "state space /EU",
"value": true
},
"task":
{
"compoundnumber": 16,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "eu preserving",
"visible": 4
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "universal_release",
"workflow": "stateequation"
}
},
{
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 2,
"adisj": 1,
"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 (F ((((p98 <= 0)) AND ((p24 <= 0)) AND (1 <= p177))))",
"processed_size": 55,
"rewrites": 32
},
"result":
{
"edges": 36,
"markings": 37,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 17,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"type": "reachability",
"workflow": "stateequation||search"
}
}
],
"result":
{
"produced_by": "boolean",
"value": true
},
"task":
{
"compoundnumber": 16,
"type": "boolean"
}
}
],
"exit":
{
"error": null,
"memory": 45992,
"runtime": 5.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "CTLFireability.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "TRUE : E(F(**)) : (A((** U **)) OR (A(X(**)) OR (** AND A(G(**))))) : E((A(F(**)) U **)) : (A((** U A(X(**)))) OR (** AND (E(F(**)) OR **))) : (** AND (E(G(**)) OR E(F(*)))) : (** AND E(F(**))) : A((A(X(**)) U (E(F(**)) AND E(F(**))))) : E(F(**)) : A((A(F(**)) U (A(F(**)) AND (** AND (** AND (** AND **)))))) : E(X(A(G(**)))) : A((A(F(**)) U **)) : (E(F(*)) AND A((* R *))) : E(G((A(G(**)) OR (A(F(**)) OR **)))) : A((E(G(**)) U E(G(**)))) : TRUE"
},
"net":
{
"arcs": 661,
"conflict_clusters": 168,
"places": 240,
"places_significant": 230,
"singleton_clusters": 0,
"transitions": 254
},
"result":
{
"preliminary_value": "yes yes yes no yes yes yes yes yes no no no yes yes yes yes ",
"value": "yes yes yes no yes yes yes yes yes no no no yes yes yes yes "
},
"task":
{
"type": "compound"
}
}
lola: LoLA will run for 3570 seconds at most (--timelimit)
lola: NET
lola: input: PNML file (--pnml)
lola: reading net from model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file model.pnml
lola: 494/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 240
lola: finding significant places
lola: 240 places, 254 transitions, 230 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: (p27 <= 1)
lola: LP says that atomic proposition is always true: (p59 <= 1)
lola: LP says that atomic proposition is always true: (p231 <= 1)
lola: LP says that atomic proposition is always true: (p186 <= 1)
lola: LP says that atomic proposition is always true: (p69 <= 1)
lola: LP says that atomic proposition is always true: (p31 <= 1)
lola: LP says that atomic proposition is always true: (p83 <= 1)
lola: LP says that atomic proposition is always true: (p238 <= 1)
lola: LP says that atomic proposition is always true: (p101 <= 1)
lola: LP says that atomic proposition is always true: (p58 <= 1)
lola: LP says that atomic proposition is always true: (p233 <= 1)
lola: LP says that atomic proposition is always true: (p4 <= 1)
lola: LP says that atomic proposition is always true: (p3 <= 1)
lola: LP says that atomic proposition is always true: (p217 <= 1)
lola: LP says that atomic proposition is always true: (p231 <= 1)
lola: LP says that atomic proposition is always true: (p85 <= 1)
lola: LP says that atomic proposition is always true: (p130 <= 1)
lola: LP says that atomic proposition is always true: (p137 <= 1)
lola: LP says that atomic proposition is always true: (p238 <= 1)
lola: LP says that atomic proposition is always true: (p124 <= 1)
lola: LP says that atomic proposition is always true: (p238 <= 1)
lola: LP says that atomic proposition is always true: (p204 <= 1)
lola: LP says that atomic proposition is always true: (p205 <= 1)
lola: LP says that atomic proposition is always true: (p238 <= 1)
lola: LP says that atomic proposition is always true: (p58 <= 1)
lola: LP says that atomic proposition is always true: (p194 <= 1)
lola: LP says that atomic proposition is always true: (p231 <= 1)
lola: LP says that atomic proposition is always true: (p33 <= 1)
lola: LP says that atomic proposition is always true: (p32 <= 1)
lola: LP says that atomic proposition is always true: (p231 <= 1)
lola: LP says that atomic proposition is always true: (p114 <= 1)
lola: LP says that atomic proposition is always true: (p134 <= 1)
lola: LP says that atomic proposition is always true: (p230 <= 1)
lola: LP says that atomic proposition is always true: (p235 <= 1)
lola: LP says that atomic proposition is always true: (p150 <= 1)
lola: LP says that atomic proposition is always true: (p137 <= 1)
lola: LP says that atomic proposition is always true: (p238 <= 1)
lola: LP says that atomic proposition is always true: (p69 <= 1)
lola: LP says that atomic proposition is always true: (p9 <= 1)
lola: LP says that atomic proposition is always true: (p191 <= 1)
lola: LP says that atomic proposition is always true: (p238 <= 1)
lola: LP says that atomic proposition is always true: (p74 <= 1)
lola: LP says that atomic proposition is always true: (p158 <= 1)
lola: LP says that atomic proposition is always true: (p231 <= 1)
lola: LP says that atomic proposition is always true: (p54 <= 1)
lola: LP says that atomic proposition is always true: (p61 <= 1)
lola: LP says that atomic proposition is always true: (p231 <= 1)
lola: LP says that atomic proposition is always true: (p27 <= 1)
lola: LP says that atomic proposition is always true: (p207 <= 1)
lola: LP says that atomic proposition is always true: (p238 <= 1)
lola: LP says that atomic proposition is always true: (p204 <= 1)
lola: LP says that atomic proposition is always true: (p71 <= 1)
lola: LP says that atomic proposition is always true: (p40 <= 1)
lola: LP says that atomic proposition is always true: (p152 <= 1)
lola: LP says that atomic proposition is always true: (p71 <= 1)
lola: LP says that atomic proposition is always true: (p7 <= 1)
lola: LP says that atomic proposition is always true: (p98 <= 1)
lola: LP says that atomic proposition is always true: (p24 <= 1)
lola: LP says that atomic proposition is always true: (p177 <= 1)
lola: LP says that atomic proposition is always true: (p155 <= 1)
lola: LP says that atomic proposition is always true: (p71 <= 1)
lola: LP says that atomic proposition is always true: (p103 <= 1)
lola: LP says that atomic proposition is always true: (p193 <= 1)
lola: LP says that atomic proposition is always true: (p189 <= 1)
lola: LP says that atomic proposition is always true: (p221 <= 1)
lola: LP says that atomic proposition is always true: (p231 <= 1)
lola: LP says that atomic proposition is always true: (p97 <= 1)
lola: LP says that atomic proposition is always true: (p238 <= 1)
lola: LP says that atomic proposition is always true: (p191 <= 1)
lola: LP says that atomic proposition is always true: (p34 <= 1)
lola: LP says that atomic proposition is always true: (p2 <= 1)
lola: LP says that atomic proposition is always true: (p218 <= 1)
lola: LP says that atomic proposition is always true: (p238 <= 1)
lola: LP says that atomic proposition is always true: (p90 <= 1)
lola: LP says that atomic proposition is always true: (p207 <= 1)
lola: LP says that atomic proposition is always true: (p238 <= 1)
lola: LP says that atomic proposition is always true: (p224 <= 1)
lola: LP says that atomic proposition is always true: (p152 <= 1)
lola: ((E (G ((0 <= 0))) OR A (F (((1 <= p27) AND (1 <= p59) AND (1 <= p231) AND (1 <= p186))))) OR ((1 <= p69) AND (1 <= p31))) : E (F (((1 <= p83) AND (1 <= p238)))) : ((A (((((p101 <= 0)) AND ((p58 <= 0))) U ((1 <= p233)))) OR A (X (((1 <= p4))))) OR (((1 <= p3) AND (1 <= p217) AND (1 <= p231)) AND A (G (((1 <= p85)))))) : E ((A (F (((1 <= p130)))) U ((1 <= p137) AND (1 <= p238)))) : (A (((((1 <= p124) AND (1 <= p238)) OR ((1 <= p204)) OR (p205 <= 0) OR (p238 <= 0)) U A (X (((1 <= p58)))))) OR (((p194 <= 0) OR (p231 <= 0)) AND (E (F ((((1 <= p33)) OR ((1 <= p32) AND (1 <= p231))))) OR ((1 <= p114))))) : (((p134 <= 0)) AND (E (G (((1 <= p230)))) OR NOT(A (G (((p235 <= 0))))))) : (((p150 <= 0)) AND E (F ((((1 <= p137) AND (1 <= p238)) OR ((1 <= p69)))))) : A ((A (X (((p9 <= 0)))) U (E (F (((1 <= p191) AND (1 <= p238)))) AND E (F (((1 <= p74))))))) : A (F (E (F (((1 <= p158) AND (1 <= p231)))))) : A ((A (F (((1 <= p54)))) U ((((A (F (((1 <= p61) AND (1 <= p231)))) AND ((1 <= p27))) AND ((1 <= p207))) AND ((1 <= p238))) AND (((1 <= p204)) OR ((1 <= p71)))))) : E (X (A (G (((p40 <= 0)))))) : A ((A (F (((1 <= p152) AND (1 <= p71)))) U ((1 <= p7)))) : (NOT(A (G ((((1 <= p98)) OR ((1 <= p24)) OR (p177 <= 0))))) AND NOT(E (((((1 <= p155)) OR ((1 <= p71))) U ((1 <= p103)))))) : E (G (((A (G (((1 <= p193)))) OR A (F (((p189 <= 0))))) OR ((1 <= p221) AND (1 <= p231) AND (1 <= p97) AND (1 <= p238) AND (((1 <= p191)) OR ((1 <= p34))))))) : A ((E (G ((((1 <= p2)) OR ((1 <= p218) AND (1 <= p238))))) U E (G (((p90 <= 0)))))) : (E (G ((0 <= 0))) OR (A (X (E (G (((1 <= p207) AND (1 <= p238)))))) AND NOT(A (G ((((1 <= p224)) OR ((1 <= p152))))))))
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:124
lola: rewrite Frontend/Parser/formula_rewrite.k:124
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:449
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:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:338
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:160
lola: rewrite Frontend/Parser/formula_rewrite.k:148
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:124
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 222 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: TRUE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: TRUE
lola: processed formula length: 4
lola: 31 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 237 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: TRUE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: TRUE
lola: processed formula length: 4
lola: 31 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 2 will run for 254 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (((((1 <= p124) AND (1 <= p238)) OR ((1 <= p204)) OR (p205 <= 0) OR (p238 <= 0)) U A (X (((1 <= p58)))))) OR (((p194 <= 0) OR (p231 <= 0)) AND (E (F ((((1 <= p33)) OR ((1 <= p32) AND (1 <= p231))))) OR ((1 <= p114)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:812
lola: rewrite Frontend/Parser/formula_rewrite.k:814
lola: rewrite Frontend/Parser/formula_rewrite.k:806
lola: processed formula: (A((((1 <= p124) AND (1 <= p238)) OR ((1 <= p204)) OR (p205 <= 0) OR (p238 <= 0)) U AX(((1 <= p58)))) OR (((p194 <= 0) OR (p231 <= 0)) AND (EF((((1 <= p33)) OR ((1 <= p32) AND (1 <= p231)))) OR ((1 <= p114)))))
lola: processed formula length: 215
lola: 34 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 168 markings, 227 edges
lola: ========================================
lola: subprocess 3 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A ((A (X (((p9 <= 0)))) U (E (F (((1 <= p191) AND (1 <= p238)))) AND E (F (((1 <= p74)))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:812
lola: rewrite Frontend/Parser/formula_rewrite.k:806
lola: rewrite Frontend/Parser/formula_rewrite.k:806
lola: rewrite Frontend/Parser/formula_rewrite.k:814
lola: processed formula: A(AX(((p9 <= 0))) U (EF(((1 <= p191) AND (1 <= p238))) AND EF(((1 <= p74)))))
lola: processed formula length: 77
lola: 35 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 3 significant temporal operators and needs 13 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: 205 markings, 305 edges
lola: ========================================
lola: subprocess 4 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (X (A (G (((p40 <= 0))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:813
lola: rewrite Frontend/Parser/formula_rewrite.k:807
lola: processed formula: EX(AG(((p40 <= 0))))
lola: processed formula length: 20
lola: 33 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 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: 864 markings, 1245 edges
lola: ========================================
lola: subprocess 5 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (((((p101 <= 0)) AND ((p58 <= 0))) U ((1 <= p233)))) OR (A (X (((1 <= p4)))) OR (((1 <= p3) AND (1 <= p217) AND (1 <= p231)) AND A (G (((1 <= p85)))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 5 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((1 <= p3) AND (1 <= p217) AND (1 <= p231))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((1 <= p3) AND (1 <= p217) AND (1 <= p231))
lola: processed formula length: 43
lola: 31 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: subprocess 6 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (((((p101 <= 0)) AND ((p58 <= 0))) U ((1 <= p233))))
lola: ========================================
lola: SUBTASK
lola: checking universal until
lola: rewrite Frontend/Parser/formula_rewrite.k:577
lola: rewrite Frontend/Parser/formula_rewrite.k:735
lola: rewrite Frontend/Parser/formula_rewrite.k:695
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: A (((((p101 <= 0)) AND ((p58 <= 0))) U ((1 <= p233))))
lola: processed formula length: 54
lola: 36 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /ER)
lola: state space: using reachability graph (ER version) (--search=depth)
lola: state space: using ltl preserving stubborn set method (--stubborn=tarjan)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: 0
lola: SUBRESULT
lola: result: yes
lola: produced by: state space /ER
lola: Predicate Phi holds until Predicate Psi on all paths.
lola: 20 markings, 19 edges
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: (((p101 <= 0)) AND ((p58 <= 0)))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: ========================================
lola: subprocess 6 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((1 <= p83) AND (1 <= p238))))
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 <= p83) AND (1 <= p238))))
lola: processed formula length: 36
lola: 32 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 <= p83) AND (1 <= p238))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 22 markings, 21 edges
lola: state equation: write sara problem file to CTLFireability-6-0.sara
lola: state equation: calling and running sara
lola: ========================================
lola: subprocess 7 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((1 <= p158) AND (1 <= p231))))
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 <= p158) AND (1 <= p231))))
lola: processed formula length: 37
lola: 32 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: sara: try reading problem file CTLFireability-6-0.sara.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 <= p158) AND (1 <= p231))
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-7-0.sara
lola: state equation: calling and running sara
sara: try reading problem file CTLFireability-7-0.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 26 markings, 25 edges
lola: ========================================
lola: subprocess 8 will run for 445 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E ((A (F (((1 <= p130)))) U ((1 <= p137) AND (1 <= p238))))
lola: ========================================
lola: SUBTASK
sara: place or transition ordering is non-deterministic
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:811
lola: rewrite Frontend/Parser/formula_rewrite.k:809
lola: processed formula: E(AF(((1 <= p130))) U ((1 <= p137) AND (1 <= p238)))
lola: processed formula length: 52
lola: 33 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 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: 28 markings, 29 edges
lola: subprocess 9 will run for 509 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A ((E (G ((((1 <= p2)) OR ((1 <= p218) AND (1 <= p238))))) U E (G (((p90 <= 0))))))
lola: ========================================
lola: SUBTASK
lola: lola: ========================================
checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:808
lola: rewrite Frontend/Parser/formula_rewrite.k:808
lola: rewrite Frontend/Parser/formula_rewrite.k:814
lola: processed formula: A(EG((((1 <= p2)) OR ((1 <= p218) AND (1 <= p238)))) U EG(((p90 <= 0))))
lola: processed formula length: 73
lola: 34 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: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 28 markings, 29 edges
lola: ========================================
lola: subprocess 10 will run for 594 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A ((A (F (((1 <= p54)))) U (A (F (((1 <= p61) AND (1 <= p231)))) AND (((1 <= p27)) AND (((1 <= p207)) AND (((1 <= p238)) AND (((1 <= p204)) OR ((1 <= p71)))))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:811
lola: rewrite Frontend/Parser/formula_rewrite.k:811
lola: rewrite Frontend/Parser/formula_rewrite.k:814
lola: processed formula: A(AF(((1 <= p54))) U (AF(((1 <= p61) AND (1 <= p231))) AND (((1 <= p27)) AND (((1 <= p207)) AND (((1 <= p238)) AND (((1 <= p204)) OR ((1 <= p71))))))))
lola: processed formula length: 152
lola: 34 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: 908 markings, 3084 edges
lola: ========================================
lola: subprocess 11 will run for 713 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G ((A (G (((1 <= p193)))) OR (A (F (((p189 <= 0)))) OR ((1 <= p221) AND (1 <= p231) AND (1 <= p97) AND (1 <= p238) AND (((1 <= p191)) OR ((1 <= p34))))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:813
lola: rewrite Frontend/Parser/formula_rewrite.k:811
lola: rewrite Frontend/Parser/formula_rewrite.k:808
lola: processed formula: EG((AG(((1 <= p193))) OR (AF(((p189 <= 0))) OR ((1 <= p221) AND (1 <= p231) AND (1 <= p97) AND (1 <= p238) AND (((1 <= p191)) OR ((1 <= p34)))))))
lola: processed formula length: 147
lola: 34 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: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 28 markings, 85 edges
lola: ========================================
lola: subprocess 12 will run for 891 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (((p150 <= 0)) AND E (F ((((1 <= p137) AND (1 <= p238)) OR ((1 <= p69))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 12 will run for 891 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((p150 <= 0))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((p150 <= 0))
lola: processed formula length: 13
lola: 31 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 13 will run for 1188 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((((1 <= p137) AND (1 <= p238)) OR ((1 <= p69)))))
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 <= p137) AND (1 <= p238)) OR ((1 <= p69)))))
lola: processed formula length: 56
lola: 32 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 <= p137) AND (1 <= p238)) OR ((1 <= p69)))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 3 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to CTLFireability-13-0.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 20 markings, 19 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 13 will run for 1188 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A ((A (F (((1 <= p152) AND (1 <= p71)))) U ((1 <= p7))))
lola: ========================================
lola: SUBTASK
lola: checking a universal CTL formula with single counterexample path (use LTL...)
lola: rewrite Frontend/Parser/formula_rewrite.k:679
lola: rewrite Frontend/Parser/formula_rewrite.k:679
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: (F (((1 <= p152) AND (1 <= p71))) U ((1 <= p7)))
lola: processed formula length: 48
lola: 33 rewrites
lola: closed formula file CTLFireability.xml
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The universal single path CTL formula does not hold.
lola: 34 markings, 34 edges
lola: ========================================
lola: subprocess 14 will run for 1782 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (((p134 <= 0)) AND (E (G (((1 <= p230)))) OR E (F (((1 <= p235))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 14 will run for 1782 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((1 <= p235))))
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 <= p235))))
lola: processed formula length: 21
lola: 32 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 37 markings, 36 edges
lola: ========================================
lola: subprocess 15 will run for 3565 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((p134 <= 0))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((p134 <= 0))
lola: processed formula length: 13
lola: 31 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: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 15 will run for 3565 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E (F ((((p98 <= 0)) AND ((p24 <= 0)) AND (1 <= p177)))) AND A (((((p155 <= 0)) AND ((p71 <= 0))) R ((p103 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 15 will run for 3565 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (((((p155 <= 0)) AND ((p71 <= 0))) R ((p103 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking universal release
lola: rewrite Frontend/Parser/formula_rewrite.k:619
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: rewrite Frontend/Parser/formula_rewrite.k:737
lola: rewrite Frontend/Parser/formula_rewrite.k:693
lola: rewrite Frontend/Parser/formula_rewrite.k:788
lola: rewrite Frontend/Parser/formula_rewrite.k:788
lola: processed formula: A (((((p155 <= 0)) AND ((p71 <= 0))) R ((p103 <= 0))))
lola: processed formula length: 54
lola: 36 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: SUBRESULT
lola: result: yes
lola: produced by: state space /EU
lola: Predicate Phi releases Predicate Psi on all paths.
lola: 0 markings, 0 edges
lola: ========================================
lola: Child process aborted or communication problem between parent and child process
lola: SUBRESULT
lola: result: unknown
lola: The Boolean predicate may be true or false.
lola: ========================================
lola: ========================================
lola: ...considering subproblem: (E (F ((((p98 <= 0)) AND ((p24 <= 0)) AND (1 <= p177)))) AND A (((((p155 <= 0)) AND ((p71 <= 0))) R ((p103 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: ...considering subproblem: A (((((p155 <= 0)) AND ((p71 <= 0))) R ((p103 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking universal release
lola: rewrite Frontend/Parser/formula_rewrite.k:619
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: rewrite Frontend/Parser/formula_rewrite.k:737
lola: rewrite Frontend/Parser/formula_rewrite.k:693
lola: rewrite Frontend/Parser/formula_rewrite.k:788
lola: rewrite Frontend/Parser/formula_rewrite.k:788
lola: processed formula: A (((((p155 <= 0)) AND ((p71 <= 0))) R ((p103 <= 0))))
lola: processed formula length: 54
lola: 36 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /EU)
lola: state space: using reachability graph (EU version) (--search=depth)
lola: state space: using eu preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:788
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((1 <= p103))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space /EU
lola: Predicate Phi releases Predicate Psi on all paths.
lola: 0 markings, 0 edges
lola: state equation: write sara problem file to CTLFireability-16-0.sara
lola: ========================================
lola: state equation: calling and running sara
sara: try reading problem file CTLFireability-16-0.sara.
lola: ========================================
lola: ...considering subproblem: E (F ((((p98 <= 0)) AND ((p24 <= 0)) AND (1 <= p177))))
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 ((((p98 <= 0)) AND ((p24 <= 0)) AND (1 <= p177))))
lola: processed formula length: 55
lola: 32 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 37 markings, 36 edges
sara: place or transition ordering is non-deterministic
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: RESULT
lola:
SUMMARY: yes yes yes no yes yes yes yes yes no no no yes yes yes yes
lola:
preliminary result: yes yes yes no yes yes yes yes yes no no no yes yes yes yes
lola: memory consumption: 45992 KB
lola: time consumption: 5 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="DiscoveryGPU-PT-08b"
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 DiscoveryGPU-PT-08b, 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-158987882600628"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/DiscoveryGPU-PT-08b.tgz
mv DiscoveryGPU-PT-08b 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 ;