fond

jQuery Multi Level CSS Menu Css3Menu.com

Model Checking Contest 2020
10th edition, Paris, France, June 23, 2020
Execution of r180-ebro-158987899900203
Last Updated
Jun 28, 2020

About the Execution of ITS-LoLa for DES-PT-01b

Execution Summary
Max Memory
Used (MB)		 Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
15742.040 3600000.00 550210.00 878.40 T?F?TF?FTFTFFTTF normal

Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2020-input.r180-ebro-158987899900203.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2020-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
.....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itslola
Input is DES-PT-01b, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r180-ebro-158987899900203
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 256K
-rw-r--r-- 1 mcc users 3.5K Mar 30 01:51 CTLCardinality.txt
-rw-r--r-- 1 mcc users 21K Mar 30 01:51 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Mar 28 16:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 28 16:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 24 05:37 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.1K Mar 24 05:37 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.3K Apr 8 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Apr 28 14:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K Apr 8 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 28 14:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 27 08:48 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 22K Mar 27 08:48 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Mar 26 08:15 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 13K Mar 26 08:15 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K Mar 28 14:49 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.5K 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 4 Mar 24 05:37 instance
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 iscolored
-rw-r--r-- 1 mcc users 68K 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 DES-PT-01b-CTLCardinality-00
FORMULA_NAME DES-PT-01b-CTLCardinality-01
FORMULA_NAME DES-PT-01b-CTLCardinality-02
FORMULA_NAME DES-PT-01b-CTLCardinality-03
FORMULA_NAME DES-PT-01b-CTLCardinality-04
FORMULA_NAME DES-PT-01b-CTLCardinality-05
FORMULA_NAME DES-PT-01b-CTLCardinality-06
FORMULA_NAME DES-PT-01b-CTLCardinality-07
FORMULA_NAME DES-PT-01b-CTLCardinality-08
FORMULA_NAME DES-PT-01b-CTLCardinality-09
FORMULA_NAME DES-PT-01b-CTLCardinality-10
FORMULA_NAME DES-PT-01b-CTLCardinality-11
FORMULA_NAME DES-PT-01b-CTLCardinality-12
FORMULA_NAME DES-PT-01b-CTLCardinality-13
FORMULA_NAME DES-PT-01b-CTLCardinality-14
FORMULA_NAME DES-PT-01b-CTLCardinality-15

=== Now, execution of the tool begins

BK_START 1591169632092

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-03 07:33:55] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -timeout, 3600, -rebuildPNML]
[2020-06-03 07:33:55] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-03 07:33:55] [INFO ] Load time of PNML (sax parser for PT used): 128 ms
[2020-06-03 07:33:55] [INFO ] Transformed 284 places.
[2020-06-03 07:33:55] [INFO ] Transformed 235 transitions.
[2020-06-03 07:33:55] [INFO ] Found NUPN structural information;
[2020-06-03 07:33:55] [INFO ] Parsed PT model containing 284 places and 235 transitions in 214 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 58 ms.
Incomplete random walk after 100000 steps, including 977 resets, run finished after 390 ms. (steps per millisecond=256 ) properties seen :[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1]
// Phase 1: matrix 235 rows 284 cols
[2020-06-03 07:33:56] [INFO ] Computed 65 place invariants in 31 ms
[2020-06-03 07:33:56] [INFO ] [Real]Absence check using 40 positive place invariants in 80 ms returned sat
[2020-06-03 07:33:56] [INFO ] [Real]Absence check using 40 positive and 25 generalized place invariants in 26 ms returned sat
[2020-06-03 07:33:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 07:33:56] [INFO ] [Real]Absence check using state equation in 417 ms returned sat
[2020-06-03 07:33:57] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 07:33:57] [INFO ] [Nat]Absence check using 40 positive place invariants in 80 ms returned sat
[2020-06-03 07:33:57] [INFO ] [Nat]Absence check using 40 positive and 25 generalized place invariants in 3 ms returned unsat
Successfully simplified 1 atomic propositions for a total of 1 simplifications.
[2020-06-03 07:33:57] [INFO ] Initial state reduction rules for CTL removed 3 formulas.
[2020-06-03 07:33:57] [INFO ] Flatten gal took : 128 ms
[2020-06-03 07:33:57] [INFO ] Initial state reduction rules for CTL removed 3 formulas.
[2020-06-03 07:33:57] [INFO ] Flatten gal took : 42 ms
FORMULA DES-PT-01b-CTLCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-01b-CTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-01b-CTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-06-03 07:33:57] [INFO ] Export to MCC properties in file /home/mcc/execution/CTLCardinality.sr.xml took 11 ms.
[2020-06-03 07:33:57] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 10 ms.
info: Time: 3600 - MCC
vrfy: Checking CTLCardinality @ DES-PT-01b @ 3570 seconds

FORMULA DES-PT-01b-CTLCardinality-07 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DES-PT-01b-CTLCardinality-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DES-PT-01b-CTLCardinality-00 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DES-PT-01b-CTLCardinality-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DES-PT-01b-CTLCardinality-05 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DES-PT-01b-CTLCardinality-02 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DES-PT-01b-CTLCardinality-08 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DES-PT-01b-CTLCardinality-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DES-PT-01b-CTLCardinality-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DES-PT-01b-CTLCardinality-04 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 0
rslt: Output for CTLCardinality @ DES-PT-01b

{
"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=CTLCardinality.xml",
"--mcc",
"--donotcomputecapacities",
"--encoder=simplecompressed",
"--safe",
"--check=modelchecking",
"--stubborn=tarjan",
"--stateequation=par",
"--quickchecks",
"--timelimit=3570",
"--localtimelimit=0",
"--preference=force_ctl",
"--json=CTLCardinality.json",
"--jsoninclude=formula,formulastat,net"
],
"starttime": "Wed Jun 3 07:33:58 2020
",
"timelimit": 3570
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 274
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 5,
"adisj": 2,
"aneg": 0,
"comp": 4,
"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": "((((p177 <= 0)) OR ((1 <= p135))) AND (((1 <= p29)) OR ((1 <= p141))))",
"processed_size": 72,
"rewrites": 31
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 0,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 297
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 0,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 0,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 0,
"visible_transitions": 0
},
"processed": "FALSE",
"processed_size": 5,
"rewrites": 31
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 1,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 324
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 2,
"adisj": 1,
"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": 2,
"visible_transitions": 0
},
"processed": "E (G ((((p82 <= 0)) OR ((1 <= p71)))))",
"processed_size": 39,
"rewrites": 32
},
"result":
{
"edges": 89,
"markings": 90,
"produced_by": "state space / EG",
"value": true
},
"task":
{
"compoundnumber": 2,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 3
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 2,
"problems": 2
},
"type": "possible_preservation",
"workflow": "stateequation"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": true
},
"task":
{
"compoundnumber": 2,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 356
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 2,
"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": "(((1 <= p199)) AND ((p140 <= 0)))",
"processed_size": 33,
"rewrites": 33
},
"result":
{
"edges": 28210,
"markings": 13462,
"produced_by": "state space /EXEF",
"value": true
},
"task":
{
"compoundnumber": 3,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 2,
"problems": 2
},
"type": "reachability_from_a_successor",
"workflow": "stateequation"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 396
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 2,
"adisj": 1,
"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": 2,
"visible_transitions": 0
},
"processed": "A (G ((((p199 <= 0)) OR ((1 <= p113)))))",
"processed_size": 41,
"rewrites": 33
},
"result":
{
"produced_by": "state equation",
"value": false
},
"task":
{
"compoundnumber": 4,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 2,
"problems": 2
},
"type": "invariance",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 445
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 3,
"adisj": 3,
"aneg": 0,
"comp": 4,
"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": "(((p23 <= 0)) OR ((1 <= p173)) OR (((1 <= p109)) AND ((p5 <= 0))))",
"processed_size": 68,
"rewrites": 31
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 5,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 509
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 2,
"adisj": 1,
"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": 2,
"visible_transitions": 0
},
"processed": "E (G ((((p153 <= 0)) OR ((1 <= p61)))))",
"processed_size": 40,
"rewrites": 32
},
"result":
{
"edges": 111,
"markings": 112,
"produced_by": "state space / EG",
"value": true
},
"task":
{
"compoundnumber": 6,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 5
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 2,
"problems": 2
},
"type": "possible_preservation",
"workflow": "stateequation"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 593
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 1,
"aconj": 2,
"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": "AX((((1 <= p251)) AND ((p261 <= 0))))",
"processed_size": 37,
"rewrites": 32
},
"net":
{
"conflict_clusters": 192,
"singleton_clusters": 0
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "CTL model checker",
"value": false
},
"task":
{
"compoundnumber": 7,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 4,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 445
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"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": "((p229 <= 0))",
"processed_size": 13,
"rewrites": 34
},
"result":
{
"edges": 89,
"markings": 90,
"produced_by": "state space / EG",
"value": false
},
"task":
{
"compoundnumber": 5,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 2
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "eventual_occurrence",
"workflow": "stateequation"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 509
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 2,
"adisj": 1,
"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": 2,
"visible_transitions": 0
},
"processed": "(((p40 <= 0)) OR ((1 <= p200)))",
"processed_size": 32,
"rewrites": 34
},
"result":
{
"edges": 89,
"markings": 90,
"produced_by": "state space /EFEG",
"value": true
},
"task":
{
"compoundnumber": 7,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 2
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 2,
"problems": 2
},
"type": "reachability_of_possible_preservation",
"workflow": "stateequation"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 610
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 3,
"adisj": 1,
"aneg": 1,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "((p4 <= 0) OR (((1 <= p138)) AND ((p246 <= 0))))",
"processed_size": 49,
"rewrites": 34
},
"result":
{
"edges": 89,
"markings": 90,
"produced_by": "state space / EG",
"value": false
},
"task":
{
"compoundnumber": 8,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 6
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 4,
"problems": 2
},
"type": "eventual_occurrence",
"workflow": "stateequation"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 763
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 1,
"F": 2,
"G": 0,
"U": 0,
"X": 0,
"aconj": 5,
"adisj": 2,
"aneg": 0,
"comp": 5,
"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": "AF((EF(((1 <= p275))) AND ((((p177 <= 0)) OR ((1 <= p86))) AND (((p101 <= 0)) OR ((1 <= p140))))))",
"processed_size": 100,
"rewrites": 33
},
"net":
{
"conflict_clusters": 192,
"singleton_clusters": 0
},
"result":
{
"edges": 42,
"markings": 42,
"produced_by": "CTL model checker",
"value": true
},
"task":
{
"compoundnumber": 9,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1018
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"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": "((1 <= p5))",
"processed_size": 11,
"rewrites": 31
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 10,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1527
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 2,
"adisj": 1,
"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": 2,
"visible_transitions": 0
},
"processed": "E (G ((((p186 <= 0)) OR ((1 <= p244)))))",
"processed_size": 41,
"rewrites": 32
},
"result":
{
"edges": 89,
"markings": 90,
"produced_by": "state space / EG",
"value": true
},
"task":
{
"compoundnumber": 11,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 4
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 2,
"problems": 2
},
"type": "possible_preservation",
"workflow": "stateequation"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": true
},
"task":
{
"compoundnumber": 10,
"type": "boolean"
}
}
],
"exit":
{
"error": null,
"memory": 36188,
"runtime": 3570.000000,
"signal": null,
"timelimitreached": true
},
"files":
{
"formula": "CTLCardinality.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "(E(G(**)) OR A(G(E(X(**))))) : E(F(E(G(**)))) : A(F(**)) : (A(G(**)) AND **) : (E(G(**)) OR **) : (E(G(**)) AND ((A(G(**)) OR A(X(*))) AND **)) : (E(F(*)) OR **) : ** : E(F(E(G(**)))) : E(X(E(F(*)))) : FALSE : A(F((E(F(**)) AND (** AND **)))) : A(F(**))"
},
"net":
{
"arcs": 683,
"conflict_clusters": 192,
"places": 284,
"places_significant": 219,
"singleton_clusters": 0,
"transitions": 235
},
"result":
{
"interim_value": "yes unknown no unknown yes no unknown no yes yes no yes no ",
"preliminary_value": "yes unknown no unknown yes no unknown no yes yes no yes 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: 519/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 284
lola: finding significant places
lola: 284 places, 235 transitions, 219 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 CTLCardinality.xml
lola: LP says that atomic proposition is always true: (p71 <= 1)
lola: LP says that atomic proposition is always true: (p117 <= 1)
lola: LP says that atomic proposition is always true: (p51 <= 1)
lola: LP says that atomic proposition is always true: (p229 <= 1)
lola: LP says that atomic proposition is always true: (p28 <= 1)
lola: LP says that atomic proposition is always true: (p55 <= 1)
lola: LP says that atomic proposition is always true: (p107 <= 1)
lola: LP says that atomic proposition is always true: (p128 <= 1)
lola: LP says that atomic proposition is always true: (p117 <= 1)
lola: LP says that atomic proposition is always true: (p244 <= 1)
lola: LP says that atomic proposition is always true: (p5 <= 1)
lola: LP says that atomic proposition is always true: (p61 <= 1)
lola: LP says that atomic proposition is always true: (p113 <= 1)
lola: LP says that atomic proposition is always true: (p261 <= 1)
lola: LP says that atomic proposition is always true: (p173 <= 1)
lola: LP says that atomic proposition is always true: (p5 <= 1)
lola: LP says that atomic proposition is always true: (p246 <= 1)
lola: LP says that atomic proposition is always true: (p236 <= 1)
lola: LP says that atomic proposition is always true: (p135 <= 1)
lola: LP says that atomic proposition is always true: (p29 <= 1)
lola: LP says that atomic proposition is always true: (p141 <= 1)
lola: LP says that atomic proposition is always true: (p200 <= 1)
lola: LP says that atomic proposition is always true: (p140 <= 1)
lola: LP says that atomic proposition is always true: (p267 <= 1)
lola: LP says that atomic proposition is always true: (p275 <= 1)
lola: LP says that atomic proposition is always true: (p86 <= 1)
lola: LP says that atomic proposition is always true: (p140 <= 1)
lola: LP says that atomic proposition is always true: (p4 <= 1)
lola: LP says that atomic proposition is always true: (p246 <= 1)
lola: (E (G ((((p82 <= 0)) OR ((1 <= p71))))) OR A (G (E (X ((((p59 <= 0)) OR ((1 <= p117)))))))) : E (F (E (G ((((1 <= p153)) AND ((p51 <= 0))))))) : A (F (((1 <= p229)))) : (A (G ((((p38 <= 0)) OR ((1 <= p28)) OR ((1 <= p55))))) AND (((p69 <= 0)) OR ((1 <= p107)) OR (((1 <= p281)) AND ((p128 <= 0))) OR (((1 <= p175)) AND ((p117 <= 0))))) : (E (G ((((p186 <= 0)) OR ((1 <= p244))))) OR ((1 <= p5))) : ((E (G ((((p153 <= 0)) OR ((1 <= p61))))) AND (A (G ((((p199 <= 0)) OR ((1 <= p113))))) OR NOT(E (X ((((p251 <= 0)) OR ((1 <= p261)))))))) AND (((p23 <= 0)) OR ((1 <= p173)) OR (((1 <= p109)) AND ((p5 <= 0))))) : (NOT(E (X ((1 <= 0)))) AND (NOT(A (G ((((p219 <= 0)) OR ((1 <= p246)))))) OR (((1 <= p150)) AND ((p236 <= 0))))) : (NOT(E (G ((0 <= 0)))) OR ((((p177 <= 0)) OR ((1 <= p135))) AND (((1 <= p29)) OR ((1 <= p141))))) : E (F (E (G ((((p40 <= 0)) OR ((1 <= p200))))))) : NOT(A (X (A (G ((((p199 <= 0)) OR ((1 <= p140)))))))) : (NOT(E (G ((0 <= 0)))) AND NOT(A (((((p266 <= 0)) OR ((1 <= p267))) U (1 <= 0))))) : A (F (((E (F (((1 <= p275)))) AND (((p177 <= 0)) OR ((1 <= p86)))) AND (((p101 <= 0)) OR ((1 <= p140)))))) : A (F (((1 <= p4) AND (((p138 <= 0)) OR ((1 <= p246))))))
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:133
lola: rewrite Frontend/Parser/formula_rewrite.k:282
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:116
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:160
lola: rewrite Frontend/Parser/formula_rewrite.k:148
lola: rewrite Frontend/Parser/formula_rewrite.k:279
lola: rewrite Frontend/Parser/formula_rewrite.k:122
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:323
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:160
lola: rewrite Frontend/Parser/formula_rewrite.k:148
lola: rewrite Frontend/Parser/formula_rewrite.k:279
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:180
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:282
lola: rewrite Frontend/Parser/formula_rewrite.k:118
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((((p177 <= 0)) OR ((1 <= p135))) AND (((1 <= p29)) OR ((1 <= p141))))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((((p177 <= 0)) OR ((1 <= p135))) AND (((1 <= p29)) OR ((1 <= p141))))
lola: processed formula length: 72
lola: 31 rewrites
lola: closed formula file CTLCardinality.xml
lola: processed formula with 4 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 1 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: FALSE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FALSE
lola: processed formula length: 5
lola: 31 rewrites
lola: closed formula file CTLCardinality.xml
lola: processed formula with 0 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 2 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E (G ((((p82 <= 0)) OR ((1 <= p71))))) OR A (G (E (X ((((p59 <= 0)) OR ((1 <= p117))))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 2 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G ((((p82 <= 0)) OR ((1 <= p71)))))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation
lola: rewrite Frontend/Parser/formula_rewrite.k:583
lola: processed formula: E (G ((((p82 <= 0)) OR ((1 <= p71)))))
lola: processed formula length: 39
lola: 32 rewrites
lola: closed formula file CTLCardinality.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: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (((1 <= p82)) AND ((p71 <= 0)))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space / EG
lola: The predicate is possibly preserved.
lola: 90 markings, 89 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 3 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (X (E (F ((((1 <= p199)) AND ((p140 <= 0)))))))
lola: ========================================
lola: SUBTASK
lola: checking reachability from a successor
lola: rewrite Frontend/Parser/formula_rewrite.k:623
lola: rewrite Frontend/Parser/formula_rewrite.k:714
lola: processed formula: (((1 <= p199)) AND ((p140 <= 0)))
lola: processed formula length: 33
lola: 33 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /EXEF)
lola: state space: using reachability graph (EXef version) (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (((1 <= p199)) AND ((p140 <= 0)))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to CTLCardinality-3-0.sara
lola: state equation: calling and running sara
sara: try reading problem file CTLCardinality-3-0.sara.
sara: place or transition ordering is non-deterministic

lola: state equation 0: solution produced
lola: SUBRESULT
lola: result: yes
lola: produced by: state space /EXEF
lola: The predicate is reachable from some successor.
lola: 13462 markings, 28210 edges
lola: ========================================
lola: subprocess 4 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E (G ((((p153 <= 0)) OR ((1 <= p61))))) AND ((A (G ((((p199 <= 0)) OR ((1 <= p113))))) OR A (X ((((1 <= p251)) AND ((p261 <= 0)))))) AND (((p23 <= 0)) OR ((1 <= p173)) OR (((1 <= p109)) AND ((p5 <= 0))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 4 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((((p199 <= 0)) OR ((1 <= p113)))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: A (G ((((p199 <= 0)) OR ((1 <= p113)))))
lola: processed formula length: 41
lola: 33 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (((1 <= p199)) AND ((p113 <= 0)))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to CTLCardinality-4-0.sara
lola: state equation: calling and running sara
sara: try reading problem file CTLCardinality-4-0.sara.
sara: place or transition ordering is non-deterministic

lola: state equation 0: solution produced
lola: SUBRESULT
lola: result: no
lola: produced by: state equation
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 5 will run for 445 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (((p23 <= 0)) OR ((1 <= p173)) OR (((1 <= p109)) AND ((p5 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (((p23 <= 0)) OR ((1 <= p173)) OR (((1 <= p109)) AND ((p5 <= 0))))
lola: processed formula length: 68
lola: 31 rewrites
lola: closed formula file CTLCardinality.xml
lola: processed formula with 4 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: subprocess 6 will run for 509 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G ((((p153 <= 0)) OR ((1 <= p61)))))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation
lola: rewrite Frontend/Parser/formula_rewrite.k:583
lola: processed formula: E (G ((((p153 <= 0)) OR ((1 <= p61)))))
lola: processed formula length: 40
lola: 32 rewrites
lola: closed formula file CTLCardinality.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: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (((1 <= p153)) AND ((p61 <= 0)))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space / EG
lola: The predicate is possibly preserved.
lola: 112 markings, 111 edges
lola: ========================================
lola: subprocess 7 will run for 593 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X ((((1 <= p251)) AND ((p261 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:812
lola: processed formula: AX((((1 <= p251)) AND ((p261 <= 0))))
lola: processed formula length: 37
lola: 32 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 0 significant temporal operators and needs 0 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 0 markings, 0 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 5 will run for 445 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (((1 <= p229))))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:584
lola: rewrite Frontend/Parser/formula_rewrite.k:749
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: ((p229 <= 0))
lola: processed formula length: 13
lola: 34 rewrites
lola: closed formula file CTLCardinality.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: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:700
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((1 <= p229))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space / EG
lola: The predicate does not eventually occur.
lola: 90 markings, 89 edges
lola: ========================================
lola: subprocess 6 will run for 509 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (E (G ((((1 <= p153)) AND ((p51 <= 0)))))))
lola: ========================================
lola: SUBTASK
lola: checking reachability of possible preservation
lola: rewrite Frontend/Parser/formula_rewrite.k:598
lola: rewrite Frontend/Parser/formula_rewrite.k:633
lola: rewrite Frontend/Parser/formula_rewrite.k:730
lola: processed formula: (((1 <= p153)) AND ((p51 <= 0)))
lola: processed formula length: 32
lola: 34 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /EFEG)
lola: state space: using reachability graph (EFEG version) (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: state equation task get result rewrite finished id 0
lola: state equation task get result started, id 1
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: state equation task get result rewrite finished id 1
lola: state equation task get result unparse finished++ id 1
lola: formula 1: (((1 <= p153)) AND ((p51 <= 0)))
lola: state equation task get result unparse finished id 1
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (((p153 <= 0)) OR ((1 <= p51)))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 2 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to CTLCardinality-6-1.sara
lola: state equation: calling and running sara
sara: try reading problem file CTLCardinality-6-1.sara.
lola: state equation: write sara problem file to CTLCardinality-6-0.sara
lola: state equation: calling and running sara
sara: try reading problem file CTLCardinality-6-0.sara.
sara: place or transition ordering is non-deterministic
sara: place or transition ordering is non-deterministic


lola: state equation 1: solution produced
lola: state equation 0: solution produced
lola: sara is running 0 secs || sara is running 0 secs || 584448 markings, 1100195 edges, 116890 markings/sec, 0 secs
lola: sara is running 5 secs || sara is running 5 secs || 1156622 markings, 2165201 edges, 114435 markings/sec, 5 secs
lola: sara is running 10 secs || sara is running 10 secs || 1665804 markings, 3258211 edges, 101836 markings/sec, 10 secs
lola: sara is running 15 secs || sara is running 15 secs || 2169456 markings, 4370030 edges, 100730 markings/sec, 15 secs
lola: sara is running 20 secs || sara is running 20 secs || 2764206 markings, 5392848 edges, 118950 markings/sec, 20 secs
lola: sara is running 25 secs || sara is running 25 secs || 3378575 markings, 6448001 edges, 122874 markings/sec, 25 secs
lola: sara is running 30 secs || sara is running 30 secs || 4073046 markings, 7550228 edges, 138894 markings/sec, 30 secs
lola: sara is running 35 secs || sara is running 35 secs || 4551085 markings, 8633139 edges, 95608 markings/sec, 35 secs
lola: sara is running 40 secs || sara is running 40 secs || 5166925 markings, 9724542 edges, 123168 markings/sec, 40 secs
lola: sara is running 45 secs || sara is running 45 secs || 5734207 markings, 10812898 edges, 113456 markings/sec, 45 secs
lola: sara is running 50 secs || sara is running 50 secs || 6414592 markings, 11885894 edges, 136077 markings/sec, 50 secs
lola: sara is running 55 secs || sara is running 55 secs || 7143859 markings, 12925463 edges, 145853 markings/sec, 55 secs
lola: sara is running 60 secs || sara is running 60 secs || 7980158 markings, 14011999 edges, 167260 markings/sec, 60 secs
lola: sara is running 65 secs || sara is running 65 secs || 8804556 markings, 15074253 edges, 164880 markings/sec, 65 secs
lola: sara is running 70 secs || sara is running 70 secs || 9635403 markings, 16145416 edges, 166169 markings/sec, 70 secs
lola: sara is running 75 secs || sara is running 75 secs || 10468889 markings, 17222927 edges, 166697 markings/sec, 75 secs
lola: sara is running 80 secs || sara is running 80 secs || 11282657 markings, 18269243 edges, 162754 markings/sec, 80 secs
lola: sara is running 85 secs || sara is running 85 secs || 12093607 markings, 19320202 edges, 162190 markings/sec, 85 secs
lola: sara is running 90 secs || sara is running 90 secs || 12906377 markings, 20343642 edges, 162554 markings/sec, 90 secs
lola: sara is running 95 secs || sara is running 95 secs || 13622933 markings, 21415458 edges, 143311 markings/sec, 95 secs
lola: sara is running 100 secs || sara is running 100 secs || 14438354 markings, 22459035 edges, 163084 markings/sec, 100 secs
lola: sara is running 105 secs || sara is running 105 secs || 15219832 markings, 23480539 edges, 156296 markings/sec, 105 secs
lola: sara is running 110 secs || sara is running 110 secs || 15981503 markings, 24544712 edges, 152334 markings/sec, 110 secs
lola: sara is running 115 secs || sara is running 115 secs || 16783916 markings, 25590757 edges, 160483 markings/sec, 115 secs
lola: sara is running 120 secs || sara is running 120 secs || 17612704 markings, 26646577 edges, 165758 markings/sec, 120 secs
lola: sara is running 125 secs || sara is running 125 secs || 18416905 markings, 27689474 edges, 160840 markings/sec, 125 secs
lola: sara is running 130 secs || sara is running 130 secs || 19217722 markings, 28709643 edges, 160163 markings/sec, 130 secs
lola: sara is running 135 secs || sara is running 135 secs || 19930964 markings, 29723003 edges, 142648 markings/sec, 135 secs
lola: sara is running 140 secs || sara is running 140 secs || 20744040 markings, 30755485 edges, 162615 markings/sec, 140 secs
lola: sara is running 145 secs || sara is running 145 secs || 21555197 markings, 31797623 edges, 162231 markings/sec, 145 secs
lola: sara is running 150 secs || sara is running 150 secs || 22360986 markings, 32834973 edges, 161158 markings/sec, 150 secs
lola: sara is running 155 secs || sara is running 155 secs || 23147570 markings, 33889135 edges, 157317 markings/sec, 155 secs
lola: sara is running 160 secs || sara is running 160 secs || 23942858 markings, 34949097 edges, 159058 markings/sec, 160 secs
lola: sara is running 165 secs || sara is running 165 secs || 24761432 markings, 36012429 edges, 163715 markings/sec, 165 secs
lola: sara is running 170 secs || sara is running 170 secs || 25556877 markings, 37078016 edges, 159089 markings/sec, 170 secs
lola: sara is running 175 secs || sara is running 175 secs || 26331584 markings, 38124372 edges, 154941 markings/sec, 175 secs
lola: sara is running 180 secs || sara is running 180 secs || 27153764 markings, 39175915 edges, 164436 markings/sec, 180 secs
lola: sara is running 185 secs || sara is running 185 secs || 27952725 markings, 40205157 edges, 159792 markings/sec, 185 secs
lola: sara is running 190 secs || sara is running 190 secs || 28755475 markings, 41241905 edges, 160550 markings/sec, 190 secs
lola: sara is running 195 secs || sara is running 195 secs || 29566968 markings, 42284230 edges, 162299 markings/sec, 195 secs
lola: sara is running 200 secs || sara is running 200 secs || 30372431 markings, 43312289 edges, 161093 markings/sec, 200 secs
lola: sara is running 205 secs || sara is running 205 secs || 31246695 markings, 44330982 edges, 174853 markings/sec, 205 secs
lola: sara is running 210 secs || sara is running 210 secs || 32152698 markings, 45385101 edges, 181201 markings/sec, 210 secs
lola: sara is running 215 secs || sara is running 215 secs || 33056066 markings, 46429176 edges, 180674 markings/sec, 215 secs
lola: sara is running 220 secs || sara is running 220 secs || 33926392 markings, 47494657 edges, 174065 markings/sec, 220 secs
lola: sara is running 225 secs || sara is running 225 secs || 34516610 markings, 48506042 edges, 118044 markings/sec, 225 secs
lola: sara is running 230 secs || sara is running 230 secs || 35239565 markings, 49539227 edges, 144591 markings/sec, 230 secs
lola: sara is running 235 secs || sara is running 235 secs || 36008382 markings, 50609549 edges, 153763 markings/sec, 235 secs
lola: sara is running 240 secs || sara is running 240 secs || 36735239 markings, 51658464 edges, 145371 markings/sec, 240 secs
lola: sara is running 245 secs || sara is running 245 secs || 37486781 markings, 52690282 edges, 150308 markings/sec, 245 secs
lola: sara is running 250 secs || sara is running 250 secs || 38313293 markings, 53716949 edges, 165302 markings/sec, 250 secs
lola: sara is running 255 secs || sara is running 255 secs || 39090647 markings, 54729170 edges, 155471 markings/sec, 255 secs
lola: sara is running 260 secs || sara is running 260 secs || 39981530 markings, 55760746 edges, 178177 markings/sec, 260 secs
lola: sara is running 265 secs || sara is running 265 secs || 40869541 markings, 56787621 edges, 177602 markings/sec, 265 secs
lola: sara is running 270 secs || sara is running 270 secs || 41747913 markings, 57807140 edges, 175674 markings/sec, 270 secs
lola: sara is running 275 secs || sara is running 275 secs || 42603174 markings, 58809496 edges, 171052 markings/sec, 275 secs
lola: sara is running 280 secs || sara is running 280 secs || 43429219 markings, 59786241 edges, 165209 markings/sec, 280 secs
lola: sara is running 285 secs || sara is running 285 secs || 44249443 markings, 60765207 edges, 164045 markings/sec, 285 secs
lola: sara is running 290 secs || sara is running 290 secs || 45126336 markings, 61775321 edges, 175379 markings/sec, 290 secs
lola: sara is running 295 secs || sara is running 295 secs || 45985858 markings, 62760028 edges, 171904 markings/sec, 295 secs
lola: sara is running 300 secs || sara is running 300 secs || 46887543 markings, 63797944 edges, 180337 markings/sec, 300 secs
lola: sara is running 305 secs || sara is running 305 secs || 47786637 markings, 64832918 edges, 179819 markings/sec, 305 secs
lola: sara is running 310 secs || sara is running 310 secs || 48684756 markings, 65865268 edges, 179624 markings/sec, 310 secs
lola: sara is running 315 secs || sara is running 315 secs || 49566533 markings, 66879148 edges, 176355 markings/sec, 315 secs
lola: sara is running 320 secs || sara is running 320 secs || 50447621 markings, 67893173 edges, 176218 markings/sec, 320 secs
lola: sara is running 325 secs || sara is running 325 secs || 51315560 markings, 68890930 edges, 173588 markings/sec, 325 secs
lola: sara is running 330 secs || sara is running 330 secs || 52206695 markings, 69926106 edges, 178227 markings/sec, 330 secs
lola: sara is running 335 secs || sara is running 335 secs || 53104672 markings, 70958026 edges, 179595 markings/sec, 335 secs
lola: sara is running 340 secs || sara is running 340 secs || 54004088 markings, 71989426 edges, 179883 markings/sec, 340 secs
lola: sara is running 345 secs || sara is running 345 secs || 54895143 markings, 73010731 edges, 178211 markings/sec, 345 secs
lola: sara is running 350 secs || sara is running 350 secs || 55778476 markings, 74022445 edges, 176667 markings/sec, 350 secs
lola: sara is running 355 secs || sara is running 355 secs || 56646671 markings, 75015914 edges, 173639 markings/sec, 355 secs
lola: sara is running 360 secs || sara is running 360 secs || 57552340 markings, 76054891 edges, 181134 markings/sec, 360 secs
lola: sara is running 365 secs || sara is running 365 secs || 58453455 markings, 77087291 edges, 180223 markings/sec, 365 secs
lola: sara is running 370 secs || sara is running 370 secs || 59351699 markings, 78116286 edges, 179649 markings/sec, 370 secs
lola: sara is running 375 secs || sara is running 375 secs || 60243900 markings, 79138542 edges, 178440 markings/sec, 375 secs
lola: sara is running 380 secs || sara is running 380 secs || 61141645 markings, 80170607 edges, 179549 markings/sec, 380 secs
lola: sara is running 385 secs || sara is running 385 secs || 62029657 markings, 81192851 edges, 177602 markings/sec, 385 secs
lola: sara is running 390 secs || sara is running 390 secs || 62910584 markings, 82206873 edges, 176185 markings/sec, 390 secs
lola: sara is running 395 secs || sara is running 395 secs || 63788513 markings, 83216072 edges, 175586 markings/sec, 395 secs
lola: sara is running 400 secs || sara is running 400 secs || 64660076 markings, 84217999 edges, 174313 markings/sec, 400 secs
lola: sara is running 405 secs || sara is running 405 secs || 65507054 markings, 85201812 edges, 169396 markings/sec, 405 secs
lola: sara is running 410 secs || sara is running 410 secs || 66397730 markings, 86226284 edges, 178135 markings/sec, 410 secs
lola: sara is running 415 secs || sara is running 415 secs || 67279819 markings, 87241132 edges, 176418 markings/sec, 415 secs
lola: sara is running 420 secs || sara is running 420 secs || 68170619 markings, 88261048 edges, 178160 markings/sec, 420 secs
lola: sara is running 425 secs || sara is running 425 secs || 69045922 markings, 89264024 edges, 175061 markings/sec, 425 secs
lola: sara is running 430 secs || sara is running 430 secs || 69911938 markings, 90256140 edges, 173203 markings/sec, 430 secs
lola: sara is running 435 secs || sara is running 435 secs || 70774133 markings, 91244691 edges, 172439 markings/sec, 435 secs
lola: sara is running 440 secs || sara is running 440 secs || 71673613 markings, 92274195 edges, 179896 markings/sec, 440 secs
lola: sara is running 445 secs || sara is running 445 secs || 72559615 markings, 93289552 edges, 177200 markings/sec, 445 secs
lola: sara is running 450 secs || sara is running 450 secs || 73443424 markings, 94302046 edges, 176762 markings/sec, 450 secs
lola: sara is running 455 secs || sara is running 455 secs || 74326649 markings, 95313936 edges, 176645 markings/sec, 455 secs
lola: sara is running 460 secs || sara is running 460 secs || 75146522 markings, 96354366 edges, 163975 markings/sec, 460 secs
lola: sara is running 465 secs || sara is running 465 secs || 75892565 markings, 97406367 edges, 149209 markings/sec, 465 secs
lola: sara is running 470 secs || sara is running 470 secs || 76509001 markings, 98462360 edges, 123287 markings/sec, 470 secs
lola: sara is running 475 secs || sara is running 475 secs || 77105700 markings, 99506304 edges, 119340 markings/sec, 475 secs
lola: sara is running 480 secs || sara is running 480 secs || 77619007 markings, 100558624 edges, 102661 markings/sec, 480 secs
lola: sara is running 485 secs || sara is running 485 secs || 78061626 markings, 101619517 edges, 88524 markings/sec, 485 secs
lola: sara is running 490 secs || sara is running 490 secs || 78622298 markings, 102717506 edges, 112134 markings/sec, 490 secs
lola: sara is running 495 secs || sara is running 495 secs || 79229457 markings, 103805757 edges, 121432 markings/sec, 495 secs
lola: sara is running 500 secs || sara is running 500 secs || 79941268 markings, 104882994 edges, 142362 markings/sec, 500 secs
lola: local time limit reached - aborting
lola:
preliminary result: yes unknown no unknown unknown no unknown no unknown yes no unknown unknown
lola: memory consumption: 3576132 KB
lola: time consumption: 516 seconds
lola: print data as JSON (--json)
lola: writing JSON to CTLCardinality.json
lola: closed JSON file CTLCardinality.json
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 7 will run for 509 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (E (G ((((p40 <= 0)) OR ((1 <= p200)))))))
lola: ========================================
lola: SUBTASK
lola: checking reachability of possible preservation
lola: rewrite Frontend/Parser/formula_rewrite.k:598
lola: rewrite Frontend/Parser/formula_rewrite.k:633
lola: rewrite Frontend/Parser/formula_rewrite.k:730
lola: processed formula: (((p40 <= 0)) OR ((1 <= p200)))
lola: processed formula length: 32
lola: 34 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /EFEG)
lola: state space: using reachability graph (EFEG version) (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: state equation task get result started, id 1
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: state equation task get result rewrite finished id 1
lola: state equation task get result unparse finished++ id 1
lola: formula 1: (((p40 <= 0)) OR ((1 <= p200)))
lola: state equation task get result unparse finished id 1
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: state equation task get result rewrite finished id 0
lola: state equation: Generated DNF with 2 literals and 2 conjunctive subformulas
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (((1 <= p40)) AND ((p200 <= 0)))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space /EFEG
lola: The predicate is possibly preserved from a reachable marking.
lola: 90 markings, 89 edges
lola: ========================================
lola: subprocess 8 will run for 610 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (((1 <= p4) AND (((p138 <= 0)) OR ((1 <= p246))))))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:584
lola: rewrite Frontend/Parser/formula_rewrite.k:749
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: ((p4 <= 0) OR (((1 <= p138)) AND ((p246 <= 0))))
lola: processed formula length: 49
lola: 34 rewrites
lola: closed formula file CTLCardinality.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: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:700
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((1 <= p4) AND (((p138 <= 0)) OR ((1 <= p246))))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 4 literals and 2 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space / EG
lola: The predicate does not eventually occur.
lola: 90 markings, 89 edges
lola: ========================================
lola: subprocess 9 will run for 763 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F ((E (F (((1 <= p275)))) AND ((((p177 <= 0)) OR ((1 <= p86))) AND (((p101 <= 0)) OR ((1 <= p140)))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:806
lola: rewrite Frontend/Parser/formula_rewrite.k:811
lola: processed formula: AF((EF(((1 <= p275))) AND ((((p177 <= 0)) OR ((1 <= p86))) AND (((p101 <= 0)) OR ((1 <= p140))))))
lola: processed formula length: 100
lola: 33 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 42 markings, 42 edges
lola: ========================================
lola: subprocess 10 will run for 1018 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E (G ((((p186 <= 0)) OR ((1 <= p244))))) OR ((1 <= p5)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 10 will run for 1018 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((1 <= p5))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((1 <= p5))
lola: processed formula length: 11
lola: 31 rewrites
lola: closed formula file CTLCardinality.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: subprocess 11 will run for 1527 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G ((((p186 <= 0)) OR ((1 <= p244)))))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation
lola: rewrite Frontend/Parser/formula_rewrite.k:583
lola: processed formula: E (G ((((p186 <= 0)) OR ((1 <= p244)))))
lola: processed formula length: 41
lola: 32 rewrites
lola: closed formula file CTLCardinality.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: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (((1 <= p186)) AND ((p244 <= 0)))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space / EG
lola: The predicate is possibly preserved.
lola: 90 markings, 89 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 11 will run for 1527 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E (F ((((1 <= p219)) AND ((p246 <= 0))))) OR (((1 <= p150)) AND ((p236 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: local time limit reached - aborting
lola:
preliminary result: yes unknown no unknown yes no unknown no yes yes no yes no
lola: caught signal User defined signal 1 - aborting LoLA
lola: memory consumption: 36188 KB
lola: time consumption: 2043 seconds
lola: print data as JSON (--json)
lola: writing JSON to CTLCardinality.json
lola: closed JSON file CTLCardinality.json
lola: time limit reached - aborting
lola:
preliminary result: yes unknown no unknown yes no unknown no yes yes no yes no
lola:
preliminary result: yes unknown no unknown yes no unknown no yes yes no yes no
lola: memory consumption: 36188 KB
lola: time consumption: 3570 seconds
lola: print data as JSON (--json)
lola: writing JSON to CTLCardinality.json
lola: closed JSON file CTLCardinality.json
rslt: finished
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16427456 kB
MemFree: 16110864 kB
After kill :
MemTotal: 16427456 kB
MemFree: 16110888 kB

--------------------
content from stderr:

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="DES-PT-01b"
export BK_EXAMINATION="CTLCardinality"
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 DES-PT-01b, examination is CTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r180-ebro-158987899900203"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/DES-PT-01b.tgz
mv DES-PT-01b execution
cd execution
if [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "UpperBounds" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] || [ "CTLCardinality" = "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 [ "CTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLCardinality" != "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 "CTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLCardinality.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 '' CTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLCardinality"
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 ;