About the Execution of ITS-LoLa for BridgeAndVehicles-COL-V20P10N20
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
15743.250 | 3600000.00 | 458018.00 | 633.30 | TTFTF?FTT?FF?F?T | 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.r182-oct2-158987913500153.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 BridgeAndVehicles-COL-V20P10N20, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r182-oct2-158987913500153
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 224K
-rw-r--r-- 1 mcc users 3.6K Mar 26 02:23 CTLCardinality.txt
-rw-r--r-- 1 mcc users 17K Mar 26 02:23 CTLCardinality.xml
-rw-r--r-- 1 mcc users 3.6K Mar 25 20:52 CTLFireability.txt
-rw-r--r-- 1 mcc users 21K Mar 25 20:51 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 24 05:37 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.1K Mar 24 05:37 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.9K Apr 8 14:42 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 28 14:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Apr 8 14:42 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 28 14:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Mar 25 17:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 20K Mar 25 17:21 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.3K Mar 25 12:17 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 16K Mar 25 12:17 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Mar 25 17:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.0K Mar 25 17:54 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 24 05:37 equiv_pt
-rw-r--r-- 1 mcc users 10 Mar 24 05:37 instance
-rw-r--r-- 1 mcc users 5 Mar 24 05:37 iscolored
-rw-r--r-- 1 mcc users 40K 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 BridgeAndVehicles-COL-V20P10N20-00
FORMULA_NAME BridgeAndVehicles-COL-V20P10N20-01
FORMULA_NAME BridgeAndVehicles-COL-V20P10N20-02
FORMULA_NAME BridgeAndVehicles-COL-V20P10N20-03
FORMULA_NAME BridgeAndVehicles-COL-V20P10N20-04
FORMULA_NAME BridgeAndVehicles-COL-V20P10N20-05
FORMULA_NAME BridgeAndVehicles-COL-V20P10N20-06
FORMULA_NAME BridgeAndVehicles-COL-V20P10N20-07
FORMULA_NAME BridgeAndVehicles-COL-V20P10N20-08
FORMULA_NAME BridgeAndVehicles-COL-V20P10N20-09
FORMULA_NAME BridgeAndVehicles-COL-V20P10N20-10
FORMULA_NAME BridgeAndVehicles-COL-V20P10N20-11
FORMULA_NAME BridgeAndVehicles-COL-V20P10N20-12
FORMULA_NAME BridgeAndVehicles-COL-V20P10N20-13
FORMULA_NAME BridgeAndVehicles-COL-V20P10N20-14
FORMULA_NAME BridgeAndVehicles-COL-V20P10N20-15
=== Now, execution of the tool begins
BK_START 1591128601591
bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-02 20:10:03] [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-02 20:10:03] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-02 20:10:03] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
SLF4J: Failed to load class "org.slf4j.impl.StaticLoggerBinder".
SLF4J: Defaulting to no-operation (NOP) logger implementation
SLF4J: See http://www.slf4j.org/codes.html#StaticLoggerBinder for further details.
[2020-06-02 20:10:04] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 478 ms
[2020-06-02 20:10:04] [INFO ] sort/places :
sens->CONTROLEUR,CHOIX,VIDANGE,
compteur->COMPTEUR,
Dot->CAPACITE,SORTI_A,ROUTE_A,ATTENTE_A,SUR_PONT_A,SUR_PONT_B,ATTENTE_B,ROUTE_B,SORTI_B,
voitureA->NB_ATTENTE_A,
voitureB->NB_ATTENTE_B,
[2020-06-02 20:10:04] [INFO ] Imported 15 HL places and 11 HL transitions for a total of 78 PT places and 37258.0 transition bindings in 17 ms.
[2020-06-02 20:10:04] [INFO ] Computed order based on color domains.
[2020-06-02 20:10:04] [INFO ] Unfolded HLPN to a Petri net with 78 places and 968 transitions in 17 ms.
[2020-06-02 20:10:04] [INFO ] Unfolded HLPN properties in 1 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 42 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100000 steps, including 575 resets, run finished after 400 ms. (steps per millisecond=250 ) properties seen :[0, 1, 1, 1, 0, 1, 1, 0, 1, 0, 1, 0, 1, 1, 1, 1, 1, 1, 0, 1, 0, 0, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1]
[2020-06-02 20:10:04] [INFO ] Flow matrix only has 170 transitions (discarded 798 similar events)
// Phase 1: matrix 170 rows 78 cols
[2020-06-02 20:10:04] [INFO ] Computed 7 place invariants in 8 ms
[2020-06-02 20:10:04] [INFO ] [Real]Absence check using 7 positive place invariants in 14 ms returned unsat
[2020-06-02 20:10:04] [INFO ] [Real]Absence check using 7 positive place invariants in 4 ms returned unsat
[2020-06-02 20:10:04] [INFO ] [Real]Absence check using 7 positive place invariants in 3 ms returned unsat
[2020-06-02 20:10:04] [INFO ] [Real]Absence check using 7 positive place invariants in 3 ms returned unsat
[2020-06-02 20:10:04] [INFO ] [Real]Absence check using 7 positive place invariants in 3 ms returned unsat
[2020-06-02 20:10:04] [INFO ] [Real]Absence check using 7 positive place invariants in 3 ms returned unsat
[2020-06-02 20:10:05] [INFO ] [Real]Absence check using 7 positive place invariants in 3 ms returned unsat
[2020-06-02 20:10:05] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned unsat
[2020-06-02 20:10:05] [INFO ] [Real]Absence check using 7 positive place invariants in 3 ms returned unsat
Successfully simplified 9 atomic propositions for a total of 11 simplifications.
[2020-06-02 20:10:05] [INFO ] Initial state reduction rules for CTL removed 7 formulas.
[2020-06-02 20:10:05] [INFO ] Flatten gal took : 91 ms
FORMULA BridgeAndVehicles-COL-V20P10N20-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-COL-V20P10N20-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-COL-V20P10N20-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-COL-V20P10N20-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-COL-V20P10N20-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-COL-V20P10N20-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-COL-V20P10N20-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-06-02 20:10:05] [INFO ] Applying decomposition
[2020-06-02 20:10:05] [INFO ] Flatten gal took : 60 ms
[2020-06-02 20:10:05] [INFO ] Decomposing Gal with order
[2020-06-02 20:10:05] [INFO ] Rewriting arrays to variables to allow decomposition.
[2020-06-02 20:10:05] [INFO ] Removed a total of 5350 redundant transitions.
[2020-06-02 20:10:05] [INFO ] Flatten gal took : 185 ms
[2020-06-02 20:10:05] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 20 ms.
[2020-06-02 20:10:05] [INFO ] Export to MCC properties in file /home/mcc/execution/LTLCardinality.sr.xml took 1 ms.
[2020-06-02 20:10:05] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 14 ms.
info: Time: 3600 - MCC
vrfy: Checking LTLCardinality @ BridgeAndVehicles-COL-V20P10N20 @ 3570 seconds
FORMULA BridgeAndVehicles-COL-V20P10N20-00 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA BridgeAndVehicles-COL-V20P10N20-01 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA BridgeAndVehicles-COL-V20P10N20-02 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA BridgeAndVehicles-COL-V20P10N20-03 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA BridgeAndVehicles-COL-V20P10N20-04 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: -1
rslt: Output for LTLCardinality @ BridgeAndVehicles-COL-V20P10N20
{
"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": "Tue Jun 2 20:10:05 2020
",
"timelimit": 3570
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 392
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "G (F ((X ((p23 <= p22)) OR (p23 <= p22))))",
"processed_size": 42,
"rewrites": 56
},
"result":
{
"edges": 54850749,
"markings": 12679005,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 2
},
"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": 433
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 433
},
"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": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "(p47 + 1 <= p22)",
"processed_size": 16,
"rewrites": 58
},
"result":
{
"edges": 0,
"markings": 1,
"produced_by": "state space / EG",
"value": true
},
"task":
{
"compoundnumber": 1,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 22
},
"threads": 1,
"type": "dfs"
},
"type": "eventual_occurrence"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 495
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 0,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 1,
"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": "X (F ((p51 + p52 + 1 <= p49)))",
"processed_size": 30,
"rewrites": 56
},
"result":
{
"edges": 3,
"markings": 4,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 2
},
"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": 495
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 495
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"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": "G ((1 <= p53 + p54))",
"processed_size": 20,
"rewrites": 56
},
"result":
{
"edges": 169,
"markings": 169,
"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": "LTL",
"workflow": "product automaton"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 577
},
"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 ((1 <= p53 + p54)))",
"processed_size": 24,
"rewrites": 56
},
"result":
{
"edges": 171,
"markings": 170,
"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"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 2,
"type": "boolean"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 577
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 0,
"U": 0,
"X": 1,
"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": "X (F ((p23 <= 1)))",
"processed_size": 18,
"rewrites": 56
},
"result":
{
"edges": 25048482,
"markings": 7860979,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 3,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 686
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 4,
"U": 0,
"X": 2,
"aconj": 0,
"adisj": 0,
"aneg": 5,
"comp": 5,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 13,
"taut": 0,
"tconj": 2,
"tdisj": 2,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 6,
"visible_transitions": 0
},
"processed": "X (X (G (((G ((p48 + 1 <= p76 + p77)) OR (p49 <= 0)) AND F ((G ((p76 + p77 + 1 <= p53 + p54)) OR (G ((p49 <= 0)) AND (p76 + p77 + 1 <= p53 + p54))))))))",
"processed_size": 152,
"rewrites": 56
},
"result":
{
"edges": 299755749,
"markings": 31738227,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 9
},
"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":
{
"error": null,
"memory": 38228,
"runtime": 3570.000000,
"signal": null,
"timelimitreached": true
},
"files":
{
"formula": "LTLCardinality.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "G(F((X(**) OR **))) : (X(F(*)) AND F(**)) : (G(**) OR (G((X(G(**)) OR **)) AND F(G(**)))) : X(F(*)) : X(X(G(((G(*) OR *) AND F((G(*) OR (G(*) AND *))))))) : F(G(*)) : F((G(*) AND **)) : G((G(*) AND *)) : (F((F((G(**) AND X(G(**)))) AND X(**))) AND F(**))"
},
"net":
{
"arcs": 7350,
"conflict_clusters": 5,
"places": 78,
"places_significant": 71,
"singleton_clusters": 0,
"transitions": 968
},
"result":
{
"interim_value": "yes yes no yes no unknown unknown unknown unknown ",
"preliminary_value": "yes yes no yes no unknown unknown unknown unknown "
},
"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: 1046/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 2496
lola: finding significant places
lola: 78 places, 968 transitions, 71 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: G (F (((p22 + 1 <= p23) U (X ((p23 <= p22)) OR (p23 <= p22))))) : (NOT(G (X ((p49 <= p51 + p52)))) AND F ((p22 <= p47))) : (G ((G (((G ((p25 <= p48)) U (1 <= 0)) U X ((p22 <= p47)))) OR (1 <= p53 + p54))) U G ((1 <= p53 + p54))) : F (X (((1 <= 0) U NOT(G ((2 <= p23)))))) : G (X (NOT(X (F (((F ((p76 + p77 <= p48)) AND (1 <= p49)) OR G ((F ((1 <= p49)) U (p53 + p54 <= p76 + p77))))))))) : F (X (G (NOT(G (F ((p0 <= p22))))))) : F ((NOT(((p48 <= p23) U ((0 <= 0) U (p76 + p77 <= p49)))) AND (p25 <= p51 + p52))) : G (NOT(F ((F ((p23 <= p0)) OR (p23 <= p0))))) : (F ((F ((G ((p24 <= p25)) AND X (G ((p0 <= p24))))) AND X ((1 <= p76 + p77)))) AND F ((p24 <= p25)))
lola: rewrite Frontend/Parser/formula_rewrite.k:434
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:98
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:353
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:185
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:437
lola: rewrite Frontend/Parser/formula_rewrite.k:522
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:374
lola: rewrite Frontend/Parser/formula_rewrite.k:380
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:422
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 392 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (F ((X ((p23 <= p22)) OR (p23 <= p22))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (F ((X ((p23 <= p22)) OR (p23 <= p22))))
lola: processed formula length: 42
lola: 56 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: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: 1244961 markings, 3861866 edges, 248992 markings/sec, 0 secs
lola: 2345433 markings, 7432159 edges, 220094 markings/sec, 5 secs
lola: 3388755 markings, 10848748 edges, 208664 markings/sec, 10 secs
lola: 4370612 markings, 15008252 edges, 196371 markings/sec, 15 secs
lola: 5253772 markings, 19103210 edges, 176632 markings/sec, 20 secs
lola: 6126052 markings, 23204419 edges, 174456 markings/sec, 25 secs
lola: 6980775 markings, 27250006 edges, 170945 markings/sec, 30 secs
lola: 7813964 markings, 31287578 edges, 166638 markings/sec, 35 secs
lola: 8632398 markings, 35240664 edges, 163687 markings/sec, 40 secs
lola: 9437313 markings, 39156604 edges, 160983 markings/sec, 45 secs
lola: 10241124 markings, 43063850 edges, 160762 markings/sec, 50 secs
lola: 11030967 markings, 46912897 edges, 157969 markings/sec, 55 secs
lola: 11849788 markings, 50799027 edges, 163764 markings/sec, 60 secs
lola: 12636822 markings, 54695683 edges, 157407 markings/sec, 65 secs
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: 12679005 markings, 54850749 edges
lola: ========================================
lola: subprocess 1 will run for 433 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (X (F ((p51 + p52 + 1 <= p49))) AND F ((p22 <= p47)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 1 will run for 433 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((p22 <= p47))
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: (p47 + 1 <= p22)
lola: processed formula length: 16
lola: 58 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: yes
lola: produced by: state space / EG
lola: The predicate eventually occurs.
lola: 1 markings, 0 edges
lola: ========================================
lola: subprocess 2 will run for 495 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (F ((p51 + p52 + 1 <= p49)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (F ((p51 + p52 + 1 <= p49)))
lola: processed formula length: 30
lola: 56 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: 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: 4 markings, 3 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 2 will run for 495 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (G ((1 <= p53 + p54)) OR (G ((X (G ((p22 <= p47))) OR (1 <= p53 + p54))) AND F (G ((1 <= p53 + p54)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 2 will run for 495 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G ((1 <= p53 + p54))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((1 <= p53 + p54))
lola: processed formula length: 20
lola: 56 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: 169 markings, 169 edges
lola: ========================================
lola: subprocess 3 will run for 577 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G ((1 <= p53 + p54)))
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 <= p53 + p54)))
lola: processed formula length: 24
lola: 56 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: 170 markings, 171 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 3 will run for 577 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (F ((p23 <= 1)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (F ((p23 <= 1)))
lola: processed formula length: 18
lola: 56 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: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: 1304200 markings, 3963601 edges, 260840 markings/sec, 0 secs
lola: 2511057 markings, 7771642 edges, 241371 markings/sec, 5 secs
lola: 3668777 markings, 11477903 edges, 231544 markings/sec, 10 secs
lola: 4764662 markings, 14999326 edges, 219177 markings/sec, 15 secs
lola: 5855792 markings, 18547053 edges, 218226 markings/sec, 20 secs
lola: 6945914 markings, 22027271 edges, 218024 markings/sec, 25 secs
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: 7860979 markings, 25048482 edges
lola: ========================================
lola: subprocess 4 will run for 686 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (X (G (((G ((p48 + 1 <= p76 + p77)) OR (p49 <= 0)) AND F ((G ((p76 + p77 + 1 <= p53 + p54)) OR (G ((p49 <= 0)) AND (p76 + p77 + 1 <= p53 + p54))))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (X (G (((G ((p48 + 1 <= p76 + p77)) OR (p49 <= 0)) AND F ((G ((p76 + p77 + 1 <= p53 + p54)) OR (G ((p49 <= 0)) AND (p76 + p77 + 1 <= p53 + p54))))))))
lola: processed formula length: 152
lola: 56 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 9 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: 728645 markings, 5542491 edges, 145729 markings/sec, 0 secs
lola: 1381267 markings, 11262900 edges, 130524 markings/sec, 5 secs
lola: 2018507 markings, 16934657 edges, 127448 markings/sec, 10 secs
lola: 2644421 markings, 22518760 edges, 125183 markings/sec, 15 secs
lola: 3246220 markings, 28165450 edges, 120360 markings/sec, 20 secs
lola: 3857337 markings, 33682352 edges, 122223 markings/sec, 25 secs
lola: 4478525 markings, 39124737 edges, 124238 markings/sec, 30 secs
lola: 5052617 markings, 44727923 edges, 114818 markings/sec, 35 secs
lola: 5671773 markings, 50126211 edges, 123831 markings/sec, 40 secs
lola: 6241132 markings, 55710780 edges, 113872 markings/sec, 45 secs
lola: 6814619 markings, 61173231 edges, 114697 markings/sec, 50 secs
lola: 7417393 markings, 66502568 edges, 120555 markings/sec, 55 secs
lola: 7985116 markings, 72049333 edges, 113545 markings/sec, 60 secs
lola: 8585262 markings, 77418623 edges, 120029 markings/sec, 65 secs
lola: 9148213 markings, 82721071 edges, 112590 markings/sec, 70 secs
lola: 9710665 markings, 88254947 edges, 112490 markings/sec, 75 secs
lola: 10269739 markings, 93646611 edges, 111815 markings/sec, 80 secs
lola: 10874715 markings, 98794434 edges, 120995 markings/sec, 85 secs
lola: 11415559 markings, 104271270 edges, 108169 markings/sec, 90 secs
lola: 11969547 markings, 109697544 edges, 110798 markings/sec, 95 secs
lola: 12534374 markings, 115015772 edges, 112965 markings/sec, 100 secs
lola: 13114484 markings, 120003577 edges, 116022 markings/sec, 105 secs
lola: 13647153 markings, 125415171 edges, 106534 markings/sec, 110 secs
lola: 14195343 markings, 130820714 edges, 109638 markings/sec, 115 secs
lola: 14736083 markings, 136047278 edges, 108148 markings/sec, 120 secs
lola: 15344740 markings, 140998642 edges, 121731 markings/sec, 125 secs
lola: 15850844 markings, 146188516 edges, 101221 markings/sec, 130 secs
lola: 16386044 markings, 151606349 edges, 107040 markings/sec, 135 secs
lola: 16922322 markings, 156858806 edges, 107256 markings/sec, 140 secs
lola: 17456121 markings, 162047284 edges, 106760 markings/sec, 145 secs
lola: 18067918 markings, 166953435 edges, 122359 markings/sec, 150 secs
lola: 18564830 markings, 172054062 edges, 99382 markings/sec, 155 secs
lola: 19084963 markings, 177360093 edges, 104027 markings/sec, 160 secs
lola: 19630494 markings, 182773234 edges, 109106 markings/sec, 165 secs
lola: 20156510 markings, 187931565 edges, 105203 markings/sec, 170 secs
lola: 20768278 markings, 192975007 edges, 122354 markings/sec, 175 secs
lola: 21287925 markings, 197893126 edges, 103929 markings/sec, 180 secs
lola: 21782546 markings, 202964104 edges, 98924 markings/sec, 185 secs
lola: 22296800 markings, 208216172 edges, 102851 markings/sec, 190 secs
lola: 22840366 markings, 213611569 edges, 108713 markings/sec, 195 secs
lola: 23356141 markings, 218712214 edges, 103155 markings/sec, 200 secs
lola: 23886118 markings, 223826714 edges, 105995 markings/sec, 205 secs
lola: 24500534 markings, 228638129 edges, 122883 markings/sec, 210 secs
lola: 24986881 markings, 233629663 edges, 97269 markings/sec, 215 secs
lola: 25477521 markings, 238676707 edges, 98128 markings/sec, 220 secs
lola: 25992831 markings, 243930934 edges, 103062 markings/sec, 225 secs
lola: 26529558 markings, 249254171 edges, 107345 markings/sec, 230 secs
lola: 27043969 markings, 254336759 edges, 102882 markings/sec, 235 secs
lola: 27570206 markings, 259414537 edges, 105247 markings/sec, 240 secs
lola: 28184986 markings, 264198122 edges, 122956 markings/sec, 245 secs
lola: 28675229 markings, 269173407 edges, 98049 markings/sec, 250 secs
lola: 29163517 markings, 274175772 edges, 97658 markings/sec, 255 secs
lola: 29660507 markings, 279275144 edges, 99398 markings/sec, 260 secs
lola: 30186581 markings, 284605781 edges, 105215 markings/sec, 265 secs
lola: 30710304 markings, 289774239 edges, 104745 markings/sec, 270 secs
lola: 31223387 markings, 294843645 edges, 102617 markings/sec, 275 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: 31738227 markings, 299755749 edges
lola: ========================================
lola: subprocess 5 will run for 786 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (F ((F ((G ((p24 <= p25)) AND X (G ((p0 <= p24))))) AND X ((1 <= p76 + p77)))) AND F ((p24 <= p25)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: local time limit reached - aborting
lola:
preliminary result: yes yes no yes no unknown unknown unknown unknown
lola: caught signal User defined signal 1 - aborting LoLA
lola: memory consumption: 38228 KB
lola: time consumption: 1209 seconds
lola: print data as JSON (--json)
lola: writing JSON to LTLCardinality.json
lola: closed JSON file LTLCardinality.json
lola: time limit reached - aborting
lola:
preliminary result: yes yes no yes no unknown unknown unknown unknown
lola:
preliminary result: yes yes no yes no unknown unknown unknown unknown
lola: memory consumption: 38228 KB
lola: time consumption: 3570 seconds
lola: print data as JSON (--json)
lola: writing JSON to LTLCardinality.json
lola: closed JSON file LTLCardinality.json
rslt: finished
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16427364 kB
MemFree: 16107588 kB
After kill :
MemTotal: 16427364 kB
MemFree: 16107580 kB
--------------------
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="BridgeAndVehicles-COL-V20P10N20"
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 BridgeAndVehicles-COL-V20P10N20, 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 r182-oct2-158987913500153"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/BridgeAndVehicles-COL-V20P10N20.tgz
mv BridgeAndVehicles-COL-V20P10N20 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 ;