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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.1M
-rw-r--r-- 1 mcc users 79K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 360K May 10 09:43 CTLCardinality.xml
-rw-r--r-- 1 mcc users 52K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 257K 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 8.4K Mar 28 16:24 LTLCardinality.txt
-rw-r--r-- 1 mcc users 38K Mar 28 16:24 LTLCardinality.xml
-rw-r--r-- 1 mcc users 6.8K Mar 28 16:24 LTLFireability.txt
-rw-r--r-- 1 mcc users 31K Mar 28 16:24 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.4K Mar 27 06:59 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 28K Mar 27 06:59 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.5K Mar 25 08:19 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 38K Mar 25 08:19 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.8K Mar 22 09:15 UpperBounds.txt
-rw-r--r-- 1 mcc users 6.1K Mar 22 09:15 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 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 100K 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 Peterson-PT-2-00
FORMULA_NAME Peterson-PT-2-01
FORMULA_NAME Peterson-PT-2-02
FORMULA_NAME Peterson-PT-2-03
FORMULA_NAME Peterson-PT-2-04
FORMULA_NAME Peterson-PT-2-05
FORMULA_NAME Peterson-PT-2-06
FORMULA_NAME Peterson-PT-2-07
FORMULA_NAME Peterson-PT-2-08
FORMULA_NAME Peterson-PT-2-09
FORMULA_NAME Peterson-PT-2-10
FORMULA_NAME Peterson-PT-2-11
FORMULA_NAME Peterson-PT-2-12
FORMULA_NAME Peterson-PT-2-13
FORMULA_NAME Peterson-PT-2-14
FORMULA_NAME Peterson-PT-2-15

=== Now, execution of the tool begins

BK_START 1621024531766

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2021-05-14 20:35:33] [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 20:35:33] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-14 20:35:33] [INFO ] Load time of PNML (sax parser for PT used): 128 ms
[2021-05-14 20:35:33] [INFO ] Transformed 102 places.
[2021-05-14 20:35:33] [INFO ] Transformed 126 transitions.
[2021-05-14 20:35:33] [INFO ] Found NUPN structural information;
[2021-05-14 20:35:33] [INFO ] Parsed PT model containing 102 places and 126 transitions in 168 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 319 ms. (steps per millisecond=313 ) properties seen :[1, 1, 1, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 0, 0, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 0, 1, 1, 1, 0, 0, 0, 1, 1]
[2021-05-14 20:35:33] [INFO ] Flow matrix only has 120 transitions (discarded 6 similar events)
// Phase 1: matrix 120 rows 102 cols
[2021-05-14 20:35:33] [INFO ] Computed 11 place invariants in 6 ms
[2021-05-14 20:35:33] [INFO ] [Real]Absence check using 8 positive place invariants in 14 ms returned unsat
[2021-05-14 20:35:33] [INFO ] [Real]Absence check using 8 positive place invariants in 6 ms returned unsat
[2021-05-14 20:35:34] [INFO ] [Real]Absence check using 8 positive place invariants in 5 ms returned unsat
[2021-05-14 20:35:34] [INFO ] [Real]Absence check using 8 positive place invariants in 6 ms returned unsat
[2021-05-14 20:35:34] [INFO ] [Real]Absence check using 8 positive place invariants in 6 ms returned sat
[2021-05-14 20:35:34] [INFO ] [Real]Absence check using 8 positive and 3 generalized place invariants in 1 ms returned sat
[2021-05-14 20:35:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 20:35:34] [INFO ] [Real]Absence check using state equation in 51 ms returned sat
[2021-05-14 20:35:34] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 20:35:34] [INFO ] [Nat]Absence check using 8 positive place invariants in 9 ms returned unsat
[2021-05-14 20:35:34] [INFO ] [Real]Absence check using 8 positive place invariants in 6 ms returned sat
[2021-05-14 20:35:34] [INFO ] [Real]Absence check using 8 positive and 3 generalized place invariants in 1 ms returned sat
[2021-05-14 20:35:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 20:35:34] [INFO ] [Real]Absence check using state equation in 51 ms returned sat
[2021-05-14 20:35:34] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 20:35:34] [INFO ] [Nat]Absence check using 8 positive place invariants in 6 ms returned unsat
[2021-05-14 20:35:34] [INFO ] [Real]Absence check using 8 positive place invariants in 6 ms returned sat
[2021-05-14 20:35:34] [INFO ] [Real]Absence check using 8 positive and 3 generalized place invariants in 1 ms returned sat
[2021-05-14 20:35:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 20:35:34] [INFO ] [Real]Absence check using state equation in 50 ms returned sat
[2021-05-14 20:35:34] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 20:35:34] [INFO ] [Nat]Absence check using 8 positive place invariants in 8 ms returned unsat
[2021-05-14 20:35:34] [INFO ] [Real]Absence check using 8 positive place invariants in 6 ms returned sat
[2021-05-14 20:35:34] [INFO ] [Real]Absence check using 8 positive and 3 generalized place invariants in 1 ms returned sat
[2021-05-14 20:35:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 20:35:34] [INFO ] [Real]Absence check using state equation in 44 ms returned sat
[2021-05-14 20:35:34] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 20:35:34] [INFO ] [Nat]Absence check using 8 positive place invariants in 14 ms returned sat
[2021-05-14 20:35:34] [INFO ] [Nat]Absence check using 8 positive and 3 generalized place invariants in 1 ms returned sat
[2021-05-14 20:35:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 20:35:34] [INFO ] [Nat]Absence check using state equation in 50 ms returned sat
[2021-05-14 20:35:34] [INFO ] State equation strengthened by 26 read => feed constraints.
[2021-05-14 20:35:34] [INFO ] [Nat]Added 26 Read/Feed constraints in 4 ms returned sat
[2021-05-14 20:35:34] [INFO ] Deduced a trap composed of 12 places in 59 ms
[2021-05-14 20:35:34] [INFO ] Deduced a trap composed of 11 places in 33 ms
[2021-05-14 20:35:34] [INFO ] Deduced a trap composed of 8 places in 41 ms
[2021-05-14 20:35:34] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 166 ms
[2021-05-14 20:35:34] [INFO ] Computed and/alt/rep : 123/264/117 causal constraints in 7 ms.
[2021-05-14 20:35:34] [INFO ] Added : 110 causal constraints over 23 iterations in 230 ms. Result :sat
[2021-05-14 20:35:35] [INFO ] [Real]Absence check using 8 positive place invariants in 5 ms returned sat
[2021-05-14 20:35:35] [INFO ] [Real]Absence check using 8 positive and 3 generalized place invariants in 2 ms returned sat
[2021-05-14 20:35:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 20:35:35] [INFO ] [Real]Absence check using state equation in 46 ms returned sat
[2021-05-14 20:35:35] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 20:35:35] [INFO ] [Nat]Absence check using 8 positive place invariants in 7 ms returned unsat
[2021-05-14 20:35:35] [INFO ] [Real]Absence check using 8 positive place invariants in 6 ms returned sat
[2021-05-14 20:35:35] [INFO ] [Real]Absence check using 8 positive and 3 generalized place invariants in 1 ms returned sat
[2021-05-14 20:35:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 20:35:35] [INFO ] [Real]Absence check using state equation in 45 ms returned sat
[2021-05-14 20:35:35] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 20:35:35] [INFO ] [Nat]Absence check using 8 positive place invariants in 6 ms returned unsat
[2021-05-14 20:35:35] [INFO ] [Real]Absence check using 8 positive place invariants in 6 ms returned sat
[2021-05-14 20:35:35] [INFO ] [Real]Absence check using 8 positive and 3 generalized place invariants in 1 ms returned sat
[2021-05-14 20:35:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 20:35:35] [INFO ] [Real]Absence check using state equation in 46 ms returned sat
[2021-05-14 20:35:35] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 20:35:35] [INFO ] [Nat]Absence check using 8 positive place invariants in 6 ms returned unsat
Successfully simplified 10 atomic propositions for a total of 13 simplifications.
[2021-05-14 20:35:35] [INFO ] Initial state reduction rules for CTL removed 5 formulas.
[2021-05-14 20:35:35] [INFO ] Flatten gal took : 35 ms
FORMULA Peterson-PT-2-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Peterson-PT-2-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Peterson-PT-2-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Peterson-PT-2-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Peterson-PT-2-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-14 20:35:35] [INFO ] Applying decomposition
[2021-05-14 20:35:35] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2021-05-14 20:35:35] [INFO ] Flatten gal took : 13 ms
[2021-05-14 20:35:35] [INFO ] Decomposing Gal with order
[2021-05-14 20:35:35] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-14 20:35:35] [INFO ] Removed a total of 57 redundant transitions.
[2021-05-14 20:35:35] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2021-05-14 20:35:35] [INFO ] Flatten gal took : 39 ms
[2021-05-14 20:35:35] [INFO ] Fuse similar labels procedure discarded/fused a total of 20 labels/synchronizations in 4 ms.
[2021-05-14 20:35:35] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA Peterson-PT-2-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-14 20:35:35] [INFO ] Export to MCC properties in file /home/mcc/execution/LTLCardinality.sr.xml took 3 ms.
[2021-05-14 20:35:35] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 3 ms.
info: Time: 3600 - MCC
vrfy: Checking LTLCardinality @ Peterson-PT-2 @ 3570 seconds

FORMULA Peterson-PT-2-01 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Peterson-PT-2-06 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Peterson-PT-2-08 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Peterson-PT-2-09 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Peterson-PT-2-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Peterson-PT-2-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Peterson-PT-2-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Peterson-PT-2-07 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Peterson-PT-2-00 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Peterson-PT-2-04 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 3567
rslt: Output for LTLCardinality @ Peterson-PT-2

{
"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 20:35:36 2021
",
"timelimit": 3570
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 356
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 2,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 30,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 30,
"visible_transitions": 0
},
"processed": "G ((X ((2 <= p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p18)) AND G ((p45 + p49 + p50 + p51 + p52 + p53 + p54 + p55 + p56 + p58 + p59 + p60 <= 1))))",
"processed_size": 197,
"rewrites": 44
},
"result":
{
"edges": 22,
"markings": 22,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 4
},
"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": 396
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 0,
"U": 3,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 6,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 63,
"taut": 0,
"tconj": 1,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 45,
"visible_transitions": 0
},
"processed": "((((p57 + p61 + p65 + p66 + p67 + p68 <= 0) U ((p101 + p94 + p93 <= p23 + p25 + p26 + p27 + p28 + p29 + p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39 + p40 + p43) U (1 <= p57 + p61 + p65 + p66 + p67 + p68))) OR (X (F ((p45 + p49 + p50 + p51 + p52 + p53 + p54 + p55 + p56 + p58 + p59 + p60 <= 0))) AND (1 <= p45 + p49 + p50 + p51 + p52 + p53 + p54 + p55 + p56 + p58 + p59 + p60))) U (2 <= p100 + p98 + p96 + p95 + p97 + p99))",
"processed_size": 436,
"rewrites": 44
},
"result":
{
"edges": 336,
"markings": 236,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 7
},
"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": 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 <= p86))))",
"processed_size": 20,
"rewrites": 44
},
"result":
{
"edges": 25,
"markings": 25,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 2,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 509
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 2,
"U": 0,
"X": 3,
"aconj": 6,
"adisj": 2,
"aneg": 3,
"comp": 6,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 6,
"taut": 0,
"tconj": 2,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "X (F ((X (G ((((1 <= p89)) AND ((p21 <= 0))))) R (X (G ((((p35 <= 0)) OR ((1 <= p96))))) AND (((1 <= p35)) AND ((p96 <= 0)))))))",
"processed_size": 129,
"rewrites": 44
},
"result":
{
"edges": 164,
"markings": 126,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 10
},
"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": 594
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 1,
"aconj": 4,
"adisj": 1,
"aneg": 0,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 0,
"tdisj": 2,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "X ((G ((((p22 <= 0)) OR ((1 <= p87)))) OR (((p53 <= 0)) OR ((1 <= p44)))))",
"processed_size": 75,
"rewrites": 44
},
"result":
{
"edges": 3,
"markings": 4,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 4
},
"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": 713
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 0,
"U": 1,
"X": 1,
"aconj": 5,
"adisj": 2,
"aneg": 0,
"comp": 5,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 5,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "F ((X (((1 <= p44))) AND ((((p101 <= 0)) OR ((1 <= p99))) U (((p65 <= 0)) OR ((1 <= p80))))))",
"processed_size": 95,
"rewrites": 44
},
"result":
{
"edges": 32,
"markings": 32,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"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": 891
},
"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": "F (G ((((1 <= p49)) AND ((p19 <= 0)))))",
"processed_size": 39,
"rewrites": 44
},
"result":
{
"edges": 77,
"markings": 73,
"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": 1189
},
"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": 9,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 9,
"visible_transitions": 0
},
"processed": "F (G ((p17 + p19 + p20 + p21 + p22 + p24 + 1 <= p88 + p87 + p85)))",
"processed_size": 66,
"rewrites": 44
},
"result":
{
"edges": 30,
"markings": 29,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 7,
"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": 1783
},
"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": 18,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 18,
"visible_transitions": 0
},
"processed": "G (F ((1 <= p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p18)))",
"processed_size": 110,
"rewrites": 44
},
"result":
{
"edges": 31,
"markings": 31,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 8,
"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": 3567
},
"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": 60,
"taut": 0,
"tconj": 1,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 39,
"visible_transitions": 0
},
"processed": "F (G ((F ((p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p18 <= p88 + p87 + p85)) AND ((1 <= p62 + p63 + p64 + p69 + p70 + p71 + p72 + p73 + p74 + p75 + p76 + p77 + p78 + p80 + p81 + p82 + p83 + p84) OR (p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p18 <= p88 + p87 + p85)))))",
"processed_size": 369,
"rewrites": 44
},
"result":
{
"edges": 27,
"markings": 26,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 9,
"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": 25716,
"runtime": 3.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "LTLCardinality.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "G(F(**)) : G((X(**) AND G(*))) : F(G((F(**) AND (** OR **)))) : (((** U (** U **)) OR (X(F(**)) AND **)) U **) : F(G(**)) : X(F(**)) : X(F((X(G(*)) R (X(G(**)) AND (* AND *))))) : X((G(**) OR (** OR **))) : F((X(**) AND (** U **))) : F(G(*))"
},
"net":
{
"arcs": 384,
"conflict_clusters": 65,
"places": 102,
"places_significant": 91,
"singleton_clusters": 0,
"transitions": 126
},
"result":
{
"preliminary_value": "no no no no no no no yes no no ",
"value": "no no no no no no no 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: 228/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 102
lola: finding significant places
lola: 102 places, 126 transitions, 91 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: (p86 <= 1)
lola: LP says that atomic proposition is always true: (p86 <= 1)
lola: LP says that atomic proposition is always true: (p21 <= 1)
lola: LP says that atomic proposition is always true: (p96 <= 1)
lola: LP says that atomic proposition is always true: (p96 <= 1)
lola: LP says that atomic proposition is always true: (p87 <= 1)
lola: LP says that atomic proposition is always true: (p44 <= 1)
lola: LP says that atomic proposition is always true: (p44 <= 1)
lola: LP says that atomic proposition is always true: (p99 <= 1)
lola: LP says that atomic proposition is always true: (p80 <= 1)
lola: LP says that atomic proposition is always true: (p19 <= 1)
lola: G (F ((1 <= p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p18))) : NOT(F ((NOT(X ((2 <= p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p18))) OR F ((2 <= p45 + p49 + p50 + p51 + p52 + p53 + p54 + p55 + p56 + p58 + p59 + p60))))) : F (((X (G ((1 <= p17 + p19 + p20 + p21 + p22 + p24))) OR (1 <= p62 + p63 + p64 + p69 + p70 + p71 + p72 + p73 + p74 + p75 + p76 + p77 + p78 + p80 + p81 + p82 + p83 + p84)) U F (G (((1 <= p62 + p63 + p64 + p69 + p70 + p71 + p72 + p73 + p74 + p75 + p76 + p77 + p78 + p80 + p81 + p82 + p83 + p84) U (p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p18 <= p88 + p87 + p85)))))) : ((((p57 + p61 + p65 + p66 + p67 + p68 <= 0) U ((p101 + p94 + p93 <= p23 + p25 + p26 + p27 + p28 + p29 + p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39 + p40 + p43) U (1 <= p57 + p61 + p65 + p66 + p67 + p68))) OR (X (F ((p45 + p49 + p50 + p51 + p52 + p53 + p54 + p55 + p56 + p58 + p59 + p60 <= 0))) AND (1 <= p45 + p49 + p50 + p51 + p52 + p53 + p54 + p55 + p56 + p58 + p59 + p60))) U (2 <= p100 + p98 + p96 + p95 + p97 + p99)) : F (G ((p17 + p19 + p20 + p21 + p22 + p24 + 1 <= p88 + p87 + p85))) : (X ((((1 <= p86)) U (0 <= 0))) U X (((1 <= p86)))) : F (NOT(X ((F (X ((((p89 <= 0)) OR ((1 <= p21))))) U ((X (NOT(G ((((p35 <= 0)) OR ((1 <= p96)))))) OR ((p35 <= 0))) OR ((1 <= p96))))))) : X (((G ((((p22 <= 0)) OR ((1 <= p87)))) OR ((p53 <= 0))) OR ((1 <= p44)))) : F ((X (((1 <= p44))) AND ((((p101 <= 0)) OR ((1 <= p99))) U (((p65 <= 0)) OR ((1 <= p80)))))) : F (X (X (NOT(F (X ((((p49 <= 0)) OR ((1 <= p19)))))))))
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
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:300
lola: rewrite Frontend/Parser/formula_rewrite.k:332
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:422
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:166
lola: rewrite Frontend/Parser/formula_rewrite.k:410
lola: rewrite Frontend/Parser/formula_rewrite.k:169
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:338
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:318
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:318
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G ((X ((2 <= p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p18)) AND G ((p45 + p49 + p50 + p51 + p52 + p53 + p54 + p55 + p56 + p58 + p59 + p60 <= 1))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((X ((2 <= p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p18)) AND G ((p45 + p49 + p50 + p51 + p52 + p53 + p54 + p55 + p56 + p58 + p59 + p60 <= 1))))
lola: processed formula length: 197
lola: 44 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: 22 markings, 22 edges
lola: ========================================
lola: subprocess 1 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((((p57 + p61 + p65 + p66 + p67 + p68 <= 0) U ((p101 + p94 + p93 <= p23 + p25 + p26 + p27 + p28 + p29 + p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39 + p40 + p43) U (1 <= p57 + p61 + p65 + p66 + p67 + p68))) OR (X (F ((p45 + p49 + p50 + p51 + p52 + p53 + p54 + p55 + p56 + p58 + p59 + p60 <= 0))) AND (1 <= p45 + p49 + p50 + p51 + p52 + p53 + p54 + p55 + p56 + p58 + p59 + p60))) U (2 <= ... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: ((((p57 + p61 + p65 + p66 + p67 + p68 <= 0) U ((p101 + p94 + p93 <= p23 + p25 + p26 + p27 + p28 + p29 + p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39 + p40 + p43) U (1 <= p57 + p61 + p65 + p66 + p67 + p68))) OR (X (F ((p45 + p49 + p50 + p51 + p52 + p53 + p54 + p55 + p56 + p58 + p59 + p60 <= 0))) AND (1 <= p45 + p49 + p50 + p51 + p52 + p53 + p54 + p55 + p56 + p58 + p59 + p60))) U (2 <= ... (shortened)
lola: processed formula length: 436
lola: 44 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: 236 markings, 336 edges
lola: ========================================
lola: subprocess 2 will run for 445 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (F (((1 <= p86))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (F (((1 <= p86))))
lola: processed formula length: 20
lola: 44 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: 25 markings, 25 edges
lola: ========================================
lola: subprocess 3 will run for 509 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (F ((X (G ((((1 <= p89)) AND ((p21 <= 0))))) R (X (G ((((p35 <= 0)) OR ((1 <= p96))))) AND (((1 <= p35)) AND ((p96 <= 0)))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (F ((X (G ((((1 <= p89)) AND ((p21 <= 0))))) R (X (G ((((p35 <= 0)) OR ((1 <= p96))))) AND (((1 <= p35)) AND ((p96 <= 0)))))))
lola: processed formula length: 129
lola: 44 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 10 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 126 markings, 164 edges
lola: ========================================
lola: subprocess 4 will run for 594 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((G ((((p22 <= 0)) OR ((1 <= p87)))) OR (((p53 <= 0)) OR ((1 <= p44)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((G ((((p22 <= 0)) OR ((1 <= p87)))) OR (((p53 <= 0)) OR ((1 <= p44)))))
lola: processed formula length: 75
lola: 44 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: 4 markings, 3 edges
lola: ========================================
lola: subprocess 5 will run for 713 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((X (((1 <= p44))) AND ((((p101 <= 0)) OR ((1 <= p99))) U (((p65 <= 0)) OR ((1 <= p80))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F ((X (((1 <= p44))) AND ((((p101 <= 0)) OR ((1 <= p99))) U (((p65 <= 0)) OR ((1 <= p80))))))
lola: processed formula length: 95
lola: 44 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: 32 markings, 32 edges
lola: ========================================
lola: subprocess 6 will run for 891 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G ((((1 <= p49)) AND ((p19 <= 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 ((((1 <= p49)) AND ((p19 <= 0)))))
lola: processed formula length: 39
lola: 44 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: 73 markings, 77 edges
lola: ========================================
lola: subprocess 7 will run for 1189 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G ((p17 + p19 + p20 + p21 + p22 + p24 + 1 <= p88 + p87 + p85)))
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 ((p17 + p19 + p20 + p21 + p22 + p24 + 1 <= p88 + p87 + p85)))
lola: processed formula length: 66
lola: 44 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: 29 markings, 30 edges
lola: ========================================
lola: subprocess 8 will run for 1783 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (F ((1 <= p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p18)))
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 <= p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p18)))
lola: processed formula length: 110
lola: 44 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: 31 markings, 31 edges
lola: ========================================
lola: subprocess 9 will run for 3567 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G ((F ((p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p18 <= p88 + p87 + p85)) AND ((1 <= p62 + p63 + p64 + p69 + p70 + p71 + p72 + p73 + p74 + p75 + p76 + p77 + p78 + p80 + p81 + p82 + p83 + p84) OR (p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p18 <= p88 + p87 + p85)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F (G ((F ((p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p18 <= p88 + p87 + p85)) AND ((1 <= p62 + p63 + p64 + p69 + p70 + p71 + p72 + p73 + p74 + p75 + p76 + p77 + p78 + p80 + p81 + p82 + p83 + p84) OR (p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p18 <= p88 + p87 + p85)))))
lola: processed formula length: 369
lola: 44 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: 26 markings, 27 edges
lola: ========================================
lola: RESULT
lola:
SUMMARY: no no no no no no no yes no no
lola:
preliminary result: no no no no no no no yes no no
lola: memory consumption: 25716 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="Peterson-PT-2"
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 Peterson-PT-2, 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-162089151400301"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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