About the Execution of 2020-gold for ShieldRVs-PT-005A
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
4278.411 | 3600000.00 | 17048.00 | 480.80 | FFTFFFTFFTTFTFFT | normal |
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.r246-smll-162106594200033.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/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 ShieldRVs-PT-005A, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r246-smll-162106594200033
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 416K
-rw-r--r-- 1 mcc users 13K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 125K May 10 09:44 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.7K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 85K 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.5K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K Mar 28 16:40 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Mar 28 16:40 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Mar 28 16:40 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 28 16:40 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K Mar 27 12:36 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 19K Mar 27 12:36 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.8K Mar 25 18:41 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 25 18:41 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 22 08:16 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Mar 22 08:16 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 5 16:52 equiv_col
-rw-r--r-- 1 mcc users 5 May 5 16:52 instance
-rw-r--r-- 1 mcc users 6 May 5 16:52 iscolored
-rw-r--r-- 1 mcc users 32K May 5 16:52 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 ShieldRVs-PT-005A-00
FORMULA_NAME ShieldRVs-PT-005A-01
FORMULA_NAME ShieldRVs-PT-005A-02
FORMULA_NAME ShieldRVs-PT-005A-03
FORMULA_NAME ShieldRVs-PT-005A-04
FORMULA_NAME ShieldRVs-PT-005A-05
FORMULA_NAME ShieldRVs-PT-005A-06
FORMULA_NAME ShieldRVs-PT-005A-07
FORMULA_NAME ShieldRVs-PT-005A-08
FORMULA_NAME ShieldRVs-PT-005A-09
FORMULA_NAME ShieldRVs-PT-005A-10
FORMULA_NAME ShieldRVs-PT-005A-11
FORMULA_NAME ShieldRVs-PT-005A-12
FORMULA_NAME ShieldRVs-PT-005A-13
FORMULA_NAME ShieldRVs-PT-005A-14
FORMULA_NAME ShieldRVs-PT-005A-15
=== Now, execution of the tool begins
BK_START 1621281189139
bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2021-05-17 19:53: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-17 19:53:11] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-17 19:53:11] [INFO ] Load time of PNML (sax parser for PT used): 66 ms
[2021-05-17 19:53:11] [INFO ] Transformed 73 places.
[2021-05-17 19:53:11] [INFO ] Transformed 98 transitions.
[2021-05-17 19:53:11] [INFO ] Found NUPN structural information;
[2021-05-17 19:53:11] [INFO ] Parsed PT model containing 73 places and 98 transitions in 128 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 26 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100000 steps, including 1262 resets, run finished after 303 ms. (steps per millisecond=330 ) properties seen :[1, 1, 1, 1, 1, 0, 1, 1, 0, 0, 0, 0, 1, 1, 1, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
// Phase 1: matrix 98 rows 73 cols
[2021-05-17 19:53:12] [INFO ] Computed 21 place invariants in 7 ms
[2021-05-17 19:53:12] [INFO ] [Real]Absence check using 21 positive place invariants in 31 ms returned sat
[2021-05-17 19:53:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 19:53:12] [INFO ] [Real]Absence check using state equation in 75 ms returned sat
[2021-05-17 19:53:12] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 19:53:12] [INFO ] [Nat]Absence check using 21 positive place invariants in 13 ms returned unsat
[2021-05-17 19:53:12] [INFO ] [Real]Absence check using 21 positive place invariants in 12 ms returned sat
[2021-05-17 19:53:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 19:53:12] [INFO ] [Real]Absence check using state equation in 64 ms returned sat
[2021-05-17 19:53:12] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 19:53:12] [INFO ] [Nat]Absence check using 21 positive place invariants in 7 ms returned unsat
[2021-05-17 19:53:12] [INFO ] [Real]Absence check using 21 positive place invariants in 12 ms returned sat
[2021-05-17 19:53:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 19:53:12] [INFO ] [Real]Absence check using state equation in 60 ms returned sat
[2021-05-17 19:53:12] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 19:53:12] [INFO ] [Nat]Absence check using 21 positive place invariants in 6 ms returned unsat
[2021-05-17 19:53:12] [INFO ] [Real]Absence check using 21 positive place invariants in 11 ms returned sat
[2021-05-17 19:53:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 19:53:12] [INFO ] [Real]Absence check using state equation in 57 ms returned sat
[2021-05-17 19:53:12] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 19:53:12] [INFO ] [Nat]Absence check using 21 positive place invariants in 7 ms returned unsat
[2021-05-17 19:53:13] [INFO ] [Real]Absence check using 21 positive place invariants in 10 ms returned sat
[2021-05-17 19:53:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 19:53:13] [INFO ] [Real]Absence check using state equation in 53 ms returned sat
[2021-05-17 19:53:13] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 19:53:13] [INFO ] [Nat]Absence check using 21 positive place invariants in 7 ms returned unsat
[2021-05-17 19:53:13] [INFO ] [Real]Absence check using 21 positive place invariants in 10 ms returned sat
[2021-05-17 19:53:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 19:53:13] [INFO ] [Real]Absence check using state equation in 56 ms returned sat
[2021-05-17 19:53:13] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 19:53:13] [INFO ] [Nat]Absence check using 21 positive place invariants in 14 ms returned unsat
[2021-05-17 19:53:13] [INFO ] [Real]Absence check using 21 positive place invariants in 10 ms returned sat
[2021-05-17 19:53:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 19:53:13] [INFO ] [Real]Absence check using state equation in 65 ms returned sat
[2021-05-17 19:53:13] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 19:53:13] [INFO ] [Nat]Absence check using 21 positive place invariants in 7 ms returned unsat
Successfully simplified 7 atomic propositions for a total of 9 simplifications.
[2021-05-17 19:53:13] [INFO ] Initial state reduction rules for CTL removed 11 formulas.
[2021-05-17 19:53:13] [INFO ] Flatten gal took : 86 ms
FORMULA ShieldRVs-PT-005A-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVs-PT-005A-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVs-PT-005A-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVs-PT-005A-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVs-PT-005A-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVs-PT-005A-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVs-PT-005A-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVs-PT-005A-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVs-PT-005A-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVs-PT-005A-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVs-PT-005A-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-17 19:53:13] [INFO ] Applying decomposition
[2021-05-17 19:53:13] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2021-05-17 19:53:13] [INFO ] Flatten gal took : 31 ms
[2021-05-17 19:53:13] [INFO ] Decomposing Gal with order
[2021-05-17 19:53:13] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-17 19:53:13] [INFO ] Removed a total of 102 redundant transitions.
[2021-05-17 19:53:13] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2021-05-17 19:53:13] [INFO ] Flatten gal took : 81 ms
[2021-05-17 19:53:13] [INFO ] Fuse similar labels procedure discarded/fused a total of 60 labels/synchronizations in 8 ms.
[2021-05-17 19:53:13] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA ShieldRVs-PT-005A-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-17 19:53:13] [INFO ] Export to MCC properties in file /home/mcc/execution/LTLCardinality.sr.xml took 3 ms.
[2021-05-17 19:53:13] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 5 ms.
info: Time: 3600 - MCC
vrfy: Checking LTLCardinality @ ShieldRVs-PT-005A @ 3570 seconds
FORMULA ShieldRVs-PT-005A-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA ShieldRVs-PT-005A-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA ShieldRVs-PT-005A-00 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA ShieldRVs-PT-005A-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 3565
rslt: Output for LTLCardinality @ ShieldRVs-PT-005A
{
"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": "Mon May 17 19:53:15 2021
",
"timelimit": 3570
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 891
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 2,
"U": 0,
"X": 1,
"aconj": 4,
"adisj": 6,
"aneg": 1,
"comp": 6,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 6,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "X (G ((G ((((1 <= p0)) AND ((p14 <= 0)))) AND ((((1 <= p38)) AND ((p36 <= 0))) OR (((1 <= p0)) AND ((p14 <= 0)))))))",
"processed_size": 117,
"rewrites": 17
},
"result":
{
"edges": 106,
"markings": 106,
"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": 1189
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1189
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 2,
"adisj": 1,
"aneg": 0,
"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": "(((p52 <= 0)) OR ((1 <= p17)))",
"processed_size": 31,
"rewrites": 17
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 1,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1783
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 3,
"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": "X (X (X ((((1 <= p56)) AND ((p55 <= 0))))))",
"processed_size": 43,
"rewrites": 17
},
"result":
{
"edges": 106,
"markings": 106,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 5
},
"compoundnumber": 2,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 1,
"type": "boolean"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1783
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 2,
"adisj": 1,
"aneg": 0,
"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 ((((p16 <= 0)) OR ((1 <= p63)))))",
"processed_size": 39,
"rewrites": 17
},
"result":
{
"edges": 1204215,
"markings": 212871,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 2,
"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": 3565
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 2,
"aneg": 1,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "G ((((p59 <= 0)) OR ((1 <= p21))))",
"processed_size": 35,
"rewrites": 17
},
"result":
{
"edges": 97,
"markings": 97,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 3,
"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": 22164,
"runtime": 5.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "LTLCardinality.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "F(G(**)) : G(*) : X(G((G(*) AND **))) : (X(X(X(*))) AND **)"
},
"net":
{
"arcs": 460,
"conflict_clusters": 13,
"places": 73,
"places_significant": 52,
"singleton_clusters": 0,
"transitions": 98
},
"result":
{
"preliminary_value": "no no no no ",
"value": "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: 171/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 73
lola: finding significant places
lola: 73 places, 98 transitions, 52 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: (p23 <= 1)
lola: LP says that atomic proposition is always true: (p63 <= 1)
lola: LP says that atomic proposition is always true: (p21 <= 1)
lola: LP says that atomic proposition is always true: (p36 <= 1)
lola: LP says that atomic proposition is always true: (p14 <= 1)
lola: LP says that atomic proposition is always true: (p36 <= 1)
lola: LP says that atomic proposition is always true: (p14 <= 1)
lola: LP says that atomic proposition is always true: (p55 <= 1)
lola: LP says that atomic proposition is always true: (p17 <= 1)
lola: X (F (X ((F (((1 <= 0) U ((1 <= p23)))) U G ((((p16 <= 0)) OR ((1 <= p63)))))))) : NOT(F ((((1 <= p59)) AND ((p21 <= 0))))) : G (X (G ((NOT(F (((((1 <= p38)) AND ((p36 <= 0))) U F ((((p0 <= 0)) OR ((1 <= p14))))))) AND ((((1 <= p38)) AND ((p36 <= 0))) OR (((1 <= p0)) AND ((p14 <= 0)))))))) : (X (NOT(X (X ((((p56 <= 0)) OR ((1 <= p55))))))) AND (((p52 <= 0)) OR ((1 <= p17))))
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:185
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:434
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:422
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 891 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (G ((G ((((1 <= p0)) AND ((p14 <= 0)))) AND ((((1 <= p38)) AND ((p36 <= 0))) OR (((1 <= p0)) AND ((p14 <= 0)))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (G ((G ((((1 <= p0)) AND ((p14 <= 0)))) AND ((((1 <= p38)) AND ((p36 <= 0))) OR (((1 <= p0)) AND ((p14 <= 0)))))))
lola: processed formula length: 117
lola: 17 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: 106 markings, 106 edges
lola: ========================================
lola: subprocess 1 will run for 1189 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (X (X (X ((((1 <= p56)) AND ((p55 <= 0)))))) AND (((p52 <= 0)) OR ((1 <= p17))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 1 will run for 1189 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (((p52 <= 0)) OR ((1 <= p17)))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (((p52 <= 0)) OR ((1 <= p17)))
lola: processed formula length: 31
lola: 17 rewrites
lola: closed formula file LTLCardinality.xml
lola: processed formula with 2 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 2 will run for 1783 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (X (X ((((1 <= p56)) AND ((p55 <= 0))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (X (X ((((1 <= p56)) AND ((p55 <= 0))))))
lola: processed formula length: 43
lola: 17 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: 106 markings, 106 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 2 will run for 1783 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G ((((p16 <= 0)) OR ((1 <= p63)))))
lola: ========================================
lola: SUBTASK
lola: checking stabilization
lola: stabilization not yet implemented, converting to LTL...
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F (G ((((p16 <= 0)) OR ((1 <= p63)))))
lola: processed formula length: 39
lola: 17 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: add low 24
lola: add low 31
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: 212871 markings, 1204215 edges
lola: ========================================
lola: subprocess 3 will run for 3565 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G ((((p59 <= 0)) OR ((1 <= p21))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((((p59 <= 0)) OR ((1 <= p21))))
lola: processed formula length: 35
lola: 17 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: 97 markings, 97 edges
lola: RESULT
lola:
SUMMARY: no no no no
lola:
preliminary result: no no no no
lola: ========================================
lola: memory consumption: 22164 KB
lola: time consumption: 5 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="ShieldRVs-PT-005A"
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 ShieldRVs-PT-005A, 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 r246-smll-162106594200033"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/ShieldRVs-PT-005A.tgz
mv ShieldRVs-PT-005A 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 '
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 ;