About the Execution of 2019-Gold for ERK-PT-001000
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 15919.470 | 487143.00 | 493744.00 | 797.20 | F?FFFTTTFFTFFFFT | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/mnt/tpsp/fkordon/mcc2020-input.r075-tajo-158922839800227.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2020-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
.................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool win2019
Input is ERK-PT-001000, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r075-tajo-158922839800227
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 176K
-rw-r--r-- 1 mcc users 3.7K Mar 31 14:41 CTLCardinality.txt
-rw-r--r-- 1 mcc users 21K Mar 31 14:41 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Mar 31 14:36 CTLFireability.txt
-rw-r--r-- 1 mcc users 15K Mar 31 14:36 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 8 14:53 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 28 14:01 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.6K Apr 8 14:53 LTLFireability.txt
-rw-r--r-- 1 mcc users 12K Apr 28 14:01 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.9K Mar 31 14:07 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 19K Mar 31 14:07 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Mar 31 14:03 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 13K Mar 31 14:03 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 31 14:11 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Mar 31 14:11 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 equiv_col
-rw-r--r-- 1 mcc users 7 Mar 24 05:37 instance
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 iscolored
-rw-r--r-- 1 mcc users 6.7K 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 ERK-PT-001000-00
FORMULA_NAME ERK-PT-001000-01
FORMULA_NAME ERK-PT-001000-02
FORMULA_NAME ERK-PT-001000-03
FORMULA_NAME ERK-PT-001000-04
FORMULA_NAME ERK-PT-001000-05
FORMULA_NAME ERK-PT-001000-06
FORMULA_NAME ERK-PT-001000-07
FORMULA_NAME ERK-PT-001000-08
FORMULA_NAME ERK-PT-001000-09
FORMULA_NAME ERK-PT-001000-10
FORMULA_NAME ERK-PT-001000-11
FORMULA_NAME ERK-PT-001000-12
FORMULA_NAME ERK-PT-001000-13
FORMULA_NAME ERK-PT-001000-14
FORMULA_NAME ERK-PT-001000-15
=== Now, execution of the tool begins
BK_START 1589553428478
info: Time: 3600 - MCC
vrfy: Checking LTLCardinality @ ERK-PT-001000 @ 3570 seconds
FORMULA ERK-PT-001000-07 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA ERK-PT-001000-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA ERK-PT-001000-08 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA ERK-PT-001000-09 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA ERK-PT-001000-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA ERK-PT-001000-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA ERK-PT-001000-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA ERK-PT-001000-03 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA ERK-PT-001000-02 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA ERK-PT-001000-04 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA ERK-PT-001000-05 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA ERK-PT-001000-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA ERK-PT-001000-06 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA ERK-PT-001000-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA ERK-PT-001000-00 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA ERK-PT-001000-01 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 3083
rslt: Output for LTLCardinality @ ERK-PT-001000
{
"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": "mcc2019",
"markinglimit": null,
"parameters":
[
"--pnmlnet",
"model.pnml",
"--xmlformula",
"--formula=LTLCardinality.xml",
"--mcc",
"--donotcomputecapacities",
"--encoder=simplecompressed",
"--check=modelchecking",
"--stubborn=deletion",
"--stateequation=par",
"--timelimit=3570",
"--localtimelimit=0",
"--preference=force_ltl",
"--json=LTLCardinality.json",
"--jsoninclude=formula,formulastat,net"
],
"starttime": "Fri May 15 14:37:08 2020
",
"timelimit": 3570
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 222
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 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": "(RKIPP + 1 <= ERK)",
"processed_size": 18,
"rewrites": 122
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 0,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 237
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 0,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 0,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 0,
"visible_transitions": 0
},
"processed": "TRUE",
"processed_size": 4,
"rewrites": 122
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 1,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 254
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 254
},
"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": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "A (G ((Raf1Star_RKIP_ERKPP <= RKIP)))",
"processed_size": 37,
"rewrites": 124
},
"result":
{
"edges": 1007,
"markings": 1006,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 2,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "invariance",
"workflow": "stateequation||search"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 2,
"type": "boolean"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 274
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 274
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 1,
"G": 0,
"U": 1,
"X": 0,
"aconj": 0,
"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": "A ((F ((RKIPP <= ERK)) U (Raf1Star <= MEKPP)))",
"processed_size": 46,
"rewrites": 122
},
"result":
{
"edges": 0,
"markings": 1,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 3,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 297
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 1,
"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": "A (X ((MEKPP + 1 <= Raf1Star)))",
"processed_size": 31,
"rewrites": 122
},
"result":
{
"edges": 2009,
"markings": 2009,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 4,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 3,
"type": "boolean"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 297
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 2,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 1,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "A ((X (TRUE) OR ((1 <= Raf1Star_RKIP) AND X ((Raf1Star <= 1)))))",
"processed_size": 64,
"rewrites": 122
},
"result":
{
"edges": 4,
"markings": 5,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 4
},
"compoundnumber": 4,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 324
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 4,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "A (X (X (X (G (((Raf1Star_RKIP + 1 <= ERK) OR X ((RP <= RKIP))))))))",
"processed_size": 68,
"rewrites": 122
},
"result":
{
"edges": 2010,
"markings": 2010,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 6
},
"compoundnumber": 5,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 356
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 356
},
"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": "(ERK + 1 <= MEKPP)",
"processed_size": 18,
"rewrites": 122
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 6,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 6,
"type": "boolean"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 416
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 1,
"aneg": 1,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "A (G (((1 <= Raf1Star) OR (2 <= Raf1Star_RKIP) OR ((1 <= Raf1Star) AND (2 <= Raf1Star_RKIP)))))",
"processed_size": 97,
"rewrites": 124
},
"result":
{
"produced_by": "state equation",
"value": false
},
"task":
{
"compoundnumber": 8,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 6,
"problems": 2
},
"type": "invariance",
"workflow": "stateequation||search"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 475
},
"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": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "A (G ((RKIPP_RP <= RKIPP)))",
"processed_size": 27,
"rewrites": 124
},
"result":
{
"edges": 6,
"markings": 7,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 9,
"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": 554
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 2,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "A (F (G (((RKIPP <= MEKPP_ERK) OR F ((RKIPP <= MEKPP_ERK))))))",
"processed_size": 62,
"rewrites": 122
},
"result":
{
"edges": 6024,
"markings": 5016,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 10,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 665
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 0,
"U": 2,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 5,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "A (((RP <= Raf1Star) U ((RP <= Raf1Star) U (Raf1Star_RKIP_ERKPP <= 2))))",
"processed_size": 72,
"rewrites": 122
},
"result":
{
"edges": 0,
"markings": 1,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 11,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 832
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 2,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 3,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 6,
"taut": 0,
"tconj": 0,
"tdisj": 2,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "A ((G ((2 <= Raf1Star_RKIP)) OR (G ((RKIPP_RP + 1 <= Raf1Star)) OR ((RKIP <= 2) R (RKIP + 1 <= RKIPP)))))",
"processed_size": 105,
"rewrites": 122
},
"result":
{
"edges": 3750500,
"markings": 1503501,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 8
},
"compoundnumber": 12,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1108
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1108
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"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": "(Raf1Star <= 0)",
"processed_size": 15,
"rewrites": 124
},
"result":
{
"edges": 0,
"markings": 1,
"produced_by": "state space / EG",
"value": true
},
"task":
{
"compoundnumber": 13,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 3
},
"threads": 1,
"type": "dfs"
},
"type": "eventual_occurrence"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1662
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"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": "(MEKPP_ERK + 1 <= RKIPP)",
"processed_size": 24,
"rewrites": 124
},
"result":
{
"edges": 0,
"markings": 1,
"produced_by": "state space / EG",
"value": true
},
"task":
{
"compoundnumber": 14,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 6
},
"threads": 1,
"type": "dfs"
},
"type": "eventual_occurrence"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": true
},
"task":
{
"compoundnumber": 13,
"type": "boolean"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1662
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1662
},
"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 ((RKIPP_RP <= 2)))",
"processed_size": 23,
"rewrites": 124
},
"result":
{
"edges": 38,
"markings": 25,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 14,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"type": "invariance",
"workflow": "stateequation||search"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 14,
"type": "boolean"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3325
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3325
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"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": "A (G ((MEKPP_ERK <= 1)))",
"processed_size": 24,
"rewrites": 124
},
"result":
{
"edges": 2,
"markings": 3,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 15,
"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"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 15,
"type": "boolean"
}
}
],
"exit":
{
"error": null,
"memory": 22556,
"runtime": 487.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "LTLCardinality.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "(A(G(*)) AND A(G((G(*) OR G(F((** AND G(*)))))))) : A((G(**) OR (G((X(*) R *)) AND F(G(**))))) : A(G(**)) : A(G(*)) : A(F(G((** OR F(**))))) : A((** U (** U **))) : (A(F(**)) AND A(F(**))) : * : (A(G(**)) AND A(X(TRUE))) : (A(X(**)) AND A((F(**) U **))) : A((X(TRUE) OR (** AND X(*)))) : A((G(**) OR (G(*) OR (* R *)))) : (A(F(**)) AND (A(G(**)) AND A(G(**)))) : A(X(X(X(G((** OR X(**))))))) : (** AND A(G(F((* AND X(G(*))))))) : TRUE"
},
"net":
{
"arcs": 34,
"conflict_clusters": 7,
"places": 11,
"places_significant": 6,
"singleton_clusters": 0,
"transitions": 11
},
"result":
{
"preliminary_value": "no unknown no no no yes yes yes no no yes no no no no yes ",
"value": "no unknown no no no yes yes yes no no yes no no no no 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: 22/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 352
lola: finding significant places
lola: 11 places, 11 transitions, 6 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 LTLCardinality.xml
lola: LP says that atomic proposition is always true: (ERK <= MEKPP)
lola: LP says that atomic proposition is always true: (ERK <= MEKPP)
lola: LP says that atomic proposition is always true: (ERK <= MEKPP)
lola: LP says that atomic proposition is always true: (RKIPP <= RP)
lola: A (NOT(F ((F (NOT(F (((1 <= MEKPP) AND NOT(F ((1 <= MEKPP))))))) U F ((2 <= MEKPP_ERK)))))) : A ((G (NOT((X ((2 <= ERK)) U (2 <= ERK)))) U G ((3 <= RP)))) : A ((G ((RKIPP_RP <= RKIPP)) AND F ((0 <= Raf1Star_RKIP)))) : A ((F (NOT(G ((0 <= Raf1Star)))) U NOT(F (((Raf1Star <= 0) AND (Raf1Star_RKIP <= 1) AND ((Raf1Star <= 0) OR (Raf1Star_RKIP <= 1))))))) : A (G ((((ERK + 1 <= RKIPP_RP) OR G ((RKIPP_RP <= ERK))) U F (G (((RKIPP <= MEKPP_ERK) OR F ((RKIPP <= MEKPP_ERK)))))))) : A (((RP <= Raf1Star) U ((ERK <= MEKPP) AND ((RP <= Raf1Star) U (Raf1Star_RKIP_ERKPP <= 2))))) : A ((F ((RKIPP <= MEKPP_ERK)) AND ((RKIPP <= MEKPP_ERK) U F ((1 <= Raf1Star))))) : A (NOT(((ERK <= RKIPP) AND (X ((ERK <= MEKPP)) OR (F ((ERK <= MEKPP)) AND G ((RKIP + 1 <= Raf1Star_RKIP))))))) : A (G (((Raf1Star_RKIP_ERKPP <= RKIP) AND X (F (((0 <= RKIPP) OR F ((0 <= RKIPP)))))))) : A ((X ((MEKPP + 1 <= Raf1Star)) AND (F ((RKIPP <= ERK)) U (Raf1Star <= MEKPP)))) : A ((G (F (X (G ((0 <= MEKPP_ERK))))) OR ((1 <= Raf1Star_RKIP) AND NOT(X ((2 <= Raf1Star)))))) : A ((G ((2 <= Raf1Star_RKIP)) OR NOT((F ((Raf1Star <= RKIPP_RP)) AND ((3 <= RKIP) U (RKIPP <= RKIP)))))) : A (((F ((2 <= MEKPP_ERK)) AND G ((2 <= Raf1Star_RKIP))) AND G ((RKIPP_RP <= 2)))) : A (X (NOT(F (X (X ((F ((3 <= MEKPP)) U NOT(((Raf1Star_RKIP + 1 <= ERK) OR X ((RP <= RKIP))))))))))) : A (((ERK + 1 <= MEKPP) AND G (NOT(G (X ((((RKIPP_RP <= 1) AND (MEKPP <= ERK)) OR X (F ((ERKPP <= RP)))))))))) : A (F (NOT(G (((ERKPP + 1 <= Raf1Star_RKIP_ERKPP) AND NOT(G (((RKIPP <= RP) OR F ((1 <= RP))))))))))
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:428
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:545
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:338
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:154
lola: rewrite Frontend/Parser/formula_rewrite.k:115
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:160
lola: rewrite Frontend/Parser/formula_rewrite.k:279
lola: rewrite Frontend/Parser/formula_rewrite.k:157
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:185
lola: rewrite Frontend/Parser/formula_rewrite.k:422
lola: rewrite Frontend/Parser/formula_rewrite.k:374
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:116
lola: rewrite Frontend/Parser/formula_rewrite.k:422
lola: rewrite Frontend/Parser/formula_rewrite.k:536
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:154
lola: rewrite Frontend/Parser/formula_rewrite.k:116
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:279
lola: rewrite Frontend/Parser/formula_rewrite.k:145
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:118
lola: rewrite Frontend/Parser/formula_rewrite.k:121
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:154
lola: rewrite Frontend/Parser/formula_rewrite.k:124
lola: rewrite Frontend/Parser/formula_rewrite.k:154
lola: rewrite Frontend/Parser/formula_rewrite.k:545
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:160
lola: rewrite Frontend/Parser/formula_rewrite.k:536
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:160
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:154
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:160
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
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:522
lola: rewrite Frontend/Parser/formula_rewrite.k:536
lola: rewrite Frontend/Parser/formula_rewrite.k:545
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:434
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:536
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:124
lola: rewrite Frontend/Parser/formula_rewrite.k:160
lola: rewrite Frontend/Parser/formula_rewrite.k:279
lola: rewrite Frontend/Parser/formula_rewrite.k:117
lola: rewrite Frontend/Parser/formula_rewrite.k:163
lola: rewrite Frontend/Parser/formula_rewrite.k:282
lola: rewrite Frontend/Parser/formula_rewrite.k:154
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 222 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (RKIPP + 1 <= ERK)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (RKIPP + 1 <= ERK)
lola: processed formula length: 18
lola: 122 rewrites
lola: closed formula file LTLCardinality.xml
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 1 will run for 237 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: TRUE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: TRUE
lola: processed formula length: 4
lola: 122 rewrites
lola: closed formula file LTLCardinality.xml
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 2 will run for 254 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (G ((Raf1Star_RKIP_ERKPP <= RKIP))) AND A (X (TRUE)))
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: A (G ((Raf1Star_RKIP_ERKPP <= RKIP)))
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 ((Raf1Star_RKIP_ERKPP <= RKIP)))
lola: processed formula length: 37
lola: 124 rewrites
lola: closed formula file LTLCardinality.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: (RKIP + 1 <= Raf1Star_RKIP_ERKPP)
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
lola: The predicate is not invariant.
lola: 1006 markings, 1007 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 3 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (X ((MEKPP + 1 <= Raf1Star))) AND A ((F ((RKIPP <= ERK)) U (Raf1Star <= MEKPP))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 3 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A ((F ((RKIPP <= ERK)) U (Raf1Star <= MEKPP)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A ((F ((RKIPP <= ERK)) U (Raf1Star <= MEKPP)))
lola: processed formula length: 46
lola: 122 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 1 markings, 0 edges
lola: ========================================
lola: subprocess 4 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X ((MEKPP + 1 <= Raf1Star)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X ((MEKPP + 1 <= Raf1Star)))
lola: processed formula length: 31
lola: 122 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 2009 markings, 2009 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 4 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A ((X (TRUE) OR ((1 <= Raf1Star_RKIP) AND X ((Raf1Star <= 1)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A ((X (TRUE) OR ((1 <= Raf1Star_RKIP) AND X ((Raf1Star <= 1)))))
lola: processed formula length: 64
lola: 122 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 4 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 5 markings, 4 edges
lola: ========================================
lola: subprocess 5 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (X (X (G (((Raf1Star_RKIP + 1 <= ERK) OR X ((RP <= RKIP))))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (X (X (G (((Raf1Star_RKIP + 1 <= ERK) OR X ((RP <= RKIP))))))))
lola: processed formula length: 68
lola: 122 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 6 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 2010 markings, 2010 edges
lola: ========================================
lola: subprocess 6 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((ERK + 1 <= MEKPP) AND A (G (F ((((2 <= RKIPP_RP) OR (ERK + 1 <= MEKPP)) AND X (G ((RP + 1 <= ERKPP))))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 6 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (ERK + 1 <= MEKPP)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (ERK + 1 <= MEKPP)
lola: processed formula length: 18
lola: 122 rewrites
lola: closed formula file LTLCardinality.xml
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 7 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A ((G ((3 <= RP)) OR (G ((X ((ERK <= 1)) R (ERK <= 1))) AND F (G ((3 <= RP))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A ((G ((3 <= RP)) OR (G ((X ((ERK <= 1)) R (ERK <= 1))) AND F (G ((3 <= RP))))))
lola: processed formula length: 80
lola: 122 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 8 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: 3782630 markings, 9884717 edges, 756526 markings/sec, 0 secs
lola: 7070333 markings, 18668548 edges, 657541 markings/sec, 5 secs
lola: 10101230 markings, 26805669 edges, 606179 markings/sec, 10 secs
lola: 12770794 markings, 34931964 edges, 533913 markings/sec, 15 secs
lola: 14510013 markings, 43523025 edges, 347844 markings/sec, 20 secs
lola: 16609902 markings, 49349795 edges, 419978 markings/sec, 25 secs
lola: 19063059 markings, 55873356 edges, 490631 markings/sec, 30 secs
lola: 21910088 markings, 63375252 edges, 569406 markings/sec, 35 secs
lola: 23319268 markings, 72185132 edges, 281836 markings/sec, 40 secs
lola: 25097592 markings, 79073122 edges, 355665 markings/sec, 45 secs
lola: 27179664 markings, 84806562 edges, 416414 markings/sec, 50 secs
lola: 29272662 markings, 90573213 edges, 418600 markings/sec, 55 secs
lola: 31336389 markings, 96257407 edges, 412745 markings/sec, 60 secs
lola: 33865555 markings, 102914636 edges, 505833 markings/sec, 65 secs
lola: 36541688 markings, 109847057 edges, 535227 markings/sec, 70 secs
lola: 38403537 markings, 118198319 edges, 372370 markings/sec, 75 secs
lola: 39744078 markings, 126774467 edges, 268108 markings/sec, 80 secs
lola: 41500825 markings, 132432564 edges, 351349 markings/sec, 85 secs
lola: 43002230 markings, 136556810 edges, 300281 markings/sec, 90 secs
lola: 44422766 markings, 140470277 edges, 284107 markings/sec, 95 secs
lola: 45948450 markings, 144647372 edges, 305137 markings/sec, 100 secs
lola: 47406989 markings, 148678275 edges, 291708 markings/sec, 105 secs
lola: 48865929 markings, 152706210 edges, 291788 markings/sec, 110 secs
lola: 50395236 markings, 156895947 edges, 305861 markings/sec, 115 secs
lola: 51937869 markings, 161142793 edges, 308527 markings/sec, 120 secs
lola: 53497581 markings, 165436118 edges, 311942 markings/sec, 125 secs
lola: 54969267 markings, 169480885 edges, 294337 markings/sec, 130 secs
lola: 56484421 markings, 173670007 edges, 303031 markings/sec, 135 secs
lola: 58001009 markings, 177819898 edges, 303318 markings/sec, 140 secs
lola: 59499829 markings, 181957636 edges, 299764 markings/sec, 145 secs
lola: 60994983 markings, 186065667 edges, 299031 markings/sec, 150 secs
lola: 62543489 markings, 190343746 edges, 309701 markings/sec, 155 secs
lola: 64155797 markings, 194734193 edges, 322462 markings/sec, 160 secs
lola: 65750666 markings, 199102305 edges, 318974 markings/sec, 165 secs
lola: 67253374 markings, 203247352 edges, 300542 markings/sec, 170 secs
lola: 68750131 markings, 207362599 edges, 299351 markings/sec, 175 secs
lola: 70282318 markings, 211551179 edges, 306437 markings/sec, 180 secs
lola: 71864908 markings, 215886543 edges, 316518 markings/sec, 185 secs
lola: 73343174 markings, 219940411 edges, 295653 markings/sec, 190 secs
lola: 74933066 markings, 224308412 edges, 317978 markings/sec, 195 secs
lola: 76496386 markings, 228611899 edges, 312664 markings/sec, 200 secs
lola: 77971132 markings, 232651844 edges, 294949 markings/sec, 205 secs
lola: 79431211 markings, 236656261 edges, 292016 markings/sec, 210 secs
lola: 80972470 markings, 240885359 edges, 308252 markings/sec, 215 secs
lola: 82542860 markings, 245180438 edges, 314078 markings/sec, 220 secs
lola: 83922204 markings, 248981865 edges, 275869 markings/sec, 225 secs
lola: 84007391 markings, 249204768 edges, 17037 markings/sec, 230 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 8 will run for 416 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((1 <= Raf1Star) OR (2 <= Raf1Star_RKIP) OR ((1 <= Raf1Star) AND (2 <= Raf1Star_RKIP)))))
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:788
lola: processed formula: A (G (((1 <= Raf1Star) OR (2 <= Raf1Star_RKIP) OR ((1 <= Raf1Star) AND (2 <= Raf1Star_RKIP)))))
lola: processed formula length: 97
lola: 124 rewrites
lola: closed formula file LTLCardinality.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:788
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((Raf1Star <= 0) AND (Raf1Star_RKIP <= 1) AND ((Raf1Star <= 0) OR (Raf1Star_RKIP <= 1)))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 6 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to LTLCardinality-8-0.sara
lola: state equation: calling and running sara
sara: try reading problem file LTLCardinality-8-0.sara.
lola: state equation 0: solution produced
lola: SUBRESULT
lola: result: no
lola: produced by: state equation
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 9 will run for 475 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((RKIPP_RP <= RKIPP)))
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 ((RKIPP_RP <= RKIPP)))
lola: processed formula length: 27
lola: 124 rewrites
lola: closed formula file LTLCardinality.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: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (RKIPP + 1 <= RKIPP_RP)
lola: state equation task get result unparse finished id 0
lola: 7 markings, 6 edges
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: ========================================
lola: subprocess 10 will run for 554 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (G (((RKIPP <= MEKPP_ERK) OR F ((RKIPP <= MEKPP_ERK))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F (G (((RKIPP <= MEKPP_ERK) OR F ((RKIPP <= MEKPP_ERK))))))
lola: processed formula length: 62
lola: 122 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: add low 0
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 5016 markings, 6024 edges
lola: ========================================
lola: subprocess 11 will run for 665 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (((RP <= Raf1Star) U ((RP <= Raf1Star) U (Raf1Star_RKIP_ERKPP <= 2))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (((RP <= Raf1Star) U ((RP <= Raf1Star) U (Raf1Star_RKIP_ERKPP <= 2))))
lola: processed formula length: 72
lola: 122 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 1 markings, 0 edges
lola: ========================================
lola: subprocess 12 will run for 832 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A ((G ((2 <= Raf1Star_RKIP)) OR (G ((RKIPP_RP + 1 <= Raf1Star)) OR ((RKIP <= 2) R (RKIP + 1 <= RKIPP)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A ((G ((2 <= Raf1Star_RKIP)) OR (G ((RKIPP_RP + 1 <= Raf1Star)) OR ((RKIP <= 2) R (RKIP + 1 <= RKIPP)))))
lola: processed formula length: 105
lola: 122 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 8 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 1503501 markings, 3750500 edges
lola: ========================================
lola: subprocess 13 will run for 1108 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (F ((RKIPP <= MEKPP_ERK))) AND A (F ((1 <= Raf1Star))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 13 will run for 1108 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F ((1 <= Raf1Star)))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:749
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: (Raf1Star <= 0)
lola: processed formula length: 15
lola: 124 rewrites
lola: closed formula file LTLCardinality.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: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: state space / EG
lola: The predicate eventually occurs.
lola: 1 markings, 0 edges
lola: ========================================
lola: subprocess 14 will run for 1662 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F ((RKIPP <= MEKPP_ERK)))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:749
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: (MEKPP_ERK + 1 <= RKIPP)
lola: processed formula length: 24
lola: 124 rewrites
lola: closed formula file LTLCardinality.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: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: state space / EG
lola: The predicate eventually occurs.
lola: 1 markings, 0 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 14 will run for 1662 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (F ((2 <= MEKPP_ERK))) AND (A (G ((2 <= Raf1Star_RKIP))) AND A (G ((RKIPP_RP <= 2)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 14 will run for 1662 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((RKIPP_RP <= 2)))
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 ((RKIPP_RP <= 2)))
lola: processed formula length: 23
lola: 124 rewrites
lola: closed formula file LTLCardinality.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: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 25 markings, 38 edges
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: lola: formula 0: (3 <= RKIPP_RP)
lola: SUBRESULT
lola: state equation task get result unparse finished id 0
lola: result: no
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
The Boolean predicate is false.
lola: ========================================
lola: ========================================
lola: subprocess 15 will run for 3325 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (G ((MEKPP_ERK <= 1))) AND A (G ((G ((MEKPP_ERK <= 1)) OR G (F (((1 <= MEKPP) AND G ((MEKPP <= 0)))))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 15 will run for 3325 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((MEKPP_ERK <= 1)))
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:788
lola: processed formula: A (G ((MEKPP_ERK <= 1)))
lola: processed formula length: 24
lola: 124 rewrites
lola: closed formula file LTLCardinality.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: SUBRESULT
lola: result: no
lola: produced by: state space
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: The predicate is not invariant.
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (2 <= MEKPP_ERK)
lola: state equation task get result unparse finished id 0
lola: 3 markings, 2 edges
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: ========================================
lola: ...considering subproblem: A ((G ((3 <= RP)) OR (G ((X ((ERK <= 1)) R (ERK <= 1))) AND F (G ((3 <= RP))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A ((G ((3 <= RP)) OR (G ((X ((ERK <= 1)) R (ERK <= 1))) AND F (G ((3 <= RP))))))
lola: processed formula length: 80
lola: 122 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 8 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: 3861569 markings, 10101651 edges, 772314 markings/sec, 0 secs
lola: 6877550 markings, 18186603 edges, 603196 markings/sec, 5 secs
lola: 9674027 markings, 25677156 edges, 559295 markings/sec, 10 secs
lola: 12256857 markings, 32501417 edges, 516566 markings/sec, 15 secs
lola: 13783985 markings, 41016164 edges, 305426 markings/sec, 20 secs
lola: 15671909 markings, 46745599 edges, 377585 markings/sec, 25 secs
lola: 17385247 markings, 51494281 edges, 342668 markings/sec, 30 secs
lola: 19805402 markings, 57811410 edges, 484031 markings/sec, 35 secs
lola: 22115388 markings, 64659026 edges, 461997 markings/sec, 40 secs
lola: 23336167 markings, 72291038 edges, 244156 markings/sec, 45 secs
lola: 24852382 markings, 78389666 edges, 303243 markings/sec, 50 secs
lola: 26478668 markings, 82882295 edges, 325257 markings/sec, 55 secs
lola: 28056629 markings, 87216920 edges, 315592 markings/sec, 60 secs
lola: 29575435 markings, 91415719 edges, 303761 markings/sec, 65 secs
lola: 31084901 markings, 95560876 edges, 301893 markings/sec, 70 secs
lola: 33060859 markings, 100830073 edges, 395192 markings/sec, 75 secs
lola: 35301012 markings, 106632953 edges, 448031 markings/sec, 80 secs
lola: 37631790 markings, 113258755 edges, 466156 markings/sec, 85 secs
lola: 38853742 markings, 121082823 edges, 244390 markings/sec, 90 secs
lola: 40124767 markings, 128639814 edges, 254205 markings/sec, 95 secs
lola: 41550427 markings, 132567574 edges, 285132 markings/sec, 100 secs
lola: 42946753 markings, 136404866 edges, 279265 markings/sec, 105 secs
lola: 44351198 markings, 140269874 edges, 280889 markings/sec, 110 secs
lola: 45785965 markings, 144197559 edges, 286953 markings/sec, 115 secs
lola: 47365775 markings, 148561898 edges, 315962 markings/sec, 120 secs
lola: 48875738 markings, 152733254 edges, 301993 markings/sec, 125 secs
lola: 50424780 markings, 156975913 edges, 309808 markings/sec, 130 secs
lola: 52002355 markings, 161321869 edges, 315515 markings/sec, 135 secs
lola: 53576098 markings, 165654064 edges, 314749 markings/sec, 140 secs
lola: 54889209 markings, 169260190 edges, 262622 markings/sec, 145 secs
lola: 56314410 markings, 173199644 edges, 285040 markings/sec, 150 secs
lola: 57699924 markings, 176995438 edges, 277103 markings/sec, 155 secs
lola: 59185587 markings, 181090842 edges, 297133 markings/sec, 160 secs
lola: 60677259 markings, 185195791 edges, 298334 markings/sec, 165 secs
lola: 62154856 markings, 189275641 edges, 295519 markings/sec, 170 secs
lola: 63848908 markings, 193895094 edges, 338810 markings/sec, 175 secs
lola: 65527130 markings, 198494739 edges, 335644 markings/sec, 180 secs
lola: 67150675 markings, 202960139 edges, 324709 markings/sec, 185 secs
lola: 68747230 markings, 207354713 edges, 319311 markings/sec, 190 secs
lola: 70348713 markings, 211733990 edges, 320297 markings/sec, 195 secs
lola: 72015054 markings, 216296297 edges, 333268 markings/sec, 200 secs
lola: 73661285 markings, 220811474 edges, 329246 markings/sec, 205 secs
lola: 75291641 markings, 225299020 edges, 326071 markings/sec, 210 secs
lola: 76969670 markings, 229905584 edges, 335606 markings/sec, 215 secs
lola: 78632570 markings, 234471081 edges, 332580 markings/sec, 220 secs
lola: 80303840 markings, 239048891 edges, 334254 markings/sec, 225 secs
lola: 81925262 markings, 243496234 edges, 324284 markings/sec, 230 secs
lola: 83536989 markings, 247916503 edges, 322345 markings/sec, 235 secs
lola: Child process aborted or communication problem between parent and child process
lola: RESULT
lola:
SUMMARY: no unknown no no no yes yes yes no no yes no no no no yes
lola:
preliminary result: no unknown no no no yes yes yes no no yes no no no no yes
lola: memory consumption: 22556 KB
lola: time consumption: 487 seconds
lola: print data as JSON (--json)
lola: writing JSON to LTLCardinality.json
lola: closed JSON file LTLCardinality.json
rslt: finished
BK_STOP 1589553915621
--------------------
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="ERK-PT-001000"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="win2019"
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 win2019"
echo " Input is ERK-PT-001000, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r075-tajo-158922839800227"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/ERK-PT-001000.tgz
mv ERK-PT-001000 execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "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 [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "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 "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.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 [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
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 ;