About the Execution of ITS-LoLa for DLCround-PT-06a
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
15756.480 | 3600000.00 | 130324.00 | 270.10 | FTFTTFTTFTFTFTTT | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/mnt/tpsp/fkordon/mcc2020-input.r180-ebro-158987900300497.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2020-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 itslola
Input is DLCround-PT-06a, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r180-ebro-158987900300497
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 500K
-rw-r--r-- 1 mcc users 3.2K Mar 30 18:53 CTLCardinality.txt
-rw-r--r-- 1 mcc users 19K Mar 30 18:53 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Mar 29 08:53 CTLFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 29 08:53 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 24 05:37 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 5.9K Mar 24 05:37 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.2K Apr 8 14:50 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 28 14:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K Apr 8 14:50 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Apr 28 14:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.3K Mar 28 04:51 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 17K Mar 28 04:51 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Mar 26 23:21 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 15K Mar 26 23:21 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 28 14:49 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Mar 28 14:49 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 24 05:37 instance
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 iscolored
-rw-r--r-- 1 mcc users 325K Mar 24 05:37 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 DLCround-PT-06a-00
FORMULA_NAME DLCround-PT-06a-01
FORMULA_NAME DLCround-PT-06a-02
FORMULA_NAME DLCround-PT-06a-03
FORMULA_NAME DLCround-PT-06a-04
FORMULA_NAME DLCround-PT-06a-05
FORMULA_NAME DLCround-PT-06a-06
FORMULA_NAME DLCround-PT-06a-07
FORMULA_NAME DLCround-PT-06a-08
FORMULA_NAME DLCround-PT-06a-09
FORMULA_NAME DLCround-PT-06a-10
FORMULA_NAME DLCround-PT-06a-11
FORMULA_NAME DLCround-PT-06a-12
FORMULA_NAME DLCround-PT-06a-13
FORMULA_NAME DLCround-PT-06a-14
FORMULA_NAME DLCround-PT-06a-15
=== Now, execution of the tool begins
BK_START 1591237868010
bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-04 02:31: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]
[2020-06-04 02:31:11] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-04 02:31:11] [INFO ] Load time of PNML (sax parser for PT used): 224 ms
[2020-06-04 02:31:11] [INFO ] Transformed 197 places.
[2020-06-04 02:31:11] [INFO ] Transformed 1313 transitions.
[2020-06-04 02:31:11] [INFO ] Found NUPN structural information;
[2020-06-04 02:31:11] [INFO ] Parsed PT model containing 197 places and 1313 transitions in 314 ms.
Ensure Unique test removed 135 transitions
Reduce redundant transitions removed 135 transitions.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 71 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100000 steps, including 0 resets, run finished after 950 ms. (steps per millisecond=105 ) properties seen :[1, 1, 1, 0, 0, 1, 1, 1, 1, 0, 0, 1, 0, 1, 0, 1, 1, 0, 1, 1, 0, 0, 1, 1, 0]
[2020-06-04 02:31:12] [INFO ] Flow matrix only has 154 transitions (discarded 1024 similar events)
// Phase 1: matrix 154 rows 197 cols
[2020-06-04 02:31:12] [INFO ] Computed 109 place invariants in 30 ms
[2020-06-04 02:31:13] [INFO ] [Real]Absence check using 109 positive place invariants in 90 ms returned sat
[2020-06-04 02:31:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 02:31:13] [INFO ] [Real]Absence check using state equation in 217 ms returned sat
[2020-06-04 02:31:13] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 02:31:13] [INFO ] [Nat]Absence check using 109 positive place invariants in 30 ms returned unsat
[2020-06-04 02:31:13] [INFO ] [Real]Absence check using 109 positive place invariants in 60 ms returned sat
[2020-06-04 02:31:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 02:31:13] [INFO ] [Real]Absence check using state equation in 208 ms returned sat
[2020-06-04 02:31:13] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 02:31:14] [INFO ] [Nat]Absence check using 109 positive place invariants in 16 ms returned unsat
[2020-06-04 02:31:14] [INFO ] [Real]Absence check using 109 positive place invariants in 56 ms returned sat
[2020-06-04 02:31:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 02:31:14] [INFO ] [Real]Absence check using state equation in 206 ms returned sat
[2020-06-04 02:31:14] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 02:31:14] [INFO ] [Nat]Absence check using 109 positive place invariants in 44 ms returned unsat
[2020-06-04 02:31:14] [INFO ] [Real]Absence check using 109 positive place invariants in 62 ms returned sat
[2020-06-04 02:31:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 02:31:14] [INFO ] [Real]Absence check using state equation in 195 ms returned sat
[2020-06-04 02:31:14] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 02:31:14] [INFO ] [Nat]Absence check using 109 positive place invariants in 12 ms returned unsat
[2020-06-04 02:31:14] [INFO ] [Real]Absence check using 109 positive place invariants in 50 ms returned sat
[2020-06-04 02:31:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 02:31:15] [INFO ] [Real]Absence check using state equation in 197 ms returned sat
[2020-06-04 02:31:15] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 02:31:15] [INFO ] [Nat]Absence check using 109 positive place invariants in 39 ms returned unsat
[2020-06-04 02:31:15] [INFO ] [Real]Absence check using 109 positive place invariants in 55 ms returned sat
[2020-06-04 02:31:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 02:31:15] [INFO ] [Real]Absence check using state equation in 189 ms returned sat
[2020-06-04 02:31:15] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 02:31:15] [INFO ] [Nat]Absence check using 109 positive place invariants in 13 ms returned unsat
[2020-06-04 02:31:15] [INFO ] [Real]Absence check using 109 positive place invariants in 50 ms returned sat
[2020-06-04 02:31:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 02:31:16] [INFO ] [Real]Absence check using state equation in 308 ms returned sat
[2020-06-04 02:31:16] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 02:31:16] [INFO ] [Nat]Absence check using 109 positive place invariants in 56 ms returned unsat
[2020-06-04 02:31:16] [INFO ] [Real]Absence check using 109 positive place invariants in 56 ms returned sat
[2020-06-04 02:31:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 02:31:16] [INFO ] [Real]Absence check using state equation in 208 ms returned sat
[2020-06-04 02:31:16] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 02:31:16] [INFO ] [Nat]Absence check using 109 positive place invariants in 48 ms returned unsat
[2020-06-04 02:31:16] [INFO ] [Real]Absence check using 109 positive place invariants in 55 ms returned sat
[2020-06-04 02:31:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 02:31:17] [INFO ] [Real]Absence check using state equation in 232 ms returned sat
[2020-06-04 02:31:17] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 02:31:17] [INFO ] [Nat]Absence check using 109 positive place invariants in 288 ms returned unsat
[2020-06-04 02:31:17] [INFO ] [Real]Absence check using 109 positive place invariants in 52 ms returned sat
[2020-06-04 02:31:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 02:31:17] [INFO ] [Real]Absence check using state equation in 239 ms returned sat
[2020-06-04 02:31:18] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 02:31:18] [INFO ] [Nat]Absence check using 109 positive place invariants in 112 ms returned unsat
Successfully simplified 10 atomic propositions for a total of 12 simplifications.
[2020-06-04 02:31:19] [INFO ] Initial state reduction rules for CTL removed 13 formulas.
[2020-06-04 02:31:19] [INFO ] Flatten gal took : 260 ms
FORMULA DLCround-PT-06a-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DLCround-PT-06a-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DLCround-PT-06a-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DLCround-PT-06a-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DLCround-PT-06a-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DLCround-PT-06a-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DLCround-PT-06a-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DLCround-PT-06a-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DLCround-PT-06a-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DLCround-PT-06a-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DLCround-PT-06a-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DLCround-PT-06a-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DLCround-PT-06a-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-06-04 02:31:19] [INFO ] Applying decomposition
[2020-06-04 02:31:19] [INFO ] Flatten gal took : 105 ms
[2020-06-04 02:31:19] [INFO ] Decomposing Gal with order
[2020-06-04 02:31:19] [INFO ] Rewriting arrays to variables to allow decomposition.
[2020-06-04 02:31:19] [INFO ] Removed a total of 1866 redundant transitions.
[2020-06-04 02:31:20] [INFO ] Flatten gal took : 411 ms
[2020-06-04 02:31:20] [INFO ] Fuse similar labels procedure discarded/fused a total of 104 labels/synchronizations in 87 ms.
[2020-06-04 02:31:20] [INFO ] Export to MCC properties in file /home/mcc/execution/LTLCardinality.sr.xml took 40 ms.
[2020-06-04 02:31:20] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 28 ms.
info: Time: 3600 - MCC
vrfy: Checking LTLCardinality @ DLCround-PT-06a @ 3570 seconds
FORMULA DLCround-PT-06a-08 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA DLCround-PT-06a-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA DLCround-PT-06a-02 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 3471
rslt: Output for LTLCardinality @ DLCround-PT-06a
{
"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": "Thu Jun 4 02:31:21 2020
",
"timelimit": 3570
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1188
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 1,
"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": "X (G ((((p62 <= 0)) OR ((1 <= p55)))))",
"processed_size": 39,
"rewrites": 15
},
"result":
{
"edges": 3520,
"markings": 135,
"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": 1782
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 4,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 2,
"aneg": 3,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 1,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "F ((F (((1 <= p109))) AND (F (((p109 <= 0))) OR G (F (((1 <= p109)))))))",
"processed_size": 72,
"rewrites": 15
},
"result":
{
"edges": 1,
"markings": 2,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 6
},
"compoundnumber": 1,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3565
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 2,
"U": 1,
"X": 0,
"aconj": 7,
"adisj": 4,
"aneg": 0,
"comp": 7,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 7,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 7,
"visible_transitions": 0
},
"processed": "G (F ((((((p11 <= 0)) OR ((1 <= p17))) U ((((p160 <= 0)) OR ((1 <= p103))) AND ((p109 <= 0)))) OR G ((((p90 <= 0)) OR ((1 <= p41)))))))",
"processed_size": 138,
"rewrites": 15
},
"result":
{
"edges": 47260515,
"markings": 4108051,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 4
},
"compoundnumber": 2,
"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": 25936,
"runtime": 99.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "LTLCardinality.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "G(F(((** U **) OR G(**)))) : X(G(**)) : F((F(*) AND (F(*) OR G(F(*)))))"
},
"net":
{
"arcs": 4536,
"conflict_clusters": 21,
"places": 197,
"places_significant": 88,
"singleton_clusters": 0,
"transitions": 1178
},
"result":
{
"preliminary_value": "no no yes ",
"value": "no no yes "
},
"task":
{
"type": "compound"
}
}
lola: LoLA will run for 3570 seconds at most (--timelimit)
lola: NET
lola: input: PNML file (--pnml)
lola: reading net from model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file model.pnml
lola: 1375/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 197
lola: finding significant places
lola: 197 places, 1178 transitions, 88 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: (p17 <= 1)
lola: LP says that atomic proposition is always true: (p103 <= 1)
lola: LP says that atomic proposition is always true: (p109 <= 1)
lola: LP says that atomic proposition is always true: (p41 <= 1)
lola: LP says that atomic proposition is always true: (p55 <= 1)
lola: LP says that atomic proposition is always true: (p109 <= 1)
lola: LP says that atomic proposition is always true: (p109 <= 1)
lola: G (F (X ((((((p11 <= 0)) OR ((1 <= p17))) U ((((p160 <= 0)) OR ((1 <= p103))) AND ((p109 <= 0)))) OR G ((((p90 <= 0)) OR ((1 <= p41)))))))) : G (X ((((p62 <= 0)) OR ((1 <= p55))))) : NOT(G ((G (((1 <= p109))) U G (((p109 <= 0))))))
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
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:332
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 1188 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (G ((((p62 <= 0)) OR ((1 <= p55)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (G ((((p62 <= 0)) OR ((1 <= p55)))))
lola: processed formula length: 39
lola: 15 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: 135 markings, 3520 edges
lola: ========================================
lola: subprocess 1 will run for 1782 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((F (((1 <= p109))) AND (F (((p109 <= 0))) OR G (F (((1 <= p109)))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F ((F (((1 <= p109))) AND (F (((p109 <= 0))) OR G (F (((1 <= p109)))))))
lola: processed formula length: 72
lola: 15 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: 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: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 2 markings, 1 edges
lola: ========================================
lola: subprocess 2 will run for 3565 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (F ((((((p11 <= 0)) OR ((1 <= p17))) U ((((p160 <= 0)) OR ((1 <= p103))) AND ((p109 <= 0)))) OR G ((((p90 <= 0)) OR ((1 <= p41)))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (F ((((((p11 <= 0)) OR ((1 <= p17))) U ((((p160 <= 0)) OR ((1 <= p103))) AND ((p109 <= 0)))) OR G ((((p90 <= 0)) OR ((1 <= p41)))))))
lola: processed formula length: 138
lola: 15 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: 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: 243580 markings, 2795006 edges, 48716 markings/sec, 0 secs
lola: 473635 markings, 5430482 edges, 46011 markings/sec, 5 secs
lola: 701555 markings, 8042496 edges, 45584 markings/sec, 10 secs
lola: 922281 markings, 10588538 edges, 44145 markings/sec, 15 secs
lola: 1144448 markings, 13143706 edges, 44433 markings/sec, 20 secs
lola: 1368336 markings, 15719043 edges, 44778 markings/sec, 25 secs
lola: 1604032 markings, 18412321 edges, 47139 markings/sec, 30 secs
lola: 1830830 markings, 21020487 edges, 45360 markings/sec, 35 secs
lola: 2064605 markings, 23686816 edges, 46755 markings/sec, 40 secs
lola: 2283693 markings, 26206590 edges, 43818 markings/sec, 45 secs
lola: 2509244 markings, 28789504 edges, 45110 markings/sec, 50 secs
lola: 2714848 markings, 31167993 edges, 41121 markings/sec, 55 secs
lola: 2932440 markings, 33684893 edges, 43518 markings/sec, 60 secs
lola: 3146177 markings, 36150109 edges, 42747 markings/sec, 65 secs
lola: 3357572 markings, 38602365 edges, 42279 markings/sec, 70 secs
lola: 3569175 markings, 41019445 edges, 42321 markings/sec, 75 secs
lola: 3782240 markings, 43470151 edges, 42613 markings/sec, 80 secs
lola: 3986819 markings, 45837890 edges, 40916 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: 4108051 markings, 47260515 edges
lola: ========================================
lola: RESULT
lola:
SUMMARY: no no yes
lola:
preliminary result: no no yes
lola: memory consumption: 25936 KB
lola: time consumption: 99 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="DLCround-PT-06a"
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 DLCround-PT-06a, 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 r180-ebro-158987900300497"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/DLCround-PT-06a.tgz
mv DLCround-PT-06a 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 ;