Execution Chart

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

Trace from the execution

Formatting '/data/fko/mcc2021-input.r170-oct2-162089287300221.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fko/mcc2021-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.......................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool gold2020
Input is PolyORBNT-PT-S05J20, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r170-oct2-162089287300221
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 3.7M
-rw-r--r-- 1 mcc users 57K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 260K May 10 09:43 CTLCardinality.xml
-rw-r--r-- 1 mcc users 286K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 1.2M 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.5K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 10K Mar 28 16:27 LTLCardinality.txt
-rw-r--r-- 1 mcc users 42K Mar 28 16:27 LTLCardinality.xml
-rw-r--r-- 1 mcc users 39K Mar 28 16:27 LTLFireability.txt
-rw-r--r-- 1 mcc users 129K Mar 28 16:27 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.8K Mar 27 09:31 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 35K Mar 27 09:31 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 21K Mar 25 12:18 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 63K Mar 25 12:18 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 3.0K Mar 22 08:12 UpperBounds.txt
-rw-r--r-- 1 mcc users 6.3K Mar 22 08:12 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 5 16:51 equiv_col
-rw-r--r-- 1 mcc users 7 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 1.6M 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 PolyORBNT-PT-S05J20-00
FORMULA_NAME PolyORBNT-PT-S05J20-01
FORMULA_NAME PolyORBNT-PT-S05J20-02
FORMULA_NAME PolyORBNT-PT-S05J20-03
FORMULA_NAME PolyORBNT-PT-S05J20-04
FORMULA_NAME PolyORBNT-PT-S05J20-05
FORMULA_NAME PolyORBNT-PT-S05J20-06
FORMULA_NAME PolyORBNT-PT-S05J20-07
FORMULA_NAME PolyORBNT-PT-S05J20-08
FORMULA_NAME PolyORBNT-PT-S05J20-09
FORMULA_NAME PolyORBNT-PT-S05J20-10
FORMULA_NAME PolyORBNT-PT-S05J20-11
FORMULA_NAME PolyORBNT-PT-S05J20-12
FORMULA_NAME PolyORBNT-PT-S05J20-13
FORMULA_NAME PolyORBNT-PT-S05J20-14
FORMULA_NAME PolyORBNT-PT-S05J20-15

=== Now, execution of the tool begins

BK_START 1621388170450

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2021-05-19 01:36:11] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -timeout, 3600, -rebuildPNML]
[2021-05-19 01:36:11] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-19 01:36:12] [INFO ] Load time of PNML (sax parser for PT used): 114 ms
[2021-05-19 01:36:12] [INFO ] Transformed 349 places.
[2021-05-19 01:36:12] [INFO ] Transformed 1210 transitions.
[2021-05-19 01:36:12] [INFO ] Parsed PT model containing 349 places and 1210 transitions in 155 ms.
Ensure Unique test removed 655 transitions
Reduce redundant transitions removed 655 transitions.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 33 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100000 steps, including 6847 resets, run finished after 463 ms. (steps per millisecond=215 ) properties seen :[0, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 0, 0, 1, 0, 1, 1, 1, 0, 1, 1, 1, 1, 1, 0, 1, 1, 0, 1, 1, 1, 1, 1, 0, 1, 0, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 0]
[2021-05-19 01:36:12] [INFO ] Flow matrix only has 551 transitions (discarded 4 similar events)
// Phase 1: matrix 551 rows 349 cols
[2021-05-19 01:36:12] [INFO ] Computed 62 place invariants in 26 ms
[2021-05-19 01:36:12] [INFO ] [Real]Absence check using 42 positive place invariants in 10 ms returned unsat
[2021-05-19 01:36:12] [INFO ] [Real]Absence check using 42 positive place invariants in 19 ms returned sat
[2021-05-19 01:36:12] [INFO ] [Real]Absence check using 42 positive and 20 generalized place invariants in 16 ms returned sat
[2021-05-19 01:36:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-19 01:36:13] [INFO ] [Real]Absence check using state equation in 508 ms returned sat
[2021-05-19 01:36:13] [INFO ] Solution in real domain found non-integer solution.
[2021-05-19 01:36:13] [INFO ] [Nat]Absence check using 42 positive place invariants in 18 ms returned sat
[2021-05-19 01:36:13] [INFO ] [Nat]Absence check using 42 positive and 20 generalized place invariants in 13 ms returned sat
[2021-05-19 01:36:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-19 01:36:14] [INFO ] [Nat]Absence check using state equation in 864 ms returned unsat
[2021-05-19 01:36:14] [INFO ] [Real]Absence check using 42 positive place invariants in 3 ms returned unsat
[2021-05-19 01:36:14] [INFO ] [Real]Absence check using 42 positive place invariants in 6 ms returned unsat
[2021-05-19 01:36:14] [INFO ] [Real]Absence check using 42 positive place invariants in 3 ms returned unsat
[2021-05-19 01:36:14] [INFO ] [Real]Absence check using 42 positive place invariants in 8 ms returned unsat
[2021-05-19 01:36:14] [INFO ] [Real]Absence check using 42 positive place invariants in 14 ms returned sat
[2021-05-19 01:36:14] [INFO ] [Real]Absence check using 42 positive and 20 generalized place invariants in 7 ms returned unsat
[2021-05-19 01:36:14] [INFO ] [Real]Absence check using 42 positive place invariants in 13 ms returned sat
[2021-05-19 01:36:14] [INFO ] [Real]Absence check using 42 positive and 20 generalized place invariants in 7 ms returned unsat
[2021-05-19 01:36:14] [INFO ] [Real]Absence check using 42 positive place invariants in 3 ms returned unsat
[2021-05-19 01:36:14] [INFO ] [Real]Absence check using 42 positive place invariants in 3 ms returned unsat
[2021-05-19 01:36:14] [INFO ] [Real]Absence check using 42 positive place invariants in 14 ms returned sat
[2021-05-19 01:36:14] [INFO ] [Real]Absence check using 42 positive and 20 generalized place invariants in 10 ms returned unsat
[2021-05-19 01:36:14] [INFO ] [Real]Absence check using 42 positive place invariants in 13 ms returned sat
[2021-05-19 01:36:14] [INFO ] [Real]Absence check using 42 positive and 20 generalized place invariants in 13 ms returned unsat
Successfully simplified 12 atomic propositions for a total of 15 simplifications.
[2021-05-19 01:36:14] [INFO ] Initial state reduction rules for CTL removed 8 formulas.
[2021-05-19 01:36:14] [INFO ] Flatten gal took : 88 ms
FORMULA PolyORBNT-PT-S05J20-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBNT-PT-S05J20-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBNT-PT-S05J20-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBNT-PT-S05J20-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBNT-PT-S05J20-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBNT-PT-S05J20-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBNT-PT-S05J20-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBNT-PT-S05J20-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-19 01:36:14] [INFO ] Flatten gal took : 50 ms
[2021-05-19 01:36:14] [INFO ] Export to MCC properties in file /home/mcc/execution/LTLCardinality.sr.xml took 2 ms.
[2021-05-19 01:36:14] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 7 ms.
info: Time: 3600 - MCC
vrfy: Checking LTLCardinality @ PolyORBNT-PT-S05J20 @ 3570 seconds

FORMULA PolyORBNT-PT-S05J20-02 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA PolyORBNT-PT-S05J20-06 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA PolyORBNT-PT-S05J20-08 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA PolyORBNT-PT-S05J20-09 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA PolyORBNT-PT-S05J20-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA PolyORBNT-PT-S05J20-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA PolyORBNT-PT-S05J20-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA PolyORBNT-PT-S05J20-03 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 3551
rslt: Output for LTLCardinality @ PolyORBNT-PT-S05J20

{
"build":
{
"architecture": 64,
"assertions": false,
"build_hostname": "mcc2019",
"build_system": "x86_64-unknown-linux-gnu",
"optimizations": true,
"package_version": "2.0",
"svn_version": "3189M"
},
"call":
{
"exec_host": "mcc2020",
"markinglimit": null,
"parameters":
[
"--pnmlnet",
"model.pnml",
"--xmlformula",
"--formula=LTLCardinality.xml",
"--mcc",
"--donotcomputecapacities",
"--encoder=simplecompressed",
"--check=modelchecking",
"--stubborn=deletion",
"--stateequation=par",
"--timelimit=3570",
"--localtimelimit=0",
"--preference=force_ltl",
"--json=LTLCardinality.json",
"--jsoninclude=formula,formulastat,net"
],
"starttime": "Wed May 19 01:36:15 2021
",
"timelimit": 3570
},
"child":
[

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 444
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 5,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "F (G ((3 <= p133 + p165 + p219 + p247 + p46)))",
"processed_size": 46,
"rewrites": 33
},
"result":
{
"edges": 15,
"markings": 14,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 0,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "stabilization",
"workflow": "product automaton"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 0,
"type": "boolean"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 507
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 42,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 42,
"visible_transitions": 0
},
"processed": "G ((p100 + p106 + p122 + p172 + p174 + p192 + p210 + p215 + p224 + p235 + p242 + p255 + p302 + p303 + p65 + p63 + p45 + p20 + p23 + p81 + p89 + 1 <= p117 + p142 + p153 + p156 + p166 + p178 + p191 + p206 + p226 + p260 + p262 + p276 + p322 + p44 + p43 + p18 + p42 + p26 + p83 + p86 + p91))",
"processed_size": 287,
"rewrites": 33
},
"result":
{
"edges": 13,
"markings": 13,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 1,
"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": 592
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 4,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 86,
"taut": 0,
"tconj": 1,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 64,
"visible_transitions": 0
},
"processed": "X ((X (X ((p0 + p125 + p167 + p194 + p220 + p221 + p230 + p233 + p253 + p274 + p289 + p298 + p309 + p310 + p17 + p41 + p31 + p62 + p73 + p88 + p93 <= p76))) OR G ((X ((p0 + p125 + p167 + p194 + p220 + p221 + p230 + p233 + p253 + p274 + p289 + p298 + p309 + p310 + p17 + p41 + p31 + p62 + p73 + p88 + p93 <= p76)) AND (p117 + p142 + p153 + p156 + p166 + p178 + p191 + p206 + p226 + p260 + p262 + p276 + p322 + p44 + p43 + p18 + p42 + p26 + p83 + p86 + p91 <= p100 + p106 + p122 + p172 + p174 + p192 + p210 + p215 + p224 + p235 + p242 + p255 + p302 + p303 + p65 + p63 + p45 + p20 + p23 + p81 + p89)))))",
"processed_size": 600,
"rewrites": 33
},
"result":
{
"edges": 210,
"markings": 91,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 11
},
"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": 592
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 2,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 6,
"taut": 0,
"tconj": 1,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 6,
"visible_transitions": 0
},
"processed": "X (G (((p186 <= p95) AND (G ((p321 <= p41)) OR (p110 <= p313)))))",
"processed_size": 65,
"rewrites": 33
},
"result":
{
"edges": 66,
"markings": 50,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 4
},
"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": 710
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 0,
"U": 0,
"X": 2,
"aconj": 0,
"adisj": 0,
"aneg": 2,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 6,
"taut": 0,
"tconj": 1,
"tdisj": 2,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 6,
"visible_transitions": 0
},
"processed": "F ((X ((F ((p337 + 1 <= p145)) OR (p2 <= 0))) AND (X ((1 <= p197)) OR (p308 + 1 <= p279))))",
"processed_size": 91,
"rewrites": 33
},
"result":
{
"edges": 35,
"markings": 35,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 4
},
"compoundnumber": 3,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

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

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1183
},
"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": "(p16 <= 1)",
"processed_size": 10,
"rewrites": 35
},
"result":
{
"edges": 12,
"markings": 13,
"produced_by": "state space / EG",
"value": false
},
"task":
{
"compoundnumber": 5,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 22
},
"threads": 1,
"type": "dfs"
},
"type": "eventual_occurrence"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 4,
"type": "boolean"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1183
},
"exit":
{
"localtimelimitreached": false
},
"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": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "X (F ((p115 <= p297)))",
"processed_size": 22,
"rewrites": 33
},
"result":
{
"edges": 6,
"markings": 7,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 2
},
"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": 1775
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 1,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 2,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 6,
"taut": 0,
"tconj": 2,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "F (((1 <= p198) OR (G ((X ((p115 <= p297)) AND (p323 + 1 <= p4))) AND F ((1 <= p198)))))",
"processed_size": 88,
"rewrites": 33
},
"result":
{
"edges": 46,
"markings": 46,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 6
},
"compoundnumber": 6,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 5,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1775
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 2,
"U": 0,
"X": 3,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 5,
"taut": 0,
"tconj": 0,
"tdisj": 2,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "X (X ((G ((p110 <= p26)) OR F ((X ((p107 <= p76)) OR G (F ((p198 <= 0))))))))",
"processed_size": 77,
"rewrites": 33
},
"result":
{
"edges": 108,
"markings": 49,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 7
},
"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": 3551
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 3,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 48,
"taut": 0,
"tconj": 1,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 27,
"visible_transitions": 0
},
"processed": "F (G ((F ((1 <= p117 + p142 + p153 + p156 + p166 + p178 + p191 + p206 + p226 + p260 + p262 + p276 + p322 + p44 + p43 + p18 + p42 + p26 + p83 + p86 + p91)) AND (F ((p291 + p296 + p330 + p333 + p35 <= p138)) OR (1 <= p117 + p142 + p153 + p156 + p166 + p178 + p191 + p206 + p226 + p260 + p262 + p276 + p322 + p44 + p43 + p18 + p42 + p26 + p83 + p86 + p91)))))",
"processed_size": 356,
"rewrites": 33
},
"result":
{
"edges": 32,
"markings": 31,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 5
},
"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": 27600,
"runtime": 19.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "LTLCardinality.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "(F((X(G(**)) AND F(*))) AND F(G(**))) : F(G((F(**) AND (F(**) OR **)))) : (X((X(X(**)) OR G((X(**) AND **)))) OR (G(*) AND X(F((X(X(**)) OR G((X(**) AND **))))))) : X(G((** AND (G(**) OR **)))) : F((X((F(*) OR *)) AND (X(**) OR **))) : (X((** OR **)) AND (F(**) AND **)) : (X(F(**)) AND F((** OR (G((X(*) AND *)) AND F(**))))) : X(X((G(**) OR F((X(**) OR G(F(*)))))))"
},
"net":
{
"arcs": 3019,
"conflict_clusters": 84,
"places": 349,
"places_significant": 287,
"singleton_clusters": 0,
"transitions": 555
},
"result":
{
"preliminary_value": "no no yes no no no no yes ",
"value": "no no yes no no no no yes "
},
"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: 904/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 11168
lola: finding significant places
lola: 349 places, 555 transitions, 287 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: (F ((X (G ((3 <= p133 + p165 + p219 + p247 + p46))) AND NOT(G ((1 <= p84))))) AND F (X (G ((3 <= p133 + p165 + p219 + p247 + p46))))) : F (G ((F ((p291 + p296 + p330 + p333 + p35 <= p138)) U (1 <= p117 + p142 + p153 + p156 + p166 + p178 + p191 + p206 + p226 + p260 + p262 + p276 + p322 + p44 + p43 + p18 + p42 + p26 + p83 + p86 + p91)))) : (NOT(F ((p117 + p142 + p153 + p156 + p166 + p178 + p191 + p206 + p226 + p260 + p262 + p276 + p322 + p44 + p43 + p18 + p42 + p26 + p83 + p86 + p91 <= p100 + p106 + p122 + p172 + p174 + p192 + p210 + p215 + p224 + p235 + p242 + p255 + p302 + p303 + p65 + p63 + p45 + p20 + p23 + p81 + p89))) U X ((X (X ((p0 + p125 + p167 + p194 + p220 + p221 + p230 + p233 + p253 + p274 + p289 + p298 + p309 + p310 + p17 + p41 + p31 + p62 + p73 + p88 + p93 <= p76))) OR G ((X ((p0 + p125 + p167 + p194 + p220 + p221 + p230 + p233 + p253 + p274 + p289 + p298 + p309 + p310 + p17 + p41 + p31 + p62 + p73 + p88 + p93 <= p76)) AND (p117 + p142 + p153 + p156 + p166 + p178 + p191 + p206 + p226 + p260 + p262 + p276 + p322 + p44 + p43 + p18 + p42 + p26 + p83 + p86 + p91 <= p100 + p106 + p122 + p172 + p174 + p192 + p210 + p215 + p224 + p235 + p242 + p255 + p302 + p303 + p65 + p63 + p45 + p20 + p23 + p81 + p89)))))) : X (G (((p186 <= p95) AND (G ((p321 <= p41)) OR (p110 <= p313))))) : F ((NOT(X ((G ((p145 <= p337)) AND (1 <= p2)))) AND (X (((1 <= 0) U (1 <= p197))) OR (p308 + 1 <= p279)))) : ((X ((((1 <= 0) U (p181 <= p193)) OR (p145 <= p215))) AND F ((2 <= p16))) AND (p181 <= p193)) : (X (((0 <= 0) U (p115 <= p297))) AND F ((NOT(F ((X ((p297 + 1 <= p115)) OR (p4 <= p323)))) U (1 <= p198)))) : X ((G (X (G ((p110 <= p26)))) OR X (F ((X ((p107 <= p76)) OR G (NOT(G ((1 <= p198)))))))))
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:437
lola: rewrite Frontend/Parser/formula_rewrite.k:522
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:185
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:185
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:169
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:528
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 444 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (F ((X (G ((3 <= p133 + p165 + p219 + p247 + p46))) AND F ((p84 <= 0)))) AND F (G ((3 <= p133 + p165 + p219 + p247 + p46))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 0 will run for 444 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G ((3 <= p133 + p165 + p219 + p247 + p46)))
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 ((3 <= p133 + p165 + p219 + p247 + p46)))
lola: processed formula length: 46
lola: 33 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: 14 markings, 15 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 1 will run for 507 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (X ((X (X ((p0 + p125 + p167 + p194 + p220 + p221 + p230 + p233 + p253 + p274 + p289 + p298 + p309 + p310 + p17 + p41 + p31 + p62 + p73 + p88 + p93 <= p76))) OR G ((X ((p0 + p125 + p167 + p194 + p220 + p221 + p230 + p233 + p253 + p274 + p289 + p298 + p309 + p310 + p17 + p41 + p31 + p62 + p73 + p88 + p93 <= p76)) AND (p117 + p142 + p153 + p156 + p166 + p178 + p191 + p206 + p226 + p260 + p262 + p276... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 1 will run for 507 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G ((p100 + p106 + p122 + p172 + p174 + p192 + p210 + p215 + p224 + p235 + p242 + p255 + p302 + p303 + p65 + p63 + p45 + p20 + p23 + p81 + p89 + 1 <= p117 + p142 + p153 + p156 + p166 + p178 + p191 + p206 + p226 + p260 + p262 + p276 + p322 + p44 + p43 + p18 + p42 + p26 + p83 + p86 + p91))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((p100 + p106 + p122 + p172 + p174 + p192 + p210 + p215 + p224 + p235 + p242 + p255 + p302 + p303 + p65 + p63 + p45 + p20 + p23 + p81 + p89 + 1 <= p117 + p142 + p153 + p156 + p166 + p178 + p191 + p206 + p226 + p260 + p262 + p276 + p322 + p44 + p43 + p18 + p42 + p26 + p83 + p86 + p91))
lola: processed formula length: 287
lola: 33 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: 13 markings, 13 edges
lola: ========================================
lola: subprocess 2 will run for 592 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((X (X ((p0 + p125 + p167 + p194 + p220 + p221 + p230 + p233 + p253 + p274 + p289 + p298 + p309 + p310 + p17 + p41 + p31 + p62 + p73 + p88 + p93 <= p76))) OR G ((X ((p0 + p125 + p167 + p194 + p220 + p221 + p230 + p233 + p253 + p274 + p289 + p298 + p309 + p310 + p17 + p41 + p31 + p62 + p73 + p88 + p93 <= p76)) AND (p117 + p142 + p153 + p156 + p166 + p178 + p191 + p206 + p226 + p260 + p262 + p276 ... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((X (X ((p0 + p125 + p167 + p194 + p220 + p221 + p230 + p233 + p253 + p274 + p289 + p298 + p309 + p310 + p17 + p41 + p31 + p62 + p73 + p88 + p93 <= p76))) OR G ((X ((p0 + p125 + p167 + p194 + p220 + p221 + p230 + p233 + p253 + p274 + p289 + p298 + p309 + p310 + p17 + p41 + p31 + p62 + p73 + p88 + p93 <= p76)) AND (p117 + p142 + p153 + p156 + p166 + p178 + p191 + p206 + p226 + p260 + p262 + p276 ... (shortened)
lola: processed formula length: 600
lola: 33 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 11 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 91 markings, 210 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 2 will run for 592 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (G (((p186 <= p95) AND (G ((p321 <= p41)) OR (p110 <= p313)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (G (((p186 <= p95) AND (G ((p321 <= p41)) OR (p110 <= p313)))))
lola: processed formula length: 65
lola: 33 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: 50 markings, 66 edges
lola: ========================================
lola: subprocess 3 will run for 710 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((X ((F ((p337 + 1 <= p145)) OR (p2 <= 0))) AND (X ((1 <= p197)) OR (p308 + 1 <= p279))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F ((X ((F ((p337 + 1 <= p145)) OR (p2 <= 0))) AND (X ((1 <= p197)) OR (p308 + 1 <= p279))))
lola: processed formula length: 91
lola: 33 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: 35 markings, 35 edges
lola: ========================================
lola: subprocess 4 will run for 888 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (X (((p181 <= p193) OR (p145 <= p215))) AND (F ((2 <= p16)) AND (p181 <= p193)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 4 will run for 888 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (p181 <= p193)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p181 <= p193)
lola: processed formula length: 14
lola: 33 rewrites
lola: closed formula file LTLCardinality.xml
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 5 will run for 1183 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((2 <= p16))
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: (p16 <= 1)
lola: processed formula length: 10
lola: 35 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: 13 markings, 12 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 5 will run for 1183 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (X (F ((p115 <= p297))) AND F (((1 <= p198) OR (G ((X ((p115 <= p297)) AND (p323 + 1 <= p4))) AND F ((1 <= p198))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 5 will run for 1183 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (F ((p115 <= p297)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (F ((p115 <= p297)))
lola: processed formula length: 22
lola: 33 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: 7 markings, 6 edges
lola: ========================================
lola: subprocess 6 will run for 1775 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (((1 <= p198) OR (G ((X ((p115 <= p297)) AND (p323 + 1 <= p4))) AND F ((1 <= p198)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F (((1 <= p198) OR (G ((X ((p115 <= p297)) AND (p323 + 1 <= p4))) AND F ((1 <= p198)))))
lola: processed formula length: 88
lola: 33 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 6 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 46 markings, 46 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 6 will run for 1775 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (X ((G ((p110 <= p26)) OR F ((X ((p107 <= p76)) OR G (F ((p198 <= 0))))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (X ((G ((p110 <= p26)) OR F ((X ((p107 <= p76)) OR G (F ((p198 <= 0))))))))
lola: processed formula length: 77
lola: 33 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: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 49 markings, 108 edges
lola: ========================================
lola: subprocess 7 will run for 3551 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G ((F ((1 <= p117 + p142 + p153 + p156 + p166 + p178 + p191 + p206 + p226 + p260 + p262 + p276 + p322 + p44 + p43 + p18 + p42 + p26 + p83 + p86 + p91)) AND (F ((p291 + p296 + p330 + p333 + p35 <= p138)) OR (1 <= p117 + p142 + p153 + p156 + p166 + p178 + p191 + p206 + p226 + p260 + p262 + p276 + p322 + p44 + p43 + p18 + p42 + p26 + p83 + p86 + p91)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F (G ((F ((1 <= p117 + p142 + p153 + p156 + p166 + p178 + p191 + p206 + p226 + p260 + p262 + p276 + p322 + p44 + p43 + p18 + p42 + p26 + p83 + p86 + p91)) AND (F ((p291 + p296 + p330 + p333 + p35 <= p138)) OR (1 <= p117 + p142 + p153 + p156 + p166 + p178 + p191 + p206 + p226 + p260 + p262 + p276 + p322 + p44 + p43 + p18 + p42 + p26 + p83 + p86 + p91)))))
lola: processed formula length: 356
lola: 33 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: 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: 31 markings, 32 edges
lola: ========================================
lola: RESULT
lola:
SUMMARY: no no yes no no no no yes
lola:
preliminary result: no no yes no no no no yes
lola: memory consumption: 27600 KB
lola: time consumption: 19 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="PolyORBNT-PT-S05J20"
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 PolyORBNT-PT-S05J20, 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 r170-oct2-162089287300221"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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