About the Execution of 2020-gold for SmallOperatingSystem-PT-MT0512DC0128
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
16256.012 | 3600000.00 | 496757.00 | 77788.50 | FTTFTFFF?FFFFTFT | 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.r265-tall-162106800200037.qcow2', fmt=qcow2 size=4294967296 backing_file='/data/fkordon/mcc2021-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
..................
=====================================================================
Generated by BenchKit 2-4028
Executing tool gold2020
Input is SmallOperatingSystem-PT-MT0512DC0128, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r265-tall-162106800200037
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 392K
-rw-r--r-- 1 mcc users 18K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 114K May 10 09:44 CTLCardinality.xml
-rw-r--r-- 1 mcc users 11K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 77K 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.7K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.2K Mar 28 16:42 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Mar 28 16:42 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Mar 28 16:42 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 28 16:42 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.7K Mar 27 13:40 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 21K Mar 27 13:40 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.3K Mar 25 19:28 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 25 19:28 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.0K Mar 22 08:16 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.1K 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 13 May 5 16:52 instance
-rw-r--r-- 1 mcc users 6 May 5 16:52 iscolored
-rw-r--r-- 1 mcc users 8.2K 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 SmallOperatingSystem-PT-MT0512DC0128-00
FORMULA_NAME SmallOperatingSystem-PT-MT0512DC0128-01
FORMULA_NAME SmallOperatingSystem-PT-MT0512DC0128-02
FORMULA_NAME SmallOperatingSystem-PT-MT0512DC0128-03
FORMULA_NAME SmallOperatingSystem-PT-MT0512DC0128-04
FORMULA_NAME SmallOperatingSystem-PT-MT0512DC0128-05
FORMULA_NAME SmallOperatingSystem-PT-MT0512DC0128-06
FORMULA_NAME SmallOperatingSystem-PT-MT0512DC0128-07
FORMULA_NAME SmallOperatingSystem-PT-MT0512DC0128-08
FORMULA_NAME SmallOperatingSystem-PT-MT0512DC0128-09
FORMULA_NAME SmallOperatingSystem-PT-MT0512DC0128-10
FORMULA_NAME SmallOperatingSystem-PT-MT0512DC0128-11
FORMULA_NAME SmallOperatingSystem-PT-MT0512DC0128-12
FORMULA_NAME SmallOperatingSystem-PT-MT0512DC0128-13
FORMULA_NAME SmallOperatingSystem-PT-MT0512DC0128-14
FORMULA_NAME SmallOperatingSystem-PT-MT0512DC0128-15
=== Now, execution of the tool begins
BK_START 1621195103981
bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2021-05-16 19:58:25] [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-16 19:58:25] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-16 19:58:25] [INFO ] Load time of PNML (sax parser for PT used): 21 ms
[2021-05-16 19:58:25] [INFO ] Transformed 9 places.
[2021-05-16 19:58:25] [INFO ] Transformed 8 transitions.
[2021-05-16 19:58:25] [INFO ] Parsed PT model containing 9 places and 8 transitions in 58 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 14 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100135 steps, including 0 resets, run finished after 51 ms. (steps per millisecond=1963 ) properties seen :[1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 0, 1, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 0, 0, 0, 1, 0, 1, 1, 1, 1]
// Phase 1: matrix 8 rows 9 cols
[2021-05-16 19:58:25] [INFO ] Computed 4 place invariants in 2 ms
[2021-05-16 19:58:25] [INFO ] [Real]Absence check using 4 positive place invariants in 9 ms returned unsat
[2021-05-16 19:58:25] [INFO ] [Real]Absence check using 4 positive place invariants in 4 ms returned unsat
[2021-05-16 19:58:25] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned unsat
[2021-05-16 19:58:25] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned unsat
[2021-05-16 19:58:25] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned unsat
[2021-05-16 19:58:25] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned unsat
[2021-05-16 19:58:25] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned unsat
[2021-05-16 19:58:25] [INFO ] [Real]Absence check using 4 positive place invariants in 5 ms returned unsat
[2021-05-16 19:58:25] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned unsat
Successfully simplified 9 atomic propositions for a total of 13 simplifications.
[2021-05-16 19:58:26] [INFO ] Initial state reduction rules for CTL removed 8 formulas.
[2021-05-16 19:58:26] [INFO ] Flatten gal took : 21 ms
FORMULA SmallOperatingSystem-PT-MT0512DC0128-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmallOperatingSystem-PT-MT0512DC0128-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmallOperatingSystem-PT-MT0512DC0128-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmallOperatingSystem-PT-MT0512DC0128-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmallOperatingSystem-PT-MT0512DC0128-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmallOperatingSystem-PT-MT0512DC0128-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmallOperatingSystem-PT-MT0512DC0128-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmallOperatingSystem-PT-MT0512DC0128-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-16 19:58:26] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2021-05-16 19:58:26] [INFO ] Flatten gal took : 3 ms
[2021-05-16 19:58:26] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA SmallOperatingSystem-PT-MT0512DC0128-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-16 19:58:26] [INFO ] Export to MCC properties in file /home/mcc/execution/LTLCardinality.sr.xml took 2 ms.
[2021-05-16 19:58:26] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 0 ms.
info: Time: 3600 - MCC
vrfy: Checking LTLCardinality @ SmallOperatingSystem-PT-MT0512DC0128 @ 3570 seconds
FORMULA SmallOperatingSystem-PT-MT0512DC0128-00 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA SmallOperatingSystem-PT-MT0512DC0128-01 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA SmallOperatingSystem-PT-MT0512DC0128-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA SmallOperatingSystem-PT-MT0512DC0128-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA SmallOperatingSystem-PT-MT0512DC0128-06 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA SmallOperatingSystem-PT-MT0512DC0128-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA SmallOperatingSystem-PT-MT0512DC0128-08 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 2916
rslt: Output for LTLCardinality @ SmallOperatingSystem-PT-MT0512DC0128
{
"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": "Sun May 16 19:58:27 2021
",
"timelimit": 3570
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 509
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 2,
"aconj": 0,
"adisj": 0,
"aneg": 3,
"comp": 3,
"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 ((X (((p8 + 1 <= p3) R (p6 + 1 <= p3))) AND (p2 + 1 <= p3)))",
"processed_size": 62,
"rewrites": 31
},
"result":
{
"edges": 5,
"markings": 5,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 5
},
"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": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"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": "(p2 + 1 <= p5)",
"processed_size": 14,
"rewrites": 31
},
"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": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"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 ((p5 <= p2))",
"processed_size": 14,
"rewrites": 31
},
"result":
{
"edges": 1,
"markings": 2,
"produced_by": "LTL model checker",
"value": true
},
"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": true
},
"task":
{
"compoundnumber": 1,
"type": "boolean"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 713
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 713
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "F (G ((p8 <= p3)))",
"processed_size": 18,
"rewrites": 31
},
"result":
{
"edges": 13,
"markings": 9,
"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"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 2,
"type": "boolean"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 892
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 892
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"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": "(p3 <= 0)",
"processed_size": 9,
"rewrites": 33
},
"result":
{
"edges": 3,
"markings": 3,
"produced_by": "state space / EG",
"value": false
},
"task":
{
"compoundnumber": 3,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 2
},
"threads": 1,
"type": "dfs"
},
"type": "eventual_occurrence"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1189
},
"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": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "X (G ((1 <= p5)))",
"processed_size": 17,
"rewrites": 31
},
"result":
{
"edges": 5,
"markings": 5,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"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"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 3,
"type": "boolean"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1189
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "G (F ((1 <= p3)))",
"processed_size": 17,
"rewrites": 31
},
"result":
{
"edges": 4,
"markings": 4,
"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": "fairness",
"workflow": "product automaton"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1784
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 3,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 5,
"taut": 0,
"tconj": 1,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "F ((F (G ((p6 <= p2))) AND G (((2 <= p6) OR G ((p6 <= p2))))))",
"processed_size": 62,
"rewrites": 31
},
"result":
{
"edges": 5,
"markings": 5,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 16
},
"compoundnumber": 5,
"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": 3260,
"runtime": 654.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "LTLCardinality.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "X((X((* R *)) AND *)) : (X(**) OR (G((F(**) AND **)) AND **)) : G(F(**)) : G((F(G(**)) OR (** U **))) : F((F(G(**)) AND G((** OR G(**))))) : (F(G(**)) AND X(**)) : (X(G(**)) OR (F(**) AND (** AND **)))"
},
"net":
{
"arcs": 27,
"conflict_clusters": 4,
"places": 9,
"places_significant": 5,
"singleton_clusters": 0,
"transitions": 8
},
"result":
{
"preliminary_value": "no yes no unknown no no no ",
"value": "no yes no unknown 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: 17/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 288
lola: finding significant places
lola: 9 places, 8 transitions, 5 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: NOT(X ((X (((p3 <= p8) U (p3 <= p6))) OR (p3 <= p2)))) : (X ((p5 <= p2)) OR ((G (F ((2 <= p8))) AND G ((2 <= p8))) AND (p2 + 1 <= p5))) : X (G (((1 <= p3) U F ((1 <= p3))))) : G ((F (NOT(G (NOT(G ((2 <= p7)))))) OR ((p4 <= p8) U (1 <= p1)))) : F (G (((2 <= p6) U G ((p6 <= p2))))) : (F (NOT((F ((1 <= p5)) U NOT(((0 <= 0) U G ((p8 <= p3))))))) AND X ((p8 <= p3))) : (X (G ((1 <= p5))) OR ((((0 <= 0) U (1 <= p3)) AND (1 <= p5)) AND ((p4 <= p7) OR (p2 <= p6))))
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:338
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:522
lola: rewrite Frontend/Parser/formula_rewrite.k:422
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:437
lola: rewrite Frontend/Parser/formula_rewrite.k:374
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:169
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: rewrite Frontend/Parser/formula_rewrite.k:425
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:169
lola: rewrite Frontend/Parser/formula_rewrite.k:251
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 ((X (((p8 + 1 <= p3) R (p6 + 1 <= p3))) AND (p2 + 1 <= p3)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((X (((p8 + 1 <= p3) R (p6 + 1 <= p3))) AND (p2 + 1 <= p3)))
lola: processed formula length: 62
lola: 31 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: 5 markings, 5 edges
lola: ========================================
lola: subprocess 1 will run for 594 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (X ((p5 <= p2)) OR (G ((F ((2 <= p8)) AND (2 <= p8))) AND (p2 + 1 <= p5)))
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: (p2 + 1 <= p5)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p2 + 1 <= p5)
lola: processed formula length: 14
lola: 31 rewrites
lola: closed formula file LTLCardinality.xml
lola: processed formula with 1 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 ((p5 <= p2))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((p5 <= p2))
lola: processed formula length: 14
lola: 31 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: 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: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 2 will run for 713 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (F (G ((p8 <= p3))) AND X ((p8 <= p3)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 2 will run for 713 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G ((p8 <= p3)))
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 ((p8 <= p3)))
lola: processed formula length: 18
lola: 31 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 7
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: 9 markings, 13 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 3 will run for 892 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (X (G ((1 <= p5))) OR (F ((1 <= p3)) AND ((1 <= p5) AND ((p4 <= p7) OR (p2 <= p6)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 3 will run for 892 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((1 <= p3))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:750
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: (p3 <= 0)
lola: processed formula length: 9
lola: 33 rewrites
lola: closed formula file LTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: state space / EG
lola: The predicate does not eventually occur.
lola: 3 markings, 3 edges
lola: ========================================
lola: subprocess 4 will run for 1189 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (G ((1 <= p5)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (G ((1 <= p5)))
lola: processed formula length: 17
lola: 31 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: 5 markings, 5 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 4 will run for 1189 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (F ((1 <= p3)))
lola: ========================================
lola: SUBTASK
lola: checking fairness
lola: fairness not yet implemented, converting to LTL...
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (F ((1 <= p3)))
lola: processed formula length: 17
lola: 31 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: 4 markings, 4 edges
lola: ========================================
lola: subprocess 5 will run for 1784 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((F (G ((p6 <= p2))) AND G (((2 <= p6) OR G ((p6 <= p2))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F ((F (G ((p6 <= p2))) AND G (((2 <= p6) OR G ((p6 <= p2))))))
lola: processed formula length: 62
lola: 31 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 16 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: 5 markings, 5 edges
lola: ========================================
lola: subprocess 6 will run for 3568 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G ((F (G ((2 <= p7))) OR ((p4 <= p8) U (1 <= p1))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((F (G ((2 <= p7))) OR ((p4 <= p8) U (1 <= p1))))
lola: processed formula length: 51
lola: 31 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: 3380050 markings, 8402785 edges, 676010 markings/sec, 0 secs
lola: 6648891 markings, 16738875 edges, 653768 markings/sec, 5 secs
lola: 9259505 markings, 24232097 edges, 522123 markings/sec, 10 secs
lola: 11732949 markings, 31368716 edges, 494689 markings/sec, 15 secs
lola: 14108531 markings, 38224909 edges, 475116 markings/sec, 20 secs
lola: 16488067 markings, 45114238 edges, 475907 markings/sec, 25 secs
lola: 18832953 markings, 51933835 edges, 468977 markings/sec, 30 secs
lola: 21156607 markings, 58720426 edges, 464731 markings/sec, 35 secs
lola: 23532854 markings, 65651892 edges, 475249 markings/sec, 40 secs
lola: 26002939 markings, 72860167 edges, 494017 markings/sec, 45 secs
lola: 28334667 markings, 79696596 edges, 466346 markings/sec, 50 secs
lola: 30654168 markings, 86479436 edges, 463900 markings/sec, 55 secs
lola: 33002947 markings, 93334435 edges, 469756 markings/sec, 60 secs
lola: 35331962 markings, 100146570 edges, 465803 markings/sec, 65 secs
lola: 37657870 markings, 106979611 edges, 465182 markings/sec, 70 secs
lola: 40005846 markings, 113864093 edges, 469595 markings/sec, 75 secs
lola: 42321514 markings, 120680064 edges, 463134 markings/sec, 80 secs
lola: 44663992 markings, 127516722 edges, 468496 markings/sec, 85 secs
lola: 47062930 markings, 134514648 edges, 479788 markings/sec, 90 secs
lola: 49417058 markings, 141362532 edges, 470826 markings/sec, 95 secs
lola: 51732865 markings, 148170401 edges, 463161 markings/sec, 100 secs
lola: 54094816 markings, 155089437 edges, 472390 markings/sec, 105 secs
lola: 56427616 markings, 161974426 edges, 466560 markings/sec, 110 secs
lola: 58740850 markings, 168744342 edges, 462647 markings/sec, 115 secs
lola: 61081639 markings, 175584809 edges, 468158 markings/sec, 120 secs
lola: 63411817 markings, 182437139 edges, 466036 markings/sec, 125 secs
lola: 65655094 markings, 189044573 edges, 448655 markings/sec, 130 secs
lola: 67823526 markings, 195375420 edges, 433686 markings/sec, 135 secs
lola: 70022781 markings, 201848442 edges, 439851 markings/sec, 140 secs
lola: 72208571 markings, 208275183 edges, 437158 markings/sec, 145 secs
lola: 74434440 markings, 214807938 edges, 445174 markings/sec, 150 secs
lola: 76563237 markings, 221093785 edges, 425759 markings/sec, 155 secs
lola: 78887253 markings, 227838751 edges, 464803 markings/sec, 160 secs
lola: 81021744 markings, 234173252 edges, 426898 markings/sec, 165 secs
lola: 83253774 markings, 240711405 edges, 446406 markings/sec, 170 secs
lola: 85415562 markings, 247105130 edges, 432358 markings/sec, 175 secs
lola: 87500153 markings, 253223972 edges, 416918 markings/sec, 180 secs
lola: 88394935 markings, 255852335 edges, 178956 markings/sec, 185 secs
lola: 90494823 markings, 262017676 edges, 419978 markings/sec, 190 secs
lola: 92201500 markings, 267037454 edges, 341335 markings/sec, 195 secs
lola: 93314551 markings, 270322789 edges, 222610 markings/sec, 200 secs
lola: 94548524 markings, 273935632 edges, 246795 markings/sec, 205 secs
lola: 95534469 markings, 276802065 edges, 197189 markings/sec, 210 secs
lola: 96882272 markings, 280805030 edges, 269561 markings/sec, 215 secs
lola: 98160641 markings, 284558912 edges, 255674 markings/sec, 220 secs
lola: 100175420 markings, 290491590 edges, 402956 markings/sec, 225 secs
lola: 100804190 markings, 292306004 edges, 125754 markings/sec, 230 secs
lola: 102019146 markings, 295855053 edges, 242991 markings/sec, 235 secs
lola: 102623887 markings, 297620895 edges, 120948 markings/sec, 240 secs
lola: 103034111 markings, 298841308 edges, 82045 markings/sec, 245 secs
lola: 104344792 markings, 302691470 edges, 262136 markings/sec, 250 secs
lola: 105168506 markings, 305110460 edges, 164743 markings/sec, 255 secs
lola: 105168506 markings, 305110460 edges, 0 markings/sec, 260 secs
lola: 106761976 markings, 309828595 edges, 318694 markings/sec, 265 secs
lola: 106920436 markings, 310298558 edges, 31692 markings/sec, 270 secs
lola: 107352065 markings, 311564695 edges, 86326 markings/sec, 275 secs
lola: Child process aborted or communication problem between parent and child process
lola: ========================================
lola: ...considering subproblem: G ((F (G ((2 <= p7))) OR ((p4 <= p8) U (1 <= p1))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((F (G ((2 <= p7))) OR ((p4 <= p8) U (1 <= p1))))
lola: processed formula length: 51
lola: 31 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: 3371745 markings, 8381944 edges, 674349 markings/sec, 0 secs
lola: 6620561 markings, 16659618 edges, 649763 markings/sec, 5 secs
lola: 9358266 markings, 24516667 edges, 547541 markings/sec, 10 secs
lola: 11914672 markings, 31889155 edges, 511281 markings/sec, 15 secs
lola: 14413865 markings, 39091941 edges, 499839 markings/sec, 20 secs
lola: 16829965 markings, 46102928 edges, 483220 markings/sec, 25 secs
lola: 19212741 markings, 53042100 edges, 476555 markings/sec, 30 secs
lola: 21513856 markings, 59767195 edges, 460223 markings/sec, 35 secs
lola: 23835549 markings, 66524074 edges, 464339 markings/sec, 40 secs
lola: 26114583 markings, 73187492 edges, 455807 markings/sec, 45 secs
lola: 28357613 markings, 79768389 edges, 448606 markings/sec, 50 secs
lola: 30677578 markings, 86551319 edges, 463993 markings/sec, 55 secs
lola: 33148779 markings, 93760467 edges, 494240 markings/sec, 60 secs
lola: 35496345 markings, 100632524 edges, 469513 markings/sec, 65 secs
lola: 37705821 markings, 107122789 edges, 441895 markings/sec, 70 secs
lola: 39960729 markings, 113729285 edges, 450982 markings/sec, 75 secs
lola: 42178985 markings, 120264506 edges, 443651 markings/sec, 80 secs
lola: 44478848 markings, 126973548 edges, 459973 markings/sec, 85 secs
lola: 46808586 markings, 133768205 edges, 465948 markings/sec, 90 secs
lola: 49073595 markings, 140349944 edges, 453002 markings/sec, 95 secs
lola: 51283377 markings, 146870027 edges, 441956 markings/sec, 100 secs
lola: 53572033 markings, 153541802 edges, 457731 markings/sec, 105 secs
lola: 55768361 markings, 160043202 edges, 439266 markings/sec, 110 secs
lola: 57974305 markings, 166501544 edges, 441189 markings/sec, 115 secs
lola: 60203286 markings, 173009159 edges, 445796 markings/sec, 120 secs
lola: 62472297 markings, 179674235 edges, 453802 markings/sec, 125 secs
lola: 64711228 markings, 186238521 edges, 447786 markings/sec, 130 secs
lola: 66865215 markings, 192582670 edges, 430797 markings/sec, 135 secs
lola: 69102559 markings, 199134038 edges, 447469 markings/sec, 140 secs
lola: 71303337 markings, 205644145 edges, 440156 markings/sec, 145 secs
lola: 73576859 markings, 212272138 edges, 454704 markings/sec, 150 secs
lola: 75713070 markings, 218594035 edges, 427242 markings/sec, 155 secs
lola: 77938227 markings, 225085131 edges, 445031 markings/sec, 160 secs
lola: 80139254 markings, 231538808 edges, 440205 markings/sec, 165 secs
lola: 82239967 markings, 237738721 edges, 420143 markings/sec, 170 secs
lola: 84419426 markings, 244134544 edges, 435892 markings/sec, 175 secs
lola: 86552518 markings, 250427125 edges, 426618 markings/sec, 180 secs
lola: 87518133 markings, 253277363 edges, 193123 markings/sec, 185 secs
lola: 89509938 markings, 259141049 edges, 398361 markings/sec, 190 secs
lola: 89669659 markings, 259600266 edges, 31944 markings/sec, 195 secs
lola: 90121785 markings, 260926599 edges, 90425 markings/sec, 200 secs
lola: 91447915 markings, 264830663 edges, 265226 markings/sec, 205 secs
lola: 91447915 markings, 264830663 edges, 0 markings/sec, 210 secs
lola: 92177671 markings, 266968467 edges, 145951 markings/sec, 215 secs
lola: 93314551 markings, 270322789 edges, 227376 markings/sec, 220 secs
lola: 93314551 markings, 270322789 edges, 0 markings/sec, 225 secs
lola: 93314551 markings, 270322789 edges, 0 markings/sec, 230 secs
lola: 94533352 markings, 273891343 edges, 243760 markings/sec, 235 secs
lola: 95399790 markings, 276411451 edges, 173288 markings/sec, 240 secs
lola: 95413268 markings, 276453687 edges, 2696 markings/sec, 245 secs
lola: 96362879 markings, 279247029 edges, 189922 markings/sec, 250 secs
lola: 97424112 markings, 282428771 edges, 212247 markings/sec, 255 secs
lola: 97424112 markings, 282428771 edges, 0 markings/sec, 260 secs
lola: 97433536 markings, 282455062 edges, 1885 markings/sec, 265 secs
lola: 99448139 markings, 288384264 edges, 402921 markings/sec, 270 secs
lola: 99466120 markings, 288437706 edges, 3596 markings/sec, 275 secs
lola: 99466621 markings, 288439230 edges, 100 markings/sec, 280 secs
lola: 100383751 markings, 291108354 edges, 183426 markings/sec, 285 secs
lola: 101291556 markings, 293722642 edges, 181561 markings/sec, 290 secs
lola: 101291556 markings, 293722642 edges, 0 markings/sec, 295 secs
lola: 102164390 markings, 296284979 edges, 174567 markings/sec, 300 secs
lola: 103165862 markings, 299223924 edges, 200294 markings/sec, 305 secs
lola: 103165862 markings, 299223924 edges, 0 markings/sec, 310 secs
lola: 105017086 markings, 304673051 edges, 370245 markings/sec, 315 secs
lola: 105248477 markings, 305345689 edges, 46278 markings/sec, 320 secs
lola: 105945324 markings, 307399130 edges, 139369 markings/sec, 325 secs
lola: 107139368 markings, 310944252 edges, 238809 markings/sec, 330 secs
lola: 107139368 markings, 310944252 edges, 0 markings/sec, 335 secs
lola: Child process aborted or communication problem between parent and child process
lola: RESULT
lola:
SUMMARY: no yes no unknown no no no
lola:
preliminary result: no yes no unknown no no no
lola: memory consumption: 3260 KB
lola: time consumption: 654 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="SmallOperatingSystem-PT-MT0512DC0128"
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 SmallOperatingSystem-PT-MT0512DC0128, 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 r265-tall-162106800200037"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/SmallOperatingSystem-PT-MT0512DC0128.tgz
mv SmallOperatingSystem-PT-MT0512DC0128 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 ;