About the Execution of 2019-Gold for ERK-PT-000100
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
15919.550 | 1050619.00 | 1051432.00 | 5150.50 | FTF?FFTFFTTFFFF? | 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-158922839800225.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-000100, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r075-tajo-158922839800225
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 188K
-rw-r--r-- 1 mcc users 3.8K 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:35 CTLFireability.txt
-rw-r--r-- 1 mcc users 15K Mar 31 14:35 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.8K Apr 8 14:53 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 28 14:01 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K Mar 31 14:07 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 18K Mar 31 14:07 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Mar 31 14:03 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 17K 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.7K 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-000100-00
FORMULA_NAME ERK-PT-000100-01
FORMULA_NAME ERK-PT-000100-02
FORMULA_NAME ERK-PT-000100-03
FORMULA_NAME ERK-PT-000100-04
FORMULA_NAME ERK-PT-000100-05
FORMULA_NAME ERK-PT-000100-06
FORMULA_NAME ERK-PT-000100-07
FORMULA_NAME ERK-PT-000100-08
FORMULA_NAME ERK-PT-000100-09
FORMULA_NAME ERK-PT-000100-10
FORMULA_NAME ERK-PT-000100-11
FORMULA_NAME ERK-PT-000100-12
FORMULA_NAME ERK-PT-000100-13
FORMULA_NAME ERK-PT-000100-14
FORMULA_NAME ERK-PT-000100-15
=== Now, execution of the tool begins
BK_START 1589553416356
info: Time: 3600 - MCC
vrfy: Checking LTLCardinality @ ERK-PT-000100 @ 3570 seconds
FORMULA ERK-PT-000100-06 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA ERK-PT-000100-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA ERK-PT-000100-00 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA ERK-PT-000100-07 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA ERK-PT-000100-08 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA ERK-PT-000100-09 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA ERK-PT-000100-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA ERK-PT-000100-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA ERK-PT-000100-01 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA ERK-PT-000100-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA ERK-PT-000100-04 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA ERK-PT-000100-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA ERK-PT-000100-02 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA ERK-PT-000100-05 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA ERK-PT-000100-03 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA ERK-PT-000100-15 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 2520
rslt: Output for LTLCardinality @ ERK-PT-000100
{
"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:36:56 2020
",
"timelimit": 3570
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 222
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 0,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 0,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 0,
"visible_transitions": 0
},
"processed": "TRUE",
"processed_size": 4,
"rewrites": 101
},
"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": "FALSE",
"processed_size": 5,
"rewrites": 101
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 1,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 254
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 1,
"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 (X (G ((1 <= MEKPP))))",
"processed_size": 24,
"rewrites": 101
},
"result":
{
"edges": 54226,
"markings": 22037,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 3,
"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": 275
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 275
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"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 (G ((ERK <= RKIPP))))",
"processed_size": 26,
"rewrites": 101
},
"result":
{
"edges": 205,
"markings": 205,
"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": 4,
"type": "boolean"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 300
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 300
},
"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 ((Raf1Star <= 0)))",
"processed_size": 23,
"rewrites": 103
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "state space",
"value": false
},
"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": "invariance",
"workflow": "stateequation||search"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 5,
"type": "boolean"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 331
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 1,
"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": "A (X (TRUE))",
"processed_size": 12,
"rewrites": 101
},
"result":
{
"edges": 2,
"markings": 3,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 6,
"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": 367
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 1,
"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": "A (X (TRUE))",
"processed_size": 12,
"rewrites": 101
},
"result":
{
"edges": 2,
"markings": 3,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 7,
"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": 413
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 413
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 1,
"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 (X (G ((MEKPP_ERK <= 2))))",
"processed_size": 28,
"rewrites": 101
},
"result":
{
"edges": 317,
"markings": 263,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 8,
"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": 8,
"type": "boolean"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 472
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 1,
"G": 1,
"U": 1,
"X": 1,
"aconj": 1,
"adisj": 1,
"aneg": 0,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "A (X ((((ERK <= 1) U ((1 <= MEKPP_ERK) OR (3 <= RP))) OR F (G (((1 <= MEKPP_ERK)))))))",
"processed_size": 87,
"rewrites": 101
},
"result":
{
"edges": 2,
"markings": 3,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 5
},
"compoundnumber": 9,
"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": 606
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"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": "A (G (((2 <= Raf1Star_RKIP) AND (RKIPP <= RKIP))))",
"processed_size": 50,
"rewrites": 103
},
"result":
{
"edges": 0,
"markings": 0,
"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": 2,
"problems": 2
},
"type": "invariance",
"workflow": "stateequation||search"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 758
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 1,
"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 (F ((Raf1Star_RKIP_ERKPP <= RKIPP))))",
"processed_size": 42,
"rewrites": 101
},
"result":
{
"edges": 317,
"markings": 314,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"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": 1011
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 3,
"G": 2,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 2,
"aneg": 4,
"comp": 6,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 11,
"taut": 0,
"tconj": 1,
"tdisj": 2,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "A (G (F (((((RP + 1 <= ERKPP) AND (MEKPP <= ERK)) AND (F ((ERK <= 2)) OR G (((RP + 1 <= ERKPP) AND (MEKPP <= ERK))))) OR F ((ERK + 1 <= MEKPP))))))",
"processed_size": 147,
"rewrites": 101
},
"result":
{
"edges": 104,
"markings": 104,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 4
},
"compoundnumber": 13,
"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": 1516
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 6,
"taut": 0,
"tconj": 1,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "A ((F ((RKIPP + 1 <= RKIPP_RP)) OR ((ERKPP <= RKIP) AND G ((ERKPP <= RKIP)))))",
"processed_size": 78,
"rewrites": 101
},
"result":
{
"edges": 302,
"markings": 302,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 14,
"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": 3033
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3033
},
"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": "(Raf1Star + 1 <= RP)",
"processed_size": 20,
"rewrites": 101
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 15,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 15,
"type": "boolean"
}
}
],
"exit":
{
"error": null,
"memory": 22584,
"runtime": 1050.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "LTLCardinality.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "A(X(G(**))) : A(X(((** U **) OR F(G(**))))) : A((F(**) OR (** AND G(**)))) : A(F((** AND X(G((** OR X(G(**)))))))) : A(G(F(**))) : (* AND A(F(*))) : TRUE : (A(X(G(**))) AND A(X(X(F(**))))) : (A(G(**)) AND (A(G(**)) AND A(G(F((** AND (** OR X(*)))))))) : A(X(TRUE)) : A(X(TRUE)) : A(G(**)) : (A(X(F(*))) AND (A(X(X(G(*)))) AND A(X(G(*))))) : FALSE : A(G(F(((* AND (F(*) OR G(*))) OR F(*))))) : A((** U G((G(**) OR X(F(**))))))"
},
"net":
{
"arcs": 34,
"conflict_clusters": 7,
"places": 11,
"places_significant": 6,
"singleton_clusters": 0,
"transitions": 11
},
"result":
{
"preliminary_value": "no yes no unknown no no yes no no yes yes no no no no unknown ",
"value": "no yes no unknown no no yes no no yes yes no no no no unknown "
},
"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: (RKIPP <= Raf1Star)
lola: LP says that atomic proposition is always true: (RKIPP <= RP)
lola: A (G (X ((1 <= MEKPP)))) : A (X ((((ERK <= 1) U ((1 <= MEKPP_ERK) OR (3 <= RP))) OR F (G (((1 <= MEKPP_ERK))))))) : A ((F ((RKIPP + 1 <= RKIPP_RP)) OR ((ERKPP <= RKIP) AND G ((ERKPP <= RKIP))))) : A (F (((2 <= Raf1Star_RKIP) AND G ((X ((2 <= Raf1Star_RKIP)) OR X (X (G ((1 <= Raf1Star))))))))) : A (G (X (F ((((ERK + 1 <= RKIPP_RP) AND F ((2 <= RP))) U F ((Raf1Star_RKIP_ERKPP <= RKIPP))))))) : A (NOT(((((RP <= Raf1Star) OR X ((RKIP + 1 <= 0))) OR G ((RP <= Raf1Star))) AND G (X ((0 <= RKIP)))))) : A ((F ((((1 <= Raf1Star) OR (MEKPP_ERK <= RKIPP)) OR (X ((ERKPP <= Raf1Star)) U (0 <= Raf1Star_RKIP_ERKPP)))) U (0 <= Raf1Star_RKIP_ERKPP))) : A (X ((G ((ERK <= RKIPP)) AND NOT(X (NOT(F (((MEKPP + 1 <= ERK) U (Raf1Star_RKIP <= RKIP))))))))) : A (G ((((Raf1Star <= 0) AND G ((MEKPP_ERK <= MEKPP))) AND F (((MEKPP_ERK <= MEKPP) AND ((3 <= MEKPP) OR NOT(X ((MEKPP_ERK <= MEKPP))))))))) : A ((((MEKPP_ERK + 1 <= 0) U X (F (((0 <= MEKPP_ERK) OR X ((0 <= MEKPP_ERK)))))) OR F (X (((Raf1Star <= MEKPP) AND (1 <= Raf1Star_RKIP)))))) : A (F (X ((((Raf1Star <= 1) OR F ((MEKPP <= 2))) OR ((RKIPP <= Raf1Star) AND G ((0 <= MEKPP_ERK))))))) : A (G (((2 <= Raf1Star_RKIP) AND (RKIPP <= RKIP)))) : A (NOT(((G (X (((3 <= RKIPP_RP) OR (2 <= MEKPP_ERK)))) OR X (F (X ((3 <= MEKPP_ERK))))) OR X (F ((3 <= MEKPP_ERK)))))) : A (X (G ((RKIPP_RP + 1 <= 0)))) : A (G (NOT(X (G (((G ((3 <= ERK)) U ((ERKPP <= RP) OR (ERK + 1 <= MEKPP))) AND G ((MEKPP <= ERK)))))))) : A (((Raf1Star_RKIP_ERKPP <= ERKPP) U G ((G ((MEKPP_ERK + 1 <= RKIP)) OR F (X (((2 <= RKIP))))))))
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:528
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:422
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:145
lola: rewrite Frontend/Parser/formula_rewrite.k:121
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:160
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
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:121
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:166
lola: rewrite Frontend/Parser/formula_rewrite.k:123
lola: rewrite Frontend/Parser/formula_rewrite.k:154
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:169
lola: rewrite Frontend/Parser/formula_rewrite.k:154
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:185
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:551
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:545
lola: rewrite Frontend/Parser/formula_rewrite.k:545
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:124
lola: rewrite Frontend/Parser/formula_rewrite.k:154
lola: rewrite Frontend/Parser/formula_rewrite.k:185
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:528
lola: rewrite Frontend/Parser/formula_rewrite.k:124
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:160
lola: rewrite Frontend/Parser/formula_rewrite.k:116
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:123
lola: rewrite Frontend/Parser/formula_rewrite.k:123
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:356
lola: rewrite Frontend/Parser/formula_rewrite.k:528
lola: rewrite Frontend/Parser/formula_rewrite.k:528
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:329
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:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:551
lola: rewrite Frontend/Parser/formula_rewrite.k:551
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:163
lola: rewrite Frontend/Parser/formula_rewrite.k:145
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:329
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:356
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 222 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: TRUE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: TRUE
lola: processed formula length: 4
lola: 101 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 1 will run for 237 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: FALSE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FALSE
lola: processed formula length: 5
lola: 101 rewrites
lola: closed formula file LTLCardinality.xml
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 2 will run for 254 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (((2 <= Raf1Star_RKIP) AND X (G (((2 <= Raf1Star_RKIP) OR X (G ((1 <= Raf1Star)))))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F (((2 <= Raf1Star_RKIP) AND X (G (((2 <= Raf1Star_RKIP) OR X (G ((1 <= Raf1Star)))))))))
lola: processed formula length: 92
lola: 101 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: 2043576 markings, 7457026 edges, 408715 markings/sec, 0 secs
lola: 4256857 markings, 15241657 edges, 442656 markings/sec, 5 secs
lola: 6354524 markings, 22483710 edges, 419533 markings/sec, 10 secs
lola: 8423905 markings, 29682243 edges, 413876 markings/sec, 15 secs
lola: 10429563 markings, 36542061 edges, 401132 markings/sec, 20 secs
lola: 12425159 markings, 43344177 edges, 399119 markings/sec, 25 secs
lola: 14080752 markings, 48902156 edges, 331119 markings/sec, 30 secs
lola: 15562391 markings, 53919912 edges, 296328 markings/sec, 35 secs
lola: 17075721 markings, 59019044 edges, 302666 markings/sec, 40 secs
lola: 18527019 markings, 63945126 edges, 290260 markings/sec, 45 secs
lola: 20017744 markings, 69037379 edges, 298145 markings/sec, 50 secs
lola: 21446880 markings, 73828805 edges, 285827 markings/sec, 55 secs
lola: 22928482 markings, 78720605 edges, 296320 markings/sec, 60 secs
lola: 24405620 markings, 83667444 edges, 295428 markings/sec, 65 secs
lola: 25844798 markings, 88426536 edges, 287836 markings/sec, 70 secs
lola: 27367920 markings, 93570403 edges, 304624 markings/sec, 75 secs
lola: 28937305 markings, 98739839 edges, 313877 markings/sec, 80 secs
lola: 30442352 markings, 103793330 edges, 301009 markings/sec, 85 secs
lola: 31958152 markings, 108799606 edges, 303160 markings/sec, 90 secs
lola: 33459386 markings, 113711461 edges, 300247 markings/sec, 95 secs
lola: 34981668 markings, 118881919 edges, 304456 markings/sec, 100 secs
lola: 36576861 markings, 124189237 edges, 319039 markings/sec, 105 secs
lola: 38138914 markings, 129322622 edges, 312411 markings/sec, 110 secs
lola: 39670458 markings, 134374567 edges, 306309 markings/sec, 115 secs
lola: 41256132 markings, 139646086 edges, 317135 markings/sec, 120 secs
lola: 42809438 markings, 144724594 edges, 310661 markings/sec, 125 secs
lola: 44345124 markings, 149807235 edges, 307137 markings/sec, 130 secs
lola: 45852937 markings, 154808748 edges, 301563 markings/sec, 135 secs
lola: 47450021 markings, 160094405 edges, 319417 markings/sec, 140 secs
lola: 48970753 markings, 165069282 edges, 304146 markings/sec, 145 secs
lola: 50551377 markings, 170275719 edges, 316125 markings/sec, 150 secs
lola: 52145330 markings, 175452147 edges, 318791 markings/sec, 155 secs
lola: 53739340 markings, 180679264 edges, 318802 markings/sec, 160 secs
lola: 55307010 markings, 185745932 edges, 313534 markings/sec, 165 secs
lola: 56911484 markings, 191008318 edges, 320895 markings/sec, 170 secs
lola: 58490741 markings, 196278932 edges, 315851 markings/sec, 175 secs
lola: 60044286 markings, 201313462 edges, 310709 markings/sec, 180 secs
lola: 61465587 markings, 205980642 edges, 284260 markings/sec, 185 secs
lola: 62912142 markings, 210644471 edges, 289311 markings/sec, 190 secs
lola: 64288368 markings, 215184833 edges, 275245 markings/sec, 195 secs
lola: 65671237 markings, 219738464 edges, 276574 markings/sec, 200 secs
lola: 66829097 markings, 223601153 edges, 231572 markings/sec, 205 secs
lola: 68003886 markings, 227394439 edges, 234958 markings/sec, 210 secs
lola: 69158852 markings, 231136160 edges, 230993 markings/sec, 215 secs
lola: 70375112 markings, 235160240 edges, 243252 markings/sec, 220 secs
lola: 71675370 markings, 239538000 edges, 260052 markings/sec, 225 secs
lola: 72907756 markings, 243457137 edges, 246477 markings/sec, 230 secs
lola: 74099196 markings, 247257867 edges, 238288 markings/sec, 235 secs
lola: 75285102 markings, 251104144 edges, 237181 markings/sec, 240 secs
lola: 76516290 markings, 255089385 edges, 246238 markings/sec, 245 secs
lola: local time limit reached - aborting
lola:
preliminary result: unknown unknown unknown unknown unknown unknown yes unknown unknown unknown unknown unknown unknown no unknown unknown
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 3 will run for 254 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (G ((1 <= MEKPP))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (G ((1 <= MEKPP))))
lola: processed formula length: 24
lola: 101 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: 22037 markings, 54226 edges
lola: ========================================
lola: subprocess 4 will run for 275 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (X (G ((ERK <= RKIPP)))) AND A (X (X (F ((Raf1Star_RKIP <= RKIP))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 4 will run for 275 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (G ((ERK <= RKIPP))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (G ((ERK <= RKIPP))))
lola: processed formula length: 26
lola: 101 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: 205 markings, 205 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 5 will run for 300 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (G ((Raf1Star <= 0))) AND (A (G ((MEKPP_ERK <= MEKPP))) AND A (G (F (((MEKPP_ERK <= MEKPP) AND ((3 <= MEKPP) OR X ((MEKPP + 1 <= MEKPP_ERK)))))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 5 will run for 300 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((Raf1Star <= 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 ((Raf1Star <= 0)))
lola: processed formula length: 23
lola: 103 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: state equation task get result unparse finished++ id 0
lola: formula 0: (1 <= Raf1Star)
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 0 markings, 0 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 6 will run for 331 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (TRUE))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (TRUE))
lola: processed formula length: 12
lola: 101 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: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 3 markings, 2 edges
lola: ========================================
lola: subprocess 7 will run for 367 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (TRUE))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (TRUE))
lola: processed formula length: 12
lola: 101 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: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 3 markings, 2 edges
lola: ========================================
lola: subprocess 8 will run for 413 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (X (F (((RKIPP_RP <= 2) AND (MEKPP_ERK <= 1))))) AND (A (X (X (G ((MEKPP_ERK <= 2))))) AND A (X (G ((MEKPP_ERK <= 2))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 8 will run for 413 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (G ((MEKPP_ERK <= 2))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (G ((MEKPP_ERK <= 2))))
lola: processed formula length: 28
lola: 101 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: 263 markings, 317 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 9 will run for 472 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X ((((ERK <= 1) U ((1 <= MEKPP_ERK) OR (3 <= RP))) OR F (G (((1 <= MEKPP_ERK)))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X ((((ERK <= 1) U ((1 <= MEKPP_ERK) OR (3 <= RP))) OR F (G (((1 <= MEKPP_ERK)))))))
lola: processed formula length: 87
lola: 101 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 5 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: 3 markings, 2 edges
lola: ========================================
lola: subprocess 10 will run for 551 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (((Raf1Star_RKIP_ERKPP <= ERKPP) U G ((G ((MEKPP_ERK + 1 <= RKIP)) OR X (F (((2 <= RKIP))))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (((Raf1Star_RKIP_ERKPP <= ERKPP) U G ((G ((MEKPP_ERK + 1 <= RKIP)) OR X (F (((2 <= RKIP))))))))
lola: processed formula length: 97
lola: 101 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 10 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: 2729914 markings, 7569453 edges, 545983 markings/sec, 0 secs
lola: 4869156 markings, 13478633 edges, 427848 markings/sec, 5 secs
lola: 6985365 markings, 19332378 edges, 423242 markings/sec, 10 secs
lola: 9361624 markings, 25881850 edges, 475252 markings/sec, 15 secs
lola: 11860570 markings, 32778017 edges, 499789 markings/sec, 20 secs
lola: 14135036 markings, 39052415 edges, 454893 markings/sec, 25 secs
lola: 15972048 markings, 44123430 edges, 367402 markings/sec, 30 secs
lola: 17741944 markings, 49015157 edges, 353979 markings/sec, 35 secs
lola: 19489130 markings, 53838679 edges, 349437 markings/sec, 40 secs
lola: 21362172 markings, 58970439 edges, 374608 markings/sec, 45 secs
lola: 23106370 markings, 63769303 edges, 348840 markings/sec, 50 secs
lola: 24864507 markings, 68611818 edges, 351627 markings/sec, 55 secs
lola: 26661940 markings, 73532117 edges, 359487 markings/sec, 60 secs
lola: 28358703 markings, 78188970 edges, 339353 markings/sec, 65 secs
lola: 30108486 markings, 82998511 edges, 349957 markings/sec, 70 secs
lola: 31796380 markings, 87659517 edges, 337579 markings/sec, 75 secs
lola: 33462145 markings, 92233914 edges, 333153 markings/sec, 80 secs
lola: 35082830 markings, 96697339 edges, 324137 markings/sec, 85 secs
lola: 36783506 markings, 101388220 edges, 340135 markings/sec, 90 secs
lola: 38415667 markings, 105869595 edges, 326432 markings/sec, 95 secs
lola: 39979322 markings, 110163779 edges, 312731 markings/sec, 100 secs
lola: 41548102 markings, 114488974 edges, 313756 markings/sec, 105 secs
lola: 43158677 markings, 118912218 edges, 322115 markings/sec, 110 secs
lola: 44774164 markings, 123343387 edges, 323097 markings/sec, 115 secs
lola: 46293418 markings, 127518009 edges, 303851 markings/sec, 120 secs
lola: 47829970 markings, 131732610 edges, 307310 markings/sec, 125 secs
lola: 49346271 markings, 135912614 edges, 303260 markings/sec, 130 secs
lola: 50986682 markings, 140390655 edges, 328082 markings/sec, 135 secs
lola: 52535336 markings, 144652293 edges, 309731 markings/sec, 140 secs
lola: 54068764 markings, 148870067 edges, 306686 markings/sec, 145 secs
lola: 55658190 markings, 153231851 edges, 317885 markings/sec, 150 secs
lola: 57215838 markings, 157529670 edges, 311530 markings/sec, 155 secs
lola: 58850238 markings, 162009037 edges, 326880 markings/sec, 160 secs
lola: 60388718 markings, 166245055 edges, 307696 markings/sec, 165 secs
lola: 61958828 markings, 170544283 edges, 314022 markings/sec, 170 secs
lola: 63504622 markings, 174782289 edges, 309159 markings/sec, 175 secs
lola: 64975252 markings, 178829679 edges, 294126 markings/sec, 180 secs
lola: 66565474 markings, 183180325 edges, 318044 markings/sec, 185 secs
lola: 68040260 markings, 187234857 edges, 294957 markings/sec, 190 secs
lola: 69656268 markings, 191681720 edges, 323202 markings/sec, 195 secs
lola: 71259418 markings, 196063661 edges, 320630 markings/sec, 200 secs
lola: 72788638 markings, 200280975 edges, 305844 markings/sec, 205 secs
lola: 74296677 markings, 204430411 edges, 301608 markings/sec, 210 secs
lola: 75879044 markings, 208754529 edges, 316473 markings/sec, 215 secs
lola: 77418550 markings, 212965511 edges, 307901 markings/sec, 220 secs
lola: 78930035 markings, 217118316 edges, 302297 markings/sec, 225 secs
lola: 80438720 markings, 221253979 edges, 301737 markings/sec, 230 secs
lola: 81926912 markings, 225341991 edges, 297638 markings/sec, 235 secs
lola: 83406454 markings, 229424727 edges, 295908 markings/sec, 240 secs
lola: 84995452 markings, 233796875 edges, 317800 markings/sec, 245 secs
lola: 86722982 markings, 238538449 edges, 345506 markings/sec, 250 secs
lola: 88574546 markings, 243597865 edges, 370313 markings/sec, 255 secs
lola: 90303672 markings, 248373413 edges, 345825 markings/sec, 260 secs
lola: 92102144 markings, 253311829 edges, 359694 markings/sec, 265 secs
lola: 92200550 markings, 253583499 edges, 19681 markings/sec, 270 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 11 will run for 606 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((2 <= Raf1Star_RKIP) AND (RKIPP <= 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 (((2 <= Raf1Star_RKIP) AND (RKIPP <= RKIP))))
lola: processed formula length: 50
lola: 103 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: ((Raf1Star_RKIP <= 1) OR (RKIP + 1 <= RKIPP))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 2 literals and 2 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 12 will run for 758 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (F ((Raf1Star_RKIP_ERKPP <= RKIPP))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (G (F ((Raf1Star_RKIP_ERKPP <= RKIPP))))
lola: processed formula length: 42
lola: 101 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: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 314 markings, 317 edges
lola: ========================================
lola: subprocess 13 will run for 1011 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (F (((((RP + 1 <= ERKPP) AND (MEKPP <= ERK)) AND (F ((ERK <= 2)) OR G (((RP + 1 <= ERKPP) AND (MEKPP <= ERK))))) OR F ((ERK + 1 <= MEKPP))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (G (F (((((RP + 1 <= ERKPP) AND (MEKPP <= ERK)) AND (F ((ERK <= 2)) OR G (((RP + 1 <= ERKPP) AND (MEKPP <= ERK))))) OR F ((ERK + 1 <= MEKPP))))))
lola: processed formula length: 147
lola: 101 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: 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: 104 markings, 104 edges
lola: ========================================
lola: subprocess 14 will run for 1516 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A ((F ((RKIPP + 1 <= RKIPP_RP)) OR ((ERKPP <= RKIP) AND G ((ERKPP <= RKIP)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A ((F ((RKIPP + 1 <= RKIPP_RP)) OR ((ERKPP <= RKIP) AND G ((ERKPP <= RKIP)))))
lola: processed formula length: 78
lola: 101 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: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 302 markings, 302 edges
lola: ========================================
lola: subprocess 15 will run for 3033 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((Raf1Star + 1 <= RP) AND A (F ((Raf1Star + 1 <= RP))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 15 will run for 3033 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (Raf1Star + 1 <= RP)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (Raf1Star + 1 <= RP)
lola: processed formula length: 20
lola: 101 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: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: ========================================
lola: ========================================
lola: ...considering subproblem: A (F (((2 <= Raf1Star_RKIP) AND X (G (((2 <= Raf1Star_RKIP) OR X (G ((1 <= Raf1Star)))))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F (((2 <= Raf1Star_RKIP) AND X (G (((2 <= Raf1Star_RKIP) OR X (G ((1 <= Raf1Star)))))))))
lola: processed formula length: 92
lola: 101 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: 2265419 markings, 8238377 edges, 453084 markings/sec, 0 secs
lola: 4135415 markings, 14797878 edges, 373999 markings/sec, 5 secs
lola: 5890341 markings, 20926637 edges, 350985 markings/sec, 10 secs
lola: 7639074 markings, 26966060 edges, 349747 markings/sec, 15 secs
lola: 9314163 markings, 32688179 edges, 335018 markings/sec, 20 secs
lola: 10915457 markings, 38228537 edges, 320259 markings/sec, 25 secs
lola: 12560845 markings, 43821211 edges, 329078 markings/sec, 30 secs
lola: 14233756 markings, 49450249 edges, 334582 markings/sec, 35 secs
lola: 15885805 markings, 55020097 edges, 330410 markings/sec, 40 secs
lola: 17642119 markings, 60953481 edges, 351263 markings/sec, 45 secs
lola: 19333735 markings, 66644892 edges, 338323 markings/sec, 50 secs
lola: 21021541 markings, 72440505 edges, 337561 markings/sec, 55 secs
lola: 22748780 markings, 78125532 edges, 345448 markings/sec, 60 secs
lola: 24358949 markings, 83509875 edges, 322034 markings/sec, 65 secs
lola: 26013433 markings, 88998446 edges, 330897 markings/sec, 70 secs
lola: 27829158 markings, 95116942 edges, 363145 markings/sec, 75 secs
lola: 29253543 markings, 99793577 edges, 284877 markings/sec, 80 secs
lola: 30591077 markings, 104314916 edges, 267507 markings/sec, 85 secs
lola: 31915158 markings, 108636630 edges, 264816 markings/sec, 90 secs
lola: 33214987 markings, 112911347 edges, 259966 markings/sec, 95 secs
lola: 34508801 markings, 117283345 edges, 258763 markings/sec, 100 secs
lola: 35864692 markings, 121798344 edges, 271178 markings/sec, 105 secs
lola: 37356663 markings, 126773403 edges, 298394 markings/sec, 110 secs
lola: 38966601 markings, 132050461 edges, 321988 markings/sec, 115 secs
lola: 40500174 markings, 137104604 edges, 306715 markings/sec, 120 secs
lola: 42104055 markings, 142390780 edges, 320776 markings/sec, 125 secs
lola: 43713773 markings, 147746559 edges, 321944 markings/sec, 130 secs
lola: 45182274 markings, 152602797 edges, 293700 markings/sec, 135 secs
lola: 46656213 markings, 157451392 edges, 294788 markings/sec, 140 secs
lola: 48188168 markings, 162454940 edges, 306391 markings/sec, 145 secs
lola: 49658193 markings, 167311240 edges, 294005 markings/sec, 150 secs
lola: 51165982 markings, 172290525 edges, 301558 markings/sec, 155 secs
lola: 52565431 markings, 176798286 edges, 279890 markings/sec, 160 secs
lola: 53990625 markings, 181491058 edges, 285039 markings/sec, 165 secs
lola: 55503077 markings, 186424236 edges, 302490 markings/sec, 170 secs
lola: 56943613 markings, 191109177 edges, 288107 markings/sec, 175 secs
lola: 58558775 markings, 196499207 edges, 323032 markings/sec, 180 secs
lola: 60089414 markings, 201456806 edges, 306128 markings/sec, 185 secs
lola: 61630063 markings, 206506465 edges, 308130 markings/sec, 190 secs
lola: 63221649 markings, 211670802 edges, 318317 markings/sec, 195 secs
lola: 64714464 markings, 216603519 edges, 298563 markings/sec, 200 secs
lola: 66334034 markings, 221945651 edges, 323914 markings/sec, 205 secs
lola: 67983396 markings, 227324803 edges, 329872 markings/sec, 210 secs
lola: 69660459 markings, 232794690 edges, 335413 markings/sec, 215 secs
lola: 71448920 markings, 238742618 edges, 357692 markings/sec, 220 secs
lola: 73182227 markings, 244368908 edges, 346661 markings/sec, 225 secs
lola: 74766322 markings, 249442707 edges, 316819 markings/sec, 230 secs
lola: 76361109 markings, 254568747 edges, 318957 markings/sec, 235 secs
lola: 77951906 markings, 259723048 edges, 318159 markings/sec, 240 secs
lola: 79554436 markings, 264872963 edges, 320506 markings/sec, 245 secs
lola: 81236398 markings, 270184000 edges, 336392 markings/sec, 250 secs
lola: Child process aborted or communication problem between parent and child process
lola: ========================================
lola: ...considering subproblem: A (((Raf1Star_RKIP_ERKPP <= ERKPP) U G ((G ((MEKPP_ERK + 1 <= RKIP)) OR X (F (((2 <= RKIP))))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (((Raf1Star_RKIP_ERKPP <= ERKPP) U G ((G ((MEKPP_ERK + 1 <= RKIP)) OR X (F (((2 <= RKIP))))))))
lola: processed formula length: 97
lola: 101 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 10 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: 3019888 markings, 8372441 edges, 603978 markings/sec, 0 secs
lola: 5862646 markings, 16238383 edges, 568552 markings/sec, 5 secs
lola: 8587754 markings, 23735107 edges, 545022 markings/sec, 10 secs
lola: 11188136 markings, 30927171 edges, 520076 markings/sec, 15 secs
lola: 13792078 markings, 38110267 edges, 520788 markings/sec, 20 secs
lola: 16335874 markings, 45124663 edges, 508759 markings/sec, 25 secs
lola: 18809524 markings, 51964097 edges, 494730 markings/sec, 30 secs
lola: 21343048 markings, 58919857 edges, 506705 markings/sec, 35 secs
lola: 23764548 markings, 65592775 edges, 484300 markings/sec, 40 secs
lola: 26245966 markings, 72380644 edges, 496284 markings/sec, 45 secs
lola: 28641012 markings, 78959505 edges, 479009 markings/sec, 50 secs
lola: 31058864 markings, 85625644 edges, 483570 markings/sec, 55 secs
lola: 33449711 markings, 92198553 edges, 478169 markings/sec, 60 secs
lola: 35839738 markings, 98772057 edges, 478005 markings/sec, 65 secs
lola: 38036804 markings, 104821387 edges, 439413 markings/sec, 70 secs
lola: 40226848 markings, 110858103 edges, 438009 markings/sec, 75 secs
lola: 42559281 markings, 117266752 edges, 466487 markings/sec, 80 secs
lola: 44906808 markings, 123712046 edges, 469505 markings/sec, 85 secs
lola: 47212325 markings, 130037794 edges, 461103 markings/sec, 90 secs
lola: 49479526 markings, 136275809 edges, 453440 markings/sec, 95 secs
lola: 51604042 markings, 142079883 edges, 424903 markings/sec, 100 secs
lola: 53766930 markings, 148047103 edges, 432578 markings/sec, 105 secs
lola: 56076360 markings, 154385630 edges, 461886 markings/sec, 110 secs
lola: 58324368 markings, 160569941 edges, 449602 markings/sec, 115 secs
lola: 60573604 markings, 166748745 edges, 449847 markings/sec, 120 secs
lola: 62802724 markings, 172857548 edges, 445824 markings/sec, 125 secs
lola: 64968576 markings, 178811247 edges, 433170 markings/sec, 130 secs
lola: 67189560 markings, 184896749 edges, 444197 markings/sec, 135 secs
lola: 69422076 markings, 191045299 edges, 446503 markings/sec, 140 secs
lola: 71667318 markings, 197174533 edges, 449048 markings/sec, 145 secs
lola: 73868834 markings, 203257215 edges, 440303 markings/sec, 150 secs
lola: 76125292 markings, 209425057 edges, 451292 markings/sec, 155 secs
lola: 78239329 markings, 215218332 edges, 422807 markings/sec, 160 secs
lola: 80271574 markings, 220796883 edges, 406449 markings/sec, 165 secs
lola: 82402788 markings, 226650111 edges, 426243 markings/sec, 170 secs
lola: 84597780 markings, 232698775 edges, 438998 markings/sec, 175 secs
lola: 86771834 markings, 238672703 edges, 434811 markings/sec, 180 secs
lola: 88989953 markings, 244744648 edges, 443624 markings/sec, 185 secs
lola: 91144578 markings, 250677621 edges, 430925 markings/sec, 190 secs
lola: 92148824 markings, 253441675 edges, 200849 markings/sec, 195 secs
lola: 92169706 markings, 253499723 edges, 4176 markings/sec, 200 secs
lola: 92199946 markings, 253581977 edges, 6048 markings/sec, 205 secs
lola: 92200044 markings, 253582238 edges, 20 markings/sec, 210 secs
lola: 92200146 markings, 253582482 edges, 20 markings/sec, 215 secs
lola: 92203896 markings, 253592512 edges, 750 markings/sec, 220 secs
lola: 92205792 markings, 253597520 edges, 379 markings/sec, 225 secs
lola: 92206516 markings, 253599808 edges, 145 markings/sec, 230 secs
lola: 92219301 markings, 253634645 edges, 2557 markings/sec, 235 secs
lola: 92221110 markings, 253639521 edges, 362 markings/sec, 240 secs
lola: 92224316 markings, 253648364 edges, 641 markings/sec, 245 secs
lola: Child process aborted or communication problem between parent and child process
lola: RESULT
lola:
SUMMARY: no yes no unknown no no yes no no yes yes no no no no unknown
lola:
preliminary result: no yes no unknown no no yes no no yes yes no no no no unknown
lola: memory consumption: 22584 KB
lola: time consumption: 1050 seconds
lola: print data as JSON (--json)
lola: writing JSON to LTLCardinality.json
lola: closed JSON file LTLCardinality.json
rslt: finished
BK_STOP 1589554466975
--------------------
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-000100"
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-000100, 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-158922839800225"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/ERK-PT-000100.tgz
mv ERK-PT-000100 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 ;