Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2021-input.r189-tajo-162089432800257.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/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 Referendum-PT-0010, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r189-tajo-162089432800257
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 540K
-rw-r--r-- 1 mcc users 26K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 170K May 10 09:44 CTLCardinality.xml
-rw-r--r-- 1 mcc users 15K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 132K May 10 09:44 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 6.4K Mar 28 16:31 LTLCardinality.txt
-rw-r--r-- 1 mcc users 32K Mar 28 16:31 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.8K Mar 28 16:31 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K Mar 28 16:31 LTLFireability.xml
-rw-r--r-- 1 mcc users 6.6K Mar 27 10:29 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 27K Mar 27 10:29 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.3K Mar 25 13:42 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 31K Mar 25 13:42 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.3K Mar 22 08:15 UpperBounds.txt
-rw-r--r-- 1 mcc users 5.2K Mar 22 08:15 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 5 16:51 equiv_col
-rw-r--r-- 1 mcc users 5 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 12K 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 Referendum-PT-0010-00
FORMULA_NAME Referendum-PT-0010-01
FORMULA_NAME Referendum-PT-0010-02
FORMULA_NAME Referendum-PT-0010-03
FORMULA_NAME Referendum-PT-0010-04
FORMULA_NAME Referendum-PT-0010-05
FORMULA_NAME Referendum-PT-0010-06
FORMULA_NAME Referendum-PT-0010-07
FORMULA_NAME Referendum-PT-0010-08
FORMULA_NAME Referendum-PT-0010-09
FORMULA_NAME Referendum-PT-0010-10
FORMULA_NAME Referendum-PT-0010-11
FORMULA_NAME Referendum-PT-0010-12
FORMULA_NAME Referendum-PT-0010-13
FORMULA_NAME Referendum-PT-0010-14
FORMULA_NAME Referendum-PT-0010-15

=== Now, execution of the tool begins

BK_START 1621426423737

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2021-05-19 12:13:45] [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 12:13:45] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-19 12:13:45] [INFO ] Load time of PNML (sax parser for PT used): 24 ms
[2021-05-19 12:13:45] [INFO ] Transformed 31 places.
[2021-05-19 12:13:45] [INFO ] Transformed 21 transitions.
[2021-05-19 12:13:45] [INFO ] Found NUPN structural information;
[2021-05-19 12:13:45] [INFO ] Parsed PT model containing 31 places and 21 transitions in 59 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 24 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100000 steps, including 8333 resets, run finished after 203 ms. (steps per millisecond=492 ) properties seen :[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 0, 1]
// Phase 1: matrix 21 rows 31 cols
[2021-05-19 12:13:45] [INFO ] Computed 10 place invariants in 3 ms
[2021-05-19 12:13:45] [INFO ] [Real]Absence check using 10 positive place invariants in 21 ms returned sat
[2021-05-19 12:13:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-19 12:13:45] [INFO ] [Real]Absence check using state equation in 27 ms returned sat
[2021-05-19 12:13:45] [INFO ] Solution in real domain found non-integer solution.
[2021-05-19 12:13:45] [INFO ] [Nat]Absence check using 10 positive place invariants in 31 ms returned unsat
[2021-05-19 12:13:45] [INFO ] [Real]Absence check using 10 positive place invariants in 3 ms returned unsat
[2021-05-19 12:13:45] [INFO ] [Real]Absence check using 10 positive place invariants in 4 ms returned sat
[2021-05-19 12:13:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-19 12:13:45] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2021-05-19 12:13:45] [INFO ] Solution in real domain found non-integer solution.
[2021-05-19 12:13:45] [INFO ] [Nat]Absence check using 10 positive place invariants in 5 ms returned unsat
Successfully simplified 3 atomic propositions for a total of 3 simplifications.
[2021-05-19 12:13:46] [INFO ] Initial state reduction rules for CTL removed 8 formulas.
[2021-05-19 12:13:46] [INFO ] Flatten gal took : 19 ms
FORMULA Referendum-PT-0010-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Referendum-PT-0010-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Referendum-PT-0010-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Referendum-PT-0010-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Referendum-PT-0010-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Referendum-PT-0010-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Referendum-PT-0010-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Referendum-PT-0010-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-19 12:13:46] [INFO ] Applying decomposition
[2021-05-19 12:13:46] [INFO ] Flatten gal took : 4 ms
[2021-05-19 12:13:46] [INFO ] Decomposing Gal with order
[2021-05-19 12:13:46] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-19 12:13:46] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2021-05-19 12:13:46] [INFO ] Flatten gal took : 23 ms
[2021-05-19 12:13:46] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2021-05-19 12:13:46] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA Referendum-PT-0010-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-19 12:13:46] [INFO ] Export to MCC properties in file /home/mcc/execution/LTLCardinality.sr.xml took 2 ms.
[2021-05-19 12:13:46] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 0 ms.
info: Time: 3600 - MCC
vrfy: Checking LTLCardinality @ Referendum-PT-0010 @ 3570 seconds

FORMULA Referendum-PT-0010-02 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Referendum-PT-0010-05 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Referendum-PT-0010-06 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Referendum-PT-0010-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Referendum-PT-0010-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Referendum-PT-0010-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Referendum-PT-0010-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 @ Referendum-PT-0010

{
"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": "Wed May 19 12:13:46 2021
",
"timelimit": 3570
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 509
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 10,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 10,
"visible_transitions": 0
},
"processed": "X (G ((1 <= p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10)))",
"processed_size": 63,
"rewrites": 21
},
"result":
{
"edges": 12,
"markings": 12,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 0,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 594
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 1,
"X": 3,
"aconj": 0,
"adisj": 1,
"aneg": 0,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 61,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 31,
"visible_transitions": 0
},
"processed": "(X (G ((p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20 <= p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29 + p30))) U (X (X (((1 <= p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10) OR (p0 <= p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10)))) AND (p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20 <= p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29 + p30)))",
"processed_size": 386,
"rewrites": 21
},
"result":
{
"edges": 62,
"markings": 63,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 10
},
"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": 713
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 1,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 30,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 30,
"visible_transitions": 0
},
"processed": "X (((p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20 <= 2) U (p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29 + p30 <= p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10)))",
"processed_size": 184,
"rewrites": 21
},
"result":
{
"edges": 12,
"markings": 12,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 2,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

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

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1783
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 4,
"adisj": 2,
"aneg": 0,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "F (G (((((p1 <= 0)) OR ((1 <= p12))) AND (((p15 <= 0)) OR ((1 <= p0))))))",
"processed_size": 75,
"rewrites": 21
},
"result":
{
"edges": 14,
"markings": 13,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 5,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "stabilization",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3567
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 3,
"G": 2,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 41,
"taut": 0,
"tconj": 2,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 21,
"visible_transitions": 0
},
"processed": "F (G (((1 <= p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10) OR (G (F ((F ((p0 <= p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20)) AND (1 <= p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20)))) AND (p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20 <= 0)))))",
"processed_size": 288,
"rewrites": 21
},
"result":
{
"edges": 16,
"markings": 14,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 7
},
"compoundnumber": 6,
"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": 22588,
"runtime": 3.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "LTLCardinality.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "X(G(**)) : F(G((** OR (G(F((F(**) AND **))) AND **)))) : (X(G(**)) U (X(X(**)) AND **)) : X((** U **)) : X(X(X(X(G((F(*) OR *)))))) : X((F(**) AND (** AND **))) : F(G((** AND **)))"
},
"net":
{
"arcs": 51,
"conflict_clusters": 31,
"places": 31,
"places_significant": 21,
"singleton_clusters": 0,
"transitions": 21
},
"result":
{
"preliminary_value": "no no yes no no no no ",
"value": "no no yes no no no no "
},
"task":
{
"type": "compound"
}
}
lola: LoLA will run for 3570 seconds at most (--timelimit)
lola: NET
lola: input: PNML file (--pnml)
lola: reading net from model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file model.pnml
lola: 52/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 31
lola: finding significant places
lola: 31 places, 21 transitions, 21 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: (p12 <= 1)
lola: LP says that atomic proposition is always true: (p17 <= 1)
lola: LP says that atomic proposition is always true: (p23 <= 1)
lola: LP says that atomic proposition is always true: (p23 <= 1)
lola: LP says that atomic proposition is always true: (p12 <= 1)
lola: LP says that atomic proposition is always true: (p0 <= 1)
lola: G (X (G ((1 <= p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10)))) : F (G (((1 <= p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10) OR (G (F ((F ((p0 <= p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20)) AND (1 <= p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20)))) AND (p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20 <= 0))))) : (G (X ((p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20 <= p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29 + p30))) U (X (X (((1 <= p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10) OR (p0 <= p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10)))) AND (p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20 <= p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29 + p30))) : X (((p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20 <= 2) U (p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29 + p30 <= p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10))) : G (NOT(((1 <= 0) U X (X (X (X (F ((G ((((p1 <= 0)) OR ((1 <= p12)))) AND (((p0 <= 0)) OR ((1 <= p17)))))))))))) : X (((F ((((p1 <= 0)) OR ((1 <= p23)))) AND ((1 <= p1))) AND ((p23 <= 0)))) : F ((G ((((p1 <= 0)) OR ((1 <= p12)))) AND G ((((p15 <= 0)) OR ((1 <= p0))))))
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:185
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k: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:353
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:522
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 509 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (G ((1 <= p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (G ((1 <= p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10)))
lola: processed formula length: 63
lola: 21 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: 12 markings, 12 edges
lola: ========================================
lola: subprocess 1 will run for 594 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (X (G ((p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20 <= p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29 + p30))) U (X (X (((1 <= p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10) OR (p0 <= p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10)))) AND (p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20 <= p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29 + p30)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: (X (G ((p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20 <= p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29 + p30))) U (X (X (((1 <= p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10) OR (p0 <= p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10)))) AND (p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20 <= p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29 + p30)))
lola: processed formula length: 386
lola: 21 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: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 63 markings, 62 edges
lola: ========================================
lola: subprocess 2 will run for 713 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (((p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20 <= 2) U (p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29 + p30 <= p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (((p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20 <= 2) U (p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29 + p30 <= p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10)))
lola: processed formula length: 184
lola: 21 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: 12 markings, 12 edges
lola: ========================================
lola: subprocess 3 will run for 891 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (X (X (X (G ((F ((((1 <= p1)) AND ((p12 <= 0)))) OR (((1 <= p0)) AND ((p17 <= 0)))))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (X (X (X (G ((F ((((1 <= p1)) AND ((p12 <= 0)))) OR (((1 <= p0)) AND ((p17 <= 0)))))))))
lola: processed formula length: 90
lola: 21 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: 12 markings, 12 edges
lola: ========================================
lola: subprocess 4 will run for 1189 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((F ((((p1 <= 0)) OR ((1 <= p23)))) AND (((1 <= p1)) AND ((p23 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((F ((((p1 <= 0)) OR ((1 <= p23)))) AND (((1 <= p1)) AND ((p23 <= 0)))))
lola: processed formula length: 75
lola: 21 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 5 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 12 markings, 12 edges
lola: ========================================
lola: subprocess 5 will run for 1783 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G (((((p1 <= 0)) OR ((1 <= p12))) AND (((p15 <= 0)) OR ((1 <= p0))))))
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 (((((p1 <= 0)) OR ((1 <= p12))) AND (((p15 <= 0)) OR ((1 <= p0))))))
lola: processed formula length: 75
lola: 21 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, 14 edges
lola: ========================================
lola: subprocess 6 will run for 3567 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G (((1 <= p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10) OR (G (F ((F ((p0 <= p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20)) AND (1 <= p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20)))) AND (p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F (G (((1 <= p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10) OR (G (F ((F ((p0 <= p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20)) AND (1 <= p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20)))) AND (p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20 <= 0)))))
lola: processed formula length: 288
lola: 21 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: 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, 16 edges
lola: ========================================
lola: RESULT
lola:
SUMMARY: no no yes no no no no
lola:
preliminary result: no no yes no no no no
lola: memory consumption: 22588 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="Referendum-PT-0010"
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 Referendum-PT-0010, 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 r189-tajo-162089432800257"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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