About the Execution of ITS-LoLa for NoC3x3-PT-1A
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 15742.650 | 3600000.00 | 1243316.00 | 2090.40 | ?T?TF??TTTT???TT | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/local/x2003239/mcc2020-input.r174-csrt-158987853000332.qcow2', fmt=qcow2 size=4294967296 backing_file=/local/x2003239/mcc2020-input.qcow2 encryption=off 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 NoC3x3-PT-1A, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r174-csrt-158987853000332
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 260K
-rw-r--r-- 1 mcc users 3.0K Apr 8 15:00 CTLCardinality.txt
-rw-r--r-- 1 mcc users 17K Apr 8 15:00 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Apr 7 18:30 CTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 7 18:30 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 24 05:37 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 5.7K Mar 24 05:37 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K Apr 14 12:42 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 28 14:01 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K Apr 14 12:42 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 28 14:01 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K Apr 6 20:15 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 17K Apr 6 20:15 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Apr 6 03:57 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 6 03:57 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K Apr 6 20:25 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Apr 6 20:25 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 24 05:37 instance
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 iscolored
-rw-r--r-- 1 mcc users 81K Mar 24 05:37 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of booleans
BOOL_VECTOR
here is the order used to build the result vector(from text file)
FORMULA_NAME NoC3x3-PT-1A-CTLFireability-00
FORMULA_NAME NoC3x3-PT-1A-CTLFireability-01
FORMULA_NAME NoC3x3-PT-1A-CTLFireability-02
FORMULA_NAME NoC3x3-PT-1A-CTLFireability-03
FORMULA_NAME NoC3x3-PT-1A-CTLFireability-04
FORMULA_NAME NoC3x3-PT-1A-CTLFireability-05
FORMULA_NAME NoC3x3-PT-1A-CTLFireability-06
FORMULA_NAME NoC3x3-PT-1A-CTLFireability-07
FORMULA_NAME NoC3x3-PT-1A-CTLFireability-08
FORMULA_NAME NoC3x3-PT-1A-CTLFireability-09
FORMULA_NAME NoC3x3-PT-1A-CTLFireability-10
FORMULA_NAME NoC3x3-PT-1A-CTLFireability-11
FORMULA_NAME NoC3x3-PT-1A-CTLFireability-12
FORMULA_NAME NoC3x3-PT-1A-CTLFireability-13
FORMULA_NAME NoC3x3-PT-1A-CTLFireability-14
FORMULA_NAME NoC3x3-PT-1A-CTLFireability-15
=== Now, execution of the tool begins
BK_START 1591140568669
bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-02 23:29:30] [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-02 23:29:30] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-02 23:29:31] [INFO ] Load time of PNML (sax parser for PT used): 89 ms
[2020-06-02 23:29:31] [INFO ] Transformed 165 places.
[2020-06-02 23:29:31] [INFO ] Transformed 355 transitions.
[2020-06-02 23:29:31] [INFO ] Found NUPN structural information;
[2020-06-02 23:29:31] [INFO ] Parsed PT model containing 165 places and 355 transitions in 155 ms.
Ensure Unique test removed 108 transitions
Reduce redundant transitions removed 108 transitions.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 42 ms.
Incomplete random walk after 100000 steps, including 0 resets, run finished after 325 ms. (steps per millisecond=307 ) properties seen :[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1]
[2020-06-02 23:29:31] [INFO ] Flow matrix only has 213 transitions (discarded 34 similar events)
// Phase 1: matrix 213 rows 165 cols
[2020-06-02 23:29:31] [INFO ] Computed 40 place invariants in 26 ms
[2020-06-02 23:29:31] [INFO ] [Real]Absence check using 40 positive place invariants in 36 ms returned sat
[2020-06-02 23:29:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-02 23:29:32] [INFO ] [Real]Absence check using state equation in 151 ms returned sat
[2020-06-02 23:29:32] [INFO ] State equation strengthened by 20 read => feed constraints.
[2020-06-02 23:29:32] [INFO ] [Real]Added 20 Read/Feed constraints in 26 ms returned sat
[2020-06-02 23:29:32] [INFO ] Computed and/alt/rep : 246/1189/212 causal constraints in 52 ms.
[2020-06-02 23:29:32] [INFO ] Solution in real domain found non-integer solution.
[2020-06-02 23:29:32] [INFO ] [Nat]Absence check using 40 positive place invariants in 26 ms returned sat
[2020-06-02 23:29:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-02 23:29:32] [INFO ] [Nat]Absence check using state equation in 135 ms returned sat
[2020-06-02 23:29:32] [INFO ] [Nat]Added 20 Read/Feed constraints in 8 ms returned sat
[2020-06-02 23:29:32] [INFO ] Computed and/alt/rep : 246/1189/212 causal constraints in 59 ms.
[2020-06-02 23:29:33] [INFO ] Added : 194 causal constraints over 39 iterations in 1303 ms. Result :sat
[2020-06-02 23:29:34] [INFO ] Flatten gal took : 119 ms
[2020-06-02 23:29:34] [INFO ] Flatten gal took : 42 ms
[2020-06-02 23:29:34] [INFO ] Export to MCC properties in file /home/mcc/execution/CTLFireability.sr.xml took 7 ms.
[2020-06-02 23:29:34] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 4 ms.
info: Time: 3600 - MCC
vrfy: Checking CTLFireability @ NoC3x3-PT-1A @ 3570 seconds
FORMULA NoC3x3-PT-1A-CTLFireability-04 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA NoC3x3-PT-1A-CTLFireability-08 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA NoC3x3-PT-1A-CTLFireability-09 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA NoC3x3-PT-1A-CTLFireability-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA NoC3x3-PT-1A-CTLFireability-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA NoC3x3-PT-1A-CTLFireability-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA NoC3x3-PT-1A-CTLFireability-07 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA NoC3x3-PT-1A-CTLFireability-03 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA NoC3x3-PT-1A-CTLFireability-01 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 0
rslt: Output for CTLFireability @ NoC3x3-PT-1A
{
"build":
{
"architecture": 64,
"assertions": false,
"build_hostname": "mcc2019",
"build_system": "x86_64-unknown-linux-gnu",
"optimizations": true,
"package_version": "2.0",
"svn_version": "3189M"
},
"call":
{
"exec_host": "mcc2020",
"markinglimit": null,
"parameters":
[
"--pnmlnet",
"model.pnml",
"--xmlformula",
"--formula=CTLFireability.xml",
"--mcc",
"--donotcomputecapacities",
"--encoder=simplecompressed",
"--safe",
"--check=modelchecking",
"--stubborn=tarjan",
"--stateequation=par",
"--quickchecks",
"--timelimit=3570",
"--localtimelimit=0",
"--preference=force_ctl",
"--json=CTLFireability.json",
"--jsoninclude=formula,formulastat,net"
],
"starttime": "Tue Jun 2 23:29:34 2020
",
"timelimit": 3570
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 222
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 222
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 2,
"adisj": 0,
"aneg": 2,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "E ((((p163 <= 0)) R ((p47 <= 0) OR (p76 <= 0))))",
"processed_size": 49,
"rewrites": 27
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "state space /ER",
"value": true
},
"task":
{
"compoundnumber": 0,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl",
"visible": 10
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 2,
"problems": 2
},
"type": "existential_release",
"workflow": "stateequation"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 237
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 1,
"aneg": 2,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "A ((((1 <= p97) AND (1 <= p109)) R ((p107 <= 0) OR (p151 <= 0))))",
"processed_size": 66,
"rewrites": 29
},
"result":
{
"edges": 866,
"markings": 486,
"produced_by": "state space /EU",
"value": false
},
"task":
{
"compoundnumber": 1,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "eu preserving",
"visible": 8
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 2,
"problems": 2
},
"type": "universal_release",
"workflow": "stateequation"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 0,
"type": "boolean"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 237
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 237
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 0,
"G": 0,
"U": 0,
"X": 1,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "EX(((1 <= p63) AND (1 <= p69)))",
"processed_size": 31,
"rewrites": 25
},
"net":
{
"conflict_clusters": 33,
"singleton_clusters": 0
},
"result":
{
"edges": 0,
"markings": 0,
"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": 1,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "EX(AG(((1 <= p139))))",
"processed_size": 21,
"rewrites": 26
},
"net":
{
"conflict_clusters": 33,
"singleton_clusters": 0
},
"result":
{
"edges": 0,
"markings": 1,
"produced_by": "CTL model checker",
"value": false
},
"task":
{
"compoundnumber": 2,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 274
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "((1 <= p11) AND (1 <= p15))",
"processed_size": 27,
"rewrites": 26
},
"result":
{
"edges": 7,
"markings": 8,
"produced_by": "state space /EXEF",
"value": true
},
"task":
{
"compoundnumber": 3,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 2,
"problems": 2
},
"type": "reachability_from_a_successor",
"workflow": "stateequation"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": true
},
"task":
{
"compoundnumber": 1,
"type": "boolean"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 254
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 254
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "((1 <= p71) AND (1 <= p127))",
"processed_size": 28,
"rewrites": 27
},
"result":
{
"edges": 1109825,
"markings": 476828,
"produced_by": "state space /EGEF",
"value": true
},
"task":
{
"compoundnumber": 2,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving",
"visible": 3
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 2,
"problems": 2
},
"type": "possible_preservation_of_reachability",
"workflow": "stateequation"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 274
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 1,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "AX(((p120 <= 0) OR (p133 <= 0)))",
"processed_size": 33,
"rewrites": 25
},
"net":
{
"conflict_clusters": 33,
"singleton_clusters": 0
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "CTL model checker",
"value": true
},
"task":
{
"compoundnumber": 3,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": true
},
"task":
{
"compoundnumber": 2,
"type": "boolean"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 274
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 2,
"F": 1,
"G": 0,
"U": 0,
"X": 1,
"aconj": 5,
"adisj": 0,
"aneg": 0,
"comp": 8,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 8,
"taut": 0,
"tconj": 1,
"tdisj": 3,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 8,
"visible_transitions": 0
},
"processed": "EF((((1 <= p2) AND (1 <= p18)) AND (((1 <= p41)) OR (EX(((1 <= p159))) OR (((1 <= p141) AND (1 <= p157)) OR ((1 <= p105) AND (1 <= p6)))))))",
"processed_size": 140,
"rewrites": 26
},
"net":
{
"conflict_clusters": 33,
"singleton_clusters": 0
},
"result":
{
"edges": 8704422,
"markings": 3706997,
"produced_by": "CTL model checker",
"value": true
},
"task":
{
"compoundnumber": 3,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 295
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 295
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 1,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "((p73 <= 0))",
"processed_size": 12,
"rewrites": 27
},
"result":
{
"edges": 17,
"markings": 17,
"produced_by": "state space / EG",
"value": false
},
"task":
{
"compoundnumber": 6,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 12
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "eventual_occurrence",
"workflow": "stateequation"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 328
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 2,
"F": 1,
"G": 0,
"U": 0,
"X": 1,
"aconj": 2,
"adisj": 0,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "EF((((1 <= p133)) AND EX(((1 <= p124) AND (1 <= p133)))))",
"processed_size": 57,
"rewrites": 26
},
"net":
{
"conflict_clusters": 33,
"singleton_clusters": 0
},
"result":
{
"edges": 2313,
"markings": 1301,
"produced_by": "CTL model checker",
"value": true
},
"task":
{
"compoundnumber": 7,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": true
},
"task":
{
"compoundnumber": 6,
"type": "boolean"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 328
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "E (F (((1 <= p108))))",
"processed_size": 21,
"rewrites": 25
},
"result":
{
"edges": 8,
"markings": 9,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 7,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "reachability",
"workflow": "stateequation||search"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 369
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "E (F (((1 <= p52) AND (1 <= p73))))",
"processed_size": 35,
"rewrites": 25
},
"result":
{
"edges": 12,
"markings": 13,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 8,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 2,
"problems": 2
},
"type": "reachability",
"workflow": "stateequation||search"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 422
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 1,
"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 <= p104) AND (1 <= p108) AND ((p30 <= 0) OR (p45 <= 0)))))",
"processed_size": 69,
"rewrites": 25
},
"result":
{
"edges": 8,
"markings": 9,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 9,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 6,
"problems": 2
},
"type": "reachability",
"workflow": "stateequation||search"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 492
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "((1 <= p75))",
"processed_size": 12,
"rewrites": 27
},
"result":
{
"edges": 16,
"markings": 16,
"produced_by": "state space /EFEG",
"value": true
},
"task":
{
"compoundnumber": 10,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 5
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "reachability_of_possible_preservation",
"workflow": "stateequation"
}
}
],
"exit":
{
"error": null,
"memory": 46436,
"runtime": 3570.000000,
"signal": null,
"timelimitreached": true
},
"files":
{
"formula": "CTLFireability.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "E(G(E(F(**)))) : E(F(E(G(**)))) : A(G(E(F(**)))) : E(F(**)) : (A((* R *)) AND (E(X(**)) OR E((* R *)))) : E((** U **)) : (E(F(**)) OR **) : E(F(**)) : (E(X(A(G(**)))) OR (E(X(E(F(**)))) OR E(X(**)))) : (E(G(E(F(**)))) AND A(X(**))) : E(F((** AND (** OR (E(X(**)) OR (** OR **)))))) : A(G((E(F(*)) OR A(X(*))))) : (A((E(F(**)) U **)) OR E(X(E(F(**))))) : E(G((E(F(**)) AND **))) : E(F(**)) : (A(F(**)) OR E(F((** AND E(X(**))))))"
},
"net":
{
"arcs": 853,
"conflict_clusters": 33,
"places": 165,
"places_significant": 125,
"singleton_clusters": 0,
"transitions": 247
},
"result":
{
"interim_value": "unknown yes unknown yes no unknown unknown yes yes yes yes unknown unknown unknown yes yes ",
"preliminary_value": "unknown yes unknown yes no unknown unknown yes yes yes yes unknown unknown unknown yes yes "
},
"task":
{
"type": "compound"
}
}
lola: LoLA will run for 3570 seconds at most (--timelimit)
lola: NET
lola: input: PNML file (--pnml)
lola: reading net from model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file model.pnml
lola: 412/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 165
lola: finding significant places
lola: 165 places, 247 transitions, 125 significant places
lola: compute conflict clusters
lola: computed conflict clusters
lola: Computing conflicting sets
lola: Computing back conflicting sets
lola: TASK
lola: Reading formula in XML format (--xmlformula)
lola: reading pnml
lola: reading formula from CTLFireability.xml
lola: LP says that atomic proposition is always true: (p112 <= 1)
lola: LP says that atomic proposition is always true: (p108 <= 1)
lola: LP says that atomic proposition is always true: (p136 <= 1)
lola: LP says that atomic proposition is always true: (p75 <= 1)
lola: LP says that atomic proposition is always true: (p122 <= 1)
lola: LP says that atomic proposition is always true: (p158 <= 1)
lola: LP says that atomic proposition is always true: (p104 <= 1)
lola: LP says that atomic proposition is always true: (p108 <= 1)
lola: LP says that atomic proposition is always true: (p30 <= 1)
lola: LP says that atomic proposition is always true: (p45 <= 1)
lola: LP says that atomic proposition is always true: (p97 <= 1)
lola: LP says that atomic proposition is always true: (p109 <= 1)
lola: LP says that atomic proposition is always true: (p107 <= 1)
lola: LP says that atomic proposition is always true: (p151 <= 1)
lola: LP says that atomic proposition is always true: (p106 <= 1)
lola: LP says that atomic proposition is always true: (p163 <= 1)
lola: LP says that atomic proposition is always true: (p47 <= 1)
lola: LP says that atomic proposition is always true: (p76 <= 1)
lola: LP says that atomic proposition is always true: (p15 <= 1)
lola: LP says that atomic proposition is always true: (p30 <= 1)
lola: LP says that atomic proposition is always true: (p45 <= 1)
lola: LP says that atomic proposition is always true: (p97 <= 1)
lola: LP says that atomic proposition is always true: (p109 <= 1)
lola: LP says that atomic proposition is always true: (p39 <= 1)
lola: LP says that atomic proposition is always true: (p16 <= 1)
lola: LP says that atomic proposition is always true: (p62 <= 1)
lola: LP says that atomic proposition is always true: (p40 <= 1)
lola: LP says that atomic proposition is always true: (p102 <= 1)
lola: LP says that atomic proposition is always true: (p79 <= 1)
lola: LP says that atomic proposition is always true: (p41 <= 1)
lola: LP says that atomic proposition is always true: (p111 <= 1)
lola: LP says that atomic proposition is always true: (p52 <= 1)
lola: LP says that atomic proposition is always true: (p73 <= 1)
lola: LP says that atomic proposition is always true: (p139 <= 1)
lola: LP says that atomic proposition is always true: (p11 <= 1)
lola: LP says that atomic proposition is always true: (p15 <= 1)
lola: LP says that atomic proposition is always true: (p63 <= 1)
lola: LP says that atomic proposition is always true: (p69 <= 1)
lola: LP says that atomic proposition is always true: (p71 <= 1)
lola: LP says that atomic proposition is always true: (p127 <= 1)
lola: LP says that atomic proposition is always true: (p120 <= 1)
lola: LP says that atomic proposition is always true: (p133 <= 1)
lola: LP says that atomic proposition is always true: (p2 <= 1)
lola: LP says that atomic proposition is always true: (p18 <= 1)
lola: LP says that atomic proposition is always true: (p41 <= 1)
lola: LP says that atomic proposition is always true: (p159 <= 1)
lola: LP says that atomic proposition is always true: (p141 <= 1)
lola: LP says that atomic proposition is always true: (p157 <= 1)
lola: LP says that atomic proposition is always true: (p105 <= 1)
lola: LP says that atomic proposition is always true: (p6 <= 1)
lola: LP says that atomic proposition is always true: (p120 <= 1)
lola: LP says that atomic proposition is always true: (p133 <= 1)
lola: LP says that atomic proposition is always true: (p50 <= 1)
lola: LP says that atomic proposition is always true: (p137 <= 1)
lola: LP says that atomic proposition is always true: (p162 <= 1)
lola: LP says that atomic proposition is always true: (p134 <= 1)
lola: LP says that atomic proposition is always true: (p142 <= 1)
lola: LP says that atomic proposition is always true: (p18 <= 1)
lola: LP says that atomic proposition is always true: (p51 <= 1)
lola: LP says that atomic proposition is always true: (p75 <= 1)
lola: LP says that atomic proposition is always true: (p50 <= 1)
lola: LP says that atomic proposition is always true: (p137 <= 1)
lola: LP says that atomic proposition is always true: (p6 <= 1)
lola: LP says that atomic proposition is always true: (p18 <= 1)
lola: LP says that atomic proposition is always true: (p163 <= 1)
lola: LP says that atomic proposition is always true: (p105 <= 1)
lola: LP says that atomic proposition is always true: (p115 <= 1)
lola: LP says that atomic proposition is always true: (p138 <= 1)
lola: LP says that atomic proposition is always true: (p147 <= 1)
lola: LP says that atomic proposition is always true: (p162 <= 1)
lola: LP says that atomic proposition is always true: (p108 <= 1)
lola: LP says that atomic proposition is always true: (p9 <= 1)
lola: LP says that atomic proposition is always true: (p15 <= 1)
lola: LP says that atomic proposition is always true: (p73 <= 1)
lola: LP says that atomic proposition is always true: (p133 <= 1)
lola: LP says that atomic proposition is always true: (p124 <= 1)
lola: LP says that atomic proposition is always true: (p133 <= 1)
lola: E (G (E (F (((1 <= p112) AND (((1 <= p108)) OR ((1 <= p136)))))))) : E (F (E (G (((1 <= p75)))))) : A (G (E (F (E (F (((1 <= p122) AND (1 <= p158)))))))) : E (F (((1 <= p104) AND (1 <= p108) AND ((p30 <= 0) OR (p45 <= 0))))) : (NOT(E ((((p97 <= 0) OR (p109 <= 0)) U ((1 <= p107) AND (1 <= p151))))) AND (E (X (((1 <= p106)))) OR NOT(A ((((1 <= p163)) U ((1 <= p47) AND (1 <= p76))))))) : E (((((p15 <= 0)) AND ((p30 <= 0) OR (p45 <= 0)) AND ((p97 <= 0) OR (p109 <= 0))) U ((1 <= p39) AND (1 <= p16) AND (1 <= p62)))) : (A ((((p40 <= 0) OR (p102 <= 0) OR (p79 <= 0)) U E (F (((1 <= p41)))))) OR ((1 <= p111))) : E (F (((1 <= p52) AND (1 <= p73)))) : E (X (((A (G (((1 <= p139)))) OR E (F (((1 <= p11) AND (1 <= p15))))) OR ((1 <= p63) AND (1 <= p69))))) : (E (G (E (F (((1 <= p71) AND (1 <= p127)))))) AND A (X (((p120 <= 0) OR (p133 <= 0))))) : E (F ((((1 <= p2) AND (1 <= p18)) AND (((((1 <= p41)) OR E (X (((1 <= p159))))) OR ((1 <= p141) AND (1 <= p157))) OR ((1 <= p105) AND (1 <= p6)))))) : A (G ((NOT(A (G (((1 <= p120) AND (1 <= p133))))) OR NOT(E (X (((1 <= p50) AND (1 <= p137)))))))) : (A ((E (F (((1 <= p162)))) U (((1 <= p134) AND (1 <= p142)) OR ((1 <= p18)) OR ((1 <= p51) AND (1 <= p75) AND (1 <= p50) AND (1 <= p137))))) OR E (X (E (F (((1 <= p6) AND (1 <= p18) AND (1 <= p163))))))) : E (G ((E (F (((1 <= p105)))) AND ((p115 <= 0) OR (p138 <= 0) OR ((1 <= p147) AND (1 <= p162)))))) : E (F (E (F (((1 <= p108)))))) : (A ((E (G (((1 <= p9) AND (1 <= p15)))) U A (F (((1 <= p73)))))) OR E (F ((((1 <= p133)) AND E (X (((1 <= p124) AND (1 <= p133))))))))
lola: rewrite Frontend/Parser/formula_rewrite.k:401
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:338
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:338
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:452
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:554
lola: rewrite Frontend/Parser/formula_rewrite.k:554
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:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:401
lola: rewrite Frontend/Parser/formula_rewrite.k:470
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 ((((1 <= p97) AND (1 <= p109)) R ((p107 <= 0) OR (p151 <= 0)))) AND (E (X (((1 <= p106)))) OR E ((((p163 <= 0)) R ((p47 <= 0) OR (p76 <= 0))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 0 will run for 222 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E ((((p163 <= 0)) R ((p47 <= 0) OR (p76 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking existential release
lola: rewrite Frontend/Parser/formula_rewrite.k:576
lola: rewrite Frontend/Parser/formula_rewrite.k:736
lola: rewrite Frontend/Parser/formula_rewrite.k:696
lola: processed formula: E ((((p163 <= 0)) R ((p47 <= 0) OR (p76 <= 0))))
lola: processed formula length: 49
lola: 27 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /ER)
lola: state space: using reachability graph (ER version) (--search=depth)
lola: state space: using ltl preserving stubborn set method (--stubborn=tarjan)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: 1
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:788
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: SUBRESULT
lola: result: yes
lola: produced by: state space /ER
lola: formula 0: ((1 <= p47) AND (1 <= p76))
lola: state equation task get result unparse finished id 0
lola: There is a path where Predicate Phi releases Predicate Psi.
lola: 0 markings, 0 edges
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: ========================================
lola: subprocess 1 will run for 237 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A ((((1 <= p97) AND (1 <= p109)) R ((p107 <= 0) OR (p151 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking universal release
lola: rewrite Frontend/Parser/formula_rewrite.k:619
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: rewrite Frontend/Parser/formula_rewrite.k:737
lola: rewrite Frontend/Parser/formula_rewrite.k:693
lola: rewrite Frontend/Parser/formula_rewrite.k:788
lola: rewrite Frontend/Parser/formula_rewrite.k:788
lola: processed formula: A ((((1 <= p97) AND (1 <= p109)) R ((p107 <= 0) OR (p151 <= 0))))
lola: processed formula length: 66
lola: 29 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /EU)
lola: state space: using reachability graph (EU version) (--search=depth)
lola: state space: using eu preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:788
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((1 <= p107) AND (1 <= p151))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space /EU
lola: Predicate Phi does not release Predicate Psi on all paths.
lola: 486 markings, 866 edges
lola: state equation: write sara problem file to CTLFireability-0.sara
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 1 will run for 237 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E (X (A (G (((1 <= p139)))))) OR (E (X (E (F (((1 <= p11) AND (1 <= p15)))))) OR E (X (((1 <= p63) AND (1 <= p69))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 1 will run for 237 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (X (((1 <= p63) AND (1 <= p69))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:807
lola: processed formula: EX(((1 <= p63) AND (1 <= p69)))
lola: processed formula length: 31
lola: 25 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 0 significant temporal operators and needs 0 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 2 will run for 254 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (X (A (G (((1 <= p139))))))
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(((1 <= p139))))
lola: processed formula length: 21
lola: 26 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: 1 markings, 0 edges
lola: ========================================
lola: subprocess 3 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (X (E (F (((1 <= p11) AND (1 <= p15))))))
lola: ========================================
lola: SUBTASK
lola: checking reachability from a successor
lola: rewrite Frontend/Parser/formula_rewrite.k:623
lola: rewrite Frontend/Parser/formula_rewrite.k:714
lola: processed formula: ((1 <= p11) AND (1 <= p15))
lola: processed formula length: 27
lola: 26 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 /EXEF)
lola: state space: using reachability graph (EXef 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: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((1 <= p11) AND (1 <= p15))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space /EXEF
lola: The predicate is reachable from some successor.
lola: 8 markings, 7 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: state equation: write sara problem file to CTLFireability-3-0.sara
lola: subprocess 2 will run for 254 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E (G (E (F (((1 <= p71) AND (1 <= p127)))))) AND A (X (((p120 <= 0) OR (p133 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 2 will run for 254 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G (E (F (((1 <= p71) AND (1 <= p127))))))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation of reachability
lola: rewrite Frontend/Parser/formula_rewrite.k:593
lola: rewrite Frontend/Parser/formula_rewrite.k:628
lola: rewrite Frontend/Parser/formula_rewrite.k:731
lola: processed formula: ((1 <= p71) AND (1 <= p127))
lola: processed formula length: 28
lola: 27 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: rewrite Frontend/Parser/formula_rewrite.k:711
lola: state equation task get result rewrite finished id 1
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: ((p71 <= 0) OR (p127 <= 0))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 2 literals and 2 conjunctive subformulas
lola: state equation task get result unparse finished++ id 1
lola: formula 1: ((1 <= p71) AND (1 <= p127))
lola: state equation task get result unparse finished id 1
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to CTLFireability-2-0.sara
lola: state equation: calling and running sara
sara: try reading problem file CTLFireability-2-0.sara.
lola: state equation: write sara problem file to CTLFireability-2-1.sara
lola: state equation: calling and running sara
sara: try reading problem file CTLFireability-2-1.sara.
sara: place or transition ordering is non-deterministic
sara: place or transition ordering is non-deterministic
lola: state equation 0: solution produced
lola: state equation 1: solution produced
lola: SUBRESULT
lola: result: yes
lola: produced by: state space /EGEF
lola: Reachability of the predicate is possibly preserved.
lola: 476828 markings, 1109825 edges
lola: ========================================
lola: subprocess 3 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (((p120 <= 0) OR (p133 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:812
lola: processed formula: AX(((p120 <= 0) OR (p133 <= 0)))
lola: processed formula length: 33
lola: 25 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 0 significant temporal operators and needs 0 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 0 markings, 0 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 3 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((((1 <= p2) AND (1 <= p18)) AND (((1 <= p41)) OR (E (X (((1 <= p159)))) OR (((1 <= p141) AND (1 <= p157)) OR ((1 <= p105) AND (1 <= p6))))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:807
lola: rewrite Frontend/Parser/formula_rewrite.k:806
lola: processed formula: EF((((1 <= p2) AND (1 <= p18)) AND (((1 <= p41)) OR (EX(((1 <= p159))) OR (((1 <= p141) AND (1 <= p157)) OR ((1 <= p105) AND (1 <= p6)))))))
lola: processed formula length: 140
lola: 26 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: 1314076 markings, 2994467 edges, 262815 markings/sec, 0 secs
lola: 2559604 markings, 5978184 edges, 249106 markings/sec, 5 secs
lola: 3690022 markings, 8663885 edges, 226084 markings/sec, 10 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 3706997 markings, 8704422 edges
lola: ========================================
lola: subprocess 4 will run for 295 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((E (F (((p120 <= 0) OR (p133 <= 0)))) OR A (X (((p50 <= 0) OR (p137 <= 0)))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:806
lola: rewrite Frontend/Parser/formula_rewrite.k:812
lola: rewrite Frontend/Parser/formula_rewrite.k:813
lola: processed formula: AG((EF(((p120 <= 0) OR (p133 <= 0))) OR AX(((p50 <= 0) OR (p137 <= 0)))))
lola: processed formula length: 75
lola: 27 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: 982716 markings, 3228220 edges, 196543 markings/sec, 0 secs
lola: 1897185 markings, 6268530 edges, 182894 markings/sec, 5 secs
lola: 2765257 markings, 9235732 edges, 173614 markings/sec, 10 secs
lola: 3610749 markings, 12087640 edges, 169098 markings/sec, 15 secs
lola: 4383004 markings, 15170956 edges, 154451 markings/sec, 20 secs
lola: 5247044 markings, 18264834 edges, 172808 markings/sec, 25 secs
lola: 6124667 markings, 21271931 edges, 175525 markings/sec, 30 secs
lola: 6995274 markings, 24242305 edges, 174121 markings/sec, 35 secs
lola: 7796160 markings, 27415795 edges, 160177 markings/sec, 40 secs
lola: 8628016 markings, 30518634 edges, 166371 markings/sec, 45 secs
lola: 9385898 markings, 33434444 edges, 151576 markings/sec, 50 secs
lola: 10124490 markings, 36409764 edges, 147718 markings/sec, 55 secs
lola: 10735398 markings, 39340656 edges, 122182 markings/sec, 60 secs
lola: 11322789 markings, 42526222 edges, 117478 markings/sec, 65 secs
lola: 11842427 markings, 45399682 edges, 103928 markings/sec, 70 secs
lola: 12276735 markings, 48128505 edges, 86862 markings/sec, 75 secs
lola: 12768196 markings, 51143138 edges, 98292 markings/sec, 80 secs
lola: 13215294 markings, 54069278 edges, 89420 markings/sec, 85 secs
lola: 13676763 markings, 56768194 edges, 92294 markings/sec, 90 secs
lola: 14087008 markings, 59375320 edges, 82049 markings/sec, 95 secs
lola: 14471200 markings, 61886936 edges, 76838 markings/sec, 100 secs
lola: 14848905 markings, 64354058 edges, 75541 markings/sec, 105 secs
lola: 15355598 markings, 67167106 edges, 101339 markings/sec, 110 secs
lola: 15858612 markings, 70057049 edges, 100603 markings/sec, 115 secs
lola: 16202377 markings, 73090754 edges, 68753 markings/sec, 120 secs
lola: 16496562 markings, 75997776 edges, 58837 markings/sec, 125 secs
lola: 16749655 markings, 78737621 edges, 50619 markings/sec, 130 secs
lola: 16994768 markings, 81529509 edges, 49023 markings/sec, 135 secs
lola: 17221640 markings, 84333139 edges, 45374 markings/sec, 140 secs
lola: 17260161 markings, 87104886 edges, 7704 markings/sec, 145 secs
lola: 17260161 markings, 89744652 edges, 0 markings/sec, 150 secs
lola: 17260161 markings, 92413861 edges, 0 markings/sec, 155 secs
lola: 17346512 markings, 95166363 edges, 17270 markings/sec, 160 secs
lola: 17712732 markings, 97985393 edges, 73244 markings/sec, 165 secs
lola: 18171684 markings, 100626034 edges, 91790 markings/sec, 170 secs
lola: 18560864 markings, 103115347 edges, 77836 markings/sec, 175 secs
lola: 19006095 markings, 105750218 edges, 89046 markings/sec, 180 secs
lola: 19511033 markings, 108525631 edges, 100988 markings/sec, 185 secs
lola: 19993645 markings, 111222808 edges, 96522 markings/sec, 190 secs
lola: 20538038 markings, 114053255 edges, 108879 markings/sec, 195 secs
lola: 20998235 markings, 116917503 edges, 92039 markings/sec, 200 secs
lola: 21457164 markings, 119671881 edges, 91786 markings/sec, 205 secs
lola: 21872668 markings, 122379100 edges, 83101 markings/sec, 210 secs
lola: 22336630 markings, 125005473 edges, 92792 markings/sec, 215 secs
lola: 22639728 markings, 127757659 edges, 60620 markings/sec, 220 secs
lola: 22953722 markings, 130452584 edges, 62799 markings/sec, 225 secs
lola: 23273898 markings, 133094961 edges, 64035 markings/sec, 230 secs
lola: 23529991 markings, 135670013 edges, 51219 markings/sec, 235 secs
lola: 23751662 markings, 138194492 edges, 44334 markings/sec, 240 secs
lola: 23852733 markings, 140656211 edges, 20214 markings/sec, 245 secs
lola: 23852733 markings, 143063915 edges, 0 markings/sec, 250 secs
lola: 23852733 markings, 145567736 edges, 0 markings/sec, 255 secs
lola: 24197919 markings, 148137935 edges, 69037 markings/sec, 260 secs
lola: 24542327 markings, 150684576 edges, 68882 markings/sec, 265 secs
lola: 24833593 markings, 153364813 edges, 58253 markings/sec, 270 secs
lola: 25250911 markings, 155870124 edges, 83464 markings/sec, 275 secs
lola: 25694912 markings, 158378884 edges, 88800 markings/sec, 280 secs
lola: 26062970 markings, 160996039 edges, 73612 markings/sec, 285 secs
lola: local time limit reached - aborting
lola:
preliminary result: unknown unknown unknown unknown no unknown unknown unknown yes yes yes unknown unknown unknown unknown unknown
lola: caught signal User defined signal 2 - aborting LoLA
lola:
preliminary result: unknown unknown unknown unknown no unknown unknown unknown yes yes yes unknown unknown unknown unknown unknown
lola: memory consumption: 4214340 KB
lola: time consumption: 317 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 295 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A ((E (F (((1 <= p162)))) U (((1 <= p134) AND (1 <= p142)) OR ((1 <= p18)) OR ((1 <= p51) AND (1 <= p75) AND (1 <= p50) AND (1 <= p137))))) OR E (X (E (F (((1 <= p6) AND (1 <= p18) AND (1 <= p163)))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:806
lola: rewrite Frontend/Parser/formula_rewrite.k:814
lola: rewrite Frontend/Parser/formula_rewrite.k:806
lola: rewrite Frontend/Parser/formula_rewrite.k:807
lola: processed formula: (A(EF(((1 <= p162))) U (((1 <= p134) AND (1 <= p142)) OR ((1 <= p18)) OR ((1 <= p51) AND (1 <= p75) AND (1 <= p50) AND (1 <= p137)))) OR EX(EF(((1 <= p6) AND (1 <= p18) AND (1 <= p163)))))
lola: processed formula length: 190
lola: 28 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: 1324410 markings, 3019064 edges, 264882 markings/sec, 0 secs
lola: 2586057 markings, 6037573 edges, 252329 markings/sec, 5 secs
lola: 3781596 markings, 8990871 edges, 239108 markings/sec, 10 secs
lola: 4805210 markings, 11897639 edges, 204723 markings/sec, 15 secs
lola: 5940809 markings, 14720108 edges, 227120 markings/sec, 20 secs
lola: 7175566 markings, 17679566 edges, 246951 markings/sec, 25 secs
lola: 8193168 markings, 20610702 edges, 203520 markings/sec, 30 secs
lola: 9163057 markings, 23530873 edges, 193978 markings/sec, 35 secs
lola: 10165613 markings, 26424153 edges, 200511 markings/sec, 40 secs
lola: 10376906 markings, 28596052 edges, 42259 markings/sec, 45 secs
lola: 10376906 markings, 31511259 edges, 0 markings/sec, 50 secs
lola: 10376906 markings, 34438061 edges, 0 markings/sec, 55 secs
lola: 10376906 markings, 37435294 edges, 0 markings/sec, 60 secs
lola: 10376906 markings, 40401099 edges, 0 markings/sec, 65 secs
lola: 10376906 markings, 43385583 edges, 0 markings/sec, 70 secs
lola: 10376906 markings, 46434668 edges, 0 markings/sec, 75 secs
lola: 10376906 markings, 49475127 edges, 0 markings/sec, 80 secs
lola: 10376906 markings, 52509221 edges, 0 markings/sec, 85 secs
lola: 10665316 markings, 55576811 edges, 57682 markings/sec, 90 secs
lola: 11370138 markings, 58773638 edges, 140964 markings/sec, 95 secs
lola: 12017060 markings, 61747952 edges, 129384 markings/sec, 100 secs
lola: 12623108 markings, 64706651 edges, 121210 markings/sec, 105 secs
lola: 13167344 markings, 67881799 edges, 108847 markings/sec, 110 secs
lola: 13735801 markings, 70662478 edges, 113691 markings/sec, 115 secs
lola: 14225837 markings, 73298490 edges, 98007 markings/sec, 120 secs
lola: 14689028 markings, 75873107 edges, 92638 markings/sec, 125 secs
lola: 15265278 markings, 78708959 edges, 115250 markings/sec, 130 secs
lola: 15911979 markings, 81858811 edges, 129340 markings/sec, 135 secs
lola: 16305783 markings, 85046136 edges, 78761 markings/sec, 140 secs
lola: 16624033 markings, 87988555 edges, 63650 markings/sec, 145 secs
lola: 16910338 markings, 90895395 edges, 57261 markings/sec, 150 secs
lola: 17181002 markings, 93883353 edges, 54133 markings/sec, 155 secs
lola: 17260160 markings, 96967766 edges, 15832 markings/sec, 160 secs
lola: 17260161 markings, 99869143 edges, 0 markings/sec, 165 secs
lola: 17260161 markings, 102788684 edges, 0 markings/sec, 170 secs
lola: 17482504 markings, 105919269 edges, 44469 markings/sec, 175 secs
lola: 18022999 markings, 108957479 edges, 108099 markings/sec, 180 secs
lola: 18539071 markings, 111694905 edges, 103214 markings/sec, 185 secs
lola: 19117935 markings, 114578254 edges, 115773 markings/sec, 190 secs
lola: 19808918 markings, 117558259 edges, 138197 markings/sec, 195 secs
lola: 20481294 markings, 120561480 edges, 134475 markings/sec, 200 secs
lola: 21070979 markings, 123700852 edges, 117937 markings/sec, 205 secs
lola: 21656286 markings, 126689283 edges, 117061 markings/sec, 210 secs
lola: 22263142 markings, 129595588 edges, 121371 markings/sec, 215 secs
lola: 22666640 markings, 132604498 edges, 80700 markings/sec, 220 secs
lola: 23080437 markings, 135550432 edges, 82759 markings/sec, 225 secs
lola: 23427404 markings, 138428464 edges, 69393 markings/sec, 230 secs
lola: 23702546 markings, 141163266 edges, 55028 markings/sec, 235 secs
lola: 23852732 markings, 143919769 edges, 30037 markings/sec, 240 secs
lola: 23852733 markings, 146637105 edges, 0 markings/sec, 245 secs
lola: 23930426 markings, 149396932 edges, 15539 markings/sec, 250 secs
lola: 24395746 markings, 152093213 edges, 93064 markings/sec, 255 secs
lola: 24807398 markings, 154861216 edges, 82330 markings/sec, 260 secs
lola: 25188709 markings, 157599642 edges, 76262 markings/sec, 265 secs
lola: 25736677 markings, 160134672 edges, 109594 markings/sec, 270 secs
lola: 26080034 markings, 162889533 edges, 68671 markings/sec, 275 secs
lola: 26502194 markings, 165520143 edges, 84432 markings/sec, 280 secs
lola: 26828428 markings, 168182638 edges, 65247 markings/sec, 285 secs
lola: local time limit reached - aborting
lola:
preliminary result: unknown unknown unknown unknown no unknown unknown unknown yes yes yes unknown unknown unknown unknown unknown
lola: caught signal User defined signal 2 - aborting LoLA
lola:
preliminary result: unknown unknown unknown unknown no unknown unknown unknown yes yes yes unknown unknown unknown unknown unknown
lola: memory consumption: 4385240 KB
lola: time consumption: 612 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 6 will run for 295 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (F (((1 <= p73)))) OR E (F ((((1 <= p133)) AND E (X (((1 <= p124) AND (1 <= p133))))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 6 will run for 295 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (((1 <= p73))))
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: ((p73 <= 0))
lola: processed formula length: 12
lola: 27 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: ((1 <= p73))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space / EG
lola: The predicate does not eventually occur.
lola: 17 markings, 17 edges
lola: ========================================
lola: subprocess 7 will run for 328 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((((1 <= p133)) AND E (X (((1 <= p124) AND (1 <= p133)))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:807
lola: rewrite Frontend/Parser/formula_rewrite.k:806
lola: processed formula: EF((((1 <= p133)) AND EX(((1 <= p124) AND (1 <= p133)))))
lola: processed formula length: 57
lola: 26 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 1301 markings, 2313 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 7 will run for 328 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((1 <= p108))))
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 <= p108))))
lola: processed formula length: 21
lola: 25 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((1 <= p108))
lola: state equation task get result unparse finished id 0
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: The predicate is reachable.
lola: 9 markings, 8 edges
lola: subprocess 8 will run for 369 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((1 <= p52) AND (1 <= p73))))
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 <= p52) AND (1 <= p73))))
lola: processed formula length: 35
lola: 25 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: ========================================
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 <= p52) AND (1 <= p73))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 13 markings, 12 edges
lola: ========================================
lola: subprocess 9 will run for 422 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((1 <= p104) AND (1 <= p108) AND ((p30 <= 0) OR (p45 <= 0)))))
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 <= p104) AND (1 <= p108) AND ((p30 <= 0) OR (p45 <= 0)))))
lola: processed formula length: 69
lola: 25 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((1 <= p104) AND (1 <= p108) AND ((p30 <= 0) OR (p45 <= 0)))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 6 literals and 2 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 9 markings, 8 edges
lola: state equation: write sara problem file to CTLFireability-9-0.sara
lola: state equation: calling and running sara
lola: ========================================
sara: try reading problem file CTLFireability-9-0.sara.
lola: subprocess 10 will run for 492 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (E (G (((1 <= p75))))))
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: ((1 <= p75))
lola: processed formula length: 12
lola: 27 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /EFEG)
lola: state space: using reachability graph (EFEG version) (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((p75 <= 0))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
sara: place or transition ordering is non-deterministic
lola: SUBRESULT
lola: result: yes
lola: produced by: state space /EFEG
lola: The predicate is possibly preserved from a reachable marking.
lola: 16 markings, 16 edges
lola: ========================================
lola: subprocess 11 will run for 591 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (E (F (((1 <= p122) AND (1 <= p158))))))
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 <= p122) AND (1 <= p158))
lola: processed formula length: 29
lola: 27 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:787
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((p122 <= 0) OR (p158 <= 0))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 2 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to CTLFireability-11-0.sara
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: state equation task get result unparse finished++ id 1
lola: formula 1: ((1 <= p122) AND (1 <= p158))
lola: state equation task get result unparse finished id 1
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to CTLFireability-11-1.sara
lola: state equation: calling and running sara
sara: try reading problem file CTLFireability-11-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 || 1331226 markings, 2230172 edges, 266245 markings/sec, 0 secs
lola: sara is running 5 secs || sara is running 5 secs || 2604395 markings, 4429317 edges, 254634 markings/sec, 5 secs
lola: sara is running 10 secs || sara is running 10 secs || 3870875 markings, 6601814 edges, 253296 markings/sec, 10 secs
lola: sara is running 15 secs || sara is running 15 secs || 5097218 markings, 8731834 edges, 245269 markings/sec, 15 secs
lola: sara is running 20 secs || sara is running 20 secs || 6369911 markings, 10886352 edges, 254539 markings/sec, 20 secs
lola: sara is running 25 secs || sara is running 25 secs || 7604112 markings, 13020858 edges, 246840 markings/sec, 25 secs
lola: sara is running 30 secs || sara is running 30 secs || 8837870 markings, 15166466 edges, 246752 markings/sec, 30 secs
lola: sara is running 35 secs || sara is running 35 secs || 10077380 markings, 17339426 edges, 247902 markings/sec, 35 secs
lola: sara is running 40 secs || sara is running 40 secs || 11279582 markings, 19463136 edges, 240440 markings/sec, 40 secs
lola: sara is running 45 secs || sara is running 45 secs || 12528280 markings, 21599249 edges, 249740 markings/sec, 45 secs
lola: sara is running 50 secs || sara is running 50 secs || 13771029 markings, 23739502 edges, 248550 markings/sec, 50 secs
lola: sara is running 55 secs || sara is running 55 secs || 14980335 markings, 25830457 edges, 241861 markings/sec, 55 secs
lola: sara is running 60 secs || sara is running 60 secs || 16219805 markings, 27969904 edges, 247894 markings/sec, 60 secs
lola: sara is running 65 secs || sara is running 65 secs || 17424970 markings, 30091315 edges, 241033 markings/sec, 65 secs
lola: sara is running 70 secs || sara is running 70 secs || 18624337 markings, 32202116 edges, 239873 markings/sec, 70 secs
lola: sara is running 75 secs || sara is running 75 secs || 19818999 markings, 34283799 edges, 238932 markings/sec, 75 secs
lola: sara is running 80 secs || sara is running 80 secs || 21023655 markings, 36420601 edges, 240931 markings/sec, 80 secs
lola: sara is running 85 secs || sara is running 85 secs || 22205410 markings, 38560367 edges, 236351 markings/sec, 85 secs
lola: sara is running 90 secs || sara is running 90 secs || 23386516 markings, 40639556 edges, 236221 markings/sec, 90 secs
lola: sara is running 95 secs || sara is running 95 secs || 24584191 markings, 42755147 edges, 239535 markings/sec, 95 secs
lola: sara is running 100 secs || sara is running 100 secs || 25778809 markings, 44851785 edges, 238924 markings/sec, 100 secs
lola: sara is running 105 secs || sara is running 105 secs || 26969778 markings, 46920198 edges, 238194 markings/sec, 105 secs
lola: sara is running 110 secs || sara is running 110 secs || 28160461 markings, 49007278 edges, 238137 markings/sec, 110 secs
lola: sara is running 115 secs || sara is running 115 secs || 29347777 markings, 51088062 edges, 237463 markings/sec, 115 secs
lola: sara is running 120 secs || sara is running 120 secs || 30533608 markings, 53185278 edges, 237166 markings/sec, 120 secs
lola: sara is running 125 secs || sara is running 125 secs || 31709300 markings, 55265432 edges, 235138 markings/sec, 125 secs
lola: sara is running 130 secs || sara is running 130 secs || 32903179 markings, 57341375 edges, 238776 markings/sec, 130 secs
lola: sara is running 135 secs || sara is running 135 secs || 34064090 markings, 59407139 edges, 232182 markings/sec, 135 secs
lola: sara is running 140 secs || sara is running 140 secs || 35220271 markings, 61476634 edges, 231236 markings/sec, 140 secs
lola: sara is running 145 secs || sara is running 145 secs || 36405155 markings, 63515644 edges, 236977 markings/sec, 145 secs
lola: sara is running 150 secs || sara is running 150 secs || 37589052 markings, 65601680 edges, 236779 markings/sec, 150 secs
lola: sara is running 155 secs || sara is running 155 secs || 38752504 markings, 67654589 edges, 232690 markings/sec, 155 secs
lola: sara is running 160 secs || sara is running 160 secs || 39921081 markings, 69714701 edges, 233715 markings/sec, 160 secs
lola: sara is running 165 secs || sara is running 165 secs || 41062817 markings, 71779904 edges, 228347 markings/sec, 165 secs
lola: sara is running 170 secs || sara is running 170 secs || 42222999 markings, 73820028 edges, 232036 markings/sec, 170 secs
lola: sara is running 175 secs || sara is running 175 secs || 43365832 markings, 75876936 edges, 228567 markings/sec, 175 secs
lola: sara is running 180 secs || sara is running 180 secs || 44520810 markings, 77987162 edges, 230996 markings/sec, 180 secs
lola: sara is running 185 secs || sara is running 185 secs || 45675988 markings, 80027451 edges, 231036 markings/sec, 185 secs
lola: sara is running 190 secs || sara is running 190 secs || 46827218 markings, 82074585 edges, 230246 markings/sec, 190 secs
lola: sara is running 195 secs || sara is running 195 secs || 48007933 markings, 84145032 edges, 236143 markings/sec, 195 secs
lola: sara is running 200 secs || sara is running 200 secs || 49163304 markings, 86209288 edges, 231074 markings/sec, 200 secs
lola: sara is running 205 secs || sara is running 205 secs || 50304930 markings, 88219489 edges, 228325 markings/sec, 205 secs
lola: sara is running 210 secs || sara is running 210 secs || 51467329 markings, 90313534 edges, 232480 markings/sec, 210 secs
lola: sara is running 215 secs || sara is running 215 secs || 52607588 markings, 92362740 edges, 228052 markings/sec, 215 secs
lola: sara is running 220 secs || sara is running 220 secs || 53810425 markings, 94477252 edges, 240567 markings/sec, 220 secs
lola: sara is running 225 secs || sara is running 225 secs || 54958383 markings, 96508146 edges, 229592 markings/sec, 225 secs
lola: sara is running 230 secs || sara is running 230 secs || 56123348 markings, 98572394 edges, 232993 markings/sec, 230 secs
lola: sara is running 235 secs || sara is running 235 secs || 57213854 markings, 100528168 edges, 218101 markings/sec, 235 secs
lola: sara is running 240 secs || sara is running 240 secs || 58273994 markings, 102449838 edges, 212028 markings/sec, 240 secs
lola: sara is running 245 secs || sara is running 245 secs || 59377602 markings, 104372389 edges, 220722 markings/sec, 245 secs
lola: sara is running 250 secs || sara is running 250 secs || 60484553 markings, 106342492 edges, 221390 markings/sec, 250 secs
lola: sara is running 255 secs || sara is running 255 secs || 61619754 markings, 108338694 edges, 227040 markings/sec, 255 secs
lola: sara is running 260 secs || sara is running 260 secs || 62753910 markings, 110381468 edges, 226831 markings/sec, 260 secs
lola: sara is running 265 secs || sara is running 265 secs || 63869699 markings, 112381323 edges, 223158 markings/sec, 265 secs
lola: sara is running 270 secs || sara is running 270 secs || 64995450 markings, 114399825 edges, 225150 markings/sec, 270 secs
lola: sara is running 275 secs || sara is running 275 secs || 66125565 markings, 116459033 edges, 226023 markings/sec, 275 secs
lola: sara is running 280 secs || sara is running 280 secs || 67258567 markings, 118489288 edges, 226600 markings/sec, 280 secs
lola: sara is running 285 secs || sara is running 285 secs || 68370965 markings, 120492162 edges, 222480 markings/sec, 285 secs
lola: sara is running 290 secs || sara is running 290 secs || 69488115 markings, 122516713 edges, 223430 markings/sec, 290 secs
lola: sara is running 295 secs || sara is running 295 secs || 70613212 markings, 124543563 edges, 225019 markings/sec, 295 secs
lola: sara is running 300 secs || sara is running 300 secs || 71739842 markings, 126546662 edges, 225326 markings/sec, 300 secs
lola: sara is running 305 secs || sara is running 305 secs || 72880825 markings, 128569435 edges, 228197 markings/sec, 305 secs
lola: sara is running 310 secs || sara is running 310 secs || 73997729 markings, 130596258 edges, 223381 markings/sec, 310 secs
lola: sara is running 315 secs || sara is running 315 secs || 75170396 markings, 132678753 edges, 234533 markings/sec, 315 secs
lola: sara is running 320 secs || sara is running 320 secs || 76307849 markings, 134707003 edges, 227491 markings/sec, 320 secs
lola: sara is running 325 secs || sara is running 325 secs || 77440071 markings, 136720630 edges, 226444 markings/sec, 325 secs
lola: sara is running 330 secs || sara is running 330 secs || 78545253 markings, 138737333 edges, 221036 markings/sec, 330 secs
lola: sara is running 335 secs || sara is running 335 secs || 79687444 markings, 140767858 edges, 228438 markings/sec, 335 secs
lola: sara is running 340 secs || sara is running 340 secs || 80815939 markings, 142769127 edges, 225699 markings/sec, 340 secs
lola: sara is running 345 secs || sara is running 345 secs || 81926060 markings, 144767120 edges, 222024 markings/sec, 345 secs
lola: sara is running 350 secs || sara is running 350 secs || 83064907 markings, 146782453 edges, 227769 markings/sec, 350 secs
lola: sara is running 355 secs || sara is running 355 secs || 84202012 markings, 148817793 edges, 227421 markings/sec, 355 secs
lola: sara is running 360 secs || sara is running 360 secs || 85320891 markings, 150841443 edges, 223776 markings/sec, 360 secs
lola: sara is running 365 secs || sara is running 365 secs || 86384019 markings, 152776284 edges, 212626 markings/sec, 365 secs
lola: sara is running 370 secs || sara is running 370 secs || 87442083 markings, 154660990 edges, 211613 markings/sec, 370 secs
lola: sara is running 375 secs || sara is running 375 secs || 88496341 markings, 156535966 edges, 210852 markings/sec, 375 secs
lola: sara is running 380 secs || sara is running 380 secs || 89547843 markings, 158425708 edges, 210300 markings/sec, 380 secs
lola: sara is running 385 secs || sara is running 385 secs || 90673147 markings, 160406742 edges, 225061 markings/sec, 385 secs
lola: sara is running 390 secs || sara is running 390 secs || 91803032 markings, 162404695 edges, 225977 markings/sec, 390 secs
lola: sara is running 395 secs || sara is running 395 secs || 92916532 markings, 164404511 edges, 222700 markings/sec, 395 secs
lola: sara is running 400 secs || sara is running 400 secs || 94040006 markings, 166407441 edges, 224695 markings/sec, 400 secs
lola: sara is running 405 secs || sara is running 405 secs || 95163879 markings, 168434963 edges, 224775 markings/sec, 405 secs
lola: sara is running 410 secs || sara is running 410 secs || 96271879 markings, 170412139 edges, 221600 markings/sec, 410 secs
lola: sara is running 415 secs || sara is running 415 secs || 97361728 markings, 172380735 edges, 217970 markings/sec, 415 secs
lola: sara is running 420 secs || sara is running 420 secs || 98461129 markings, 174363433 edges, 219880 markings/sec, 420 secs
lola: sara is running 425 secs || sara is running 425 secs || 99544112 markings, 176314375 edges, 216597 markings/sec, 425 secs
lola: sara is running 430 secs || sara is running 430 secs || 100620156 markings, 178280308 edges, 215209 markings/sec, 430 secs
lola: sara is running 435 secs || sara is running 435 secs || 101711146 markings, 180246589 edges, 218198 markings/sec, 435 secs
lola: sara is running 440 secs || sara is running 440 secs || 102811070 markings, 182203412 edges, 219985 markings/sec, 440 secs
lola: sara is running 445 secs || sara is running 445 secs || 103900702 markings, 184177973 edges, 217926 markings/sec, 445 secs
lola: sara is running 450 secs || sara is running 450 secs || 105022470 markings, 186184894 edges, 224354 markings/sec, 450 secs
lola: sara is running 455 secs || sara is running 455 secs || 106134437 markings, 188206561 edges, 222393 markings/sec, 455 secs
lola: sara is running 460 secs || sara is running 460 secs || 107267630 markings, 190200521 edges, 226639 markings/sec, 460 secs
lola: sara is running 465 secs || sara is running 465 secs || 108294676 markings, 192065131 edges, 205409 markings/sec, 465 secs
lola: sara is running 470 secs || sara is running 470 secs || 109341915 markings, 193915822 edges, 209448 markings/sec, 470 secs
lola: sara is running 475 secs || sara is running 475 secs || 110375305 markings, 195787056 edges, 206678 markings/sec, 475 secs
lola: sara is running 480 secs || sara is running 480 secs || 111439862 markings, 197721147 edges, 212911 markings/sec, 480 secs
lola: sara is running 485 secs || sara is running 485 secs || 112511723 markings, 199669780 edges, 214372 markings/sec, 485 secs
lola: sara is running 490 secs || sara is running 490 secs || 113625002 markings, 201656535 edges, 222656 markings/sec, 490 secs
lola: sara is running 495 secs || sara is running 495 secs || 114717924 markings, 203630687 edges, 218584 markings/sec, 495 secs
lola: sara is running 500 secs || sara is running 500 secs || 115745090 markings, 205493507 edges, 205433 markings/sec, 500 secs
lola: sara is running 505 secs || sara is running 505 secs || 116787162 markings, 207354564 edges, 208414 markings/sec, 505 secs
lola: sara is running 510 secs || sara is running 510 secs || 117818523 markings, 209199311 edges, 206272 markings/sec, 510 secs
lola: sara is running 515 secs || sara is running 515 secs || 118877013 markings, 211143083 edges, 211698 markings/sec, 515 secs
lola: sara is running 520 secs || sara is running 520 secs || 119984513 markings, 213126919 edges, 221500 markings/sec, 520 secs
lola: sara is running 525 secs || sara is running 525 secs || 121078687 markings, 215103404 edges, 218835 markings/sec, 525 secs
lola: sara is running 530 secs || sara is running 530 secs || 122158436 markings, 217060579 edges, 215950 markings/sec, 530 secs
lola: sara is running 535 secs || sara is running 535 secs || 123177160 markings, 218910335 edges, 203745 markings/sec, 535 secs
lola: sara is running 540 secs || sara is running 540 secs || 124199934 markings, 220770577 edges, 204555 markings/sec, 540 secs
lola: sara is running 545 secs || sara is running 545 secs || 125247279 markings, 222653543 edges, 209469 markings/sec, 545 secs
lola: sara is running 550 secs || sara is running 550 secs || 126298710 markings, 224554494 edges, 210286 markings/sec, 550 secs
lola: sara is running 555 secs || sara is running 555 secs || 127390323 markings, 226523170 edges, 218323 markings/sec, 555 secs
lola: sara is running 560 secs || sara is running 560 secs || 128486991 markings, 228504167 edges, 219334 markings/sec, 560 secs
lola: sara is running 565 secs || sara is running 565 secs || 129555781 markings, 230458634 edges, 213758 markings/sec, 565 secs
lola: sara is running 570 secs || sara is running 570 secs || 130637089 markings, 232394521 edges, 216262 markings/sec, 570 secs
lola: sara is running 575 secs || sara is running 575 secs || 131724692 markings, 234354159 edges, 217521 markings/sec, 575 secs
lola: sara is running 580 secs || sara is running 580 secs || 132843722 markings, 236386994 edges, 223806 markings/sec, 580 secs
lola: sara is running 585 secs || sara is running 585 secs || 133890384 markings, 238252548 edges, 209332 markings/sec, 585 secs
lola: local time limit reached - aborting
lola:
preliminary result: unknown yes unknown yes no unknown unknown yes yes yes yes unknown unknown unknown yes yes
lola: memory consumption: 15257676 KB
lola: time consumption: 1204 seconds
lola: print data as JSON (--json)
lola: writing JSON to CTLFireability.json
lola: closed JSON file CTLFireability.json
lola: time limit reached - aborting
lola:
preliminary result: unknown yes unknown yes no unknown unknown yes yes yes yes unknown unknown unknown yes yes
lola:
preliminary result: unknown yes unknown yes no unknown unknown yes yes yes yes unknown unknown unknown yes yes
lola: memory consumption: 46436 KB
lola: time consumption: 3570 seconds
lola: print data as JSON (--json)
lola: writing JSON to CTLFireability.json
lola: closed JSON file CTLFireability.json
rslt: finished
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16427332 kB
MemFree: 16097508 kB
After kill :
MemTotal: 16427332 kB
MemFree: 16097500 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="NoC3x3-PT-1A"
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 NoC3x3-PT-1A, 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 r174-csrt-158987853000332"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/NoC3x3-PT-1A.tgz
mv NoC3x3-PT-1A 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 ;