fond
Model Checking Contest 2020
10th edition, Paris, France, June 23, 2020
Execution of r174-csrt-158987852600017
Last Updated
Jun 28, 2020

About the Execution of ITS-LoLa for MAPK-PT-00040

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
15795.560 3600000.00 529282.00 14285.70 FFFFFFF?TFFFTTFT normal

Execution Chart

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

Trace from the execution

Formatting '/local/x2003239/mcc2020-input.r174-csrt-158987852600017.qcow2', fmt=qcow2 size=4294967296 backing_file=/local/x2003239/mcc2020-input.qcow2 encryption=off cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
........................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itslola
Input is MAPK-PT-00040, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r174-csrt-158987852600017
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 204K
-rw-r--r-- 1 mcc users 3.3K Apr 8 12:59 CTLCardinality.txt
-rw-r--r-- 1 mcc users 17K Apr 8 12:59 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Apr 7 16:21 CTLFireability.txt
-rw-r--r-- 1 mcc users 14K Apr 7 16:21 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 24 05:37 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.0K Mar 24 05:37 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K Apr 14 12:42 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Apr 28 14:01 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K Apr 14 12:42 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:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 16K Apr 6 19:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Apr 6 02:42 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 6 02:42 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 6 20:24 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K 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 25K 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 MAPK-PT-00040-00
FORMULA_NAME MAPK-PT-00040-01
FORMULA_NAME MAPK-PT-00040-02
FORMULA_NAME MAPK-PT-00040-03
FORMULA_NAME MAPK-PT-00040-04
FORMULA_NAME MAPK-PT-00040-05
FORMULA_NAME MAPK-PT-00040-06
FORMULA_NAME MAPK-PT-00040-07
FORMULA_NAME MAPK-PT-00040-08
FORMULA_NAME MAPK-PT-00040-09
FORMULA_NAME MAPK-PT-00040-10
FORMULA_NAME MAPK-PT-00040-11
FORMULA_NAME MAPK-PT-00040-12
FORMULA_NAME MAPK-PT-00040-13
FORMULA_NAME MAPK-PT-00040-14
FORMULA_NAME MAPK-PT-00040-15

=== Now, execution of the tool begins

BK_START 1591124235610

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-02 18:57:17] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -timeout, 3600, -rebuildPNML]
[2020-06-02 18:57:18] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-02 18:57:18] [INFO ] Load time of PNML (sax parser for PT used): 36 ms
[2020-06-02 18:57:18] [INFO ] Transformed 22 places.
[2020-06-02 18:57:18] [INFO ] Transformed 30 transitions.
[2020-06-02 18:57:18] [INFO ] Parsed PT model containing 22 places and 30 transitions in 84 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 17 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100001 steps, including 0 resets, run finished after 97 ms. (steps per millisecond=1030 ) properties seen :[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 0, 1, 1, 1, 0, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 1, 1, 1, 1, 1, 0]
// Phase 1: matrix 30 rows 22 cols
[2020-06-02 18:57:18] [INFO ] Computed 7 place invariants in 4 ms
[2020-06-02 18:57:18] [INFO ] [Real]Absence check using 7 positive place invariants in 15 ms returned unsat
[2020-06-02 18:57:18] [INFO ] [Real]Absence check using 7 positive place invariants in 4 ms returned unsat
[2020-06-02 18:57:18] [INFO ] [Real]Absence check using 7 positive place invariants in 8 ms returned unsat
[2020-06-02 18:57:18] [INFO ] [Real]Absence check using 7 positive place invariants in 4 ms returned unsat
[2020-06-02 18:57:18] [INFO ] [Real]Absence check using 7 positive place invariants in 22 ms returned unsat
[2020-06-02 18:57:18] [INFO ] [Real]Absence check using 7 positive place invariants in 11 ms returned unsat
[2020-06-02 18:57:18] [INFO ] [Real]Absence check using 7 positive place invariants in 4 ms returned unsat
Successfully simplified 7 atomic propositions for a total of 9 simplifications.
[2020-06-02 18:57:18] [INFO ] Initial state reduction rules for CTL removed 4 formulas.
[2020-06-02 18:57:18] [INFO ] Flatten gal took : 50 ms
FORMULA MAPK-PT-00040-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MAPK-PT-00040-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MAPK-PT-00040-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MAPK-PT-00040-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-06-02 18:57:18] [INFO ] Flatten gal took : 10 ms
[2020-06-02 18:57:18] [INFO ] Export to MCC properties in file /home/mcc/execution/LTLCardinality.sr.xml took 4 ms.
[2020-06-02 18:57:18] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 1 ms.
info: Time: 3600 - MCC
vrfy: Checking LTLCardinality @ MAPK-PT-00040 @ 3570 seconds

FORMULA MAPK-PT-00040-02 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA MAPK-PT-00040-04 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA MAPK-PT-00040-05 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA MAPK-PT-00040-06 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA MAPK-PT-00040-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA MAPK-PT-00040-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA MAPK-PT-00040-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA MAPK-PT-00040-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA MAPK-PT-00040-00 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA MAPK-PT-00040-01 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA MAPK-PT-00040-03 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA MAPK-PT-00040-07 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 3062
rslt: Output for LTLCardinality @ MAPK-PT-00040

{
"build":
{
"architecture": 64,
"assertions": false,
"build_hostname": "mcc2019",
"build_system": "x86_64-unknown-linux-gnu",
"optimizations": true,
"package_version": "2.0",
"svn_version": "3189M"
},
"call":
{
"exec_host": "mcc2020",
"markinglimit": null,
"parameters":
[
"--pnmlnet",
"model.pnml",
"--xmlformula",
"--formula=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": "Tue Jun 2 18:57:19 2020
",
"timelimit": 3570
},
"child":
[

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

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 324
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "(p16 <= 0)",
"processed_size": 10,
"rewrites": 90
},
"result":
{
"edges": 11,
"markings": 11,
"produced_by": "state space / EG",
"value": false
},
"task":
{
"compoundnumber": 1,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 9
},
"threads": 1,
"type": "dfs"
},
"type": "eventual_occurrence"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 356
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"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": "X (G ((p0 + 1 <= p14)))",
"processed_size": 23,
"rewrites": 88
},
"result":
{
"edges": 4,
"markings": 4,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"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": 396
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 396
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"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": 2,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "F (G ((F ((3 <= p6)) AND (2 <= p19))))",
"processed_size": 38,
"rewrites": 88
},
"result":
{
"edges": 84,
"markings": 83,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 3,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 445
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 1,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 1,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "X ((F ((2 <= p19)) OR (G ((p18 <= p2)) AND F ((2 <= p19)))))",
"processed_size": 60,
"rewrites": 88
},
"result":
{
"edges": 4,
"markings": 4,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 4
},
"compoundnumber": 4,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 3,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 473
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 0,
"U": 0,
"X": 5,
"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": "X (X ((X (X (X (F ((p19 <= p17))))) OR (p8 <= 0))))",
"processed_size": 51,
"rewrites": 88
},
"result":
{
"edges": 18,
"markings": 17,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 6
},
"compoundnumber": 5,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 552
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 3,
"G": 1,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 6,
"comp": 6,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 12,
"taut": 0,
"tconj": 2,
"tdisj": 2,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "F ((X (F ((p4 + 1 <= p7))) OR (((p4 + 1 <= p7) R (p8 + 1 <= p19)) AND ((p7 <= p4) AND (F ((p8 + 1 <= p19)) OR G ((p7 <= p4)))))))",
"processed_size": 129,
"rewrites": 88
},
"result":
{
"edges": 4,
"markings": 4,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 9
},
"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": 663
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 0,
"U": 1,
"X": 2,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 8,
"taut": 0,
"tconj": 2,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "(X ((p4 <= p0)) U (F ((X ((p4 <= p0)) AND (p4 <= p17))) AND (p4 <= p17)))",
"processed_size": 73,
"rewrites": 88
},
"result":
{
"edges": 2,
"markings": 3,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 9
},
"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": 829
},
"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": "(p11 + 1 <= p21)",
"processed_size": 16,
"rewrites": 90
},
"result":
{
"edges": 4,
"markings": 4,
"produced_by": "state space / EG",
"value": false
},
"task":
{
"compoundnumber": 8,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 6
},
"threads": 1,
"type": "dfs"
},
"type": "eventual_occurrence"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1105
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 1,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "G (F (((p16 <= 2) OR (p9 + 1 <= p8))))",
"processed_size": 39,
"rewrites": 88
},
"result":
{
"edges": 41,
"markings": 31,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 9,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "fairness",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1658
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 2,
"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": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "F ((G (F ((p16 <= p3))) OR G ((1 <= p10))))",
"processed_size": 43,
"rewrites": 88
},
"result":
{
"edges": 891,
"markings": 473,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 10,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3316
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 2,
"U": 0,
"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": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 6,
"visible_transitions": 0
},
"processed": "F (G ((((p13 <= p9) AND (p18 <= p3)) AND (G ((2 <= p16)) OR (3 <= p17)))))",
"processed_size": 74,
"rewrites": 88
},
"result":
{
"edges": 6,
"markings": 5,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 4
},
"compoundnumber": 11,
"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": 3216,
"runtime": 507.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "LTLCardinality.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "G(F(*)) : F((G(F(**)) OR G(**))) : X(((** OR (G((X(G(*)) AND F(*))) AND F(**))) AND F(**))) : F(G((** AND (G(**) OR **)))) : (X(G(**)) OR F(**)) : X(G(*)) : (X((F(**) OR (G(**) AND F(**)))) OR F(G((F(**) AND **)))) : (** U X(X(G((F(G(**)) AND G((X(**) OR G(**)))))))) : X(X((X(X(X(F(**)))) OR *))) : F((X(F(*)) OR ((* R *) AND (* AND (F(*) OR G(*)))))) : F(**) : (X(**) U (F((X(**) AND **)) AND **))"
},
"net":
{
"arcs": 90,
"conflict_clusters": 12,
"places": 22,
"places_significant": 15,
"singleton_clusters": 0,
"transitions": 30
},
"result":
{
"preliminary_value": "no no no no no no no unknown no no no yes ",
"value": "no no no no no no no unknown no no no yes "
},
"task":
{
"type": "compound"
}
}
lola: LoLA will run for 3570 seconds at most (--timelimit)
lola: NET
lola: input: PNML file (--pnml)
lola: reading net from model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file model.pnml
lola: 52/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 704
lola: finding significant places
lola: 22 places, 30 transitions, 15 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: X (G (F (G (F (NOT(G (((3 <= p16) AND (p8 <= p9))))))))) : ((p16 <= p3) U F ((G (F ((p16 <= p3))) OR G ((1 <= p10))))) : X (((NOT(F ((F (X ((2 <= p8))) OR G ((p8 + 1 <= p21))))) U (p21 <= p8)) AND F ((2 <= p8)))) : F (G ((((p13 <= p9) AND (p18 <= p3)) AND (G ((2 <= p16)) OR (3 <= p17))))) : ((1 <= 0) U ((NOT(X (((p8 <= p18) U (0 <= 0)))) OR X (G ((p8 <= p18)))) OR F ((1 <= p16)))) : G (NOT(X ((p14 <= p0)))) : (X ((G ((p18 <= p2)) U ((p18 <= p2) U F ((2 <= p19))))) OR F (G ((F ((3 <= p6)) AND (2 <= p19))))) : ((3 <= p21) U G (NOT(X (X (NOT(G ((X ((1 <= p0)) U G ((3 <= p21)))))))))) : X (NOT(X ((G (NOT(X (X (X ((p19 <= p17)))))) AND (1 <= p8))))) : NOT(G ((X (G ((p7 <= p4))) AND (((p7 <= p4) U (p19 <= p8)) OR (G ((p19 <= p8)) U (p4 + 1 <= p7)))))) : F ((p21 <= p11)) : (X ((p4 <= p0)) U (F ((X ((p4 <= p0)) AND (p4 <= p17))) AND (p4 <= p17)))
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:371
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:422
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:166
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:279
lola: rewrite Frontend/Parser/formula_rewrite.k:145
lola: rewrite Frontend/Parser/formula_rewrite.k:122
lola: rewrite Frontend/Parser/formula_rewrite.k:185
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:422
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:437
lola: rewrite Frontend/Parser/formula_rewrite.k:374
lola: rewrite Frontend/Parser/formula_rewrite.k:315
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:329
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:329
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:315
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:315
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:318
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:318
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((((p21 <= p8) OR (G ((X (G ((p8 <= 1))) AND F ((p21 <= p8)))) AND F ((p21 <= p8)))) AND F ((2 <= p8))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((((p21 <= p8) OR (G ((X (G ((p8 <= 1))) AND F ((p21 <= p8)))) AND F ((p21 <= p8)))) AND F ((2 <= p8))))
lola: processed formula length: 106
lola: 88 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 9 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: 5 markings, 5 edges
lola: ========================================
lola: subprocess 1 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (X (G ((p8 <= p18))) OR F ((1 <= p16)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 1 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((1 <= p16))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:750
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: (p16 <= 0)
lola: processed formula length: 10
lola: 90 rewrites
lola: closed formula file LTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: state space / EG
lola: The predicate does not eventually occur.
lola: 11 markings, 11 edges
lola: ========================================
lola: subprocess 2 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (G ((p8 <= p18)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (G ((p8 <= p18)))
lola: processed formula length: 19
lola: 88 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: 4 markings, 4 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 2 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (G ((p0 + 1 <= p14)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (G ((p0 + 1 <= p14)))
lola: processed formula length: 23
lola: 88 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: 4 markings, 4 edges
lola: ========================================
lola: subprocess 3 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (X ((F ((2 <= p19)) OR (G ((p18 <= p2)) AND F ((2 <= p19))))) OR F (G ((F ((3 <= p6)) AND (2 <= p19)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 3 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G ((F ((3 <= p6)) AND (2 <= p19))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F (G ((F ((3 <= p6)) AND (2 <= p19))))
lola: processed formula length: 38
lola: 88 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 29
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: 83 markings, 84 edges
lola: ========================================
lola: subprocess 4 will run for 445 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((F ((2 <= p19)) OR (G ((p18 <= p2)) AND F ((2 <= p19)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((F ((2 <= p19)) OR (G ((p18 <= p2)) AND F ((2 <= p19)))))
lola: processed formula length: 60
lola: 88 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: 4 markings, 4 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 4 will run for 445 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((3 <= p21) U X (X (G ((F (G ((3 <= p21))) AND G ((X ((1 <= p0)) OR G ((3 <= p21)))))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: ((3 <= p21) U X (X (G ((F (G ((3 <= p21))) AND G ((X ((1 <= p0)) OR G ((3 <= p21)))))))))
lola: processed formula length: 89
lola: 88 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 76 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: 2344221 markings, 6708978 edges, 468844 markings/sec, 0 secs
lola: 4456674 markings, 12751861 edges, 422491 markings/sec, 5 secs
lola: 6458903 markings, 18582682 edges, 400446 markings/sec, 10 secs
lola: 8485166 markings, 24695807 edges, 405253 markings/sec, 15 secs
lola: 10663061 markings, 30739309 edges, 435579 markings/sec, 20 secs
lola: 12672498 markings, 36286293 edges, 401887 markings/sec, 25 secs
lola: 14666769 markings, 41757571 edges, 398854 markings/sec, 30 secs
lola: 16570633 markings, 47024297 edges, 380773 markings/sec, 35 secs
lola: 18573227 markings, 52651904 edges, 400519 markings/sec, 40 secs
lola: 20587383 markings, 58575592 edges, 402831 markings/sec, 45 secs
lola: 22525378 markings, 64104406 edges, 387599 markings/sec, 50 secs
lola: 24476763 markings, 69657388 edges, 390277 markings/sec, 55 secs
lola: 26404695 markings, 74980257 edges, 385586 markings/sec, 60 secs
lola: 28259740 markings, 80099999 edges, 371009 markings/sec, 65 secs
lola: 30194743 markings, 85445434 edges, 387001 markings/sec, 70 secs
lola: 32098861 markings, 90654046 edges, 380824 markings/sec, 75 secs
lola: 33981152 markings, 95877687 edges, 376458 markings/sec, 80 secs
lola: 35952918 markings, 101263742 edges, 394353 markings/sec, 85 secs
lola: 37812832 markings, 106395380 edges, 371983 markings/sec, 90 secs
lola: 39720616 markings, 111593859 edges, 381557 markings/sec, 95 secs
lola: 41580527 markings, 116737660 edges, 371982 markings/sec, 100 secs
lola: 43439111 markings, 121761904 edges, 371717 markings/sec, 105 secs
lola: 45268490 markings, 126834634 edges, 365876 markings/sec, 110 secs
lola: 47107676 markings, 131946387 edges, 367837 markings/sec, 115 secs
lola: 48944932 markings, 137000063 edges, 367451 markings/sec, 120 secs
lola: 50683707 markings, 141833057 edges, 347755 markings/sec, 125 secs
lola: 52491348 markings, 146797766 edges, 361528 markings/sec, 130 secs
lola: 54297962 markings, 151783099 edges, 361323 markings/sec, 135 secs
lola: 56039406 markings, 156616290 edges, 348289 markings/sec, 140 secs
lola: 57861354 markings, 161683592 edges, 364390 markings/sec, 145 secs
lola: 59900687 markings, 167047513 edges, 407867 markings/sec, 150 secs
lola: 61669589 markings, 171871218 edges, 353780 markings/sec, 155 secs
lola: 63455561 markings, 176851815 edges, 357194 markings/sec, 160 secs
lola: 65388468 markings, 182213904 edges, 386581 markings/sec, 165 secs
lola: 67255745 markings, 187318558 edges, 373455 markings/sec, 170 secs
lola: 68986460 markings, 192077758 edges, 346143 markings/sec, 175 secs
lola: 70635274 markings, 196673877 edges, 329763 markings/sec, 180 secs
lola: 72178530 markings, 200953404 edges, 308651 markings/sec, 185 secs
lola: 73740287 markings, 205283154 edges, 312351 markings/sec, 190 secs
lola: 75328748 markings, 209624403 edges, 317692 markings/sec, 195 secs
lola: 76314732 markings, 212340372 edges, 197197 markings/sec, 200 secs
lola: 77685097 markings, 216135312 edges, 274073 markings/sec, 205 secs
lola: 78977572 markings, 219698440 edges, 258495 markings/sec, 210 secs
lola: 80551663 markings, 223976913 edges, 314818 markings/sec, 215 secs
lola: 81564860 markings, 226745074 edges, 202639 markings/sec, 220 secs
lola: 82793447 markings, 230162071 edges, 245717 markings/sec, 225 secs
lola: 84222279 markings, 234055618 edges, 285766 markings/sec, 230 secs
lola: 85978384 markings, 238604355 edges, 351221 markings/sec, 235 secs
lola: 87218102 markings, 241765981 edges, 247944 markings/sec, 240 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 5 will run for 473 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (X ((X (X (X (F ((p19 <= p17))))) OR (p8 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (X ((X (X (X (F ((p19 <= p17))))) OR (p8 <= 0))))
lola: processed formula length: 51
lola: 88 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: 17 markings, 18 edges
lola: ========================================
lola: subprocess 6 will run for 552 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((X (F ((p4 + 1 <= p7))) OR (((p4 + 1 <= p7) R (p8 + 1 <= p19)) AND ((p7 <= p4) AND (F ((p8 + 1 <= p19)) OR G ((p7 <= p4)))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F ((X (F ((p4 + 1 <= p7))) OR (((p4 + 1 <= p7) R (p8 + 1 <= p19)) AND ((p7 <= p4) AND (F ((p8 + 1 <= p19)) OR G ((p7 <= p4)))))))
lola: processed formula length: 129
lola: 88 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 9 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: 4 markings, 4 edges
lola: ========================================
lola: subprocess 7 will run for 663 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (X ((p4 <= p0)) U (F ((X ((p4 <= p0)) AND (p4 <= p17))) AND (p4 <= p17)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: (X ((p4 <= p0)) U (F ((X ((p4 <= p0)) AND (p4 <= p17))) AND (p4 <= p17)))
lola: processed formula length: 73
lola: 88 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 9 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 3 markings, 2 edges
lola: ========================================
lola: subprocess 8 will run for 829 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((p21 <= p11))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:750
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: (p11 + 1 <= p21)
lola: processed formula length: 16
lola: 90 rewrites
lola: closed formula file LTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: state space / EG
lola: The predicate does not eventually occur.
lola: 4 markings, 4 edges
lola: ========================================
lola: subprocess 9 will run for 1105 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (F (((p16 <= 2) OR (p9 + 1 <= p8))))
lola: ========================================
lola: SUBTASK
lola: checking fairness
lola: fairness not yet implemented, converting to LTL...
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (F (((p16 <= 2) OR (p9 + 1 <= p8))))
lola: processed formula length: 39
lola: 88 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: 31 markings, 41 edges
lola: ========================================
lola: subprocess 10 will run for 1658 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((G (F ((p16 <= p3))) OR G ((1 <= p10))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F ((G (F ((p16 <= p3))) OR G ((1 <= p10))))
lola: processed formula length: 43
lola: 88 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: 473 markings, 891 edges
lola: ========================================
lola: subprocess 11 will run for 3316 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G ((((p13 <= p9) AND (p18 <= p3)) AND (G ((2 <= p16)) OR (3 <= p17)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F (G ((((p13 <= p9) AND (p18 <= p3)) AND (G ((2 <= p16)) OR (3 <= p17)))))
lola: processed formula length: 74
lola: 88 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 4 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: add low 29
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: 5 markings, 6 edges
lola: ========================================
lola: ========================================
lola: ...considering subproblem: ((3 <= p21) U X (X (G ((F (G ((3 <= p21))) AND G ((X ((1 <= p0)) OR G ((3 <= p21)))))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: ((3 <= p21) U X (X (G ((F (G ((3 <= p21))) AND G ((X ((1 <= p0)) OR G ((3 <= p21)))))))))
lola: processed formula length: 89
lola: 88 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 76 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: 2191717 markings, 6273050 edges, 438343 markings/sec, 0 secs
lola: 4285831 markings, 12229416 edges, 418823 markings/sec, 5 secs
lola: 6327309 markings, 18126912 edges, 408296 markings/sec, 10 secs
lola: 8331376 markings, 24276172 edges, 400813 markings/sec, 15 secs
lola: 10382451 markings, 29966442 edges, 410215 markings/sec, 20 secs
lola: 12282183 markings, 35211229 edges, 379946 markings/sec, 25 secs
lola: 14299570 markings, 40754871 edges, 403477 markings/sec, 30 secs
lola: 16278665 markings, 46195438 edges, 395819 markings/sec, 35 secs
lola: 18191696 markings, 51612099 edges, 382606 markings/sec, 40 secs
lola: 20156345 markings, 57221760 edges, 392930 markings/sec, 45 secs
lola: 22071918 markings, 62869454 edges, 383115 markings/sec, 50 secs
lola: 24061899 markings, 68498613 edges, 397996 markings/sec, 55 secs
lola: 25998051 markings, 73840628 edges, 387230 markings/sec, 60 secs
lola: 27893819 markings, 79094257 edges, 379154 markings/sec, 65 secs
lola: 29831640 markings, 84466989 edges, 387564 markings/sec, 70 secs
lola: 31661232 markings, 89469237 edges, 365918 markings/sec, 75 secs
lola: 33517792 markings, 94561326 edges, 371312 markings/sec, 80 secs
lola: 35444241 markings, 99889439 edges, 385290 markings/sec, 85 secs
lola: 37229505 markings, 104778428 edges, 357053 markings/sec, 90 secs
lola: 38997135 markings, 109619614 edges, 353526 markings/sec, 95 secs
lola: 40761711 markings, 114496802 edges, 352915 markings/sec, 100 secs
lola: 42548671 markings, 119366581 edges, 357392 markings/sec, 105 secs
lola: 44334322 markings, 124188940 edges, 357130 markings/sec, 110 secs
lola: 46046442 markings, 129018017 edges, 342424 markings/sec, 115 secs
lola: 47944563 markings, 134217822 edges, 379624 markings/sec, 120 secs
lola: 49728270 markings, 139197804 edges, 356741 markings/sec, 125 secs
lola: 51560434 markings, 144305418 edges, 366433 markings/sec, 130 secs
lola: 53448224 markings, 149465273 edges, 377558 markings/sec, 135 secs
lola: 55257232 markings, 154436877 edges, 361802 markings/sec, 140 secs
lola: 57044454 markings, 159411073 edges, 357444 markings/sec, 145 secs
lola: 59221875 markings, 165217141 edges, 435484 markings/sec, 150 secs
lola: 61114011 markings, 170342880 edges, 378427 markings/sec, 155 secs
lola: 62960083 markings, 175480856 edges, 369214 markings/sec, 160 secs
lola: 64893061 markings, 180855517 edges, 386596 markings/sec, 165 secs
lola: 66843212 markings, 186201141 edges, 390030 markings/sec, 170 secs
lola: 68661427 markings, 191177455 edges, 363643 markings/sec, 175 secs
lola: 70400612 markings, 196027899 edges, 347837 markings/sec, 180 secs
lola: 71747773 markings, 199723528 edges, 269432 markings/sec, 185 secs
lola: 73123336 markings, 203567279 edges, 275113 markings/sec, 190 secs
lola: 74403638 markings, 207112787 edges, 256060 markings/sec, 195 secs
lola: 75550625 markings, 210225254 edges, 229397 markings/sec, 200 secs
lola: 76695053 markings, 213415010 edges, 228886 markings/sec, 205 secs
lola: 78129347 markings, 217350751 edges, 286859 markings/sec, 210 secs
lola: 79425549 markings, 220932668 edges, 259240 markings/sec, 215 secs
lola: 80993658 markings, 225197496 edges, 313622 markings/sec, 220 secs
lola: 82160600 markings, 228397009 edges, 233388 markings/sec, 225 secs
lola: 83601902 markings, 232365664 edges, 288260 markings/sec, 230 secs
lola: 84737988 markings, 235467676 edges, 227217 markings/sec, 235 secs
lola: 85835664 markings, 238297383 edges, 219535 markings/sec, 240 secs
lola: 87031986 markings, 241278842 edges, 239264 markings/sec, 245 secs
lola: Child process aborted or communication problem between parent and child process
lola: RESULT
lola:
SUMMARY: no no no no no no no unknown no no no yes
lola:
preliminary result: no no no no no no no unknown no no no yes
lola: memory consumption: 3216 KB
lola: time consumption: 507 seconds
lola: print data as JSON (--json)
lola: writing JSON to LTLCardinality.json
lola: closed JSON file LTLCardinality.json
rslt: finished

--------------------
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="MAPK-PT-00040"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="itslola"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itslola"
echo " Input is MAPK-PT-00040, 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 r174-csrt-158987852600017"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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