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

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

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
15794.050 3600000.00 986009.00 57081.50 FT?FFFTFFFFFFTFT 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-158987806400217.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-N0100P0, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r168-smll-158987806400217
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 196K
-rw-r--r-- 1 mcc users 3.7K Mar 30 01:04 CTLCardinality.txt
-rw-r--r-- 1 mcc users 21K Mar 30 01:04 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.9K Mar 28 15:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 21K 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.6K Apr 8 14:45 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K 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 18K Apr 28 14:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.3K Mar 27 08:15 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 16K Mar 27 08:15 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.7K Mar 26 07:40 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 16K 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-N0100P0-00
FORMULA_NAME ClientsAndServers-PT-N0100P0-01
FORMULA_NAME ClientsAndServers-PT-N0100P0-02
FORMULA_NAME ClientsAndServers-PT-N0100P0-03
FORMULA_NAME ClientsAndServers-PT-N0100P0-04
FORMULA_NAME ClientsAndServers-PT-N0100P0-05
FORMULA_NAME ClientsAndServers-PT-N0100P0-06
FORMULA_NAME ClientsAndServers-PT-N0100P0-07
FORMULA_NAME ClientsAndServers-PT-N0100P0-08
FORMULA_NAME ClientsAndServers-PT-N0100P0-09
FORMULA_NAME ClientsAndServers-PT-N0100P0-10
FORMULA_NAME ClientsAndServers-PT-N0100P0-11
FORMULA_NAME ClientsAndServers-PT-N0100P0-12
FORMULA_NAME ClientsAndServers-PT-N0100P0-13
FORMULA_NAME ClientsAndServers-PT-N0100P0-14
FORMULA_NAME ClientsAndServers-PT-N0100P0-15

=== Now, execution of the tool begins

BK_START 1591230118506

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-04 00:22:00] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -timeout, 3600, -rebuildPNML]
[2020-06-04 00:22:00] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-04 00:22:00] [INFO ] Load time of PNML (sax parser for PT used): 35 ms
[2020-06-04 00:22:00] [INFO ] Transformed 25 places.
[2020-06-04 00:22:00] [INFO ] Transformed 18 transitions.
[2020-06-04 00:22:00] [INFO ] Parsed PT model containing 25 places and 18 transitions in 91 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 25 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100085 steps, including 10 resets, run finished after 86 ms. (steps per millisecond=1163 ) properties seen :[1, 0, 0, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 0, 1, 1, 1, 1, 0, 1, 1, 1]
// Phase 1: matrix 18 rows 25 cols
[2020-06-04 00:22:01] [INFO ] Computed 8 place invariants in 4 ms
[2020-06-04 00:22:01] [INFO ] [Real]Absence check using 5 positive place invariants in 17 ms returned sat
[2020-06-04 00:22:01] [INFO ] [Real]Absence check using 5 positive and 3 generalized place invariants in 2 ms returned unsat
[2020-06-04 00:22:01] [INFO ] [Real]Absence check using 5 positive place invariants in 5 ms returned unsat
[2020-06-04 00:22:01] [INFO ] [Real]Absence check using 5 positive place invariants in 9 ms returned sat
[2020-06-04 00:22:01] [INFO ] [Real]Absence check using 5 positive and 3 generalized place invariants in 3 ms returned sat
[2020-06-04 00:22:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 00:22:01] [INFO ] [Real]Absence check using state equation in 30 ms returned sat
[2020-06-04 00:22:01] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 00:22:01] [INFO ] [Nat]Absence check using 5 positive place invariants in 19 ms returned sat
[2020-06-04 00:22:01] [INFO ] [Nat]Absence check using 5 positive and 3 generalized place invariants in 3 ms returned sat
[2020-06-04 00:22:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 00:22:01] [INFO ] [Nat]Absence check using state equation in 30 ms returned sat
[2020-06-04 00:22:01] [INFO ] Computed and/alt/rep : 17/21/17 causal constraints in 6 ms.
[2020-06-04 00:22:01] [INFO ] Added : 4 causal constraints over 1 iterations in 30 ms. Result :sat
[2020-06-04 00:22:01] [INFO ] [Real]Absence check using 5 positive place invariants in 5 ms returned unsat
[2020-06-04 00:22:01] [INFO ] [Real]Absence check using 5 positive place invariants in 6 ms returned unsat
[2020-06-04 00:22:01] [INFO ] [Real]Absence check using 5 positive place invariants in 4 ms returned unsat
[2020-06-04 00:22:01] [INFO ] [Real]Absence check using 5 positive place invariants in 6 ms returned sat
[2020-06-04 00:22:01] [INFO ] [Real]Absence check using 5 positive and 3 generalized place invariants in 3 ms returned sat
[2020-06-04 00:22:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 00:22:01] [INFO ] [Real]Absence check using state equation in 28 ms returned sat
[2020-06-04 00:22:01] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 00:22:01] [INFO ] [Nat]Absence check using 5 positive place invariants in 8 ms returned sat
[2020-06-04 00:22:01] [INFO ] [Nat]Absence check using 5 positive and 3 generalized place invariants in 2 ms returned sat
[2020-06-04 00:22:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 00:22:01] [INFO ] [Nat]Absence check using state equation in 27 ms returned sat
[2020-06-04 00:22:01] [INFO ] Computed and/alt/rep : 17/21/17 causal constraints in 4 ms.
[2020-06-04 00:22:01] [INFO ] Added : 13 causal constraints over 3 iterations in 28 ms. Result :sat
[2020-06-04 00:22:01] [INFO ] [Real]Absence check using 5 positive place invariants in 3 ms returned unsat
Successfully simplified 6 atomic propositions for a total of 9 simplifications.
[2020-06-04 00:22:01] [INFO ] Initial state reduction rules for CTL removed 5 formulas.
[2020-06-04 00:22:01] [INFO ] Flatten gal took : 55 ms
FORMULA ClientsAndServers-PT-N0100P0-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ClientsAndServers-PT-N0100P0-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ClientsAndServers-PT-N0100P0-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ClientsAndServers-PT-N0100P0-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ClientsAndServers-PT-N0100P0-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-06-04 00:22:02] [INFO ] Flatten gal took : 12 ms
[2020-06-04 00:22:02] [INFO ] Export to MCC properties in file /home/mcc/execution/LTLCardinality.sr.xml took 4 ms.
[2020-06-04 00:22:02] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 10 ms.
info: Time: 3600 - MCC
vrfy: Checking LTLCardinality @ ClientsAndServers-PT-N0100P0 @ 3570 seconds

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

FORMULA ClientsAndServers-PT-N0100P0-04 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

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

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

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

FORMULA ClientsAndServers-PT-N0100P0-09 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ClientsAndServers-PT-N0100P0-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

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

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

FORMULA ClientsAndServers-PT-N0100P0-02 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ClientsAndServers-PT-N0100P0-00 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 2530
rslt: Output for LTLCardinality @ ClientsAndServers-PT-N0100P0

{
"build":
{
"architecture": 64,
"assertions": false,
"build_hostname": "mcc2019",
"build_system": "x86_64-unknown-linux-gnu",
"optimizations": true,
"package_version": "2.0",
"svn_version": "3189M"
},
"call":
{
"exec_host": "mcc2020",
"markinglimit": null,
"parameters":
[
"--pnmlnet",
"model.pnml",
"--xmlformula",
"--formula=LTLCardinality.xml",
"--mcc",
"--donotcomputecapacities",
"--encoder=simplecompressed",
"--check=modelchecking",
"--stubborn=deletion",
"--stateequation=par",
"--timelimit=3570",
"--localtimelimit=0",
"--preference=force_ltl",
"--json=LTLCardinality.json",
"--jsoninclude=formula,formulastat,net"
],
"starttime": "Thu Jun 4 00:22:03 2020
",
"timelimit": 3570
},
"child":
[

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 324
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 2,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 2,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 1,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "F (G (((G ((p18 <= 2)) OR F ((p18 <= 2))) AND (p6 + 1 <= p18))))",
"processed_size": 64,
"rewrites": 64
},
"result":
{
"edges": 5003,
"markings": 5002,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 6
},
"compoundnumber": 0,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 356
},
"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 ((3 <= p18))",
"processed_size": 14,
"rewrites": 64
},
"result":
{
"edges": 5001,
"markings": 5001,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"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"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 0,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 356
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 2,
"U": 0,
"X": 2,
"aconj": 0,
"adisj": 0,
"aneg": 2,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 6,
"taut": 0,
"tconj": 1,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "F (G ((X ((p15 + 1 <= p6)) AND (F ((p6 <= p15)) OR X (G ((p15 + 1 <= p6)))))))",
"processed_size": 78,
"rewrites": 64
},
"result":
{
"edges": 5003,
"markings": 5002,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 7
},
"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": 396
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 396
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"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": "G ((p13 <= 0))",
"processed_size": 14,
"rewrites": 64
},
"result":
{
"edges": 4395,
"markings": 4395,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 2,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 2,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 445
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 2,
"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 ((G ((p11 + 1 <= p9)) R (p20 <= p6)))",
"processed_size": 39,
"rewrites": 64
},
"result":
{
"edges": 5033,
"markings": 5025,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 5
},
"compoundnumber": 3,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 509
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 5,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 8,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 7,
"visible_transitions": 0
},
"processed": "((2 <= p22) OR ((p2 <= p12) AND (1 <= p6) AND (p2 <= p3) AND (p1 + 1 <= p21)))",
"processed_size": 78,
"rewrites": 65
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 4,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 594
},
"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 ((2 <= p22)))",
"processed_size": 18,
"rewrites": 64
},
"result":
{
"edges": 5001,
"markings": 5001,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"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"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 4,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 594
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 1,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 2,
"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": 1,
"visible_transitions": 0
},
"processed": "(X ((3 <= p23)) U G ((3 <= p23)))",
"processed_size": 33,
"rewrites": 64
},
"result":
{
"edges": 5001,
"markings": 5001,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 6
},
"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": 713
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 713
},
"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": 66
},
"result":
{
"edges": 3417,
"markings": 3417,
"produced_by": "state space / EG",
"value": false
},
"task":
{
"compoundnumber": 6,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 4
},
"threads": 1,
"type": "dfs"
},
"type": "eventual_occurrence"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 891
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 2,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 3,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 6,
"taut": 0,
"tconj": 1,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "X (((G ((p6 + 1 <= p24)) OR G ((p20 + 1 <= p15))) AND (p24 <= p6)))",
"processed_size": 67,
"rewrites": 64
},
"result":
{
"edges": 5001,
"markings": 5001,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 6
},
"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"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 6,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 891
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 2,
"U": 0,
"X": 2,
"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": "G (F ((X (X (G ((1 <= p11)))) AND (p15 <= p9))))",
"processed_size": 48,
"rewrites": 64
},
"result":
{
"edges": 5001,
"markings": 5001,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 7
},
"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": 1189
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 1,
"aneg": 1,
"comp": 2,
"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": "((p20 <= 2) AND (p5 <= 2))",
"processed_size": 26,
"rewrites": 66
},
"result":
{
"edges": 5216,
"markings": 5017,
"produced_by": "state space / EG",
"value": false
},
"task":
{
"compoundnumber": 8,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 4
},
"threads": 1,
"type": "dfs"
},
"type": "eventual_occurrence"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3041
},
"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": "(3 <= p16)",
"processed_size": 10,
"rewrites": 66
},
"result":
{
"edges": 0,
"markings": 1,
"produced_by": "state space / EG",
"value": true
},
"task":
{
"compoundnumber": 10,
"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": 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": 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": "(3 <= p16)",
"processed_size": 10,
"rewrites": 66
},
"result":
{
"edges": 0,
"markings": 1,
"produced_by": "state space / EG",
"value": true
},
"task":
{
"compoundnumber": 12,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 2
},
"threads": 1,
"type": "dfs"
},
"type": "eventual_occurrence"
}
},

{
"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": "(p16 <= 2)",
"processed_size": 10,
"rewrites": 66
},
"result":
{
"edges": 5000,
"markings": 5001,
"produced_by": "state space / EG",
"value": false
},
"task":
{
"compoundnumber": 13,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 2
},
"threads": 1,
"type": "dfs"
},
"type": "eventual_occurrence"
}
}
],
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 12,
"type": "boolean"
}
}
],
"exit":
{
"error": null,
"memory": 3616,
"runtime": 1040.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "LTLCardinality.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "(F(**) AND F(**)) : F(G(((G(*) R *) OR G(*)))) : (F(G(((G(*) OR F(*)) AND **))) OR X(**)) : F(G((X(*) AND (F(**) OR X(G(*)))))) : (X(G(**)) AND G(*)) : X((G(*) R *)) : (X(F(**)) OR (** OR **)) : (X(**) U G(**)) : F(**) : (X(((G(*) OR G(*)) AND *)) OR F(*)) : G(F((X(X(G(**))) AND **)))"
},
"net":
{
"arcs": 54,
"conflict_clusters": 16,
"places": 25,
"places_significant": 17,
"singleton_clusters": 0,
"transitions": 18
},
"result":
{
"preliminary_value": "no unknown no no no no no no no no no ",
"value": "no unknown 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: (F ((3 <= p16)) AND F ((NOT((((1 <= 0) U (3 <= p16)) U (0 <= 0))) OR (p16 <= 2)))) : G (F (NOT(F (((F ((3 <= p3)) U (p21 <= 1)) AND ((p4 + 1 <= p3) U F ((p3 <= p4)))))))) : (F (G (((NOT(F ((3 <= p18))) OR NOT(G ((3 <= p18)))) AND (p6 + 1 <= p18)))) OR X ((3 <= p18))) : NOT(G (((0 <= 0) U X (X ((NOT(F ((p6 <= p15))) U X ((p6 <= p15)))))))) : (X (G (((2 <= p10) AND (p13 <= p22)))) AND NOT(F ((1 <= p13)))) : X (NOT((F ((p9 <= p11)) U (p6 + 1 <= p20)))) : ((F (X (F ((2 <= p22)))) OR (2 <= p22)) OR ((p2 <= p12) AND (1 <= p6) AND (p2 <= p3) AND (p1 + 1 <= p21))) : (X ((3 <= p23)) U G ((3 <= p23))) : F (((3 <= p20) OR (3 <= p5))) : (NOT(X (((F ((p24 <= p6)) AND F ((p15 <= p20))) OR (p6 + 1 <= p24)))) OR NOT(G ((p9 <= p23)))) : G (F ((G (X (X ((1 <= p11)))) AND (p15 <= p9))))
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:185
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:166
lola: rewrite Frontend/Parser/formula_rewrite.k:279
lola: rewrite Frontend/Parser/formula_rewrite.k:122
lola: rewrite Frontend/Parser/formula_rewrite.k:422
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:338
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:374
lola: rewrite Frontend/Parser/formula_rewrite.k:332
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:100
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:169
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:329
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:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:338
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (F (G (((G ((p18 <= 2)) OR F ((p18 <= 2))) AND (p6 + 1 <= p18)))) OR X ((3 <= p18)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 0 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G (((G ((p18 <= 2)) OR F ((p18 <= 2))) AND (p6 + 1 <= p18))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F (G (((G ((p18 <= 2)) OR F ((p18 <= 2))) AND (p6 + 1 <= p18))))
lola: processed formula length: 64
lola: 64 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 6 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: 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: 5002 markings, 5003 edges
lola: ========================================
lola: subprocess 1 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((3 <= p18))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((3 <= p18))
lola: processed formula length: 14
lola: 64 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: 5001 markings, 5001 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 1 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G ((X ((p15 + 1 <= p6)) AND (F ((p6 <= p15)) OR X (G ((p15 + 1 <= p6)))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F (G ((X ((p15 + 1 <= p6)) AND (F ((p6 <= p15)) OR X (G ((p15 + 1 <= p6)))))))
lola: processed formula length: 78
lola: 64 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: 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: 5002 markings, 5003 edges
lola: ========================================
lola: subprocess 2 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (X (G (((2 <= p10) AND (p13 <= p22)))) AND G ((p13 <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 2 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G ((p13 <= 0))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((p13 <= 0))
lola: processed formula length: 14
lola: 64 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: 4395 markings, 4395 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 3 will run for 445 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((G ((p11 + 1 <= p9)) R (p20 <= p6)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((G ((p11 + 1 <= p9)) R (p20 <= p6)))
lola: processed formula length: 39
lola: 64 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: 5025 markings, 5033 edges
lola: ========================================
lola: subprocess 4 will run for 509 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (X (F ((2 <= p22))) OR ((2 <= p22) OR ((p2 <= p12) AND (1 <= p6) AND (p2 <= p3) AND (p1 + 1 <= p21))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 4 will run for 509 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((2 <= p22) OR ((p2 <= p12) AND (1 <= p6) AND (p2 <= p3) AND (p1 + 1 <= p21)))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: rewrite Frontend/Parser/formula_rewrite.k:797
lola: processed formula: ((2 <= p22) OR ((p2 <= p12) AND (1 <= p6) AND (p2 <= p3) AND (p1 + 1 <= p21)))
lola: processed formula length: 78
lola: 65 rewrites
lola: closed formula file LTLCardinality.xml
lola: processed formula with 5 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 5 will run for 594 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (F ((2 <= p22)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (F ((2 <= p22)))
lola: processed formula length: 18
lola: 64 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 5 will run for 594 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (X ((3 <= p23)) U G ((3 <= p23)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: (X ((3 <= p23)) U G ((3 <= p23)))
lola: processed formula length: 33
lola: 64 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: 5001 markings, 5001 edges
lola: ========================================
lola: subprocess 6 will run for 713 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (X (((G ((p6 + 1 <= p24)) OR G ((p20 + 1 <= p15))) AND (p24 <= p6))) OR F ((p23 + 1 <= p9)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 6 will run for 713 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((p23 + 1 <= p9))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:750
lola: rewrite Frontend/Parser/formula_rewrite.k:788
lola: processed formula: (p9 <= p23)
lola: processed formula length: 11
lola: 66 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: 3417 markings, 3417 edges
lola: ========================================
lola: subprocess 7 will run for 891 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (((G ((p6 + 1 <= p24)) OR G ((p20 + 1 <= p15))) AND (p24 <= p6)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (((G ((p6 + 1 <= p24)) OR G ((p20 + 1 <= p15))) AND (p24 <= p6)))
lola: processed formula length: 67
lola: 64 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: 5001 markings, 5001 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 7 will run for 891 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (F ((X (X (G ((1 <= p11)))) AND (p15 <= p9))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (F ((X (X (G ((1 <= p11)))) AND (p15 <= p9))))
lola: processed formula length: 48
lola: 64 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: 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 8 will run for 1189 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (((3 <= p20) OR (3 <= p5)))
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: ((p20 <= 2) AND (p5 <= 2))
lola: processed formula length: 26
lola: 66 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: 5017 markings, 5216 edges
lola: ========================================
lola: subprocess 9 will run for 1783 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G (((G ((p3 <= 2)) R (2 <= p21)) OR G ((p4 + 1 <= p3)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F (G (((G ((p3 <= 2)) R (2 <= p21)) OR G ((p4 + 1 <= p3)))))
lola: processed formula length: 60
lola: 64 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 22 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: 1925509 markings, 4352051 edges, 385102 markings/sec, 0 secs
lola: 3739279 markings, 8745369 edges, 362754 markings/sec, 5 secs
lola: 5502536 markings, 13051342 edges, 352651 markings/sec, 10 secs
lola: 7126199 markings, 17059927 edges, 324733 markings/sec, 15 secs
lola: 8661686 markings, 20876072 edges, 307097 markings/sec, 20 secs
lola: 10172298 markings, 24658639 edges, 302122 markings/sec, 25 secs
lola: 11660426 markings, 28381641 edges, 297626 markings/sec, 30 secs
lola: 13185376 markings, 32223561 edges, 304990 markings/sec, 35 secs
lola: 14670258 markings, 35984927 edges, 296976 markings/sec, 40 secs
lola: 16154867 markings, 39744997 edges, 296922 markings/sec, 45 secs
lola: 17627759 markings, 43485543 edges, 294578 markings/sec, 50 secs
lola: 19096377 markings, 47240328 edges, 293724 markings/sec, 55 secs
lola: 20552966 markings, 50940177 edges, 291318 markings/sec, 60 secs
lola: 22009812 markings, 54672717 edges, 291369 markings/sec, 65 secs
lola: 23464741 markings, 58395575 edges, 290986 markings/sec, 70 secs
lola: 24899421 markings, 62093163 edges, 286936 markings/sec, 75 secs
lola: 26307238 markings, 65705812 edges, 281563 markings/sec, 80 secs
lola: 27728903 markings, 69377032 edges, 284333 markings/sec, 85 secs
lola: 29159794 markings, 73067853 edges, 286178 markings/sec, 90 secs
lola: 30610068 markings, 76783489 edges, 290055 markings/sec, 95 secs
lola: 32000020 markings, 80391976 edges, 277990 markings/sec, 100 secs
lola: 33420636 markings, 84071742 edges, 284123 markings/sec, 105 secs
lola: 34853879 markings, 87788221 edges, 286649 markings/sec, 110 secs
lola: 36296452 markings, 91512893 edges, 288515 markings/sec, 115 secs
lola: 37742567 markings, 95272267 edges, 289223 markings/sec, 120 secs
lola: 39199392 markings, 99094380 edges, 291365 markings/sec, 125 secs
lola: 40626219 markings, 102889403 edges, 285365 markings/sec, 130 secs
lola: 42044106 markings, 106743880 edges, 283577 markings/sec, 135 secs
lola: 43463718 markings, 110669637 edges, 283922 markings/sec, 140 secs
lola: 44880648 markings, 114656388 edges, 283386 markings/sec, 145 secs
lola: 46171873 markings, 118292613 edges, 258245 markings/sec, 150 secs
lola: 47526901 markings, 122230713 edges, 271006 markings/sec, 155 secs
lola: 48881328 markings, 126168341 edges, 270885 markings/sec, 160 secs
lola: 50224870 markings, 130097891 edges, 268708 markings/sec, 165 secs
lola: 51533679 markings, 134004114 edges, 261762 markings/sec, 170 secs
lola: 52829811 markings, 137921866 edges, 259226 markings/sec, 175 secs
lola: 54111909 markings, 141772929 edges, 256420 markings/sec, 180 secs
lola: 55389607 markings, 145626023 edges, 255540 markings/sec, 185 secs
lola: 56606310 markings, 149337522 edges, 243341 markings/sec, 190 secs
lola: 57863707 markings, 153152942 edges, 251479 markings/sec, 195 secs
lola: 59061454 markings, 156839433 edges, 239549 markings/sec, 200 secs
lola: 60288446 markings, 160655741 edges, 245398 markings/sec, 205 secs
lola: 61465219 markings, 164330727 edges, 235355 markings/sec, 210 secs
lola: 62678435 markings, 168098179 edges, 242643 markings/sec, 215 secs
lola: 63884609 markings, 171851096 edges, 241235 markings/sec, 220 secs
lola: 65079907 markings, 175622834 edges, 239060 markings/sec, 225 secs
lola: 66262168 markings, 179361153 edges, 236452 markings/sec, 230 secs
lola: 67445067 markings, 183105933 edges, 236580 markings/sec, 235 secs
lola: 68613707 markings, 186840757 edges, 233728 markings/sec, 240 secs
lola: 69793695 markings, 190550031 edges, 235998 markings/sec, 245 secs
lola: 70977413 markings, 194261926 edges, 236744 markings/sec, 250 secs
lola: 72134119 markings, 197963031 edges, 231341 markings/sec, 255 secs
lola: 73283794 markings, 201667269 edges, 229935 markings/sec, 260 secs
lola: 74420799 markings, 205363178 edges, 227401 markings/sec, 265 secs
lola: 75567203 markings, 209021350 edges, 229281 markings/sec, 270 secs
lola: 76719137 markings, 212689593 edges, 230387 markings/sec, 275 secs
lola: 77852966 markings, 216367357 edges, 226766 markings/sec, 280 secs
lola: 78986835 markings, 220042349 edges, 226774 markings/sec, 285 secs
lola: 80126141 markings, 223690218 edges, 227861 markings/sec, 290 secs
lola: 81263317 markings, 227355291 edges, 227435 markings/sec, 295 secs
lola: 82383268 markings, 231007301 edges, 223990 markings/sec, 300 secs
lola: 83509158 markings, 234651918 edges, 225178 markings/sec, 305 secs
lola: 84617367 markings, 238267777 edges, 221642 markings/sec, 310 secs
lola: 85729740 markings, 241862755 edges, 222475 markings/sec, 315 secs
lola: 86824732 markings, 245471590 edges, 218998 markings/sec, 320 secs
lola: 87927733 markings, 249045098 edges, 220600 markings/sec, 325 secs
lola: 89030029 markings, 252610136 edges, 220459 markings/sec, 330 secs
lola: 90123290 markings, 256193337 edges, 218652 markings/sec, 335 secs
lola: 91216831 markings, 259748814 edges, 218708 markings/sec, 340 secs
lola: 92007987 markings, 262359702 edges, 158231 markings/sec, 345 secs
lola: 92719924 markings, 264706637 edges, 142387 markings/sec, 350 secs
lola: 93421231 markings, 267017689 edges, 140261 markings/sec, 355 secs
lola: 94371269 markings, 270129377 edges, 190008 markings/sec, 360 secs
lola: 95096750 markings, 272520740 edges, 145096 markings/sec, 365 secs
lola: 95803192 markings, 274845435 edges, 141288 markings/sec, 370 secs
lola: 96450468 markings, 277012151 edges, 129455 markings/sec, 375 secs
lola: 97424875 markings, 280207915 edges, 194881 markings/sec, 380 secs
lola: 98086877 markings, 282430440 edges, 132400 markings/sec, 385 secs
lola: 98841112 markings, 284907910 edges, 150847 markings/sec, 390 secs
lola: 99589998 markings, 287363149 edges, 149777 markings/sec, 395 secs
lola: 100592854 markings, 290655626 edges, 200571 markings/sec, 400 secs
lola: 101186668 markings, 292592867 edges, 118763 markings/sec, 405 secs
lola: 101992550 markings, 295278198 edges, 161176 markings/sec, 410 secs
lola: 102700061 markings, 297618423 edges, 141502 markings/sec, 415 secs
lola: 103471402 markings, 300135173 edges, 154268 markings/sec, 420 secs
lola: 103873370 markings, 301453035 edges, 80394 markings/sec, 425 secs
lola: 104662261 markings, 303990029 edges, 157778 markings/sec, 430 secs
lola: 105449373 markings, 306618489 edges, 157422 markings/sec, 435 secs
lola: 106040242 markings, 308544523 edges, 118174 markings/sec, 440 secs
lola: 106689779 markings, 310643288 edges, 129907 markings/sec, 445 secs
lola: 107355898 markings, 312866742 edges, 133224 markings/sec, 450 secs
lola: 108143595 markings, 315467879 edges, 157539 markings/sec, 455 secs
lola: 108933872 markings, 318080988 edges, 158055 markings/sec, 460 secs
lola: 109653330 markings, 320428080 edges, 143892 markings/sec, 465 secs
lola: 110408867 markings, 322957775 edges, 151107 markings/sec, 470 secs
lola: 111148032 markings, 325394051 edges, 147833 markings/sec, 475 secs
lola: 111795501 markings, 327585247 edges, 129494 markings/sec, 480 secs
lola: 112322010 markings, 329336432 edges, 105302 markings/sec, 485 secs
lola: 113097237 markings, 331889329 edges, 155045 markings/sec, 490 secs
lola: 113920244 markings, 334617194 edges, 164601 markings/sec, 495 secs
lola: 114477890 markings, 336469323 edges, 111529 markings/sec, 500 secs
lola: 114760822 markings, 337386859 edges, 56586 markings/sec, 505 secs
lola: 114765864 markings, 337403761 edges, 1008 markings/sec, 510 secs
lola: 114765909 markings, 337403957 edges, 9 markings/sec, 515 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 10 will run for 3041 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (F ((3 <= p16)) AND F ((p16 <= 2)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 10 will run for 3041 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((p16 <= 2))
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: (3 <= p16)
lola: processed formula length: 10
lola: 66 rewrites
lola: closed formula file LTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: state space / EG
lola: The predicate eventually occurs.
lola: 1 markings, 0 edges
lola: ========================================
lola: Child process aborted or communication problem between parent and child process
lola: SUBRESULT
lola: result: unknown
lola: The Boolean predicate may be true or false.
lola: ========================================
lola: ========================================
lola: ...considering subproblem: F (G (((G ((p3 <= 2)) R (2 <= p21)) OR G ((p4 + 1 <= p3)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F (G (((G ((p3 <= 2)) R (2 <= p21)) OR G ((p4 + 1 <= p3)))))
lola: processed formula length: 60
lola: 64 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 22 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: 1860173 markings, 4194173 edges, 372035 markings/sec, 0 secs
lola: 3661822 markings, 8556348 edges, 360330 markings/sec, 5 secs
lola: 5330272 markings, 12628495 edges, 333690 markings/sec, 10 secs
lola: 6861968 markings, 16400059 edges, 306339 markings/sec, 15 secs
lola: 8447518 markings, 20341939 edges, 317110 markings/sec, 20 secs
lola: 10000131 markings, 24224221 edges, 310523 markings/sec, 25 secs
lola: 11543736 markings, 28096019 edges, 308721 markings/sec, 30 secs
lola: 13070990 markings, 31930832 edges, 305451 markings/sec, 35 secs
lola: 14575118 markings, 35738849 edges, 300826 markings/sec, 40 secs
lola: 16066396 markings, 39520348 edges, 298256 markings/sec, 45 secs
lola: 17548158 markings, 43278679 edges, 296352 markings/sec, 50 secs
lola: 19018610 markings, 47044530 edges, 294090 markings/sec, 55 secs
lola: 20490948 markings, 50784413 edges, 294468 markings/sec, 60 secs
lola: 21951850 markings, 54524453 edges, 292180 markings/sec, 65 secs
lola: 23407993 markings, 58255343 edges, 291229 markings/sec, 70 secs
lola: 24847218 markings, 61956428 edges, 287845 markings/sec, 75 secs
lola: 26295502 markings, 65673318 edges, 289657 markings/sec, 80 secs
lola: 27736566 markings, 69397130 edges, 288213 markings/sec, 85 secs
lola: 29181188 markings, 73122134 edges, 288924 markings/sec, 90 secs
lola: 30581527 markings, 76710916 edges, 280068 markings/sec, 95 secs
lola: 32016138 markings, 80431050 edges, 286922 markings/sec, 100 secs
lola: 33448780 markings, 84146865 edges, 286528 markings/sec, 105 secs
lola: 34887679 markings, 87874970 edges, 287780 markings/sec, 110 secs
lola: 36322774 markings, 91578194 edges, 287019 markings/sec, 115 secs
lola: 37744466 markings, 95277970 edges, 284338 markings/sec, 120 secs
lola: 39166334 markings, 99006760 edges, 284374 markings/sec, 125 secs
lola: 40608400 markings, 102841894 edges, 288413 markings/sec, 130 secs
lola: 42035916 markings, 106723179 edges, 285503 markings/sec, 135 secs
lola: 43450731 markings, 110634212 edges, 282963 markings/sec, 140 secs
lola: 44834650 markings, 114523231 edges, 276784 markings/sec, 145 secs
lola: 46201663 markings, 118376468 edges, 273403 markings/sec, 150 secs
lola: 47492926 markings, 122128840 edges, 258253 markings/sec, 155 secs
lola: 48816826 markings, 125977301 edges, 264780 markings/sec, 160 secs
lola: 50123807 markings, 129798298 edges, 261396 markings/sec, 165 secs
lola: 51408109 markings, 133623479 edges, 256860 markings/sec, 170 secs
lola: 52673059 markings, 137458066 edges, 252990 markings/sec, 175 secs
lola: 53935870 markings, 141238303 edges, 252562 markings/sec, 180 secs
lola: 55195246 markings, 145033604 edges, 251875 markings/sec, 185 secs
lola: 56435181 markings, 148811446 edges, 247987 markings/sec, 190 secs
lola: 57674599 markings, 152558875 edges, 247884 markings/sec, 195 secs
lola: 58892374 markings, 156312069 edges, 243555 markings/sec, 200 secs
lola: 60101474 markings, 160077605 edges, 241820 markings/sec, 205 secs
lola: 61263772 markings, 163709561 edges, 232460 markings/sec, 210 secs
lola: 62463001 markings, 167439489 edges, 239846 markings/sec, 215 secs
lola: 63661625 markings, 171170003 edges, 239725 markings/sec, 220 secs
lola: 64864735 markings, 174936607 edges, 240622 markings/sec, 225 secs
lola: 66102128 markings, 178859585 edges, 247479 markings/sec, 230 secs
lola: 67350864 markings, 182819202 edges, 249747 markings/sec, 235 secs
lola: 68601328 markings, 186798463 edges, 250093 markings/sec, 240 secs
lola: 69870734 markings, 190793569 edges, 253881 markings/sec, 245 secs
lola: 71133883 markings, 194767567 edges, 252630 markings/sec, 250 secs
lola: 72354530 markings, 198686361 edges, 244129 markings/sec, 255 secs
lola: 73507212 markings, 202410051 edges, 230536 markings/sec, 260 secs
lola: 74633599 markings, 206052733 edges, 225277 markings/sec, 265 secs
lola: 75774185 markings, 209681899 edges, 228117 markings/sec, 270 secs
lola: 76915260 markings, 213305610 edges, 228215 markings/sec, 275 secs
lola: 78096701 markings, 217138344 edges, 236288 markings/sec, 280 secs
lola: 79307741 markings, 221078269 edges, 242208 markings/sec, 285 secs
lola: 80527442 markings, 225000896 edges, 243940 markings/sec, 290 secs
lola: 81740057 markings, 228933168 edges, 242523 markings/sec, 295 secs
lola: 82948104 markings, 232853035 edges, 241609 markings/sec, 300 secs
lola: 84149324 markings, 236759124 edges, 240244 markings/sec, 305 secs
lola: 85360079 markings, 240675547 edges, 242151 markings/sec, 310 secs
lola: 86553803 markings, 244575210 edges, 238745 markings/sec, 315 secs
lola: 87747379 markings, 248445912 edges, 238715 markings/sec, 320 secs
lola: 88938314 markings, 252301675 edges, 238187 markings/sec, 325 secs
lola: 90119905 markings, 256180343 edges, 236318 markings/sec, 330 secs
lola: 91258269 markings, 259888386 edges, 227673 markings/sec, 335 secs
lola: 92183809 markings, 262944665 edges, 185108 markings/sec, 340 secs
lola: 92904008 markings, 265319739 edges, 144040 markings/sec, 345 secs
lola: 93627125 markings, 267664745 edges, 144623 markings/sec, 350 secs
lola: 94239236 markings, 269680035 edges, 122422 markings/sec, 355 secs
lola: 94997752 markings, 272193132 edges, 151703 markings/sec, 360 secs
lola: 95759444 markings, 274696316 edges, 152338 markings/sec, 365 secs
lola: 96412121 markings, 276880457 edges, 130535 markings/sec, 370 secs
lola: 97135349 markings, 279253058 edges, 144646 markings/sec, 375 secs
lola: 97772497 markings, 281363561 edges, 127430 markings/sec, 380 secs
lola: 98487768 markings, 283775664 edges, 143054 markings/sec, 385 secs
lola: 99205103 markings, 286096152 edges, 143467 markings/sec, 390 secs
lola: 99830990 markings, 288155022 edges, 125177 markings/sec, 395 secs
lola: 100538895 markings, 290469447 edges, 141581 markings/sec, 400 secs
lola: 101323784 markings, 293054745 edges, 156978 markings/sec, 405 secs
lola: 102147399 markings, 295806814 edges, 164723 markings/sec, 410 secs
lola: 102892803 markings, 298248561 edges, 149081 markings/sec, 415 secs
lola: 103785975 markings, 301168535 edges, 178634 markings/sec, 420 secs
lola: 104400461 markings, 303141954 edges, 122897 markings/sec, 425 secs
lola: 105275087 markings, 306041331 edges, 174925 markings/sec, 430 secs
lola: 105922366 markings, 308174677 edges, 129456 markings/sec, 435 secs
lola: 106689779 markings, 310643288 edges, 153483 markings/sec, 440 secs
lola: 107459995 markings, 313204938 edges, 154043 markings/sec, 445 secs
lola: 108077829 markings, 315255184 edges, 123567 markings/sec, 450 secs
lola: 108923841 markings, 318056508 edges, 169202 markings/sec, 455 secs
lola: 109715749 markings, 320637946 edges, 158382 markings/sec, 460 secs
lola: 110477634 markings, 323194454 edges, 152377 markings/sec, 465 secs
lola: 110997113 markings, 324889818 edges, 103896 markings/sec, 470 secs
lola: 111931066 markings, 328046066 edges, 186791 markings/sec, 475 secs
lola: 112437557 markings, 329724994 edges, 101298 markings/sec, 480 secs
lola: 113081778 markings, 331835119 edges, 128844 markings/sec, 485 secs
lola: 113735828 markings, 333998646 edges, 130810 markings/sec, 490 secs
lola: 114478842 markings, 336471422 edges, 148603 markings/sec, 495 secs
lola: 114672933 markings, 337102192 edges, 38818 markings/sec, 500 secs
lola: Child process aborted or communication problem between parent and child process
lola: ========================================
lola: ...considering subproblem: (F ((3 <= p16)) AND F ((p16 <= 2)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: ...considering subproblem: F ((p16 <= 2))
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: (3 <= p16)
lola: processed formula length: 10
lola: 66 rewrites
lola: closed formula file LTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: state space / EG
lola: The predicate eventually occurs.
lola: 1 markings, 0 edges
lola: ========================================
lola: ========================================
lola: ...considering subproblem: F ((3 <= p16))
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: (p16 <= 2)
lola: processed formula length: 10
lola: 66 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: 5001 markings, 5000 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: RESULT
lola:
SUMMARY: no unknown no no no no no no no no no
lola:
preliminary result: no unknown no no no no no no no no no
lola: memory consumption: 3616 KB
lola: time consumption: 1040 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-N0100P0"
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-N0100P0, 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-158987806400217"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/ClientsAndServers-PT-N0100P0.tgz
mv ClientsAndServers-PT-N0100P0 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 ;