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

About the Execution of 2020-gold for TwoPhaseLocking-PT-nC00500vD

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
16255.663 3600000.00 906795.00 35024.60 FTFFTFFFF?FFFFFF 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.r322-tall-162132127900153.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-nC00500vD, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r322-tall-162132127900153
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 336K
-rw-r--r-- 1 mcc users 12K May 15 08:57 CTLCardinality.txt
-rw-r--r-- 1 mcc users 99K May 15 08:57 CTLCardinality.xml
-rw-r--r-- 1 mcc users 9.1K May 15 08:57 CTLFireability.txt
-rw-r--r-- 1 mcc users 76K May 15 08:57 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K May 12 08:03 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 12 08:03 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 12 08:03 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K 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.7K May 12 04:14 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 19K 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 17K 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-nC00500vD-00
FORMULA_NAME TwoPhaseLocking-PT-nC00500vD-01
FORMULA_NAME TwoPhaseLocking-PT-nC00500vD-02
FORMULA_NAME TwoPhaseLocking-PT-nC00500vD-03
FORMULA_NAME TwoPhaseLocking-PT-nC00500vD-04
FORMULA_NAME TwoPhaseLocking-PT-nC00500vD-05
FORMULA_NAME TwoPhaseLocking-PT-nC00500vD-06
FORMULA_NAME TwoPhaseLocking-PT-nC00500vD-07
FORMULA_NAME TwoPhaseLocking-PT-nC00500vD-08
FORMULA_NAME TwoPhaseLocking-PT-nC00500vD-09
FORMULA_NAME TwoPhaseLocking-PT-nC00500vD-10
FORMULA_NAME TwoPhaseLocking-PT-nC00500vD-11
FORMULA_NAME TwoPhaseLocking-PT-nC00500vD-12
FORMULA_NAME TwoPhaseLocking-PT-nC00500vD-13
FORMULA_NAME TwoPhaseLocking-PT-nC00500vD-14
FORMULA_NAME TwoPhaseLocking-PT-nC00500vD-15

=== Now, execution of the tool begins

BK_START 1621447945987

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

FORMULA TwoPhaseLocking-PT-nC00500vD-01 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

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

FORMULA TwoPhaseLocking-PT-nC00500vD-04 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA TwoPhaseLocking-PT-nC00500vD-05 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA TwoPhaseLocking-PT-nC00500vD-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

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

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

FORMULA TwoPhaseLocking-PT-nC00500vD-07 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

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

FORMULA TwoPhaseLocking-PT-nC00500vD-09 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA TwoPhaseLocking-PT-nC00500vD-00 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 2637
rslt: Output for LTLCardinality @ TwoPhaseLocking-PT-nC00500vD

{
"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:12:28 2021
",
"timelimit": 3570
},
"child":
[

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 445
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 2,
"X": 2,
"aconj": 1,
"adisj": 0,
"aneg": 1,
"comp": 5,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 7,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "((((p3 <= 1) U X (((p0 + 1 <= p7) OR (p3 <= 1)))) AND (2 <= p3)) U X ((p0 <= p2)))",
"processed_size": 83,
"rewrites": 49
},
"result":
{
"edges": 1003,
"markings": 1003,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 8
},
"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": 516
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 3,
"U": 0,
"X": 2,
"aconj": 0,
"adisj": 0,
"aneg": 3,
"comp": 5,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 5,
"taut": 0,
"tconj": 2,
"tdisj": 2,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "G ((G (F ((G ((p5 <= 1)) OR ((p7 <= 1) AND (p5 <= 1))))) OR (X (X ((1 <= p1))) AND (2 <= p7))))",
"processed_size": 95,
"rewrites": 49
},
"result":
{
"edges": 1003,
"markings": 1003,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 10
},
"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": 619
},
"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 ((p6 <= p4)))",
"processed_size": 18,
"rewrites": 49
},
"result":
{
"edges": 4738,
"markings": 3989,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 6,
"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": 774
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 2,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "G ((F (G ((2 <= p7))) OR (2 <= p7)))",
"processed_size": 36,
"rewrites": 49
},
"result":
{
"edges": 2985,
"markings": 2490,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 4
},
"compoundnumber": 7,
"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": 1032
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1032
},
"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": 49
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 8,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1548
},
"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": "G (F ((p5 <= 0)))",
"processed_size": 17,
"rewrites": 49
},
"result":
{
"edges": 7,
"markings": 7,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 9,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "fairness",
"workflow": "product automaton"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 8,
"type": "boolean"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1548
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"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": "G ((1 <= p2))",
"processed_size": 13,
"rewrites": 49
},
"result":
{
"edges": 1001,
"markings": 1001,
"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": 3095
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "(p7 + 1 <= p5)",
"processed_size": 14,
"rewrites": 51
},
"result":
{
"edges": 1002,
"markings": 1002,
"produced_by": "state space / EG",
"value": false
},
"task":
{
"compoundnumber": 10,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 4
},
"threads": 1,
"type": "dfs"
},
"type": "eventual_occurrence"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 9,
"type": "boolean"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3095
},
"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": "(p1 <= p7)",
"processed_size": 10,
"rewrites": 49
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 10,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": null
},
"task":
{
"compoundnumber": 10,
"type": "boolean"
}
},

{
"child":
[

{
"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": "(p1 <= p7)",
"processed_size": 10,
"rewrites": 49
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 12,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 1,
"U": 1,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 7,
"taut": 0,
"tconj": 1,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "(((p1 <= p7) OR (G (F ((p3 + 1 <= p7))) AND F ((p1 <= p7)))) U (2 <= p1))",
"processed_size": 73,
"rewrites": 49
},
"result":
{
"edges": 503,
"markings": 503,
"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"
}
}
],
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 12,
"type": "boolean"
}
}
],
"exit":
{
"error": null,
"memory": 3492,
"runtime": 933.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "LTLCardinality.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "(((** OR (G(F(*)) AND F(**))) U **) AND **) : X(*) : X((F(**) OR (** OR **))) : F((X(F(**)) OR F(**))) : (((** U X(*)) AND **) U X(**)) : G((F(G(**)) OR **)) : (G(F(*)) AND **) : F(G(**)) : X((X(F(**)) AND (F(**) OR G(**)))) : G((G(F((G(*) OR (* AND *)))) OR (X(X(**)) AND **))) : (G(*) OR F(**))"
},
"net":
{
"arcs": 18,
"conflict_clusters": 5,
"places": 8,
"places_significant": 5,
"singleton_clusters": 0,
"transitions": 6
},
"result":
{
"preliminary_value": "no yes no yes no no no no unknown no no ",
"value": "no yes no yes no no no no unknown 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: (((NOT(G (NOT(G (NOT(G ((p7 <= p3))))))) U (p1 <= p7)) U (2 <= p1)) AND (p1 <= p7)) : NOT(X (((1 <= 0) U (p1 <= 0)))) : (X ((F ((p0 + 1 <= p3)) OR (1 <= p7))) OR X ((p1 <= 0))) : F ((F (((((1 <= p1) U (p5 + 1 <= p4)) AND X ((2 <= p6))) U X ((p0 <= p7)))) OR F ((1 <= p1)))) : ((((p3 <= 1) U NOT(X (((p7 <= p0) AND (2 <= p3))))) AND (2 <= p3)) U X ((p0 <= p2))) : G ((F (X (G ((2 <= p7)))) OR (2 <= p7))) : (G (((p1 <= p6) U F (NOT(G ((1 <= p5)))))) AND (p2 <= p0)) : G (((G (X (NOT(G (F (G ((p2 <= p5))))))) AND (p4 + 1 <= p2)) U F (G ((p6 <= p4))))) : X ((X (((0 <= 0) U (1 <= p2))) AND (F ((1 <= p2)) OR G ((3 <= p3))))) : G ((NOT(F (G (((2 <= p7) U (2 <= p5))))) OR (X (X ((1 <= p1))) AND (2 <= p7)))) : (NOT(F ((p2 <= 0))) OR ((1 <= p2) U F ((p5 <= p7))))
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:332
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:374
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:431
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:185
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:528
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:434
lola: rewrite Frontend/Parser/formula_rewrite.k:356
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:380
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:422
lola: rewrite Frontend/Parser/formula_rewrite.k:374
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:377
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:422
lola: rewrite Frontend/Parser/formula_rewrite.k:374
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:169
lola: rewrite Frontend/Parser/formula_rewrite.k:437
lola: rewrite Frontend/Parser/formula_rewrite.k:522
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:422
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((1 <= p1))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((1 <= p1))
lola: processed formula length: 13
lola: 49 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 1 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((F ((p0 + 1 <= p3)) OR ((1 <= p7) OR (p1 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((F ((p0 + 1 <= p3)) OR ((1 <= p7) OR (p1 <= 0))))
lola: processed formula length: 52
lola: 49 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: 1004 markings, 1004 edges
lola: ========================================
lola: subprocess 2 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((X (F ((p0 <= p7))) OR F ((1 <= p1))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F ((X (F ((p0 <= p7))) OR F ((1 <= p1))))
lola: processed formula length: 41
lola: 49 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: 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 3 will run for 445 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((((p3 <= 1) U X (((p0 + 1 <= p7) OR (p3 <= 1)))) AND (2 <= p3)) U X ((p0 <= p2)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: ((((p3 <= 1) U X (((p0 + 1 <= p7) OR (p3 <= 1)))) AND (2 <= p3)) U X ((p0 <= p2)))
lola: processed formula length: 83
lola: 49 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 8 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 1003 markings, 1003 edges
lola: ========================================
lola: subprocess 4 will run for 509 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((X (F ((1 <= p2))) AND (F ((1 <= p2)) OR G ((3 <= p3)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((X (F ((1 <= p2))) AND (F ((1 <= p2)) OR G ((3 <= p3)))))
lola: processed formula length: 60
lola: 49 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: 2687827 markings, 6438300 edges, 537565 markings/sec, 0 secs
lola: 4839567 markings, 11661123 edges, 430348 markings/sec, 5 secs
lola: 6895507 markings, 16667887 edges, 411188 markings/sec, 10 secs
lola: 9010481 markings, 21825896 edges, 422995 markings/sec, 15 secs
lola: 11096870 markings, 26925668 edges, 417278 markings/sec, 20 secs
lola: 13196005 markings, 32058165 edges, 419827 markings/sec, 25 secs
lola: 15252927 markings, 37094308 edges, 411384 markings/sec, 30 secs
lola: 17317636 markings, 42150240 edges, 412942 markings/sec, 35 secs
lola: 19329871 markings, 47085040 edges, 402447 markings/sec, 40 secs
lola: 21358258 markings, 52057785 edges, 405677 markings/sec, 45 secs
lola: 23361883 markings, 56975197 edges, 400725 markings/sec, 50 secs
lola: 25363473 markings, 61884986 edges, 400318 markings/sec, 55 secs
lola: 27317200 markings, 66682463 edges, 390745 markings/sec, 60 secs
lola: 29296072 markings, 71541207 edges, 395774 markings/sec, 65 secs
lola: 31234300 markings, 76304647 edges, 387646 markings/sec, 70 secs
lola: 33163627 markings, 81046798 edges, 385865 markings/sec, 75 secs
lola: 35079834 markings, 85756751 edges, 383241 markings/sec, 80 secs
lola: 36993805 markings, 90461898 edges, 382794 markings/sec, 85 secs
lola: 38901185 markings, 95150968 edges, 381476 markings/sec, 90 secs
lola: 40797438 markings, 99814263 edges, 379251 markings/sec, 95 secs
lola: 42647923 markings, 104371936 edges, 370097 markings/sec, 100 secs
lola: 44555264 markings, 109060911 edges, 381468 markings/sec, 105 secs
lola: 46415470 markings, 113638203 edges, 372041 markings/sec, 110 secs
lola: 48281860 markings, 118233320 edges, 373278 markings/sec, 115 secs
lola: 50135219 markings, 122794603 edges, 370672 markings/sec, 120 secs
lola: 52001378 markings, 127389582 edges, 373232 markings/sec, 125 secs
lola: 53809383 markings, 131845999 edges, 361601 markings/sec, 130 secs
lola: 55693050 markings, 136478773 edges, 376733 markings/sec, 135 secs
lola: 57517046 markings, 140973404 edges, 364799 markings/sec, 140 secs
lola: 59312269 markings, 145399021 edges, 359045 markings/sec, 145 secs
lola: 61139338 markings, 149896722 edges, 365414 markings/sec, 150 secs
lola: 62982276 markings, 154435233 edges, 368588 markings/sec, 155 secs
lola: 64786737 markings, 158882754 edges, 360892 markings/sec, 160 secs
lola: 66580389 markings, 163304519 edges, 358730 markings/sec, 165 secs
lola: 68360113 markings, 167692506 edges, 355945 markings/sec, 170 secs
lola: 70144009 markings, 172091145 edges, 356779 markings/sec, 175 secs
lola: 71923475 markings, 176478524 edges, 355893 markings/sec, 180 secs
lola: 73705739 markings, 180873380 edges, 356453 markings/sec, 185 secs
lola: 75489000 markings, 185270665 edges, 356652 markings/sec, 190 secs
lola: 77274355 markings, 189670766 edges, 357071 markings/sec, 195 secs
lola: 79046748 markings, 194043876 edges, 354479 markings/sec, 200 secs
lola: 80819743 markings, 198415391 edges, 354599 markings/sec, 205 secs
lola: 82588923 markings, 202778225 edges, 353836 markings/sec, 210 secs
lola: 84359026 markings, 207142536 edges, 354021 markings/sec, 215 secs
lola: 86133737 markings, 211518947 edges, 354942 markings/sec, 220 secs
lola: 87906194 markings, 215889647 edges, 354491 markings/sec, 225 secs
lola: 89678224 markings, 220259596 edges, 354406 markings/sec, 230 secs
lola: 91440916 markings, 224607090 edges, 352538 markings/sec, 235 secs
lola: 93192509 markings, 228927366 edges, 350319 markings/sec, 240 secs
lola: 94920537 markings, 233191243 edges, 345606 markings/sec, 245 secs
lola: 96598416 markings, 237337069 edges, 335576 markings/sec, 250 secs
lola: 98348286 markings, 241656127 edges, 349974 markings/sec, 255 secs
lola: 100115353 markings, 246013764 edges, 353413 markings/sec, 260 secs
lola: 101865890 markings, 250331603 edges, 350107 markings/sec, 265 secs
lola: 103590602 markings, 254587080 edges, 344942 markings/sec, 270 secs
lola: 105232834 markings, 258647582 edges, 328446 markings/sec, 275 secs
lola: 106984888 markings, 262971476 edges, 350411 markings/sec, 280 secs
lola: 108739635 markings, 267299032 edges, 350949 markings/sec, 285 secs
lola: 110465298 markings, 271556736 edges, 345133 markings/sec, 290 secs
lola: 112083473 markings, 275559526 edges, 323635 markings/sec, 295 secs
lola: 113825190 markings, 279856898 edges, 348343 markings/sec, 300 secs
lola: 115569201 markings, 284158842 edges, 348802 markings/sec, 305 secs
lola: 117256284 markings, 288323548 edges, 337417 markings/sec, 310 secs
lola: 118913367 markings, 292422623 edges, 331417 markings/sec, 315 secs
lola: 120670892 markings, 296756839 edges, 351505 markings/sec, 320 secs
lola: 122376348 markings, 300965867 edges, 341091 markings/sec, 325 secs
lola: 123995555 markings, 304973815 edges, 323841 markings/sec, 330 secs
lola: 125560849 markings, 308832375 edges, 313059 markings/sec, 335 secs
lola: 126057603 markings, 310062321 edges, 99351 markings/sec, 340 secs
lola: 126720161 markings, 311704493 edges, 132512 markings/sec, 345 secs
lola: 128145773 markings, 315216444 edges, 285122 markings/sec, 350 secs
lola: 128838568 markings, 316932197 edges, 138559 markings/sec, 355 secs
lola: 130286530 markings, 320501758 edges, 289592 markings/sec, 360 secs
lola: 131364295 markings, 323169878 edges, 215553 markings/sec, 365 secs
lola: 132831151 markings, 326787132 edges, 293371 markings/sec, 370 secs
lola: 134261309 markings, 330327874 edges, 286032 markings/sec, 375 secs
lola: 135425112 markings, 333194552 edges, 232761 markings/sec, 380 secs
lola: 136455689 markings, 335744356 edges, 206115 markings/sec, 385 secs
lola: 137564363 markings, 338482602 edges, 221735 markings/sec, 390 secs
lola: 138908337 markings, 341801561 edges, 268795 markings/sec, 395 secs
lola: 140444834 markings, 345596884 edges, 307299 markings/sec, 400 secs
lola: 141589848 markings, 348425569 edges, 229003 markings/sec, 405 secs
lola: 142741844 markings, 351281027 edges, 230399 markings/sec, 410 secs
lola: 144315365 markings, 355159096 edges, 314704 markings/sec, 415 secs
lola: 145376484 markings, 357788693 edges, 212224 markings/sec, 420 secs
lola: 146508511 markings, 360576127 edges, 226405 markings/sec, 425 secs
lola: 148045204 markings, 364380673 edges, 307339 markings/sec, 430 secs
lola: 149722901 markings, 368519001 edges, 335539 markings/sec, 435 secs
lola: 151160797 markings, 372080835 edges, 287579 markings/sec, 440 secs
lola: 152754486 markings, 376010375 edges, 318738 markings/sec, 445 secs
lola: 153749015 markings, 378473738 edges, 198906 markings/sec, 450 secs
lola: 155405662 markings, 382561186 edges, 331329 markings/sec, 455 secs
lola: 156713228 markings, 385798949 edges, 261513 markings/sec, 460 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 5 will run for 516 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G ((G (F ((G ((p5 <= 1)) OR ((p7 <= 1) AND (p5 <= 1))))) OR (X (X ((1 <= p1))) AND (2 <= p7))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((G (F ((G ((p5 <= 1)) OR ((p7 <= 1) AND (p5 <= 1))))) OR (X (X ((1 <= p1))) AND (2 <= p7))))
lola: processed formula length: 95
lola: 49 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 10 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: 1003 markings, 1003 edges
lola: ========================================
lola: subprocess 6 will run for 619 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G ((p6 <= p4)))
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 ((p6 <= p4)))
lola: processed formula length: 18
lola: 49 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 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: 3989 markings, 4738 edges
lola: ========================================
lola: subprocess 7 will run for 774 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G ((F (G ((2 <= p7))) OR (2 <= p7)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((F (G ((2 <= p7))) OR (2 <= p7)))
lola: processed formula length: 36
lola: 49 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: 2490 markings, 2985 edges
lola: ========================================
lola: subprocess 8 will run for 1032 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (G (F ((p5 <= 0))) AND (p2 <= p0))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 8 will run for 1032 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: 49 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 9 will run for 1548 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (F ((p5 <= 0)))
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 ((p5 <= 0)))
lola: processed formula length: 17
lola: 49 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: 7 markings, 7 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 9 will run for 1548 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (G ((1 <= p2)) OR F ((p5 <= p7)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 9 will run for 1548 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G ((1 <= p2))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((1 <= p2))
lola: processed formula length: 13
lola: 49 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: subprocess 10 will run for 3095 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((p5 <= p7))
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: (p7 + 1 <= p5)
lola: processed formula length: 14
lola: 51 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: 1002 markings, 1002 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 10 will run for 3095 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((((p1 <= p7) OR (G (F ((p3 + 1 <= p7))) AND F ((p1 <= p7)))) U (2 <= p1)) AND (p1 <= p7))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 10 will run for 3095 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (p1 <= p7)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p1 <= p7)
lola: processed formula length: 10
lola: 49 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: Child process aborted or communication problem between parent and child process
lola: SUBRESULT
lola: result: unknown
lola: The Boolean predicate may be true or false.
lola: ========================================
lola: ========================================
lola: ...considering subproblem: X ((X (F ((1 <= p2))) AND (F ((1 <= p2)) OR G ((3 <= p3)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((X (F ((1 <= p2))) AND (F ((1 <= p2)) OR G ((3 <= p3)))))
lola: processed formula length: 60
lola: 49 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: 2795793 markings, 6698968 edges, 559159 markings/sec, 0 secs
lola: 5256091 markings, 12673621 edges, 492060 markings/sec, 5 secs
lola: 7500111 markings, 18142269 edges, 448804 markings/sec, 10 secs
lola: 9681810 markings, 23464970 edges, 436340 markings/sec, 15 secs
lola: 11787562 markings, 28612366 edges, 421150 markings/sec, 20 secs
lola: 13848116 markings, 33654172 edges, 412111 markings/sec, 25 secs
lola: 15911126 markings, 38705114 edges, 412602 markings/sec, 30 secs
lola: 17954190 markings, 43710675 edges, 408613 markings/sec, 35 secs
lola: 19972185 markings, 48660313 edges, 403599 markings/sec, 40 secs
lola: 21990361 markings, 53610407 edges, 403635 markings/sec, 45 secs
lola: 24002695 markings, 58546555 edges, 402467 markings/sec, 50 secs
lola: 26013020 markings, 63478835 edges, 402065 markings/sec, 55 secs
lola: 27968743 markings, 68284383 edges, 391145 markings/sec, 60 secs
lola: 29965092 markings, 73184439 edges, 399270 markings/sec, 65 secs
lola: 31929288 markings, 78010816 edges, 392839 markings/sec, 70 secs
lola: 33881534 markings, 82809195 edges, 390449 markings/sec, 75 secs
lola: 35810390 markings, 87550643 edges, 385771 markings/sec, 80 secs
lola: 37732729 markings, 92276638 edges, 384468 markings/sec, 85 secs
lola: 39648051 markings, 96987104 edges, 383064 markings/sec, 90 secs
lola: 41535994 markings, 101636757 edges, 377589 markings/sec, 95 secs
lola: 43465236 markings, 106379226 edges, 385848 markings/sec, 100 secs
lola: 45379448 markings, 111087827 edges, 382842 markings/sec, 105 secs
lola: 47246774 markings, 115687695 edges, 373465 markings/sec, 110 secs
lola: 49156825 markings, 120385026 edges, 382010 markings/sec, 115 secs
lola: 51007190 markings, 124944488 edges, 370073 markings/sec, 120 secs
lola: 52902278 markings, 129606574 edges, 379018 markings/sec, 125 secs
lola: 54785700 markings, 134246725 edges, 376684 markings/sec, 130 secs
lola: 56610362 markings, 138744919 edges, 364932 markings/sec, 135 secs
lola: 58505812 markings, 143406991 edges, 379090 markings/sec, 140 secs
lola: 60346436 markings, 147942968 edges, 368125 markings/sec, 145 secs
lola: 62158488 markings, 152410111 edges, 362410 markings/sec, 150 secs
lola: 63963358 markings, 156860061 edges, 360974 markings/sec, 155 secs
lola: 65839493 markings, 161476742 edges, 375227 markings/sec, 160 secs
lola: 67689892 markings, 166036385 edges, 370080 markings/sec, 165 secs
lola: 69522723 markings, 170554486 edges, 366566 markings/sec, 170 secs
lola: 71329822 markings, 175009948 edges, 361420 markings/sec, 175 secs
lola: 73133077 markings, 179456046 edges, 360651 markings/sec, 180 secs
lola: 74933208 markings, 183894685 edges, 360026 markings/sec, 185 secs
lola: 76727965 markings, 188320187 edges, 358951 markings/sec, 190 secs
lola: 78521598 markings, 192743465 edges, 358727 markings/sec, 195 secs
lola: 80313330 markings, 197161828 edges, 358346 markings/sec, 200 secs
lola: 82099018 markings, 201565131 edges, 357138 markings/sec, 205 secs
lola: 83890185 markings, 205982005 edges, 358233 markings/sec, 210 secs
lola: 85673990 markings, 210381443 edges, 356761 markings/sec, 215 secs
lola: 87457909 markings, 214780852 edges, 356784 markings/sec, 220 secs
lola: 89225019 markings, 219139152 edges, 353422 markings/sec, 225 secs
lola: 90982585 markings, 223474839 edges, 351513 markings/sec, 230 secs
lola: 92720637 markings, 227764028 edges, 347610 markings/sec, 235 secs
lola: 94418036 markings, 231960225 edges, 339480 markings/sec, 240 secs
lola: 96189055 markings, 236327421 edges, 354204 markings/sec, 245 secs
lola: 97965906 markings, 240709479 edges, 355370 markings/sec, 250 secs
lola: 99732757 markings, 245067051 edges, 353370 markings/sec, 255 secs
lola: 101470704 markings, 249355006 edges, 347589 markings/sec, 260 secs
lola: 103164625 markings, 253538450 edges, 338784 markings/sec, 265 secs
lola: 104879945 markings, 257776700 edges, 343064 markings/sec, 270 secs
lola: 106655056 markings, 262154322 edges, 355022 markings/sec, 275 secs
lola: 108407800 markings, 266478305 edges, 350549 markings/sec, 280 secs
lola: 110111936 markings, 270685199 edges, 340827 markings/sec, 285 secs
lola: 111786112 markings, 274825377 edges, 334835 markings/sec, 290 secs
lola: 113567395 markings, 279218382 edges, 356257 markings/sec, 295 secs
lola: 115316444 markings, 283533859 edges, 349810 markings/sec, 300 secs
lola: 116981386 markings, 287647785 edges, 332988 markings/sec, 305 secs
lola: 118697776 markings, 291888738 edges, 343278 markings/sec, 310 secs
lola: 120459002 markings, 296232564 edges, 352245 markings/sec, 315 secs
lola: 122143855 markings, 300392716 edges, 336971 markings/sec, 320 secs
lola: 123791200 markings, 304467331 edges, 329469 markings/sec, 325 secs
lola: 125544764 markings, 308792532 edges, 350713 markings/sec, 330 secs
lola: 126448047 markings, 311030220 edges, 180657 markings/sec, 335 secs
lola: 127581617 markings, 313821116 edges, 226714 markings/sec, 340 secs
lola: 128530474 markings, 316169077 edges, 189771 markings/sec, 345 secs
lola: 130026559 markings, 319859664 edges, 299217 markings/sec, 350 secs
lola: 131548564 markings, 323626795 edges, 304401 markings/sec, 355 secs
lola: 133088500 markings, 327423284 edges, 307987 markings/sec, 360 secs
lola: 134588871 markings, 331139916 edges, 300074 markings/sec, 365 secs
lola: 136150478 markings, 334988661 edges, 312321 markings/sec, 370 secs
lola: 137441562 markings, 338182283 edges, 258217 markings/sec, 375 secs
lola: 138935274 markings, 341868325 edges, 298742 markings/sec, 380 secs
lola: 140300913 markings, 345243398 edges, 273128 markings/sec, 385 secs
lola: 141487841 markings, 348173129 edges, 237386 markings/sec, 390 secs
lola: 142881285 markings, 351626476 edges, 278689 markings/sec, 395 secs
lola: 144402942 markings, 355376245 edges, 304331 markings/sec, 400 secs
lola: 145678858 markings, 358538304 edges, 255183 markings/sec, 405 secs
lola: 147226857 markings, 362353037 edges, 309600 markings/sec, 410 secs
lola: 148504658 markings, 365520117 edges, 255560 markings/sec, 415 secs
lola: 150070457 markings, 369379174 edges, 313160 markings/sec, 420 secs
lola: 151394378 markings, 372660764 edges, 264784 markings/sec, 425 secs
lola: 153092735 markings, 376847865 edges, 339671 markings/sec, 430 secs
lola: 154444920 markings, 380199454 edges, 270437 markings/sec, 435 secs
lola: 155930153 markings, 383858669 edges, 297047 markings/sec, 440 secs
lola: 157197864 markings, 387000533 edges, 253542 markings/sec, 445 secs
lola: Child process aborted or communication problem between parent and child process
lola: ========================================
lola: ...considering subproblem: ((((p1 <= p7) OR (G (F ((p3 + 1 <= p7))) AND F ((p1 <= p7)))) U (2 <= p1)) AND (p1 <= p7))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: ...considering subproblem: (p1 <= p7)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p1 <= p7)
lola: processed formula length: 10
lola: 49 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: ========================================
lola: ...considering subproblem: (((p1 <= p7) OR (G (F ((p3 + 1 <= p7))) AND F ((p1 <= p7)))) U (2 <= p1))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: (((p1 <= p7) OR (G (F ((p3 + 1 <= p7))) AND F ((p1 <= p7)))) U (2 <= p1))
lola: processed formula length: 73
lola: 49 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: 503 markings, 503 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: RESULT
lola:
SUMMARY: no yes no yes no no no no unknown no no
lola:
preliminary result: no yes no yes no no no no unknown no no
lola: memory consumption: 3492 KB
lola: time consumption: 933 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-nC00500vD"
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-nC00500vD, 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-162132127900153"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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