fond

jQuery Multi Level CSS Menu Css3Menu.com

Model Checking Contest 2020
10th edition, Paris, France, June 23, 2020
Execution of r168-smll-158987806400201
Last Updated
Jun 28, 2020

About the Execution of ITS-LoLa for ClientsAndServers-PT-N0020P4

Execution Summary
Max Memory
Used (MB)		 Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
15743.350 3600000.00 934864.00 26961.60 F?FFTFTFFFFFFFFT normal

Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2020-input.r168-smll-158987806400201.qcow2', fmt=qcow2 size=4294967296 backing_file='/data/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 ClientsAndServers-PT-N0020P4, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r168-smll-158987806400201
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 200K
-rw-r--r-- 1 mcc users 3.9K Mar 30 01:04 CTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Mar 30 01:04 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.8K Mar 28 15:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 19K Mar 28 15:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 24 05:37 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.2K Mar 24 05:37 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.3K Apr 8 14:45 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Apr 28 14:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Apr 8 14:45 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 28 14:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.9K Mar 27 08:15 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 21K Mar 27 08:15 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.1K Mar 26 07:40 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 20K Mar 26 07:40 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Mar 28 14:49 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Mar 28 14:49 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 equiv_col
-rw-r--r-- 1 mcc users 8 Mar 24 05:37 instance
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 iscolored
-rw-r--r-- 1 mcc users 9.2K Mar 24 05:37 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME ClientsAndServers-PT-N0020P4-00
FORMULA_NAME ClientsAndServers-PT-N0020P4-01
FORMULA_NAME ClientsAndServers-PT-N0020P4-02
FORMULA_NAME ClientsAndServers-PT-N0020P4-03
FORMULA_NAME ClientsAndServers-PT-N0020P4-04
FORMULA_NAME ClientsAndServers-PT-N0020P4-05
FORMULA_NAME ClientsAndServers-PT-N0020P4-06
FORMULA_NAME ClientsAndServers-PT-N0020P4-07
FORMULA_NAME ClientsAndServers-PT-N0020P4-08
FORMULA_NAME ClientsAndServers-PT-N0020P4-09
FORMULA_NAME ClientsAndServers-PT-N0020P4-10
FORMULA_NAME ClientsAndServers-PT-N0020P4-11
FORMULA_NAME ClientsAndServers-PT-N0020P4-12
FORMULA_NAME ClientsAndServers-PT-N0020P4-13
FORMULA_NAME ClientsAndServers-PT-N0020P4-14
FORMULA_NAME ClientsAndServers-PT-N0020P4-15

=== Now, execution of the tool begins

BK_START 1591219424408

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-03 21:23:47] [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-03 21:23:47] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-03 21:23:47] [INFO ] Load time of PNML (sax parser for PT used): 50 ms
[2020-06-03 21:23:47] [INFO ] Transformed 25 places.
[2020-06-03 21:23:47] [INFO ] Transformed 18 transitions.
[2020-06-03 21:23:47] [INFO ] Parsed PT model containing 25 places and 18 transitions in 127 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 32 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100022 steps, including 19 resets, run finished after 133 ms. (steps per millisecond=752 ) properties seen :[0, 1, 0, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1]
// Phase 1: matrix 18 rows 25 cols
[2020-06-03 21:23:48] [INFO ] Computed 8 place invariants in 7 ms
[2020-06-03 21:23:48] [INFO ] [Real]Absence check using 5 positive place invariants in 26 ms returned sat
[2020-06-03 21:23:48] [INFO ] [Real]Absence check using 5 positive and 3 generalized place invariants in 3 ms returned unsat
[2020-06-03 21:23:48] [INFO ] [Real]Absence check using 5 positive place invariants in 6 ms returned sat
[2020-06-03 21:23:48] [INFO ] [Real]Absence check using 5 positive and 3 generalized place invariants in 2 ms returned unsat
[2020-06-03 21:23:48] [INFO ] [Real]Absence check using 5 positive place invariants in 4 ms returned unsat
[2020-06-03 21:23:48] [INFO ] [Real]Absence check using 5 positive place invariants in 6 ms returned unsat
[2020-06-03 21:23:48] [INFO ] [Real]Absence check using 5 positive place invariants in 7 ms returned sat
[2020-06-03 21:23:48] [INFO ] [Real]Absence check using 5 positive and 3 generalized place invariants in 1 ms returned sat
[2020-06-03 21:23:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 21:23:48] [INFO ] [Real]Absence check using state equation in 23 ms returned sat
[2020-06-03 21:23:48] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 21:23:48] [INFO ] [Nat]Absence check using 5 positive place invariants in 15 ms returned sat
[2020-06-03 21:23:48] [INFO ] [Nat]Absence check using 5 positive and 3 generalized place invariants in 3 ms returned sat
[2020-06-03 21:23:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 21:23:48] [INFO ] [Nat]Absence check using state equation in 21 ms returned sat
[2020-06-03 21:23:48] [INFO ] Computed and/alt/rep : 17/21/17 causal constraints in 10 ms.
[2020-06-03 21:23:48] [INFO ] Added : 13 causal constraints over 3 iterations in 51 ms. Result :sat
[2020-06-03 21:23:48] [INFO ] [Real]Absence check using 5 positive place invariants in 5 ms returned unsat
Successfully simplified 5 atomic propositions for a total of 5 simplifications.
[2020-06-03 21:23:48] [INFO ] Initial state reduction rules for CTL removed 5 formulas.
[2020-06-03 21:23:48] [INFO ] Flatten gal took : 50 ms
FORMULA ClientsAndServers-PT-N0020P4-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ClientsAndServers-PT-N0020P4-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ClientsAndServers-PT-N0020P4-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ClientsAndServers-PT-N0020P4-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ClientsAndServers-PT-N0020P4-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-06-03 21:23:48] [INFO ] Flatten gal took : 12 ms
[2020-06-03 21:23:48] [INFO ] Export to MCC properties in file /home/mcc/execution/LTLCardinality.sr.xml took 7 ms.
[2020-06-03 21:23:48] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 1 ms.
info: Time: 3600 - MCC
vrfy: Checking LTLCardinality @ ClientsAndServers-PT-N0020P4 @ 3570 seconds

FORMULA ClientsAndServers-PT-N0020P4-03 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ClientsAndServers-PT-N0020P4-08 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ClientsAndServers-PT-N0020P4-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ClientsAndServers-PT-N0020P4-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ClientsAndServers-PT-N0020P4-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ClientsAndServers-PT-N0020P4-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ClientsAndServers-PT-N0020P4-02 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ClientsAndServers-PT-N0020P4-05 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ClientsAndServers-PT-N0020P4-07 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ClientsAndServers-PT-N0020P4-01 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ClientsAndServers-PT-N0020P4-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 2621
rslt: Output for LTLCardinality @ ClientsAndServers-PT-N0020P4

{
"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": "Wed Jun 3 21:23:50 2020
",
"timelimit": 3570
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 324
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 1,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 1,
"aneg": 1,
"comp": 4,
"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": 2,
"visible_transitions": 0
},
"processed": "F (G (((3 <= p18) AND (X (F (((p18 <= p6) AND (3 <= p18)))) OR (p18 <= p6)))))",
"processed_size": 78,
"rewrites": 59
},
"result":
{
"edges": 1291,
"markings": 1290,
"produced_by": "LTL model checker",
"value": false
},
"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": 360
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"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 (F ((1 <= p6)))",
"processed_size": 17,
"rewrites": 59
},
"result":
{
"edges": 1289,
"markings": 1289,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 2,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 405
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 1,
"U": 1,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "((G (F ((3 <= p20))) OR (3 <= p20)) U X (F ((3 <= p5))))",
"processed_size": 56,
"rewrites": 59
},
"result":
{
"edges": 1938,
"markings": 1938,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 4
},
"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": 463
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 1,
"U": 0,
"X": 2,
"aconj": 0,
"adisj": 0,
"aneg": 3,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 5,
"taut": 0,
"tconj": 2,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "F (G ((X ((X ((p21 <= 1)) AND (p1 + 1 <= p15))) AND F ((p10 + 1 <= p18)))))",
"processed_size": 75,
"rewrites": 59
},
"result":
{
"edges": 1291,
"markings": 1290,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 8
},
"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": 540
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "X ((G (F ((2 <= p22))) AND (p19 + 1 <= p14)))",
"processed_size": 45,
"rewrites": 59
},
"result":
{
"edges": 1290,
"markings": 1290,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 5
},
"compoundnumber": 5,
"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": 648
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 1,
"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 (G ((p6 + 1 <= p0)))",
"processed_size": 22,
"rewrites": 59
},
"result":
{
"edges": 1289,
"markings": 1289,
"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"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 810
},
"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 ((2 <= p21)))",
"processed_size": 18,
"rewrites": 59
},
"result":
{
"edges": 1299666,
"markings": 1090535,
"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"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1080
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 3,
"G": 3,
"U": 1,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 6,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 8,
"taut": 0,
"tconj": 2,
"tdisj": 2,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "G ((F ((2 <= p10)) AND (((F ((p13 <= p22)) OR (p13 <= p22)) U G ((F (G ((1 <= p13))) AND (p10 <= 1)))) OR (2 <= p10))))",
"processed_size": 119,
"rewrites": 59
},
"result":
{
"edges": 610,
"markings": 610,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 12
},
"compoundnumber": 8,
"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": 1620
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1620
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "(p6 <= 0)",
"processed_size": 9,
"rewrites": 61
},
"result":
{
"edges": 1288,
"markings": 1289,
"produced_by": "state space / EG",
"value": false
},
"task":
{
"compoundnumber": 9,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 2
},
"threads": 1,
"type": "dfs"
},
"type": "eventual_occurrence"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 9,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3241
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3241
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "(p9 <= p23)",
"processed_size": 11,
"rewrites": 59
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 10,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 1,
"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": 3,
"visible_transitions": 0
},
"processed": "((p15 + 1 <= p9) OR (p20 + 1 <= p15))",
"processed_size": 38,
"rewrites": 61
},
"result":
{
"edges": 1437,
"markings": 1398,
"produced_by": "state space / EG",
"value": false
},
"task":
{
"compoundnumber": 12,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 7
},
"threads": 1,
"type": "dfs"
},
"type": "eventual_occurrence"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": null
},
"task":
{
"compoundnumber": 10,
"type": "boolean"
}
},

{
"child":
[

{
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "(p9 <= p23)",
"processed_size": 11,
"rewrites": 59
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 12,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "(p24 <= p6)",
"processed_size": 11,
"rewrites": 59
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 13,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 1,
"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": 3,
"visible_transitions": 0
},
"processed": "((p15 + 1 <= p9) OR (p20 + 1 <= p15))",
"processed_size": 38,
"rewrites": 61
},
"result":
{
"edges": 1437,
"markings": 1398,
"produced_by": "state space / EG",
"value": false
},
"task":
{
"compoundnumber": 14,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 7
},
"threads": 1,
"type": "dfs"
},
"type": "eventual_occurrence"
}
}
],
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 12,
"type": "boolean"
}
}
],
"exit":
{
"error": null,
"memory": 3368,
"runtime": 949.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "LTLCardinality.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "G((F(**) OR G(F((X(**) OR **))))) : F(G(**)) : F(G((** AND (X(F(*)) OR **)))) : G((F(**) AND (((F(**) OR **) U G((F(G(**)) AND **))) OR **))) : (F(**) AND G(**)) : X(F(**)) : ((G(F(**)) OR **) U X(F(**))) : (** OR (F(**) AND **)) : F(G((X((X(*) AND *)) AND F(*)))) : X((G(F(**)) AND **)) : X(G(*))"
},
"net":
{
"arcs": 54,
"conflict_clusters": 16,
"places": 25,
"places_significant": 17,
"singleton_clusters": 0,
"transitions": 18
},
"result":
{
"preliminary_value": "unknown no no no no no no no no no no ",
"value": "unknown no no no no no no 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: 43/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 800
lola: finding significant places
lola: 25 places, 18 transitions, 17 significant places
lola: compute conflict clusters
lola: computed conflict clusters
lola: Computing conflicting sets
lola: Computing back conflicting sets
lola: TASK
lola: Reading formula in XML format (--xmlformula)
lola: reading pnml
lola: reading formula from LTLCardinality.xml
lola: G ((F (((p1 <= p18) OR (p4 <= p24))) OR G (X (F (X ((X ((p12 <= p8)) OR (p12 <= p8)))))))) : X (F (G ((2 <= p21)))) : F (G (((3 <= p18) AND (F (NOT(X (((p6 + 1 <= p18) OR (p18 <= 2))))) OR (p18 <= p6))))) : G ((((F ((p13 <= p22)) OR (p13 <= p22)) U G ((F (G ((1 <= p13))) AND (p10 <= 1)))) U (2 <= p10))) : (F ((1 <= p6)) AND G ((p9 <= p11))) : F ((X ((p2 <= p3)) U X (((p2 <= p12) U (1 <= p6))))) : ((F (G (F ((3 <= p20)))) OR (3 <= p20)) U F (X ((3 <= p5)))) : ((p24 <= p6) OR (F (((p9 <= p15) AND (p15 <= p20))) AND (p9 <= p23))) : NOT(G (F (NOT(G ((NOT(X ((X ((2 <= p21)) OR (p15 <= p1)))) AND NOT(G ((p18 <= p10))))))))) : X ((F (G (((2 <= p22) U F ((2 <= p22))))) AND (p19 + 1 <= p14))) : NOT(X (F ((X (F (((3 <= p22) U (0 <= 0)))) AND F ((p0 <= p6))))))
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:377
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:380
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:437
lola: rewrite Frontend/Parser/formula_rewrite.k:522
lola: rewrite Frontend/Parser/formula_rewrite.k:410
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:434
lola: rewrite Frontend/Parser/formula_rewrite.k:434
lola: rewrite Frontend/Parser/formula_rewrite.k:371
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k: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: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k: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: rewrite Frontend/Parser/formula_rewrite.k:422
lola: rewrite Frontend/Parser/formula_rewrite.k:371
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:335
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:315
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:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:122
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G ((F (((p1 <= p18) OR (p4 <= p24))) OR G (F ((X ((p12 <= p8)) OR (p12 <= p8))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((F (((p1 <= p18) OR (p4 <= p24))) OR G (F ((X ((p12 <= p8)) OR (p12 <= p8))))))
lola: processed formula length: 83
lola: 59 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: 2280464 markings, 4020828 edges, 456093 markings/sec, 0 secs
lola: 4157950 markings, 7508052 edges, 375497 markings/sec, 5 secs
lola: 5857882 markings, 10690290 edges, 339986 markings/sec, 10 secs
lola: 7471511 markings, 13787582 edges, 322726 markings/sec, 15 secs
lola: 9073357 markings, 16860974 edges, 320369 markings/sec, 20 secs
lola: 10615729 markings, 19830839 edges, 308474 markings/sec, 25 secs
lola: 12168413 markings, 22809555 edges, 310537 markings/sec, 30 secs
lola: 13679414 markings, 25725732 edges, 302200 markings/sec, 35 secs
lola: 15149096 markings, 28594144 edges, 293936 markings/sec, 40 secs
lola: 16586272 markings, 31375655 edges, 287435 markings/sec, 45 secs
lola: 18051444 markings, 34262320 edges, 293034 markings/sec, 50 secs
lola: 19448734 markings, 37011756 edges, 279458 markings/sec, 55 secs
lola: 20873809 markings, 39785796 edges, 285015 markings/sec, 60 secs
lola: 22253629 markings, 42508390 edges, 275964 markings/sec, 65 secs
lola: 23640272 markings, 45274340 edges, 277329 markings/sec, 70 secs
lola: 25001665 markings, 47966544 edges, 272279 markings/sec, 75 secs
lola: 26404754 markings, 50718606 edges, 280618 markings/sec, 80 secs
lola: 27755707 markings, 53393141 edges, 270191 markings/sec, 85 secs
lola: 28986959 markings, 55830088 edges, 246250 markings/sec, 90 secs
lola: 30227850 markings, 58300190 edges, 248178 markings/sec, 95 secs
lola: 31485981 markings, 60798817 edges, 251626 markings/sec, 100 secs
lola: 32774013 markings, 63316748 edges, 257606 markings/sec, 105 secs
lola: 34006380 markings, 65787208 edges, 246473 markings/sec, 110 secs
lola: 35255014 markings, 68288016 edges, 249727 markings/sec, 115 secs
lola: 36446340 markings, 70652984 edges, 238265 markings/sec, 120 secs
lola: 37692849 markings, 73125300 edges, 249302 markings/sec, 125 secs
lola: 38945689 markings, 75626224 edges, 250568 markings/sec, 130 secs
lola: 40165631 markings, 78076430 edges, 243988 markings/sec, 135 secs
lola: 41396654 markings, 80536340 edges, 246205 markings/sec, 140 secs
lola: 42608439 markings, 82964383 edges, 242357 markings/sec, 145 secs
lola: 43778592 markings, 85318389 edges, 234031 markings/sec, 150 secs
lola: 44986082 markings, 87748465 edges, 241498 markings/sec, 155 secs
lola: 46163161 markings, 90098823 edges, 235416 markings/sec, 160 secs
lola: 47349698 markings, 92490739 edges, 237307 markings/sec, 165 secs
lola: 48511922 markings, 94815552 edges, 232445 markings/sec, 170 secs
lola: 49691799 markings, 97187618 edges, 235975 markings/sec, 175 secs
lola: 50825081 markings, 99461348 edges, 226656 markings/sec, 180 secs
lola: 51988380 markings, 101810230 edges, 232660 markings/sec, 185 secs
lola: 53151995 markings, 104141058 edges, 232723 markings/sec, 190 secs
lola: 54332969 markings, 106494096 edges, 236195 markings/sec, 195 secs
lola: 55463067 markings, 108800122 edges, 226020 markings/sec, 200 secs
lola: 56612496 markings, 111122077 edges, 229886 markings/sec, 205 secs
lola: 57753873 markings, 113434934 edges, 228275 markings/sec, 210 secs
lola: 58900905 markings, 115743223 edges, 229406 markings/sec, 215 secs
lola: 60032536 markings, 118032222 edges, 226326 markings/sec, 220 secs
lola: 61180085 markings, 120347950 edges, 229510 markings/sec, 225 secs
lola: 62313981 markings, 122619991 edges, 226779 markings/sec, 230 secs
lola: 63415348 markings, 124844882 edges, 220273 markings/sec, 235 secs
lola: 64552521 markings, 127132995 edges, 227435 markings/sec, 240 secs
lola: 65670942 markings, 129401728 edges, 223684 markings/sec, 245 secs
lola: 66775757 markings, 131652860 edges, 220963 markings/sec, 250 secs
lola: 67862597 markings, 133881690 edges, 217368 markings/sec, 255 secs
lola: 68956751 markings, 136101537 edges, 218831 markings/sec, 260 secs
lola: 70058452 markings, 138335718 edges, 220340 markings/sec, 265 secs
lola: 71146236 markings, 140559982 edges, 217557 markings/sec, 270 secs
lola: 72227506 markings, 142763416 edges, 216254 markings/sec, 275 secs
lola: 73306737 markings, 144964675 edges, 215846 markings/sec, 280 secs
lola: 74379719 markings, 147136583 edges, 214596 markings/sec, 285 secs
lola: 75455402 markings, 149329750 edges, 215137 markings/sec, 290 secs
lola: 76528995 markings, 151511620 edges, 214719 markings/sec, 295 secs
lola: 77647960 markings, 153747600 edges, 223793 markings/sec, 300 secs
lola: 78705433 markings, 155902473 edges, 211495 markings/sec, 305 secs
lola: 79764721 markings, 158047046 edges, 211858 markings/sec, 310 secs
lola: 80808893 markings, 160187934 edges, 208834 markings/sec, 315 secs
lola: local time limit reached - aborting
lola:
preliminary result: unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 1 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G (((3 <= p18) AND (X (F (((p18 <= p6) AND (3 <= p18)))) OR (p18 <= p6)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F (G (((3 <= p18) AND (X (F (((p18 <= p6) AND (3 <= p18)))) OR (p18 <= p6)))))
lola: processed formula length: 78
lola: 59 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: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 1290 markings, 1291 edges
lola: ========================================
lola: subprocess 2 will run for 360 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (F ((1 <= p6)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (F ((1 <= p6)))
lola: processed formula length: 17
lola: 59 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: 1289 markings, 1289 edges
lola: ========================================
lola: subprocess 3 will run for 405 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((G (F ((3 <= p20))) OR (3 <= p20)) U X (F ((3 <= p5))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: ((G (F ((3 <= p20))) OR (3 <= p20)) U X (F ((3 <= p5))))
lola: processed formula length: 56
lola: 59 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: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 1938 markings, 1938 edges
lola: ========================================
lola: subprocess 4 will run for 463 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G ((X ((X ((p21 <= 1)) AND (p1 + 1 <= p15))) AND F ((p10 + 1 <= p18)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F (G ((X ((X ((p21 <= 1)) AND (p1 + 1 <= p15))) AND F ((p10 + 1 <= p18)))))
lola: processed formula length: 75
lola: 59 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 8 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: 1290 markings, 1291 edges
lola: ========================================
lola: subprocess 5 will run for 540 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((G (F ((2 <= p22))) AND (p19 + 1 <= p14)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((G (F ((2 <= p22))) AND (p19 + 1 <= p14)))
lola: processed formula length: 45
lola: 59 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: 1290 markings, 1290 edges
lola: ========================================
lola: subprocess 6 will run for 648 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (G ((p6 + 1 <= p0)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (G ((p6 + 1 <= p0)))
lola: processed formula length: 22
lola: 59 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: 1289 markings, 1289 edges
lola: ========================================
lola: subprocess 7 will run for 810 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G ((2 <= p21)))
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 ((2 <= p21)))
lola: processed formula length: 18
lola: 59 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: add low 0
lola: add low 4
lola: add low 3
lola: add low 2
lola: add low 6
lola: add low 5
lola: add low 10
lola: add low 11
lola: add low 16
lola: add low 12
lola: add low 13
lola: add low 15
lola: add low 1
lola: add low 0
lola: add low 4
lola: add low 3
lola: add low 2
lola: add low 6
lola: add low 5
lola: add low 10
lola: add low 11
lola: add low 16
lola: add low 12
lola: add low 13
lola: add low 15
lola: add low 1
lola: add low 0
lola: add low 4
lola: add low 3
lola: add low 2
lola: add low 6
lola: add low 5
lola: add low 10
lola: add low 11
lola: add low 16
lola: add low 12
lola: add low 13
lola: add low 15
lola: add low 1
lola: add low 0
lola: add low 4
lola: add low 3
lola: add low 2
lola: add low 6
lola: add low 5
lola: add low 10
lola: add low 11
lola: add low 16
lola: add low 12
lola: add low 13
lola: add low 15
lola: add low 1
lola: add low 0
lola: add low 4
lola: add low 3
lola: add low 2
lola: add low 6
lola: add low 5
lola: add low 10
lola: add low 11
lola: add low 16
lola: add low 12
lola: add low 13
lola: add low 15
lola: add low 1
lola: add low 0
lola: add low 4
lola: add low 3
lola: add low 2
lola: add low 6
lola: add low 5
lola: add low 10
lola: add low 11
lola: add low 16
lola: add low 12
lola: add low 13
lola: add low 15
lola: add low 1
lola: add low 0
lola: add low 4
lola: add low 3
lola: add low 2
lola: add low 6
lola: add low 5
lola: add low 10
lola: add low 11
lola: add low 16
lola: add low 12
lola: add low 13
lola: add low 15
lola: add low 1
lola: add low 0
lola: add low 4
lola: add low 3
lola: add low 2
lola: add low 6
lola: add low 5
lola: add low 10
lola: add low 11
lola: add low 16
lola: add low 12
lola: add low 13
lola: add low 15
lola: add low 1
lola: add low 0
lola: add low 4
lola: add low 3
lola: add low 2
lola: add low 6
lola: add low 5
lola: add low 10
lola: add low 11
lola: add low 16
lola: add low 12
lola: add low 13
lola: add low 15
lola: add low 1
lola: add low 0
lola: add low 4
lola: add low 3
lola: add low 2
lola: add low 6
lola: add low 5
lola: add low 10
lola: add low 11
lola: add low 16
lola: add low 12
lola: add low 13
lola: add low 15
lola: add low 1
lola: add low 0
lola: add low 4
lola: add low 3
lola: add low 2
lola: add low 6
lola: add low 5
lola: add low 10
lola: add low 11
lola: add low 16
lola: add low 12
lola: add low 13
lola: add low 15
lola: add low 1
lola: add low 0
lola: add low 4
lola: add low 3
lola: add low 2
lola: add low 6
lola: add low 5
lola: add low 10
lola: add low 11
lola: add low 16
lola: add low 12
lola: add low 13
lola: add low 15
lola: add low 1
lola: add low 0
lola: add low 4
lola: add low 3
lola: add low 2
lola: add low 6
lola: add low 5
lola: add low 10
lola: add low 11
lola: add low 16
lola: add low 12
lola: add low 13
lola: add low 15
lola: add low 1
lola: add low 0
lola: add low 4
lola: add low 3
lola: add low 2
lola: add low 6
lola: add low 5
lola: add low 10
lola: add low 11
lola: add low 16
lola: add low 12
lola: add low 13
lola: add low 15
lola: add low 1
lola: add low 0
lola: add low 4
lola: add low 3
lola: add low 2
lola: add low 6
lola: add low 5
lola: add low 10
lola: add low 11
lola: add low 16
lola: add low 12
lola: add low 13
lola: add low 15
lola: add low 1
lola: add low 0
lola: add low 4
lola: add low 3
lola: add low 2
lola: add low 6
lola: add low 5
lola: add low 10
lola: add low 11
lola: add low 16
lola: add low 12
lola: add low 13
lola: add low 15
lola: add low 1
lola: add low 0
lola: add low 4
lola: add low 3
lola: add low 2
lola: add low 6
lola: add low 5
lola: add low 10
lola: add low 11
lola: add low 16
lola: add low 12
lola: add low 13
lola: add low 15
lola: add low 1
lola: add low 0
lola: add low 4
lola: add low 3
lola: add low 2
lola: add low 6
lola: add low 5
lola: add low 10
lola: add low 11
lola: add low 16
lola: add low 12
lola: add low 13
lola: add low 15
lola: add low 1
lola: add low 0
lola: add low 4
lola: add low 3
lola: add low 2
lola: add low 6
lola: add low 5
lola: add low 10
lola: add low 11
lola: add low 16
lola: add low 12
lola: add low 13
lola: add low 15
lola: add low 1
lola: add low 0
lola: add low 4
lola: add low 3
lola: add low 2
lola: add low 6
lola: add low 5
lola: add low 10
lola: add low 11
lola: add low 16
lola: add low 12
lola: add low 13
lola: add low 15
lola: add low 1
lola: add low 0
lola: add low 4
lola: add low 3
lola: add low 2
lola: add low 6
lola: add low 5
lola: add low 10
lola: add low 11
lola: add low 16
lola: add low 12
lola: add low 13
lola: add low 15
lola: add low 1
lola: add low 0
lola: add low 4
lola: add low 3
lola: add low 2
lola: add low 6
lola: add low 5
lola: add low 10
lola: add low 11
lola: add low 16
lola: add low 12
lola: add low 13
lola: add low 15
lola: add low 1
lola: add low 0
lola: add low 4
lola: add low 3
lola: add low 2
lola: add low 6
lola: add low 5
lola: add low 10
lola: add low 11
lola: add low 16
lola: add low 12
lola: add low 13
lola: add low 15
lola: add low 1
lola: add low 0
lola: add low 4
lola: add low 3
lola: add low 2
lola: add low 6
lola: add low 5
lola: add low 10
lola: add low 11
lola: add low 16
lola: add low 12
lola: add low 13
lola: add low 15
lola: add low 1
lola: add low 0
lola: add low 4
lola: add low 3
lola: add low 2
lola: add low 12
lola: add low 13
lola: add low 15
lola: add low 1
lola: add low 0
lola: add low 4
lola: add low 3
lola: add low 2
lola: add low 12
lola: add low 13
lola: add low 15
lola: add low 1
lola: add low 0
lola: add low 4
lola: add low 3
lola: add low 2
lola: add low 12
lola: add low 13
lola: add low 15
lola: add low 1
lola: add low 0
lola: add low 4
lola: add low 3
lola: add low 2
lola: add low 12
lola: add low 13
lola: add low 15
lola: add low 1
lola: add low 0
lola: add low 4
lola: add low 3
lola: add low 2
lola: add low 12
lola: add low 13
lola: add low 15
lola: add low 1
lola: add low 0
lola: add low 4
lola: add low 3
lola: add low 2
lola: add low 12
lola: add low 13
lola: add low 15
lola: add low 1
lola: add low 0
lola: add low 4
lola: add low 3
lola: add low 2
lola: add low 12
lola: add low 13
lola: add low 15
lola: add low 1
lola: add low 0
lola: add low 4
lola: add low 3
lola: add low 2
lola: add low 12
lola: add low 13
lola: add low 15
lola: add low 1
lola: add low 0
lola: add low 4
lola: add low 3
lola: add low 2
lola: add low 12
lola: add low 13
lola: add low 15
lola: add low 1
lola: add low 0
lola: add low 4
lola: add low 3
lola: add low 2
lola: add low 12
lola: add low 13
lola: add low 15
lola: add low 1
lola: add low 0
lola: add low 4
lola: add low 3
lola: add low 2
lola: add low 12
lola: add low 13
lola: add low 15
lola: add low 1
lola: add low 0
lola: add low 4
lola: add low 3
lola: add low 2
lola: add low 12
lola: add low 13
lola: add low 15
lola: add low 1
lola: add low 0
lola: add low 4
lola: add low 3
lola: add low 2
lola: add low 12
lola: add low 13
lola: add low 15
lola: add low 1
lola: add low 0
lola: add low 4
lola: add low 3
lola: add low 2
lola: add low 12
lola: add low 13
lola: add low 15
lola: add low 1
lola: add low 0
lola: add low 4
lola: add low 3
lola: add low 2
lola: add low 12
lola: add low 13
lola: add low 15
lola: add low 1
lola: add low 0
lola: add low 4
lola: add low 3
lola: add low 2
lola: add low 12
lola: add low 13
lola: add low 15
lola: add low 1
lola: add low 0
lola: add low 4
lola: add low 3
lola: add low 2
lola: add low 12
lola: add low 13
lola: add low 15
lola: add low 1
lola: add low 0
lola: add low 4
lola: add low 3
lola: add low 2
lola: add low 12
lola: add low 13
lola: add low 15
lola: add low 1
lola: add low 0
lola: add low 4
lola: add low 3
lola: add low 2
lola: add low 12
lola: add low 13
lola: add low 15
lola: add low 1
lola: add low 0
lola: add low 4
lola: add low 3
lola: add low 2
lola: add low 12
lola: add low 13
lola: add low 15
lola: add low 1
lola: add low 0
lola: add low 4
lola: add low 3
lola: add low 2
lola: add low 12
lola: add low 13
lola: add low 15
lola: add low 1
lola: add low 0
lola: add low 4
lola: add low 3
lola: add low 2
lola: add low 12
lola: add low 13
lola: add low 15
lola: add low 1
lola: add low 0
lola: add low 4
lola: add low 3
lola: add low 2
lola: add low 12
lola: add low 13
lola: add low 15
lola: add low 1
lola: add low 0
lola: add low 4
lola: add low 3
lola: add low 2
lola: add low 12
lola: add low 13
lola: add low 15
lola: add low 1
lola: add low 0
lola: add low 4
lola: add low 3
lola: add low 2
lola: add low 12
lola: add low 13
lola: add low 15
lola: add low 1
lola: add low 0
lola: add low 4
lola: add low 3
lola: add low 2
lola: add low 12
lola: add low 13
lola: add low 15
lola: add low 1
lola: add low 0
lola: add low 4
lola: add low 3
lola: add low 2
lola: add low 12
lola: add low 13
lola: add low 15
lola: add low 1
lola: add low 0
lola: add low 4
lola: add low 3
lola: add low 2
lola: add low 12
lola: add low 13
lola: add low 15
lola: add low 1
lola: add low 0
lola: add low 4
lola: add low 3
lola: add low 2
lola: add low 12
lola: add low 13
lola: add low 15
lola: add low 1
lola: add low 0
lola: add low 4
lola: add low 3
lola: add low 2
lola: add low 12
lola: add low 13
lola: add low 15
lola: add low 1
lola: add low 0
lola: add low 4
lola: add low 3
lola: add low 2
lola: add low 12
lola: add low 13
lola: add low 15
lola: add low 1
lola: add low 0
lola: add low 4
lola: add low 3
lola: add low 2
lola: add low 12
lola: add low 13
lola: add low 15
lola: add low 1
lola: add low 0
lola: add low 4
lola: add low 3
lola: add low 2
lola: add low 12
lola: add low 13
lola: add low 15
lola: add low 1
lola: add low 0
lola: add low 4
lola: add low 3
lola: add low 2
lola: add low 12
lola: add low 13
lola: add low 15
lola: add low 1
lola: add low 0
lola: add low 4
lola: add low 3
lola: add low 2
lola: add low 12
lola: add low 13
lola: add low 15
lola: add low 1
lola: add low 0
lola: add low 4
lola: add low 3
lola: add low 2
lola: add low 12
lola: add low 13
lola: add low 15
lola: add low 1
lola: add low 0
lola: add low 4
lola: add low 3
lola: add low 2
lola: add low 12
lola: add low 13
lola: add low 15
lola: add low 1
lola: add low 0
lola: add low 4
lola: add low 3
lola: add low 2
lola: add low 12
lola: add low 13
lola: add low 15
lola: add low 1
lola: add low 0
lola: add low 4
lola: add low 3
lola: add low 2
lola: add low 12
lola: add low 13
lola: add low 15
lola: add low 1
lola: add low 0
lola: add low 4
lola: add low 3
lola: add low 2
lola: add low 12
lola: add low 13
lola: add low 15
lola: add low 1
lola: add low 0
lola: add low 4
lola: add low 3
lola: add low 2
lola: add low 12
lola: add low 13
lola: add low 15
lola: add low 1
lola: add low 0
lola: add low 4
lola: add low 3
lola: add low 2
lola: add low 12
lola: add low 13
lola: add low 15
lola: add low 1
lola: add low 0
lola: add low 4
lola: add low 3
lola: add low 2
lola: add low 12
lola: add low 13
lola: add low 15
lola: add low 1
lola: add low 0
lola: add low 4
lola: add low 3
lola: add low 2
lola: add low 12
lola: add low 13
lola: add low 15
lola: add low 1
lola: add low 0
lola: add low 4
lola: add low 3
lola: add low 2
lola: add low 12
lola: add low 13
lola: add low 15
lola: add low 1
lola: add low 0
lola: add low 4
lola: add low 3
lola: add low 2
lola: add low 12
lola: add low 13
lola: add low 15
lola: add low 1
lola: add low 0
lola: add low 4
lola: add low 3
lola: add low 2
lola: add low 12
lola: add low 13
lola: add low 15
lola: add low 1
lola: add low 0
lola: add low 4
lola: add low 3
lola: add low 2
lola: add low 12
lola: add low 13
lola: add low 15
lola: add low 1
lola: add low 0
lola: add low 4
lola: add low 3
lola: add low 2
lola: add low 12
lola: add low 13
lola: add low 15
lola: add low 1
lola: add low 0
lola: add low 4
lola: add low 3
lola: add low 2
lola: add low 12
lola: add low 13
lola: add low 15
lola: add low 1
lola: add low 0
lola: add low 4
lola: add low 3
lola: add low 2
lola: add low 12
lola: add low 13
lola: add low 15
lola: add low 1
lola: add low 0
lola: add low 4
lola: add low 3
lola: add low 2
lola: add low 12
lola: add low 13
lola: add low 15
lola: add low 1
lola: add low 0
lola: add low 4
lola: add low 3
lola: add low 2
lola: add low 12
lola: add low 13
lola: add low 15
lola: add low 1
lola: add low 0
lola: add low 4
lola: add low 3
lola: add low 2
lola: add low 12
lola: add low 13
lola: add low 15
lola: add low 1
lola: add low 0
lola: add low 4
lola: add low 3
lola: add low 2
lola: add low 12
lola: add low 13
lola: add low 15
lola: add low 1
lola: add low 0
lola: add low 4
lola: add low 3
lola: add low 2
lola: add low 12
lola: add low 13
lola: add low 15
lola: add low 1
lola: add low 0
lola: add low 4
lola: add low 3
lola: add low 2
lola: add low 12
lola: add low 13
lola: add low 15
lola: add low 1
lola: add low 0
lola: add low 4
lola: add low 3
lola: add low 2
lola: add low 12
lola: add low 13
lola: add low 15
lola: add low 1
lola: add low 0
lola: add low 4
lola: add low 3
lola: add low 2
lola: add low 12
lola: add low 13
lola: add low 15
lola: add low 1
lola: add low 0
lola: add low 4
lola: add low 3
lola: add low 2
lola: add low 12
lola: add low 13
lola: add low 15
lola: add low 1
lola: add low 0
lola: add low 4
lola: add low 3
lola: add low 2
lola: add low 12
lola: add low 13
lola: add low 15
lola: add low 1
lola: add low 0
lola: add low 4
lola: add low 3
lola: add low 2
lola: add low 12
lola: add low 13
lola: add low 15
lola: add low 1
lola: add low 0
lola: add low 4
lola: add low 3
lola: add low 2
lola: add low 12
lola: add low 13
lola: add low 15
lola: add low 1
lola: add low 0
lola: add low 4
lola: add low 3
lola: add low 2
lola: add low 12
lola: add low 13
lola: add low 15
lola: add low 1
lola: add low 0
lola: add low 4
lola: add low 3
lola: add low 2
lola: add low 12
lola: add low 13
lola: add low 15
lola: add low 1
lola: add low 0
lola: add low 4
lola: add low 3
lola: add low 2
lola: add low 12
lola: add low 13
lola: add low 15
lola: add low 1
lola: add low 0
lola: add low 4
lola: add low 3
lola: add low 2
lola: add low 12
lola: add low 13
lola: add low 15
lola: add low 1
lola: add low 0
lola: add low 4
lola: add low 3
lola: add low 2
lola: add low 12
lola: add low 13
lola: add low 15
lola: add low 1
lola: add low 0
lola: add low 4
lola: add low 3
lola: add low 2
lola: add low 12
lola: add low 13
lola: add low 15
lola: add low 1
lola: add low 0
lola: add low 4
lola: add low 3
lola: add low 2
lola: add low 12
lola: add low 13
lola: add low 15
lola: add low 1
lola: add low 0
lola: add low 4
lola: add low 3
lola: add low 2
lola: add low 12
lola: add low 13
lola: add low 15
lola: add low 1
lola: add low 0
lola: add low 4
lola: add low 3
lola: add low 2
lola: add low 12
lola: add low 13
lola: add low 15
lola: add low 1
lola: add low 0
lola: add low 4
lola: add low 3
lola: add low 2
lola: add low 12
lola: add low 13
lola: add low 15
lola: add low 1
lola: add low 0
lola: add low 4
lola: add low 3
lola: add low 2
lola: add low 12
lola: add low 13
lola: add low 15
lola: add low 1
lola: add low 0
lola: add low 4
lola: add low 3
lola: add low 2
lola: add low 12
lola: add low 13
lola: add low 15
lola: add low 1
lola: add low 0
lola: add low 4
lola: add low 3
lola: add low 2
lola: add low 12
lola: add low 13
lola: add low 15
lola: add low 1
lola: add low 0
lola: add low 4
lola: add low 3
lola: add low 2
lola: add low 12
lola: add low 13
lola: add low 15
lola: add low 1
lola: add low 0
lola: add low 4
lola: add low 3
lola: add low 2
lola: add low 12
lola: add low 13
lola: add low 15
lola: add low 1
lola: add low 0
lola: add low 4
lola: add low 3
lola: add low 2
lola: add low 12
lola: add low 13
lola: add low 15
lola: add low 1
lola: add low 0
lola: add low 4
lola: add low 3
lola: add low 2
lola: add low 12
lola: add low 13
lola: add low 15
lola: add low 1
lola: add low 0
lola: add low 4
lola: add low 3
lola: add low 2
lola: add low 12
lola: add low 13
lola: add low 15
lola: add low 1
lola: add low 0
lola: add low 4
lola: add low 3
lola: add low 2
lola: add low 12
lola: add low 13
lola: add low 15
lola: add low 1
lola: add low 0
lola: add low 4
lola: add low 3
lola: add low 2
lola: add low 12
lola: add low 13
lola: add low 15
lola: add low 1
lola: add low 0
lola: add low 4
lola: add low 3
lola: add low 2
lola: add low 12
lola: add low 13
lola: add low 15
lola: add low 1
lola: add low 0
lola: add low 4
lola: add low 3
lola: add low 2
lola: add low 12
lola: add low 13
lola: add low 15
lola: add low 1
lola: add low 0
lola: add low 4
lola: add low 3
lola: add low 2
lola: add low 12
lola: add low 13
lola: add low 15
lola: add low 1
lola: add low 0
lola: add low 4
lola: add low 3
lola: add low 2
lola: add low 12
lola: add low 13
lola: add low 15
lola: add low 1
lola: add low 0
lola: add low 4
lola: add low 3
lola: add low 2
lola: add low 12
lola: add low 13
lola: add low 15
lola: add low 1
lola: add low 0
lola: add low 4
lola: add low 3
lola: add low 2
lola: add low 12
lola: add low 13
lola: add low 15
lola: add low 1
lola: add low 0
lola: add low 4
lola: add low 3
lola: add low 2
lola: add low 12
lola: add low 13
lola: add low 15
lola: add low 1
lola: add low 0
lola: add low 4
lola: add low 3
lola: add low 2
lola: add low 12
lola: add low 13
lola: add low 15
lola: add low 1
lola: add low 0
lola: add low 4
lola: add low 3
lola: add low 2
lola: add low 12
lola: add low 13
lola: add low 15
lola: add low 1
lola: add low 0
lola: add low 4
lola: add low 3
lola: add low 2
lola: add low 12
lola: add low 13
lola: add low 15
lola: add low 1
lola: add low 0
lola: add low 4
lola: add low 3
lola: add low 2
lola: add low 12
lola: add low 13
lola: add low 15
lola: add low 1
lola: add low 0
lola: add low 4
lola: add low 3
lola: add low 2
lola: add low 12
lola: add low 13
lola: add low 15
lola: add low 1
lola: add low 0
lola: add low 4
lola: add low 3
lola: add low 2
lola: add low 12
lola: add low 13
lola: add low 15
lola: add low 1
lola: add low 0
lola: add low 4
lola: add low 3
lola: add low 2
lola: add low 12
lola: add low 13
lola: add low 15
lola: add low 1
lola: add low 0
lola: add low 4
lola: add low 3
lola: add low 2
lola: add low 12
lola: add low 13
lola: add low 15
lola: add low 1
lola: add low 0
lola: add low 4
lola: add low 3
lola: add low 2
lola: add low 12
lola: add low 13
lola: add low 15
lola: add low 1
lola: add low 0
lola: add low 4
lola: add low 3
lola: add low 2
lola: add low 12
lola: add low 13
lola: add low 15
lola: add low 1
lola: add low 0
lola: add low 4
lola: add low 3
lola: add low 2
lola: add low 12
lola: add low 13
lola: add low 15
lola: add low 1
lola: add low 0
lola: add low 4
lola: add low 3
lola: add low 2
lola: add low 12
lola: add low 13
lola: add low 15
lola: add low 1
lola: add low 0
lola: add low 4
lola: add low 3
lola: add low 2
lola: add low 12
lola: add low 13
lola: add low 15
lola: add low 1
lola: add low 0
lola: add low 4
lola: add low 3
lola: add low 2
lola: add low 12
lola: add low 13
lola: add low 15
lola: add low 1
lola: add low 0
lola: add low 4
lola: add low 3
lola: add low 2
lola: add low 12
lola: add low 13
lola: add low 15
lola: add low 1
lola: add low 0
lola: add low 4
lola: add low 3
lola: add low 2
lola: add low 12
lola: add low 13
lola: add low 15
lola: add low 1
lola: add low 0
lola: add low 4
lola: add low 3
lola: add low 2
lola: add low 12
lola: add low 13
lola: add low 15
lola: add low 1
lola: add low 0
lola: add low 4
lola: add low 3
lola: add low 2
lola: add low 12
lola: add low 13
lola: add low 15
lola: add low 1
lola: add low 0
lola: add low 4
lola: add low 3
lola: add low 2
lola: add low 12
lola: add low 13
lola: add low 15
lola: add low 1
lola: add low 0
lola: add low 4
lola: add low 3
lola: add low 2
lola: add low 12
lola: add low 13
lola: add low 15
lola: add low 1
lola: add low 0
lola: add low 4
lola: add low 3
lola: add low 2
lola: add low 12
lola: add low 13
lola: add low 15
lola: add low 1
lola: add low 0
lola: add low 4
lola: add low 3
lola: add low 2
lola: add low 12
lola: add low 13
lola: add low 7
lola: add low 6
lola: add low 5
lola: add low 10
lola: add low 11
lola: add low 16
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: 1090535 markings, 1299666 edges
lola: ========================================
lola: subprocess 8 will run for 1080 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G ((F ((2 <= p10)) AND (((F ((p13 <= p22)) OR (p13 <= p22)) U G ((F (G ((1 <= p13))) AND (p10 <= 1)))) OR (2 <= p10))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((F ((2 <= p10)) AND (((F ((p13 <= p22)) OR (p13 <= p22)) U G ((F (G ((1 <= p13))) AND (p10 <= 1)))) OR (2 <= p10))))
lola: processed formula length: 119
lola: 59 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 12 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: 610 markings, 610 edges
lola: ========================================
lola: subprocess 9 will run for 1620 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (F ((1 <= p6)) AND G ((p9 <= p11)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 9 will run for 1620 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((1 <= p6))
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: (p6 <= 0)
lola: processed formula length: 9
lola: 61 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: 1289 markings, 1288 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 10 will run for 3241 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((p24 <= p6) OR (F (((p9 <= p15) AND (p15 <= p20))) AND (p9 <= p23)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 10 will run for 3241 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (p9 <= p23)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p9 <= p23)
lola: processed formula length: 11
lola: 59 rewrites
lola: closed formula file LTLCardinality.xml
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 12 will run for 1 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (((p9 <= p15) AND (p15 <= p20)))
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: ((p15 + 1 <= p9) OR (p20 + 1 <= p15))
lola: processed formula length: 38
lola: 61 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: 1398 markings, 1437 edges
lola: ========================================
lola: SUBRESULT
lola: result: unknown
lola: The Boolean predicate may be true or false.
lola: ========================================
lola: ========================================
lola: ...considering subproblem: G ((F (((p1 <= p18) OR (p4 <= p24))) OR G (F ((X ((p12 <= p8)) OR (p12 <= p8))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((F (((p1 <= p18) OR (p4 <= p24))) OR G (F ((X ((p12 <= p8)) OR (p12 <= p8))))))
lola: processed formula length: 83
lola: 59 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: 2396618 markings, 4223305 edges, 479324 markings/sec, 0 secs
lola: 4235150 markings, 7654772 edges, 367706 markings/sec, 5 secs
lola: 5937391 markings, 10837841 edges, 340448 markings/sec, 10 secs
lola: 7536699 markings, 13915974 edges, 319862 markings/sec, 15 secs
lola: 9110828 markings, 16932413 edges, 314826 markings/sec, 20 secs
lola: 10638311 markings, 19871995 edges, 305497 markings/sec, 25 secs
lola: 12180417 markings, 22833332 edges, 308421 markings/sec, 30 secs
lola: 13675794 markings, 25718535 edges, 299075 markings/sec, 35 secs
lola: 15120158 markings, 28543312 edges, 288873 markings/sec, 40 secs
lola: 16599710 markings, 31402636 edges, 295910 markings/sec, 45 secs
lola: 18038522 markings, 34236663 edges, 287762 markings/sec, 50 secs
lola: 19422563 markings, 36961532 edges, 276808 markings/sec, 55 secs
lola: 20841321 markings, 39718699 edges, 283752 markings/sec, 60 secs
lola: 22213871 markings, 42429477 edges, 274510 markings/sec, 65 secs
lola: 23572750 markings, 45136656 edges, 271776 markings/sec, 70 secs
lola: 24907138 markings, 47775819 edges, 266878 markings/sec, 75 secs
lola: 26271881 markings, 50456968 edges, 272949 markings/sec, 80 secs
lola: 27586609 markings, 53067590 edges, 262946 markings/sec, 85 secs
lola: 28886101 markings, 55632766 edges, 259898 markings/sec, 90 secs
lola: 30176265 markings, 58198500 edges, 258033 markings/sec, 95 secs
lola: 31469172 markings, 60765539 edges, 258581 markings/sec, 100 secs
lola: 32792859 markings, 63359061 edges, 264737 markings/sec, 105 secs
lola: 34048668 markings, 65871818 edges, 251162 markings/sec, 110 secs
lola: 35298439 markings, 68375925 edges, 249954 markings/sec, 115 secs
lola: 36542194 markings, 70842159 edges, 248751 markings/sec, 120 secs
lola: 37775756 markings, 73294198 edges, 246712 markings/sec, 125 secs
lola: 38986219 markings, 75709043 edges, 242093 markings/sec, 130 secs
lola: 40195106 markings, 78136489 edges, 241777 markings/sec, 135 secs
lola: 41425365 markings, 80588487 edges, 246052 markings/sec, 140 secs
lola: 42618631 markings, 82985513 edges, 238653 markings/sec, 145 secs
lola: 43811491 markings, 85389519 edges, 238572 markings/sec, 150 secs
lola: 45013989 markings, 87801743 edges, 240500 markings/sec, 155 secs
lola: 46212521 markings, 90197260 edges, 239706 markings/sec, 160 secs
lola: 47379529 markings, 92550535 edges, 233402 markings/sec, 165 secs
lola: 48557379 markings, 94904488 edges, 235570 markings/sec, 170 secs
lola: 49719877 markings, 97244413 edges, 232500 markings/sec, 175 secs
lola: 50870222 markings, 99551639 edges, 230069 markings/sec, 180 secs
lola: 52014798 markings, 101864676 edges, 228915 markings/sec, 185 secs
lola: 53159660 markings, 104156875 edges, 228972 markings/sec, 190 secs
lola: 54325310 markings, 106478713 edges, 233130 markings/sec, 195 secs
lola: 55438537 markings, 108750235 edges, 222645 markings/sec, 200 secs
lola: 56565601 markings, 111028405 edges, 225413 markings/sec, 205 secs
lola: 57695330 markings, 113312987 edges, 225946 markings/sec, 210 secs
lola: 58825707 markings, 115588199 edges, 226075 markings/sec, 215 secs
lola: 59942228 markings, 117853088 edges, 223304 markings/sec, 220 secs
lola: 61086505 markings, 120162129 edges, 228855 markings/sec, 225 secs
lola: 62221309 markings, 122431404 edges, 226961 markings/sec, 230 secs
lola: 63320450 markings, 124653634 edges, 219828 markings/sec, 235 secs
lola: 64444881 markings, 126912629 edges, 224886 markings/sec, 240 secs
lola: 65554073 markings, 129157764 edges, 221838 markings/sec, 245 secs
lola: 66638140 markings, 131374162 edges, 216813 markings/sec, 250 secs
lola: 67723060 markings, 133597044 edges, 216984 markings/sec, 255 secs
lola: 68797335 markings, 135786084 edges, 214855 markings/sec, 260 secs
lola: 69881588 markings, 137983344 edges, 216851 markings/sec, 265 secs
lola: 70967974 markings, 140197174 edges, 217277 markings/sec, 270 secs
lola: 72033419 markings, 142365915 edges, 213089 markings/sec, 275 secs
lola: 73108756 markings, 144556876 edges, 215067 markings/sec, 280 secs
lola: 74169537 markings, 146706873 edges, 212156 markings/sec, 285 secs
lola: 75230052 markings, 148872479 edges, 212103 markings/sec, 290 secs
lola: 76300288 markings, 151041012 edges, 214047 markings/sec, 295 secs
lola: 77393084 markings, 153239838 edges, 218559 markings/sec, 300 secs
lola: 78465690 markings, 155414606 edges, 214521 markings/sec, 305 secs
lola: 79535129 markings, 157576880 edges, 213888 markings/sec, 310 secs
lola: 80582319 markings, 159717351 edges, 209438 markings/sec, 315 secs
lola: 81628154 markings, 161852467 edges, 209167 markings/sec, 320 secs
lola: 82681452 markings, 163991192 edges, 210660 markings/sec, 325 secs
lola: 83713007 markings, 166102094 edges, 206311 markings/sec, 330 secs
lola: 84752107 markings, 168220488 edges, 207820 markings/sec, 335 secs
lola: 85777117 markings, 170311386 edges, 205002 markings/sec, 340 secs
lola: 86806989 markings, 172414613 edges, 205974 markings/sec, 345 secs
lola: 87849570 markings, 174558866 edges, 208516 markings/sec, 350 secs
lola: 88873661 markings, 176657588 edges, 204818 markings/sec, 355 secs
lola: 89906557 markings, 178776042 edges, 206579 markings/sec, 360 secs
lola: 90921425 markings, 180850415 edges, 202974 markings/sec, 365 secs
lola: 91921608 markings, 182909340 edges, 200037 markings/sec, 370 secs
lola: 92947595 markings, 184998703 edges, 205197 markings/sec, 375 secs
lola: 93973604 markings, 187093933 edges, 205202 markings/sec, 380 secs
lola: 95011959 markings, 189195358 edges, 207671 markings/sec, 385 secs
lola: 96022876 markings, 191255051 edges, 202183 markings/sec, 390 secs
lola: 97063018 markings, 193365822 edges, 208028 markings/sec, 395 secs
lola: 98069504 markings, 195420981 edges, 201297 markings/sec, 400 secs
lola: 99069871 markings, 197491229 edges, 200073 markings/sec, 405 secs
lola: 100072903 markings, 199551450 edges, 200606 markings/sec, 410 secs
lola: 101095213 markings, 201626799 edges, 204462 markings/sec, 415 secs
lola: 102072687 markings, 203626306 edges, 195495 markings/sec, 420 secs
lola: 102671250 markings, 204853881 edges, 119713 markings/sec, 425 secs
lola: 103294727 markings, 206126151 edges, 124695 markings/sec, 430 secs
lola: 104057655 markings, 207665210 edges, 152586 markings/sec, 435 secs
lola: 104606454 markings, 208780114 edges, 109760 markings/sec, 440 secs
lola: 105329032 markings, 210256778 edges, 144516 markings/sec, 445 secs
lola: 106012720 markings, 211645817 edges, 136738 markings/sec, 450 secs
lola: 106680210 markings, 213006349 edges, 133498 markings/sec, 455 secs
lola: 107314885 markings, 214321631 edges, 126935 markings/sec, 460 secs
lola: 108089474 markings, 215908557 edges, 154918 markings/sec, 465 secs
lola: 108926462 markings, 217620649 edges, 167398 markings/sec, 470 secs
lola: 109593711 markings, 218981923 edges, 133450 markings/sec, 475 secs
lola: 110540558 markings, 220936128 edges, 189369 markings/sec, 480 secs
lola: 111259569 markings, 222430606 edges, 143802 markings/sec, 485 secs
lola: 112050443 markings, 224064491 edges, 158175 markings/sec, 490 secs
lola: 112698432 markings, 225403434 edges, 129598 markings/sec, 495 secs
lola: 113390315 markings, 226829646 edges, 138377 markings/sec, 500 secs
lola: 114046875 markings, 228183416 edges, 131312 markings/sec, 505 secs
lola: 114795032 markings, 229719473 edges, 149631 markings/sec, 510 secs
lola: 115513827 markings, 231205625 edges, 143759 markings/sec, 515 secs
lola: 116120863 markings, 232474979 edges, 121407 markings/sec, 520 secs
lola: 116945687 markings, 234168729 edges, 164965 markings/sec, 525 secs
lola: 117535095 markings, 235380408 edges, 117882 markings/sec, 530 secs
lola: 118120197 markings, 236586316 edges, 117020 markings/sec, 535 secs
lola: 118804751 markings, 237999095 edges, 136911 markings/sec, 540 secs
lola: 119481843 markings, 239398426 edges, 135418 markings/sec, 545 secs
lola: 120322793 markings, 241106513 edges, 168190 markings/sec, 550 secs
lola: 121177580 markings, 242865882 edges, 170957 markings/sec, 555 secs
lola: 121855253 markings, 244254304 edges, 135535 markings/sec, 560 secs
lola: 122508533 markings, 245605352 edges, 130656 markings/sec, 565 secs
lola: 123311803 markings, 247242869 edges, 160654 markings/sec, 570 secs
lola: 123835288 markings, 248314545 edges, 104697 markings/sec, 575 secs
lola: 124564932 markings, 249819848 edges, 145929 markings/sec, 580 secs
lola: 125265237 markings, 251264430 edges, 140061 markings/sec, 585 secs
lola: 125949368 markings, 252671062 edges, 136826 markings/sec, 590 secs
lola: 126624225 markings, 254064140 edges, 134971 markings/sec, 595 secs
lola: 127285228 markings, 255439703 edges, 132201 markings/sec, 600 secs
lola: 127690210 markings, 256271150 edges, 80996 markings/sec, 605 secs
lola: 127849366 markings, 256605971 edges, 31831 markings/sec, 610 secs
lola: Child process aborted or communication problem between parent and child process
lola: ========================================
lola: ...considering subproblem: ((p24 <= p6) OR (F (((p9 <= p15) AND (p15 <= p20))) AND (p9 <= p23)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: ...considering subproblem: (p9 <= p23)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p9 <= p23)
lola: processed formula length: 11
lola: 59 rewrites
lola: closed formula file LTLCardinality.xml
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: ========================================
lola: ...considering subproblem: (p24 <= p6)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p24 <= p6)
lola: processed formula length: 11
lola: 59 rewrites
lola: closed formula file LTLCardinality.xml
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: ========================================
lola: ...considering subproblem: F (((p9 <= p15) AND (p15 <= p20)))
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: ((p15 + 1 <= p9) OR (p20 + 1 <= p15))
lola: processed formula length: 38
lola: 61 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: 1398 markings, 1437 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: RESULT
lola:
SUMMARY: unknown no no no no no no no no no no
lola:
preliminary result: unknown no no no no no no no no no no
lola: memory consumption: 3368 KB
lola: time consumption: 949 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="ClientsAndServers-PT-N0020P4"
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 ClientsAndServers-PT-N0020P4, 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 r168-smll-158987806400201"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/ClientsAndServers-PT-N0020P4.tgz
mv ClientsAndServers-PT-N0020P4 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 '' LTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
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 ;