About the Execution of ITS-LoLa for SmartHome-PT-15
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
15730.660 | 3600000.00 | 113502.00 | 111.80 | TFFTFFFTFFFFFFFT | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fko/mcc2020-input.r228-oct2-159033547100113.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fko/mcc2020-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 itslola
Input is SmartHome-PT-15, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r228-oct2-159033547100113
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 272K
-rw-r--r-- 1 mcc users 3.4K May 14 03:56 CTLCardinality.txt
-rw-r--r-- 1 mcc users 19K May 14 03:56 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K May 13 21:29 CTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 13 21:29 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.1K May 14 10:06 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K May 14 10:06 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K May 14 10:06 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 14 10:06 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 May 12 20:42 NewModel
-rw-r--r-- 1 mcc users 3.8K May 13 15:04 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 20K May 13 15:04 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.6K May 13 10:21 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 16K May 13 10:21 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 13 16:53 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K May 13 16:53 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 12 20:42 equiv_col
-rw-r--r-- 1 mcc users 3 May 12 20:42 instance
-rw-r--r-- 1 mcc users 6 May 12 20:42 iscolored
-rw-r--r-- 1 mcc users 102K May 12 20:42 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 SmartHome-PT-15-00
FORMULA_NAME SmartHome-PT-15-01
FORMULA_NAME SmartHome-PT-15-02
FORMULA_NAME SmartHome-PT-15-03
FORMULA_NAME SmartHome-PT-15-04
FORMULA_NAME SmartHome-PT-15-05
FORMULA_NAME SmartHome-PT-15-06
FORMULA_NAME SmartHome-PT-15-07
FORMULA_NAME SmartHome-PT-15-08
FORMULA_NAME SmartHome-PT-15-09
FORMULA_NAME SmartHome-PT-15-10
FORMULA_NAME SmartHome-PT-15-11
FORMULA_NAME SmartHome-PT-15-12
FORMULA_NAME SmartHome-PT-15-13
FORMULA_NAME SmartHome-PT-15-14
FORMULA_NAME SmartHome-PT-15-15
=== Now, execution of the tool begins
BK_START 1591291919145
bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-04 17:32:00] [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]
[2020-06-04 17:32:00] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-04 17:32:01] [INFO ] Load time of PNML (sax parser for PT used): 92 ms
[2020-06-04 17:32:01] [INFO ] Transformed 427 places.
[2020-06-04 17:32:01] [INFO ] Transformed 451 transitions.
[2020-06-04 17:32:01] [INFO ] Found NUPN structural information;
[2020-06-04 17:32:01] [INFO ] Parsed PT model containing 427 places and 451 transitions in 174 ms.
Deduced a syphon composed of 134 places in 6 ms
Reduce places removed 134 places and 107 transitions.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 64 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100000 steps, including 434 resets, run finished after 202 ms. (steps per millisecond=495 ) properties seen :[0, 1, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 1, 1, 1, 1]
// Phase 1: matrix 344 rows 293 cols
[2020-06-04 17:32:01] [INFO ] Computed 14 place invariants in 36 ms
[2020-06-04 17:32:01] [INFO ] [Real]Absence check using 14 positive place invariants in 28 ms returned sat
[2020-06-04 17:32:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 17:32:01] [INFO ] [Real]Absence check using state equation in 229 ms returned sat
[2020-06-04 17:32:01] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 17:32:02] [INFO ] [Nat]Absence check using 14 positive place invariants in 19 ms returned unsat
[2020-06-04 17:32:02] [INFO ] [Real]Absence check using 14 positive place invariants in 11 ms returned sat
[2020-06-04 17:32:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 17:32:02] [INFO ] [Real]Absence check using state equation in 308 ms returned sat
[2020-06-04 17:32:02] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 17:32:02] [INFO ] [Nat]Absence check using 14 positive place invariants in 22 ms returned unsat
[2020-06-04 17:32:02] [INFO ] [Real]Absence check using 14 positive place invariants in 90 ms returned sat
[2020-06-04 17:32:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 17:32:03] [INFO ] [Real]Absence check using state equation in 233 ms returned sat
[2020-06-04 17:32:03] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 17:32:03] [INFO ] [Nat]Absence check using 14 positive place invariants in 26 ms returned unsat
[2020-06-04 17:32:03] [INFO ] [Real]Absence check using 14 positive place invariants in 13 ms returned sat
[2020-06-04 17:32:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 17:32:03] [INFO ] [Real]Absence check using state equation in 373 ms returned sat
[2020-06-04 17:32:03] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 17:32:03] [INFO ] [Nat]Absence check using 14 positive place invariants in 36 ms returned unsat
[2020-06-04 17:32:03] [INFO ] [Real]Absence check using 14 positive place invariants in 77 ms returned sat
[2020-06-04 17:32:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 17:32:04] [INFO ] [Real]Absence check using state equation in 1105 ms returned sat
[2020-06-04 17:32:05] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 17:32:05] [INFO ] [Nat]Absence check using 14 positive place invariants in 34 ms returned unsat
Successfully simplified 5 atomic propositions for a total of 5 simplifications.
[2020-06-04 17:32:05] [INFO ] Initial state reduction rules for CTL removed 9 formulas.
[2020-06-04 17:32:05] [INFO ] Flatten gal took : 104 ms
FORMULA SmartHome-PT-15-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmartHome-PT-15-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmartHome-PT-15-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmartHome-PT-15-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmartHome-PT-15-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmartHome-PT-15-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmartHome-PT-15-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmartHome-PT-15-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmartHome-PT-15-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-06-04 17:32:05] [INFO ] Applying decomposition
[2020-06-04 17:32:05] [INFO ] Flatten gal took : 24 ms
[2020-06-04 17:32:05] [INFO ] Decomposing Gal with order
[2020-06-04 17:32:05] [INFO ] Rewriting arrays to variables to allow decomposition.
[2020-06-04 17:32:05] [INFO ] Removed a total of 17 redundant transitions.
[2020-06-04 17:32:05] [INFO ] Flatten gal took : 188 ms
[2020-06-04 17:32:05] [INFO ] Fuse similar labels procedure discarded/fused a total of 42 labels/synchronizations in 10 ms.
[2020-06-04 17:32:05] [INFO ] Export to MCC properties in file /home/mcc/execution/LTLCardinality.sr.xml took 2 ms.
[2020-06-04 17:32:05] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 6 ms.
info: Time: 3600 - MCC
vrfy: Checking LTLCardinality @ SmartHome-PT-15 @ 3570 seconds
FORMULA SmartHome-PT-15-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA SmartHome-PT-15-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA SmartHome-PT-15-04 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA SmartHome-PT-15-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA SmartHome-PT-15-06 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA SmartHome-PT-15-05 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA SmartHome-PT-15-09 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 3475
rslt: Output for LTLCardinality @ SmartHome-PT-15
{
"build":
{
"architecture": 64,
"assertions": false,
"build_hostname": "mcc2019",
"build_system": "x86_64-unknown-linux-gnu",
"optimizations": true,
"package_version": "2.0",
"svn_version": "3189M"
},
"call":
{
"exec_host": "mcc2020",
"markinglimit": null,
"parameters":
[
"--pnmlnet",
"model.pnml",
"--xmlformula",
"--formula=LTLCardinality.xml",
"--mcc",
"--donotcomputecapacities",
"--encoder=simplecompressed",
"--check=modelchecking",
"--stubborn=deletion",
"--stateequation=par",
"--timelimit=3570",
"--localtimelimit=0",
"--preference=force_ltl",
"--json=LTLCardinality.json",
"--jsoninclude=formula,formulastat,net"
],
"starttime": "Thu Jun 4 17:32:06 2020
",
"timelimit": 3570
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 509
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 1,
"aconj": 1,
"adisj": 2,
"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": "X ((((1 <= p213)) AND ((p238 <= 0))))",
"processed_size": 37,
"rewrites": 28
},
"result":
{
"edges": 15,
"markings": 15,
"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
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 594
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"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": "(((1 <= p14)) AND ((p199 <= 0)))",
"processed_size": 32,
"rewrites": 28
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 1,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 713
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 1,
"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 ((((1 <= p14)) AND ((p199 <= 0))))",
"processed_size": 36,
"rewrites": 28
},
"result":
{
"edges": 15,
"markings": 15,
"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"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 1,
"type": "boolean"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 713
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"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": "G (F (((p47 <= 0))))",
"processed_size": 20,
"rewrites": 28
},
"result":
{
"edges": 1796,
"markings": 1381,
"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": "fairness",
"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": 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 ((((p271 <= 0)) OR ((1 <= p122)))))",
"processed_size": 41,
"rewrites": 28
},
"result":
{
"edges": 634,
"markings": 502,
"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": "stabilization",
"workflow": "product automaton"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1189
},
"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 ((((p61 <= 0)) OR ((1 <= p78)))))",
"processed_size": 39,
"rewrites": 28
},
"result":
{
"edges": 202,
"markings": 167,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 4,
"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": 3,
"adisj": 2,
"aneg": 1,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "F (G (((((1 <= p113)) AND ((p258 <= 0))) OR ((p169 <= 0)))))",
"processed_size": 61,
"rewrites": 28
},
"result":
{
"edges": 42588904,
"markings": 6607929,
"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": 3475
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"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": "G ((((p16 <= 0)) OR ((1 <= p71))))",
"processed_size": 35,
"rewrites": 28
},
"result":
{
"edges": 47,
"markings": 47,
"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": "LTL",
"workflow": "product automaton"
}
}
],
"exit":
{
"error": null,
"memory": 24716,
"runtime": 95.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "LTLCardinality.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "G(F(**)) : F(G(*)) : F(G(**)) : G(**) : X(**) : F(G(**)) : (X(*) OR *)"
},
"net":
{
"arcs": 768,
"conflict_clusters": 272,
"places": 293,
"places_significant": 279,
"singleton_clusters": 0,
"transitions": 344
},
"result":
{
"preliminary_value": "no no no no no no no ",
"value": "no no no 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: 637/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 9376
lola: finding significant places
lola: 293 places, 344 transitions, 279 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: (p258 <= 1)
lola: LP says that atomic proposition is always true: (p78 <= 1)
lola: LP says that atomic proposition is always true: (p71 <= 1)
lola: LP says that atomic proposition is always true: (p238 <= 1)
lola: LP says that atomic proposition is always true: (p238 <= 1)
lola: LP says that atomic proposition is always true: (p122 <= 1)
lola: LP says that atomic proposition is always true: (p199 <= 1)
lola: LP says that atomic proposition is always true: (p199 <= 1)
lola: G (((0 <= 0) U ((p47 <= 0)))) : G (F (X (NOT(X (F (((((p113 <= 0)) OR ((1 <= p258))) AND ((1 <= p169))))))))) : ((0 <= 0) U F (X (G ((((p61 <= 0)) OR ((1 <= p78))))))) : G ((((p16 <= 0)) OR ((1 <= p71)))) : X (((G ((((p213 <= 0)) OR ((1 <= p238)))) U ((1 <= 0) U (1 <= 0))) U (((1 <= p213)) AND ((p238 <= 0))))) : F (G ((((p271 <= 0)) OR ((1 <= p122))))) : (NOT(X ((((p14 <= 0)) OR ((1 <= p199))))) OR NOT(((1 <= 0) U (((p14 <= 0)) OR ((1 <= p199))))))
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:169
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k: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:380
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:374
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:169
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:185
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:157
lola: rewrite Frontend/Parser/formula_rewrite.k:117
lola: rewrite Frontend/Parser/formula_rewrite.k:122
lola: rewrite Frontend/Parser/formula_rewrite.k:185
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:185
lola: rewrite Frontend/Parser/formula_rewrite.k:297
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 ((((1 <= p213)) AND ((p238 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((((1 <= p213)) AND ((p238 <= 0))))
lola: processed formula length: 37
lola: 28 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: 15 markings, 15 edges
lola: ========================================
lola: subprocess 1 will run for 594 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (X ((((1 <= p14)) AND ((p199 <= 0)))) OR (((1 <= p14)) AND ((p199 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 1 will run for 594 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (((1 <= p14)) AND ((p199 <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (((1 <= p14)) AND ((p199 <= 0)))
lola: processed formula length: 32
lola: 28 rewrites
lola: closed formula file LTLCardinality.xml
lola: processed formula with 2 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 2 will run for 713 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((((1 <= p14)) AND ((p199 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((((1 <= p14)) AND ((p199 <= 0))))
lola: processed formula length: 36
lola: 28 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: 15 markings, 15 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 2 will run for 713 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (F (((p47 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking fairness
lola: fairness not yet implemented, converting to LTL...
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (F (((p47 <= 0))))
lola: processed formula length: 20
lola: 28 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: 1381 markings, 1796 edges
lola: ========================================
lola: subprocess 3 will run for 891 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G ((((p271 <= 0)) OR ((1 <= p122)))))
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 ((((p271 <= 0)) OR ((1 <= p122)))))
lola: processed formula length: 41
lola: 28 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: 502 markings, 634 edges
lola: ========================================
lola: subprocess 4 will run for 1189 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G ((((p61 <= 0)) OR ((1 <= p78)))))
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 ((((p61 <= 0)) OR ((1 <= p78)))))
lola: processed formula length: 39
lola: 28 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: 167 markings, 202 edges
lola: ========================================
lola: subprocess 5 will run for 1783 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G (((((1 <= p113)) AND ((p258 <= 0))) OR ((p169 <= 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 <= p113)) AND ((p258 <= 0))) OR ((p169 <= 0)))))
lola: processed formula length: 61
lola: 28 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: 563684 markings, 2444300 edges, 112737 markings/sec, 0 secs
lola: 1036798 markings, 4719809 edges, 94623 markings/sec, 5 secs
lola: 1438013 markings, 6918019 edges, 80243 markings/sec, 10 secs
lola: 1837035 markings, 9101165 edges, 79804 markings/sec, 15 secs
lola: 2252084 markings, 11411312 edges, 83010 markings/sec, 20 secs
lola: 2583439 markings, 13768756 edges, 66271 markings/sec, 25 secs
lola: 2909111 markings, 16049746 edges, 65134 markings/sec, 30 secs
lola: 3243221 markings, 18332628 edges, 66822 markings/sec, 35 secs
lola: 3555986 markings, 20638761 edges, 62553 markings/sec, 40 secs
lola: 3895001 markings, 22918974 edges, 67803 markings/sec, 45 secs
lola: 4215656 markings, 25179287 edges, 64131 markings/sec, 50 secs
lola: 4501614 markings, 27484309 edges, 57192 markings/sec, 55 secs
lola: 4824118 markings, 29718542 edges, 64501 markings/sec, 60 secs
lola: 5068035 markings, 32092615 edges, 48783 markings/sec, 65 secs
lola: 5437618 markings, 34555828 edges, 73917 markings/sec, 70 secs
lola: 5692566 markings, 36915288 edges, 50990 markings/sec, 75 secs
lola: 6097557 markings, 39347762 edges, 80998 markings/sec, 80 secs
lola: 6441100 markings, 41760142 edges, 68709 markings/sec, 85 secs
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: 6607929 markings, 42588904 edges
lola: ========================================
lola: subprocess 6 will run for 3475 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G ((((p16 <= 0)) OR ((1 <= p71))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((((p16 <= 0)) OR ((1 <= p71))))
lola: processed formula length: 35
lola: 28 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: 47 markings, 47 edges
lola: ========================================
lola: RESULT
lola:
SUMMARY: no no no no no no no
lola:
preliminary result: no no no no no no no
lola: memory consumption: 24716 KB
lola: time consumption: 95 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="SmartHome-PT-15"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="itslola"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
# 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 itslola"
echo " Input is SmartHome-PT-15, 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 r228-oct2-159033547100113"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/SmartHome-PT-15.tgz
mv SmartHome-PT-15 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 ;