Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fko/mcc2020-input.r105-oct2-158940199800145.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fko/mcc2020-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...............................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool win2019
Input is Kanban-PT-50000, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r105-oct2-158940199800145
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 192K
-rw-r--r-- 1 mcc users 3.5K Apr 8 12:56 CTLCardinality.txt
-rw-r--r-- 1 mcc users 20K Apr 8 12:56 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Apr 7 16:14 CTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 7 16:14 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.4K Apr 14 12:41 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 28 14:01 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Apr 14 12:41 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 28 14:01 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.3K Apr 6 19:13 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 16K Apr 6 19:13 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.8K Apr 6 02:35 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 6 02:35 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 6 20:24 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Apr 6 20:24 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 equiv_col
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 instance
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 iscolored
-rw-r--r-- 1 mcc users 14K Mar 24 05:37 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME Kanban-PT-50000-00
FORMULA_NAME Kanban-PT-50000-01
FORMULA_NAME Kanban-PT-50000-02
FORMULA_NAME Kanban-PT-50000-03
FORMULA_NAME Kanban-PT-50000-04
FORMULA_NAME Kanban-PT-50000-05
FORMULA_NAME Kanban-PT-50000-06
FORMULA_NAME Kanban-PT-50000-07
FORMULA_NAME Kanban-PT-50000-08
FORMULA_NAME Kanban-PT-50000-09
FORMULA_NAME Kanban-PT-50000-10
FORMULA_NAME Kanban-PT-50000-11
FORMULA_NAME Kanban-PT-50000-12
FORMULA_NAME Kanban-PT-50000-13
FORMULA_NAME Kanban-PT-50000-14
FORMULA_NAME Kanban-PT-50000-15

=== Now, execution of the tool begins

BK_START 1589724574224

info: Time: 3600 - MCC
vrfy: Checking LTLCardinality @ Kanban-PT-50000 @ 3570 seconds

FORMULA Kanban-PT-50000-05 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Kanban-PT-50000-02 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Kanban-PT-50000-03 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Kanban-PT-50000-04 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Kanban-PT-50000-00 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Kanban-PT-50000-06 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Kanban-PT-50000-08 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Kanban-PT-50000-09 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Kanban-PT-50000-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Kanban-PT-50000-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Kanban-PT-50000-07 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Kanban-PT-50000-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Kanban-PT-50000-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Kanban-PT-50000-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Kanban-PT-50000-01 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Kanban-PT-50000-12 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 2938
rslt: Output for LTLCardinality @ Kanban-PT-50000

{
"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": "Sun May 17 14:09:34 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": 81
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 0,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 244
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 2,
"aconj": 0,
"adisj": 0,
"aneg": 3,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 5,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "A (G ((X ((Pback4 + 1 <= Pm2)) OR ((Pm4 + 1 <= Pback4) R X ((P4 <= 0))))))",
"processed_size": 74,
"rewrites": 81
},
"result":
{
"edges": 100006,
"markings": 100006,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 6
},
"compoundnumber": 2,
"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": 263
},
"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": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "A (X (G ((Pm3 + 1 <= Pout3))))",
"processed_size": 30,
"rewrites": 81
},
"result":
{
"edges": 100006,
"markings": 100006,
"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": 285
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 2,
"G": 1,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "A (X (F ((G ((Pback3 + 1 <= Pm1)) AND F ((Pm4 + 1 <= Pout3))))))",
"processed_size": 64,
"rewrites": 81
},
"result":
{
"edges": 100012,
"markings": 100012,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 5
},
"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": 311
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 2,
"G": 1,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 1,
"aneg": 3,
"comp": 7,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 11,
"taut": 0,
"tconj": 3,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "A (((Pout3 <= Pback2) OR (G ((((1 <= Pback3) OR (Pm3 <= Pm1)) AND X (F (((Pback2 + 1 <= Pout3) AND ((Pback3 <= 0) R (Pm1 <= 2))))))) AND F ((Pout3 <= Pback2)))))",
"processed_size": 162,
"rewrites": 81
},
"result":
{
"edges": 0,
"markings": 1,
"produced_by": "LTL model checker",
"value": true
},
"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": 342
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 1,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 5,
"taut": 0,
"tconj": 0,
"tdisj": 2,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "A ((((Pback3 <= Pout4) AND (2 <= Pback3)) OR (F ((3 <= Pm3)) OR X (G ((3 <= Pm3))))))",
"processed_size": 85,
"rewrites": 81
},
"result":
{
"edges": 100006,
"markings": 100006,
"produced_by": "LTL model checker",
"value": false
},
"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": 380
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 3,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "A ((F ((3 <= P3)) OR X (X (X (G ((P2 + 1 <= Pback2)))))))",
"processed_size": 57,
"rewrites": 81
},
"result":
{
"edges": 0,
"markings": 1,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 5
},
"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": 428
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 1,
"G": 2,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 4,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 8,
"taut": 0,
"tconj": 1,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "A (G (F ((G ((Pback3 + 1 <= Pm2)) OR ((Pback3 + 1 <= Pm2) AND X (((Pback2 + 1 <= Pm3) R (Pback3 + 1 <= Pm2))))))))",
"processed_size": 114,
"rewrites": 81
},
"result":
{
"edges": 100006,
"markings": 100006,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 7
},
"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"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 489
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 3,
"comp": 5,
"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": 4,
"visible_transitions": 0
},
"processed": "A (((((Pout4 <= 2) R (Pback1 <= 1)) R (Pback1 <= 1)) OR (X (G ((2 <= Pback1))) OR F ((Pout2 <= Pm4)))))",
"processed_size": 103,
"rewrites": 81
},
"result":
{
"edges": 0,
"markings": 1,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 12
},
"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": 654
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 2,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "A (X (((Pm2 <= Pback2) OR X (TRUE))))",
"processed_size": 37,
"rewrites": 81
},
"result":
{
"edges": 1,
"markings": 2,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 4
},
"compoundnumber": 11,
"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": 817
},
"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": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "A (G (F ((1 <= Pback1))))",
"processed_size": 25,
"rewrites": 81
},
"result":
{
"edges": 50002,
"markings": 50002,
"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": 1090
},
"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": 3,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "A (G (F (((P3 <= Pback1) AND F ((Pout2 <= 2))))))",
"processed_size": 49,
"rewrites": 81
},
"result":
{
"edges": 50002,
"markings": 50002,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"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": 1635
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 1,
"G": 2,
"U": 1,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 6,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "A ((F ((((Pout1 + 1 <= Pm2) AND (1 <= Pout3)) AND G ((1 <= Pout3)))) U G ((Pm2 <= Pout1))))",
"processed_size": 91,
"rewrites": 81
},
"result":
{
"edges": 450004,
"markings": 250004,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 6
},
"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": 3270
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 2,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 7,
"taut": 0,
"tconj": 2,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "A ((((Pout3 <= Pm1) AND F ((Pm1 + 1 <= Pout3))) OR ((Pout1 <= 0) AND F ((Pout3 <= P3)))))",
"processed_size": 89,
"rewrites": 81
},
"result":
{
"edges": 0,
"markings": 1,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 5
},
"compoundnumber": 15,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
}
],
"exit":
{
"error": null,
"memory": 22984,
"runtime": 607.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "LTLCardinality.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "A((** OR (G((** AND X(F((* AND (* R *)))))) AND F(**)))) : A(((** AND G(**)) U (X((G(**) AND **)) U **))) : A(G((X(*) OR (* R X(*))))) : A(X(G(*))) : A(X(F((G(*) AND F(**))))) : TRUE : A((** OR (F(**) OR X(G(**))))) : A(G(F(**))) : A((F(**) OR X(X(X(G(*)))))) : A(G(F((G(*) OR (* AND X((* R *))))))) : A((((* R *) R *) OR (X(G(**)) OR F(**)))) : A(G(F((** AND F(**))))) : A(X(G((X(**) AND (X(**) OR G(**)))))) : A(((** AND F(**)) OR (** AND F(**)))) : A(X((** OR X(TRUE)))) : A((F((** AND G(**))) U G(**)))"
},
"net":
{
"arcs": 40,
"conflict_clusters": 12,
"places": 16,
"places_significant": 11,
"singleton_clusters": 0,
"transitions": 16
},
"result":
{
"preliminary_value": "yes unknown no no no yes no no yes no yes no unknown yes yes no ",
"value": "yes unknown no no no yes no no yes no yes no unknown yes yes no "
},
"task":
{
"type": "compound"
}
}
lola: LoLA will run for 3570 seconds at most (--timelimit)
lola: NET
lola: input: PNML file (--pnml)
lola: reading net from model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file model.pnml
lola: 32/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 512
lola: finding significant places
lola: 16 places, 16 transitions, 11 significant places
lola: compute conflict clusters
lola: computed conflict clusters
lola: Computing conflicting sets
lola: Computing back conflicting sets
lola: TASK
lola: Reading formula in XML format (--xmlformula)
lola: reading pnml
lola: reading formula from LTLCardinality.xml
lola: A ((G ((((1 <= Pback3) OR (Pm3 <= Pm1)) AND NOT(G (X (((Pout3 <= Pback2) OR ((1 <= Pback3) U (3 <= Pm1)))))))) U (Pout3 <= Pback2))) : A ((((P4 <= Pm3) AND G ((P4 <= Pm3))) U ((X (G ((3 <= P3))) AND X ((2 <= Pm1))) U (P4 <= Pout3)))) : A (G (NOT((X ((Pm2 <= Pback4)) AND ((Pback4 <= Pm4) U X ((1 <= P4))))))) : A (NOT(F (X ((Pout3 <= Pm3))))) : A (X (F ((NOT(((0 <= Pback1) U (Pm1 <= Pback3))) AND F (((Pm4 + 1 <= Pout3) AND F ((0 <= Pback1)))))))) : A (((0 <= Pout2) OR X (((0 <= Pout2) AND F ((P1 <= Pback1)))))) : A (((((Pback3 <= Pout4) AND (2 <= Pback3)) OR F ((3 <= Pm3))) OR G (X ((3 <= Pm3))))) : A (G (X (F (((((1 <= Pback1) AND (Pback4 <= Pm4)) AND X ((1 <= Pback1))) U (1 <= Pback1)))))) : A ((F ((3 <= P3)) OR X (NOT(X (X (F ((Pback2 <= P2)))))))) : A (NOT(F (G (((Pm2 <= Pback3) U X (((Pm3 <= Pback2) U (Pm2 <= Pback3)))))))) : A (((NOT((((3 <= Pout4) U (2 <= Pback1)) U (2 <= Pback1))) OR X (G ((2 <= Pback1)))) OR F ((Pout2 <= Pm4)))) : A (G (X (X (G (F (((P3 <= Pback1) AND F ((Pout2 <= 2))))))))) : A (G (X ((X ((Pback2 <= 1)) AND (X ((Pback3 <= Pm2)) OR G ((2 <= Pback2))))))) : A ((((Pout3 <= Pm1) AND F ((Pm1 + 1 <= Pout3))) OR ((Pout1 <= 0) AND F ((Pout3 <= P3))))) : A ((X (((Pm2 <= Pback2) OR X (G (X ((F (G ((Pm2 <= Pback2))) U (0 <= Pm1))))))) AND F (G ((0 <= Pm1))))) : A ((F ((((Pout1 + 1 <= Pm2) AND (1 <= Pout3)) AND G ((1 <= Pout3)))) U G ((Pm2 <= Pout1))))
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:338
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:525
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:335
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:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:356
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:100
lola: rewrite Frontend/Parser/formula_rewrite.k:169
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
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:100
lola: rewrite Frontend/Parser/formula_rewrite.k:116
lola: rewrite Frontend/Parser/formula_rewrite.k:124
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:434
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:377
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:297
lola: rewrite Frontend/Parser/formula_rewrite.k:437
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:434
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:522
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:329
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:318
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:335
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:338
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:297
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:428
lola: rewrite Frontend/Parser/formula_rewrite.k:154
lola: rewrite Frontend/Parser/formula_rewrite.k:116
lola: rewrite Frontend/Parser/formula_rewrite.k:124
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:160
lola: rewrite Frontend/Parser/formula_rewrite.k:142
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:160
lola: rewrite Frontend/Parser/formula_rewrite.k:154
lola: rewrite Frontend/Parser/formula_rewrite.k:115
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: 81 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: A ((((P4 <= Pm3) AND G ((P4 <= Pm3))) U (X ((G ((3 <= P3)) AND (2 <= Pm1))) U (P4 <= Pout3))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A ((((P4 <= Pm3) AND G ((P4 <= Pm3))) U (X ((G ((3 <= P3)) AND (2 <= Pm1))) U (P4 <= Pout3))))
lola: processed formula length: 94
lola: 81 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 13 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: 4050458 markings, 8248887 edges, 810092 markings/sec, 0 secs
lola: 7572374 markings, 15290793 edges, 704383 markings/sec, 5 secs
lola: 10963251 markings, 22070903 edges, 678175 markings/sec, 10 secs
lola: 14217405 markings, 28578275 edges, 650831 markings/sec, 15 secs
lola: 17427584 markings, 35000182 edges, 642036 markings/sec, 20 secs
lola: 20753399 markings, 41651939 edges, 665163 markings/sec, 25 secs
lola: 24048524 markings, 48237864 edges, 659025 markings/sec, 30 secs
lola: 27384136 markings, 54910236 edges, 667122 markings/sec, 35 secs
lola: 30765021 markings, 61674130 edges, 676177 markings/sec, 40 secs
lola: 34050840 markings, 68245427 edges, 657164 markings/sec, 45 secs
lola: 37217023 markings, 74572283 edges, 633237 markings/sec, 50 secs
lola: 40442594 markings, 81027364 edges, 645114 markings/sec, 55 secs
lola: 43569792 markings, 87281806 edges, 625440 markings/sec, 60 secs
lola: 46680308 markings, 93499569 edges, 622103 markings/sec, 65 secs
lola: 49663798 markings, 99466593 edges, 596698 markings/sec, 70 secs
lola: 52781279 markings, 105699681 edges, 623496 markings/sec, 75 secs
lola: 55902431 markings, 111940264 edges, 624230 markings/sec, 80 secs
lola: 58957462 markings, 118056781 edges, 611006 markings/sec, 85 secs
lola: 61958390 markings, 124052138 edges, 600186 markings/sec, 90 secs
lola: 64884618 markings, 129905788 edges, 585246 markings/sec, 95 secs
lola: 67843433 markings, 135820648 edges, 591763 markings/sec, 100 secs
lola: 70840500 markings, 141815685 edges, 599413 markings/sec, 105 secs
lola: 73790367 markings, 147721961 edges, 589973 markings/sec, 110 secs
lola: 76645309 markings, 153425724 edges, 570988 markings/sec, 115 secs
lola: 79491721 markings, 159122516 edges, 569282 markings/sec, 120 secs
lola: 82392846 markings, 164926288 edges, 580225 markings/sec, 125 secs
lola: 85578388 markings, 171289127 edges, 637108 markings/sec, 130 secs
lola: 87577352 markings, 175293396 edges, 399793 markings/sec, 135 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 2 will run for 244 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((X ((Pback4 + 1 <= Pm2)) OR ((Pm4 + 1 <= Pback4) R X ((P4 <= 0))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (G ((X ((Pback4 + 1 <= Pm2)) OR ((Pm4 + 1 <= Pback4) R X ((P4 <= 0))))))
lola: processed formula length: 74
lola: 81 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: 100006 markings, 100006 edges
lola: ========================================
lola: subprocess 3 will run for 263 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (G ((Pm3 + 1 <= Pout3))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (G ((Pm3 + 1 <= Pout3))))
lola: processed formula length: 30
lola: 81 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: 100006 markings, 100006 edges
lola: ========================================
lola: subprocess 4 will run for 285 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (F ((G ((Pback3 + 1 <= Pm1)) AND F ((Pm4 + 1 <= Pout3))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (F ((G ((Pback3 + 1 <= Pm1)) AND F ((Pm4 + 1 <= Pout3))))))
lola: processed formula length: 64
lola: 81 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: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 100012 markings, 100012 edges
lola: ========================================
lola: subprocess 5 will run for 311 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (((Pout3 <= Pback2) OR (G ((((1 <= Pback3) OR (Pm3 <= Pm1)) AND X (F (((Pback2 + 1 <= Pout3) AND ((Pback3 <= 0) R (Pm1 <= 2))))))) AND F ((Pout3 <= Pback2)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (((Pout3 <= Pback2) OR (G ((((1 <= Pback3) OR (Pm3 <= Pm1)) AND X (F (((Pback2 + 1 <= Pout3) AND ((Pback3 <= 0) R (Pm1 <= 2))))))) AND F ((Pout3 <= Pback2)))))
lola: processed formula length: 162
lola: 81 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: 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 6 will run for 342 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A ((((Pback3 <= Pout4) AND (2 <= Pback3)) OR (F ((3 <= Pm3)) OR X (G ((3 <= Pm3))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A ((((Pback3 <= Pout4) AND (2 <= Pback3)) OR (F ((3 <= Pm3)) OR X (G ((3 <= Pm3))))))
lola: processed formula length: 85
lola: 81 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: 100006 markings, 100006 edges
lola: ========================================
lola: subprocess 7 will run for 380 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A ((F ((3 <= P3)) OR X (X (X (G ((P2 + 1 <= Pback2)))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A ((F ((3 <= P3)) OR X (X (X (G ((P2 + 1 <= Pback2)))))))
lola: processed formula length: 57
lola: 81 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: 1 markings, 0 edges
lola: ========================================
lola: subprocess 8 will run for 428 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (F ((G ((Pback3 + 1 <= Pm2)) OR ((Pback3 + 1 <= Pm2) AND X (((Pback2 + 1 <= Pm3) R (Pback3 + 1 <= Pm2))))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (G (F ((G ((Pback3 + 1 <= Pm2)) OR ((Pback3 + 1 <= Pm2) AND X (((Pback2 + 1 <= Pm3) R (Pback3 + 1 <= Pm2))))))))
lola: processed formula length: 114
lola: 81 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 7 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: 100006 markings, 100006 edges
lola: ========================================
lola: subprocess 9 will run for 489 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (((((Pout4 <= 2) R (Pback1 <= 1)) R (Pback1 <= 1)) OR (X (G ((2 <= Pback1))) OR F ((Pout2 <= Pm4)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (((((Pout4 <= 2) R (Pback1 <= 1)) R (Pback1 <= 1)) OR (X (G ((2 <= Pback1))) OR F ((Pout2 <= Pm4)))))
lola: processed formula length: 103
lola: 81 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 12 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: 1 markings, 0 edges
lola: ========================================
lola: subprocess 10 will run for 570 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (G ((X ((Pback2 <= 1)) AND (X ((Pback3 <= Pm2)) OR G ((2 <= Pback2)))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (G ((X ((Pback2 <= 1)) AND (X ((Pback3 <= Pm2)) OR G ((2 <= Pback2)))))))
lola: processed formula length: 78
lola: 81 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 7 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: 4944578 markings, 10118278 edges, 988916 markings/sec, 0 secs
lola: 9168743 markings, 18931670 edges, 844833 markings/sec, 5 secs
lola: 13082790 markings, 26760463 edges, 782809 markings/sec, 10 secs
lola: 16836490 markings, 34263134 edges, 750740 markings/sec, 15 secs
lola: 20605314 markings, 41802533 edges, 753765 markings/sec, 20 secs
lola: 24357808 markings, 49302188 edges, 750499 markings/sec, 25 secs
lola: 28012186 markings, 56613554 edges, 730876 markings/sec, 30 secs
lola: 31635275 markings, 63856443 edges, 724618 markings/sec, 35 secs
lola: 35251194 markings, 71088778 edges, 723184 markings/sec, 40 secs
lola: 38618054 markings, 77813974 edges, 673372 markings/sec, 45 secs
lola: 42079640 markings, 84745108 edges, 692317 markings/sec, 50 secs
lola: 45624895 markings, 91836483 edges, 709051 markings/sec, 55 secs
lola: 49124942 markings, 98828876 edges, 700009 markings/sec, 60 secs
lola: 52604300 markings, 105790600 edges, 695872 markings/sec, 65 secs
lola: 56148484 markings, 112879872 edges, 708837 markings/sec, 70 secs
lola: 59618066 markings, 119821186 edges, 693916 markings/sec, 75 secs
lola: 63072854 markings, 126717158 edges, 690958 markings/sec, 80 secs
lola: 66469170 markings, 133513502 edges, 679263 markings/sec, 85 secs
lola: 69865218 markings, 140306118 edges, 679210 markings/sec, 90 secs
lola: 73215554 markings, 146999182 edges, 670067 markings/sec, 95 secs
lola: 76508379 markings, 153599447 edges, 658565 markings/sec, 100 secs
lola: 79940105 markings, 160454265 edges, 686345 markings/sec, 105 secs
lola: 83314998 markings, 167196501 edges, 674979 markings/sec, 110 secs
lola: 86688150 markings, 173946498 edges, 674630 markings/sec, 115 secs
lola: 90097267 markings, 180768795 edges, 681823 markings/sec, 120 secs
lola: 93459676 markings, 187492296 edges, 672482 markings/sec, 125 secs
lola: 96810363 markings, 194190483 edges, 670137 markings/sec, 130 secs
lola: 100073100 markings, 200716392 edges, 652547 markings/sec, 135 secs
lola: 103323399 markings, 207225975 edges, 650060 markings/sec, 140 secs
lola: 106761031 markings, 214082187 edges, 687526 markings/sec, 145 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 11 will run for 654 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (((Pm2 <= Pback2) OR X (TRUE))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (((Pm2 <= Pback2) OR X (TRUE))))
lola: processed formula length: 37
lola: 81 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: 2 markings, 1 edges
lola: ========================================
lola: subprocess 12 will run for 817 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (F ((1 <= Pback1))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (G (F ((1 <= Pback1))))
lola: processed formula length: 25
lola: 81 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: 50002 markings, 50002 edges
lola: ========================================
lola: subprocess 13 will run for 1090 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (F (((P3 <= Pback1) AND F ((Pout2 <= 2))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (G (F (((P3 <= Pback1) AND F ((Pout2 <= 2))))))
lola: processed formula length: 49
lola: 81 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: 50002 markings, 50002 edges
lola: ========================================
lola: subprocess 14 will run for 1635 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A ((F ((((Pout1 + 1 <= Pm2) AND (1 <= Pout3)) AND G ((1 <= Pout3)))) U G ((Pm2 <= Pout1))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A ((F ((((Pout1 + 1 <= Pm2) AND (1 <= Pout3)) AND G ((1 <= Pout3)))) U G ((Pm2 <= Pout1))))
lola: processed formula length: 91
lola: 81 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: 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: 250004 markings, 450004 edges
lola: ========================================
lola: subprocess 15 will run for 3270 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A ((((Pout3 <= Pm1) AND F ((Pm1 + 1 <= Pout3))) OR ((Pout1 <= 0) AND F ((Pout3 <= P3)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A ((((Pout3 <= Pm1) AND F ((Pm1 + 1 <= Pout3))) OR ((Pout1 <= 0) AND F ((Pout3 <= P3)))))
lola: processed formula length: 89
lola: 81 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: 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: ========================================
lola: ...considering subproblem: A ((((P4 <= Pm3) AND G ((P4 <= Pm3))) U (X ((G ((3 <= P3)) AND (2 <= Pm1))) U (P4 <= Pout3))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A ((((P4 <= Pm3) AND G ((P4 <= Pm3))) U (X ((G ((3 <= P3)) AND (2 <= Pm1))) U (P4 <= Pout3))))
lola: processed formula length: 94
lola: 81 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 13 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: 4142700 markings, 8433707 edges, 828540 markings/sec, 0 secs
lola: 7767017 markings, 15680663 edges, 724863 markings/sec, 5 secs
lola: 11318739 markings, 22784163 edges, 710344 markings/sec, 10 secs
lola: 14843081 markings, 29829512 edges, 704868 markings/sec, 15 secs
lola: 18371726 markings, 36887833 edges, 705729 markings/sec, 20 secs
lola: 21829591 markings, 43802771 edges, 691573 markings/sec, 25 secs
lola: 25222748 markings, 50588792 edges, 678631 markings/sec, 30 secs
lola: 28694956 markings, 57532303 edges, 694442 markings/sec, 35 secs
lola: 32134202 markings, 64409998 edges, 687849 markings/sec, 40 secs
lola: 35488956 markings, 71121054 edges, 670951 markings/sec, 45 secs
lola: 38838262 markings, 77818047 edges, 669861 markings/sec, 50 secs
lola: 42171589 markings, 84485921 edges, 666665 markings/sec, 55 secs
lola: 45443618 markings, 91029840 edges, 654406 markings/sec, 60 secs
lola: 48648441 markings, 97435593 edges, 640965 markings/sec, 65 secs
lola: 51844040 markings, 103828068 edges, 639120 markings/sec, 70 secs
lola: 55126594 markings, 110391164 edges, 656511 markings/sec, 75 secs
lola: 58291888 markings, 116724635 edges, 633059 markings/sec, 80 secs
lola: 61452611 markings, 123046533 edges, 632145 markings/sec, 85 secs
lola: 64479998 markings, 129099210 edges, 605477 markings/sec, 90 secs
lola: 67522726 markings, 135183649 edges, 608546 markings/sec, 95 secs
lola: 70555507 markings, 141245487 edges, 606556 markings/sec, 100 secs
lola: 73473004 markings, 147082704 edges, 583499 markings/sec, 105 secs
lola: 76343911 markings, 152828286 edges, 574181 markings/sec, 110 secs
lola: 79109699 markings, 158352678 edges, 553158 markings/sec, 115 secs
lola: 81849105 markings, 163833505 edges, 547881 markings/sec, 120 secs
lola: 84725717 markings, 169589097 edges, 575322 markings/sec, 125 secs
lola: 87524377 markings, 175188908 edges, 559732 markings/sec, 130 secs
lola: 87524526 markings, 175189057 edges, 30 markings/sec, 135 secs
lola: 87524695 markings, 175189226 edges, 34 markings/sec, 140 secs
lola: 87541319 markings, 175222386 edges, 3325 markings/sec, 145 secs
lola: Child process aborted or communication problem between parent and child process
lola: ========================================
lola: ...considering subproblem: A (X (G ((X ((Pback2 <= 1)) AND (X ((Pback3 <= Pm2)) OR G ((2 <= Pback2)))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (G ((X ((Pback2 <= 1)) AND (X ((Pback3 <= Pm2)) OR G ((2 <= Pback2)))))))
lola: processed formula length: 78
lola: 81 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 7 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: 4935129 markings, 10095089 edges, 987026 markings/sec, 0 secs
lola: 9184208 markings, 18963216 edges, 849816 markings/sec, 5 secs
lola: 13208827 markings, 27011175 edges, 804924 markings/sec, 10 secs
lola: 17010247 markings, 34612467 edges, 760284 markings/sec, 15 secs
lola: 20723071 markings, 42034911 edges, 742565 markings/sec, 20 secs
lola: 24555848 markings, 49702391 edges, 766555 markings/sec, 25 secs
lola: 28366566 markings, 57321846 edges, 762144 markings/sec, 30 secs
lola: 32175194 markings, 64938993 edges, 761726 markings/sec, 35 secs
lola: 35922785 markings, 72430093 edges, 749518 markings/sec, 40 secs
lola: 39583006 markings, 79747870 edges, 732044 markings/sec, 45 secs
lola: 43447070 markings, 87476961 edges, 772813 markings/sec, 50 secs
lola: 47290873 markings, 95163294 edges, 768761 markings/sec, 55 secs
lola: 51103434 markings, 102780447 edges, 762512 markings/sec, 60 secs
lola: 54878614 markings, 110338038 edges, 755036 markings/sec, 65 secs
lola: 58626870 markings, 117836118 edges, 749651 markings/sec, 70 secs
lola: 62250303 markings, 125081770 edges, 724687 markings/sec, 75 secs
lola: 65854454 markings, 132287907 edges, 720830 markings/sec, 80 secs
lola: 69472709 markings, 139516993 edges, 723651 markings/sec, 85 secs
lola: 73183722 markings, 146936380 edges, 742203 markings/sec, 90 secs
lola: 76841137 markings, 154263665 edges, 731483 markings/sec, 95 secs
lola: 80485370 markings, 161549290 edges, 728847 markings/sec, 100 secs
lola: 84066490 markings, 168712367 edges, 716224 markings/sec, 105 secs
lola: 87669042 markings, 175918360 edges, 720510 markings/sec, 110 secs
lola: 91246590 markings, 183071374 edges, 715510 markings/sec, 115 secs
lola: 94734206 markings, 190042108 edges, 697523 markings/sec, 120 secs
lola: 98266478 markings, 197107527 edges, 706454 markings/sec, 125 secs
lola: 101695912 markings, 203954196 edges, 685887 markings/sec, 130 secs
lola: 105114930 markings, 210799970 edges, 683804 markings/sec, 135 secs
lola: 108787105 markings, 218146405 edges, 734435 markings/sec, 140 secs
lola: 109018469 markings, 218597473 edges, 46273 markings/sec, 145 secs
lola: Child process aborted or communication problem between parent and child process
lola: RESULT
lola:
SUMMARY: yes unknown no no no yes no no yes no yes no unknown yes yes no
lola:
preliminary result: yes unknown no no no yes no no yes no yes no unknown yes yes no
lola: memory consumption: 22984 KB
lola: time consumption: 607 seconds
lola: print data as JSON (--json)
lola: writing JSON to LTLCardinality.json
lola: closed JSON file LTLCardinality.json
rslt: finished

BK_STOP 1589725206082

--------------------
content from stderr:

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="Kanban-PT-50000"
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 Kanban-PT-50000, 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 r105-oct2-158940199800145"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/Kanban-PT-50000.tgz
mv Kanban-PT-50000 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 '' LTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
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 ;