fond
Model Checking Contest 2020
10th edition, Paris, France, June 23, 2020
Execution of r105-oct2-158940199700127
Last Updated
Jun 28, 2020

About the Execution of 2019-Gold for Kanban-PT-00050

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
15918.470 1107032.00 1101512.00 1898.30 FFFFFFFFT?F?FFTF normal

Execution Chart

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

Trace from the execution

Formatting '/data/fko/mcc2020-input.r105-oct2-158940199700127.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-00050, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r105-oct2-158940199700127
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 188K
-rw-r--r-- 1 mcc users 3.0K Apr 8 12:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 17K Apr 8 12:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Apr 7 16:12 CTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 7 16:12 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 24 05:37 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 5.9K Mar 24 05:37 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.1K Apr 14 12:41 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Apr 28 14:01 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Apr 14 12:41 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 28 14:01 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.0K Apr 6 19:12 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 14K Apr 6 19:12 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.0K Apr 6 02:32 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 19K Apr 6 02:32 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-00050-00
FORMULA_NAME Kanban-PT-00050-01
FORMULA_NAME Kanban-PT-00050-02
FORMULA_NAME Kanban-PT-00050-03
FORMULA_NAME Kanban-PT-00050-04
FORMULA_NAME Kanban-PT-00050-05
FORMULA_NAME Kanban-PT-00050-06
FORMULA_NAME Kanban-PT-00050-07
FORMULA_NAME Kanban-PT-00050-08
FORMULA_NAME Kanban-PT-00050-09
FORMULA_NAME Kanban-PT-00050-10
FORMULA_NAME Kanban-PT-00050-11
FORMULA_NAME Kanban-PT-00050-12
FORMULA_NAME Kanban-PT-00050-13
FORMULA_NAME Kanban-PT-00050-14
FORMULA_NAME Kanban-PT-00050-15

=== Now, execution of the tool begins

BK_START 1589724001412

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

FORMULA Kanban-PT-00050-00 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Kanban-PT-00050-01 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

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

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

FORMULA Kanban-PT-00050-05 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

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

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

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

FORMULA Kanban-PT-00050-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Kanban-PT-00050-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

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

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

FORMULA Kanban-PT-00050-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

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

FORMULA Kanban-PT-00050-09 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Kanban-PT-00050-11 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 2463
rslt: Output for LTLCardinality @ Kanban-PT-00050

{
"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:00:01 2020
",
"timelimit": 3570
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 222
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 222
},
"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 (F (G (((1 <= Pback3) AND F ((Pm3 <= Pm1))))))",
"processed_size": 48,
"rewrites": 97
},
"result":
{
"edges": 54,
"markings": 53,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 0,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 0,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 237
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 237
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 1,
"G": 0,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "A (X (F ((Pout2 + 1 <= Pout4))))",
"processed_size": 32,
"rewrites": 97
},
"result":
{
"edges": 102,
"markings": 102,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 1,
"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": 1,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 254
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 2,
"aconj": 1,
"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 (X (G (((Pout3 <= Pm3) AND X (((3 <= Pout2)))))))",
"processed_size": 51,
"rewrites": 97
},
"result":
{
"edges": 106,
"markings": 106,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 4
},
"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": 274
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 274
},
"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 (F (G ((Pout3 <= Pm4))))",
"processed_size": 26,
"rewrites": 97
},
"result":
{
"edges": 14,
"markings": 11,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 3,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 3,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 297
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 297
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "(Pout3 + 1 <= Pback3)",
"processed_size": 21,
"rewrites": 97
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 4,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 4,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 324
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 1,
"G": 0,
"U": 1,
"X": 3,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "A (X ((F ((2 <= Pback3)) U X (X ((Pout4 + 1 <= Pback3))))))",
"processed_size": 59,
"rewrites": 97
},
"result":
{
"edges": 106,
"markings": 106,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 8
},
"compoundnumber": 5,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 356
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 1,
"G": 2,
"U": 0,
"X": 2,
"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 (G ((X ((P4 <= Pm4)) AND G (F ((P1 + 1 <= Pm3)))))))",
"processed_size": 57,
"rewrites": 97
},
"result":
{
"edges": 106,
"markings": 106,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 6
},
"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": 396
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 1,
"G": 1,
"U": 1,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 7,
"taut": 0,
"tconj": 0,
"tdisj": 2,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "A (X (((Pm2 <= Pout1) U ((Pback2 <= P2) OR (F ((Pm2 <= Pout1)) OR G ((P3 <= 2)))))))",
"processed_size": 84,
"rewrites": 97
},
"result":
{
"edges": 1,
"markings": 2,
"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": 470
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 1,
"G": 1,
"U": 1,
"X": 3,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 3,
"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 (X (((F ((Pout2 <= Pm4)) U (3 <= Pm2)) AND X (G ((2 <= Pback1)))))))",
"processed_size": 73,
"rewrites": 97
},
"result":
{
"edges": 107,
"markings": 107,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 7
},
"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": 604
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 1,
"G": 0,
"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 (F ((1 <= Pback2))))",
"processed_size": 25,
"rewrites": 97
},
"result":
{
"edges": 106,
"markings": 106,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"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": 755
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "A ((F (G ((Pback1 + 1 <= Pm4))) OR X ((Pm2 <= Pback1))))",
"processed_size": 56,
"rewrites": 97
},
"result":
{
"edges": 1,
"markings": 2,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 4
},
"compoundnumber": 12,
"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": 1006
},
"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 ((1 <= P4)))",
"processed_size": 17,
"rewrites": 99
},
"result":
{
"edges": 50,
"markings": 51,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 13,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"type": "invariance",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1510
},
"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": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "A (G (((2 <= Pback2) AND (2 <= Pout4))))",
"processed_size": 40,
"rewrites": 99
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 14,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"type": "invariance",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3020
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3020
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "(1 <= Pout3)",
"processed_size": 12,
"rewrites": 97
},
"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": 21032,
"runtime": 1083.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "LTLCardinality.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "(A(F(G((** AND F(**))))) AND A(G((** OR X(G((** AND F(**)))))))) : (A(X(F(*))) AND A((F(**) OR X(G(**))))) : A(G(**)) : A(X(G((** AND X(**))))) : (A(X(**)) AND A(F(G(**)))) : (* AND A(F((** AND X(**))))) : A(X((F(**) U X(X(**))))) : A(X(G((X(**) AND G(F(*)))))) : A(X((** U (** OR (F(**) OR G(*)))))) : A(G(F(((** AND X(G(**))) OR G(*))))) : A(X(X(((F(**) U **) AND X(G(**)))))) : A((X(*) OR G(F(*)))) : A(G(**)) : A(X(F(**))) : A((F(G(**)) OR X(**))) : (** AND A(F(G(**))))"
},
"net":
{
"arcs": 40,
"conflict_clusters": 12,
"places": 16,
"places_significant": 11,
"singleton_clusters": 0,
"transitions": 16
},
"result":
{
"preliminary_value": "no no no no no no no no yes unknown no unknown no no yes no ",
"value": "no no no no no no no no yes unknown no unknown no no yes no "
},
"task":
{
"type": "compound"
}
}
lola: LoLA will run for 3570 seconds at most (--timelimit)
lola: NET
lola: input: PNML file (--pnml)
lola: reading net from model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file model.pnml
lola: 32/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 512
lola: finding significant places
lola: 16 places, 16 transitions, 11 significant places
lola: compute conflict clusters
lola: computed conflict clusters
lola: Computing conflicting sets
lola: Computing back conflicting sets
lola: TASK
lola: Reading formula in XML format (--xmlformula)
lola: reading pnml
lola: reading formula from LTLCardinality.xml
lola: A (G (((3 <= Pm1) U NOT(F (NOT(G (X (((1 <= Pback3) AND F ((Pm3 <= Pm1))))))))))) : A ((X (NOT(G ((Pout4 <= Pout2)))) AND (F ((Pout4 <= Pout2)) OR X (G ((P4 <= Pm3)))))) : A (G ((1 <= P4))) : A (G (X (((Pout3 <= Pm3) AND X (((3 <= Pout2))))))) : A ((X ((P1 <= P2)) AND F (G (((0 <= Pback1) U ((P2 + 1 <= P1) U G ((Pout3 <= Pm4)))))))) : A (NOT(((Pback3 <= Pout3) OR NOT(F ((((Pback4 <= Pout1) U (Pback3 <= Pout3)) U ((3 <= Pm4) AND X ((Pback4 <= Pout1))))))))) : A (X ((F ((2 <= Pback3)) U X (X ((Pout4 + 1 <= Pback3)))))) : A (G (X ((X ((P4 <= Pm4)) AND NOT((F ((1 <= Pback1)) U F (X (G ((Pm3 <= P1)))))))))) : A ((X ((Pm2 <= Pout1)) U X ((((Pback2 <= P2) OR F (((Pback4 <= Pout4) U (Pm2 <= Pout1)))) OR NOT(F ((3 <= P3))))))) : A (NOT(F (NOT(F ((((Pm2 <= Pback3) AND G (X ((2 <= P2)))) OR NOT(F ((1 <= Pback4))))))))) : A (X (X (((F ((Pout2 <= Pm4)) U (3 <= Pm2)) AND X (G ((2 <= Pback1))))))) : A ((NOT(X ((Pm1 <= Pback1))) OR G (NOT(X (G (F (((Pback1 + 1 <= P3) U X (G ((P3 <= Pback1))))))))))) : A (G (((2 <= Pback2) AND (2 <= Pout4)))) : A (F (((2 <= Pout4) U X ((1 <= Pback2))))) : A ((F (G (X ((Pback1 + 1 <= Pm4)))) OR X ((Pm2 <= Pback1)))) : A (((1 <= Pout3) AND F (G ((1 <= Pout3)))))
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:315
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:356
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:437
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:374
lola: rewrite Frontend/Parser/formula_rewrite.k:536
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:536
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:169
lola: rewrite Frontend/Parser/formula_rewrite.k:434
lola: rewrite Frontend/Parser/formula_rewrite.k:374
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:536
lola: rewrite Frontend/Parser/formula_rewrite.k:434
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:335
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:329
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:536
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:422
lola: rewrite Frontend/Parser/formula_rewrite.k:332
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:434
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:410
lola: rewrite Frontend/Parser/formula_rewrite.k:353
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:318
lola: rewrite Frontend/Parser/formula_rewrite.k:315
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:297
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:300
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:318
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:434
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:374
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:434
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:536
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 222 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (F (G (((1 <= Pback3) AND F ((Pm3 <= Pm1)))))) AND A (G (((3 <= Pm1) OR X (G (((1 <= Pback3) AND F ((Pm3 <= Pm1)))))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 0 will run for 222 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (G (((1 <= Pback3) AND F ((Pm3 <= Pm1))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F (G (((1 <= Pback3) AND F ((Pm3 <= Pm1))))))
lola: processed formula length: 48
lola: 97 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: add low 15
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: 53 markings, 54 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 1 will run for 237 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (X (F ((Pout2 + 1 <= Pout4)))) AND A ((F ((Pout4 <= Pout2)) OR X (G ((P4 <= Pm3))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 1 will run for 237 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (F ((Pout2 + 1 <= Pout4))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (F ((Pout2 + 1 <= Pout4))))
lola: processed formula length: 32
lola: 97 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: 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: 102 markings, 102 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 2 will run for 254 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (G (((Pout3 <= Pm3) AND X (((3 <= Pout2)))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (G (((Pout3 <= Pm3) AND X (((3 <= Pout2)))))))
lola: processed formula length: 51
lola: 97 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: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 106 markings, 106 edges
lola: ========================================
lola: subprocess 3 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (X ((P1 <= P2))) AND A (F (G ((Pout3 <= Pm4)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 3 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (G ((Pout3 <= Pm4))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F (G ((Pout3 <= Pm4))))
lola: processed formula length: 26
lola: 97 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: add low 12
lola: add low 7
lola: add low 11
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: 11 markings, 14 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 4 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((Pout3 + 1 <= Pback3) AND A (F (((3 <= Pm4) AND X ((Pback4 <= Pout1))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 4 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (Pout3 + 1 <= Pback3)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (Pout3 + 1 <= Pback3)
lola: processed formula length: 21
lola: 97 rewrites
lola: closed formula file LTLCardinality.xml
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 5 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X ((F ((2 <= Pback3)) U X (X ((Pout4 + 1 <= Pback3))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X ((F ((2 <= Pback3)) U X (X ((Pout4 + 1 <= Pback3))))))
lola: processed formula length: 59
lola: 97 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 8 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: 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: 106 markings, 106 edges
lola: ========================================
lola: subprocess 6 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (G ((X ((P4 <= Pm4)) AND G (F ((P1 + 1 <= Pm3)))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (G ((X ((P4 <= Pm4)) AND G (F ((P1 + 1 <= Pm3)))))))
lola: processed formula length: 57
lola: 97 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: 106 markings, 106 edges
lola: ========================================
lola: subprocess 7 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (((Pm2 <= Pout1) U ((Pback2 <= P2) OR (F ((Pm2 <= Pout1)) OR G ((P3 <= 2)))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (((Pm2 <= Pout1) U ((Pback2 <= P2) OR (F ((Pm2 <= Pout1)) OR G ((P3 <= 2)))))))
lola: processed formula length: 84
lola: 97 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: 2 markings, 1 edges
lola: ========================================
lola: subprocess 8 will run for 445 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (F ((((Pm2 <= Pback3) AND X (G ((2 <= P2)))) OR G ((Pback4 <= 0))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (G (F ((((Pm2 <= Pback3) AND X (G ((2 <= P2)))) OR G ((Pback4 <= 0))))))
lola: processed formula length: 74
lola: 97 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: 2740408 markings, 9718462 edges, 548082 markings/sec, 0 secs
lola: 4971086 markings, 18328176 edges, 446136 markings/sec, 5 secs
lola: 7003305 markings, 26496605 edges, 406444 markings/sec, 10 secs
lola: 8941168 markings, 34417446 edges, 387573 markings/sec, 15 secs
lola: 10815235 markings, 42188066 edges, 374813 markings/sec, 20 secs
lola: 12640889 markings, 49795789 edges, 365131 markings/sec, 25 secs
lola: 14412023 markings, 57269753 edges, 354227 markings/sec, 30 secs
lola: 16100396 markings, 64503369 edges, 337675 markings/sec, 35 secs
lola: 17789123 markings, 71724855 edges, 337745 markings/sec, 40 secs
lola: 19425765 markings, 78830254 edges, 327328 markings/sec, 45 secs
lola: 21068850 markings, 85939522 edges, 328617 markings/sec, 50 secs
lola: 22650219 markings, 92888246 edges, 316274 markings/sec, 55 secs
lola: 24226105 markings, 99809308 edges, 315177 markings/sec, 60 secs
lola: 25792103 markings, 106710107 edges, 313200 markings/sec, 65 secs
lola: 27398723 markings, 113698138 edges, 321324 markings/sec, 70 secs
lola: 28955609 markings, 120532797 edges, 311377 markings/sec, 75 secs
lola: 30496583 markings, 127340056 edges, 308195 markings/sec, 80 secs
lola: 32011580 markings, 134110448 edges, 302999 markings/sec, 85 secs
lola: 33515420 markings, 140791747 edges, 300768 markings/sec, 90 secs
lola: 34989965 markings, 147400106 edges, 294909 markings/sec, 95 secs
lola: 36445070 markings, 153939055 edges, 291021 markings/sec, 100 secs
lola: 37948891 markings, 160634117 edges, 300764 markings/sec, 105 secs
lola: 39415030 markings, 167226560 edges, 293228 markings/sec, 110 secs
lola: 40855369 markings, 173727827 edges, 288068 markings/sec, 115 secs
lola: 42257339 markings, 180113332 edges, 280394 markings/sec, 120 secs
lola: 43716169 markings, 186693250 edges, 291766 markings/sec, 125 secs
lola: 45115898 markings, 193045385 edges, 279946 markings/sec, 130 secs
lola: 46542484 markings, 199469132 edges, 285317 markings/sec, 135 secs
lola: 47920966 markings, 205774022 edges, 275696 markings/sec, 140 secs
lola: 49361922 markings, 212250519 edges, 288191 markings/sec, 145 secs
lola: 50815225 markings, 218800081 edges, 290661 markings/sec, 150 secs
lola: 52212243 markings, 225199142 edges, 279404 markings/sec, 155 secs
lola: 53568947 markings, 231495231 edges, 271341 markings/sec, 160 secs
lola: 54991963 markings, 237967941 edges, 284603 markings/sec, 165 secs
lola: 56360349 markings, 244322122 edges, 273677 markings/sec, 170 secs
lola: 57711692 markings, 250578529 edges, 270269 markings/sec, 175 secs
lola: 59114981 markings, 256959146 edges, 280658 markings/sec, 180 secs
lola: 60465799 markings, 263204489 edges, 270164 markings/sec, 185 secs
lola: 61884190 markings, 269674892 edges, 283678 markings/sec, 190 secs
lola: 63271857 markings, 276001531 edges, 277533 markings/sec, 195 secs
lola: 64622054 markings, 282278977 edges, 270039 markings/sec, 200 secs
lola: 65993457 markings, 288588322 edges, 274281 markings/sec, 205 secs
lola: 67356742 markings, 294887403 edges, 272657 markings/sec, 210 secs
lola: 68735961 markings, 301227983 edges, 275844 markings/sec, 215 secs
lola: 70096435 markings, 307494029 edges, 272095 markings/sec, 220 secs
lola: 71432929 markings, 313657737 edges, 267299 markings/sec, 225 secs
lola: 72771034 markings, 319831505 edges, 267621 markings/sec, 230 secs
lola: 74078073 markings, 325964084 edges, 261408 markings/sec, 235 secs
lola: 75348567 markings, 331954591 edges, 254099 markings/sec, 240 secs
lola: 76692283 markings, 338168059 edges, 268743 markings/sec, 245 secs
lola: 77977907 markings, 344191694 edges, 257125 markings/sec, 250 secs
lola: 79298565 markings, 350300857 edges, 264132 markings/sec, 255 secs
lola: 80597593 markings, 356373803 edges, 259806 markings/sec, 260 secs
lola: 81649929 markings, 361309516 edges, 210467 markings/sec, 265 secs
lola: 81718529 markings, 361625571 edges, 13720 markings/sec, 270 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 9 will run for 470 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (X (((F ((Pout2 <= Pm4)) U (3 <= Pm2)) AND X (G ((2 <= Pback1)))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (X (((F ((Pout2 <= Pm4)) U (3 <= Pm2)) AND X (G ((2 <= Pback1)))))))
lola: processed formula length: 73
lola: 97 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: 107 markings, 107 edges
lola: ========================================
lola: subprocess 10 will run for 548 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A ((X ((Pback1 + 1 <= Pm1)) OR G (F ((Pback1 + 1 <= P3)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A ((X ((Pback1 + 1 <= Pm1)) OR G (F ((Pback1 + 1 <= P3)))))
lola: processed formula length: 59
lola: 97 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: 2711901 markings, 9601490 edges, 542380 markings/sec, 0 secs
lola: 4978776 markings, 18349363 edges, 453375 markings/sec, 5 secs
lola: 7047954 markings, 26625181 edges, 413836 markings/sec, 10 secs
lola: 8987526 markings, 34595885 edges, 387914 markings/sec, 15 secs
lola: 10879113 markings, 42386147 edges, 378317 markings/sec, 20 secs
lola: 12717584 markings, 50078698 edges, 367694 markings/sec, 25 secs
lola: 14480334 markings, 57516390 edges, 352550 markings/sec, 30 secs
lola: 16159143 markings, 64751631 edges, 335762 markings/sec, 35 secs
lola: 17869695 markings, 71984745 edges, 342110 markings/sec, 40 secs
lola: 19546396 markings, 79188247 edges, 335340 markings/sec, 45 secs
lola: 21181365 markings, 86279661 edges, 326994 markings/sec, 50 secs
lola: 22779548 markings, 93262939 edges, 319637 markings/sec, 55 secs
lola: 24324109 markings, 100106816 edges, 308912 markings/sec, 60 secs
lola: 25924146 markings, 107088293 edges, 320007 markings/sec, 65 secs
lola: 27486684 markings, 113982481 edges, 312508 markings/sec, 70 secs
lola: 29012877 markings, 120744578 edges, 305239 markings/sec, 75 secs
lola: 30523431 markings, 127466305 edges, 302111 markings/sec, 80 secs
lola: 32022772 markings, 134178359 edges, 299868 markings/sec, 85 secs
lola: 33506250 markings, 140820479 edges, 296696 markings/sec, 90 secs
lola: 35070025 markings, 147715711 edges, 312755 markings/sec, 95 secs
lola: 36531592 markings, 154301596 edges, 292313 markings/sec, 100 secs
lola: 37972824 markings, 160816703 edges, 288246 markings/sec, 105 secs
lola: 39416583 markings, 167351297 edges, 288752 markings/sec, 110 secs
lola: 40832190 markings, 173799089 edges, 283121 markings/sec, 115 secs
lola: 42274046 markings, 180293034 edges, 288371 markings/sec, 120 secs
lola: 43747052 markings, 186895534 edges, 294601 markings/sec, 125 secs
lola: 45159166 markings, 193349169 edges, 282423 markings/sec, 130 secs
lola: 46600839 markings, 199883670 edges, 288335 markings/sec, 135 secs
lola: 48076761 markings, 206515791 edges, 295184 markings/sec, 140 secs
lola: 49480472 markings, 212911320 edges, 280742 markings/sec, 145 secs
lola: 50884813 markings, 219319601 edges, 280868 markings/sec, 150 secs
lola: 52281234 markings, 225726015 edges, 279284 markings/sec, 155 secs
lola: 53687583 markings, 232187375 edges, 281270 markings/sec, 160 secs
lola: 55097451 markings, 238619404 edges, 281974 markings/sec, 165 secs
lola: 56517547 markings, 245086507 edges, 284019 markings/sec, 170 secs
lola: 57889481 markings, 251409015 edges, 274387 markings/sec, 175 secs
lola: 59267861 markings, 257798799 edges, 275676 markings/sec, 180 secs
lola: 60680745 markings, 264248886 edges, 282577 markings/sec, 185 secs
lola: 62057482 markings, 270591354 edges, 275347 markings/sec, 190 secs
lola: 63419492 markings, 276885364 edges, 272402 markings/sec, 195 secs
lola: 64795855 markings, 283188597 edges, 275273 markings/sec, 200 secs
lola: 66151532 markings, 289444932 edges, 271135 markings/sec, 205 secs
lola: 67543830 markings, 295827042 edges, 278460 markings/sec, 210 secs
lola: 68917294 markings, 302118713 edges, 274693 markings/sec, 215 secs
lola: 70279111 markings, 308418725 edges, 272363 markings/sec, 220 secs
lola: 71641890 markings, 314766886 edges, 272556 markings/sec, 225 secs
lola: 73017150 markings, 321078168 edges, 275052 markings/sec, 230 secs
lola: 74367074 markings, 327330810 edges, 269985 markings/sec, 235 secs
lola: 75666747 markings, 333439617 edges, 259935 markings/sec, 240 secs
lola: 76989026 markings, 339557596 edges, 264456 markings/sec, 245 secs
lola: 78325701 markings, 345739588 edges, 267335 markings/sec, 250 secs
lola: 79633996 markings, 351857099 edges, 261659 markings/sec, 255 secs
lola: 80935951 markings, 357974157 edges, 260391 markings/sec, 260 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 11 will run for 604 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (F ((1 <= Pback2))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (F ((1 <= Pback2))))
lola: processed formula length: 25
lola: 97 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: 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: 106 markings, 106 edges
lola: ========================================
lola: subprocess 12 will run for 755 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A ((F (G ((Pback1 + 1 <= Pm4))) OR X ((Pm2 <= Pback1))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A ((F (G ((Pback1 + 1 <= Pm4))) OR X ((Pm2 <= Pback1))))
lola: processed formula length: 56
lola: 97 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 13 will run for 1006 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((1 <= P4)))
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 ((1 <= P4)))
lola: processed formula length: 17
lola: 99 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: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 51 markings, 50 edges
lola: state equation task get result started, id 0
lola: ========================================
lola: subprocess 14 will run for 1510 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((2 <= Pback2) AND (2 <= Pout4))))
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 <= Pback2) AND (2 <= Pout4))))
lola: processed formula length: 40
lola: 99 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: SUBRESULT
lola: result: no
lola: produced by: state space
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: state equation task get result rewrite finished id 0
lola: The predicate is not invariant.
lola: 0 markings, 0 edges
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((Pback2 <= 1) OR (Pout4 <= 1))
lola: state equation task get result unparse finished id 0
lola: lola: subprocess 15 will run for 3020 seconds at most (--localtimelimit=0)
lola: ========================================
state equation: Generated DNF with 2 literals and 2 conjunctive subformulas
lola: ...considering subproblem: ((1 <= Pout3) AND A (F (G ((1 <= Pout3)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: subprocess 15 will run for 3020 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (1 <= Pout3)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (1 <= Pout3)
lola: processed formula length: 12
lola: 97 rewrites
lola: closed formula file LTLCardinality.xml
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: state equation: write sara problem file to LTLCardinality-14-0.sara
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: ========================================
lola: ...considering subproblem: A (G (F ((((Pm2 <= Pback3) AND X (G ((2 <= P2)))) OR G ((Pback4 <= 0))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (G (F ((((Pm2 <= Pback3) AND X (G ((2 <= P2)))) OR G ((Pback4 <= 0))))))
lola: processed formula length: 74
lola: 97 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: 2685923 markings, 9502854 edges, 537185 markings/sec, 0 secs
lola: 4856790 markings, 17883239 edges, 434173 markings/sec, 5 secs
lola: 6850754 markings, 25873695 edges, 398793 markings/sec, 10 secs
lola: 8746142 markings, 33590972 edges, 379078 markings/sec, 15 secs
lola: 10566178 markings, 41143989 edges, 364007 markings/sec, 20 secs
lola: 12342240 markings, 48565479 edges, 355212 markings/sec, 25 secs
lola: 14101592 markings, 55942928 edges, 351870 markings/sec, 30 secs
lola: 15748182 markings, 62993469 edges, 329318 markings/sec, 35 secs
lola: 17414686 markings, 70119222 edges, 333301 markings/sec, 40 secs
lola: 19015666 markings, 77048788 edges, 320196 markings/sec, 45 secs
lola: 20624023 markings, 84012652 edges, 321671 markings/sec, 50 secs
lola: 22169641 markings, 90778957 edges, 309124 markings/sec, 55 secs
lola: 23734306 markings, 97661855 edges, 312933 markings/sec, 60 secs
lola: 25279342 markings, 104425298 edges, 309007 markings/sec, 65 secs
lola: 26878473 markings, 111385312 edges, 319826 markings/sec, 70 secs
lola: 28396010 markings, 118123412 edges, 303507 markings/sec, 75 secs
lola: 29982756 markings, 125043906 edges, 317349 markings/sec, 80 secs
lola: 31501121 markings, 131849693 edges, 303673 markings/sec, 85 secs
lola: 33030451 markings, 138599621 edges, 305866 markings/sec, 90 secs
lola: 34480329 markings, 145144938 edges, 289976 markings/sec, 95 secs
lola: 35967141 markings, 151807215 edges, 297362 markings/sec, 100 secs
lola: 37454473 markings, 158429733 edges, 297466 markings/sec, 105 secs
lola: 38907706 markings, 164991679 edges, 290647 markings/sec, 110 secs
lola: 40387335 markings, 171595698 edges, 295926 markings/sec, 115 secs
lola: 41798239 markings, 178041626 edges, 282181 markings/sec, 120 secs
lola: 43267053 markings, 184680007 edges, 293763 markings/sec, 125 secs
lola: 44727984 markings, 191259693 edges, 292186 markings/sec, 130 secs
lola: 46163925 markings, 197768230 edges, 287188 markings/sec, 135 secs
lola: 47576187 markings, 204183105 edges, 282452 markings/sec, 140 secs
lola: 49003225 markings, 210619213 edges, 285408 markings/sec, 145 secs
lola: 50455705 markings, 217184174 edges, 290496 markings/sec, 150 secs
lola: 51879544 markings, 223680918 edges, 284768 markings/sec, 155 secs
lola: 53272076 markings, 230114254 edges, 278506 markings/sec, 160 secs
lola: 54679175 markings, 236552836 edges, 281420 markings/sec, 165 secs
lola: 56080220 markings, 243021969 edges, 280209 markings/sec, 170 secs
lola: 57447061 markings, 249339596 edges, 273368 markings/sec, 175 secs
lola: 58832003 markings, 255668942 edges, 276988 markings/sec, 180 secs
lola: 60203861 markings, 261992028 edges, 274372 markings/sec, 185 secs
lola: 61635241 markings, 268552336 edges, 286276 markings/sec, 190 secs
lola: 63092266 markings, 275214192 edges, 291405 markings/sec, 195 secs
lola: 64530321 markings, 281844287 edges, 287611 markings/sec, 200 secs
lola: 65970915 markings, 288480315 edges, 288119 markings/sec, 205 secs
lola: 67369070 markings, 294945097 edges, 279631 markings/sec, 210 secs
lola: 68779711 markings, 301427900 edges, 282128 markings/sec, 215 secs
lola: 70182318 markings, 307890235 edges, 280521 markings/sec, 220 secs
lola: 71548396 markings, 314181536 edges, 273216 markings/sec, 225 secs
lola: 72899415 markings, 320456639 edges, 270204 markings/sec, 230 secs
lola: 74218636 markings, 326628869 edges, 263844 markings/sec, 235 secs
lola: 75494347 markings, 332629110 edges, 255142 markings/sec, 240 secs
lola: 76897193 markings, 339102564 edges, 280569 markings/sec, 245 secs
lola: 78232216 markings, 345361130 edges, 267005 markings/sec, 250 secs
lola: 79604148 markings, 351718575 edges, 274386 markings/sec, 255 secs
lola: 80922356 markings, 357888290 edges, 263642 markings/sec, 260 secs
lola: Child process aborted or communication problem between parent and child process
lola: ========================================
lola: ...considering subproblem: A ((X ((Pback1 + 1 <= Pm1)) OR G (F ((Pback1 + 1 <= P3)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A ((X ((Pback1 + 1 <= Pm1)) OR G (F ((Pback1 + 1 <= P3)))))
lola: processed formula length: 59
lola: 97 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: 2775026 markings, 9822768 edges, 555005 markings/sec, 0 secs
lola: 5025332 markings, 18531340 edges, 450061 markings/sec, 5 secs
lola: 7090447 markings, 26799874 edges, 413023 markings/sec, 10 secs
lola: 9049755 markings, 34855045 edges, 391862 markings/sec, 15 secs
lola: 10977816 markings, 42784713 edges, 385612 markings/sec, 20 secs
lola: 12814572 markings, 50473909 edges, 367351 markings/sec, 25 secs
lola: 14540274 markings, 57763045 edges, 345140 markings/sec, 30 secs
lola: 16223702 markings, 65018718 edges, 336686 markings/sec, 35 secs
lola: 17996964 markings, 72522340 edges, 354652 markings/sec, 40 secs
lola: 19705231 markings, 79884608 edges, 341653 markings/sec, 45 secs
lola: 21362486 markings, 87069311 edges, 331451 markings/sec, 50 secs
lola: 22982168 markings, 94174270 edges, 323936 markings/sec, 55 secs
lola: 24581300 markings, 101236328 edges, 319826 markings/sec, 60 secs
lola: 26209542 markings, 108365234 edges, 325648 markings/sec, 65 secs
lola: 27816150 markings, 115441360 edges, 321322 markings/sec, 70 secs
lola: 29372705 markings, 122390887 edges, 311311 markings/sec, 75 secs
lola: 30940665 markings, 129328874 edges, 313592 markings/sec, 80 secs
lola: 32463518 markings, 136157184 edges, 304571 markings/sec, 85 secs
lola: 33993001 markings, 142982732 edges, 305897 markings/sec, 90 secs
lola: 35564054 markings, 149947562 edges, 314211 markings/sec, 95 secs
lola: 37051267 markings, 156628940 edges, 297443 markings/sec, 100 secs
lola: 38526035 markings, 163291096 edges, 294954 markings/sec, 105 secs
lola: 40000879 markings, 169979000 edges, 294969 markings/sec, 110 secs
lola: 41435436 markings, 176532548 edges, 286911 markings/sec, 115 secs
lola: 42938499 markings, 183290649 edges, 300613 markings/sec, 120 secs
lola: 44415378 markings, 189953029 edges, 295376 markings/sec, 125 secs
lola: 45890352 markings, 196647304 edges, 294995 markings/sec, 130 secs
lola: 47349431 markings, 203263759 edges, 291816 markings/sec, 135 secs
lola: 48832373 markings, 209926174 edges, 296588 markings/sec, 140 secs
lola: 50262822 markings, 216457096 edges, 286090 markings/sec, 145 secs
lola: 51701733 markings, 223031463 edges, 287782 markings/sec, 150 secs
lola: 53094250 markings, 229491656 edges, 278503 markings/sec, 155 secs
lola: 54515005 markings, 236005972 edges, 284151 markings/sec, 160 secs
lola: 55958843 markings, 242546849 edges, 288768 markings/sec, 165 secs
lola: 57387195 markings, 249052095 edges, 285670 markings/sec, 170 secs
lola: 58760559 markings, 255451969 edges, 274673 markings/sec, 175 secs
lola: 60159714 markings, 261892204 edges, 279831 markings/sec, 180 secs
lola: 61572008 markings, 268368016 edges, 282459 markings/sec, 185 secs
lola: 62963653 markings, 274765058 edges, 278329 markings/sec, 190 secs
lola: 64343969 markings, 281132044 edges, 276063 markings/sec, 195 secs
lola: 65769935 markings, 287641825 edges, 285193 markings/sec, 200 secs
lola: 67161250 markings, 294023011 edges, 278263 markings/sec, 205 secs
lola: 68541214 markings, 300372676 edges, 275993 markings/sec, 210 secs
lola: 69910707 markings, 306694461 edges, 273899 markings/sec, 215 secs
lola: 71295296 markings, 313153356 edges, 276918 markings/sec, 220 secs
lola: 72689965 markings, 319572059 edges, 278934 markings/sec, 225 secs
lola: 74033681 markings, 325788383 edges, 268743 markings/sec, 230 secs
lola: 75394859 markings, 332168883 edges, 272236 markings/sec, 235 secs
lola: 76770354 markings, 338532092 edges, 275099 markings/sec, 240 secs
lola: 78139935 markings, 344890766 edges, 273916 markings/sec, 245 secs
lola: 79508037 markings, 351269999 edges, 273620 markings/sec, 250 secs
lola: 80855429 markings, 357594522 edges, 269478 markings/sec, 255 secs
lola: Child process aborted or communication problem between parent and child process
lola: RESULT
lola:
SUMMARY: no no no no no no no no yes unknown no unknown no no yes no
lola:
preliminary result: no no no no no no no no yes unknown no unknown no no yes no
lola: memory consumption: 21032 KB
lola: time consumption: 1083 seconds
lola: print data as JSON (--json)
lola: writing JSON to LTLCardinality.json
lola: closed JSON file LTLCardinality.json
rslt: finished

BK_STOP 1589725108444

--------------------
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-00050"
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-00050, 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-158940199700127"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/Kanban-PT-00050.tgz
mv Kanban-PT-00050 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 ;