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.r322-tall-162132127900145.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 TwoPhaseLocking-PT-nC00200vD, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r322-tall-162132127900145
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 376K
-rw-r--r-- 1 mcc users 16K May 15 08:57 CTLCardinality.txt
-rw-r--r-- 1 mcc users 140K May 15 08:57 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.3K May 15 08:57 CTLFireability.txt
-rw-r--r-- 1 mcc users 73K May 15 08:57 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K May 12 08:03 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 12 08:03 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 12 08:03 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K May 12 08:03 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 May 12 08:13 NewModel
-rw-r--r-- 1 mcc users 3.6K May 12 04:14 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 17K May 12 04:14 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.8K May 11 18:04 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 18K May 11 18:04 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 12 04:43 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K May 12 04:43 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 12 08:13 equiv_col
-rw-r--r-- 1 mcc users 10 May 12 08:13 instance
-rw-r--r-- 1 mcc users 6 May 12 08:13 iscolored
-rw-r--r-- 1 mcc users 4.6K May 12 08:13 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 TwoPhaseLocking-PT-nC00200vD-00
FORMULA_NAME TwoPhaseLocking-PT-nC00200vD-01
FORMULA_NAME TwoPhaseLocking-PT-nC00200vD-02
FORMULA_NAME TwoPhaseLocking-PT-nC00200vD-03
FORMULA_NAME TwoPhaseLocking-PT-nC00200vD-04
FORMULA_NAME TwoPhaseLocking-PT-nC00200vD-05
FORMULA_NAME TwoPhaseLocking-PT-nC00200vD-06
FORMULA_NAME TwoPhaseLocking-PT-nC00200vD-07
FORMULA_NAME TwoPhaseLocking-PT-nC00200vD-08
FORMULA_NAME TwoPhaseLocking-PT-nC00200vD-09
FORMULA_NAME TwoPhaseLocking-PT-nC00200vD-10
FORMULA_NAME TwoPhaseLocking-PT-nC00200vD-11
FORMULA_NAME TwoPhaseLocking-PT-nC00200vD-12
FORMULA_NAME TwoPhaseLocking-PT-nC00200vD-13
FORMULA_NAME TwoPhaseLocking-PT-nC00200vD-14
FORMULA_NAME TwoPhaseLocking-PT-nC00200vD-15

=== Now, execution of the tool begins

BK_START 1621447858987

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2021-05-19 18:11:00] [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-19 18:11:00] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-19 18:11:00] [INFO ] Load time of PNML (sax parser for PT used): 20 ms
[2021-05-19 18:11:00] [INFO ] Transformed 8 places.
[2021-05-19 18:11:00] [INFO ] Transformed 6 transitions.
[2021-05-19 18:11:00] [INFO ] Parsed PT model containing 8 places and 6 transitions in 57 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 18 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100078 steps, including 85 resets, run finished after 52 ms. (steps per millisecond=1924 ) properties seen :[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 0, 1, 1, 1]
// Phase 1: matrix 6 rows 8 cols
[2021-05-19 18:11:00] [INFO ] Computed 3 place invariants in 2 ms
[2021-05-19 18:11:01] [INFO ] [Real]Absence check using 3 positive place invariants in 8 ms returned unsat
[2021-05-19 18:11:01] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned unsat
Successfully simplified 2 atomic propositions for a total of 2 simplifications.
[2021-05-19 18:11:01] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
[2021-05-19 18:11:01] [INFO ] Flatten gal took : 22 ms
FORMULA TwoPhaseLocking-PT-nC00200vD-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA TwoPhaseLocking-PT-nC00200vD-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-19 18:11:01] [INFO ] Flatten gal took : 3 ms
[2021-05-19 18:11:01] [INFO ] Export to MCC properties in file /home/mcc/execution/LTLCardinality.sr.xml took 2 ms.
[2021-05-19 18:11:01] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 1 ms.
info: Time: 3600 - MCC
vrfy: Checking LTLCardinality @ TwoPhaseLocking-PT-nC00200vD @ 3570 seconds

FORMULA TwoPhaseLocking-PT-nC00200vD-00 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA TwoPhaseLocking-PT-nC00200vD-02 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA TwoPhaseLocking-PT-nC00200vD-05 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA TwoPhaseLocking-PT-nC00200vD-06 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA TwoPhaseLocking-PT-nC00200vD-08 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA TwoPhaseLocking-PT-nC00200vD-09 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA TwoPhaseLocking-PT-nC00200vD-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA TwoPhaseLocking-PT-nC00200vD-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA TwoPhaseLocking-PT-nC00200vD-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA TwoPhaseLocking-PT-nC00200vD-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA TwoPhaseLocking-PT-nC00200vD-03 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA TwoPhaseLocking-PT-nC00200vD-04 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA TwoPhaseLocking-PT-nC00200vD-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA TwoPhaseLocking-PT-nC00200vD-07 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 2762
rslt: Output for LTLCardinality @ TwoPhaseLocking-PT-nC00200vD

{
"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": "Wed May 19 18:11:02 2021
",
"timelimit": 3570
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 254
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 2,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 7,
"taut": 0,
"tconj": 2,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "G ((F ((p7 <= p3)) AND (X ((X ((1 <= p1)) AND (p7 <= p0))) OR (p7 <= p3))))",
"processed_size": 75,
"rewrites": 71
},
"result":
{
"edges": 712,
"markings": 711,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 6
},
"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": 274
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 274
},
"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": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "(p2 <= p0)",
"processed_size": 10,
"rewrites": 71
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 1,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 297
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"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": "G (F ((p1 + 1 <= p7)))",
"processed_size": 22,
"rewrites": 71
},
"result":
{
"edges": 254,
"markings": 254,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 2,
"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": 324
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 1,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "((p2 <= p0) U X (G ((3 <= p2))))",
"processed_size": 32,
"rewrites": 71
},
"result":
{
"edges": 403,
"markings": 403,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 5
},
"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"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 1,
"type": "boolean"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 297
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 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": "(p3 <= p4)",
"processed_size": 10,
"rewrites": 71
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 2,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 324
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 2,
"aconj": 0,
"adisj": 0,
"aneg": 4,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 6,
"taut": 0,
"tconj": 2,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "((X ((p1 <= 0)) AND (p7 <= 0)) R X (F ((G ((p7 + 1 <= p1)) AND (p7 + 1 <= p1)))))",
"processed_size": 81,
"rewrites": 71
},
"result":
{
"edges": 403,
"markings": 403,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 4
},
"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": 356
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 2,
"U": 1,
"X": 2,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 6,
"taut": 0,
"tconj": 2,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "F ((((p3 <= 0) U (p2 <= p5)) AND X (G ((X (G ((1 <= p3))) AND (p6 <= p2))))))",
"processed_size": 77,
"rewrites": 71
},
"result":
{
"edges": 403,
"markings": 403,
"produced_by": "LTL model checker",
"value": false
},
"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": 401
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 2,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 3,
"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 (((p0 <= p4) AND (G ((3 <= p3)) OR X (F ((p0 <= p4))))))",
"processed_size": 58,
"rewrites": 71
},
"result":
{
"edges": 403,
"markings": 403,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 6
},
"compoundnumber": 6,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

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

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

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 642
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"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": "F (G ((p4 <= 1)))",
"processed_size": 17,
"rewrites": 71
},
"result":
{
"edges": 17,
"markings": 14,
"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": "stabilization",
"workflow": "product automaton"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 802
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 3,
"aconj": 0,
"adisj": 1,
"aneg": 1,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "X ((X (X (G ((p0 + 1 <= p5)))) AND ((p0 + 1 <= p5))))",
"processed_size": 53,
"rewrites": 71
},
"result":
{
"edges": 404,
"markings": 404,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 6
},
"compoundnumber": 10,
"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": 1070
},
"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": "(p7 <= 0)",
"processed_size": 9,
"rewrites": 73
},
"result":
{
"edges": 400,
"markings": 401,
"produced_by": "state space / EG",
"value": false
},
"task":
{
"compoundnumber": 11,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 2
},
"threads": 1,
"type": "dfs"
},
"type": "eventual_occurrence"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1605
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 2,
"X": 0,
"aconj": 0,
"adisj": 1,
"aneg": 0,
"comp": 5,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 9,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 6,
"visible_transitions": 0
},
"processed": "(((((p3 <= p0) OR (p0 <= p7)) U (1 <= p1)) OR (p3 <= p0)) U (p5 + 1 <= p4))",
"processed_size": 76,
"rewrites": 71
},
"result":
{
"edges": 15554,
"markings": 10604,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 12,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3211
},
"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 <= p2)",
"processed_size": 9,
"rewrites": 71
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 13,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 1,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "G (((p2 <= 0) OR (3 <= p1)))",
"processed_size": 29,
"rewrites": 71
},
"result":
{
"edges": 1001,
"markings": 1001,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 15,
"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": 13,
"type": "boolean"
}
}
],
"exit":
{
"error": null,
"memory": 3188,
"runtime": 808.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "LTLCardinality.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "G((F(**) AND (X((X(**) AND **)) OR **))) : ((** U X(G(**))) OR (G(F(*)) AND **)) : F(*) : (((** U **) OR **) U **) : ((** U X(X(F(**)))) OR **) : ((X(*) AND *) R X(F((G(*) AND *)))) : G(F((F(**) OR (X(**) OR **)))) : F(((** U **) AND X(G((X(G(**)) AND **))))) : X((** AND (G(**) OR X(F(**))))) : X((G(F((G(*) OR (* AND *)))) OR **)) : (F(**) AND (G(**) OR **)) : (X((X(G(**)) U (X(**) OR **))) U (** OR (G(**) AND F(**)))) : (F(G(*)) OR X(G(**))) : X((X(X(G(*))) AND **))"
},
"net":
{
"arcs": 18,
"conflict_clusters": 5,
"places": 8,
"places_significant": 5,
"singleton_clusters": 0,
"transitions": 6
},
"result":
{
"preliminary_value": "no no no no yes no unknown no no yes no no no no ",
"value": "no no no no yes no unknown no no yes no no no no "
},
"task":
{
"type": "compound"
}
}
lola: LoLA will run for 3570 seconds at most (--timelimit)
lola: NET
lola: input: PNML file (--pnml)
lola: reading net from model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file model.pnml
lola: 14/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 256
lola: finding significant places
lola: 8 places, 6 transitions, 5 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 ((X ((X ((1 <= p1)) AND (p7 <= p0))) U (p7 <= p3))) : (((p2 <= p0) U G (X ((3 <= p2)))) OR (NOT(X (F (G ((p7 <= p1))))) AND (p2 <= p0))) : NOT(G ((p7 <= 0))) : (((((p3 <= p0) OR (p0 <= p7)) U (1 <= p1)) OR (p3 <= p0)) U (p5 + 1 <= p4)) : (((p7 <= p3) U F (X (X ((2 <= p3))))) OR (p3 <= p4)) : NOT(((X ((1 <= p1)) OR (1 <= p7)) U G ((F (X ((p1 <= p7))) OR X ((p1 <= p7)))))) : G (F (NOT(F (G (NOT(X (((F ((1 <= p4)) OR X ((1 <= p4))) OR (p3 <= p1))))))))) : F ((((p3 <= 0) U (p2 <= p5)) AND X (G ((X (G ((1 <= p3))) AND (p6 <= p2)))))) : (X ((p0 <= p4)) AND (X (G ((3 <= p3))) OR X (X (F ((p0 <= p4)))))) : X ((NOT(X (F (G (((2 <= p5) U (p3 + 1 <= p0)))))) OR (1 <= p1))) : (F ((3 <= p1)) AND (G (((p2 <= 0) OR (3 <= p1))) OR (1 <= p2))) : (X ((G (X ((p5 <= p0))) U (X ((p5 <= p0)) OR (p0 + 1 <= p5)))) U (G ((3 <= p0)) U (p3 <= p6))) : (NOT(G (F (F ((2 <= p4))))) OR X (G (((3 <= p2) OR (1 <= p3))))) : X ((X (NOT(F (X ((p5 <= p0))))) AND ((p0 + 1 <= p5))))
lola: rewrite Frontend/Parser/formula_rewrite.k:437
lola: rewrite Frontend/Parser/formula_rewrite.k:522
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:528
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:338
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:297
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
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: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:300
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:300
lola: rewrite Frontend/Parser/formula_rewrite.k:371
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:528
lola: rewrite Frontend/Parser/formula_rewrite.k:525
lola: rewrite Frontend/Parser/formula_rewrite.k:437
lola: rewrite Frontend/Parser/formula_rewrite.k:522
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:335
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 254 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G ((F ((p7 <= p3)) AND (X ((X ((1 <= p1)) AND (p7 <= p0))) OR (p7 <= p3))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((F ((p7 <= p3)) AND (X ((X ((1 <= p1)) AND (p7 <= p0))) OR (p7 <= p3))))
lola: processed formula length: 75
lola: 71 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: 711 markings, 712 edges
lola: ========================================
lola: subprocess 1 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (((p2 <= p0) U X (G ((3 <= p2)))) OR (G (F ((p1 + 1 <= p7))) AND (p2 <= p0)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 1 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (p2 <= p0)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p2 <= p0)
lola: processed formula length: 10
lola: 71 rewrites
lola: closed formula file LTLCardinality.xml
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 2 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (F ((p1 + 1 <= p7)))
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 ((p1 + 1 <= p7)))
lola: processed formula length: 22
lola: 71 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: 254 markings, 254 edges
lola: ========================================
lola: subprocess 3 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((p2 <= p0) U X (G ((3 <= p2))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: ((p2 <= p0) U X (G ((3 <= p2))))
lola: processed formula length: 32
lola: 71 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 5 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 403 markings, 403 edges
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: ========================================
lola: subprocess 2 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (((p7 <= p3) U X (X (F ((2 <= p3))))) OR (p3 <= p4))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 2 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (p3 <= p4)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p3 <= p4)
lola: processed formula length: 10
lola: 71 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 3 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((p7 <= p3) U X (X (F ((2 <= p3)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: ((p7 <= p3) U X (X (F ((2 <= p3)))))
lola: processed formula length: 36
lola: 71 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 5 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 4 markings, 3 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 3 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((X ((p1 <= 0)) AND (p7 <= 0)) R X (F ((G ((p7 + 1 <= p1)) AND (p7 + 1 <= p1)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: ((X ((p1 <= 0)) AND (p7 <= 0)) R X (F ((G ((p7 + 1 <= p1)) AND (p7 + 1 <= p1)))))
lola: processed formula length: 81
lola: 71 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: 403 markings, 403 edges
lola: ========================================
lola: subprocess 4 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (F ((F ((1 <= p4)) OR (X ((1 <= p4)) OR (p3 <= p1)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (F ((F ((1 <= p4)) OR (X ((1 <= p4)) OR (p3 <= p1)))))
lola: processed formula length: 56
lola: 71 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: 2955453 markings, 6857075 edges, 591091 markings/sec, 0 secs
lola: 5613665 markings, 13993882 edges, 531642 markings/sec, 5 secs
lola: 7519192 markings, 20083675 edges, 381105 markings/sec, 10 secs
lola: 9254751 markings, 25695172 edges, 347112 markings/sec, 15 secs
lola: 10926784 markings, 31126043 edges, 334407 markings/sec, 20 secs
lola: 12549668 markings, 36431637 edges, 324577 markings/sec, 25 secs
lola: 14138704 markings, 41630282 edges, 317807 markings/sec, 30 secs
lola: 15680528 markings, 46696777 edges, 308365 markings/sec, 35 secs
lola: 17232894 markings, 51798856 edges, 310473 markings/sec, 40 secs
lola: 18765866 markings, 56846214 edges, 306594 markings/sec, 45 secs
lola: 20281555 markings, 61845165 edges, 303138 markings/sec, 50 secs
lola: 21787245 markings, 66814810 edges, 301138 markings/sec, 55 secs
lola: 23269070 markings, 71719885 edges, 296365 markings/sec, 60 secs
lola: 24749851 markings, 76616029 edges, 296156 markings/sec, 65 secs
lola: 26217884 markings, 81473096 edges, 293607 markings/sec, 70 secs
lola: 27660085 markings, 86255842 edges, 288440 markings/sec, 75 secs
lola: 29081083 markings, 90970928 edges, 284200 markings/sec, 80 secs
lola: 30500254 markings, 95682686 edges, 283834 markings/sec, 85 secs
lola: 31928920 markings, 100425040 edges, 285733 markings/sec, 90 secs
lola: 33341251 markings, 105118514 edges, 282466 markings/sec, 95 secs
lola: 34753351 markings, 109817941 edges, 282420 markings/sec, 100 secs
lola: 36163917 markings, 114511722 edges, 282113 markings/sec, 105 secs
lola: 37564504 markings, 119175042 edges, 280117 markings/sec, 110 secs
lola: 38967995 markings, 123850096 edges, 280698 markings/sec, 115 secs
lola: 40360619 markings, 128495244 edges, 278525 markings/sec, 120 secs
lola: 41757935 markings, 133149079 edges, 279463 markings/sec, 125 secs
lola: 43143869 markings, 137776462 edges, 277187 markings/sec, 130 secs
lola: 44524106 markings, 142382005 edges, 276047 markings/sec, 135 secs
lola: 45895899 markings, 146965224 edges, 274359 markings/sec, 140 secs
lola: 47252741 markings, 151502275 edges, 271368 markings/sec, 145 secs
lola: 48601659 markings, 156017911 edges, 269784 markings/sec, 150 secs
lola: 49957083 markings, 160547775 edges, 271085 markings/sec, 155 secs
lola: 51298417 markings, 165038610 edges, 268267 markings/sec, 160 secs
lola: 52648688 markings, 169553828 edges, 270054 markings/sec, 165 secs
lola: 53985706 markings, 174031514 edges, 267404 markings/sec, 170 secs
lola: 55321623 markings, 178504020 edges, 267183 markings/sec, 175 secs
lola: 56651011 markings, 182964395 edges, 265878 markings/sec, 180 secs
lola: 57979518 markings, 187416643 edges, 265701 markings/sec, 185 secs
lola: 59301736 markings, 191857791 edges, 264444 markings/sec, 190 secs
lola: 60623941 markings, 196289736 edges, 264441 markings/sec, 195 secs
lola: 61939790 markings, 200710216 edges, 263170 markings/sec, 200 secs
lola: 63253547 markings, 205121720 edges, 262751 markings/sec, 205 secs
lola: 64556639 markings, 209498431 edges, 260618 markings/sec, 210 secs
lola: 65862244 markings, 213887113 edges, 261121 markings/sec, 215 secs
lola: 67166523 markings, 218267776 edges, 260856 markings/sec, 220 secs
lola: 68468077 markings, 222644797 edges, 260311 markings/sec, 225 secs
lola: 69754964 markings, 226979460 edges, 257377 markings/sec, 230 secs
lola: 71040023 markings, 231306757 edges, 257012 markings/sec, 235 secs
lola: 72326976 markings, 235635501 edges, 257391 markings/sec, 240 secs
lola: 73607193 markings, 239944066 edges, 256043 markings/sec, 245 secs
lola: 74890774 markings, 244266231 edges, 256716 markings/sec, 250 secs
lola: 76168534 markings, 248575275 edges, 255552 markings/sec, 255 secs
lola: 77459596 markings, 252922322 edges, 258212 markings/sec, 260 secs
lola: 78736896 markings, 257230234 edges, 255460 markings/sec, 265 secs
lola: 80020904 markings, 261556684 edges, 256802 markings/sec, 270 secs
lola: 81301138 markings, 265869527 edges, 256047 markings/sec, 275 secs
lola: 82574250 markings, 270169899 edges, 254622 markings/sec, 280 secs
lola: 83839686 markings, 274442576 edges, 253087 markings/sec, 285 secs
lola: 85103880 markings, 278711658 edges, 252839 markings/sec, 290 secs
lola: 86368155 markings, 282975975 edges, 252855 markings/sec, 295 secs
lola: 87625783 markings, 287223949 edges, 251526 markings/sec, 300 secs
lola: 88892779 markings, 291502688 edges, 253399 markings/sec, 305 secs
lola: 90153795 markings, 295764722 edges, 252203 markings/sec, 310 secs
lola: 91406554 markings, 300003204 edges, 250552 markings/sec, 315 secs
lola: 92667987 markings, 304264976 edges, 252287 markings/sec, 320 secs
lola: 93869746 markings, 308330530 edges, 240352 markings/sec, 325 secs
lola: 94821945 markings, 311551776 edges, 190440 markings/sec, 330 secs
lola: 95859775 markings, 315062275 edges, 207566 markings/sec, 335 secs
lola: 97077383 markings, 319177791 edges, 243522 markings/sec, 340 secs
lola: 97963849 markings, 322183054 edges, 177293 markings/sec, 345 secs
lola: 98982374 markings, 325626174 edges, 203705 markings/sec, 350 secs
lola: local time limit reached - aborting
lola:
preliminary result: no no unknown unknown yes no unknown unknown unknown unknown unknown unknown unknown unknown
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 5 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((((p3 <= 0) U (p2 <= p5)) AND X (G ((X (G ((1 <= p3))) AND (p6 <= p2))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F ((((p3 <= 0) U (p2 <= p5)) AND X (G ((X (G ((1 <= p3))) AND (p6 <= p2))))))
lola: processed formula length: 77
lola: 71 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: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 403 markings, 403 edges
lola: ========================================
lola: subprocess 6 will run for 401 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (((p0 <= p4) AND (G ((3 <= p3)) OR X (F ((p0 <= p4))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (((p0 <= p4) AND (G ((3 <= p3)) OR X (F ((p0 <= p4))))))
lola: processed formula length: 58
lola: 71 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: 403 markings, 403 edges
lola: subprocess 7 will run for 458 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ========================================
lola: ...considering subproblem: X ((G (F ((G ((p0 <= p3)) OR ((p5 <= 1) AND (p0 <= p3))))) OR (1 <= p1)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((G (F ((G ((p0 <= p3)) OR ((p5 <= 1) AND (p0 <= p3))))) OR (1 <= p1)))
lola: processed formula length: 73
lola: 71 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 5 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 2 markings, 1 edges
lola: ========================================
lola: subprocess 8 will run for 535 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (X ((X (G ((p5 <= p0))) U (X ((p5 <= p0)) OR (p0 + 1 <= p5)))) U ((p3 <= p6) OR (G ((3 <= p0)) AND F ((p3 <= p6)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: (X ((X (G ((p5 <= p0))) U (X ((p5 <= p0)) OR (p0 + 1 <= p5)))) U ((p3 <= p6) OR (G ((3 <= p0)) AND F ((p3 <= p6)))))
lola: processed formula length: 116
lola: 71 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 24 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: 502 markings, 502 edges
lola: ========================================
lola: subprocess 9 will run for 642 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (F (G ((p4 <= 1))) OR X (G (((3 <= p2) OR (1 <= p3)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 9 will run for 642 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G ((p4 <= 1)))
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 ((p4 <= 1)))
lola: processed formula length: 17
lola: 71 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 3
lola: add low 5
lola: add low 0
lola: add low 3
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: 14 markings, 17 edges
lola: ========================================
lola: subprocess 10 will run for 802 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (G (((3 <= p2) OR (1 <= p3))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (G (((3 <= p2) OR (1 <= p3))))
lola: processed formula length: 33
lola: 71 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: 403 markings, 403 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 10 will run for 802 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((X (X (G ((p0 + 1 <= p5)))) AND ((p0 + 1 <= p5))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((X (X (G ((p0 + 1 <= p5)))) AND ((p0 + 1 <= p5))))
lola: processed formula length: 53
lola: 71 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: 404 markings, 404 edges
lola: ========================================
lola: subprocess 11 will run for 1070 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((1 <= p7))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:750
lola: rewrite Frontend/Parser/formula_rewrite.k:788
lola: processed formula: (p7 <= 0)
lola: processed formula length: 9
lola: 73 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: 401 markings, 400 edges
lola: ========================================
lola: subprocess 12 will run for 1605 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (((((p3 <= p0) OR (p0 <= p7)) U (1 <= p1)) OR (p3 <= p0)) U (p5 + 1 <= p4))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: (((((p3 <= p0) OR (p0 <= p7)) U (1 <= p1)) OR (p3 <= p0)) U (p5 + 1 <= p4))
lola: processed formula length: 76
lola: 71 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: 10604 markings, 15554 edges
lola: ========================================
lola: subprocess 13 will run for 3211 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (F ((3 <= p1)) AND (G (((p2 <= 0) OR (3 <= p1))) OR (1 <= p2)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 13 will run for 3211 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (1 <= p2)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (1 <= p2)
lola: processed formula length: 9
lola: 71 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 15 will run for 1 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (((p2 <= 0) OR (3 <= p1)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (((p2 <= 0) OR (3 <= p1)))
lola: processed formula length: 29
lola: 71 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: 1001 markings, 1001 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: ========================================
lola: ...considering subproblem: G (F ((F ((1 <= p4)) OR (X ((1 <= p4)) OR (p3 <= p1)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (F ((F ((1 <= p4)) OR (X ((1 <= p4)) OR (p3 <= p1)))))
lola: processed formula length: 56
lola: 71 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: 2990250 markings, 6934877 edges, 598050 markings/sec, 0 secs
lola: 5639056 markings, 14073699 edges, 529761 markings/sec, 5 secs
lola: 7531045 markings, 20121609 edges, 378398 markings/sec, 10 secs
lola: 9269063 markings, 25742462 edges, 347604 markings/sec, 15 secs
lola: 10948327 markings, 31196238 edges, 335853 markings/sec, 20 secs
lola: 12570688 markings, 36500225 edges, 324472 markings/sec, 25 secs
lola: 14154289 markings, 41681834 edges, 316720 markings/sec, 30 secs
lola: 15720850 markings, 46829657 edges, 313312 markings/sec, 35 secs
lola: 17276171 markings, 51940087 edges, 311064 markings/sec, 40 secs
lola: 18809742 markings, 56990761 edges, 306714 markings/sec, 45 secs
lola: 20320794 markings, 61974755 edges, 302210 markings/sec, 50 secs
lola: 21824361 markings, 66937657 edges, 300713 markings/sec, 55 secs
lola: 23300678 markings, 71824540 edges, 295263 markings/sec, 60 secs
lola: 24777830 markings, 76709056 edges, 295430 markings/sec, 65 secs
lola: 26256061 markings, 81598505 edges, 295646 markings/sec, 70 secs
lola: 27709010 markings, 86418554 edges, 290590 markings/sec, 75 secs
lola: 29165240 markings, 91249731 edges, 291246 markings/sec, 80 secs
lola: 30609144 markings, 96044905 edges, 288781 markings/sec, 85 secs
lola: 32033292 markings, 100770523 edges, 284830 markings/sec, 90 secs
lola: 33462279 markings, 105522235 edges, 285797 markings/sec, 95 secs
lola: 34883101 markings, 110249918 edges, 284164 markings/sec, 100 secs
lola: 36280333 markings, 114900289 edges, 279446 markings/sec, 105 secs
lola: 37701777 markings, 119632699 edges, 284289 markings/sec, 110 secs
lola: 39114560 markings, 124339135 edges, 282557 markings/sec, 115 secs
lola: 40521153 markings, 129027791 edges, 281319 markings/sec, 120 secs
lola: 41918769 markings, 133683911 edges, 279523 markings/sec, 125 secs
lola: 43291541 markings, 138271106 edges, 274554 markings/sec, 130 secs
lola: 44672658 markings, 142879322 edges, 276223 markings/sec, 135 secs
lola: 46046015 markings, 147467830 edges, 274671 markings/sec, 140 secs
lola: 47419174 markings, 152057816 edges, 274632 markings/sec, 145 secs
lola: 48777952 markings, 156608716 edges, 271756 markings/sec, 150 secs
lola: 50143278 markings, 161170973 edges, 273065 markings/sec, 155 secs
lola: 51489747 markings, 165677382 edges, 269294 markings/sec, 160 secs
lola: 52850975 markings, 170229761 edges, 272246 markings/sec, 165 secs
lola: 54201313 markings, 174752018 edges, 270068 markings/sec, 170 secs
lola: 55558297 markings, 179297469 edges, 271397 markings/sec, 175 secs
lola: 56911862 markings, 183837264 edges, 270713 markings/sec, 180 secs
lola: 58255765 markings, 188345357 edges, 268781 markings/sec, 185 secs
lola: 59605469 markings, 192873003 edges, 269941 markings/sec, 190 secs
lola: 60941810 markings, 197356805 edges, 267268 markings/sec, 195 secs
lola: 62279750 markings, 201847813 edges, 267588 markings/sec, 200 secs
lola: 63605007 markings, 206301685 edges, 265051 markings/sec, 205 secs
lola: 64929607 markings, 210752343 edges, 264920 markings/sec, 210 secs
lola: 66261272 markings, 215227342 edges, 266333 markings/sec, 215 secs
lola: 67596440 markings, 219713898 edges, 267034 markings/sec, 220 secs
lola: 68925465 markings, 224185407 edges, 265805 markings/sec, 225 secs
lola: 70245030 markings, 228628209 edges, 263913 markings/sec, 230 secs
lola: 71555376 markings, 233040404 edges, 262069 markings/sec, 235 secs
lola: 72862679 markings, 237439213 edges, 261461 markings/sec, 240 secs
lola: 74166471 markings, 241831681 edges, 260758 markings/sec, 245 secs
lola: 75473082 markings, 246231620 edges, 261322 markings/sec, 250 secs
lola: 76775631 markings, 250619999 edges, 260510 markings/sec, 255 secs
lola: 78071908 markings, 254986888 edges, 259255 markings/sec, 260 secs
lola: 79366775 markings, 259352737 edges, 258973 markings/sec, 265 secs
lola: 80665174 markings, 263726618 edges, 259680 markings/sec, 270 secs
lola: 81962648 markings, 268101634 edges, 259495 markings/sec, 275 secs
lola: 83242728 markings, 272424801 edges, 256016 markings/sec, 280 secs
lola: 84515757 markings, 276724626 edges, 254606 markings/sec, 285 secs
lola: 85797789 markings, 281050780 edges, 256406 markings/sec, 290 secs
lola: 87075754 markings, 285365684 edges, 255593 markings/sec, 295 secs
lola: 88354817 markings, 289683409 edges, 255813 markings/sec, 300 secs
lola: 89632010 markings, 293999299 edges, 255439 markings/sec, 305 secs
lola: 90900151 markings, 298288590 edges, 253628 markings/sec, 310 secs
lola: 92164506 markings, 302562996 edges, 252871 markings/sec, 315 secs
lola: 93372860 markings, 306647938 edges, 241671 markings/sec, 320 secs
lola: 94202457 markings, 309458252 edges, 165919 markings/sec, 325 secs
lola: 94750616 markings, 311310305 edges, 109632 markings/sec, 330 secs
lola: 95658574 markings, 314384844 edges, 181592 markings/sec, 335 secs
lola: 96653599 markings, 317747263 edges, 199005 markings/sec, 340 secs
lola: 97526747 markings, 320700771 edges, 174630 markings/sec, 345 secs
lola: 98530038 markings, 324093741 edges, 200658 markings/sec, 350 secs
lola: 99373333 markings, 326953757 edges, 168659 markings/sec, 355 secs
lola: 100361147 markings, 330296510 edges, 197563 markings/sec, 360 secs
lola: 101378022 markings, 333741383 edges, 203375 markings/sec, 365 secs
lola: 102352079 markings, 337044653 edges, 194811 markings/sec, 370 secs
lola: 103366244 markings, 340475541 edges, 202833 markings/sec, 375 secs
lola: 104338468 markings, 343773233 edges, 194445 markings/sec, 380 secs
lola: 105500636 markings, 347714412 edges, 232434 markings/sec, 385 secs
lola: 106454948 markings, 350949011 edges, 190862 markings/sec, 390 secs
lola: 107567952 markings, 354726784 edges, 222601 markings/sec, 395 secs
lola: 108373990 markings, 357457235 edges, 161208 markings/sec, 400 secs
lola: 109421170 markings, 361006768 edges, 209436 markings/sec, 405 secs
lola: 110349851 markings, 364158271 edges, 185736 markings/sec, 410 secs
lola: 111171596 markings, 366945869 edges, 164349 markings/sec, 415 secs
lola: 112292885 markings, 370747230 edges, 224258 markings/sec, 420 secs
lola: 113229524 markings, 373922124 edges, 187328 markings/sec, 425 secs
lola: 114195256 markings, 377199338 edges, 193146 markings/sec, 430 secs
lola: 115268675 markings, 380842901 edges, 214684 markings/sec, 435 secs
lola: 116190263 markings, 383975149 edges, 184318 markings/sec, 440 secs
lola: Child process aborted or communication problem between parent and child process
lola: RESULT
lola:
SUMMARY: no no no no yes no unknown no no yes no no no no
lola:
preliminary result: no no no no yes no unknown no no yes no no no no
lola: memory consumption: 3188 KB
lola: time consumption: 808 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="TwoPhaseLocking-PT-nC00200vD"
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 TwoPhaseLocking-PT-nC00200vD, 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 r322-tall-162132127900145"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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