About the Execution of ITS-LoLa for Kanban-PT-00200
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 15796.300 | 3600000.00 | 1113555.00 | 18454.00 | TTTTTFTTTTT?TFTF | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fko/mcc2020-input.r184-oct2-158987928700523.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fko/mcc2020-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.............................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itslola
Input is Kanban-PT-00200, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r184-oct2-158987928700523
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 196K
-rw-r--r-- 1 mcc users 3.1K Apr 8 12:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 17K Apr 8 12:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Apr 7 16:12 CTLFireability.txt
-rw-r--r-- 1 mcc users 15K Apr 7 16:12 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 24 05:37 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 5.9K Mar 24 05:37 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K Apr 14 12:41 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 28 14:01 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Apr 14 12:41 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 28 14:01 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.3K Apr 6 19:13 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 17K Apr 6 19:13 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.1K Apr 6 02:33 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 20K Apr 6 02:33 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 6 20:24 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Apr 6 20:24 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 equiv_col
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 instance
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 iscolored
-rw-r--r-- 1 mcc users 14K 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 Kanban-PT-00200-CTLCardinality-00
FORMULA_NAME Kanban-PT-00200-CTLCardinality-01
FORMULA_NAME Kanban-PT-00200-CTLCardinality-02
FORMULA_NAME Kanban-PT-00200-CTLCardinality-03
FORMULA_NAME Kanban-PT-00200-CTLCardinality-04
FORMULA_NAME Kanban-PT-00200-CTLCardinality-05
FORMULA_NAME Kanban-PT-00200-CTLCardinality-06
FORMULA_NAME Kanban-PT-00200-CTLCardinality-07
FORMULA_NAME Kanban-PT-00200-CTLCardinality-08
FORMULA_NAME Kanban-PT-00200-CTLCardinality-09
FORMULA_NAME Kanban-PT-00200-CTLCardinality-10
FORMULA_NAME Kanban-PT-00200-CTLCardinality-11
FORMULA_NAME Kanban-PT-00200-CTLCardinality-12
FORMULA_NAME Kanban-PT-00200-CTLCardinality-13
FORMULA_NAME Kanban-PT-00200-CTLCardinality-14
FORMULA_NAME Kanban-PT-00200-CTLCardinality-15
=== Now, execution of the tool begins
BK_START 1591212364260
bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-03 19:26:05] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -timeout, 3600, -rebuildPNML]
[2020-06-03 19:26:05] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-03 19:26:05] [INFO ] Load time of PNML (sax parser for PT used): 23 ms
[2020-06-03 19:26:05] [INFO ] Transformed 16 places.
[2020-06-03 19:26:05] [INFO ] Transformed 16 transitions.
[2020-06-03 19:26:05] [INFO ] Parsed PT model containing 16 places and 16 transitions in 52 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 10 ms.
Finished random walk after 9650 steps, including 0 resets, run visited all 30 properties in 8 ms. (steps per millisecond=1206 )
[2020-06-03 19:26:05] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2020-06-03 19:26:05] [INFO ] Flatten gal took : 19 ms
[2020-06-03 19:26:05] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2020-06-03 19:26:05] [INFO ] Flatten gal took : 3 ms
FORMULA Kanban-PT-00200-CTLCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-06-03 19:26:05] [INFO ] Export to MCC properties in file /home/mcc/execution/CTLCardinality.sr.xml took 2 ms.
[2020-06-03 19:26:05] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 0 ms.
info: Time: 3600 - MCC
vrfy: Checking CTLCardinality @ Kanban-PT-00200 @ 3570 seconds
FORMULA Kanban-PT-00200-CTLCardinality-00 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA Kanban-PT-00200-CTLCardinality-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA Kanban-PT-00200-CTLCardinality-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA Kanban-PT-00200-CTLCardinality-03 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA Kanban-PT-00200-CTLCardinality-04 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA Kanban-PT-00200-CTLCardinality-07 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA Kanban-PT-00200-CTLCardinality-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA Kanban-PT-00200-CTLCardinality-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA Kanban-PT-00200-CTLCardinality-05 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA Kanban-PT-00200-CTLCardinality-06 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA Kanban-PT-00200-CTLCardinality-08 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA Kanban-PT-00200-CTLCardinality-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA Kanban-PT-00200-CTLCardinality-01 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA Kanban-PT-00200-CTLCardinality-09 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA Kanban-PT-00200-CTLCardinality-11 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 2518
rslt: Output for CTLCardinality @ Kanban-PT-00200
{
"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=CTLCardinality.xml",
"--mcc",
"--donotcomputecapacities",
"--encoder=simplecompressed",
"--check=modelchecking",
"--stubborn=tarjan",
"--stateequation=par",
"--quickchecks",
"--timelimit=3570",
"--localtimelimit=0",
"--preference=force_ctl",
"--json=CTLCardinality.json",
"--jsoninclude=formula,formulastat,net"
],
"starttime": "Wed Jun 3 19:26:06 2020
",
"timelimit": 3570
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 237
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "EF(AX((p15 + 1 <= p10)))",
"processed_size": 24,
"rewrites": 35
},
"net":
{
"conflict_clusters": 12,
"singleton_clusters": 0
},
"result":
{
"edges": 1224,
"markings": 1217,
"produced_by": "CTL model checker",
"value": true
},
"task":
{
"compoundnumber": 0,
"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": 1,
"G": 0,
"U": 0,
"X": 1,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "EF(AX(((p8 <= p2) AND (p9 <= p1))))",
"processed_size": 35,
"rewrites": 35
},
"net":
{
"conflict_clusters": 12,
"singleton_clusters": 0
},
"result":
{
"edges": 1209,
"markings": 1208,
"produced_by": "CTL model checker",
"value": true
},
"task":
{
"compoundnumber": 1,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 274
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 2,
"F": 1,
"G": 0,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 7,
"taut": 0,
"tconj": 3,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "EF((EX((p4 <= p9)) AND ((p0 + 1 <= p4) AND ((p3 <= p2) AND (3 <= p3)))))",
"processed_size": 72,
"rewrites": 35
},
"net":
{
"conflict_clusters": 12,
"singleton_clusters": 0
},
"result":
{
"edges": 148652037,
"markings": 57566441,
"produced_by": "CTL model checker",
"value": true
},
"task":
{
"compoundnumber": 2,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 289
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "E (F ((p0 <= 1)))",
"processed_size": 17,
"rewrites": 34
},
"result":
{
"edges": 597,
"markings": 598,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 3,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "reachability",
"workflow": "stateequation||search"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 315
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"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": "E (F ((p0 <= 2)))",
"processed_size": 17,
"rewrites": 34
},
"result":
{
"edges": 594,
"markings": 595,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 4,
"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": 347
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"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 ((p0 + 1 <= p8)))",
"processed_size": 22,
"rewrites": 34
},
"result":
{
"edges": 609,
"markings": 609,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 5,
"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": 385
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 1,
"F": 0,
"G": 1,
"U": 1,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 2,
"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((p12 <= 0) U AG((p10 <= p2)))",
"processed_size": 31,
"rewrites": 35
},
"net":
{
"conflict_clusters": 12,
"singleton_clusters": 0
},
"result":
{
"edges": 148238310,
"markings": 138744208,
"produced_by": "CTL model checker",
"value": false
},
"task":
{
"compoundnumber": 6,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 420
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 2,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 1,
"aneg": 0,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 5,
"taut": 0,
"tconj": 2,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "AF(((2 <= p9) AND (AG((3 <= p4)) AND ((p10 <= p8) OR (1 <= p11)))))",
"processed_size": 68,
"rewrites": 35
},
"net":
{
"conflict_clusters": 12,
"singleton_clusters": 0
},
"result":
{
"edges": 3603,
"markings": 1204,
"produced_by": "CTL model checker",
"value": false
},
"task":
{
"compoundnumber": 8,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 490
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 1,
"aneg": 1,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "((p4 <= 2) AND (p8 <= 1))",
"processed_size": 25,
"rewrites": 37
},
"result":
{
"edges": 1204,
"markings": 1204,
"produced_by": "state space /EGEF",
"value": false
},
"task":
{
"compoundnumber": 9,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving",
"visible": 3
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 2,
"problems": 2
},
"type": "eventual_invariance",
"workflow": "stateequation"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 588
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "(p9 <= p6)",
"processed_size": 10,
"rewrites": 36
},
"result":
{
"edges": 4187,
"markings": 2994,
"produced_by": "state space /EGEF",
"value": true
},
"task":
{
"compoundnumber": 10,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving",
"visible": 2
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "possible_preservation_of_reachability",
"workflow": "stateequation"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 735
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 735
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "A (G ((p7 <= 0)))",
"processed_size": 17,
"rewrites": 35
},
"result":
{
"edges": 2,
"markings": 3,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 11,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "invariance",
"workflow": "stateequation||search"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 980
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "(3 <= p10)",
"processed_size": 10,
"rewrites": 36
},
"result":
{
"edges": 1239,
"markings": 1226,
"produced_by": "state space /EGEF",
"value": true
},
"task":
{
"compoundnumber": 12,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving",
"visible": 1
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "possible_preservation_of_reachability",
"workflow": "stateequation"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": true
},
"task":
{
"compoundnumber": 11,
"type": "boolean"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 980
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 980
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 2,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "A (((p7 <= 0) R (p5 + 1 <= p10)))",
"processed_size": 33,
"rewrites": 38
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "state space /EU",
"value": false
},
"task":
{
"compoundnumber": 12,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "eu preserving",
"visible": 1
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "universal_release",
"workflow": "stateequation"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1471
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 2,
"comp": 2,
"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 (((p10 + 1 <= p12) R (p8 + 1 <= p9)))",
"processed_size": 39,
"rewrites": 38
},
"result":
{
"edges": 5413600,
"markings": 1373701,
"produced_by": "state space /EU",
"value": true
},
"task":
{
"compoundnumber": 13,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "eu preserving",
"visible": 3
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "universal_release",
"workflow": "stateequation"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": true
},
"task":
{
"compoundnumber": 12,
"type": "boolean"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1470
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1470
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"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": "E (F ((p13 <= 0)))",
"processed_size": 18,
"rewrites": 34
},
"result":
{
"edges": 600,
"markings": 601,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 13,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "reachability",
"workflow": "stateequation||search"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": true
},
"task":
{
"compoundnumber": 13,
"type": "boolean"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 2940
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 0,
"G": 0,
"U": 1,
"X": 0,
"aconj": 3,
"adisj": 2,
"aneg": 0,
"comp": 8,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 13,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 10,
"visible_transitions": 0
},
"processed": "E (((((p3 <= p1) AND (p6 <= p7)) OR ((3 <= p14) AND (1 <= p9))) U ((p0 <= p3) AND (2 <= p14) AND ((p10 <= p8) OR (p5 <= p9)))))",
"processed_size": 129,
"rewrites": 36
},
"result":
{
"edges": 798,
"markings": 799,
"produced_by": "state space /EU",
"value": true
},
"task":
{
"compoundnumber": 14,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "eu preserving",
"visible": 5
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 6,
"problems": 2
},
"type": "existential_until",
"workflow": "stateequation"
}
}
],
"exit":
{
"error": null,
"memory": 3340,
"runtime": 1052.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "CTLCardinality.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "E(F(A(X(*)))) : (E((* R *)) OR (E(F(*)) OR A(F(*)))) : E(F(**)) : E(F(*)) : A(F(A(G(**)))) : E(G(E(F(**)))) : E(F(**)) : (A(G(**)) OR E(G(E(F(**))))) : E((** U **)) : (A((* R *)) OR A((* R *))) : E((E(F(**)) U A(G(**)))) : E(F(A(X(**)))) : E((** U A(G(**)))) : E(F((E(X(**)) AND (** AND (** AND **))))) : A(F((** AND (A(G(**)) AND **))))"
},
"net":
{
"arcs": 40,
"conflict_clusters": 12,
"places": 16,
"places_significant": 11,
"singleton_clusters": 0,
"transitions": 16
},
"result":
{
"preliminary_value": "yes yes yes yes no yes yes yes yes yes unknown yes no yes no ",
"value": "yes yes yes yes no yes yes yes yes yes unknown yes no yes no "
},
"task":
{
"type": "compound"
}
}
lola: LoLA will run for 3570 seconds at most (--timelimit)
lola: NET
lola: input: PNML file (--pnml)
lola: reading net from model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file model.pnml
lola: 32/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 512
lola: finding significant places
lola: 16 places, 16 transitions, 11 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 CTLCardinality.xml
lola: NOT(A (G (E (X ((p10 <= p15)))))) : ((NOT(A (((p9 <= p10) U (p11 <= p15)))) OR NOT(A (G ((1 <= p13))))) OR NOT(E (G ((p15 <= p5))))) : E (F (A (F ((p0 <= 1))))) : NOT(A (G ((3 <= p0)))) : A (F (A (G (((3 <= p4) OR (2 <= p8)))))) : E (G (E (F ((p9 <= p6))))) : A (F (E (F ((p0 + 1 <= p8))))) : (A (G ((p7 <= 0))) OR E (G (E (F ((3 <= p10)))))) : E (((((p3 <= p1) AND (p6 <= p7)) OR ((3 <= p14) AND (1 <= p9))) U ((p0 <= p3) AND (2 <= p14) AND ((p10 <= p8) OR (p5 <= p9))))) : (NOT(E (((p12 <= p10) U (p9 <= p8)))) OR NOT(E (((1 <= p7) U (p10 <= p5))))) : E ((E (F ((3 <= p6))) U A (G ((p8 <= p3))))) : E (F (A (X (((p8 <= p2) AND (p9 <= p1)))))) : E (((p12 <= 0) U A (G ((p10 <= p2))))) : E (F ((((E (X ((p4 <= p9))) AND (p0 + 1 <= p4)) AND (p3 <= p2)) AND (3 <= p3)))) : A (F ((((2 <= p9) AND A (G ((3 <= p4)))) AND ((p10 <= p8) OR (1 <= p11)))))
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:329
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: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: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:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:455
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:449
lola: rewrite Frontend/Parser/formula_rewrite.k: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:326
lola: rewrite Frontend/Parser/formula_rewrite.k:338
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 237 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (A (X ((p15 + 1 <= p10)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:812
lola: rewrite Frontend/Parser/formula_rewrite.k:806
lola: processed formula: EF(AX((p15 + 1 <= p10)))
lola: processed formula length: 24
lola: 35 rewrites
lola: closed formula file CTLCardinality.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: 1217 markings, 1224 edges
lola: ========================================
lola: subprocess 1 will run for 254 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (A (X (((p8 <= p2) AND (p9 <= p1))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:812
lola: rewrite Frontend/Parser/formula_rewrite.k:806
lola: processed formula: EF(AX(((p8 <= p2) AND (p9 <= p1))))
lola: processed formula length: 35
lola: 35 rewrites
lola: closed formula file CTLCardinality.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: 1208 markings, 1209 edges
lola: ========================================
lola: subprocess 2 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((E (X ((p4 <= p9))) AND ((p0 + 1 <= p4) AND ((p3 <= p2) AND (3 <= p3))))))
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((EX((p4 <= p9)) AND ((p0 + 1 <= p4) AND ((p3 <= p2) AND (3 <= p3)))))
lola: processed formula length: 72
lola: 35 rewrites
lola: closed formula file CTLCardinality.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: 3320943 markings, 8544936 edges, 664189 markings/sec, 0 secs
lola: 6562139 markings, 16882565 edges, 648239 markings/sec, 5 secs
lola: 9732688 markings, 25095898 edges, 634110 markings/sec, 10 secs
lola: 12930451 markings, 33314739 edges, 639553 markings/sec, 15 secs
lola: 16103266 markings, 41517428 edges, 634563 markings/sec, 20 secs
lola: 19225884 markings, 49569502 edges, 624524 markings/sec, 25 secs
lola: 22336904 markings, 57594444 edges, 622204 markings/sec, 30 secs
lola: 25435796 markings, 65607876 edges, 619778 markings/sec, 35 secs
lola: 28517727 markings, 73603170 edges, 616386 markings/sec, 40 secs
lola: 31648961 markings, 81640684 edges, 626247 markings/sec, 45 secs
lola: 34699001 markings, 89559973 edges, 610008 markings/sec, 50 secs
lola: 37804648 markings, 97531965 edges, 621129 markings/sec, 55 secs
lola: 40912084 markings, 105567033 edges, 621487 markings/sec, 60 secs
lola: 44068327 markings, 113701218 edges, 631249 markings/sec, 65 secs
lola: 47188365 markings, 121772274 edges, 624008 markings/sec, 70 secs
lola: 50363209 markings, 129946854 edges, 634969 markings/sec, 75 secs
lola: 53527965 markings, 138164446 edges, 632951 markings/sec, 80 secs
lola: 56767414 markings, 146451714 edges, 647890 markings/sec, 85 secs
lola: 57566441 markings, 148652037 edges, 159805 markings/sec, 90 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 57566441 markings, 148652037 edges
lola: ========================================
lola: subprocess 3 will run for 289 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((p0 <= 1)))
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 ((p0 <= 1)))
lola: processed formula length: 17
lola: 34 rewrites
lola: closed formula file CTLCardinality.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: (p0 <= 1)
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to CTLCardinality-3-0.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 598 markings, 597 edges
lola: ========================================
lola: subprocess 4 will run for 315 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((p0 <= 2)))
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 ((p0 <= 2)))
lola: processed formula length: 17
lola: 34 rewrites
lola: closed formula file CTLCardinality.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: (p0 <= 2)
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 595 markings, 594 edges
lola: state equation: write sara problem file to CTLCardinality-4-0.sara
lola: state equation: calling and running sara
lola: ========================================
sara: try reading problem file CTLCardinality-4-0.sara.
lola: subprocess 5 will run for 347 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((p0 + 1 <= p8)))
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 ((p0 + 1 <= p8)))
lola: processed formula length: 22
lola: 34 rewrites
lola: closed formula file CTLCardinality.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
sara: place or transition ordering is non-deterministic
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: (p0 + 1 <= p8)
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to CTLCardinality-5-0.sara
lola: state equation: calling and running sara
sara: try reading problem file CTLCardinality-5-0.sara.
sara: place or transition ordering is non-deterministic
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 609 markings, 609 edges
lola: ========================================
lola: subprocess 6 will run for 385 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (((p12 <= 0) U A (G ((p10 <= p2)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:813
lola: rewrite Frontend/Parser/formula_rewrite.k:809
lola: processed formula: E((p12 <= 0) U AG((p10 <= p2)))
lola: processed formula length: 31
lola: 35 rewrites
lola: closed formula file CTLCardinality.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: 7465627 markings, 7620502 edges, 1493125 markings/sec, 0 secs
lola: 14633304 markings, 14960764 edges, 1433535 markings/sec, 5 secs
lola: 21697359 markings, 22211357 edges, 1412811 markings/sec, 10 secs
lola: 28676430 markings, 29389759 edges, 1395814 markings/sec, 15 secs
lola: 35656924 markings, 36584449 edges, 1396099 markings/sec, 20 secs
lola: 42518254 markings, 43671306 edges, 1372266 markings/sec, 25 secs
lola: 49362362 markings, 50756094 edges, 1368822 markings/sec, 30 secs
lola: 56152587 markings, 57801410 edges, 1358045 markings/sec, 35 secs
lola: 62862989 markings, 64781378 edges, 1342080 markings/sec, 40 secs
lola: 69536635 markings, 71742119 edges, 1334729 markings/sec, 45 secs
lola: 76141575 markings, 78652701 edges, 1320988 markings/sec, 50 secs
lola: 82696348 markings, 85533941 edges, 1310955 markings/sec, 55 secs
lola: 89229501 markings, 92420436 edges, 1306631 markings/sec, 60 secs
lola: 95752878 markings, 99328884 edges, 1304675 markings/sec, 65 secs
lola: 102301273 markings, 106303419 edges, 1309679 markings/sec, 70 secs
lola: 108744057 markings, 113214723 edges, 1288557 markings/sec, 75 secs
lola: 115075617 markings, 120071138 edges, 1266312 markings/sec, 80 secs
lola: 121245917 markings, 126838816 edges, 1234060 markings/sec, 85 secs
lola: 127271344 markings, 133578617 edges, 1205085 markings/sec, 90 secs
lola: 132945561 markings, 140155811 edges, 1134843 markings/sec, 95 secs
lola: 137768856 markings, 146333908 edges, 964659 markings/sec, 100 secs
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 138744208 markings, 148238310 edges
lola: ========================================
lola: subprocess 7 will run for 420 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E ((E (F ((3 <= p6))) U A (G ((p8 <= p3)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:806
lola: rewrite Frontend/Parser/formula_rewrite.k:813
lola: rewrite Frontend/Parser/formula_rewrite.k:809
lola: processed formula: E(EF((3 <= p6)) U AG((p8 <= p3)))
lola: processed formula length: 33
lola: 36 rewrites
lola: closed formula file CTLCardinality.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: 1895952 markings, 10654478 edges, 379190 markings/sec, 0 secs
lola: 3749961 markings, 21128488 edges, 370802 markings/sec, 5 secs
lola: 5583656 markings, 31451574 edges, 366739 markings/sec, 10 secs
lola: 7364231 markings, 41544419 edges, 356115 markings/sec, 15 secs
lola: 9162419 markings, 51684866 edges, 359638 markings/sec, 20 secs
lola: 10943650 markings, 61711235 edges, 356246 markings/sec, 25 secs
lola: 12725474 markings, 71770599 edges, 356365 markings/sec, 30 secs
lola: 14518660 markings, 81879909 edges, 358637 markings/sec, 35 secs
lola: 16279253 markings, 91847338 edges, 352119 markings/sec, 40 secs
lola: 18070644 markings, 101888597 edges, 358278 markings/sec, 45 secs
lola: 19829605 markings, 111847300 edges, 351792 markings/sec, 50 secs
lola: 21588095 markings, 121804847 edges, 351698 markings/sec, 55 secs
lola: 23405686 markings, 132071965 edges, 363518 markings/sec, 60 secs
lola: 25197279 markings, 142151068 edges, 358319 markings/sec, 65 secs
lola: 26981470 markings, 152223025 edges, 356838 markings/sec, 70 secs
lola: 28739759 markings, 162141082 edges, 351658 markings/sec, 75 secs
lola: 30485749 markings, 171988884 edges, 349198 markings/sec, 80 secs
lola: 32260848 markings, 182023855 edges, 355020 markings/sec, 85 secs
lola: 34022934 markings, 191923962 edges, 352417 markings/sec, 90 secs
lola: 35771494 markings, 201798241 edges, 349712 markings/sec, 95 secs
lola: 37504863 markings, 211596861 edges, 346674 markings/sec, 100 secs
lola: 39216187 markings, 221254461 edges, 342265 markings/sec, 105 secs
lola: 41038208 markings, 231593526 edges, 364404 markings/sec, 110 secs
lola: 42845728 markings, 241753480 edges, 361504 markings/sec, 115 secs
lola: 44641663 markings, 251889136 edges, 359187 markings/sec, 120 secs
lola: 46411915 markings, 261873186 edges, 354050 markings/sec, 125 secs
lola: 48166070 markings, 271768618 edges, 350831 markings/sec, 130 secs
lola: 50009879 markings, 282139987 edges, 368762 markings/sec, 135 secs
lola: 51833982 markings, 292507161 edges, 364821 markings/sec, 140 secs
lola: 53688870 markings, 302939062 edges, 370978 markings/sec, 145 secs
lola: 55522930 markings, 313289234 edges, 366812 markings/sec, 150 secs
lola: 57379134 markings, 323774485 edges, 371241 markings/sec, 155 secs
lola: 59145648 markings, 333974465 edges, 353303 markings/sec, 160 secs
lola: 60858745 markings, 343955268 edges, 342619 markings/sec, 165 secs
lola: 62656344 markings, 354166585 edges, 359520 markings/sec, 170 secs
lola: 64438282 markings, 364343171 edges, 356388 markings/sec, 175 secs
lola: 66236722 markings, 374574348 edges, 359688 markings/sec, 180 secs
lola: 68046773 markings, 384888494 edges, 362010 markings/sec, 185 secs
lola: 69760517 markings, 394664069 edges, 342749 markings/sec, 190 secs
lola: 71506759 markings, 404605383 edges, 349248 markings/sec, 195 secs
lola: 73253760 markings, 414583831 edges, 349400 markings/sec, 200 secs
lola: 74997274 markings, 424504551 edges, 348703 markings/sec, 205 secs
lola: 76756806 markings, 434560704 edges, 351906 markings/sec, 210 secs
lola: 78525808 markings, 444611341 edges, 353800 markings/sec, 215 secs
lola: 80185116 markings, 454091003 edges, 331862 markings/sec, 220 secs
lola: 81850469 markings, 463556063 edges, 333071 markings/sec, 225 secs
lola: 83514714 markings, 473035796 edges, 332849 markings/sec, 230 secs
lola: 85174786 markings, 482503071 edges, 332014 markings/sec, 235 secs
lola: 86836740 markings, 491963829 edges, 332391 markings/sec, 240 secs
lola: 88527362 markings, 501649366 edges, 338124 markings/sec, 245 secs
lola: 90234503 markings, 511351638 edges, 341428 markings/sec, 250 secs
lola: 91898058 markings, 520834134 edges, 332711 markings/sec, 255 secs
lola: 93608503 markings, 530559355 edges, 342089 markings/sec, 260 secs
lola: 95312136 markings, 540276044 edges, 340727 markings/sec, 265 secs
lola: 97010547 markings, 549952600 edges, 339682 markings/sec, 270 secs
lola: 98723973 markings, 559709567 edges, 342685 markings/sec, 275 secs
lola: 100474328 markings, 569695255 edges, 350071 markings/sec, 280 secs
lola: 102154413 markings, 579261791 edges, 336017 markings/sec, 285 secs
lola: 103839933 markings, 588857761 edges, 337104 markings/sec, 290 secs
lola: 105524576 markings, 598454614 edges, 336929 markings/sec, 295 secs
lola: 107204374 markings, 608095000 edges, 335960 markings/sec, 300 secs
lola: 108863475 markings, 617511939 edges, 331820 markings/sec, 305 secs
lola: 110515804 markings, 626921285 edges, 330466 markings/sec, 310 secs
lola: 112177270 markings, 636376855 edges, 332293 markings/sec, 315 secs
lola: 113792887 markings, 645573891 edges, 323123 markings/sec, 320 secs
lola: 115343048 markings, 654428064 edges, 310032 markings/sec, 325 secs
lola: 116766167 markings, 662552511 edges, 284624 markings/sec, 330 secs
lola: 118144956 markings, 670409912 edges, 275758 markings/sec, 335 secs
lola: 119404449 markings, 677571895 edges, 251899 markings/sec, 340 secs
lola: 120729190 markings, 685105015 edges, 264948 markings/sec, 345 secs
lola: 122063864 markings, 692716329 edges, 266935 markings/sec, 350 secs
lola: 123397674 markings, 700338620 edges, 266762 markings/sec, 355 secs
lola: 124748926 markings, 708037642 edges, 270250 markings/sec, 360 secs
lola: 125994268 markings, 715117631 edges, 249068 markings/sec, 365 secs
lola: 127442954 markings, 723477210 edges, 289737 markings/sec, 370 secs
lola: 128464140 markings, 729273028 edges, 204237 markings/sec, 375 secs
lola: 129590349 markings, 735641582 edges, 225242 markings/sec, 380 secs
lola: 130623711 markings, 741503349 edges, 206672 markings/sec, 385 secs
lola: 131376303 markings, 745770250 edges, 150518 markings/sec, 390 secs
lola: 132196600 markings, 750423927 edges, 164059 markings/sec, 395 secs
lola: 132933842 markings, 754598649 edges, 147448 markings/sec, 400 secs
lola: 133730775 markings, 759117298 edges, 159387 markings/sec, 405 secs
lola: 134335521 markings, 762537736 edges, 120949 markings/sec, 410 secs
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 8 will run for 420 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (((2 <= p9) AND (A (G ((3 <= p4))) AND ((p10 <= p8) OR (1 <= p11))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:813
lola: rewrite Frontend/Parser/formula_rewrite.k:811
lola: processed formula: AF(((2 <= p9) AND (AG((3 <= p4)) AND ((p10 <= p8) OR (1 <= p11)))))
lola: processed formula length: 68
lola: 35 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 1204 markings, 3603 edges
lola: ========================================
lola: subprocess 9 will run for 490 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (A (G (((3 <= p4) OR (2 <= p8))))))
lola: ========================================
lola: SUBTASK
lola: checking eventual invariance
lola: rewrite Frontend/Parser/formula_rewrite.k:594
lola: rewrite Frontend/Parser/formula_rewrite.k:629
lola: rewrite Frontend/Parser/formula_rewrite.k:758
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: ((p4 <= 2) AND (p8 <= 1))
lola: processed formula length: 25
lola: 37 rewrites
lola: closed formula file CTLCardinality.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: rewrite Frontend/Parser/formula_rewrite.k:787
lola: state equation task get result rewrite finished id 1
lola: state equation task get result unparse finished++ id 1
lola: formula 1: ((p4 <= 2) AND (p8 <= 1))
lola: state equation task get result unparse finished id 1
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space /EGEF
lola: The predicate is not eventually invariant.
lola: 1204 markings, 1204 edges
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:700
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((3 <= p4) OR (2 <= p8))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 2 literals and 2 conjunctive subformulas
lola: ========================================
lola: subprocess 10 will run for 588 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G (E (F ((p9 <= p6)))))
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: (p9 <= p6)
lola: processed formula length: 10
lola: 36 rewrites
lola: closed formula file CTLCardinality.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 unparse finished++ id 1
lola: formula 1: (p9 <= p6)
lola: state equation task get result unparse finished id 1
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
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: (p6 + 1 <= p9)
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space /EGEF
lola: Reachability of the predicate is possibly preserved.
lola: 2994 markings, 4187 edges
lola: state equation: write sara problem file to CTLCardinality-10-0.sara
lola: state equation: calling and running sara
lola: state equation: write sara problem file to CTLCardinality-10-1.sara
lola: ========================================
lola: subprocess 11 will run for 735 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (G ((p7 <= 0))) OR E (G (E (F ((3 <= p10))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 11 will run for 735 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((p7 <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: A (G ((p7 <= 0)))
lola: processed formula length: 17
lola: 35 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (1 <= p7)
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: state equation: write sara problem file to CTLCardinality-11-0.sara
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 3 markings, 2 edges
lola: ========================================
lola: state equation: calling and running sara
lola: subprocess 12 will run for 980 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G (E (F ((3 <= p10)))))
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: (3 <= p10)
lola: processed formula length: 10
lola: 36 rewrites
lola: closed formula file CTLCardinality.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 unparse finished++ id 1
lola: formula 1: (3 <= p10)
lola: state equation task get result unparse 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: (p10 <= 2)
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to CTLCardinality-12-1.sara
lola: state equation: write sara problem file to CTLCardinality-12-0.sara
lola: state equation: calling and running sara
lola: state equation: calling and running sara
sara: try reading problem file CTLCardinality-11-0.sara.sara:
try reading problem file CTLCardinality-10-0.sara.
sara: place or transition ordering is non-deterministic
sara: place or transition ordering is non-deterministic
sara: try reading problem file CTLCardinality-12-1.sara.
sara: try reading problem file CTLCardinality-12-0.sara.
sara: place or transition ordering is non-deterministic
lola: SUBRESULT
lola: result: yes
lola: produced by: state space /EGEF
lola: Reachability of the predicate is possibly preserved.
lola: 1226 markings, 1239 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 12 will run for 980 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (((p10 + 1 <= p12) R (p8 + 1 <= p9))) OR A (((p7 <= 0) R (p5 + 1 <= p10))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 12 will run for 980 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (((p7 <= 0) R (p5 + 1 <= p10)))
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 (((p7 <= 0) R (p5 + 1 <= p10)))
lola: processed formula length: 33
lola: 38 rewrites
lola: closed formula file CTLCardinality.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: (p10 <= p5)
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to CTLCardinality-12-0.sara
lola: state equation: calling and running sara
sara: try reading problem file CTLCardinality-12-0.sara.
sara: place or transition ordering is non-deterministic
lola: SUBRESULT
lola: result: no
lola: produced by: state space /EU
lola: Predicate Phi does not release Predicate Psi on all paths.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 13 will run for 1471 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (((p10 + 1 <= p12) R (p8 + 1 <= p9)))
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 (((p10 + 1 <= p12) R (p8 + 1 <= p9)))
lola: processed formula length: 39
lola: 38 rewrites
lola: closed formula file CTLCardinality.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: (p9 <= p8)
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to CTLCardinality-13-0.sara
lola: state equation: calling and running sara
sara: try reading problem file CTLCardinality-13-0.sara.
sara: place or transition ordering is non-deterministic
lola: state equation 0: solution produced
lola: SUBRESULT
lola: result: yes
lola: produced by: state space /EU
lola: Predicate Phi releases Predicate Psi on all paths.
lola: 1373701 markings, 5413600 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 13 will run for 1470 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E (((p10 + 1 <= p9) R (p15 + 1 <= p11))) OR (E (F ((p13 <= 0))) OR A (F ((p5 + 1 <= p15)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 13 will run for 1470 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((p13 <= 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 ((p13 <= 0)))
lola: processed formula length: 18
lola: 34 rewrites
lola: closed formula file CTLCardinality.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: (p13 <= 0)
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to CTLCardinality-13-0.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 601 markings, 600 edges
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: ========================================
lola: subprocess 14 will run for 2940 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (((((p3 <= p1) AND (p6 <= p7)) OR ((3 <= p14) AND (1 <= p9))) U ((p0 <= p3) AND (2 <= p14) AND ((p10 <= p8) OR (p5 <= p9)))))
lola: ========================================
lola: SUBTASK
lola: checking existential until
lola: rewrite Frontend/Parser/formula_rewrite.k:618
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: rewrite Frontend/Parser/formula_rewrite.k:738
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: E (((((p3 <= p1) AND (p6 <= p7)) OR ((3 <= p14) AND (1 <= p9))) U ((p0 <= p3) AND (2 <= p14) AND ((p10 <= p8) OR (p5 <= p9)))))
lola: processed formula length: 129
lola: 36 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /EU)
lola: state space: using reachability graph (EU version) (--search=depth)
lola: state space: using eu preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((p0 <= p3) AND (2 <= p14) AND ((p10 <= p8) OR (p5 <= p9)))
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 /EU
lola: There is a path where Predicate Phi holds until Predicate Psi.
lola: 799 markings, 798 edges
lola: ========================================
lola: ========================================
lola: ...considering subproblem: E ((E (F ((3 <= p6))) U A (G ((p8 <= p3)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:806
lola: rewrite Frontend/Parser/formula_rewrite.k:813
lola: rewrite Frontend/Parser/formula_rewrite.k:809
lola: processed formula: E(EF((3 <= p6)) U AG((p8 <= p3)))
lola: processed formula length: 33
lola: 36 rewrites
lola: closed formula file CTLCardinality.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: 1867068 markings, 10495848 edges, 373414 markings/sec, 0 secs
lola: 3700940 markings, 20835172 edges, 366774 markings/sec, 5 secs
lola: 5524282 markings, 31087309 edges, 364668 markings/sec, 10 secs
lola: 7302819 markings, 41160355 edges, 355707 markings/sec, 15 secs
lola: 9081443 markings, 51237656 edges, 355725 markings/sec, 20 secs
lola: 10846341 markings, 61204391 edges, 352980 markings/sec, 25 secs
lola: 12622857 markings, 71196293 edges, 355303 markings/sec, 30 secs
lola: 14406799 markings, 81263935 edges, 356788 markings/sec, 35 secs
lola: 16170903 markings, 91210714 edges, 352821 markings/sec, 40 secs
lola: 17938047 markings, 101177584 edges, 353429 markings/sec, 45 secs
lola: 19688774 markings, 111081537 edges, 350145 markings/sec, 50 secs
lola: 21435548 markings, 120926102 edges, 349355 markings/sec, 55 secs
lola: 23256462 markings, 131186853 edges, 364183 markings/sec, 60 secs
lola: 25044212 markings, 141322579 edges, 357550 markings/sec, 65 secs
lola: 26826944 markings, 151379196 edges, 356546 markings/sec, 70 secs
lola: 28589027 markings, 161298958 edges, 352417 markings/sec, 75 secs
lola: 30318437 markings, 171049011 edges, 345882 markings/sec, 80 secs
lola: 32103829 markings, 181132371 edges, 357078 markings/sec, 85 secs
lola: 33867700 markings, 191080671 edges, 352774 markings/sec, 90 secs
lola: 35638049 markings, 201078967 edges, 354070 markings/sec, 95 secs
lola: 37389540 markings, 210969309 edges, 350298 markings/sec, 100 secs
lola: 39134463 markings, 220787438 edges, 348985 markings/sec, 105 secs
lola: 40971666 markings, 231194658 edges, 367441 markings/sec, 110 secs
lola: 42763669 markings, 241333604 edges, 358401 markings/sec, 115 secs
lola: 44552862 markings, 251389309 edges, 357839 markings/sec, 120 secs
lola: 46302860 markings, 261262976 edges, 350000 markings/sec, 125 secs
lola: 48065639 markings, 271212226 edges, 352556 markings/sec, 130 secs
lola: 49909086 markings, 281631823 edges, 368689 markings/sec, 135 secs
lola: 51755746 markings, 292020499 edges, 369332 markings/sec, 140 secs
lola: 53568663 markings, 302307707 edges, 362583 markings/sec, 145 secs
lola: 55387666 markings, 312533351 edges, 363801 markings/sec, 150 secs
lola: 57197910 markings, 322766426 edges, 362049 markings/sec, 155 secs
lola: 58941421 markings, 332847093 edges, 348702 markings/sec, 160 secs
lola: 60682023 markings, 342928926 edges, 348120 markings/sec, 165 secs
lola: 62494668 markings, 353254749 edges, 362529 markings/sec, 170 secs
lola: 64230136 markings, 363146230 edges, 347094 markings/sec, 175 secs
lola: 65995879 markings, 373201380 edges, 353149 markings/sec, 180 secs
lola: 67787210 markings, 383447644 edges, 358266 markings/sec, 185 secs
lola: 69511042 markings, 393253349 edges, 344766 markings/sec, 190 secs
lola: 71243109 markings, 403142785 edges, 346413 markings/sec, 195 secs
lola: 72958245 markings, 412897550 edges, 343027 markings/sec, 200 secs
lola: 74690482 markings, 422786819 edges, 346447 markings/sec, 205 secs
lola: 76432986 markings, 432693800 edges, 348501 markings/sec, 210 secs
lola: 78172853 markings, 442642955 edges, 347973 markings/sec, 215 secs
lola: 79856138 markings, 452206096 edges, 336657 markings/sec, 220 secs
lola: 81515986 markings, 461658236 edges, 331970 markings/sec, 225 secs
lola: 83200962 markings, 471255984 edges, 336995 markings/sec, 230 secs
lola: 84884213 markings, 480842851 edges, 336650 markings/sec, 235 secs
lola: 86570626 markings, 490444216 edges, 337283 markings/sec, 240 secs
lola: 88281837 markings, 500199299 edges, 342242 markings/sec, 245 secs
lola: 90006438 markings, 510040896 edges, 344920 markings/sec, 250 secs
lola: 91679938 markings, 519560707 edges, 334700 markings/sec, 255 secs
lola: 93383137 markings, 529327223 edges, 340640 markings/sec, 260 secs
lola: 95103768 markings, 539085601 edges, 344126 markings/sec, 265 secs
lola: 96816686 markings, 548888716 edges, 342584 markings/sec, 270 secs
lola: 98548184 markings, 558718870 edges, 346300 markings/sec, 275 secs
lola: 100311502 markings, 568816684 edges, 352664 markings/sec, 280 secs
lola: 102028399 markings, 578540046 edges, 343379 markings/sec, 285 secs
lola: 103715976 markings, 588201683 edges, 337515 markings/sec, 290 secs
lola: 105419306 markings, 597883924 edges, 340666 markings/sec, 295 secs
lola: 107122270 markings, 607601373 edges, 340593 markings/sec, 300 secs
lola: 108795549 markings, 617110960 edges, 334656 markings/sec, 305 secs
lola: 110458375 markings, 626595683 edges, 332565 markings/sec, 310 secs
lola: 112144458 markings, 636175238 edges, 337217 markings/sec, 315 secs
lola: 113330588 markings, 642976513 edges, 237226 markings/sec, 320 secs
lola: 114987222 markings, 652400187 edges, 331327 markings/sec, 325 secs
lola: 116398503 markings, 660435681 edges, 282256 markings/sec, 330 secs
lola: 117851284 markings, 668731388 edges, 290556 markings/sec, 335 secs
lola: 119236361 markings, 676626247 edges, 277015 markings/sec, 340 secs
lola: 120549999 markings, 684092741 edges, 262728 markings/sec, 345 secs
lola: 121888054 markings, 691727927 edges, 267611 markings/sec, 350 secs
lola: 123150348 markings, 698932241 edges, 252459 markings/sec, 355 secs
lola: 124442968 markings, 706324010 edges, 258524 markings/sec, 360 secs
lola: 125805891 markings, 714083509 edges, 272585 markings/sec, 365 secs
lola: 127168483 markings, 721916614 edges, 272518 markings/sec, 370 secs
lola: 128280226 markings, 728227274 edges, 222349 markings/sec, 375 secs
lola: 129347565 markings, 734273443 edges, 213468 markings/sec, 380 secs
lola: 130243578 markings, 739358361 edges, 179203 markings/sec, 385 secs
lola: 131114287 markings, 744289939 edges, 174142 markings/sec, 390 secs
lola: 131815532 markings, 748263942 edges, 140249 markings/sec, 395 secs
lola: 132440853 markings, 751799017 edges, 125064 markings/sec, 400 secs
lola: 133040819 markings, 755211340 edges, 119993 markings/sec, 405 secs
lola: 133697973 markings, 758939796 edges, 131431 markings/sec, 410 secs
lola: 133784363 markings, 759420075 edges, 17278 markings/sec, 415 secs
lola: Child process aborted or communication problem between parent and child process
lola: RESULT
lola:
SUMMARY: yes yes yes yes no yes yes yes yes yes unknown yes no yes no
lola:
preliminary result: yes yes yes yes no yes yes yes yes yes unknown yes no yes no
lola: memory consumption: 3340 KB
lola: time consumption: 1052 seconds
lola: print data as JSON (--json)
lola: writing JSON to CTLCardinality.json
lola: closed JSON file CTLCardinality.json
rslt: finished
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16427332 kB
MemFree: 16302584 kB
After kill :
MemTotal: 16427332 kB
MemFree: 16301812 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="Kanban-PT-00200"
export BK_EXAMINATION="CTLCardinality"
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 Kanban-PT-00200, examination is CTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r184-oct2-158987928700523"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/Kanban-PT-00200.tgz
mv Kanban-PT-00200 execution
cd execution
if [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "UpperBounds" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] || [ "CTLCardinality" = "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 [ "CTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLCardinality" != "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 "CTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLCardinality.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 [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLCardinality"
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 ;