fond
Model Checking Contest 2021
11th edition, Paris, France, June 23, 2021
Execution of r132-tall-162075428600373
Last Updated
Jun 28, 2021

About the Execution of 2020-gold for MAPK-PT-00640

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
16255.668 3600000.00 725279.00 96268.30 FFFFFFF?TTTTFFF? normal

Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2021-input.r132-tall-162075428600373.qcow2', fmt=qcow2 size=4294967296 backing_file='/data/fkordon/mcc2021-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
.......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool gold2020
Input is MAPK-PT-00640, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r132-tall-162075428600373
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 380K
-rw-r--r-- 1 mcc users 13K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 101K May 10 09:43 CTLCardinality.xml
-rw-r--r-- 1 mcc users 9.0K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 88K May 10 09:43 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.2K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K Mar 28 16:19 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Mar 28 16:19 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.8K Mar 28 16:20 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Mar 28 16:20 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.1K Mar 27 06:04 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 15K Mar 27 06:04 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Mar 25 07:15 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 25 07:15 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 22 09:15 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Mar 22 09:15 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 5 16:51 equiv_col
-rw-r--r-- 1 mcc users 6 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 25K May 5 16:51 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-00640-00
FORMULA_NAME MAPK-PT-00640-01
FORMULA_NAME MAPK-PT-00640-02
FORMULA_NAME MAPK-PT-00640-03
FORMULA_NAME MAPK-PT-00640-04
FORMULA_NAME MAPK-PT-00640-05
FORMULA_NAME MAPK-PT-00640-06
FORMULA_NAME MAPK-PT-00640-07
FORMULA_NAME MAPK-PT-00640-08
FORMULA_NAME MAPK-PT-00640-09
FORMULA_NAME MAPK-PT-00640-10
FORMULA_NAME MAPK-PT-00640-11
FORMULA_NAME MAPK-PT-00640-12
FORMULA_NAME MAPK-PT-00640-13
FORMULA_NAME MAPK-PT-00640-14
FORMULA_NAME MAPK-PT-00640-15

=== Now, execution of the tool begins

BK_START 1620935904110

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2021-05-13 19:58:25] [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]
[2021-05-13 19:58:25] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-13 19:58:25] [INFO ] Load time of PNML (sax parser for PT used): 40 ms
[2021-05-13 19:58:25] [INFO ] Transformed 22 places.
[2021-05-13 19:58:25] [INFO ] Transformed 30 transitions.
[2021-05-13 19:58:25] [INFO ] Parsed PT model containing 22 places and 30 transitions in 83 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 15 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100017 steps, including 0 resets, run finished after 64 ms. (steps per millisecond=1562 ) properties seen :[1, 1, 1, 1, 0, 1, 1, 0, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1]
// Phase 1: matrix 30 rows 22 cols
[2021-05-13 19:58:25] [INFO ] Computed 7 place invariants in 3 ms
[2021-05-13 19:58:25] [INFO ] [Real]Absence check using 7 positive place invariants in 8 ms returned unsat
[2021-05-13 19:58:25] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned unsat
[2021-05-13 19:58:25] [INFO ] [Real]Absence check using 7 positive place invariants in 5 ms returned sat
[2021-05-13 19:58:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 19:58:25] [INFO ] [Real]Absence check using state equation in 15 ms returned sat
[2021-05-13 19:58:25] [INFO ] Computed and/alt/rep : 29/74/29 causal constraints in 6 ms.
[2021-05-13 19:58:25] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 19:58:25] [INFO ] [Nat]Absence check using 7 positive place invariants in 5 ms returned sat
[2021-05-13 19:58:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 19:58:25] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2021-05-13 19:58:25] [INFO ] Computed and/alt/rep : 29/74/29 causal constraints in 3 ms.
[2021-05-13 19:58:26] [INFO ] Added : 25 causal constraints over 5 iterations in 37 ms. Result :sat
[2021-05-13 19:58:26] [INFO ] [Real]Absence check using 7 positive place invariants in 6 ms returned unsat
Successfully simplified 3 atomic propositions for a total of 3 simplifications.
[2021-05-13 19:58:26] [INFO ] Initial state reduction rules for CTL removed 4 formulas.
[2021-05-13 19:58:26] [INFO ] Flatten gal took : 24 ms
FORMULA MAPK-PT-00640-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MAPK-PT-00640-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MAPK-PT-00640-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MAPK-PT-00640-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-13 19:58:26] [INFO ] Flatten gal took : 6 ms
[2021-05-13 19:58:26] [INFO ] Export to MCC properties in file /home/mcc/execution/LTLCardinality.sr.xml took 3 ms.
[2021-05-13 19:58:26] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 1 ms.
info: Time: 3600 - MCC
vrfy: Checking LTLCardinality @ MAPK-PT-00640 @ 3570 seconds

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

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

FORMULA MAPK-PT-00640-08 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA MAPK-PT-00640-09 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA MAPK-PT-00640-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

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

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

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

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

FORMULA MAPK-PT-00640-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA MAPK-PT-00640-07 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA MAPK-PT-00640-15 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 2711
rslt: Output for LTLCardinality @ MAPK-PT-00640

{
"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": "Thu May 13 19:58:26 2021
",
"timelimit": 3570
},
"child":
[

{
"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": 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": "(3 <= p11)",
"processed_size": 10,
"rewrites": 48
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 0,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"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": "(p11 <= 2)",
"processed_size": 10,
"rewrites": 50
},
"result":
{
"edges": 1282,
"markings": 1282,
"produced_by": "state space / EG",
"value": false
},
"task":
{
"compoundnumber": 1,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 3
},
"threads": 1,
"type": "dfs"
},
"type": "eventual_occurrence"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 0,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 324
},
"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 ((p16 <= p15)))",
"processed_size": 20,
"rewrites": 48
},
"result":
{
"edges": 2086075,
"markings": 1158242,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"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"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 372
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"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": 2,
"visible_transitions": 0
},
"processed": "F ((F (G ((p14 <= p11))) OR X ((p14 <= p11))))",
"processed_size": 46,
"rewrites": 48
},
"result":
{
"edges": 1,
"markings": 2,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 3,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 479
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 1,
"X": 3,
"aconj": 0,
"adisj": 0,
"aneg": 2,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 5,
"taut": 0,
"tconj": 1,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "X (((2 <= p11) U (X ((p11 <= 1)) AND (F ((p16 <= p17)) OR X (G ((p11 <= 1)))))))",
"processed_size": 80,
"rewrites": 48
},
"result":
{
"edges": 7,
"markings": 8,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 11
},
"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": 626
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"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": "F (G ((p2 <= p18)))",
"processed_size": 19,
"rewrites": 48
},
"result":
{
"edges": 1284,
"markings": 1283,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 7,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "stabilization",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 783
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 2,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 1,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "G (F ((G (((p1 <= p5) AND (2 <= p1))) OR F ((p1 <= 1)))))",
"processed_size": 57,
"rewrites": 48
},
"result":
{
"edges": 9457,
"markings": 5930,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 4
},
"compoundnumber": 8,
"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": 1044
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 2,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "((2 <= p11) R ((p11 <= 1) OR (p14 + 1 <= p4)))",
"processed_size": 47,
"rewrites": 48
},
"result":
{
"edges": 2623522,
"markings": 1440963,
"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": "LTL",
"workflow": "product automaton"
}
},

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

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3132
},
"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": "(p18 <= 1)",
"processed_size": 10,
"rewrites": 50
},
"result":
{
"edges": 1282,
"markings": 1282,
"produced_by": "state space / EG",
"value": false
},
"task":
{
"compoundnumber": 11,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 3
},
"threads": 1,
"type": "dfs"
},
"type": "eventual_occurrence"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 10,
"type": "boolean"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3132
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "(1 <= p18)",
"processed_size": 10,
"rewrites": 48
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 11,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 1,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "F (((1 <= p18) OR (G ((3 <= p6)) AND F ((1 <= p18)))))",
"processed_size": 54,
"rewrites": 48
},
"result":
{
"edges": 1282,
"markings": 1282,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 4
},
"compoundnumber": 13,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 11,
"type": "boolean"
}
}
],
"exit":
{
"error": null,
"memory": 3420,
"runtime": 859.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "LTLCardinality.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "(** OR (G((X(F(**)) AND **)) AND F(**))) : F(G(**)) : X(G(**)) : (** OR (G(F(**)) AND F(**))) : (* R *) : X(((F(**) U X(G(*))) OR G(**))) : F((F(G(**)) OR X(**))) : X((F(**) OR (X(F(*)) OR **))) : X((** U (X(*) AND (F(**) OR X(G(*)))))) : (G(**) AND (F((** OR (G(**) AND F(**)))) OR **)) : G(F((G(**) OR F(*)))) : F(G((X((** U **)) AND ((** U **) OR G(**)))))"
},
"net":
{
"arcs": 90,
"conflict_clusters": 12,
"places": 22,
"places_significant": 15,
"singleton_clusters": 0,
"transitions": 30
},
"result":
{
"preliminary_value": "no no no no no unknown yes yes yes no no unknown ",
"value": "no no no no no unknown yes yes yes no no unknown "
},
"task":
{
"type": "compound"
}
}
lola: LoLA will run for 3570 seconds at most (--timelimit)
lola: NET
lola: input: PNML file (--pnml)
lola: reading net from model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file model.pnml
lola: 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: (G ((F (X (((p14 <= p8) AND (p11 <= 2)))) AND ((p9 <= p13) OR (2 <= p2)))) U (3 <= p11)) : F (G (X ((p2 <= p18)))) : G (X ((p16 <= p15))) : ((((p4 <= 0) OR (p18 <= 1)) U G (F ((2 <= p18)))) U (2 <= p18)) : NOT(((p11 <= 1) U ((2 <= p11) AND (p4 <= p14)))) : X (((F ((p12 + 1 <= p4)) U G (NOT(X ((2 <= p16))))) OR G ((p4 + 1 <= p9)))) : F ((G (X (G (F (G (X ((p14 <= p11))))))) OR X ((p14 <= p11)))) : X (((F ((p14 + 1 <= p0)) OR F (NOT(X ((p2 <= p1))))) OR (p2 <= p1))) : X (((2 <= p11) U NOT((G (NOT(((p11 + 1 <= p6) U (p16 <= p17)))) U X ((2 <= p11)))))) : (G ((p18 <= p16)) AND (F (((3 <= p6) U (G ((3 <= p6)) U (1 <= p18)))) OR (1 <= p18))) : G (F ((G (((p1 <= p5) AND (2 <= p1))) OR NOT(G ((2 <= p1)))))) : F (G (X ((X (((3 <= p7) U (p7 <= 2))) AND (((p0 <= p11) U (2 <= p11)) OR G ((2 <= p9)))))))
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:431
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:353
lola: rewrite Frontend/Parser/formula_rewrite.k:425
lola: rewrite Frontend/Parser/formula_rewrite.k:431
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: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: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:374
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:338
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:356
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:315
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:341
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:434
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:431
lola: rewrite Frontend/Parser/formula_rewrite.k:434
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:356
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((3 <= p11) OR (G ((X (F (((p14 <= p8) AND (p11 <= 2)))) AND ((p9 <= p13) OR (2 <= p2)))) AND F ((3 <= p11))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 0 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (3 <= p11)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (3 <= p11)
lola: processed formula length: 10
lola: 48 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: subprocess 1 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((3 <= 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 <= 2)
lola: processed formula length: 10
lola: 50 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: 1282 markings, 1282 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 1 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (G ((p16 <= p15)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (G ((p16 <= p15)))
lola: processed formula length: 20
lola: 48 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: 1158242 markings, 2086075 edges
lola: ========================================
lola: subprocess 2 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (((F ((p12 + 1 <= p4)) U X (G ((p16 <= 1)))) OR G ((p4 + 1 <= p9))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (((F ((p12 + 1 <= p4)) U X (G ((p16 <= 1)))) OR G ((p4 + 1 <= p9))))
lola: processed formula length: 70
lola: 48 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: 3463323 markings, 7791337 edges, 692665 markings/sec, 0 secs
lola: 6841740 markings, 16201964 edges, 675683 markings/sec, 5 secs
lola: 10161630 markings, 24474689 edges, 663978 markings/sec, 10 secs
lola: 13444879 markings, 32659504 edges, 656650 markings/sec, 15 secs
lola: 16703438 markings, 40784695 edges, 651712 markings/sec, 20 secs
lola: 19981293 markings, 48959622 edges, 655571 markings/sec, 25 secs
lola: 23217707 markings, 57031778 edges, 647283 markings/sec, 30 secs
lola: 26433340 markings, 65053512 edges, 643127 markings/sec, 35 secs
lola: 29644223 markings, 73064190 edges, 642177 markings/sec, 40 secs
lola: 32778499 markings, 80884062 edges, 626855 markings/sec, 45 secs
lola: 36020480 markings, 88972661 edges, 648396 markings/sec, 50 secs
lola: 39214992 markings, 96943665 edges, 638902 markings/sec, 55 secs
lola: 42404704 markings, 104903149 edges, 637942 markings/sec, 60 secs
lola: 45603158 markings, 112884796 edges, 639691 markings/sec, 65 secs
lola: 48819755 markings, 120911616 edges, 643319 markings/sec, 70 secs
lola: 51971917 markings, 128777286 edges, 630432 markings/sec, 75 secs
lola: 54928463 markings, 136156053 edges, 591309 markings/sec, 80 secs
lola: 57853403 markings, 143455168 edges, 584988 markings/sec, 85 secs
lola: 60767823 markings, 150727446 edges, 582884 markings/sec, 90 secs
lola: 63631190 markings, 157872348 edges, 572673 markings/sec, 95 secs
lola: 66520030 markings, 165080691 edges, 577768 markings/sec, 100 secs
lola: 69411000 markings, 172293845 edges, 578194 markings/sec, 105 secs
lola: 72184071 markings, 179212600 edges, 554614 markings/sec, 110 secs
lola: 75001688 markings, 186241604 edges, 563523 markings/sec, 115 secs
lola: 77849281 markings, 193346690 edges, 569519 markings/sec, 120 secs
lola: 79577362 markings, 197657916 edges, 345616 markings/sec, 125 secs
lola: 81754106 markings, 203087383 edges, 435349 markings/sec, 130 secs
lola: 83814525 markings, 208227070 edges, 412084 markings/sec, 135 secs
lola: 86377342 markings, 214614490 edges, 512563 markings/sec, 140 secs
lola: 88204135 markings, 219170100 edges, 365359 markings/sec, 145 secs
lola: 90107393 markings, 223914851 edges, 380652 markings/sec, 150 secs
lola: 91301652 markings, 226892178 edges, 238852 markings/sec, 155 secs
lola: 92590894 markings, 230105170 edges, 257848 markings/sec, 160 secs
lola: 93079428 markings, 231322856 edges, 97707 markings/sec, 165 secs
lola: 94220725 markings, 234166341 edges, 228259 markings/sec, 170 secs
lola: 95293173 markings, 236837396 edges, 214490 markings/sec, 175 secs
lola: 96611892 markings, 240122226 edges, 263744 markings/sec, 180 secs
lola: 97381223 markings, 242036840 edges, 153866 markings/sec, 185 secs
lola: 97530853 markings, 242409310 edges, 29926 markings/sec, 190 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 3 will run for 372 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((F (G ((p14 <= p11))) OR X ((p14 <= p11))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F ((F (G ((p14 <= p11))) OR X ((p14 <= p11))))
lola: processed formula length: 46
lola: 48 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 2 markings, 1 edges
lola: ========================================
lola: subprocess 4 will run for 419 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((F ((p14 + 1 <= p0)) OR (X (F ((p1 + 1 <= p2))) OR (p2 <= p1))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((F ((p14 + 1 <= p0)) OR (X (F ((p1 + 1 <= p2))) OR (p2 <= p1))))
lola: processed formula length: 67
lola: 48 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 5 markings, 4 edges
lola: ========================================
lola: subprocess 5 will run for 479 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (((2 <= p11) U (X ((p11 <= 1)) AND (F ((p16 <= p17)) OR X (G ((p11 <= 1)))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (((2 <= p11) U (X ((p11 <= 1)) AND (F ((p16 <= p17)) OR X (G ((p11 <= 1)))))))
lola: processed formula length: 80
lola: 48 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 11 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: 8 markings, 7 edges
lola: ========================================
lola: subprocess 6 will run for 558 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G ((X (((3 <= p7) U (p7 <= 2))) AND (((p0 <= p11) U (2 <= p11)) OR G ((2 <= p9))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F (G ((X (((3 <= p7) U (p7 <= 2))) AND (((p0 <= p11) U (2 <= p11)) OR G ((2 <= p9))))))
lola: processed formula length: 87
lola: 48 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 12 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: 3359622 markings, 7533379 edges, 671924 markings/sec, 0 secs
lola: 6639323 markings, 15697836 edges, 655940 markings/sec, 5 secs
lola: 9882808 markings, 23779601 edges, 648697 markings/sec, 10 secs
lola: 13101012 markings, 31801799 edges, 643641 markings/sec, 15 secs
lola: 16293998 markings, 39763874 edges, 638597 markings/sec, 20 secs
lola: 19483929 markings, 47718896 edges, 637986 markings/sec, 25 secs
lola: 22688516 markings, 55711718 edges, 640917 markings/sec, 30 secs
lola: 25842970 markings, 63580493 edges, 630891 markings/sec, 35 secs
lola: 29013740 markings, 71490813 edges, 634154 markings/sec, 40 secs
lola: 32155254 markings, 79328874 edges, 628303 markings/sec, 45 secs
lola: 35343859 markings, 87284207 edges, 637721 markings/sec, 50 secs
lola: 38503588 markings, 95168331 edges, 631946 markings/sec, 55 secs
lola: 41622371 markings, 102950386 edges, 623757 markings/sec, 60 secs
lola: 44811575 markings, 110909119 edges, 637841 markings/sec, 65 secs
lola: 47963627 markings, 118775399 edges, 630410 markings/sec, 70 secs
lola: 51126146 markings, 126666945 edges, 632504 markings/sec, 75 secs
lola: 54046794 markings, 133955998 edges, 584130 markings/sec, 80 secs
lola: 56926748 markings, 141142291 edges, 575991 markings/sec, 85 secs
lola: 59808304 markings, 148333219 edges, 576311 markings/sec, 90 secs
lola: 62629664 markings, 155372871 edges, 564272 markings/sec, 95 secs
lola: 65466890 markings, 162452695 edges, 567445 markings/sec, 100 secs
lola: 68351002 markings, 169648530 edges, 576822 markings/sec, 105 secs
lola: 71138762 markings, 176603726 edges, 557552 markings/sec, 110 secs
lola: 73931597 markings, 183571499 edges, 558567 markings/sec, 115 secs
lola: 76756516 markings, 190619288 edges, 564984 markings/sec, 120 secs
lola: 79395109 markings, 197201336 edges, 527719 markings/sec, 125 secs
lola: 81206194 markings, 201719062 edges, 362217 markings/sec, 130 secs
lola: 82049947 markings, 203822617 edges, 168751 markings/sec, 135 secs
lola: 83567960 markings, 207609021 edges, 303603 markings/sec, 140 secs
lola: 84674624 markings, 210368384 edges, 221333 markings/sec, 145 secs
lola: 86504952 markings, 214933195 edges, 366066 markings/sec, 150 secs
lola: 87973720 markings, 218594895 edges, 293754 markings/sec, 155 secs
lola: 89483412 markings, 222358832 edges, 301938 markings/sec, 160 secs
lola: 90885896 markings, 225855651 edges, 280497 markings/sec, 165 secs
lola: 92212672 markings, 229162722 edges, 265355 markings/sec, 170 secs
lola: 93631886 markings, 232698813 edges, 283843 markings/sec, 175 secs
lola: 94010648 markings, 233643218 edges, 75752 markings/sec, 180 secs
lola: 95151095 markings, 236483581 edges, 228089 markings/sec, 185 secs
lola: 96254032 markings, 239231196 edges, 220587 markings/sec, 190 secs
lola: 97051822 markings, 241216836 edges, 159558 markings/sec, 195 secs
lola: 97064368 markings, 241248259 edges, 2509 markings/sec, 200 secs
lola: 97067111 markings, 241255143 edges, 549 markings/sec, 205 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 7 will run for 626 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G ((p2 <= p18)))
lola: ========================================
lola: SUBTASK
lola: checking stabilization
lola: stabilization not yet implemented, converting to LTL...
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F (G ((p2 <= p18)))
lola: processed formula length: 19
lola: 48 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 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: 1283 markings, 1284 edges
lola: ========================================
lola: subprocess 8 will run for 783 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (F ((G (((p1 <= p5) AND (2 <= p1))) OR F ((p1 <= 1)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (F ((G (((p1 <= p5) AND (2 <= p1))) OR F ((p1 <= 1)))))
lola: processed formula length: 57
lola: 48 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 4 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 5930 markings, 9457 edges
lola: ========================================
lola: subprocess 9 will run for 1044 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((2 <= p11) R ((p11 <= 1) OR (p14 + 1 <= p4)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: ((2 <= p11) R ((p11 <= 1) OR (p14 + 1 <= p4)))
lola: processed formula length: 47
lola: 48 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: 1440963 markings, 2623522 edges
lola: ========================================
lola: subprocess 10 will run for 1566 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((2 <= p18) OR (G (F ((2 <= p18))) AND F ((2 <= p18))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 10 will run for 1566 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (2 <= p18)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (2 <= p18)
lola: processed formula length: 10
lola: 48 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: subprocess 11 will run for 3132 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((2 <= p18))
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: (p18 <= 1)
lola: processed formula length: 10
lola: 50 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: 1282 markings, 1282 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 11 will run for 3132 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (G ((p18 <= p16)) AND (F (((1 <= p18) OR (G ((3 <= p6)) AND F ((1 <= p18))))) OR (1 <= p18)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 11 will run for 3132 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (1 <= p18)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (1 <= p18)
lola: processed formula length: 10
lola: 48 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: Child process aborted or communication problem between parent and child process
lola: subprocess 13 will run for 1 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (((1 <= p18) OR (G ((3 <= p6)) AND F ((1 <= p18)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F (((1 <= p18) OR (G ((3 <= p6)) AND F ((1 <= p18)))))
lola: processed formula length: 54
lola: 48 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 4 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 1282 markings, 1282 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: ========================================
lola: ...considering subproblem: X (((F ((p12 + 1 <= p4)) U X (G ((p16 <= 1)))) OR G ((p4 + 1 <= p9))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (((F ((p12 + 1 <= p4)) U X (G ((p16 <= 1)))) OR G ((p4 + 1 <= p9))))
lola: processed formula length: 70
lola: 48 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: 3405093 markings, 7646752 edges, 681019 markings/sec, 0 secs
lola: 6758174 markings, 15994067 edges, 670616 markings/sec, 5 secs
lola: 10069291 markings, 24244187 edges, 662223 markings/sec, 10 secs
lola: 13349516 markings, 32421498 edges, 656045 markings/sec, 15 secs
lola: 16624281 markings, 40587321 edges, 654953 markings/sec, 20 secs
lola: 19896227 markings, 48747592 edges, 654389 markings/sec, 25 secs
lola: 23161531 markings, 56892080 edges, 653061 markings/sec, 30 secs
lola: 26393990 markings, 64954923 edges, 646492 markings/sec, 35 secs
lola: 29604634 markings, 72965052 edges, 642129 markings/sec, 40 secs
lola: 32804769 markings, 80949782 edges, 640027 markings/sec, 45 secs
lola: 36053425 markings, 89055067 edges, 649731 markings/sec, 50 secs
lola: 39244871 markings, 97018571 edges, 638289 markings/sec, 55 secs
lola: 42449550 markings, 105015283 edges, 640936 markings/sec, 60 secs
lola: 45667643 markings, 113045289 edges, 643619 markings/sec, 65 secs
lola: 48910138 markings, 121136685 edges, 648499 markings/sec, 70 secs
lola: 52053563 markings, 128981461 edges, 628685 markings/sec, 75 secs
lola: 55019066 markings, 136381674 edges, 593101 markings/sec, 80 secs
lola: 57909249 markings, 143593963 edges, 578037 markings/sec, 85 secs
lola: 60821991 markings, 150862852 edges, 582548 markings/sec, 90 secs
lola: 63671272 markings, 157972788 edges, 569856 markings/sec, 95 secs
lola: 66547500 markings, 165149425 edges, 575246 markings/sec, 100 secs
lola: 69408035 markings, 172286387 edges, 572107 markings/sec, 105 secs
lola: 72172185 markings, 179182918 edges, 552830 markings/sec, 110 secs
lola: 74984243 markings, 186197937 edges, 562412 markings/sec, 115 secs
lola: 77771783 markings, 193151582 edges, 557508 markings/sec, 120 secs
lola: 80157871 markings, 199104743 edges, 477218 markings/sec, 125 secs
lola: 80651861 markings, 200335920 edges, 98798 markings/sec, 130 secs
lola: 82660199 markings, 205345188 edges, 401668 markings/sec, 135 secs
lola: 83578881 markings, 207636417 edges, 183736 markings/sec, 140 secs
lola: 85262503 markings, 211835101 edges, 336724 markings/sec, 145 secs
lola: 86700189 markings, 215419442 edges, 287537 markings/sec, 150 secs
lola: 88542539 markings, 220013379 edges, 368470 markings/sec, 155 secs
lola: 89916382 markings, 223439058 edges, 274769 markings/sec, 160 secs
lola: 91305676 markings, 226901368 edges, 277859 markings/sec, 165 secs
lola: 92097625 markings, 228875317 edges, 158390 markings/sec, 170 secs
lola: 93148644 markings, 231494456 edges, 210204 markings/sec, 175 secs
lola: 93849449 markings, 233240740 edges, 140161 markings/sec, 180 secs
lola: 95296077 markings, 236844674 edges, 289326 markings/sec, 185 secs
lola: 96500906 markings, 239845395 edges, 240966 markings/sec, 190 secs
lola: 97593132 markings, 242564658 edges, 218445 markings/sec, 195 secs
lola: 98468495 markings, 244741475 edges, 175073 markings/sec, 200 secs
lola: Child process aborted or communication problem between parent and child process
lola: ========================================
lola: ...considering subproblem: F (G ((X (((3 <= p7) U (p7 <= 2))) AND (((p0 <= p11) U (2 <= p11)) OR G ((2 <= p9))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F (G ((X (((3 <= p7) U (p7 <= 2))) AND (((p0 <= p11) U (2 <= p11)) OR G ((2 <= p9))))))
lola: processed formula length: 87
lola: 48 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 12 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: 3320675 markings, 7437072 edges, 664135 markings/sec, 0 secs
lola: 6601779 markings, 15604518 edges, 656221 markings/sec, 5 secs
lola: 9821298 markings, 23626309 edges, 643904 markings/sec, 10 secs
lola: 13015390 markings, 31588954 edges, 638818 markings/sec, 15 secs
lola: 16188153 markings, 39499653 edges, 634553 markings/sec, 20 secs
lola: 19314983 markings, 47297646 edges, 625366 markings/sec, 25 secs
lola: 22501546 markings, 55245429 edges, 637313 markings/sec, 30 secs
lola: 25620030 markings, 63025242 edges, 623697 markings/sec, 35 secs
lola: 28768826 markings, 70879674 edges, 629759 markings/sec, 40 secs
lola: 31888060 markings, 78662122 edges, 623847 markings/sec, 45 secs
lola: 35046076 markings, 86541898 edges, 631603 markings/sec, 50 secs
lola: 38213923 markings, 94445433 edges, 633569 markings/sec, 55 secs
lola: 41341450 markings, 102249331 edges, 625505 markings/sec, 60 secs
lola: 44515238 markings, 110169500 edges, 634758 markings/sec, 65 secs
lola: 47656158 markings, 118007966 edges, 628184 markings/sec, 70 secs
lola: 50819501 markings, 125902113 edges, 632669 markings/sec, 75 secs
lola: 53743597 markings, 133199238 edges, 584819 markings/sec, 80 secs
lola: 56605594 markings, 140340680 edges, 572399 markings/sec, 85 secs
lola: 59453665 markings, 147447617 edges, 569614 markings/sec, 90 secs
lola: 62298867 markings, 154547984 edges, 569040 markings/sec, 95 secs
lola: 65130511 markings, 161613783 edges, 566329 markings/sec, 100 secs
lola: 67991952 markings, 168752852 edges, 572288 markings/sec, 105 secs
lola: 70752706 markings, 175641489 edges, 552151 markings/sec, 110 secs
lola: 73503193 markings, 182503026 edges, 550097 markings/sec, 115 secs
lola: 76308684 markings, 189502015 edges, 561098 markings/sec, 120 secs
lola: 79001088 markings, 196219008 edges, 538481 markings/sec, 125 secs
lola: 80014541 markings, 198745902 edges, 202691 markings/sec, 130 secs
lola: 81141311 markings, 201557841 edges, 225354 markings/sec, 135 secs
lola: 82305032 markings, 204459596 edges, 232744 markings/sec, 140 secs
lola: 83963193 markings, 208594121 edges, 331632 markings/sec, 145 secs
lola: 85770241 markings, 213101199 edges, 361410 markings/sec, 150 secs
lola: 86060497 markings, 213824580 edges, 58051 markings/sec, 155 secs
lola: 88632373 markings, 220237516 edges, 514375 markings/sec, 160 secs
lola: 89496489 markings, 222391531 edges, 172823 markings/sec, 165 secs
lola: 90858577 markings, 225787178 edges, 272418 markings/sec, 170 secs
lola: 91928896 markings, 228455074 edges, 214064 markings/sec, 175 secs
lola: 92598807 markings, 230124330 edges, 133982 markings/sec, 180 secs
lola: 93626056 markings, 232684247 edges, 205450 markings/sec, 185 secs
lola: 94224907 markings, 234176870 edges, 119770 markings/sec, 190 secs
lola: 95305063 markings, 236867161 edges, 216031 markings/sec, 195 secs
lola: 96254032 markings, 239231196 edges, 189794 markings/sec, 200 secs
lola: 97071987 markings, 241267335 edges, 163591 markings/sec, 205 secs
lola: Child process aborted or communication problem between parent and child process
lola: RESULT
lola:
SUMMARY: no no no no no unknown yes yes yes no no unknown
lola:
preliminary result: no no no no no unknown yes yes yes no no unknown
lola: memory consumption: 3420 KB
lola: time consumption: 859 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-00640"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="gold2020"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# 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 gold2020"
echo " Input is MAPK-PT-00640, 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 r132-tall-162075428600373"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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