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.r151-tall-162089151200181.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 ParamProductionCell-PT-0, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r151-tall-162089151200181
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 496K
-rw-r--r-- 1 mcc users 14K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 87K May 10 09:43 CTLCardinality.xml
-rw-r--r-- 1 mcc users 14K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 78K May 10 09:43 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.2K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.1K Mar 28 16:23 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Mar 28 16:23 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Mar 28 16:23 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 28 16:23 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 27 06:34 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 18K Mar 27 06:34 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.5K Mar 25 07:55 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 25 07:55 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Mar 22 09:15 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Mar 22 09:15 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 5 16:51 equiv_col
-rw-r--r-- 1 mcc users 2 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 149K 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 ParamProductionCell-PT-0-00
FORMULA_NAME ParamProductionCell-PT-0-01
FORMULA_NAME ParamProductionCell-PT-0-02
FORMULA_NAME ParamProductionCell-PT-0-03
FORMULA_NAME ParamProductionCell-PT-0-04
FORMULA_NAME ParamProductionCell-PT-0-05
FORMULA_NAME ParamProductionCell-PT-0-06
FORMULA_NAME ParamProductionCell-PT-0-07
FORMULA_NAME ParamProductionCell-PT-0-08
FORMULA_NAME ParamProductionCell-PT-0-09
FORMULA_NAME ParamProductionCell-PT-0-10
FORMULA_NAME ParamProductionCell-PT-0-11
FORMULA_NAME ParamProductionCell-PT-0-12
FORMULA_NAME ParamProductionCell-PT-0-13
FORMULA_NAME ParamProductionCell-PT-0-14
FORMULA_NAME ParamProductionCell-PT-0-15

=== Now, execution of the tool begins

BK_START 1621005196024

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2021-05-14 15:13:17] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -timeout, 3600, -rebuildPNML]
[2021-05-14 15:13:17] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-14 15:13:17] [INFO ] Load time of PNML (sax parser for PT used): 66 ms
[2021-05-14 15:13:17] [INFO ] Transformed 198 places.
[2021-05-14 15:13:17] [INFO ] Transformed 176 transitions.
[2021-05-14 15:13:17] [INFO ] Found NUPN structural information;
[2021-05-14 15:13:17] [INFO ] Parsed PT model containing 198 places and 176 transitions in 106 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 22 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100000 steps, including 0 resets, run finished after 337 ms. (steps per millisecond=296 ) properties seen :[1, 0, 1, 1, 0, 0, 0, 1, 1, 0, 1, 1, 1, 1, 1, 1, 0, 0, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1]
// Phase 1: matrix 176 rows 198 cols
[2021-05-14 15:13:18] [INFO ] Computed 49 place invariants in 12 ms
[2021-05-14 15:13:18] [INFO ] [Real]Absence check using 32 positive place invariants in 24 ms returned sat
[2021-05-14 15:13:18] [INFO ] [Real]Absence check using 32 positive and 17 generalized place invariants in 6 ms returned sat
[2021-05-14 15:13:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 15:13:18] [INFO ] [Real]Absence check using state equation in 131 ms returned sat
[2021-05-14 15:13:18] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 15:13:18] [INFO ] [Nat]Absence check using 32 positive place invariants in 11 ms returned unsat
[2021-05-14 15:13:18] [INFO ] [Real]Absence check using 32 positive place invariants in 13 ms returned sat
[2021-05-14 15:13:18] [INFO ] [Real]Absence check using 32 positive and 17 generalized place invariants in 6 ms returned sat
[2021-05-14 15:13:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 15:13:18] [INFO ] [Real]Absence check using state equation in 122 ms returned sat
[2021-05-14 15:13:18] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 15:13:18] [INFO ] [Nat]Absence check using 32 positive place invariants in 14 ms returned unsat
[2021-05-14 15:13:18] [INFO ] [Real]Absence check using 32 positive place invariants in 13 ms returned sat
[2021-05-14 15:13:18] [INFO ] [Real]Absence check using 32 positive and 17 generalized place invariants in 5 ms returned sat
[2021-05-14 15:13:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 15:13:18] [INFO ] [Real]Absence check using state equation in 121 ms returned sat
[2021-05-14 15:13:18] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 15:13:18] [INFO ] [Nat]Absence check using 32 positive place invariants in 12 ms returned unsat
[2021-05-14 15:13:18] [INFO ] [Real]Absence check using 32 positive place invariants in 14 ms returned sat
[2021-05-14 15:13:18] [INFO ] [Real]Absence check using 32 positive and 17 generalized place invariants in 7 ms returned sat
[2021-05-14 15:13:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 15:13:19] [INFO ] [Real]Absence check using state equation in 119 ms returned sat
[2021-05-14 15:13:19] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 15:13:19] [INFO ] [Nat]Absence check using 32 positive place invariants in 14 ms returned unsat
[2021-05-14 15:13:19] [INFO ] [Real]Absence check using 32 positive place invariants in 14 ms returned sat
[2021-05-14 15:13:19] [INFO ] [Real]Absence check using 32 positive and 17 generalized place invariants in 6 ms returned sat
[2021-05-14 15:13:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 15:13:19] [INFO ] [Real]Absence check using state equation in 126 ms returned sat
[2021-05-14 15:13:19] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 15:13:19] [INFO ] [Nat]Absence check using 32 positive place invariants in 9 ms returned unsat
[2021-05-14 15:13:19] [INFO ] [Real]Absence check using 32 positive place invariants in 14 ms returned sat
[2021-05-14 15:13:19] [INFO ] [Real]Absence check using 32 positive and 17 generalized place invariants in 5 ms returned sat
[2021-05-14 15:13:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 15:13:19] [INFO ] [Real]Absence check using state equation in 123 ms returned sat
[2021-05-14 15:13:19] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 15:13:19] [INFO ] [Nat]Absence check using 32 positive place invariants in 8 ms returned unsat
[2021-05-14 15:13:19] [INFO ] [Real]Absence check using 32 positive place invariants in 14 ms returned sat
[2021-05-14 15:13:19] [INFO ] [Real]Absence check using 32 positive and 17 generalized place invariants in 5 ms returned sat
[2021-05-14 15:13:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 15:13:19] [INFO ] [Real]Absence check using state equation in 118 ms returned sat
[2021-05-14 15:13:19] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 15:13:19] [INFO ] [Nat]Absence check using 32 positive place invariants in 9 ms returned unsat
[2021-05-14 15:13:19] [INFO ] [Real]Absence check using 32 positive place invariants in 13 ms returned sat
[2021-05-14 15:13:19] [INFO ] [Real]Absence check using 32 positive and 17 generalized place invariants in 5 ms returned sat
[2021-05-14 15:13:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 15:13:19] [INFO ] [Real]Absence check using state equation in 122 ms returned sat
[2021-05-14 15:13:19] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 15:13:20] [INFO ] [Nat]Absence check using 32 positive place invariants in 9 ms returned unsat
[2021-05-14 15:13:20] [INFO ] [Real]Absence check using 32 positive place invariants in 14 ms returned sat
[2021-05-14 15:13:20] [INFO ] [Real]Absence check using 32 positive and 17 generalized place invariants in 6 ms returned sat
[2021-05-14 15:13:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 15:13:20] [INFO ] [Real]Absence check using state equation in 120 ms returned sat
[2021-05-14 15:13:20] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 15:13:20] [INFO ] [Nat]Absence check using 32 positive place invariants in 8 ms returned unsat
Successfully simplified 9 atomic propositions for a total of 11 simplifications.
[2021-05-14 15:13:20] [INFO ] Initial state reduction rules for CTL removed 8 formulas.
[2021-05-14 15:13:20] [INFO ] Flatten gal took : 54 ms
FORMULA ParamProductionCell-PT-0-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ParamProductionCell-PT-0-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ParamProductionCell-PT-0-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ParamProductionCell-PT-0-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ParamProductionCell-PT-0-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ParamProductionCell-PT-0-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ParamProductionCell-PT-0-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ParamProductionCell-PT-0-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-14 15:13:20] [INFO ] Applying decomposition
[2021-05-14 15:13:20] [INFO ] Flatten gal took : 17 ms
[2021-05-14 15:13:20] [INFO ] Decomposing Gal with order
[2021-05-14 15:13:20] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-14 15:13:20] [INFO ] Removed a total of 126 redundant transitions.
[2021-05-14 15:13:20] [INFO ] Flatten gal took : 76 ms
[2021-05-14 15:13:20] [INFO ] Fuse similar labels procedure discarded/fused a total of 84 labels/synchronizations in 10 ms.
[2021-05-14 15:13:20] [INFO ] Export to MCC properties in file /home/mcc/execution/LTLCardinality.sr.xml took 3 ms.
[2021-05-14 15:13:20] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 3 ms.
info: Time: 3600 - MCC
vrfy: Checking LTLCardinality @ ParamProductionCell-PT-0 @ 3570 seconds

FORMULA ParamProductionCell-PT-0-00 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ParamProductionCell-PT-0-07 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ParamProductionCell-PT-0-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ParamProductionCell-PT-0-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ParamProductionCell-PT-0-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ParamProductionCell-PT-0-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ParamProductionCell-PT-0-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ParamProductionCell-PT-0-09 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 3567
rslt: Output for LTLCardinality @ ParamProductionCell-PT-0

{
"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",
"--safe",
"--check=modelchecking",
"--stubborn=deletion",
"--stateequation=par",
"--timelimit=3570",
"--localtimelimit=0",
"--preference=force_ltl",
"--json=LTLCardinality.json",
"--jsoninclude=formula,formulastat,net"
],
"starttime": "Fri May 14 15:13:21 2021
",
"timelimit": 3570
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 445
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 0,
"U": 0,
"X": 1,
"aconj": 1,
"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 <= p189))))",
"processed_size": 21,
"rewrites": 58
},
"result":
{
"edges": 8046,
"markings": 2955,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 2
},
"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": 509
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 509
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 2,
"adisj": 1,
"aneg": 1,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "G (F ((((1 <= p42)) AND ((p188 <= 0)))))",
"processed_size": 40,
"rewrites": 58
},
"result":
{
"edges": 2817,
"markings": 1976,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 1,
"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": 594
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 1,
"aconj": 1,
"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 (((p180 <= 0)))",
"processed_size": 17,
"rewrites": 58
},
"result":
{
"edges": 1,
"markings": 2,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 2,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": true
},
"task":
{
"compoundnumber": 1,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 594
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 3,
"aconj": 3,
"adisj": 1,
"aneg": 0,
"comp": 3,
"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 (X (X (G ((((1 <= p26)) OR ((p188 <= 0)) OR ((1 <= p177)))))))",
"processed_size": 66,
"rewrites": 58
},
"result":
{
"edges": 233,
"markings": 233,
"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": 713
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 1,
"aconj": 3,
"adisj": 1,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "X ((G (((1 <= p140))) OR (((p48 <= 0)) OR ((1 <= p168)))))",
"processed_size": 59,
"rewrites": 58
},
"result":
{
"edges": 1,
"markings": 2,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 4
},
"compoundnumber": 3,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1189
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 4,
"G": 2,
"U": 0,
"X": 3,
"aconj": 8,
"adisj": 4,
"aneg": 4,
"comp": 8,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 8,
"taut": 0,
"tconj": 1,
"tdisj": 2,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "X (F ((X (F ((((1 <= p176)) AND ((p55 <= 0))))) AND (G (F ((((1 <= p176)) AND ((p55 <= 0))))) OR G (F ((X ((((1 <= p176)) AND ((p55 <= 0)))) OR (((1 <= p176)) AND ((p55 <= 0))))))))))",
"processed_size": 183,
"rewrites": 58
},
"result":
{
"edges": 18963,
"markings": 4655,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 7
},
"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": 1783
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 3,
"adisj": 1,
"aneg": 1,
"comp": 3,
"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": "F (G (((p159 <= 0) OR (((1 <= p119)) AND ((p26 <= 0))))))",
"processed_size": 58,
"rewrites": 58
},
"result":
{
"edges": 552,
"markings": 544,
"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": 3567
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 3,
"G": 1,
"U": 1,
"X": 0,
"aconj": 8,
"adisj": 1,
"aneg": 0,
"comp": 8,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 8,
"taut": 0,
"tconj": 1,
"tdisj": 4,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "F ((((1 <= p103)) OR (F (((1 <= p103))) AND F (G ((((((p178 <= 0)) OR ((1 <= p89))) U ((1 <= p103))) OR (((p178 <= 0)) OR (((1 <= p89)) OR ((1 <= p103))))))))))",
"processed_size": 161,
"rewrites": 58
},
"result":
{
"edges": 326,
"markings": 326,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 10
},
"compoundnumber": 7,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
}
],
"exit":
{
"error": null,
"memory": 28368,
"runtime": 3.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "LTLCardinality.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "X(F(**)) : (X(*) OR (G(F(*)) AND X(F(*)))) : F((** OR (F(**) AND F(G(((** U **) OR (** OR (** OR **)))))))) : X(X(X(G(**)))) : X((G(**) OR **)) : X((X(X(G(**))) OR F(**))) : F(G(*)) : X(F((X(F(*)) AND (G(F(*)) OR G(F((X(*) OR *)))))))"
},
"net":
{
"arcs": 730,
"conflict_clusters": 53,
"places": 198,
"places_significant": 149,
"singleton_clusters": 0,
"transitions": 176
},
"result":
{
"preliminary_value": "yes yes no no yes yes no no ",
"value": "yes yes no no yes yes 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: 374/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 198
lola: finding significant places
lola: 198 places, 176 transitions, 149 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: LP says that atomic proposition is always true: (p189 <= 1)
lola: LP says that atomic proposition is always true: (p188 <= 1)
lola: LP says that atomic proposition is always true: (p180 <= 1)
lola: LP says that atomic proposition is always true: (p89 <= 1)
lola: LP says that atomic proposition is always true: (p103 <= 1)
lola: LP says that atomic proposition is always true: (p89 <= 1)
lola: LP says that atomic proposition is always true: (p103 <= 1)
lola: LP says that atomic proposition is always true: (p103 <= 1)
lola: LP says that atomic proposition is always true: (p26 <= 1)
lola: LP says that atomic proposition is always true: (p177 <= 1)
lola: LP says that atomic proposition is always true: (p140 <= 1)
lola: LP says that atomic proposition is always true: (p168 <= 1)
lola: LP says that atomic proposition is always true: (p165 <= 1)
lola: LP says that atomic proposition is always true: (p143 <= 1)
lola: LP says that atomic proposition is always true: (p159 <= 1)
lola: LP says that atomic proposition is always true: (p26 <= 1)
lola: LP says that atomic proposition is always true: (p55 <= 1)
lola: LP says that atomic proposition is always true: (p55 <= 1)
lola: LP says that atomic proposition is always true: (p55 <= 1)
lola: F (X (((1 <= p189)))) : (F (NOT(G (F (G ((((p42 <= 0)) OR ((1 <= p188)))))))) U NOT(X (((1 <= p180))))) : F ((F (G (X (G ((((((((p178 <= 0)) OR ((1 <= p89))) U ((1 <= p103))) OR ((p178 <= 0))) OR ((1 <= p89))) OR ((1 <= p103))))))) U ((1 <= p103)))) : X (NOT(X (X (NOT(G ((((1 <= p26)) OR ((p188 <= 0)) OR ((1 <= p177))))))))) : (X (G (((1 <= p140)))) OR X ((((p48 <= 0)) OR ((1 <= p168))))) : X ((X (G (X ((((1 <= p67)) AND ((p165 <= 0)))))) OR ((0 <= 0) U (((p65 <= 0)) OR ((1 <= p143)))))) : F (X (G (NOT(X (((1 <= p159) AND (((p119 <= 0)) OR ((1 <= p26))))))))) : NOT(G (X ((F (G ((X ((((p176 <= 0)) OR ((1 <= p55)))) AND (((p176 <= 0)) OR ((1 <= p55)))))) U G (((1 <= 0) U X ((((p176 <= 0)) OR ((1 <= p55))))))))))
lola: rewrite Frontend/Parser/formula_rewrite.k:356
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:371
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:353
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:428
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:528
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:169
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:356
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:98
lola: rewrite Frontend/Parser/formula_rewrite.k:185
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:428
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 445 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (F (((1 <= p189))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (F (((1 <= p189))))
lola: processed formula length: 21
lola: 58 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: 2955 markings, 8046 edges
lola: ========================================
lola: subprocess 1 will run for 509 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (X (((p180 <= 0))) OR (G (F ((((1 <= p42)) AND ((p188 <= 0))))) AND X (F (((p180 <= 0))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 1 will run for 509 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (F ((((1 <= p42)) AND ((p188 <= 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 ((((1 <= p42)) AND ((p188 <= 0)))))
lola: processed formula length: 40
lola: 58 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: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 1976 markings, 2817 edges
lola: ========================================
lola: subprocess 2 will run for 594 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (((p180 <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (((p180 <= 0)))
lola: processed formula length: 17
lola: 58 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: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 2 will run for 594 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (X (X (G ((((1 <= p26)) OR ((p188 <= 0)) OR ((1 <= p177)))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (X (X (G ((((1 <= p26)) OR ((p188 <= 0)) OR ((1 <= p177)))))))
lola: processed formula length: 66
lola: 58 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: 233 markings, 233 edges
lola: ========================================
lola: subprocess 3 will run for 713 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((G (((1 <= p140))) OR (((p48 <= 0)) OR ((1 <= p168)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((G (((1 <= p140))) OR (((p48 <= 0)) OR ((1 <= p168)))))
lola: processed formula length: 59
lola: 58 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: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 2 markings, 1 edges
lola: ========================================
lola: subprocess 4 will run for 891 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((X (X (G ((((1 <= p67)) AND ((p165 <= 0)))))) OR F ((((p65 <= 0)) OR ((1 <= p143))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((X (X (G ((((1 <= p67)) AND ((p165 <= 0)))))) OR F ((((p65 <= 0)) OR ((1 <= p143))))))
lola: processed formula length: 90
lola: 58 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 5 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 38656 markings, 182805 edges
lola: ========================================
lola: subprocess 5 will run for 1189 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (F ((X (F ((((1 <= p176)) AND ((p55 <= 0))))) AND (G (F ((((1 <= p176)) AND ((p55 <= 0))))) OR G (F ((X ((((1 <= p176)) AND ((p55 <= 0)))) OR (((1 <= p176)) AND ((p55 <= 0))))))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (F ((X (F ((((1 <= p176)) AND ((p55 <= 0))))) AND (G (F ((((1 <= p176)) AND ((p55 <= 0))))) OR G (F ((X ((((1 <= p176)) AND ((p55 <= 0)))) OR (((1 <= p176)) AND ((p55 <= 0))))))))))
lola: processed formula length: 183
lola: 58 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 7 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: 4655 markings, 18963 edges
lola: ========================================
lola: subprocess 6 will run for 1783 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G (((p159 <= 0) OR (((1 <= p119)) AND ((p26 <= 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 (((p159 <= 0) OR (((1 <= p119)) AND ((p26 <= 0))))))
lola: processed formula length: 58
lola: 58 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 142
lola: add low 143
lola: add low 141
lola: add low 140
lola: add low 139
lola: add low 146
lola: add low 147
lola: add low 145
lola: add low 144
lola: add low 122
lola: add low 118
lola: add low 119
lola: add low 18
lola: add low 22
lola: add low 67
lola: add low 23
lola: add low 21
lola: add low 20
lola: add low 26
lola: add low 27
lola: add low 25
lola: add low 24
lola: add low 19
lola: add low 49
lola: add low 54
lola: add low 55
lola: add low 53
lola: add low 52
lola: add low 58
lola: add low 59
lola: add low 57
lola: add low 56
lola: add low 50
lola: add low 16
lola: add low 51
lola: add low 175
lola: add low 174
lola: add low 48
lola: add low 34
lola: add low 35
lola: add low 33
lola: add low 32
lola: add low 30
lola: add low 31
lola: add low 29
lola: add low 28
lola: add low 17
lola: add low 68
lola: add low 73
lola: add low 74
lola: add low 72
lola: add low 71
lola: add low 86
lola: add low 87
lola: add low 85
lola: add low 84
lola: add low 83
lola: add low 90
lola: add low 91
lola: add low 89
lola: add low 88
lola: add low 64
lola: add low 65
lola: add low 36
lola: add low 37
lola: add low 42
lola: add low 123
lola: add low 43
lola: add low 41
lola: add low 40
lola: add low 46
lola: add low 47
lola: add low 45
lola: add low 44
lola: add low 38
lola: add low 173
lola: add low 172
lola: add low 39
lola: add low 150
lola: add low 161
lola: add low 162
lola: add low 160
lola: add low 159
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: 544 markings, 552 edges
lola: ========================================
lola: subprocess 7 will run for 3567 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((((1 <= p103)) OR (F (((1 <= p103))) AND F (G ((((((p178 <= 0)) OR ((1 <= p89))) U ((1 <= p103))) OR (((p178 <= 0)) OR (((1 <= p89)) OR ((1 <= p103))))))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F ((((1 <= p103)) OR (F (((1 <= p103))) AND F (G ((((((p178 <= 0)) OR ((1 <= p89))) U ((1 <= p103))) OR (((p178 <= 0)) OR (((1 <= p89)) OR ((1 <= p103))))))))))
lola: processed formula length: 161
lola: 58 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: 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: 326 markings, 326 edges
lola: ========================================
lola: RESULT
lola:
SUMMARY: yes yes no no yes yes no no
lola:
preliminary result: yes yes no no yes yes no no
lola: memory consumption: 28368 KB
lola: time consumption: 3 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="ParamProductionCell-PT-0"
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 ParamProductionCell-PT-0, 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 r151-tall-162089151200181"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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