About the Execution of 2020-gold for CircadianClock-PT-001000
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
16254.123 | 3600000.00 | 802504.00 | 9491.30 | T?FFFFFFT?FFFFFF | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fko/mcc2021-input.r056-oct2-162038334400013.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fko/mcc2021-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 gold2020
Input is CircadianClock-PT-001000, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r056-oct2-162038334400013
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 408K
-rw-r--r-- 1 mcc users 11K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 103K May 10 09:42 CTLCardinality.xml
-rw-r--r-- 1 mcc users 16K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 119K May 10 09:42 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 3.4K Mar 28 15:49 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Mar 28 15:49 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Mar 28 15:49 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 28 15:49 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Mar 23 03:04 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 17K Mar 23 03:04 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.4K Mar 22 12:30 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 21K Mar 22 12:30 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 22 09:10 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Mar 22 09:10 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 5 16:51 equiv_col
-rw-r--r-- 1 mcc users 7 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 11K May 5 16:51 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 CircadianClock-PT-001000-00
FORMULA_NAME CircadianClock-PT-001000-01
FORMULA_NAME CircadianClock-PT-001000-02
FORMULA_NAME CircadianClock-PT-001000-03
FORMULA_NAME CircadianClock-PT-001000-04
FORMULA_NAME CircadianClock-PT-001000-05
FORMULA_NAME CircadianClock-PT-001000-06
FORMULA_NAME CircadianClock-PT-001000-07
FORMULA_NAME CircadianClock-PT-001000-08
FORMULA_NAME CircadianClock-PT-001000-09
FORMULA_NAME CircadianClock-PT-001000-10
FORMULA_NAME CircadianClock-PT-001000-11
FORMULA_NAME CircadianClock-PT-001000-12
FORMULA_NAME CircadianClock-PT-001000-13
FORMULA_NAME CircadianClock-PT-001000-14
FORMULA_NAME CircadianClock-PT-001000-15
=== Now, execution of the tool begins
BK_START 1620896327788
bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2021-05-13 08:58:50] [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-13 08:58:50] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-13 08:58:50] [INFO ] Load time of PNML (sax parser for PT used): 27 ms
[2021-05-13 08:58:50] [INFO ] Transformed 14 places.
[2021-05-13 08:58:50] [INFO ] Transformed 16 transitions.
[2021-05-13 08:58:50] [INFO ] Parsed PT model containing 14 places and 16 transitions in 79 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 13 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100135 steps, including 0 resets, run finished after 92 ms. (steps per millisecond=1088 ) properties seen :[1, 1, 1, 1, 1, 1, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 0, 1, 1, 1, 0, 1, 1, 1, 1, 1]
[2021-05-13 08:58:50] [INFO ] Flow matrix only has 14 transitions (discarded 2 similar events)
// Phase 1: matrix 14 rows 14 cols
[2021-05-13 08:58:50] [INFO ] Computed 7 place invariants in 2 ms
[2021-05-13 08:58:51] [INFO ] [Real]Absence check using 7 positive place invariants in 41 ms returned unsat
[2021-05-13 08:58:51] [INFO ] [Real]Absence check using 7 positive place invariants in 6 ms returned unsat
[2021-05-13 08:58:51] [INFO ] [Real]Absence check using 7 positive place invariants in 31 ms returned unsat
[2021-05-13 08:58:51] [INFO ] [Real]Absence check using 7 positive place invariants in 4 ms returned unsat
[2021-05-13 08:58:51] [INFO ] [Real]Absence check using 7 positive place invariants in 3 ms returned unsat
[2021-05-13 08:58:51] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned unsat
[2021-05-13 08:58:51] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned unsat
Successfully simplified 7 atomic propositions for a total of 7 simplifications.
[2021-05-13 08:58:51] [INFO ] Initial state reduction rules for CTL removed 4 formulas.
[2021-05-13 08:58:51] [INFO ] Flatten gal took : 38 ms
FORMULA CircadianClock-PT-001000-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CircadianClock-PT-001000-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CircadianClock-PT-001000-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CircadianClock-PT-001000-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-13 08:58:51] [INFO ] Flatten gal took : 4 ms
[2021-05-13 08:58:51] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA CircadianClock-PT-001000-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-13 08:58:51] [INFO ] Export to MCC properties in file /home/mcc/execution/LTLCardinality.sr.xml took 14 ms.
[2021-05-13 08:58:51] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 1 ms.
info: Time: 3600 - MCC
vrfy: Checking LTLCardinality @ CircadianClock-PT-001000 @ 3570 seconds
FORMULA CircadianClock-PT-001000-00 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA CircadianClock-PT-001000-04 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA CircadianClock-PT-001000-05 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA CircadianClock-PT-001000-06 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA CircadianClock-PT-001000-07 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA CircadianClock-PT-001000-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA CircadianClock-PT-001000-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA CircadianClock-PT-001000-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA CircadianClock-PT-001000-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA CircadianClock-PT-001000-01 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA CircadianClock-PT-001000-09 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 2819
rslt: Output for LTLCardinality @ CircadianClock-PT-001000
{
"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 May 13 08:58:51 2021
",
"timelimit": 3570
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 324
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 1,
"X": 2,
"aconj": 1,
"adisj": 0,
"aneg": 1,
"comp": 5,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 7,
"taut": 0,
"tconj": 1,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "X (((X (((1 <= p5) AND (p7 <= p12))) U (p5 <= 0)) OR (G ((p13 + 1 <= p1)) AND F ((p5 <= 0)))))",
"processed_size": 94,
"rewrites": 58
},
"result":
{
"edges": 4,
"markings": 5,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 10
},
"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": 376
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 0,
"U": 0,
"X": 4,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 5,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "X (X (X (X ((F ((p3 + 1 <= p11)) AND F (((p3 <= 0) AND (p10 <= p11))))))))",
"processed_size": 74,
"rewrites": 58
},
"result":
{
"edges": 5029,
"markings": 5021,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 6
},
"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": 424
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 424
},
"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": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "X ((2 <= p6))",
"processed_size": 13,
"rewrites": 58
},
"result":
{
"edges": 4002,
"markings": 4002,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"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": 484
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 0,
"U": 1,
"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": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "(X (F ((p10 <= p2))) U (p11 + 1 <= p6))",
"processed_size": 39,
"rewrites": 58
},
"result":
{
"edges": 5001,
"markings": 5001,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"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": 484
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 2,
"U": 1,
"X": 1,
"aconj": 1,
"adisj": 1,
"aneg": 1,
"comp": 5,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 8,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "G (((X (F (((p8 <= 2) OR (p4 + 1 <= p12)))) U G (((3 <= p8) OR (p12 <= p4)))) AND (p0 <= p8)))",
"processed_size": 96,
"rewrites": 58
},
"result":
{
"edges": 11994,
"markings": 9999,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 7
},
"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": 565
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 565
},
"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": "(p0 <= p13)",
"processed_size": 11,
"rewrites": 60
},
"result":
{
"edges": 3502,
"markings": 3502,
"produced_by": "state space / EG",
"value": false
},
"task":
{
"compoundnumber": 5,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 7
},
"threads": 1,
"type": "dfs"
},
"type": "eventual_occurrence"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 678
},
"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 ((p13 + 1 <= p0))",
"processed_size": 19,
"rewrites": 58
},
"result":
{
"edges": 4002,
"markings": 4002,
"produced_by": "LTL model checker",
"value": false
},
"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": false
},
"task":
{
"compoundnumber": 5,
"type": "boolean"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 801
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 3,
"U": 0,
"X": 2,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "X (G ((G ((p6 <= p4)) AND X (G ((p0 + 1 <= p4))))))",
"processed_size": 51,
"rewrites": 58
},
"result":
{
"edges": 4002,
"markings": 4002,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 5
},
"compoundnumber": 7,
"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": 1068
},
"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": "G (F ((p10 <= p3)))",
"processed_size": 19,
"rewrites": 58
},
"result":
{
"edges": 5001,
"markings": 5001,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 8,
"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": 1602
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 1,
"X": 0,
"aconj": 0,
"adisj": 1,
"aneg": 0,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 7,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "((p7 <= p11) U G ((((2 <= p1) OR (p7 <= p11)) AND (p7 <= p11))))",
"processed_size": 65,
"rewrites": 58
},
"result":
{
"edges": 4002,
"markings": 4002,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 4
},
"compoundnumber": 9,
"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": 3205
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 3,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 5,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 9,
"taut": 0,
"tconj": 1,
"tdisj": 2,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "F (G ((F ((p11 <= p4)) AND (F ((p6 <= p2)) OR (((p7 <= 2) AND (p6 <= p2)) OR (p11 <= p4))))))",
"processed_size": 93,
"rewrites": 58
},
"result":
{
"edges": 9015990,
"markings": 4012000,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 5
},
"compoundnumber": 10,
"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": 3392,
"runtime": 751.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "LTLCardinality.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "X(((X(**) U **) OR (G(*) AND F(**)))) : X(G((F(**) OR (** OR (** OR **))))) : X(X(X(X((F(**) AND F(**)))))) : ((X(F(**)) U **) OR X(**)) : G(((X(F(*)) U G(**)) AND **)) : (X(X(G((* R *)))) AND (X(**) OR F(**))) : X(X(G((** AND X(F((G(**) OR **))))))) : F(G((F(**) AND (F(**) OR (** OR **))))) : G(F(**)) : X(G((G(**) AND X(G(*))))) : (** U G((** AND **)))"
},
"net":
{
"arcs": 58,
"conflict_clusters": 2,
"places": 14,
"places_significant": 7,
"singleton_clusters": 0,
"transitions": 16
},
"result":
{
"preliminary_value": "yes unknown no no no no unknown no no no no ",
"value": "yes unknown no no no no unknown no no no no "
},
"task":
{
"type": "compound"
}
}
lola: LoLA will run for 3570 seconds at most (--timelimit)
lola: NET
lola: input: PNML file (--pnml)
lola: reading net from model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file model.pnml
lola: 30/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 448
lola: finding significant places
lola: 14 places, 16 transitions, 7 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 (F ((p1 <= p13)))) U (X (X (((1 <= p5) AND (p7 <= p12)))) U X ((p5 <= 0)))) : G (X ((((F ((3 <= p6)) OR (p6 <= p11)) OR (3 <= p6)) OR (1 <= p0)))) : X (X (X (X ((F ((p3 + 1 <= p11)) AND F (((p3 <= 0) AND (p10 <= p11)))))))) : ((F (X ((p10 <= p2))) U (p11 + 1 <= p6)) OR X ((2 <= p6))) : G (((F (NOT(X (((3 <= p8) AND (p12 <= p4))))) U G (((3 <= p8) OR (p12 <= p4)))) AND (p0 <= p8))) : (G (NOT(X (X (((p4 <= p8) U (1 <= p8)))))) AND (X ((p13 + 1 <= p0)) OR F ((p13 + 1 <= p0)))) : G ((X (X ((p1 <= p9))) AND X (X (X (F ((G ((p5 + 1 <= p10)) OR (p1 <= p9)))))))) : F (G (X (((F ((p6 <= p2)) OR ((p7 <= 2) AND (p6 <= p2))) U (p11 <= p4))))) : F (G (F (X ((p10 <= p3))))) : NOT(F (NOT(X ((G ((p6 <= p4)) AND NOT(X (F (((p6 <= p4) U ((p2 <= p3) U (p4 <= p0))))))))))) : ((p7 <= p11) U (G (((2 <= p1) OR (p7 <= p11))) AND G ((p7 <= p11))))
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:410
lola: rewrite Frontend/Parser/formula_rewrite.k:410
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:434
lola: rewrite Frontend/Parser/formula_rewrite.k:254
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:356
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:335
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:353
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:525
lola: rewrite Frontend/Parser/formula_rewrite.k:525
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:437
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:522
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:371
lola: rewrite Frontend/Parser/formula_rewrite.k:434
lola: rewrite Frontend/Parser/formula_rewrite.k:434
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:356
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:332
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:522
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (((X (((1 <= p5) AND (p7 <= p12))) U (p5 <= 0)) OR (G ((p13 + 1 <= p1)) AND F ((p5 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (((X (((1 <= p5) AND (p7 <= p12))) U (p5 <= 0)) OR (G ((p13 + 1 <= p1)) AND F ((p5 <= 0)))))
lola: processed formula length: 94
lola: 58 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 10 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: 5 markings, 4 edges
lola: ========================================
lola: subprocess 1 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (G ((F ((3 <= p6)) OR ((p6 <= p11) OR ((3 <= p6) OR (1 <= p0))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (G ((F ((3 <= p6)) OR ((p6 <= p11) OR ((3 <= p6) OR (1 <= p0))))))
lola: processed formula length: 68
lola: 58 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: 3681027 markings, 8692625 edges, 736205 markings/sec, 0 secs
lola: 6989650 markings, 16965108 edges, 661725 markings/sec, 5 secs
lola: 10236489 markings, 25077440 edges, 649368 markings/sec, 10 secs
lola: 13506805 markings, 33251770 edges, 654063 markings/sec, 15 secs
lola: 16752064 markings, 41365057 edges, 649052 markings/sec, 20 secs
lola: 19963054 markings, 49390822 edges, 642198 markings/sec, 25 secs
lola: 23110191 markings, 57254428 edges, 629427 markings/sec, 30 secs
lola: 26195663 markings, 64967120 edges, 617094 markings/sec, 35 secs
lola: 29334113 markings, 72812046 edges, 627690 markings/sec, 40 secs
lola: 32465919 markings, 80641206 edges, 626361 markings/sec, 45 secs
lola: 35515409 markings, 88262262 edges, 609898 markings/sec, 50 secs
lola: 38603331 markings, 95981867 edges, 617584 markings/sec, 55 secs
lola: 41631619 markings, 103551169 edges, 605658 markings/sec, 60 secs
lola: 44778974 markings, 111418646 edges, 629471 markings/sec, 65 secs
lola: 47955342 markings, 119358588 edges, 635274 markings/sec, 70 secs
lola: 51125727 markings, 127279662 edges, 634077 markings/sec, 75 secs
lola: 54322367 markings, 135272429 edges, 639328 markings/sec, 80 secs
lola: 57453493 markings, 143097496 edges, 626225 markings/sec, 85 secs
lola: 60521813 markings, 150768872 edges, 613664 markings/sec, 90 secs
lola: 63631087 markings, 158539564 edges, 621855 markings/sec, 95 secs
lola: 66677432 markings, 166155681 edges, 609269 markings/sec, 100 secs
lola: 69770048 markings, 173884191 edges, 618523 markings/sec, 105 secs
lola: 72797543 markings, 181452468 edges, 605499 markings/sec, 110 secs
lola: 75850686 markings, 189083742 edges, 610629 markings/sec, 115 secs
lola: 79003131 markings, 196964691 edges, 630489 markings/sec, 120 secs
lola: 82108661 markings, 204726724 edges, 621106 markings/sec, 125 secs
lola: 85033150 markings, 212038639 edges, 584898 markings/sec, 130 secs
lola: 87819233 markings, 219000692 edges, 557217 markings/sec, 135 secs
lola: 90450648 markings, 225578188 edges, 526283 markings/sec, 140 secs
lola: 93018142 markings, 231996666 edges, 513499 markings/sec, 145 secs
lola: 95593897 markings, 238432791 edges, 515151 markings/sec, 150 secs
lola: 98261326 markings, 245100275 edges, 533486 markings/sec, 155 secs
lola: 100804322 markings, 251458304 edges, 508599 markings/sec, 160 secs
lola: 103407810 markings, 257963313 edges, 520698 markings/sec, 165 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 2 will run for 376 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (X (X (X ((F ((p3 + 1 <= p11)) AND F (((p3 <= 0) AND (p10 <= p11))))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (X (X (X ((F ((p3 + 1 <= p11)) AND F (((p3 <= 0) AND (p10 <= p11))))))))
lola: processed formula length: 74
lola: 58 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: 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: 5021 markings, 5029 edges
lola: ========================================
lola: subprocess 3 will run for 424 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((X (F ((p10 <= p2))) U (p11 + 1 <= p6)) OR X ((2 <= p6)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 3 will run for 424 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((2 <= p6))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((2 <= p6))
lola: processed formula length: 13
lola: 58 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: 4002 markings, 4002 edges
lola: ========================================
lola: subprocess 4 will run for 484 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (X (F ((p10 <= p2))) U (p11 + 1 <= p6))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: (X (F ((p10 <= p2))) U (p11 + 1 <= p6))
lola: processed formula length: 39
lola: 58 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: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 5001 markings, 5001 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 4 will run for 484 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (((X (F (((p8 <= 2) OR (p4 + 1 <= p12)))) U G (((3 <= p8) OR (p12 <= p4)))) AND (p0 <= p8)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (((X (F (((p8 <= 2) OR (p4 + 1 <= p12)))) U G (((3 <= p8) OR (p12 <= p4)))) AND (p0 <= p8)))
lola: processed formula length: 96
lola: 58 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 7 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 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
lola: add low 15
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: 9999 markings, 11994 edges
lola: ========================================
lola: subprocess 5 will run for 565 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (X (X (G (((p8 + 1 <= p4) R (p8 <= 0))))) AND (X ((p13 + 1 <= p0)) OR F ((p13 + 1 <= p0))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 5 will run for 565 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((p13 + 1 <= p0))
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: (p0 <= p13)
lola: processed formula length: 11
lola: 60 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: 3502 markings, 3502 edges
lola: ========================================
lola: subprocess 6 will run for 678 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((p13 + 1 <= p0))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((p13 + 1 <= p0))
lola: processed formula length: 19
lola: 58 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: 4002 markings, 4002 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 6 will run for 678 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (X (G (((p1 <= p9) AND X (F ((G ((p5 + 1 <= p10)) OR (p1 <= p9))))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (X (G (((p1 <= p9) AND X (F ((G ((p5 + 1 <= p10)) OR (p1 <= p9))))))))
lola: processed formula length: 72
lola: 58 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: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: 3926843 markings, 8801237 edges, 785369 markings/sec, 0 secs
lola: 7357505 markings, 17373061 edges, 686132 markings/sec, 5 secs
lola: 10778111 markings, 25922663 edges, 684121 markings/sec, 10 secs
lola: 14125231 markings, 34286249 edges, 669424 markings/sec, 15 secs
lola: 17460506 markings, 42628781 edges, 667055 markings/sec, 20 secs
lola: 20823008 markings, 51032315 edges, 672500 markings/sec, 25 secs
lola: 24201274 markings, 59473812 edges, 675653 markings/sec, 30 secs
lola: 27590943 markings, 67949748 edges, 677934 markings/sec, 35 secs
lola: 30952463 markings, 76347087 edges, 672304 markings/sec, 40 secs
lola: 34281451 markings, 84668277 edges, 665798 markings/sec, 45 secs
lola: 37537528 markings, 92811478 edges, 651215 markings/sec, 50 secs
lola: 40872513 markings, 101144697 edges, 666997 markings/sec, 55 secs
lola: 44186569 markings, 109426091 edges, 662811 markings/sec, 60 secs
lola: 47429814 markings, 117536379 edges, 648649 markings/sec, 65 secs
lola: 50663489 markings, 125614315 edges, 646735 markings/sec, 70 secs
lola: 53825854 markings, 133526517 edges, 632473 markings/sec, 75 secs
lola: 57147835 markings, 141825832 edges, 664396 markings/sec, 80 secs
lola: 60503879 markings, 150213480 edges, 671209 markings/sec, 85 secs
lola: 63793599 markings, 158439757 edges, 657944 markings/sec, 90 secs
lola: 67056141 markings, 166591319 edges, 652508 markings/sec, 95 secs
lola: 70221822 markings, 174499329 edges, 633136 markings/sec, 100 secs
lola: 73451245 markings, 182577872 edges, 645885 markings/sec, 105 secs
lola: 76667511 markings, 190616325 edges, 643253 markings/sec, 110 secs
lola: 79856523 markings, 198589749 edges, 637802 markings/sec, 115 secs
lola: 83038393 markings, 206538633 edges, 636374 markings/sec, 120 secs
lola: 86162635 markings, 214352298 edges, 624848 markings/sec, 125 secs
lola: 89542923 markings, 222801182 edges, 676058 markings/sec, 130 secs
lola: 92926199 markings, 231256053 edges, 676655 markings/sec, 135 secs
lola: 96226369 markings, 239502231 edges, 660034 markings/sec, 140 secs
lola: 98561678 markings, 245339786 edges, 467062 markings/sec, 145 secs
lola: 101526803 markings, 252755977 edges, 593025 markings/sec, 150 secs
lola: 104461699 markings, 260087653 edges, 586979 markings/sec, 155 secs
lola: 107459709 markings, 267580990 edges, 599602 markings/sec, 160 secs
lola: 110098523 markings, 274183396 edges, 527763 markings/sec, 165 secs
lola: 113028028 markings, 281501473 edges, 585901 markings/sec, 170 secs
lola: 115916303 markings, 288721791 edges, 577655 markings/sec, 175 secs
lola: 118938099 markings, 296270427 edges, 604359 markings/sec, 180 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 7 will run for 801 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (G ((G ((p6 <= p4)) AND X (G ((p0 + 1 <= p4))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (G ((G ((p6 <= p4)) AND X (G ((p0 + 1 <= p4))))))
lola: processed formula length: 51
lola: 58 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: 4002 markings, 4002 edges
lola: ========================================
lola: subprocess 8 will run for 1068 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (F ((p10 <= 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 ((p10 <= p3)))
lola: processed formula length: 19
lola: 58 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: 5001 markings, 5001 edges
lola: ========================================
lola: subprocess 9 will run for 1602 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((p7 <= p11) U G ((((2 <= p1) OR (p7 <= p11)) AND (p7 <= p11))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: ((p7 <= p11) U G ((((2 <= p1) OR (p7 <= p11)) AND (p7 <= p11))))
lola: processed formula length: 65
lola: 58 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: 4002 markings, 4002 edges
lola: ========================================
lola: subprocess 10 will run for 3205 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G ((F ((p11 <= p4)) AND (F ((p6 <= p2)) OR (((p7 <= 2) AND (p6 <= p2)) OR (p11 <= p4))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F (G ((F ((p11 <= p4)) AND (F ((p6 <= p2)) OR (((p7 <= 2) AND (p6 <= p2)) OR (p11 <= p4))))))
lola: processed formula length: 93
lola: 58 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: 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: 3543347 markings, 7845671 edges, 708669 markings/sec, 0 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: 4012000 markings, 9015990 edges
lola: ========================================
lola: ========================================
lola: ...considering subproblem: X (G ((F ((3 <= p6)) OR ((p6 <= p11) OR ((3 <= p6) OR (1 <= p0))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (G ((F ((3 <= p6)) OR ((p6 <= p11) OR ((3 <= p6) OR (1 <= p0))))))
lola: processed formula length: 68
lola: 58 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: 3609517 markings, 8514477 edges, 721903 markings/sec, 0 secs
lola: 6899842 markings, 16740742 edges, 658065 markings/sec, 5 secs
lola: 10153450 markings, 24869942 edges, 650722 markings/sec, 10 secs
lola: 13428203 markings, 33054317 edges, 654951 markings/sec, 15 secs
lola: 16649585 markings, 41109115 edges, 644276 markings/sec, 20 secs
lola: 19846500 markings, 49098431 edges, 639383 markings/sec, 25 secs
lola: 22979042 markings, 56930454 edges, 626508 markings/sec, 30 secs
lola: 26107820 markings, 64747619 edges, 625756 markings/sec, 35 secs
lola: 29274628 markings, 72663245 edges, 633362 markings/sec, 40 secs
lola: 32420956 markings, 80528588 edges, 629266 markings/sec, 45 secs
lola: 35501643 markings, 88228172 edges, 616137 markings/sec, 50 secs
lola: 38620059 markings, 96024798 edges, 623683 markings/sec, 55 secs
lola: 41690167 markings, 103697715 edges, 614022 markings/sec, 60 secs
lola: 44827784 markings, 111541957 edges, 627523 markings/sec, 65 secs
lola: 48029431 markings, 119544058 edges, 640329 markings/sec, 70 secs
lola: 51219138 markings, 127513566 edges, 637941 markings/sec, 75 secs
lola: 54370503 markings, 135392884 edges, 630273 markings/sec, 80 secs
lola: 57521207 markings, 143266457 edges, 630141 markings/sec, 85 secs
lola: 60647089 markings, 151081135 edges, 625176 markings/sec, 90 secs
lola: 63791646 markings, 158942040 edges, 628911 markings/sec, 95 secs
lola: 66871059 markings, 166639825 edges, 615883 markings/sec, 100 secs
lola: 69959233 markings, 174358687 edges, 617635 markings/sec, 105 secs
lola: 72952314 markings, 181840583 edges, 598616 markings/sec, 110 secs
lola: 75963628 markings, 189366514 edges, 602263 markings/sec, 115 secs
lola: 79075236 markings, 197145222 edges, 622322 markings/sec, 120 secs
lola: 82173782 markings, 204887308 edges, 619709 markings/sec, 125 secs
lola: 84630049 markings, 211030213 edges, 491253 markings/sec, 130 secs
lola: 87004016 markings, 216964681 edges, 474793 markings/sec, 135 secs
lola: 89701421 markings, 223704856 edges, 539481 markings/sec, 140 secs
lola: 90467678 markings, 225620099 edges, 153251 markings/sec, 145 secs
lola: 91801324 markings, 228954330 edges, 266729 markings/sec, 150 secs
lola: 93387739 markings, 232917104 edges, 317283 markings/sec, 155 secs
lola: 95301471 markings, 237700648 edges, 382746 markings/sec, 160 secs
lola: 97876080 markings, 244138709 edges, 514922 markings/sec, 165 secs
lola: 100530951 markings, 250773959 edges, 530974 markings/sec, 170 secs
lola: 103193533 markings, 257432074 edges, 532516 markings/sec, 175 secs
lola: Child process aborted or communication problem between parent and child process
lola: ========================================
lola: ...considering subproblem: X (X (G (((p1 <= p9) AND X (F ((G ((p5 + 1 <= p10)) OR (p1 <= p9))))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (X (G (((p1 <= p9) AND X (F ((G ((p5 + 1 <= p10)) OR (p1 <= p9))))))))
lola: processed formula length: 72
lola: 58 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: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: 3845416 markings, 8596637 edges, 769083 markings/sec, 0 secs
lola: 7126451 markings, 16796490 edges, 656207 markings/sec, 5 secs
lola: 10382591 markings, 24933111 edges, 651228 markings/sec, 10 secs
lola: 13566356 markings, 32895836 edges, 636753 markings/sec, 15 secs
lola: 16846529 markings, 41093531 edges, 656035 markings/sec, 20 secs
lola: 20103971 markings, 49230305 edges, 651488 markings/sec, 25 secs
lola: 23311256 markings, 57251657 edges, 641457 markings/sec, 30 secs
lola: 26639124 markings, 65566372 edges, 665574 markings/sec, 35 secs
lola: 29862575 markings, 73629688 edges, 644690 markings/sec, 40 secs
lola: 33113741 markings, 81753444 edges, 650233 markings/sec, 45 secs
lola: 36197222 markings, 89458240 edges, 616696 markings/sec, 50 secs
lola: 39274041 markings, 97150402 edges, 615364 markings/sec, 55 secs
lola: 42432027 markings, 105039399 edges, 631597 markings/sec, 60 secs
lola: 45502939 markings, 112722383 edges, 614182 markings/sec, 65 secs
lola: 48590409 markings, 120435538 edges, 617494 markings/sec, 70 secs
lola: 51650558 markings, 128087243 edges, 612030 markings/sec, 75 secs
lola: 54732317 markings, 135786127 edges, 616352 markings/sec, 80 secs
lola: 57943064 markings, 143817818 edges, 642149 markings/sec, 85 secs
lola: 61047678 markings, 151573495 edges, 620923 markings/sec, 90 secs
lola: 64190645 markings, 159426547 edges, 628593 markings/sec, 95 secs
lola: 67275819 markings, 167140362 edges, 617035 markings/sec, 100 secs
lola: 70343643 markings, 174806797 edges, 613565 markings/sec, 105 secs
lola: 73460621 markings, 182603389 edges, 623396 markings/sec, 110 secs
lola: 76533799 markings, 190279279 edges, 614636 markings/sec, 115 secs
lola: 79503627 markings, 197705641 edges, 593966 markings/sec, 120 secs
lola: 82509247 markings, 205213259 edges, 601124 markings/sec, 125 secs
lola: 85410883 markings, 212472159 edges, 580327 markings/sec, 130 secs
lola: 88554115 markings, 220326464 edges, 628646 markings/sec, 135 secs
lola: 91751711 markings, 228321725 edges, 639519 markings/sec, 140 secs
lola: 94949605 markings, 236311431 edges, 639579 markings/sec, 145 secs
lola: 97243644 markings, 242048919 edges, 458808 markings/sec, 150 secs
lola: 99476591 markings, 247629712 edges, 446589 markings/sec, 155 secs
lola: 102428013 markings, 255001834 edges, 590284 markings/sec, 160 secs
lola: 105411899 markings, 262464126 edges, 596777 markings/sec, 165 secs
lola: 107991799 markings, 268913197 edges, 515980 markings/sec, 170 secs
lola: 110907728 markings, 276199087 edges, 583186 markings/sec, 175 secs
lola: 113840525 markings, 283534681 edges, 586559 markings/sec, 180 secs
lola: 116719614 markings, 290728239 edges, 575818 markings/sec, 185 secs
lola: Child process aborted or communication problem between parent and child process
lola: RESULT
lola:
SUMMARY: yes unknown no no no no unknown no no no no
lola:
preliminary result: yes unknown no no no no unknown no no no no
lola: memory consumption: 3392 KB
lola: time consumption: 751 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="CircadianClock-PT-001000"
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 CircadianClock-PT-001000, 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 r056-oct2-162038334400013"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/CircadianClock-PT-001000.tgz
mv CircadianClock-PT-001000 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 ;