About the Execution of ITS-LoLa for SatelliteMemory-PT-X03000Y0094
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
15743.670 | 3600000.00 | 273620.00 | 798.10 | FTTTTFTTFFFFFTFT | 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.r211-tajo-159033476900025.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 SatelliteMemory-PT-X03000Y0094, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r211-tajo-159033476900025
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 176K
-rw-r--r-- 1 mcc users 3.2K May 14 00:28 CTLCardinality.txt
-rw-r--r-- 1 mcc users 17K May 14 00:28 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K May 13 17:41 CTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 13 17:41 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K May 14 10:01 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 14 10:01 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 14 10:01 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 14 10:01 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 May 12 20:42 NewModel
-rw-r--r-- 1 mcc users 3.8K May 13 13:07 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 20K May 13 13:07 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.6K May 13 07:37 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 15K May 13 07:37 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K May 13 16:53 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 13 16:53 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 12 20:42 equiv_col
-rw-r--r-- 1 mcc users 12 May 12 20:42 instance
-rw-r--r-- 1 mcc users 6 May 12 20:42 iscolored
-rwxr-xr-x 1 mcc users 5.5K May 12 20:42 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of booleans
BOOL_VECTOR
here is the order used to build the result vector(from text file)
FORMULA_NAME SatelliteMemory-PT-X03000Y0094-00
FORMULA_NAME SatelliteMemory-PT-X03000Y0094-01
FORMULA_NAME SatelliteMemory-PT-X03000Y0094-02
FORMULA_NAME SatelliteMemory-PT-X03000Y0094-03
FORMULA_NAME SatelliteMemory-PT-X03000Y0094-04
FORMULA_NAME SatelliteMemory-PT-X03000Y0094-05
FORMULA_NAME SatelliteMemory-PT-X03000Y0094-06
FORMULA_NAME SatelliteMemory-PT-X03000Y0094-07
FORMULA_NAME SatelliteMemory-PT-X03000Y0094-08
FORMULA_NAME SatelliteMemory-PT-X03000Y0094-09
FORMULA_NAME SatelliteMemory-PT-X03000Y0094-10
FORMULA_NAME SatelliteMemory-PT-X03000Y0094-11
FORMULA_NAME SatelliteMemory-PT-X03000Y0094-12
FORMULA_NAME SatelliteMemory-PT-X03000Y0094-13
FORMULA_NAME SatelliteMemory-PT-X03000Y0094-14
FORMULA_NAME SatelliteMemory-PT-X03000Y0094-15
=== Now, execution of the tool begins
BK_START 1591284179562
bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-04 15:23:01] [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 15:23:01] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-04 15:23:01] [INFO ] Load time of PNML (sax parser for PT used): 21 ms
[2020-06-04 15:23:01] [INFO ] Transformed 13 places.
[2020-06-04 15:23:01] [INFO ] Transformed 10 transitions.
[2020-06-04 15:23:01] [INFO ] Parsed PT model containing 13 places and 10 transitions in 54 ms.
Reduce places removed 1 places and 0 transitions.
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 100000 steps, including 0 resets, run finished after 133 ms. (steps per millisecond=751 ) properties seen :[0, 0, 1, 1, 1, 1, 0, 1, 1, 1, 0, 1, 1, 1, 0, 0, 0, 1, 0, 1, 1, 1, 1, 1, 0, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1]
// Phase 1: matrix 10 rows 12 cols
[2020-06-04 15:23:01] [INFO ] Computed 6 place invariants in 2 ms
[2020-06-04 15:23:01] [INFO ] [Real]Absence check using 6 positive place invariants in 16 ms returned sat
[2020-06-04 15:23:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 15:23:01] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2020-06-04 15:23:01] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 15:23:01] [INFO ] [Nat]Absence check using 6 positive place invariants in 8 ms returned sat
[2020-06-04 15:23:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 15:23:01] [INFO ] [Nat]Absence check using state equation in 7 ms returned sat
[2020-06-04 15:23:01] [INFO ] State equation strengthened by 1 read => feed constraints.
[2020-06-04 15:23:01] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2020-06-04 15:23:01] [INFO ] Computed and/alt/rep : 8/13/8 causal constraints in 2 ms.
[2020-06-04 15:23:01] [INFO ] Added : 5 causal constraints over 1 iterations in 9 ms. Result :sat
[2020-06-04 15:23:01] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned unsat
[2020-06-04 15:23:01] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned unsat
[2020-06-04 15:23:01] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned unsat
[2020-06-04 15:23:01] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned unsat
[2020-06-04 15:23:01] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned unsat
[2020-06-04 15:23:01] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned unsat
[2020-06-04 15:23:01] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned unsat
[2020-06-04 15:23:01] [INFO ] [Real]Absence check using 6 positive place invariants in 1 ms returned unsat
[2020-06-04 15:23:01] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned unsat
Successfully simplified 9 atomic propositions for a total of 11 simplifications.
[2020-06-04 15:23:01] [INFO ] Initial state reduction rules for CTL removed 6 formulas.
[2020-06-04 15:23:01] [INFO ] Flatten gal took : 20 ms
FORMULA SatelliteMemory-PT-X03000Y0094-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SatelliteMemory-PT-X03000Y0094-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SatelliteMemory-PT-X03000Y0094-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SatelliteMemory-PT-X03000Y0094-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SatelliteMemory-PT-X03000Y0094-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SatelliteMemory-PT-X03000Y0094-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-06-04 15:23:01] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
[2020-06-04 15:23:01] [INFO ] Flatten gal took : 3 ms
[2020-06-04 15:23:01] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
FORMULA SatelliteMemory-PT-X03000Y0094-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SatelliteMemory-PT-X03000Y0094-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-06-04 15:23:01] [INFO ] Export to MCC properties in file /home/mcc/execution/LTLCardinality.sr.xml took 2 ms.
[2020-06-04 15:23:01] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 1 ms.
info: Time: 3600 - MCC
vrfy: Checking LTLCardinality @ SatelliteMemory-PT-X03000Y0094 @ 3570 seconds
FORMULA SatelliteMemory-PT-X03000Y0094-01 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA SatelliteMemory-PT-X03000Y0094-02 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA SatelliteMemory-PT-X03000Y0094-08 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA SatelliteMemory-PT-X03000Y0094-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA SatelliteMemory-PT-X03000Y0094-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA SatelliteMemory-PT-X03000Y0094-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA SatelliteMemory-PT-X03000Y0094-09 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA SatelliteMemory-PT-X03000Y0094-00 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 3305
rslt: Output for LTLCardinality @ SatelliteMemory-PT-X03000Y0094
{
"build":
{
"architecture": 64,
"assertions": false,
"build_hostname": "mcc2019",
"build_system": "x86_64-unknown-linux-gnu",
"optimizations": true,
"package_version": "2.0",
"svn_version": "3189M"
},
"call":
{
"exec_host": "mcc2020",
"markinglimit": null,
"parameters":
[
"--pnmlnet",
"model.pnml",
"--xmlformula",
"--formula=LTLCardinality.xml",
"--mcc",
"--donotcomputecapacities",
"--encoder=simplecompressed",
"--check=modelchecking",
"--stubborn=deletion",
"--stateequation=par",
"--timelimit=3570",
"--localtimelimit=0",
"--preference=force_ltl",
"--json=LTLCardinality.json",
"--jsoninclude=formula,formulastat,net"
],
"starttime": "Thu Jun 4 15:23:02 2020
",
"timelimit": 3570
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 445
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 445
},
"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 ((p6 <= p9))",
"processed_size": 14,
"rewrites": 55
},
"result":
{
"edges": 5626,
"markings": 5626,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 0,
"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": 509
},
"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 ((p5 <= p11))",
"processed_size": 15,
"rewrites": 55
},
"result":
{
"edges": 6572,
"markings": 6289,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"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": 594
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 1,
"X": 2,
"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 ((X (TRUE) U (p8 <= p6)))",
"processed_size": 27,
"rewrites": 55
},
"result":
{
"edges": 2,
"markings": 3,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 4
},
"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": 0,
"type": "boolean"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 509
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 2,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 5,
"taut": 0,
"tconj": 0,
"tdisj": 2,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "X (G ((X ((p8 <= p11)) OR ((p8 <= p11) OR (2 <= p6)))))",
"processed_size": 55,
"rewrites": 55
},
"result":
{
"edges": 185671700,
"markings": 67522503,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 4
},
"compoundnumber": 1,
"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": 573
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 3,
"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": "X (X (X ((p6 + 1 <= p3))))",
"processed_size": 26,
"rewrites": 55
},
"result":
{
"edges": 6,
"markings": 6,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 5
},
"compoundnumber": 2,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 688
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 0,
"U": 0,
"X": 2,
"aconj": 1,
"adisj": 0,
"aneg": 2,
"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": 2,
"visible_transitions": 0
},
"processed": "X ((F ((p5 <= 1)) OR X ((((1 <= p11)) AND F ((1 <= p11))))))",
"processed_size": 60,
"rewrites": 55
},
"result":
{
"edges": 2,
"markings": 3,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 5
},
"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": 860
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 3,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 3,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 6,
"taut": 0,
"tconj": 1,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "F (G ((G ((G ((p5 + 1 <= p7)) AND X ((p8 + 1 <= p3)))) OR (p7 <= p5))))",
"processed_size": 71,
"rewrites": 55
},
"result":
{
"edges": 10,
"markings": 8,
"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"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1147
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1147
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 1,
"X": 0,
"aconj": 0,
"adisj": 1,
"aneg": 1,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 5,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "(F (((p11 + 1 <= p0) AND (p7 <= 0))) U G ((p0 <= p11)))",
"processed_size": 55,
"rewrites": 55
},
"result":
{
"edges": 1047,
"markings": 762,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 4
},
"compoundnumber": 5,
"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": 1720
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 1,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 2,
"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 (((p2 <= p1) U (3 <= p11)))",
"processed_size": 29,
"rewrites": 55
},
"result":
{
"edges": 2,
"markings": 3,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 6,
"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": 5,
"type": "boolean"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1720
},
"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 <= p8)))",
"processed_size": 17,
"rewrites": 55
},
"result":
{
"edges": 118067250,
"markings": 67472437,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 6,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "fairness",
"workflow": "product automaton"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3371
},
"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": "F (G ((1 <= p8)))",
"processed_size": 17,
"rewrites": 55
},
"result":
{
"edges": 118067251,
"markings": 67472437,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 7,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "stabilization",
"workflow": "product automaton"
}
}
],
"exit":
{
"error": null,
"memory": 20156,
"runtime": 265.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "LTLCardinality.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "F(G(**)) : (X((X(TRUE) U **)) OR ((G(**) AND X(F(**))) OR (G(**) AND F((X((X(TRUE) U **)) OR (G(**) AND X(F(**)))))))) : X(G((X(**) OR (** OR **)))) : X(X(X(*))) : G(F(**)) : X((F(*) OR X((** AND F(*))))) : F(G((G((G(*) AND X(*))) OR *))) : (X((** U **)) OR (F(*) U G(**)))"
},
"net":
{
"arcs": 38,
"conflict_clusters": 3,
"places": 12,
"places_significant": 6,
"singleton_clusters": 0,
"transitions": 10
},
"result":
{
"preliminary_value": "no yes yes no no yes no yes ",
"value": "no yes yes no no yes 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: 22/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 384
lola: finding significant places
lola: 12 places, 10 transitions, 6 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: X (X (F (G (((X ((p9 <= p3)) U (0 <= 0)) AND (1 <= p8)))))) : (G ((p6 <= p9)) U (G ((p5 <= p11)) U X ((X (F (((p10 <= p9) U (0 <= 0)))) U (p8 <= p6))))) : G (X (G (((X ((p8 <= p11)) OR (p8 <= p11)) OR (2 <= p6))))) : NOT(X (X (X ((p3 <= p6))))) : F ((G (F (((p6 <= p1) U (1 <= p8)))) OR NOT(X ((F ((p3 <= p11)) U (0 <= 0)))))) : X ((NOT(G ((2 <= p5))) OR (X (((1 <= p11))) AND F (NOT(X ((p11 <= 0))))))) : NOT(G (F (X (X (X ((F ((F ((p7 <= p5)) OR X ((p3 <= p8)))) AND (p5 + 1 <= p7)))))))) : (X (((p2 <= p1) U (3 <= p11))) OR (NOT(G (((p0 <= p11) OR (1 <= p7)))) U G ((p0 <= p11))))
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:166
lola: rewrite Frontend/Parser/formula_rewrite.k:116
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:166
lola: rewrite Frontend/Parser/formula_rewrite.k:154
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:434
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:434
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:166
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:279
lola: rewrite Frontend/Parser/formula_rewrite.k:145
lola: rewrite Frontend/Parser/formula_rewrite.k:121
lola: rewrite Frontend/Parser/formula_rewrite.k:371
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:525
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:315
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:335
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:297
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 445 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (X ((X (TRUE) U (p8 <= p6))) OR ((G ((p5 <= p11)) AND X (F ((p8 <= p6)))) OR (G ((p6 <= p9)) AND F ((X ((X (TRUE) U (p8 <= p6))) OR (G ((p5 <= p11)) AND X (F ((p8 <= p6)))))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 0 will run for 445 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G ((p6 <= p9))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((p6 <= p9))
lola: processed formula length: 14
lola: 55 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: 5626 markings, 5626 edges
lola: ========================================
lola: subprocess 1 will run for 509 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G ((p5 <= p11))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((p5 <= p11))
lola: processed formula length: 15
lola: 55 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: 6289 markings, 6572 edges
lola: ========================================
lola: subprocess 2 will run for 594 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((X (TRUE) U (p8 <= p6)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((X (TRUE) U (p8 <= p6)))
lola: processed formula length: 27
lola: 55 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 4 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 3 markings, 2 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 1 will run for 509 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (G ((X ((p8 <= p11)) OR ((p8 <= p11) OR (2 <= p6)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (G ((X ((p8 <= p11)) OR ((p8 <= p11) OR (2 <= p6)))))
lola: processed formula length: 55
lola: 55 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 4 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: 4937120 markings, 8019319 edges, 987424 markings/sec, 0 secs
lola: 9634969 markings, 15652897 edges, 939570 markings/sec, 5 secs
lola: 14283500 markings, 23207674 edges, 929706 markings/sec, 10 secs
lola: 18960999 markings, 30810147 edges, 935500 markings/sec, 15 secs
lola: 23303533 markings, 37865694 edges, 868507 markings/sec, 20 secs
lola: 27879473 markings, 45302109 edges, 915188 markings/sec, 25 secs
lola: 32271027 markings, 52440243 edges, 878311 markings/sec, 30 secs
lola: 36498485 markings, 59310047 edges, 845492 markings/sec, 35 secs
lola: 40860193 markings, 66399125 edges, 872342 markings/sec, 40 secs
lola: 45290397 markings, 73597195 edges, 886041 markings/sec, 45 secs
lola: 49910272 markings, 81103871 edges, 923975 markings/sec, 50 secs
lola: 54393629 markings, 88391626 edges, 896671 markings/sec, 55 secs
lola: 58811580 markings, 95571361 edges, 883590 markings/sec, 60 secs
lola: 63381432 markings, 102998388 edges, 913970 markings/sec, 65 secs
lola: 67519711 markings, 110184448 edges, 827656 markings/sec, 70 secs
lola: 67519951 markings, 116681866 edges, 48 markings/sec, 75 secs
lola: 67520165 markings, 122466826 edges, 43 markings/sec, 80 secs
lola: 67520375 markings, 128159161 edges, 42 markings/sec, 85 secs
lola: 67520601 markings, 134245557 edges, 45 markings/sec, 90 secs
lola: 67520875 markings, 141649966 edges, 55 markings/sec, 95 secs
lola: 67521159 markings, 149308697 edges, 57 markings/sec, 100 secs
lola: 67521437 markings, 156812913 edges, 56 markings/sec, 105 secs
lola: 67521741 markings, 165058114 edges, 61 markings/sec, 110 secs
lola: 67522093 markings, 174527331 edges, 70 markings/sec, 115 secs
lola: 67522447 markings, 184097735 edges, 71 markings/sec, 120 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: 67522503 markings, 185671700 edges
lola: ========================================
lola: subprocess 2 will run for 573 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (X (X ((p6 + 1 <= p3))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (X (X ((p6 + 1 <= p3))))
lola: processed formula length: 26
lola: 55 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: 6 markings, 6 edges
lola: ========================================
lola: subprocess 3 will run for 688 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((F ((p5 <= 1)) OR X ((((1 <= p11)) AND F ((1 <= p11))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((F ((p5 <= 1)) OR X ((((1 <= p11)) AND F ((1 <= p11))))))
lola: processed formula length: 60
lola: 55 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: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 3 markings, 2 edges
lola: ========================================
lola: subprocess 4 will run for 860 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G ((G ((G ((p5 + 1 <= p7)) AND X ((p8 + 1 <= p3)))) OR (p7 <= p5))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F (G ((G ((G ((p5 + 1 <= p7)) AND X ((p8 + 1 <= p3)))) OR (p7 <= p5))))
lola: processed formula length: 71
lola: 55 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: add low 9
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: 8 markings, 10 edges
lola: ========================================
lola: subprocess 5 will run for 1147 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (X (((p2 <= p1) U (3 <= p11))) OR (F (((p11 + 1 <= p0) AND (p7 <= 0))) U G ((p0 <= p11))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 5 will run for 1147 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (F (((p11 + 1 <= p0) AND (p7 <= 0))) U G ((p0 <= p11)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: (F (((p11 + 1 <= p0) AND (p7 <= 0))) U G ((p0 <= p11)))
lola: processed formula length: 55
lola: 55 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: 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: 762 markings, 1047 edges
lola: ========================================
lola: subprocess 6 will run for 1720 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (((p2 <= p1) U (3 <= p11)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (((p2 <= p1) U (3 <= p11)))
lola: processed formula length: 29
lola: 55 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: 3 markings, 2 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 6 will run for 1720 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (F ((1 <= p8)))
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 <= p8)))
lola: processed formula length: 17
lola: 55 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: 5733807 markings, 10027863 edges, 1146761 markings/sec, 0 secs
lola: 10696753 markings, 18712759 edges, 992589 markings/sec, 5 secs
lola: 15704061 markings, 27475289 edges, 1001462 markings/sec, 10 secs
lola: 20471328 markings, 35817758 edges, 953453 markings/sec, 15 secs
lola: 25144833 markings, 43996145 edges, 934701 markings/sec, 20 secs
lola: 30075098 markings, 52623857 edges, 986053 markings/sec, 25 secs
lola: 35162974 markings, 61527404 edges, 1017575 markings/sec, 30 secs
lola: 39979245 markings, 69955595 edges, 963254 markings/sec, 35 secs
lola: 44711806 markings, 78237331 edges, 946512 markings/sec, 40 secs
lola: 49542992 markings, 86691656 edges, 966237 markings/sec, 45 secs
lola: 54674038 markings, 95670718 edges, 1026209 markings/sec, 50 secs
lola: 59704928 markings, 104474515 edges, 1006178 markings/sec, 55 secs
lola: 64701798 markings, 113218774 edges, 999374 markings/sec, 60 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: 67472437 markings, 118067250 edges
lola: ========================================
lola: subprocess 7 will run for 3371 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G ((1 <= p8)))
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 <= p8)))
lola: processed formula length: 17
lola: 55 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: 5552905 markings, 9711294 edges, 1110581 markings/sec, 0 secs
lola: 11172045 markings, 19544497 edges, 1123828 markings/sec, 5 secs
lola: 16661726 markings, 29151154 edges, 1097936 markings/sec, 10 secs
lola: 22021240 markings, 38530023 edges, 1071903 markings/sec, 15 secs
lola: 27328689 markings, 47817782 edges, 1061490 markings/sec, 20 secs
lola: 32589707 markings, 57024289 edges, 1052204 markings/sec, 25 secs
lola: 37747238 markings, 66049702 edges, 1031506 markings/sec, 30 secs
lola: 42900066 markings, 75066884 edges, 1030566 markings/sec, 35 secs
lola: 48023853 markings, 84033242 edges, 1024757 markings/sec, 40 secs
lola: 53220438 markings, 93126997 edges, 1039317 markings/sec, 45 secs
lola: 58281821 markings, 101984152 edges, 1012277 markings/sec, 50 secs
lola: 63323320 markings, 110806513 edges, 1008300 markings/sec, 55 secs
lola: 67472437 markings, 118067251 edges, 829823 markings/sec, 60 secs
lola: add low 4
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: 67472437 markings, 118067251 edges
lola: ========================================
lola: RESULT
lola:
SUMMARY: no yes yes no no yes no yes
lola:
preliminary result: no yes yes no no yes no yes
lola: memory consumption: 20156 KB
lola: time consumption: 265 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="SatelliteMemory-PT-X03000Y0094"
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 SatelliteMemory-PT-X03000Y0094, 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 r211-tajo-159033476900025"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/SatelliteMemory-PT-X03000Y0094.tgz
mv SatelliteMemory-PT-X03000Y0094 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 ;