About the Execution of ITS-LoLa for Sudoku-PT-BN04
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
15715.660 | 3600000.00 | 2698660.00 | 692.90 | FFFFTFFFFFTFFTFF | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fko/mcc2020-input.r228-oct2-159033547600452.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fko/mcc2020-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itslola
Input is Sudoku-PT-BN04, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r228-oct2-159033547600452
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 392K
-rw-r--r-- 1 mcc users 3.5K Jun 3 09:31 CTLCardinality.txt
-rw-r--r-- 1 mcc users 18K Jun 3 09:31 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.7K Jun 3 09:24 CTLFireability.txt
-rw-r--r-- 1 mcc users 15K Jun 3 09:24 CTLFireability.xml
-rw-r--r-- 1 mcc users 14K May 14 10:07 LTLCardinality.txt
-rw-r--r-- 1 mcc users 55K May 14 10:07 LTLCardinality.xml
-rw-r--r-- 1 mcc users 35K May 14 10:07 LTLFireability.txt
-rw-r--r-- 1 mcc users 125K May 14 10:07 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 May 12 20:42 NewModel
-rw-r--r-- 1 mcc users 3.5K Jun 3 09:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 16K Jun 3 09:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.2K Jun 3 09:12 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 16K Jun 3 09:12 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Jun 3 09:17 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Jun 3 09:17 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 12 20:42 equiv_col
-rw-r--r-- 1 mcc users 5 May 12 20:42 instance
-rw-r--r-- 1 mcc users 6 May 12 20:42 iscolored
-rw-r--r-- 1 mcc users 46K May 12 20:42 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of booleans
BOOL_VECTOR
here is the order used to build the result vector(from text file)
FORMULA_NAME Sudoku-PT-BN04-CTLFireability-00
FORMULA_NAME Sudoku-PT-BN04-CTLFireability-01
FORMULA_NAME Sudoku-PT-BN04-CTLFireability-02
FORMULA_NAME Sudoku-PT-BN04-CTLFireability-03
FORMULA_NAME Sudoku-PT-BN04-CTLFireability-04
FORMULA_NAME Sudoku-PT-BN04-CTLFireability-05
FORMULA_NAME Sudoku-PT-BN04-CTLFireability-06
FORMULA_NAME Sudoku-PT-BN04-CTLFireability-07
FORMULA_NAME Sudoku-PT-BN04-CTLFireability-08
FORMULA_NAME Sudoku-PT-BN04-CTLFireability-09
FORMULA_NAME Sudoku-PT-BN04-CTLFireability-10
FORMULA_NAME Sudoku-PT-BN04-CTLFireability-11
FORMULA_NAME Sudoku-PT-BN04-CTLFireability-12
FORMULA_NAME Sudoku-PT-BN04-CTLFireability-13
FORMULA_NAME Sudoku-PT-BN04-CTLFireability-14
FORMULA_NAME Sudoku-PT-BN04-CTLFireability-15
=== Now, execution of the tool begins
BK_START 1591399300356
bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-05 23:21:41] [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 23:21:41] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-05 23:21:41] [INFO ] Load time of PNML (sax parser for PT used): 36 ms
[2020-06-05 23:21:41] [INFO ] Transformed 128 places.
[2020-06-05 23:21:41] [INFO ] Transformed 64 transitions.
[2020-06-05 23:21:41] [INFO ] Parsed PT model containing 128 places and 64 transitions in 65 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 12 ms.
Finished random walk after 24 steps, including 1 resets, run visited all 48 properties in 3 ms. (steps per millisecond=8 )
[2020-06-05 23:21:42] [INFO ] Flatten gal took : 45 ms
[2020-06-05 23:21:42] [INFO ] Flatten gal took : 39 ms
[2020-06-05 23:21:42] [INFO ] Export to MCC properties in file /home/mcc/execution/CTLFireability.sr.xml took 5 ms.
[2020-06-05 23:21:42] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 3 ms.
info: Time: 3600 - MCC
vrfy: Checking CTLFireability @ Sudoku-PT-BN04 @ 3570 seconds
FORMULA Sudoku-PT-BN04-CTLFireability-00 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA Sudoku-PT-BN04-CTLFireability-02 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA Sudoku-PT-BN04-CTLFireability-04 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA Sudoku-PT-BN04-CTLFireability-06 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA Sudoku-PT-BN04-CTLFireability-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA Sudoku-PT-BN04-CTLFireability-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA Sudoku-PT-BN04-CTLFireability-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA Sudoku-PT-BN04-CTLFireability-08 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA Sudoku-PT-BN04-CTLFireability-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA Sudoku-PT-BN04-CTLFireability-01 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA Sudoku-PT-BN04-CTLFireability-03 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA Sudoku-PT-BN04-CTLFireability-09 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA Sudoku-PT-BN04-CTLFireability-07 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA Sudoku-PT-BN04-CTLFireability-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA Sudoku-PT-BN04-CTLFireability-05 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA Sudoku-PT-BN04-CTLFireability-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 927
rslt: Output for CTLFireability @ Sudoku-PT-BN04
{
"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 23:21:42 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": 1,
"adisj": 0,
"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": "((p1 <= 0) OR (p85 <= 0) OR (p99 <= 0) OR (p125 <= 0))",
"processed_size": 57,
"rewrites": 73
},
"result":
{
"edges": 13,
"markings": 14,
"produced_by": "state space /EXEG",
"value": false
},
"task":
{
"compoundnumber": 0,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "invisibility based",
"visible": 0
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 4,
"problems": 4
},
"type": "invariance_from_all_successors",
"workflow": "stateequation"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 237
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 2,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 2,
"aconj": 1,
"adisj": 0,
"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": "EX(AX(AF(((1 <= p3) AND (1 <= p83) AND (1 <= p97) AND (1 <= p119)))))",
"processed_size": 69,
"rewrites": 73
},
"net":
{
"conflict_clusters": 65,
"singleton_clusters": 0
},
"result":
{
"edges": 1407,
"markings": 1304,
"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": 254
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 1,
"F": 0,
"G": 1,
"U": 0,
"X": 1,
"aconj": 2,
"adisj": 1,
"aneg": 1,
"comp": 8,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 8,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 8,
"visible_transitions": 0
},
"processed": "EX(AG((((p13 <= 0) OR (p93 <= 0) OR (p110 <= 0) OR (p121 <= 0)) AND ((p7 <= 0) OR (p87 <= 0) OR (p102 <= 0) OR (p123 <= 0)))))",
"processed_size": 132,
"rewrites": 72
},
"net":
{
"conflict_clusters": 65,
"singleton_clusters": 0
},
"result":
{
"edges": 64427400,
"markings": 8223395,
"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": 270
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"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": "((p12 <= 0) OR (p88 <= 0) OR (p108 <= 0) OR (p112 <= 0))",
"processed_size": 59,
"rewrites": 73
},
"result":
{
"edges": 15,
"markings": 16,
"produced_by": "state space /EXEG",
"value": false
},
"task":
{
"compoundnumber": 3,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "invisibility based",
"visible": 0
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 4,
"problems": 4
},
"type": "invariance_from_all_successors",
"workflow": "stateequation"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 292
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 292
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 8,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 8,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 8,
"visible_transitions": 0
},
"processed": "E (G (((1 <= p4) AND (1 <= p84) AND (1 <= p103) AND (1 <= p124) AND (1 <= p12) AND (1 <= p88) AND (1 <= p108) AND (1 <= p112))))",
"processed_size": 128,
"rewrites": 71
},
"result":
{
"edges": 6699513,
"markings": 1143164,
"produced_by": "state space / EG",
"value": false
},
"task":
{
"compoundnumber": 5,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 20
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 8,
"problems": 8
},
"type": "possible_preservation",
"workflow": "stateequation"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 5,
"type": "boolean"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 320
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 320
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"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": "((p2 <= 0) OR (p86 <= 0) OR (p98 <= 0) OR (p122 <= 0))",
"processed_size": 57,
"rewrites": 74
},
"result":
{
"edges": 16,
"markings": 17,
"produced_by": "state space /EGEF",
"value": false
},
"task":
{
"compoundnumber": 6,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving",
"visible": 0
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 4,
"problems": 4
},
"type": "eventual_invariance",
"workflow": "stateequation"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 6,
"type": "boolean"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 356
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"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": "((p8 <= 0) OR (p92 <= 0) OR (p106 <= 0) OR (p120 <= 0))",
"processed_size": 58,
"rewrites": 74
},
"result":
{
"edges": 16,
"markings": 17,
"produced_by": "state space /EFEG",
"value": false
},
"task":
{
"compoundnumber": 8,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 0
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 4,
"problems": 4
},
"type": "eventual_occurrence_from_all_states",
"workflow": "stateequation"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 407
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"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": "((1 <= p1) AND (1 <= p85) AND (1 <= p98) AND (1 <= p121))",
"processed_size": 57,
"rewrites": 73
},
"result":
{
"edges": 11,
"markings": 12,
"produced_by": "tscc_search",
"value": false
},
"task":
{
"compoundnumber": 9,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "tscc preserving/always up"
}
},
"store":
{
"type": "dfs/tscc"
},
"type": "liveness",
"workflow": "stateequation"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 475
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"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": "((p7 <= 0) OR (p83 <= 0) OR (p100 <= 0) OR (p115 <= 0))",
"processed_size": 58,
"rewrites": 73
},
"result":
{
"edges": 14,
"markings": 15,
"produced_by": "state space /EFEG",
"value": true
},
"task":
{
"compoundnumber": 10,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 0
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 4,
"problems": 4
},
"type": "reachability_of_possible_preservation",
"workflow": "stateequation"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 570
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 2,
"F": 2,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"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": "AF(EG(EF(((1 <= p2) AND (1 <= p82) AND (1 <= p96) AND (1 <= p114)))))",
"processed_size": 69,
"rewrites": 73
},
"net":
{
"conflict_clusters": 65,
"singleton_clusters": 0
},
"result":
{
"edges": 560846255,
"markings": 61556225,
"produced_by": "CTL model checker",
"value": false
},
"task":
{
"compoundnumber": 11,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 581
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 2,
"F": 0,
"G": 2,
"U": 0,
"X": 0,
"aconj": 4,
"adisj": 1,
"aneg": 0,
"comp": 23,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 23,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 21,
"visible_transitions": 0
},
"processed": "EG((EG(((1 <= p7) AND (1 <= p83) AND (1 <= p101) AND (1 <= p119))) AND ((p0 <= 0) OR (p84 <= 0) OR (p99 <= 0) OR (p124 <= 0) OR ((1 <= p0) AND (1 <= p80) AND (1 <= p97) AND (1 <= p116)) OR ((1 <= p15) AND (1 <= p91) AND (1 <= p108) AND (1 <= p115)) OR ((1 <= p6) AND (1 <= p82) AND (1 <= p101) AND (1 <= p118) AND (1 <= p2) AND (1 <= p96) AND (1 <= p114)))))",
"processed_size": 364,
"rewrites": 72
},
"net":
{
"conflict_clusters": 65,
"singleton_clusters": 0
},
"result":
{
"edges": 90753008,
"markings": 34549002,
"produced_by": "CTL model checker",
"value": false
},
"task":
{
"compoundnumber": 12,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 747
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 2,
"F": 1,
"G": 1,
"U": 1,
"X": 0,
"aconj": 4,
"adisj": 1,
"aneg": 0,
"comp": 16,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 16,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 14,
"visible_transitions": 0
},
"processed": "EF((AG((((1 <= p8) AND (1 <= p92) AND (1 <= p107) AND (1 <= p124)) OR ((1 <= p6) AND (1 <= p82) AND (1 <= p101) AND (1 <= p118)))) AND E(((1 <= p14) AND (1 <= p90) AND (1 <= p109) AND (1 <= p118)) U ((1 <= p6) AND (1 <= p86) AND (1 <= p102) AND (1 <= p122)))))",
"processed_size": 261,
"rewrites": 73
},
"net":
{
"conflict_clusters": 65,
"singleton_clusters": 0
},
"result":
{
"edges": 603213363,
"markings": 61556225,
"produced_by": "CTL model checker",
"value": false
},
"task":
{
"compoundnumber": 13,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 880
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 880
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "((p13 <= 0) OR (p93 <= 0) OR (p110 <= 0) OR (p121 <= 0))",
"processed_size": 56,
"rewrites": 75
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 14,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1761
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"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": "((1 <= p6) AND (1 <= p82) AND (1 <= p101) AND (1 <= p118))",
"processed_size": 58,
"rewrites": 70
},
"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": null
},
"task":
{
"compoundnumber": 14,
"type": "boolean"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1761
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1761
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "((p1 <= 0) OR (p81 <= 0) OR (p97 <= 0) OR (p117 <= 0))",
"processed_size": 54,
"rewrites": 75
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 15,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "(1 <= p106)",
"processed_size": 11,
"rewrites": 70
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 17,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "(1 <= p92)",
"processed_size": 10,
"rewrites": 70
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 18,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "(1 <= p8)",
"processed_size": 9,
"rewrites": 70
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 19,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"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": "E (F (((1 <= p3) AND (1 <= p83) AND (1 <= p96) AND (1 <= p115))))",
"processed_size": 65,
"rewrites": 71
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 21,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 4,
"problems": 4
},
"type": "reachability",
"workflow": "stateequation||search"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 1,
"aneg": 1,
"comp": 8,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 8,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 8,
"visible_transitions": 0
},
"processed": "((1 <= p9) AND (1 <= p89) AND (1 <= p105) AND (1 <= p117) AND ((p5 <= 0) OR (p81 <= 0) OR (p100 <= 0) OR (p113 <= 0)))",
"processed_size": 121,
"rewrites": 73
},
"result":
{
"edges": 0,
"markings": 1,
"produced_by": "state space / EG",
"value": true
},
"task":
{
"compoundnumber": 22,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 18
},
"threads": 1,
"type": "dfs"
},
"type": "eventual_occurrence",
"workflow": "stateequation"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": null
},
"task":
{
"compoundnumber": 15,
"type": "boolean"
}
},
{
"formula":
{
"count":
{
"A": 3,
"E": 5,
"F": 4,
"G": 1,
"U": 1,
"X": 2,
"aconj": 8,
"adisj": 1,
"aneg": 1,
"comp": 36,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 36,
"taut": 0,
"tconj": 7,
"tdisj": 2,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 28,
"visible_transitions": 0
},
"processed": "(E(EX(((1 <= p5) AND (1 <= p85) AND (1 <= p103) AND (1 <= p125))) U EG(((1 <= p7) AND (1 <= p87) AND (1 <= p102) AND (1 <= p123)))) OR (AF(((p13 <= 0) OR (p93 <= 0) OR (p110 <= 0) OR (p121 <= 0))) AND (AX((((1 <= p13) AND (1 <= p89) AND (1 <= p108) AND (1 <= p113)) OR ((1 <= p15) AND (1 <= p95) AND (1 <= p111) AND (1 <= p127)))) AND (EF(((1 <= p14) AND (1 <= p90) AND (1 <= p108) AND (1 <= p114))) AND ((1 <= p11) AND ((1 <= p95) AND ((1 <= p106) AND ((1 <= p123) AND (AF(((1 <= p0) AND (1 <= p84) AND (1 <= p98) AND (1 <= p120))) OR EF(((1 <= p13) AND (1 <= p89) AND (1 <= p108) AND (1 <= p113))))))))))))",
"processed_size": 612,
"rewrites": 78
},
"net":
{
"conflict_clusters": 65,
"singleton_clusters": 0
},
"result":
{
"edges": 306656968,
"markings": 52738456,
"produced_by": "CTL model checker",
"value": false
},
"task":
{
"compoundnumber": 16,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
},
{
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"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": "((p0 <= 0) OR (p84 <= 0) OR (p98 <= 0) OR (p120 <= 0))",
"processed_size": 57,
"rewrites": 74
},
"result":
{
"edges": 512291848,
"markings": 61537073,
"produced_by": "parallel",
"value": false
},
"task":
{
"compoundnumber": 17,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "tscc preserving/always up"
}
},
"stateequation":
{
"literals": 4,
"problems": 4
},
"store":
{
"type": "dfs/tscc"
},
"type": "possible_invariance",
"workflow": "stateequation"
}
},
{
"child":
[
{
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "((p13 <= 0) OR (p93 <= 0) OR (p110 <= 0) OR (p121 <= 0))",
"processed_size": 56,
"rewrites": 75
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 18,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},
{
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"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": "((1 <= p6) AND (1 <= p82) AND (1 <= p101) AND (1 <= p118))",
"processed_size": 58,
"rewrites": 70
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 19,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},
{
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"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": "E (G (((1 <= p11) AND (1 <= p91) AND (1 <= p105) AND (1 <= p119))))",
"processed_size": 67,
"rewrites": 71
},
"result":
{
"edges": 44459495,
"markings": 8165994,
"produced_by": "state space / EG",
"value": false
},
"task":
{
"compoundnumber": 20,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 11
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 4,
"problems": 4
},
"type": "possible_preservation",
"workflow": "stateequation"
}
}
],
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 18,
"type": "boolean"
}
},
{
"child":
[
{
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "((p1 <= 0) OR (p81 <= 0) OR (p97 <= 0) OR (p117 <= 0))",
"processed_size": 54,
"rewrites": 75
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 19,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},
{
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "(1 <= p120)",
"processed_size": 11,
"rewrites": 70
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 20,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},
{
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "(1 <= p106)",
"processed_size": 11,
"rewrites": 70
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 21,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},
{
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "(1 <= p92)",
"processed_size": 10,
"rewrites": 70
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 22,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},
{
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "(1 <= p8)",
"processed_size": 9,
"rewrites": 70
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 23,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},
{
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"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": "((1 <= p10) AND (1 <= p90) AND (1 <= p104) AND (1 <= p114))",
"processed_size": 59,
"rewrites": 73
},
"result":
{
"edges": 44443759,
"markings": 8165738,
"produced_by": "state space / EG",
"value": true
},
"task":
{
"compoundnumber": 24,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 11
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 4,
"problems": 4
},
"type": "eventual_occurrence",
"workflow": "stateequation"
}
},
{
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"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": "E (F (((1 <= p3) AND (1 <= p83) AND (1 <= p96) AND (1 <= p115))))",
"processed_size": 65,
"rewrites": 71
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 25,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 4,
"problems": 4
},
"type": "reachability",
"workflow": "stateequation||search"
}
},
{
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 1,
"aneg": 1,
"comp": 8,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 8,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 8,
"visible_transitions": 0
},
"processed": "((1 <= p9) AND (1 <= p89) AND (1 <= p105) AND (1 <= p117) AND ((p5 <= 0) OR (p81 <= 0) OR (p100 <= 0) OR (p113 <= 0)))",
"processed_size": 121,
"rewrites": 73
},
"result":
{
"edges": 0,
"markings": 1,
"produced_by": "state space / EG",
"value": true
},
"task":
{
"compoundnumber": 26,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 18
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 8,
"problems": 5
},
"type": "eventual_occurrence",
"workflow": "stateequation"
}
}
],
"result":
{
"produced_by": "boolean",
"value": true
},
"task":
{
"compoundnumber": 19,
"type": "boolean"
}
}
],
"exit":
{
"error": null,
"memory": 48640,
"runtime": 2643.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "CTLFireability.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "A(X(A(F(**)))) : A(F(E(G(E(F(**)))))) : E(X(A(X(A(F(**)))))) : E(G((E(G(**)) AND **))) : E(X(A(G(*)))) : (** AND (E(G(**)) OR (** OR (** OR (** OR **))))) : A(X(A(F(**)))) : (E((E(X(**)) U E(G(**)))) OR (A(F(*)) AND (A(X(**)) AND (E(F(**)) AND (** AND (** AND (** AND (** AND (A(F(**)) OR E(F(**))))))))))) : A(G(E(F(**)))) : E(F((A(G(**)) AND E((** U **))))) : E(F(E(G(*)))) : E(F(A(G(**)))) : A(G(A(F(**)))) : (E(F(**)) AND (** AND (** AND (** AND (** AND (A(F(**)) AND (A(F(**)) OR (** OR (** OR (** OR **)))))))))) : (E(G((E(X(**)) OR (** OR (** OR **))))) AND E(G(**))) : (A(F(A(G(**)))) AND E(G(E(X(*)))))"
},
"net":
{
"arcs": 320,
"conflict_clusters": 65,
"places": 128,
"places_significant": 64,
"singleton_clusters": 0,
"transitions": 64
},
"result":
{
"preliminary_value": "no no no no yes no no no no no yes no no yes no no ",
"value": "no no no no yes no no no no no yes no no 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: 192/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 4096
lola: finding significant places
lola: 128 places, 64 transitions, 64 significant places
lola: compute conflict clusters
lola: computed conflict clusters
lola: Computing conflicting sets
lola: Computing back conflicting sets
lola: TASK
lola: Reading formula in XML format (--xmlformula)
lola: reading pnml
lola: reading formula from CTLFireability.xml
lola: A (X (A (F (((1 <= p1) AND (1 <= p85) AND (1 <= p99) AND (1 <= p125)))))) : A (F (E (G (E (F (((1 <= p2) AND (1 <= p82) AND (1 <= p96) AND (1 <= p114)))))))) : E (X (A (X (A (F (((1 <= p3) AND (1 <= p83) AND (1 <= p97) AND (1 <= p119)))))))) : E (G ((E (G (((1 <= p7) AND (1 <= p83) AND (1 <= p101) AND (1 <= p119)))) AND ((p0 <= 0) OR (p84 <= 0) OR (p99 <= 0) OR (p124 <= 0) OR ((1 <= p0) AND (1 <= p80) AND (1 <= p97) AND (1 <= p116)) OR ((1 <= p15) AND (1 <= p91) AND (1 <= p108) AND (1 <= p115)) OR ((1 <= p6) AND (1 <= p82) AND (1 <= p101) AND (1 <= p118) AND (1 <= p2) AND (1 <= p96) AND (1 <= p114)))))) : NOT(A (X (E (F ((((1 <= p13) AND (1 <= p93) AND (1 <= p110) AND (1 <= p121)) OR ((1 <= p7) AND (1 <= p87) AND (1 <= p102) AND (1 <= p123)))))))) : (((1 <= p6) AND (1 <= p82) AND (1 <= p101) AND (1 <= p118)) AND ((((E (G (((1 <= p11) AND (1 <= p91) AND (1 <= p105) AND (1 <= p119)))) OR (p13 <= 0)) OR (p93 <= 0)) OR (p110 <= 0)) OR (p121 <= 0))) : A (X (A (F (((1 <= p12) AND (1 <= p88) AND (1 <= p108) AND (1 <= p112)))))) : (E ((E (X (((1 <= p5) AND (1 <= p85) AND (1 <= p103) AND (1 <= p125)))) U E (G (((1 <= p7) AND (1 <= p87) AND (1 <= p102) AND (1 <= p123)))))) OR (((((((NOT(E (G (((1 <= p13) AND (1 <= p93) AND (1 <= p110) AND (1 <= p121))))) AND A (X ((((1 <= p13) AND (1 <= p89) AND (1 <= p108) AND (1 <= p113)) OR ((1 <= p15) AND (1 <= p95) AND (1 <= p111) AND (1 <= p127)))))) AND E (F (((1 <= p14) AND (1 <= p90) AND (1 <= p108) AND (1 <= p114))))) AND (1 <= p11)) AND (1 <= p95)) AND (1 <= p106)) AND (1 <= p123)) AND (A (F (((1 <= p0) AND (1 <= p84) AND (1 <= p98) AND (1 <= p120)))) OR E (F (((1 <= p13) AND (1 <= p89) AND (1 <= p108) AND (1 <= p113))))))) : A (G (E (F (((1 <= p1) AND (1 <= p85) AND (1 <= p98) AND (1 <= p121)))))) : E (F ((A (G ((((1 <= p8) AND (1 <= p92) AND (1 <= p107) AND (1 <= p124)) OR ((1 <= p6) AND (1 <= p82) AND (1 <= p101) AND (1 <= p118))))) AND E ((((1 <= p14) AND (1 <= p90) AND (1 <= p109) AND (1 <= p118)) U ((1 <= p6) AND (1 <= p86) AND (1 <= p102) AND (1 <= p122))))))) : NOT(A (G (A (F (((1 <= p7) AND (1 <= p83) AND (1 <= p100) AND (1 <= p115))))))) : E (F (E (G (A (G (((1 <= p0) AND (1 <= p84) AND (1 <= p98) AND (1 <= p120)))))))) : A (G (A (F (A (F (((1 <= p8) AND (1 <= p92) AND (1 <= p106) AND (1 <= p120)))))))) : ((((((E (F (E (F (((1 <= p3) AND (1 <= p83) AND (1 <= p96) AND (1 <= p115)))))) AND (1 <= p8)) AND (1 <= p92)) AND (1 <= p106)) AND (1 <= p120)) AND A (F (((p9 <= 0) OR (p89 <= 0) OR (p105 <= 0) OR (p117 <= 0) OR ((1 <= p5) AND (1 <= p81) AND (1 <= p100) AND (1 <= p113)))))) AND ((((A (F (((p10 <= 0) OR (p90 <= 0) OR (p104 <= 0) OR (p114 <= 0)))) OR (p1 <= 0)) OR (p81 <= 0)) OR (p97 <= 0)) OR (p117 <= 0))) : (E (G ((((E (X (((1 <= p9) AND (1 <= p89) AND (1 <= p104) AND (1 <= p113)))) OR ((1 <= p0) AND (1 <= p84) AND (1 <= p98) AND (1 <= p120))) OR ((1 <= p2) AND (1 <= p86) AND (1 <= p98) AND (1 <= p122))) OR ((1 <= p10) AND (1 <= p90) AND (1 <= p105) AND (1 <= p118))))) AND E (G (((1 <= p4) AND (1 <= p84) AND (1 <= p103) AND (1 <= p124) AND (1 <= p12) AND (1 <= p88) AND (1 <= p108) AND (1 <= p112))))) : (A (F (A (G (((1 <= p2) AND (1 <= p86) AND (1 <= p98) AND (1 <= p122)))))) AND E (G (NOT(A (X (((1 <= p15) AND (1 <= p91) AND (1 <= p109) AND (1 <= p119))))))))
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:329
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: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: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: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:323
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:476
lola: rewrite Frontend/Parser/formula_rewrite.k:392
lola: rewrite Frontend/Parser/formula_rewrite.k:401
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: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:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k: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:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 222 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (A (F (((1 <= p1) AND (1 <= p85) AND (1 <= p99) AND (1 <= p125))))))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence from all successors
lola: rewrite Frontend/Parser/formula_rewrite.k:584
lola: rewrite Frontend/Parser/formula_rewrite.k:754
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: ((p1 <= 0) OR (p85 <= 0) OR (p99 <= 0) OR (p125 <= 0))
lola: processed formula length: 57
lola: 73 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 /EXEG)
lola: state space: using reachability graph (EXEG version) (--search=depth)
lola: state space: using invisibility based 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:753
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: ((1 <= p1) AND (1 <= p85) AND (1 <= p99) AND (1 <= p125))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 4 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space /EXEG
lola: The predicate does not eventually occur from all successors.
lola: 14 markings, 13 edges
lola: ========================================
lola: subprocess 1 will run for 237 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (X (A (X (A (F (((1 <= p3) AND (1 <= p83) AND (1 <= p97) AND (1 <= p119))))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:811
lola: rewrite Frontend/Parser/formula_rewrite.k:812
lola: rewrite Frontend/Parser/formula_rewrite.k:807
lola: processed formula: EX(AX(AF(((1 <= p3) AND (1 <= p83) AND (1 <= p97) AND (1 <= p119)))))
lola: processed formula length: 69
lola: 73 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: 1304 markings, 1407 edges
lola: ========================================
lola: subprocess 2 will run for 254 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (X (A (G ((((p13 <= 0) OR (p93 <= 0) OR (p110 <= 0) OR (p121 <= 0)) AND ((p7 <= 0) OR (p87 <= 0) OR (p102 <= 0) OR (p123 <= 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((((p13 <= 0) OR (p93 <= 0) OR (p110 <= 0) OR (p121 <= 0)) AND ((p7 <= 0) OR (p87 <= 0) OR (p102 <= 0) OR (p123 <= 0)))))
lola: processed formula length: 132
lola: 72 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: 942594 markings, 6226375 edges, 188519 markings/sec, 0 secs
lola: 1733735 markings, 12130688 edges, 158228 markings/sec, 5 secs
lola: 2550993 markings, 17937334 edges, 163452 markings/sec, 10 secs
lola: 3471785 markings, 24422982 edges, 184158 markings/sec, 15 secs
lola: 4234626 markings, 30214519 edges, 152568 markings/sec, 20 secs
lola: 4890978 markings, 35309807 edges, 131270 markings/sec, 25 secs
lola: 5613022 markings, 40905479 edges, 144409 markings/sec, 30 secs
lola: 6356648 markings, 46600643 edges, 148725 markings/sec, 35 secs
lola: 6952528 markings, 51525910 edges, 119176 markings/sec, 40 secs
lola: 7562320 markings, 56949859 edges, 121958 markings/sec, 45 secs
lola: 8064165 markings, 62268952 edges, 100369 markings/sec, 50 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 8223395 markings, 64427400 edges
lola: ========================================
lola: subprocess 3 will run for 270 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (A (F (((1 <= p12) AND (1 <= p88) AND (1 <= p108) AND (1 <= p112))))))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence from all successors
lola: rewrite Frontend/Parser/formula_rewrite.k:584
lola: rewrite Frontend/Parser/formula_rewrite.k:754
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: ((p12 <= 0) OR (p88 <= 0) OR (p108 <= 0) OR (p112 <= 0))
lola: processed formula length: 59
lola: 73 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 /EXEG)
lola: state space: using reachability graph (EXEG version) (--search=depth)
lola: state space: using invisibility based 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:753
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: ((1 <= p12) AND (1 <= p88) AND (1 <= p108) AND (1 <= p112))
lola: SUBRESULT
lola: result: no
lola: produced by: state space /EXEG
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 4 literals and 1 conjunctive subformulas
lola: The predicate does not eventually occur from all successors.
lola: 16 markings, 15 edges
lola: ========================================
lola: subprocess 4 will run for 292 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E ((E (X (((1 <= p5) AND (1 <= p85) AND (1 <= p103) AND (1 <= p125)))) U E (G (((1 <= p7) AND (1 <= p87) AND (1 <= p102) AND (1 <= p123)))))) OR (A (F (((p13 <= 0) OR (p93 <= 0) OR (p110 <= 0) OR (p121 <= 0)))) AND (A (X ((((1 <= p13) AND (1 <= p89) AND (1 <= p108) AND (1 <= p113)) OR ((1 <= p15) AND (1 <= p95) AND (1 <= p111) AND (1 <= p127))))) AND (E (F (((1 <= p14) AND (1 <= p90) AND (1 <... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:807
lola: rewrite Frontend/Parser/formula_rewrite.k:808
lola: rewrite Frontend/Parser/formula_rewrite.k:809
lola: rewrite Frontend/Parser/formula_rewrite.k:811
lola: rewrite Frontend/Parser/formula_rewrite.k:812
lola: rewrite Frontend/Parser/formula_rewrite.k:806
lola: rewrite Frontend/Parser/formula_rewrite.k:811
lola: rewrite Frontend/Parser/formula_rewrite.k:806
lola: processed formula: (E(EX(((1 <= p5) AND (1 <= p85) AND (1 <= p103) AND (1 <= p125))) U EG(((1 <= p7) AND (1 <= p87) AND (1 <= p102) AND (1 <= p123)))) OR (AF(((p13 <= 0) OR (p93 <= 0) OR (p110 <= 0) OR (p121 <= 0))) AND (AX((((1 <= p13) AND (1 <= p89) AND (1 <= p108) AND (1 <= p113)) OR ((1 <= p15) AND (1 <= p95) AND (1 <= p111) AND (1 <= p127)))) AND (EF(((1 <= p14) AND (1 <= p90) AND (1 <= p108) AND (1 <= p114... (shortened)
lola: processed formula length: 612
lola: 78 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 6 significant temporal operators and needs 26 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: 2117311 markings, 5673290 edges, 423462 markings/sec, 0 secs
lola: 3899813 markings, 10590554 edges, 356500 markings/sec, 5 secs
lola: 5561811 markings, 15466376 edges, 332400 markings/sec, 10 secs
lola: 7055305 markings, 20060319 edges, 298699 markings/sec, 15 secs
lola: 8807348 markings, 24831470 edges, 350409 markings/sec, 20 secs
lola: 10324398 markings, 29041369 edges, 303410 markings/sec, 25 secs
lola: 11815245 markings, 33484892 edges, 298169 markings/sec, 30 secs
lola: 13342714 markings, 37773540 edges, 305494 markings/sec, 35 secs
lola: 15037147 markings, 41390642 edges, 338887 markings/sec, 40 secs
lola: 16651766 markings, 45081308 edges, 322924 markings/sec, 45 secs
lola: 18265958 markings, 49194484 edges, 322838 markings/sec, 50 secs
lola: 19844562 markings, 52893661 edges, 315721 markings/sec, 55 secs
lola: 21552910 markings, 56702460 edges, 341670 markings/sec, 60 secs
lola: 23688240 markings, 61789460 edges, 427066 markings/sec, 65 secs
lola: 25615296 markings, 66688224 edges, 385411 markings/sec, 70 secs
lola: 27275812 markings, 70672641 edges, 332103 markings/sec, 75 secs
lola: 28967034 markings, 74980576 edges, 338244 markings/sec, 80 secs
lola: 30740710 markings, 79581776 edges, 354735 markings/sec, 85 secs
lola: 32385840 markings, 84079217 edges, 329026 markings/sec, 90 secs
lola: 34028906 markings, 89033139 edges, 328613 markings/sec, 95 secs
lola: 34728787 markings, 93370148 edges, 139976 markings/sec, 100 secs
lola: 35028257 markings, 97727480 edges, 59894 markings/sec, 105 secs
lola: 35300774 markings, 101871284 edges, 54503 markings/sec, 110 secs
lola: 35569023 markings, 105943406 edges, 53650 markings/sec, 115 secs
lola: 35835684 markings, 109713336 edges, 53332 markings/sec, 120 secs
lola: 36739229 markings, 113546799 edges, 180709 markings/sec, 125 secs
lola: 37599365 markings, 117121446 edges, 172027 markings/sec, 130 secs
lola: 38376832 markings, 120644595 edges, 155493 markings/sec, 135 secs
lola: 39004120 markings, 124015444 edges, 125458 markings/sec, 140 secs
lola: 39278122 markings, 127999532 edges, 54800 markings/sec, 145 secs
lola: 39556549 markings, 132002568 edges, 55685 markings/sec, 150 secs
lola: 39804971 markings, 136027350 edges, 49684 markings/sec, 155 secs
lola: 40062705 markings, 139741352 edges, 51547 markings/sec, 160 secs
lola: 40524593 markings, 143426008 edges, 92378 markings/sec, 165 secs
lola: 41395506 markings, 147048684 edges, 174183 markings/sec, 170 secs
lola: 42232918 markings, 150788460 edges, 167482 markings/sec, 175 secs
lola: 43016033 markings, 154170814 edges, 156623 markings/sec, 180 secs
lola: 43535580 markings, 157759853 edges, 103909 markings/sec, 185 secs
lola: 43882534 markings, 161553145 edges, 69391 markings/sec, 190 secs
lola: 44227950 markings, 165073612 edges, 69083 markings/sec, 195 secs
lola: 44528402 markings, 168775435 edges, 60090 markings/sec, 200 secs
lola: 44821768 markings, 172228178 edges, 58673 markings/sec, 205 secs
lola: 45160995 markings, 176035748 edges, 67845 markings/sec, 210 secs
lola: 45508765 markings, 179667785 edges, 69554 markings/sec, 215 secs
lola: 45837138 markings, 183270722 edges, 65675 markings/sec, 220 secs
lola: 46156141 markings, 187151713 edges, 63801 markings/sec, 225 secs
lola: 46464131 markings, 190794708 edges, 61598 markings/sec, 230 secs
lola: 46744668 markings, 194683552 edges, 56107 markings/sec, 235 secs
lola: 47045342 markings, 198629704 edges, 60135 markings/sec, 240 secs
lola: 47336704 markings, 202508222 edges, 58272 markings/sec, 245 secs
lola: 47627913 markings, 205789031 edges, 58242 markings/sec, 250 secs
lola: 47948957 markings, 209345555 edges, 64209 markings/sec, 255 secs
lola: 48228756 markings, 212718352 edges, 55960 markings/sec, 260 secs
lola: 48491808 markings, 216105838 edges, 52610 markings/sec, 265 secs
lola: 48610104 markings, 221747714 edges, 23659 markings/sec, 270 secs
lola: 48727411 markings, 226946114 edges, 23461 markings/sec, 275 secs
lola: 48831594 markings, 231908876 edges, 20837 markings/sec, 280 secs
lola: 48942619 markings, 236994164 edges, 22205 markings/sec, 285 secs
lola: local time limit reached - aborting
lola:
preliminary result: no unknown no unknown yes unknown no unknown unknown unknown unknown unknown unknown unknown unknown unknown
lola: memory consumption: 6457096 KB
lola: time consumption: 352 seconds
lola: print data as JSON (--json)
lola: writing JSON to CTLFireability.json
lola: closed JSON file CTLFireability.json
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 5 will run for 292 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E (G ((E (X (((1 <= p9) AND (1 <= p89) AND (1 <= p104) AND (1 <= p113)))) OR (((1 <= p0) AND (1 <= p84) AND (1 <= p98) AND (1 <= p120)) OR (((1 <= p2) AND (1 <= p86) AND (1 <= p98) AND (1 <= p122)) OR ((1 <= p10) AND (1 <= p90) AND (1 <= p105) AND (1 <= p118))))))) AND E (G (((1 <= p4) AND (1 <= p84) AND (1 <= p103) AND (1 <= p124) AND (1 <= p12) AND (1 <= p88) AND (1 <= p108) AND (1 <= p112)))))... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 5 will run for 292 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G (((1 <= p4) AND (1 <= p84) AND (1 <= p103) AND (1 <= p124) AND (1 <= p12) AND (1 <= p88) AND (1 <= p108) AND (1 <= p112))))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation
lola: rewrite Frontend/Parser/formula_rewrite.k:583
lola: processed formula: E (G (((1 <= p4) AND (1 <= p84) AND (1 <= p103) AND (1 <= p124) AND (1 <= p12) AND (1 <= p88) AND (1 <= p108) AND (1 <= p112))))
lola: processed formula length: 128
lola: 71 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: ((p4 <= 0) OR (p84 <= 0) OR (p103 <= 0) OR (p124 <= 0) OR (p12 <= 0) OR (p88 <= 0) OR (p108 <= 0) OR (p112 <= 0))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 8 literals and 8 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: 799480 markings, 4162999 edges, 159896 markings/sec, 0 secs || sara is running 0 secs
lola: SUBRESULT
lola: result: no
lola: produced by: state space / EG
lola: The predicate is not possibly preserved.
lola: 1143164 markings, 6699513 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 6 will run for 320 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (F (A (G (((1 <= p2) AND (1 <= p86) AND (1 <= p98) AND (1 <= p122)))))) AND E (G (E (X (((p15 <= 0) OR (p91 <= 0) OR (p109 <= 0) OR (p119 <= 0)))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 6 will run for 320 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (A (G (((1 <= p2) AND (1 <= p86) AND (1 <= p98) AND (1 <= p122))))))
lola: ========================================
lola: SUBTASK
lola: checking eventual invariance
lola: rewrite Frontend/Parser/formula_rewrite.k:594
lola: rewrite Frontend/Parser/formula_rewrite.k:629
lola: rewrite Frontend/Parser/formula_rewrite.k:758
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: ((p2 <= 0) OR (p86 <= 0) OR (p98 <= 0) OR (p122 <= 0))
lola: processed formula length: 57
lola: 74 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 /EGEF)
lola: state space: using reachability graph (EGEF version) (--search=depth)
lola: state space: using ctl preserving stubborn set method (--stubborn=tarjan)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 1
lola: state equation task get result started, id 0
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: 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: formula 1: ((p2 <= 0) OR (p86 <= 0) OR (p98 <= 0) OR (p122 <= 0))
lola: state equation task get result unparse finished id 1
lola: state equation: Generated DNF with 4 literals and 4 conjunctive subformulas
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((1 <= p2) AND (1 <= p86) AND (1 <= p98) AND (1 <= p122))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 4 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to CTLFireability-6-1.sara
lola: state equation: calling and running sara
sara: try reading problem file CTLFireability-6-1.sara.
sara: place or transition ordering is non-deterministic
lola: state equation: write sara problem file to CTLFireability-6-0.sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space /EGEF
lola: The predicate is not eventually invariant.
lola: 17 markings, 16 edges
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: ========================================
lola: subprocess 7 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (A (G (((1 <= p0) AND (1 <= p84) AND (1 <= p98) AND (1 <= p120))))))
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: ((p0 <= 0) OR (p84 <= 0) OR (p98 <= 0) OR (p120 <= 0))
lola: processed formula length: 57
lola: 74 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 unparse finished++ id 0
lola: formula 0: ((1 <= p0) AND (1 <= p84) AND (1 <= p98) AND (1 <= p120))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 4 literals and 1 conjunctive subformulas
lola: state equation task get result started, id 1
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: state equation task get result rewrite finished id 1
lola: state equation task get result unparse finished++ id 1
lola: formula 1: ((p0 <= 0) OR (p84 <= 0) OR (p98 <= 0) OR (p120 <= 0))
lola: state equation task get result unparse finished id 1
lola: state equation: Generated DNF with 4 literals and 4 conjunctive subformulas
lola: state equation: write sara problem file to CTLFireability-7-1.sara
lola: state equation: calling and running sara
sara: try reading problem file CTLFireability-7-1.sara.
sara: place or transition ordering is non-deterministic
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.
sara: place or transition ordering is non-deterministic
lola: state equation 1: solution produced
lola: state equation 0: solution produced
lola: sara is running 0 secs || sara is running 0 secs || 1075599 markings, 7592296 edges, 215120 markings/sec, 0 secs
lola: sara is running 5 secs || sara is running 5 secs || 2097176 markings, 14674821 edges, 204315 markings/sec, 5 secs
lola: sara is running 10 secs || sara is running 10 secs || 3069111 markings, 21487765 edges, 194387 markings/sec, 10 secs
lola: sara is running 15 secs || sara is running 15 secs || 4019692 markings, 28221611 edges, 190116 markings/sec, 15 secs
lola: sara is running 20 secs || sara is running 20 secs || 4864303 markings, 34816355 edges, 168922 markings/sec, 20 secs
lola: sara is running 25 secs || sara is running 25 secs || 5690697 markings, 41179372 edges, 165279 markings/sec, 25 secs
lola: sara is running 30 secs || sara is running 30 secs || 6565715 markings, 48129444 edges, 175004 markings/sec, 30 secs
lola: sara is running 35 secs || sara is running 35 secs || 7310763 markings, 54592570 edges, 149010 markings/sec, 35 secs
lola: sara is running 40 secs || sara is running 40 secs || 8001666 markings, 61307320 edges, 138181 markings/sec, 40 secs
lola: sara is running 45 secs || sara is running 45 secs || 8816883 markings, 68251225 edges, 163043 markings/sec, 45 secs
lola: sara is running 50 secs || sara is running 50 secs || 9723570 markings, 74804413 edges, 181337 markings/sec, 50 secs
lola: sara is running 55 secs || sara is running 55 secs || 10603673 markings, 81228128 edges, 176021 markings/sec, 55 secs
lola: sara is running 60 secs || sara is running 60 secs || 11472715 markings, 87504751 edges, 173808 markings/sec, 60 secs
lola: sara is running 65 secs || sara is running 65 secs || 12380288 markings, 93658161 edges, 181515 markings/sec, 65 secs
lola: sara is running 70 secs || sara is running 70 secs || 13131017 markings, 99746468 edges, 150146 markings/sec, 70 secs
lola: sara is running 75 secs || sara is running 75 secs || 13911819 markings, 105588705 edges, 156160 markings/sec, 75 secs
lola: sara is running 80 secs || sara is running 80 secs || 14740298 markings, 112023031 edges, 165696 markings/sec, 80 secs
lola: sara is running 85 secs || sara is running 85 secs || 15420124 markings, 117994926 edges, 135965 markings/sec, 85 secs
lola: sara is running 90 secs || sara is running 90 secs || 16076771 markings, 124215200 edges, 131329 markings/sec, 90 secs
lola: sara is running 95 secs || sara is running 95 secs || 16735861 markings, 130650511 edges, 131818 markings/sec, 95 secs
lola: sara is running 100 secs || sara is running 100 secs || 17631795 markings, 136926628 edges, 179187 markings/sec, 100 secs
lola: sara is running 105 secs || sara is running 105 secs || 18519647 markings, 143103544 edges, 177570 markings/sec, 105 secs
lola: sara is running 110 secs || sara is running 110 secs || 19373753 markings, 149208882 edges, 170821 markings/sec, 110 secs
lola: sara is running 115 secs || sara is running 115 secs || 20239912 markings, 155282994 edges, 173232 markings/sec, 115 secs
lola: sara is running 120 secs || sara is running 120 secs || 21001485 markings, 161181324 edges, 152315 markings/sec, 120 secs
lola: sara is running 125 secs || sara is running 125 secs || 21781386 markings, 167002244 edges, 155980 markings/sec, 125 secs
lola: sara is running 130 secs || sara is running 130 secs || 22475718 markings, 172716235 edges, 138866 markings/sec, 130 secs
lola: sara is running 135 secs || sara is running 135 secs || 23279618 markings, 179111283 edges, 160780 markings/sec, 135 secs
lola: sara is running 140 secs || sara is running 140 secs || 23927828 markings, 184871480 edges, 129642 markings/sec, 140 secs
lola: sara is running 145 secs || sara is running 145 secs || 24498364 markings, 190853441 edges, 114107 markings/sec, 145 secs
lola: sara is running 150 secs || sara is running 150 secs || 25234906 markings, 196890844 edges, 147308 markings/sec, 150 secs
lola: sara is running 155 secs || sara is running 155 secs || 26003095 markings, 202673036 edges, 153638 markings/sec, 155 secs
lola: sara is running 160 secs || sara is running 160 secs || 26851204 markings, 208568887 edges, 169622 markings/sec, 160 secs
lola: sara is running 165 secs || sara is running 165 secs || 27702294 markings, 214315010 edges, 170218 markings/sec, 165 secs
lola: sara is running 170 secs || sara is running 170 secs || 28416416 markings, 219826327 edges, 142824 markings/sec, 170 secs
lola: sara is running 175 secs || sara is running 175 secs || 29213756 markings, 225517659 edges, 159468 markings/sec, 175 secs
lola: sara is running 180 secs || sara is running 180 secs || 29889942 markings, 230829211 edges, 135237 markings/sec, 180 secs
lola: sara is running 185 secs || sara is running 185 secs || 30612863 markings, 236206787 edges, 144584 markings/sec, 185 secs
lola: sara is running 190 secs || sara is running 190 secs || 31317109 markings, 241852880 edges, 140849 markings/sec, 190 secs
lola: sara is running 195 secs || sara is running 195 secs || 31922198 markings, 247257743 edges, 121018 markings/sec, 195 secs
lola: sara is running 200 secs || sara is running 200 secs || 32497495 markings, 252728316 edges, 115059 markings/sec, 200 secs
lola: sara is running 205 secs || sara is running 205 secs || 33050928 markings, 258764280 edges, 110687 markings/sec, 205 secs
lola: sara is running 210 secs || sara is running 210 secs || 34039847 markings, 266158831 edges, 197784 markings/sec, 210 secs
lola: sara is running 215 secs || sara is running 215 secs || 34956075 markings, 273082638 edges, 183246 markings/sec, 215 secs
lola: sara is running 220 secs || sara is running 220 secs || 35766241 markings, 279616249 edges, 162033 markings/sec, 220 secs
lola: sara is running 225 secs || sara is running 225 secs || 36539910 markings, 286233518 edges, 154734 markings/sec, 225 secs
lola: sara is running 230 secs || sara is running 230 secs || 37173630 markings, 292478314 edges, 126744 markings/sec, 230 secs
lola: sara is running 235 secs || sara is running 235 secs || 37965010 markings, 299301337 edges, 158276 markings/sec, 235 secs
lola: sara is running 240 secs || sara is running 240 secs || 38801918 markings, 305703367 edges, 167382 markings/sec, 240 secs
lola: sara is running 245 secs || sara is running 245 secs || 39617062 markings, 311883836 edges, 163029 markings/sec, 245 secs
lola: sara is running 250 secs || sara is running 250 secs || 40329798 markings, 317733747 edges, 142547 markings/sec, 250 secs
lola: sara is running 255 secs || sara is running 255 secs || 41030421 markings, 323695357 edges, 140125 markings/sec, 255 secs
lola: sara is running 260 secs || sara is running 260 secs || 41625300 markings, 329590554 edges, 118976 markings/sec, 260 secs
lola: sara is running 265 secs || sara is running 265 secs || 42312055 markings, 335985291 edges, 137351 markings/sec, 265 secs
lola: sara is running 270 secs || sara is running 270 secs || 43013439 markings, 341761665 edges, 140277 markings/sec, 270 secs
lola: sara is running 275 secs || sara is running 275 secs || 43653403 markings, 347345033 edges, 127993 markings/sec, 275 secs
lola: sara is running 280 secs || sara is running 280 secs || 44302054 markings, 353411605 edges, 129730 markings/sec, 280 secs
lola: sara is running 285 secs || sara is running 285 secs || 44928766 markings, 359407950 edges, 125342 markings/sec, 285 secs
lola: sara is running 290 secs || sara is running 290 secs || 45604619 markings, 364959435 edges, 135171 markings/sec, 290 secs
lola: sara is running 295 secs || sara is running 295 secs || 46267373 markings, 370470360 edges, 132551 markings/sec, 295 secs
lola: sara is running 300 secs || sara is running 300 secs || 46816093 markings, 375562009 edges, 109744 markings/sec, 300 secs
lola: sara is running 305 secs || sara is running 305 secs || 47353467 markings, 381133528 edges, 107475 markings/sec, 305 secs
lola: sara is running 310 secs || sara is running 310 secs || 48037280 markings, 386825457 edges, 136763 markings/sec, 310 secs
lola: sara is running 315 secs || sara is running 315 secs || 48671435 markings, 392126822 edges, 126831 markings/sec, 315 secs
lola: sara is running 320 secs || sara is running 320 secs || 49305033 markings, 397518643 edges, 126720 markings/sec, 320 secs
lola: sara is running 325 secs || sara is running 325 secs || 49872358 markings, 403038519 edges, 113465 markings/sec, 325 secs
lola: sara is running 330 secs || sara is running 330 secs || 50476109 markings, 408760030 edges, 120750 markings/sec, 330 secs
lola: sara is running 335 secs || sara is running 335 secs || 51101469 markings, 414262369 edges, 125072 markings/sec, 335 secs
lola: sara is running 340 secs || sara is running 340 secs || 51645021 markings, 419740312 edges, 108710 markings/sec, 340 secs
lola: sara is running 345 secs || sara is running 345 secs || 52271629 markings, 425350457 edges, 125322 markings/sec, 345 secs
lola: sara is running 350 secs || sara is running 350 secs || 52892094 markings, 430795191 edges, 124093 markings/sec, 350 secs
lola: local time limit reached - aborting
lola:
preliminary result: no unknown no unknown yes unknown no unknown unknown unknown unknown unknown unknown unknown no no
lola: memory consumption: 2397120 KB
lola: time consumption: 717 seconds
lola: print data as JSON (--json)
lola: writing JSON to CTLFireability.json
lola: closed JSON file CTLFireability.json
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 8 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (A (F (((1 <= p8) AND (1 <= p92) AND (1 <= p106) AND (1 <= p120))))))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence from all states
lola: rewrite Frontend/Parser/formula_rewrite.k:599
lola: rewrite Frontend/Parser/formula_rewrite.k:634
lola: rewrite Frontend/Parser/formula_rewrite.k:734
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: ((p8 <= 0) OR (p92 <= 0) OR (p106 <= 0) OR (p120 <= 0))
lola: processed formula length: 58
lola: 74 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /EFEG)
lola: state space: using reachability graph (EFEG version) (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: 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: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:700
lola: SUBRESULT
lola: result: no
lola: produced by: state space /EFEG
lola: state equation task get result unparse finished++ id 1
lola: formula 1: ((p8 <= 0) OR (p92 <= 0) OR (p106 <= 0) OR (p120 <= 0))
lola: state equation task get result unparse finished id 1
lola: The predicate does not eventually occur from all states.
lola: 17 markings, 16 edges
lola: ========================================
lola: subprocess 9 will run for 407 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (E (F (((1 <= p1) AND (1 <= p85) AND (1 <= p98) AND (1 <= p121))))))
lola: ========================================
lola: SUBTASK
lola: checking liveness
lola: rewrite Frontend/Parser/formula_rewrite.k:603
lola: rewrite Frontend/Parser/formula_rewrite.k:613
lola: rewrite Frontend/Parser/formula_rewrite.k:703
lola: processed formula: ((1 <= p1) AND (1 <= p85) AND (1 <= p98) AND (1 <= p121))
lola: processed formula length: 57
lola: 73 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: SUBRESULT
lola: result: no
lola: produced by: tscc_search
lola: The predicate is not live.
lola: 12 markings, 11 edges
lola: state equation task get result started, id 0
lola: state equation task get result started, id 1
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: state equation task get result rewrite finished id 1
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: state equation task get result unparse finished++ id 1
lola: formula 1: ((1 <= p1) AND (1 <= p85) AND (1 <= p98) AND (1 <= p121))
lola: state equation task get result unparse finished id 1
lola: state equation: Generated DNF with 4 literals and 1 conjunctive subformulas
lola: ========================================
lola: subprocess 10 will run for 475 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (E (G (((p7 <= 0) OR (p83 <= 0) OR (p100 <= 0) OR (p115 <= 0))))))
lola: ========================================
lola: SUBTASK
lola: checking reachability of possible preservation
lola: rewrite Frontend/Parser/formula_rewrite.k:598
lola: rewrite Frontend/Parser/formula_rewrite.k:633
lola: rewrite Frontend/Parser/formula_rewrite.k:730
lola: processed formula: ((p7 <= 0) OR (p83 <= 0) OR (p100 <= 0) OR (p115 <= 0))
lola: processed formula length: 58
lola: 73 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /EFEG)
lola: state space: using reachability graph (EFEG version) (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: state equation task get result started, id 1
lola: rewrite Frontend/Parser/formula_rewrite.k:711
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 1
lola: SUBRESULT
lola: result: yes
lola: produced by: state space /EFEG
lola: state equation task get result unparse finished++ id 1
lola: state equation task get result rewrite finished id 0
lola: The predicate is possibly preserved from a reachable marking.
lola: 15 markings, 14 edges
lola: state equation task get result unparse finished++ id 0
lola: formula 1: ((p7 <= 0) OR (p83 <= 0) OR (p100 <= 0) OR (p115 <= 0))
lola: formula 0: ((1 <= p7) AND (1 <= p83) AND (1 <= p100) AND (1 <= p115))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 4 literals and 1 conjunctive subformulas
lola: state equation task get result unparse finished id 1
lola: state equation: Generated DNF with 4 literals and 4 conjunctive subformulas
lola: ========================================
lola: subprocess 11 will run for 570 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (E (G (E (F (((1 <= p2) AND (1 <= p82) AND (1 <= p96) AND (1 <= p114))))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:806
lola: rewrite Frontend/Parser/formula_rewrite.k:808
lola: rewrite Frontend/Parser/formula_rewrite.k:811
lola: processed formula: AF(EG(EF(((1 <= p2) AND (1 <= p82) AND (1 <= p96) AND (1 <= p114)))))
lola: processed formula length: 69
lola: 73 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: 895527 markings, 6412497 edges, 179105 markings/sec, 0 secs
lola: 1657459 markings, 12625357 edges, 152386 markings/sec, 5 secs
lola: 2453775 markings, 18597860 edges, 159263 markings/sec, 10 secs
lola: 3262117 markings, 24883696 edges, 161668 markings/sec, 15 secs
lola: 4022381 markings, 30973635 edges, 152053 markings/sec, 20 secs
lola: 4743872 markings, 36799060 edges, 144298 markings/sec, 25 secs
lola: 5464694 markings, 42678897 edges, 144164 markings/sec, 30 secs
lola: 6198278 markings, 48634659 edges, 146717 markings/sec, 35 secs
lola: 6830925 markings, 54364607 edges, 126529 markings/sec, 40 secs
lola: 7477653 markings, 60288462 edges, 129346 markings/sec, 45 secs
lola: 8003047 markings, 66145824 edges, 105079 markings/sec, 50 secs
lola: 8623869 markings, 71818647 edges, 124164 markings/sec, 55 secs
lola: 9318760 markings, 77095957 edges, 138978 markings/sec, 60 secs
lola: 9978245 markings, 82300489 edges, 131897 markings/sec, 65 secs
lola: 10712451 markings, 87860641 edges, 146841 markings/sec, 70 secs
lola: 11451395 markings, 93629989 edges, 147789 markings/sec, 75 secs
lola: 12186830 markings, 99457840 edges, 147087 markings/sec, 80 secs
lola: 12806355 markings, 104443088 edges, 123905 markings/sec, 85 secs
lola: 13418349 markings, 109391100 edges, 122399 markings/sec, 90 secs
lola: 14083906 markings, 114846022 edges, 133111 markings/sec, 95 secs
lola: 14699960 markings, 120193150 edges, 123211 markings/sec, 100 secs
lola: 15251104 markings, 125005697 edges, 110229 markings/sec, 105 secs
lola: 15823476 markings, 130574621 edges, 114474 markings/sec, 110 secs
lola: 16312137 markings, 136028588 edges, 97732 markings/sec, 115 secs
lola: 16909658 markings, 141233055 edges, 119504 markings/sec, 120 secs
lola: 17560536 markings, 146217833 edges, 130176 markings/sec, 125 secs
lola: 18183745 markings, 151165307 edges, 124642 markings/sec, 130 secs
lola: 18863854 markings, 156294786 edges, 136022 markings/sec, 135 secs
lola: 19542361 markings, 161692192 edges, 135701 markings/sec, 140 secs
lola: 20284371 markings, 167342178 edges, 148402 markings/sec, 145 secs
lola: 20932445 markings, 172578901 edges, 129615 markings/sec, 150 secs
lola: 21490322 markings, 177254761 edges, 111575 markings/sec, 155 secs
lola: 22075387 markings, 182175920 edges, 117013 markings/sec, 160 secs
lola: 22784136 markings, 187954259 edges, 141750 markings/sec, 165 secs
lola: 23328023 markings, 192775596 edges, 108777 markings/sec, 170 secs
lola: 23920305 markings, 198250302 edges, 118456 markings/sec, 175 secs
lola: 24439690 markings, 203944528 edges, 103877 markings/sec, 180 secs
lola: 25031463 markings, 209526226 edges, 118355 markings/sec, 185 secs
lola: 25732622 markings, 214755245 edges, 140232 markings/sec, 190 secs
lola: 26376864 markings, 220004510 edges, 128848 markings/sec, 195 secs
lola: 27081948 markings, 225204074 edges, 141017 markings/sec, 200 secs
lola: 27759321 markings, 230661275 edges, 135475 markings/sec, 205 secs
lola: 28466371 markings, 236004349 edges, 141410 markings/sec, 210 secs
lola: 29119826 markings, 241318026 edges, 130691 markings/sec, 215 secs
lola: 29745890 markings, 246505417 edges, 125213 markings/sec, 220 secs
lola: 30369018 markings, 251668412 edges, 124626 markings/sec, 225 secs
lola: 31008555 markings, 256969803 edges, 127907 markings/sec, 230 secs
lola: 31580258 markings, 262033251 edges, 114341 markings/sec, 235 secs
lola: 32147503 markings, 267281595 edges, 113449 markings/sec, 240 secs
lola: 32653526 markings, 272819636 edges, 101205 markings/sec, 245 secs
lola: 33204328 markings, 278187443 edges, 110160 markings/sec, 250 secs
lola: 33774852 markings, 283028219 edges, 114105 markings/sec, 255 secs
lola: 34385983 markings, 288261776 edges, 122226 markings/sec, 260 secs
lola: 35052849 markings, 293395626 edges, 133373 markings/sec, 265 secs
lola: 35572122 markings, 298291615 edges, 103855 markings/sec, 270 secs
lola: 36157497 markings, 303399898 edges, 117075 markings/sec, 275 secs
lola: 36636453 markings, 308486945 edges, 95791 markings/sec, 280 secs
lola: 37039025 markings, 313468418 edges, 80514 markings/sec, 285 secs
lola: 37652640 markings, 318359394 edges, 122723 markings/sec, 290 secs
lola: 38266769 markings, 323373319 edges, 122826 markings/sec, 295 secs
lola: 38899460 markings, 328540774 edges, 126538 markings/sec, 300 secs
lola: 39471334 markings, 333648897 edges, 114375 markings/sec, 305 secs
lola: 40031555 markings, 338599976 edges, 112044 markings/sec, 310 secs
lola: 40569476 markings, 343825615 edges, 107584 markings/sec, 315 secs
lola: 41025402 markings, 348869795 edges, 91185 markings/sec, 320 secs
lola: 41549714 markings, 353901263 edges, 104862 markings/sec, 325 secs
lola: 42116430 markings, 358711338 edges, 113343 markings/sec, 330 secs
lola: 42707738 markings, 363603253 edges, 118262 markings/sec, 335 secs
lola: 43352351 markings, 368718843 edges, 128923 markings/sec, 340 secs
lola: 43867968 markings, 373617517 edges, 103123 markings/sec, 345 secs
lola: 44429505 markings, 378524218 edges, 112307 markings/sec, 350 secs
lola: 44928026 markings, 383639313 edges, 99704 markings/sec, 355 secs
lola: 45348878 markings, 388845242 edges, 84170 markings/sec, 360 secs
lola: 46042361 markings, 394446106 edges, 138697 markings/sec, 365 secs
lola: 46721170 markings, 399984177 edges, 135762 markings/sec, 370 secs
lola: 47414371 markings, 405632648 edges, 138640 markings/sec, 375 secs
lola: 48019863 markings, 411137619 edges, 121098 markings/sec, 380 secs
lola: 48625030 markings, 416552848 edges, 121033 markings/sec, 385 secs
lola: 49167314 markings, 422290865 edges, 108457 markings/sec, 390 secs
lola: 49618325 markings, 427762381 edges, 90202 markings/sec, 395 secs
lola: 50190510 markings, 432784411 edges, 114437 markings/sec, 400 secs
lola: 50744085 markings, 438012573 edges, 110715 markings/sec, 405 secs
lola: 51200724 markings, 443045678 edges, 91328 markings/sec, 410 secs
lola: 51665879 markings, 448075404 edges, 93031 markings/sec, 415 secs
lola: 52213646 markings, 453077200 edges, 109553 markings/sec, 420 secs
lola: 52731284 markings, 458101927 edges, 103528 markings/sec, 425 secs
lola: 53164075 markings, 462968977 edges, 86558 markings/sec, 430 secs
lola: 53642682 markings, 468040972 edges, 95721 markings/sec, 435 secs
lola: 54261279 markings, 473355189 edges, 123719 markings/sec, 440 secs
lola: 54799034 markings, 478955560 edges, 107551 markings/sec, 445 secs
lola: 55262307 markings, 484464670 edges, 92655 markings/sec, 450 secs
lola: 55849874 markings, 489672025 edges, 117513 markings/sec, 455 secs
lola: 56417059 markings, 495132315 edges, 113437 markings/sec, 460 secs
lola: 56910154 markings, 500640803 edges, 98619 markings/sec, 465 secs
lola: 57338984 markings, 505793811 edges, 85766 markings/sec, 470 secs
lola: 57762780 markings, 510852641 edges, 84759 markings/sec, 475 secs
lola: 58215055 markings, 515817819 edges, 90455 markings/sec, 480 secs
lola: 58631580 markings, 521024172 edges, 83305 markings/sec, 485 secs
lola: 59122315 markings, 526419045 edges, 98147 markings/sec, 490 secs
lola: 59600026 markings, 532029861 edges, 95542 markings/sec, 495 secs
lola: 60037007 markings, 537558912 edges, 87396 markings/sec, 500 secs
lola: 60438566 markings, 543107483 edges, 80312 markings/sec, 505 secs
lola: 60821806 markings, 548530735 edges, 76648 markings/sec, 510 secs
lola: 61165994 markings, 553839277 edges, 68838 markings/sec, 515 secs
lola: 61494506 markings, 559389855 edges, 65702 markings/sec, 520 secs
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 61556225 markings, 560846255 edges
lola: ========================================
lola: subprocess 12 will run for 581 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G ((E (G (((1 <= p7) AND (1 <= p83) AND (1 <= p101) AND (1 <= p119)))) AND ((p0 <= 0) OR (p84 <= 0) OR (p99 <= 0) OR (p124 <= 0) OR ((1 <= p0) AND (1 <= p80) AND (1 <= p97) AND (1 <= p116)) OR ((1 <= p15) AND (1 <= p91) AND (1 <= p108) AND (1 <= p115)) OR ((1 <= p6) AND (1 <= p82) AND (1 <= p101) AND (1 <= p118) AND (1 <= p2) AND (1 <= p96) AND (1 <= p114))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:808
lola: rewrite Frontend/Parser/formula_rewrite.k:808
lola: processed formula: EG((EG(((1 <= p7) AND (1 <= p83) AND (1 <= p101) AND (1 <= p119))) AND ((p0 <= 0) OR (p84 <= 0) OR (p99 <= 0) OR (p124 <= 0) OR ((1 <= p0) AND (1 <= p80) AND (1 <= p97) AND (1 <= p116)) OR ((1 <= p15) AND (1 <= p91) AND (1 <= p108) AND (1 <= p115)) OR ((1 <= p6) AND (1 <= p82) AND (1 <= p101) AND (1 <= p118) AND (1 <= p2) AND (1 <= p96) AND (1 <= p114)))))
lola: processed formula length: 364
lola: 72 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: 2827177 markings, 6512470 edges, 565435 markings/sec, 0 secs
lola: 5125614 markings, 12446348 edges, 459687 markings/sec, 5 secs
lola: 7575243 markings, 18114084 edges, 489926 markings/sec, 10 secs
lola: 9680461 markings, 23668021 edges, 421044 markings/sec, 15 secs
lola: 12069458 markings, 29140652 edges, 477799 markings/sec, 20 secs
lola: 14125051 markings, 34348809 edges, 411119 markings/sec, 25 secs
lola: 16386039 markings, 39732654 edges, 452198 markings/sec, 30 secs
lola: 18459979 markings, 44765516 edges, 414788 markings/sec, 35 secs
lola: 20426638 markings, 49942154 edges, 393332 markings/sec, 40 secs
lola: 22285012 markings, 54922579 edges, 371675 markings/sec, 45 secs
lola: 24108242 markings, 59816762 edges, 364646 markings/sec, 50 secs
lola: 25911979 markings, 64659477 edges, 360747 markings/sec, 55 secs
lola: 28108513 markings, 70454119 edges, 439307 markings/sec, 60 secs
lola: 29803748 markings, 75269188 edges, 339047 markings/sec, 65 secs
lola: 31580543 markings, 80370294 edges, 355359 markings/sec, 70 secs
lola: 33145085 markings, 85439833 edges, 312908 markings/sec, 75 secs
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 34549002 markings, 90753008 edges
lola: ========================================
lola: subprocess 13 will run for 747 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((A (G ((((1 <= p8) AND (1 <= p92) AND (1 <= p107) AND (1 <= p124)) OR ((1 <= p6) AND (1 <= p82) AND (1 <= p101) AND (1 <= p118))))) AND E ((((1 <= p14) AND (1 <= p90) AND (1 <= p109) AND (1 <= p118)) U ((1 <= p6) AND (1 <= p86) AND (1 <= p102) AND (1 <= p122)))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:813
lola: rewrite Frontend/Parser/formula_rewrite.k:809
lola: rewrite Frontend/Parser/formula_rewrite.k:806
lola: processed formula: EF((AG((((1 <= p8) AND (1 <= p92) AND (1 <= p107) AND (1 <= p124)) OR ((1 <= p6) AND (1 <= p82) AND (1 <= p101) AND (1 <= p118)))) AND E(((1 <= p14) AND (1 <= p90) AND (1 <= p109) AND (1 <= p118)) U ((1 <= p6) AND (1 <= p86) AND (1 <= p102) AND (1 <= p122)))))
lola: processed formula length: 261
lola: 73 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: 997264 markings, 7901451 edges, 199453 markings/sec, 0 secs
lola: 1869420 markings, 15389657 edges, 174431 markings/sec, 5 secs
lola: 2690813 markings, 22582618 edges, 164279 markings/sec, 10 secs
lola: 3671289 markings, 30341229 edges, 196095 markings/sec, 15 secs
lola: 4476912 markings, 37565888 edges, 161125 markings/sec, 20 secs
lola: 5251704 markings, 44489358 edges, 154958 markings/sec, 25 secs
lola: 6042223 markings, 51498691 edges, 158104 markings/sec, 30 secs
lola: 6731449 markings, 58244035 edges, 137845 markings/sec, 35 secs
lola: 7458652 markings, 65163627 edges, 145441 markings/sec, 40 secs
lola: 8019439 markings, 72007756 edges, 112157 markings/sec, 45 secs
lola: 8727796 markings, 78765542 edges, 141671 markings/sec, 50 secs
lola: 9457098 markings, 85126530 edges, 145860 markings/sec, 55 secs
lola: 10271182 markings, 91711382 edges, 162817 markings/sec, 60 secs
lola: 11053871 markings, 98561747 edges, 156538 markings/sec, 65 secs
lola: 11941808 markings, 105644020 edges, 177587 markings/sec, 70 secs
lola: 12685173 markings, 112329222 edges, 148673 markings/sec, 75 secs
lola: 13374524 markings, 118489406 edges, 137870 markings/sec, 80 secs
lola: 14133458 markings, 125152831 edges, 151787 markings/sec, 85 secs
lola: 14796731 markings, 131597807 edges, 132655 markings/sec, 90 secs
lola: 15473046 markings, 138016524 edges, 135263 markings/sec, 95 secs
lola: 16048394 markings, 144605470 edges, 115070 markings/sec, 100 secs
lola: 16617291 markings, 151078593 edges, 113779 markings/sec, 105 secs
lola: 17417773 markings, 157380027 edges, 160096 markings/sec, 110 secs
lola: 18124838 markings, 163532077 edges, 141413 markings/sec, 115 secs
lola: 18895362 markings, 169745270 edges, 154105 markings/sec, 120 secs
lola: 19679162 markings, 176300416 edges, 156760 markings/sec, 125 secs
lola: 20472824 markings, 183090272 edges, 158732 markings/sec, 130 secs
lola: 21170510 markings, 189120721 edges, 139537 markings/sec, 135 secs
lola: 21849615 markings, 195022606 edges, 135821 markings/sec, 140 secs
lola: 22562530 markings, 201254824 edges, 142583 markings/sec, 145 secs
lola: 23197478 markings, 207394810 edges, 126990 markings/sec, 150 secs
lola: 23849607 markings, 213534620 edges, 130426 markings/sec, 155 secs
lola: 24409104 markings, 220013525 edges, 111899 markings/sec, 160 secs
lola: 25051749 markings, 226547595 edges, 128529 markings/sec, 165 secs
lola: 25814370 markings, 232813709 edges, 152524 markings/sec, 170 secs
lola: 26541886 markings, 239112029 edges, 145503 markings/sec, 175 secs
lola: 27259788 markings, 245239813 edges, 143580 markings/sec, 180 secs
lola: 28024007 markings, 251553026 edges, 152844 markings/sec, 185 secs
lola: 28729967 markings, 257766743 edges, 141192 markings/sec, 190 secs
lola: 29421608 markings, 263715462 edges, 138328 markings/sec, 195 secs
lola: 30079372 markings, 269591734 edges, 131553 markings/sec, 200 secs
lola: 30754064 markings, 275551324 edges, 134938 markings/sec, 205 secs
lola: 31384240 markings, 281505600 edges, 126035 markings/sec, 210 secs
lola: 32002014 markings, 287415342 edges, 123555 markings/sec, 215 secs
lola: 32542677 markings, 293780485 edges, 108133 markings/sec, 220 secs
lola: 33107097 markings, 300156388 edges, 112884 markings/sec, 225 secs
lola: 33761637 markings, 306055684 edges, 130908 markings/sec, 230 secs
lola: 34432904 markings, 312084265 edges, 134253 markings/sec, 235 secs
lola: 35125954 markings, 318173600 edges, 138610 markings/sec, 240 secs
lola: 35732167 markings, 323982870 edges, 121243 markings/sec, 245 secs
lola: 36330255 markings, 329966758 edges, 119618 markings/sec, 250 secs
lola: 36830268 markings, 335919652 edges, 100003 markings/sec, 255 secs
lola: 37401317 markings, 341845935 edges, 114210 markings/sec, 260 secs
lola: 38003928 markings, 347478715 edges, 120522 markings/sec, 265 secs
lola: 38704188 markings, 353599223 edges, 140052 markings/sec, 270 secs
lola: 39358132 markings, 359698286 edges, 130789 markings/sec, 275 secs
lola: 39969487 markings, 365331597 edges, 122271 markings/sec, 280 secs
lola: 40550864 markings, 371345894 edges, 116275 markings/sec, 285 secs
lola: 41036488 markings, 377228923 edges, 97125 markings/sec, 290 secs
lola: 41610157 markings, 383047910 edges, 114734 markings/sec, 295 secs
lola: 42244594 markings, 388608982 edges, 126887 markings/sec, 300 secs
lola: 42881772 markings, 394301808 edges, 127436 markings/sec, 305 secs
lola: 43539465 markings, 400265598 edges, 131539 markings/sec, 310 secs
lola: 44138919 markings, 405838043 edges, 119891 markings/sec, 315 secs
lola: 44712332 markings, 411697453 edges, 114683 markings/sec, 320 secs
lola: 45219713 markings, 417709638 edges, 101476 markings/sec, 325 secs
lola: 45886865 markings, 424144713 edges, 133430 markings/sec, 330 secs
lola: 46621708 markings, 430738206 edges, 146969 markings/sec, 335 secs
lola: 47375996 markings, 437433318 edges, 150858 markings/sec, 340 secs
lola: 48049552 markings, 444006451 edges, 134711 markings/sec, 345 secs
lola: 48740705 markings, 450579110 edges, 138231 markings/sec, 350 secs
lola: 49313037 markings, 457423645 edges, 114466 markings/sec, 355 secs
lola: 49850037 markings, 463537822 edges, 107400 markings/sec, 360 secs
lola: 50462369 markings, 469350386 edges, 122466 markings/sec, 365 secs
lola: 50979664 markings, 475151991 edges, 103459 markings/sec, 370 secs
lola: 51409105 markings, 480960283 edges, 85888 markings/sec, 375 secs
lola: 52016314 markings, 486535900 edges, 121442 markings/sec, 380 secs
lola: 52595356 markings, 492423542 edges, 115808 markings/sec, 385 secs
lola: 53073021 markings, 498155567 edges, 95533 markings/sec, 390 secs
lola: 53580376 markings, 503964082 edges, 101471 markings/sec, 395 secs
lola: 54206053 markings, 509961638 edges, 125135 markings/sec, 400 secs
lola: 54794423 markings, 516321621 edges, 117674 markings/sec, 405 secs
lola: 55308348 markings, 522549415 edges, 102785 markings/sec, 410 secs
lola: 55914114 markings, 528457549 edges, 121153 markings/sec, 415 secs
lola: 56520651 markings, 534718787 edges, 121307 markings/sec, 420 secs
lola: 57004694 markings, 541020879 edges, 96809 markings/sec, 425 secs
lola: 57495326 markings, 546755823 edges, 98126 markings/sec, 430 secs
lola: 57933508 markings, 552473422 edges, 87636 markings/sec, 435 secs
lola: 58418522 markings, 558129206 edges, 97003 markings/sec, 440 secs
lola: 58924339 markings, 564251554 edges, 101163 markings/sec, 445 secs
lola: 59406432 markings, 570483726 edges, 96419 markings/sec, 450 secs
lola: 59933895 markings, 576694521 edges, 105493 markings/sec, 455 secs
lola: 60355513 markings, 583103944 edges, 84324 markings/sec, 460 secs
lola: 60764708 markings, 589378877 edges, 81839 markings/sec, 465 secs
lola: 61147594 markings, 595547714 edges, 76577 markings/sec, 470 secs
lola: 61501467 markings, 601872260 edges, 70775 markings/sec, 475 secs
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 61556225 markings, 603213363 edges
lola: ========================================
lola: subprocess 14 will run for 880 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (((1 <= p6) AND (1 <= p82) AND (1 <= p101) AND (1 <= p118)) AND (E (G (((1 <= p11) AND (1 <= p91) AND (1 <= p105) AND (1 <= p119)))) OR ((p13 <= 0) OR ((p93 <= 0) OR ((p110 <= 0) OR (p121 <= 0))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 14 will run for 880 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((p13 <= 0) OR ((p93 <= 0) OR ((p110 <= 0) OR (p121 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: rewrite Frontend/Parser/formula_rewrite.k:797
lola: rewrite Frontend/Parser/formula_rewrite.k:797
lola: rewrite Frontend/Parser/formula_rewrite.k:798
lola: rewrite Frontend/Parser/formula_rewrite.k:797
lola: rewrite Frontend/Parser/formula_rewrite.k:798
lola: processed formula: ((p13 <= 0) OR (p93 <= 0) OR (p110 <= 0) OR (p121 <= 0))
lola: processed formula length: 56
lola: 75 rewrites
lola: closed formula file CTLFireability.xml
lola: processed formula with 4 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: subprocess 15 will run for 1761 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ========================================
lola: ...considering subproblem: ((1 <= p6) AND (1 <= p82) AND (1 <= p101) AND (1 <= p118))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((1 <= p6) AND (1 <= p82) AND (1 <= p101) AND (1 <= p118))
lola: processed formula length: 58
lola: 70 rewrites
lola: closed formula file CTLFireability.xml
lola: processed formula with 4 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: 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: subprocess 15 will run for 1761 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E (F (((1 <= p3) AND (1 <= p83) AND (1 <= p96) AND (1 <= p115)))) AND ((1 <= p8) AND ((1 <= p92) AND ((1 <= p106) AND ((1 <= p120) AND (A (F (((p9 <= 0) OR (p89 <= 0) OR (p105 <= 0) OR (p117 <= 0) OR ((1 <= p5) AND (1 <= p81) AND (1 <= p100) AND (1 <= p113))))) AND (A (F (((p10 <= 0) OR (p90 <= 0) OR (p104 <= 0) OR (p114 <= 0)))) OR ((p1 <= 0) OR ((p81 <= 0) OR ((p97 <= 0) OR (p117 <= 0)))... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 15 will run for 1761 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((p1 <= 0) OR ((p81 <= 0) OR ((p97 <= 0) OR (p117 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: rewrite Frontend/Parser/formula_rewrite.k:797
lola: rewrite Frontend/Parser/formula_rewrite.k:797
lola: rewrite Frontend/Parser/formula_rewrite.k:798
lola: rewrite Frontend/Parser/formula_rewrite.k:797
lola: rewrite Frontend/Parser/formula_rewrite.k:798
lola: processed formula: ((p1 <= 0) OR (p81 <= 0) OR (p97 <= 0) OR (p117 <= 0))
lola: processed formula length: 54
lola: 75 rewrites
lola: closed formula file CTLFireability.xml
lola: processed formula with 4 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 17 will run for 1 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (1 <= p106)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (1 <= p106)
lola: processed formula length: 11
lola: 70 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 18 will run for 1 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (1 <= p92)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (1 <= p92)
lola: processed formula length: 10
lola: 70 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 19 will run for 1 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (1 <= p8)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (1 <= p8)
lola: processed formula length: 9
lola: 70 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 20 will run for 1 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (((p10 <= 0) OR (p90 <= 0) OR (p104 <= 0) OR (p114 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:584
lola: rewrite Frontend/Parser/formula_rewrite.k:749
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: ((1 <= p10) AND (1 <= p90) AND (1 <= p104) AND (1 <= p114))
lola: processed formula length: 59
lola: 73 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:700
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((p10 <= 0) OR (p90 <= 0) OR (p104 <= 0) OR (p114 <= 0))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 4 literals and 4 conjunctive subformulas
lola: state equation: write sara problem file to CTLFireability-20-0.sara
lola: state equation: calling and running sara
sara: try reading problem file CTLFireability-20-0.sara.
sara: place or transition ordering is non-deterministic
lola: state equation 0: solution produced
lola: local time limit reached - aborting
lola:
preliminary result: no no no no yes unknown no unknown no no yes unknown no unknown no no
lola: memory consumption: 58824 KB
lola: time consumption: 1810 seconds
lola: print data as JSON (--json)
lola: writing JSON to CTLFireability.json
lola: closed JSON file CTLFireability.json
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 21 will run for 1 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((1 <= p3) AND (1 <= p83) AND (1 <= p96) AND (1 <= p115))))
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 <= p3) AND (1 <= p83) AND (1 <= p96) AND (1 <= p115))))
lola: processed formula length: 65
lola: 71 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: state equation task get result rewrite finished id 0
lola: The predicate is reachable.
lola: state equation task get result unparse finished++ id 0
lola: 0 markings, 0 edges
lola: formula 0: ((1 <= p3) AND (1 <= p83) AND (1 <= p96) AND (1 <= p115))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 4 literals and 1 conjunctive subformulas
lola: subprocess 22 will run for 1 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (((p9 <= 0) OR (p89 <= 0) OR (p105 <= 0) OR (p117 <= 0) OR ((1 <= p5) AND (1 <= p81) AND (1 <= p100) AND (1 <= p113)))))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:584
lola: rewrite Frontend/Parser/formula_rewrite.k:749
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: ((1 <= p9) AND (1 <= p89) AND (1 <= p105) AND (1 <= p117) AND ((p5 <= 0) OR (p81 <= 0) OR (p100 <= 0) OR (p113 <= 0)))
lola: processed formula length: 121
lola: 73 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: SUBRESULT
lola: result: yes
lola: produced by: state space / EG
lola: The predicate eventually occurs.
lola: 1 markings, 0 edges
lola: ========================================
lola: SUBRESULT
lola: result: unknown
lola: The Boolean predicate may be true or false.
lola: ========================================
lola: ========================================
lola: ========================================
lola: ...considering subproblem: (E ((E (X (((1 <= p5) AND (1 <= p85) AND (1 <= p103) AND (1 <= p125)))) U E (G (((1 <= p7) AND (1 <= p87) AND (1 <= p102) AND (1 <= p123)))))) OR (A (F (((p13 <= 0) OR (p93 <= 0) OR (p110 <= 0) OR (p121 <= 0)))) AND (A (X ((((1 <= p13) AND (1 <= p89) AND (1 <= p108) AND (1 <= p113)) OR ((1 <= p15) AND (1 <= p95) AND (1 <= p111) AND (1 <= p127))))) AND (E (F (((1 <= p14) AND (1 <= p90) AND (1 <... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:807
lola: rewrite Frontend/Parser/formula_rewrite.k:808
lola: rewrite Frontend/Parser/formula_rewrite.k:809
lola: rewrite Frontend/Parser/formula_rewrite.k:811
lola: rewrite Frontend/Parser/formula_rewrite.k:812
lola: rewrite Frontend/Parser/formula_rewrite.k:806
lola: rewrite Frontend/Parser/formula_rewrite.k:811
lola: rewrite Frontend/Parser/formula_rewrite.k:806
lola: processed formula: (E(EX(((1 <= p5) AND (1 <= p85) AND (1 <= p103) AND (1 <= p125))) U EG(((1 <= p7) AND (1 <= p87) AND (1 <= p102) AND (1 <= p123)))) OR (AF(((p13 <= 0) OR (p93 <= 0) OR (p110 <= 0) OR (p121 <= 0))) AND (AX((((1 <= p13) AND (1 <= p89) AND (1 <= p108) AND (1 <= p113)) OR ((1 <= p15) AND (1 <= p95) AND (1 <= p111) AND (1 <= p127)))) AND (EF(((1 <= p14) AND (1 <= p90) AND (1 <= p108) AND (1 <= p114... (shortened)
lola: processed formula length: 612
lola: 78 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 6 significant temporal operators and needs 26 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: 2457677 markings, 6547260 edges, 491535 markings/sec, 0 secs
lola: 4615052 markings, 12578703 edges, 431475 markings/sec, 5 secs
lola: 6394760 markings, 18362397 edges, 355942 markings/sec, 10 secs
lola: 8448013 markings, 23895583 edges, 410651 markings/sec, 15 secs
lola: 10418406 markings, 29316407 edges, 394079 markings/sec, 20 secs
lola: 12167273 markings, 34698664 edges, 349773 markings/sec, 25 secs
lola: 14268642 markings, 39728630 edges, 420274 markings/sec, 30 secs
lola: 16367937 markings, 44436235 edges, 419859 markings/sec, 35 secs
lola: 18454918 markings, 49713441 edges, 417396 markings/sec, 40 secs
lola: 20541373 markings, 54433372 edges, 417291 markings/sec, 45 secs
lola: 22682846 markings, 59336767 edges, 428295 markings/sec, 50 secs
lola: 24912043 markings, 65007064 edges, 445839 markings/sec, 55 secs
lola: 26855140 markings, 69627641 edges, 388619 markings/sec, 60 secs
lola: 28753464 markings, 74461278 edges, 379665 markings/sec, 65 secs
lola: 30739973 markings, 79579675 edges, 397302 markings/sec, 70 secs
lola: 32484202 markings, 84322725 edges, 348846 markings/sec, 75 secs
lola: 34189815 markings, 89528464 edges, 341123 markings/sec, 80 secs
lola: 34782693 markings, 94167405 edges, 118576 markings/sec, 85 secs
lola: 35098001 markings, 98734848 edges, 63062 markings/sec, 90 secs
lola: 35381983 markings, 103167862 edges, 56796 markings/sec, 95 secs
lola: 35665358 markings, 107335794 edges, 56675 markings/sec, 100 secs
lola: 36213763 markings, 111309310 edges, 109681 markings/sec, 105 secs
lola: 37116292 markings, 115079189 edges, 180506 markings/sec, 110 secs
lola: 37971157 markings, 118940927 edges, 170973 markings/sec, 115 secs
lola: 38773692 markings, 122402373 edges, 160507 markings/sec, 120 secs
lola: 39174267 markings, 126422868 edges, 80115 markings/sec, 125 secs
lola: 39454585 markings, 130599281 edges, 56064 markings/sec, 130 secs
lola: 39726620 markings, 134729425 edges, 54407 markings/sec, 135 secs
lola: 39993919 markings, 138784760 edges, 53460 markings/sec, 140 secs
lola: 40354381 markings, 142719676 edges, 72092 markings/sec, 145 secs
lola: 41258847 markings, 146429504 edges, 180893 markings/sec, 150 secs
lola: 42152464 markings, 150373008 edges, 178723 markings/sec, 155 secs
lola: 42963475 markings, 153921267 edges, 162202 markings/sec, 160 secs
lola: 43528709 markings, 157675187 edges, 113047 markings/sec, 165 secs
lola: 43892691 markings, 161642645 edges, 72796 markings/sec, 170 secs
lola: 44250055 markings, 165308351 edges, 71473 markings/sec, 175 secs
lola: 44571266 markings, 169213032 edges, 64242 markings/sec, 180 secs
lola: 44876128 markings, 172815286 edges, 60972 markings/sec, 185 secs
lola: 45234494 markings, 176891108 edges, 71673 markings/sec, 190 secs
lola: 45593349 markings, 180540577 edges, 71771 markings/sec, 195 secs
lola: 45924610 markings, 184560850 edges, 66252 markings/sec, 200 secs
lola: 46261136 markings, 188395839 edges, 67305 markings/sec, 205 secs
lola: 46581089 markings, 192305284 edges, 63991 markings/sec, 210 secs
lola: 46867042 markings, 196284963 edges, 57191 markings/sec, 215 secs
lola: 47173973 markings, 200449961 edges, 61386 markings/sec, 220 secs
lola: 47485938 markings, 204106255 edges, 62393 markings/sec, 225 secs
lola: 47798823 markings, 207613022 edges, 62577 markings/sec, 230 secs
lola: 48102375 markings, 211180728 edges, 60710 markings/sec, 235 secs
lola: 48386474 markings, 214574349 edges, 56820 markings/sec, 240 secs
lola: 48558299 markings, 219490644 edges, 34365 markings/sec, 245 secs
lola: 48685149 markings, 225154791 edges, 25370 markings/sec, 250 secs
lola: 48804194 markings, 230451630 edges, 23809 markings/sec, 255 secs
lola: 48914740 markings, 235726303 edges, 22109 markings/sec, 260 secs
lola: 49041430 markings, 241000321 edges, 25338 markings/sec, 265 secs
lola: 49369908 markings, 246096041 edges, 65696 markings/sec, 270 secs
lola: 49889793 markings, 251045668 edges, 103977 markings/sec, 275 secs
lola: 50454210 markings, 256001320 edges, 112883 markings/sec, 280 secs
lola: 50690528 markings, 260940362 edges, 47264 markings/sec, 285 secs
lola: 50901938 markings, 265651952 edges, 42282 markings/sec, 290 secs
lola: 51132717 markings, 270512295 edges, 46156 markings/sec, 295 secs
lola: 51370584 markings, 275681685 edges, 47573 markings/sec, 300 secs
lola: 51617709 markings, 281393995 edges, 49425 markings/sec, 305 secs
lola: 51827584 markings, 286125598 edges, 41975 markings/sec, 310 secs
lola: 52066946 markings, 291293427 edges, 47872 markings/sec, 315 secs
lola: 52290651 markings, 296535988 edges, 44741 markings/sec, 320 secs
lola: 52525954 markings, 301601505 edges, 47061 markings/sec, 325 secs
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 52738456 markings, 306656968 edges
lola: ========================================
lola: ========================================
lola: ...considering subproblem: E (F (A (G (((1 <= p0) AND (1 <= p84) AND (1 <= p98) AND (1 <= p120))))))
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: ((p0 <= 0) OR (p84 <= 0) OR (p98 <= 0) OR (p120 <= 0))
lola: processed formula length: 57
lola: 74 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 unparse finished++ id 0
lola: formula 0: ((1 <= p0) AND (1 <= p84) AND (1 <= p98) AND (1 <= p120))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 4 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to CTLFireability-17-0.sara
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: ((p0 <= 0) OR (p84 <= 0) OR (p98 <= 0) OR (p120 <= 0))
lola: state equation task get result unparse finished id 1
lola: state equation: Generated DNF with 4 literals and 4 conjunctive subformulas
lola: state equation: write sara problem file to CTLFireability-17-1.sara
lola: state equation: calling and running sara
sara: try reading problem file CTLFireability-17-1.sara.
sara: place or transition ordering is non-deterministic
lola: state equation 1: solution produced
lola: sara is running 0 secs || sara is running 0 secs || 1161028 markings, 8177372 edges, 232206 markings/sec, 0 secs
lola: sara is running 5 secs || sara is running 5 secs || 2211053 markings, 15708519 edges, 210005 markings/sec, 5 secs
lola: sara is running 10 secs || sara is running 10 secs || 3243613 markings, 23014025 edges, 206512 markings/sec, 10 secs
lola: sara is running 15 secs || sara is running 15 secs || 4270522 markings, 30162860 edges, 205382 markings/sec, 15 secs
lola: sara is running 20 secs || sara is running 20 secs || 5176580 markings, 37135496 edges, 181212 markings/sec, 20 secs
lola: sara is running 25 secs || sara is running 25 secs || 6023488 markings, 43964912 edges, 169382 markings/sec, 25 secs
lola: sara is running 30 secs || sara is running 30 secs || 6933255 markings, 51271458 edges, 181953 markings/sec, 30 secs
lola: sara is running 35 secs || sara is running 35 secs || 7707086 markings, 58337160 edges, 154766 markings/sec, 35 secs
lola: sara is running 40 secs || sara is running 40 secs || 8414023 markings, 65642185 edges, 141387 markings/sec, 40 secs
lola: sara is running 45 secs || sara is running 45 secs || 9424690 markings, 72847281 edges, 202133 markings/sec, 45 secs
lola: sara is running 50 secs || sara is running 50 secs || 10386705 markings, 79774325 edges, 192403 markings/sec, 50 secs
lola: sara is running 55 secs || sara is running 55 secs || 11372764 markings, 86512292 edges, 197212 markings/sec, 55 secs
lola: sara is running 60 secs || sara is running 60 secs || 12318203 markings, 93192592 edges, 189088 markings/sec, 60 secs
lola: sara is running 65 secs || sara is running 65 secs || 13129367 markings, 99737762 edges, 162233 markings/sec, 65 secs
lola: sara is running 70 secs || sara is running 70 secs || 13983627 markings, 106104354 edges, 170852 markings/sec, 70 secs
lola: sara is running 75 secs || sara is running 75 secs || 14846760 markings, 113055277 edges, 172627 markings/sec, 75 secs
lola: sara is running 80 secs || sara is running 80 secs || 15586996 markings, 119534283 edges, 148047 markings/sec, 80 secs
lola: sara is running 85 secs || sara is running 85 secs || 16269724 markings, 126298586 edges, 136546 markings/sec, 85 secs
lola: sara is running 90 secs || sara is running 90 secs || 17123466 markings, 133213996 edges, 170748 markings/sec, 90 secs
lola: sara is running 95 secs || sara is running 95 secs || 18075533 markings, 139889104 edges, 190413 markings/sec, 95 secs
lola: sara is running 100 secs || sara is running 100 secs || 18931425 markings, 146248986 edges, 171178 markings/sec, 100 secs
lola: sara is running 105 secs || sara is running 105 secs || 19833736 markings, 152641168 edges, 180462 markings/sec, 105 secs
lola: sara is running 110 secs || sara is running 110 secs || 20747338 markings, 158924189 edges, 182720 markings/sec, 110 secs
lola: sara is running 115 secs || sara is running 115 secs || 21506086 markings, 165027139 edges, 151750 markings/sec, 115 secs
lola: sara is running 120 secs || sara is running 120 secs || 22292061 markings, 171086979 edges, 157195 markings/sec, 120 secs
lola: sara is running 125 secs || sara is running 125 secs || 23128575 markings, 177704494 edges, 167303 markings/sec, 125 secs
lola: sara is running 130 secs || sara is running 130 secs || 23788929 markings, 183673905 edges, 132071 markings/sec, 130 secs
lola: sara is running 135 secs || sara is running 135 secs || 24428826 markings, 189961198 edges, 127979 markings/sec, 135 secs
lola: sara is running 140 secs || sara is running 140 secs || 25139314 markings, 196291342 edges, 142098 markings/sec, 140 secs
lola: sara is running 145 secs || sara is running 145 secs || 25974445 markings, 202413005 edges, 167026 markings/sec, 145 secs
lola: sara is running 150 secs || sara is running 150 secs || 26850397 markings, 208563243 edges, 175190 markings/sec, 150 secs
lola: sara is running 155 secs || sara is running 155 secs || 27736173 markings, 214571180 edges, 177155 markings/sec, 155 secs
lola: sara is running 160 secs || sara is running 160 secs || 28499834 markings, 220403092 edges, 152732 markings/sec, 160 secs
lola: sara is running 165 secs || sara is running 165 secs || 29340438 markings, 226378341 edges, 168121 markings/sec, 165 secs
lola: sara is running 170 secs || sara is running 170 secs || 30067788 markings, 232088111 edges, 145470 markings/sec, 170 secs
lola: sara is running 175 secs || sara is running 175 secs || 30818480 markings, 237778891 edges, 150138 markings/sec, 175 secs
lola: sara is running 180 secs || sara is running 180 secs || 31549383 markings, 243811279 edges, 146181 markings/sec, 180 secs
lola: sara is running 185 secs || sara is running 185 secs || 32174537 markings, 249579235 edges, 125031 markings/sec, 185 secs
lola: sara is running 190 secs || sara is running 190 secs || 32734365 markings, 255458486 edges, 111966 markings/sec, 190 secs
lola: sara is running 195 secs || sara is running 195 secs || 33578323 markings, 262704122 edges, 168792 markings/sec, 195 secs
lola: sara is running 200 secs || sara is running 200 secs || 34566499 markings, 270250400 edges, 197635 markings/sec, 200 secs
lola: sara is running 205 secs || sara is running 205 secs || 35510345 markings, 277559417 edges, 188769 markings/sec, 205 secs
lola: sara is running 210 secs || sara is running 210 secs || 36369993 markings, 284658547 edges, 171930 markings/sec, 210 secs
lola: sara is running 215 secs || sara is running 215 secs || 37126653 markings, 291937517 edges, 151332 markings/sec, 215 secs
lola: sara is running 220 secs || sara is running 220 secs || 37977417 markings, 299399428 edges, 170153 markings/sec, 220 secs
lola: sara is running 225 secs || sara is running 225 secs || 38915166 markings, 306490016 edges, 187550 markings/sec, 225 secs
lola: sara is running 230 secs || sara is running 230 secs || 39791885 markings, 313347584 edges, 175344 markings/sec, 230 secs
lola: sara is running 235 secs || sara is running 235 secs || 40602842 markings, 319956717 edges, 162191 markings/sec, 235 secs
lola: sara is running 240 secs || sara is running 240 secs || 41362726 markings, 326805354 edges, 151977 markings/sec, 240 secs
lola: sara is running 245 secs || sara is running 245 secs || 42049813 markings, 333908465 edges, 137417 markings/sec, 245 secs
lola: sara is running 250 secs || sara is running 250 secs || 42870590 markings, 340690615 edges, 164155 markings/sec, 250 secs
lola: sara is running 255 secs || sara is running 255 secs || 43634855 markings, 347211992 edges, 152853 markings/sec, 255 secs
lola: sara is running 260 secs || sara is running 260 secs || 44341536 markings, 353830130 edges, 141336 markings/sec, 260 secs
lola: sara is running 265 secs || sara is running 265 secs || 45066833 markings, 360464247 edges, 145059 markings/sec, 265 secs
lola: sara is running 270 secs || sara is running 270 secs || 45837492 markings, 366768674 edges, 154132 markings/sec, 270 secs
lola: sara is running 275 secs || sara is running 275 secs || 46533147 markings, 372843777 edges, 139131 markings/sec, 275 secs
lola: sara is running 280 secs || sara is running 280 secs || 47161071 markings, 378982400 edges, 125585 markings/sec, 280 secs
lola: sara is running 285 secs || sara is running 285 secs || 47877597 markings, 385508205 edges, 143305 markings/sec, 285 secs
lola: sara is running 290 secs || sara is running 290 secs || 48610593 markings, 391629925 edges, 146599 markings/sec, 290 secs
lola: sara is running 295 secs || sara is running 295 secs || 49322675 markings, 397678499 edges, 142416 markings/sec, 295 secs
lola: sara is running 300 secs || sara is running 300 secs || 49943253 markings, 403760414 edges, 124116 markings/sec, 300 secs
lola: sara is running 305 secs || sara is running 305 secs || 50606251 markings, 409941108 edges, 132600 markings/sec, 305 secs
lola: sara is running 310 secs || sara is running 310 secs || 51251623 markings, 415622317 edges, 129074 markings/sec, 310 secs
lola: sara is running 315 secs || sara is running 315 secs || 51861781 markings, 421771132 edges, 122032 markings/sec, 315 secs
lola: sara is running 320 secs || sara is running 320 secs || 52540874 markings, 427642715 edges, 135819 markings/sec, 320 secs
lola: sara is running 325 secs || sara is running 325 secs || 53172083 markings, 433535742 edges, 126242 markings/sec, 325 secs
lola: sara is running 330 secs || sara is running 330 secs || 53873603 markings, 438869760 edges, 140304 markings/sec, 330 secs
lola: sara is running 335 secs || sara is running 335 secs || 54759562 markings, 443996182 edges, 177192 markings/sec, 335 secs
lola: sara is running 340 secs || sara is running 340 secs || 55246274 markings, 449124662 edges, 97342 markings/sec, 340 secs
lola: sara is running 345 secs || sara is running 345 secs || 56121861 markings, 454206089 edges, 175117 markings/sec, 345 secs
lola: sara is running 350 secs || sara is running 350 secs || 56841772 markings, 459482760 edges, 143982 markings/sec, 350 secs
lola: sara is running 355 secs || sara is running 355 secs || 57362376 markings, 464693521 edges, 104121 markings/sec, 355 secs
lola: sara is running 360 secs || sara is running 360 secs || 57869470 markings, 469948658 edges, 101419 markings/sec, 360 secs
lola: sara is running 365 secs || sara is running 365 secs || 58431854 markings, 475305812 edges, 112477 markings/sec, 365 secs
lola: sara is running 370 secs || sara is running 370 secs || 59006985 markings, 480673084 edges, 115026 markings/sec, 370 secs
lola: sara is running 375 secs || sara is running 375 secs || 59495315 markings, 486101698 edges, 97666 markings/sec, 375 secs
lola: sara is running 380 secs || sara is running 380 secs || 60002840 markings, 491705363 edges, 101505 markings/sec, 380 secs
lola: sara is running 385 secs || sara is running 385 secs || 60447150 markings, 496948513 edges, 88862 markings/sec, 385 secs
lola: sara is running 390 secs || sara is running 390 secs || 60889291 markings, 502327429 edges, 88428 markings/sec, 390 secs
lola: sara is running 395 secs || sara is running 395 secs || 61285338 markings, 507855012 edges, 79209 markings/sec, 395 secs
lola: SUBRESULT
lola: result: no
lola: produced by: parallel
lola: The predicate is not possibly invariant.
lola: 61537073 markings, 512291848 edges
lola: ========================================
lola: ========================================
lola: ...considering subproblem: (((1 <= p6) AND (1 <= p82) AND (1 <= p101) AND (1 <= p118)) AND (E (G (((1 <= p11) AND (1 <= p91) AND (1 <= p105) AND (1 <= p119)))) OR ((p13 <= 0) OR ((p93 <= 0) OR ((p110 <= 0) OR (p121 <= 0))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: ...considering subproblem: ((p13 <= 0) OR ((p93 <= 0) OR ((p110 <= 0) OR (p121 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: rewrite Frontend/Parser/formula_rewrite.k:797
lola: rewrite Frontend/Parser/formula_rewrite.k:797
lola: rewrite Frontend/Parser/formula_rewrite.k:798
lola: rewrite Frontend/Parser/formula_rewrite.k:797
lola: rewrite Frontend/Parser/formula_rewrite.k:798
lola: processed formula: ((p13 <= 0) OR (p93 <= 0) OR (p110 <= 0) OR (p121 <= 0))
lola: processed formula length: 56
lola: 75 rewrites
lola: closed formula file CTLFireability.xml
lola: processed formula with 4 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: ========================================
lola: ...considering subproblem: ((1 <= p6) AND (1 <= p82) AND (1 <= p101) AND (1 <= p118))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((1 <= p6) AND (1 <= p82) AND (1 <= p101) AND (1 <= p118))
lola: processed formula length: 58
lola: 70 rewrites
lola: closed formula file CTLFireability.xml
lola: processed formula with 4 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: ========================================
lola: ...considering subproblem: E (G (((1 <= p11) AND (1 <= p91) AND (1 <= p105) AND (1 <= p119))))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation
lola: rewrite Frontend/Parser/formula_rewrite.k:583
lola: processed formula: E (G (((1 <= p11) AND (1 <= p91) AND (1 <= p105) AND (1 <= p119))))
lola: processed formula length: 67
lola: 71 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: ((p11 <= 0) OR (p91 <= 0) OR (p105 <= 0) OR (p119 <= 0))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 4 literals and 4 conjunctive subformulas
lola: state equation: write sara problem file to CTLFireability-20-0.sara
lola: state equation: calling and running sara
sara: try reading problem file CTLFireability-20-0.sara.
sara: place or transition ordering is non-deterministic
lola: state equation 0: solution produced
lola: 1178092 markings, 4873177 edges, 235618 markings/sec, 0 secs || sara is running 0 secs
lola: 2099860 markings, 9616709 edges, 184354 markings/sec, 5 secs || sara is running 5 secs
lola: 3162053 markings, 14172172 edges, 212439 markings/sec, 10 secs || sara is running 10 secs
lola: 4022004 markings, 18746627 edges, 171990 markings/sec, 15 secs || sara is running 15 secs
lola: 4880645 markings, 23331472 edges, 171728 markings/sec, 20 secs || sara is running 20 secs
lola: 5770586 markings, 28070300 edges, 177988 markings/sec, 25 secs || sara is running 25 secs
lola: 6606245 markings, 32895272 edges, 167132 markings/sec, 30 secs || sara is running 30 secs
lola: 7402730 markings, 37700980 edges, 159297 markings/sec, 35 secs || sara is running 35 secs
lola: 8021713 markings, 42684063 edges, 123797 markings/sec, 40 secs || sara is running 40 secs
lola: SUBRESULT
lola: result: no
lola: produced by: state space / EG
lola: The predicate is not possibly preserved.
lola: 8165994 markings, 44459495 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: ========================================
lola: ...considering subproblem: (E (F (((1 <= p3) AND (1 <= p83) AND (1 <= p96) AND (1 <= p115)))) AND ((1 <= p8) AND ((1 <= p92) AND ((1 <= p106) AND ((1 <= p120) AND (A (F (((p9 <= 0) OR (p89 <= 0) OR (p105 <= 0) OR (p117 <= 0) OR ((1 <= p5) AND (1 <= p81) AND (1 <= p100) AND (1 <= p113))))) AND (A (F (((p10 <= 0) OR (p90 <= 0) OR (p104 <= 0) OR (p114 <= 0)))) OR ((p1 <= 0) OR ((p81 <= 0) OR ((p97 <= 0) OR (p117 <= 0)))... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: ...considering subproblem: ((p1 <= 0) OR ((p81 <= 0) OR ((p97 <= 0) OR (p117 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: rewrite Frontend/Parser/formula_rewrite.k:797
lola: rewrite Frontend/Parser/formula_rewrite.k:797
lola: rewrite Frontend/Parser/formula_rewrite.k:798
lola: rewrite Frontend/Parser/formula_rewrite.k:797
lola: rewrite Frontend/Parser/formula_rewrite.k:798
lola: processed formula: ((p1 <= 0) OR (p81 <= 0) OR (p97 <= 0) OR (p117 <= 0))
lola: processed formula length: 54
lola: 75 rewrites
lola: closed formula file CTLFireability.xml
lola: processed formula with 4 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: ========================================
lola: ...considering subproblem: (1 <= p120)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (1 <= p120)
lola: processed formula length: 11
lola: 70 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: ========================================
lola: ...considering subproblem: (1 <= p106)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (1 <= p106)
lola: processed formula length: 11
lola: 70 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: ========================================
lola: ...considering subproblem: (1 <= p92)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (1 <= p92)
lola: processed formula length: 10
lola: 70 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: ========================================
lola: ...considering subproblem: (1 <= p8)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (1 <= p8)
lola: processed formula length: 9
lola: 70 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: ========================================
lola: ...considering subproblem: A (F (((p10 <= 0) OR (p90 <= 0) OR (p104 <= 0) OR (p114 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:584
lola: rewrite Frontend/Parser/formula_rewrite.k:749
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: ((1 <= p10) AND (1 <= p90) AND (1 <= p104) AND (1 <= p114))
lola: processed formula length: 59
lola: 73 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:700
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((p10 <= 0) OR (p90 <= 0) OR (p104 <= 0) OR (p114 <= 0))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 4 literals and 4 conjunctive subformulas
lola: state equation: write sara problem file to CTLFireability-24-0.sara
lola: state equation: calling and running sara
sara: try reading problem file CTLFireability-24-0.sara.
sara: place or transition ordering is non-deterministic
lola: state equation 0: solution produced
lola: 1069399 markings, 4932322 edges, 213880 markings/sec, 0 secs || sara is running 0 secs
lola: 2060029 markings, 9667692 edges, 198126 markings/sec, 5 secs || sara is running 5 secs
lola: 3024484 markings, 14234192 edges, 192891 markings/sec, 10 secs || sara is running 10 secs
lola: 4003447 markings, 18719992 edges, 195793 markings/sec, 15 secs || sara is running 15 secs
lola: 4898135 markings, 23294821 edges, 178938 markings/sec, 20 secs || sara is running 20 secs
lola: 5720275 markings, 27739786 edges, 164428 markings/sec, 25 secs || sara is running 25 secs
lola: 6509063 markings, 32196000 edges, 157758 markings/sec, 30 secs || sara is running 30 secs
lola: 7261372 markings, 36854161 edges, 150462 markings/sec, 35 secs || sara is running 35 secs
lola: 7923701 markings, 41680978 edges, 132466 markings/sec, 40 secs || sara is running 40 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: state space / EG
lola: The predicate eventually occurs.
lola: 8165738 markings, 44443759 edges
lola: ========================================
lola: ========================================
lola: ...considering subproblem: E (F (((1 <= p3) AND (1 <= p83) AND (1 <= p96) AND (1 <= p115))))
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 <= p3) AND (1 <= p83) AND (1 <= p96) AND (1 <= p115))))
lola: processed formula length: 65
lola: 71 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: 0 markings, 0 edges
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 <= p3) AND (1 <= p83) AND (1 <= p96) AND (1 <= p115))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 4 literals and 1 conjunctive subformulas
lola: ========================================
lola: ========================================
lola: ...considering subproblem: A (F (((p9 <= 0) OR (p89 <= 0) OR (p105 <= 0) OR (p117 <= 0) OR ((1 <= p5) AND (1 <= p81) AND (1 <= p100) AND (1 <= p113)))))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:584
lola: rewrite Frontend/Parser/formula_rewrite.k:749
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: ((1 <= p9) AND (1 <= p89) AND (1 <= p105) AND (1 <= p117) AND ((p5 <= 0) OR (p81 <= 0) OR (p100 <= 0) OR (p113 <= 0)))
lola: processed formula length: 121
lola: 73 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:700
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((p9 <= 0) OR (p89 <= 0) OR (p105 <= 0) OR (p117 <= 0) OR ((1 <= p5) AND (1 <= p81) AND (1 <= p100) AND (1 <= p113)))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 8 literals and 5 conjunctive subformulas
lola: state equation: write sara problem file to CTLFireability-26-0.sara
lola: state equation: calling and running sara
sara: try reading problem file CTLFireability-26-0.sara.
sara: place or transition ordering is non-deterministic
lola: SUBRESULT
lola: result: yes
lola: produced by: state space / EG
lola: The predicate eventually occurs.
lola: 1 markings, 0 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: RESULT
lola:
SUMMARY: no no no no yes no no no no no yes no no yes no no
lola:
preliminary result: no no no no yes no no no no no yes no no yes no no
lola: memory consumption: 48640 KB
lola: time consumption: 2643 seconds
lola: print data as JSON (--json)
lola: writing JSON to CTLFireability.json
lola: closed JSON file CTLFireability.json
rslt: finished
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16427332 kB
MemFree: 16112472 kB
After kill :
MemTotal: 16427332 kB
MemFree: 16112536 kB
--------------------
content from stderr:
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="Sudoku-PT-BN04"
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 Sudoku-PT-BN04, 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 r228-oct2-159033547600452"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/Sudoku-PT-BN04.tgz
mv Sudoku-PT-BN04 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 ;