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.r094-tall-162048902700397.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 FMS-PT-01000, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r094-tall-162048902700397
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 424K
-rw-r--r-- 1 mcc users 17K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 177K May 10 09:43 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.7K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 68K May 10 09:43 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.1K Mar 28 16:09 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Mar 28 16:09 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.8K Mar 28 16:09 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Mar 28 16:09 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Mar 23 10:44 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 19K Mar 23 10:44 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.7K Mar 22 18:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 22 18:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K Mar 22 09:11 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Mar 22 09:11 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 5 16:51 equiv_col
-rw-r--r-- 1 mcc users 6 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 16K May 5 16:51 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME FMS-PT-01000-00
FORMULA_NAME FMS-PT-01000-01
FORMULA_NAME FMS-PT-01000-02
FORMULA_NAME FMS-PT-01000-03
FORMULA_NAME FMS-PT-01000-04
FORMULA_NAME FMS-PT-01000-05
FORMULA_NAME FMS-PT-01000-06
FORMULA_NAME FMS-PT-01000-07
FORMULA_NAME FMS-PT-01000-08
FORMULA_NAME FMS-PT-01000-09
FORMULA_NAME FMS-PT-01000-10
FORMULA_NAME FMS-PT-01000-11
FORMULA_NAME FMS-PT-01000-12
FORMULA_NAME FMS-PT-01000-13
FORMULA_NAME FMS-PT-01000-14
FORMULA_NAME FMS-PT-01000-15

=== Now, execution of the tool begins

BK_START 1620782715137

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

FORMULA FMS-PT-01000-02 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA FMS-PT-01000-03 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA FMS-PT-01000-04 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA FMS-PT-01000-05 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA FMS-PT-01000-07 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA FMS-PT-01000-09 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA FMS-PT-01000-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA FMS-PT-01000-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA FMS-PT-01000-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA FMS-PT-01000-00 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA FMS-PT-01000-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA FMS-PT-01000-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA FMS-PT-01000-01 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 2976
rslt: Output for LTLCardinality @ FMS-PT-01000

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 274
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 2,
"U": 0,
"X": 2,
"aconj": 0,
"adisj": 0,
"aneg": 4,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 8,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "X ((((G ((p6 + 1 <= p4)) R X (G ((p11 + 1 <= p1)))) R (p11 + 1 <= p21)) AND F ((p6 + 1 <= p4))))",
"processed_size": 96,
"rewrites": 69
},
"result":
{
"edges": 4003,
"markings": 4003,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 18
},
"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": 299
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 2,
"U": 0,
"X": 2,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 6,
"taut": 0,
"tconj": 0,
"tdisj": 2,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "X (X (G ((G ((p5 <= p10)) OR ((p5 <= p10) OR (p5 <= p7))))))",
"processed_size": 60,
"rewrites": 69
},
"result":
{
"edges": 4029004,
"markings": 3021006,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 5
},
"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": 328
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 3,
"G": 1,
"U": 0,
"X": 3,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 5,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 6,
"taut": 0,
"tconj": 1,
"tdisj": 3,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "X ((X ((G ((F ((2 <= p3)) AND (F ((2 <= p18)) OR X (F ((2 <= p3)))))) OR (p12 + 1 <= p20))) OR (p18 <= 1)))",
"processed_size": 107,
"rewrites": 69
},
"result":
{
"edges": 3,
"markings": 4,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 6
},
"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": 365
},
"child":
[

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

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

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 469
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 0,
"U": 0,
"X": 5,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"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 (X (X (F ((p2 <= p1))))) AND (p2 <= p1))))",
"processed_size": 51,
"rewrites": 69
},
"result":
{
"edges": 4243,
"markings": 4126,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 8
},
"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": 548
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 2,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "G (F ((((p16 <= 2) R X ((2 <= p1))) AND (p15 + 1 <= p9))))",
"processed_size": 58,
"rewrites": 69
},
"result":
{
"edges": 4003,
"markings": 4003,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 4
},
"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": 657
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "(p17 <= 2)",
"processed_size": 10,
"rewrites": 71
},
"result":
{
"edges": 5012,
"markings": 5012,
"produced_by": "state space / EG",
"value": false
},
"task":
{
"compoundnumber": 8,
"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": 822
},
"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": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "F (G ((p16 + 1 <= p19)))",
"processed_size": 24,
"rewrites": 69
},
"result":
{
"edges": 7004,
"markings": 7003,
"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": 1096
},
"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": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "G (F ((p14 + 1 <= p1)))",
"processed_size": 23,
"rewrites": 69
},
"result":
{
"edges": 5002,
"markings": 5002,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 10,
"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": 1644
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 5,
"taut": 0,
"tconj": 1,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "F (G ((F ((p0 <= p11)) AND ((3 <= p7) OR (p0 <= p11)))))",
"processed_size": 56,
"rewrites": 69
},
"result":
{
"edges": 9017,
"markings": 8014,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 11,
"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": 3288
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3288
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"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 (((3 <= p6) OR G ((p6 <= 2))))",
"processed_size": 32,
"rewrites": 69
},
"result":
{
"edges": 11061,
"markings": 10051,
"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"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 12,
"type": "boolean"
}
},

{
"child":
[

{
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 0,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "X (F ((1 <= p1)))",
"processed_size": 17,
"rewrites": 69
},
"result":
{
"edges": 4003,
"markings": 4003,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 14,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
}
],
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 13,
"type": "boolean"
}
}
],
"exit":
{
"error": null,
"memory": 3480,
"runtime": 594.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "LTLCardinality.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "G(F(*)) : (X(F(**)) AND G(((F(**) U G(**)) OR **))) : X((((G(*) R X(G(*))) R *) AND F(*))) : X(X(G((G(**) OR (** OR **))))) : X((X((G((F(**) AND (F(**) OR X(F(**))))) OR **)) OR **)) : (X(X(**)) OR G(**)) : ((X(*) R *) OR F(G(*))) : X(X((X(X(X(F(**)))) AND **))) : F(**) : (F(G(**)) AND G((** OR G(**)))) : F(G(*)) : G(F(((* R X(**)) AND *))) : F(G((F(**) AND (** OR **))))"
},
"net":
{
"arcs": 50,
"conflict_clusters": 17,
"places": 22,
"places_significant": 16,
"singleton_clusters": 0,
"transitions": 20
},
"result":
{
"preliminary_value": "no no no no yes no no no no no no no no ",
"value": "no no no no yes no no no no 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: 42/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 704
lola: finding significant places
lola: 22 places, 20 transitions, 16 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(F (X (((((p9 <= p13) U (p14 <= p8)) OR (p14 <= p8)) U G ((p1 <= p14)))))) : (NOT(G (NOT(X ((1 <= p1))))) AND G (((F ((p6 <= p15)) U G ((p2 <= p18))) OR (p6 <= p15)))) : (NOT(X (((F ((p4 <= p6)) U X (F ((p1 <= p11)))) U (p21 <= p11)))) AND NOT(X (G ((p4 <= p6))))) : X (X (G (((G ((p5 <= p10)) OR (p5 <= p10)) OR (p5 <= p7))))) : X ((X ((G ((F ((2 <= p18)) U F (X ((2 <= p3))))) OR (p12 + 1 <= p20))) OR (p18 <= 1))) : (X (X ((p15 <= p2))) OR G ((3 <= p5))) : (NOT((X ((2 <= p16)) U (p8 <= p18))) OR NOT(G (F ((1 <= p5))))) : X (X ((X (X (F (X ((p2 <= p1))))) AND (p2 <= p1)))) : F ((3 <= p17)) : G (((3 <= p6) U G (G ((p6 <= 2))))) : X (F (X (G (NOT(F ((p19 <= p16))))))) : NOT(X (X (G (F (G ((((3 <= p16) U NOT(X ((2 <= p1)))) OR (p9 <= p15)))))))) : F (G (F (X (F (G (((3 <= p7) U (p0 <= p11))))))))
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:434
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:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:338
lola: rewrite Frontend/Parser/formula_rewrite.k:338
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:332
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:297
lola: rewrite Frontend/Parser/formula_rewrite.k:525
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:437
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:522
lola: rewrite Frontend/Parser/formula_rewrite.k:338
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: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:350
lola: rewrite Frontend/Parser/formula_rewrite.k:437
lola: rewrite Frontend/Parser/formula_rewrite.k:374
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:374
lola: rewrite Frontend/Parser/formula_rewrite.k:380
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:318
lola: rewrite Frontend/Parser/formula_rewrite.k:338
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:297
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:347
lola: rewrite Frontend/Parser/formula_rewrite.k:374
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (X (F ((1 <= p1))) AND G (((F ((p6 <= p15)) U G ((p2 <= p18))) OR (p6 <= p15))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 0 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (((F ((p6 <= p15)) U G ((p2 <= p18))) OR (p6 <= p15)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (((F ((p6 <= p15)) U G ((p2 <= p18))) OR (p6 <= p15)))
lola: processed formula length: 56
lola: 69 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: 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: 3245638 markings, 6799396 edges, 649128 markings/sec, 0 secs
lola: 6306053 markings, 13934868 edges, 612083 markings/sec, 5 secs
lola: 9066109 markings, 20681086 edges, 552011 markings/sec, 10 secs
lola: 11970530 markings, 27732581 edges, 580884 markings/sec, 15 secs
lola: 14688219 markings, 34382074 edges, 543538 markings/sec, 20 secs
lola: 17344950 markings, 41447078 edges, 531346 markings/sec, 25 secs
lola: 20192573 markings, 48307582 edges, 569525 markings/sec, 30 secs
lola: 22812229 markings, 54932348 edges, 523931 markings/sec, 35 secs
lola: 25385865 markings, 61669776 edges, 514727 markings/sec, 40 secs
lola: 28289684 markings, 68733441 edges, 580764 markings/sec, 45 secs
lola: 30838824 markings, 75389319 edges, 509828 markings/sec, 50 secs
lola: 33387831 markings, 81895610 edges, 509801 markings/sec, 55 secs
lola: 35992712 markings, 88752035 edges, 520976 markings/sec, 60 secs
lola: 38800590 markings, 95514334 edges, 561576 markings/sec, 65 secs
lola: 41296339 markings, 102211444 edges, 499150 markings/sec, 70 secs
lola: 43781848 markings, 108709035 edges, 497102 markings/sec, 75 secs
lola: 46306848 markings, 115154205 edges, 505000 markings/sec, 80 secs
lola: 49142428 markings, 121954451 edges, 567116 markings/sec, 85 secs
lola: 51674651 markings, 128661971 edges, 506445 markings/sec, 90 secs
lola: 54145263 markings, 135215646 edges, 494122 markings/sec, 95 secs
lola: 56574775 markings, 141653850 edges, 485902 markings/sec, 100 secs
lola: 59135643 markings, 148188784 edges, 512174 markings/sec, 105 secs
lola: 61902843 markings, 154945106 edges, 553440 markings/sec, 110 secs
lola: 64441233 markings, 161541761 edges, 507678 markings/sec, 115 secs
lola: 66938718 markings, 168052396 edges, 499497 markings/sec, 120 secs
lola: 69328565 markings, 174501111 edges, 477969 markings/sec, 125 secs
lola: 71849100 markings, 180877011 edges, 504107 markings/sec, 130 secs
lola: 74356797 markings, 187450844 edges, 501539 markings/sec, 135 secs
lola: 77176651 markings, 194227861 edges, 563971 markings/sec, 140 secs
lola: 79606862 markings, 200665350 edges, 486042 markings/sec, 145 secs
lola: 82041714 markings, 207247775 edges, 486970 markings/sec, 150 secs
lola: 84491259 markings, 213654497 edges, 489909 markings/sec, 155 secs
lola: 86916085 markings, 220175168 edges, 484965 markings/sec, 160 secs
lola: 89428477 markings, 226556581 edges, 502478 markings/sec, 165 secs
lola: 92112751 markings, 233304516 edges, 536855 markings/sec, 170 secs
lola: 94723552 markings, 239812038 edges, 522160 markings/sec, 175 secs
lola: 97147255 markings, 246221853 edges, 484741 markings/sec, 180 secs
lola: 99566012 markings, 252764055 edges, 483751 markings/sec, 185 secs
lola: 102024973 markings, 259199148 edges, 491792 markings/sec, 190 secs
lola: 104424031 markings, 265650592 edges, 479812 markings/sec, 195 secs
lola: 106887159 markings, 271876345 edges, 492626 markings/sec, 200 secs
lola: 109535919 markings, 278620653 edges, 529752 markings/sec, 205 secs
lola: 112158006 markings, 285058092 edges, 524417 markings/sec, 210 secs
lola: 114672551 markings, 291742954 edges, 502909 markings/sec, 215 secs
lola: 116599333 markings, 296871903 edges, 385356 markings/sec, 220 secs
lola: 118014397 markings, 300613490 edges, 283013 markings/sec, 225 secs
lola: 120235633 markings, 306638380 edges, 444247 markings/sec, 230 secs
lola: 122411951 markings, 312325667 edges, 435264 markings/sec, 235 secs
lola: 123333971 markings, 314878879 edges, 184404 markings/sec, 240 secs
lola: 124946159 markings, 318793284 edges, 322438 markings/sec, 245 secs
lola: 126579153 markings, 323123695 edges, 326599 markings/sec, 250 secs
lola: 128557039 markings, 328132482 edges, 395577 markings/sec, 255 secs
lola: 129966489 markings, 331424313 edges, 281890 markings/sec, 260 secs
lola: local time limit reached - aborting
lola: local time limit reached - aborting
lola:
preliminary result: unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown
lola:
preliminary result: unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown
lola: memory consumption: 156 KB
lola: time consumption: 277 seconds
lola: print data as JSON (--json)
lola: writing JSON to LTLCardinality.json
lola: closed JSON file LTLCardinality.json
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 1 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((((G ((p6 + 1 <= p4)) R X (G ((p11 + 1 <= p1)))) R (p11 + 1 <= p21)) AND F ((p6 + 1 <= p4))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((((G ((p6 + 1 <= p4)) R X (G ((p11 + 1 <= p1)))) R (p11 + 1 <= p21)) AND F ((p6 + 1 <= p4))))
lola: processed formula length: 96
lola: 69 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 18 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: 4003 markings, 4003 edges
lola: ========================================
lola: subprocess 2 will run for 299 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (X (G ((G ((p5 <= p10)) OR ((p5 <= p10) OR (p5 <= p7))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (X (G ((G ((p5 <= p10)) OR ((p5 <= p10) OR (p5 <= p7))))))
lola: processed formula length: 60
lola: 69 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: 3021006 markings, 4029004 edges
lola: ========================================
lola: subprocess 3 will run for 328 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((X ((G ((F ((2 <= p3)) AND (F ((2 <= p18)) OR X (F ((2 <= p3)))))) OR (p12 + 1 <= p20))) OR (p18 <= 1)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((X ((G ((F ((2 <= p3)) AND (F ((2 <= p18)) OR X (F ((2 <= p3)))))) OR (p12 + 1 <= p20))) OR (p18 <= 1)))
lola: processed formula length: 107
lola: 69 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: 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: subprocess 4 will run for 365 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (X (X ((p15 <= p2))) OR G ((3 <= p5)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 4 will run for 365 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G ((3 <= p5))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((3 <= p5))
lola: processed formula length: 13
lola: 69 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: 5002 markings, 5002 edges
lola: ========================================
lola: subprocess 5 will run for 411 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (X ((p15 <= p2)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (X ((p15 <= p2)))
lola: processed formula length: 19
lola: 69 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: 4003 markings, 4003 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 5 will run for 411 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((X ((p16 <= 1)) R (p18 + 1 <= p8)) OR F (G ((p5 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 5 will run for 411 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G ((p5 <= 0)))
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 ((p5 <= 0)))
lola: processed formula length: 17
lola: 69 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: 7006 markings, 8008 edges
lola: ========================================
lola: subprocess 6 will run for 469 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (X ((p16 <= 1)) R (p18 + 1 <= p8))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: (X ((p16 <= 1)) R (p18 + 1 <= p8))
lola: processed formula length: 34
lola: 69 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: 4003 markings, 4003 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 6 will run for 469 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (X ((X (X (X (F ((p2 <= p1))))) AND (p2 <= p1))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (X ((X (X (X (F ((p2 <= p1))))) AND (p2 <= p1))))
lola: processed formula length: 51
lola: 69 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: 4126 markings, 4243 edges
lola: ========================================
lola: subprocess 7 will run for 548 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (F ((((p16 <= 2) R X ((2 <= p1))) AND (p15 + 1 <= p9))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (F ((((p16 <= 2) R X ((2 <= p1))) AND (p15 + 1 <= p9))))
lola: processed formula length: 58
lola: 69 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: 4003 markings, 4003 edges
lola: ========================================
lola: subprocess 8 will run for 657 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((3 <= p17))
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: (p17 <= 2)
lola: processed formula length: 10
lola: 71 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: 5012 markings, 5012 edges
lola: ========================================
lola: subprocess 9 will run for 822 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G ((p16 + 1 <= p19)))
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 ((p16 + 1 <= p19)))
lola: processed formula length: 24
lola: 69 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: 7003 markings, 7004 edges
lola: ========================================
lola: subprocess 10 will run for 1096 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (F ((p14 + 1 <= p1)))
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 ((p14 + 1 <= p1)))
lola: processed formula length: 23
lola: 69 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: 5002 markings, 5002 edges
lola: ========================================
lola: subprocess 11 will run for 1644 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G ((F ((p0 <= p11)) AND ((3 <= p7) OR (p0 <= p11)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F (G ((F ((p0 <= p11)) AND ((3 <= p7) OR (p0 <= p11)))))
lola: processed formula length: 56
lola: 69 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: 8014 markings, 9017 edges
lola: ========================================
lola: subprocess 12 will run for 3288 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (F (G ((p6 <= 2))) AND G (((3 <= p6) OR G ((p6 <= 2)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 12 will run for 3288 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (((3 <= p6) OR G ((p6 <= 2))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (((3 <= p6) OR G ((p6 <= 2))))
lola: processed formula length: 32
lola: 69 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: 10051 markings, 11061 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: ========================================
lola: ...considering subproblem: (X (F ((1 <= p1))) AND G (((F ((p6 <= p15)) U G ((p2 <= p18))) OR (p6 <= p15))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: ...considering subproblem: G (((F ((p6 <= p15)) U G ((p2 <= p18))) OR (p6 <= p15)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (((F ((p6 <= p15)) U G ((p2 <= p18))) OR (p6 <= p15)))
lola: processed formula length: 56
lola: 69 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: 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: 3223898 markings, 6734250 edges, 644780 markings/sec, 0 secs
lola: 6281082 markings, 13884955 edges, 611437 markings/sec, 5 secs
lola: 9035069 markings, 20603565 edges, 550797 markings/sec, 10 secs
lola: 11915731 markings, 27623043 edges, 576132 markings/sec, 15 secs
lola: 14637058 markings, 34228757 edges, 544265 markings/sec, 20 secs
lola: 17288336 markings, 41305689 edges, 530256 markings/sec, 25 secs
lola: 20125795 markings, 48140743 edges, 567492 markings/sec, 30 secs
lola: 22726127 markings, 54750948 edges, 520066 markings/sec, 35 secs
lola: 25281907 markings, 61409969 edges, 511156 markings/sec, 40 secs
lola: 28189570 markings, 68433371 edges, 581533 markings/sec, 45 secs
lola: 30716297 markings, 75083110 edges, 505345 markings/sec, 50 secs
lola: 33281769 markings, 81598921 edges, 513094 markings/sec, 55 secs
lola: 35889721 markings, 88494758 edges, 521590 markings/sec, 60 secs
lola: 38718742 markings, 95309827 edges, 565804 markings/sec, 65 secs
lola: 41233058 markings, 102021783 edges, 502863 markings/sec, 70 secs
lola: 43709346 markings, 108527846 edges, 495258 markings/sec, 75 secs
lola: 46236642 markings, 114978792 edges, 505459 markings/sec, 80 secs
lola: 49069873 markings, 121809413 edges, 566646 markings/sec, 85 secs
lola: 51626169 markings, 128540844 edges, 511259 markings/sec, 90 secs
lola: 54109883 markings, 135109572 edges, 496743 markings/sec, 95 secs
lola: 56551342 markings, 141595292 edges, 488292 markings/sec, 100 secs
lola: 59134439 markings, 148185775 edges, 516619 markings/sec, 105 secs
lola: 61915523 markings, 154970453 edges, 556217 markings/sec, 110 secs
lola: 64464984 markings, 161601056 edges, 509892 markings/sec, 115 secs
lola: 66968793 markings, 168142581 edges, 500762 markings/sec, 120 secs
lola: 69377813 markings, 174624171 edges, 481804 markings/sec, 125 secs
lola: 71919932 markings, 181026579 edges, 508424 markings/sec, 130 secs
lola: 74457958 markings, 187703659 edges, 507605 markings/sec, 135 secs
lola: 77265324 markings, 194493687 edges, 561473 markings/sec, 140 secs
lola: 79729157 markings, 200970970 edges, 492767 markings/sec, 145 secs
lola: 82176406 markings, 207584246 edges, 489450 markings/sec, 150 secs
lola: 84633813 markings, 214081930 edges, 491481 markings/sec, 155 secs
lola: 87084549 markings, 220596142 edges, 490147 markings/sec, 160 secs
lola: 89599202 markings, 227015674 edges, 502931 markings/sec, 165 secs
lola: 92332125 markings, 233742920 edges, 546585 markings/sec, 170 secs
lola: 94897145 markings, 240332316 edges, 513004 markings/sec, 175 secs
lola: 97358832 markings, 246750600 edges, 492337 markings/sec, 180 secs
lola: 99780274 markings, 253299334 edges, 484288 markings/sec, 185 secs
lola: 102233631 markings, 259824762 edges, 490671 markings/sec, 190 secs
lola: 104661233 markings, 266243340 edges, 485520 markings/sec, 195 secs
lola: 107143679 markings, 272582354 edges, 496489 markings/sec, 200 secs
lola: 109872837 markings, 279293878 edges, 545832 markings/sec, 205 secs
lola: 112420080 markings, 285843658 edges, 509449 markings/sec, 210 secs
lola: 113377466 markings, 288256842 edges, 191477 markings/sec, 215 secs
lola: 115243022 markings, 293307002 edges, 373111 markings/sec, 220 secs
lola: 116151319 markings, 295685323 edges, 181659 markings/sec, 225 secs
lola: 117468605 markings, 299225987 edges, 263457 markings/sec, 230 secs
lola: 119044542 markings, 303412999 edges, 315187 markings/sec, 235 secs
lola: 120585704 markings, 307513105 edges, 308232 markings/sec, 240 secs
lola: 122006506 markings, 311312449 edges, 284160 markings/sec, 245 secs
lola: 123124285 markings, 314355019 edges, 223556 markings/sec, 250 secs
lola: 124886392 markings, 318614434 edges, 352421 markings/sec, 255 secs
lola: 126224483 markings, 322237542 edges, 267618 markings/sec, 260 secs
lola: 128210062 markings, 327160485 edges, 397116 markings/sec, 265 secs
lola: 129671212 markings, 330539249 edges, 292230 markings/sec, 270 secs
lola: 130967193 markings, 333936777 edges, 259196 markings/sec, 275 secs
lola: 132777998 markings, 338852418 edges, 362161 markings/sec, 280 secs
lola: 134346944 markings, 343055605 edges, 313789 markings/sec, 285 secs
lola: 136071643 markings, 347688094 edges, 344940 markings/sec, 290 secs
lola: 138047107 markings, 352873223 edges, 395093 markings/sec, 295 secs
lola: 139382590 markings, 356459385 edges, 267097 markings/sec, 300 secs
lola: Child process aborted or communication problem between parent and child process
lola: ========================================
lola: ...considering subproblem: X (F ((1 <= p1)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (F ((1 <= p1)))
lola: processed formula length: 17
lola: 69 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 4003 markings, 4003 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: RESULT
lola:
SUMMARY: no no no no yes no no no no no no no no
lola:
preliminary result: no no no no yes no no no no no no no no
lola: memory consumption: 3480 KB
lola: time consumption: 594 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="FMS-PT-01000"
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 FMS-PT-01000, 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 r094-tall-162048902700397"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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