fond
Model Checking Contest 2020
10th edition, Paris, France, June 23, 2020
Execution of r178-tajo-158987882300371
Last Updated
Jun 28, 2020

About the Execution of ITS-LoLa for Diffusion2D-PT-D05N100

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
15795.080 3600000.00 934901.00 41533.30 TF?FTTTF?TTFFTFT 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.r178-tajo-158987882300371.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 Diffusion2D-PT-D05N100, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r178-tajo-158987882300371
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 244K
-rw-r--r-- 1 mcc users 4.1K Mar 31 06:27 CTLCardinality.txt
-rw-r--r-- 1 mcc users 21K Mar 31 06:27 CTLCardinality.xml
-rw-r--r-- 1 mcc users 3.0K Mar 29 22:45 CTLFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 29 22:45 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 24 05:37 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 5.8K Mar 24 05:37 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K Apr 8 14:48 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Apr 28 14:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Apr 8 14:48 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 28 14:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K Mar 28 14:29 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 17K Mar 28 14:29 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.6K Mar 27 07:29 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 21K Mar 27 07:29 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Mar 28 14:50 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Mar 28 14:50 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 55K 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 Diffusion2D-PT-D05N100-CTLCardinality-00
FORMULA_NAME Diffusion2D-PT-D05N100-CTLCardinality-01
FORMULA_NAME Diffusion2D-PT-D05N100-CTLCardinality-02
FORMULA_NAME Diffusion2D-PT-D05N100-CTLCardinality-03
FORMULA_NAME Diffusion2D-PT-D05N100-CTLCardinality-04
FORMULA_NAME Diffusion2D-PT-D05N100-CTLCardinality-05
FORMULA_NAME Diffusion2D-PT-D05N100-CTLCardinality-06
FORMULA_NAME Diffusion2D-PT-D05N100-CTLCardinality-07
FORMULA_NAME Diffusion2D-PT-D05N100-CTLCardinality-08
FORMULA_NAME Diffusion2D-PT-D05N100-CTLCardinality-09
FORMULA_NAME Diffusion2D-PT-D05N100-CTLCardinality-10
FORMULA_NAME Diffusion2D-PT-D05N100-CTLCardinality-11
FORMULA_NAME Diffusion2D-PT-D05N100-CTLCardinality-12
FORMULA_NAME Diffusion2D-PT-D05N100-CTLCardinality-13
FORMULA_NAME Diffusion2D-PT-D05N100-CTLCardinality-14
FORMULA_NAME Diffusion2D-PT-D05N100-CTLCardinality-15

=== Now, execution of the tool begins

BK_START 1591218673869

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-03 21:11:15] [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 21:11:15] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-03 21:11:15] [INFO ] Load time of PNML (sax parser for PT used): 42 ms
[2020-06-03 21:11:15] [INFO ] Transformed 25 places.
[2020-06-03 21:11:15] [INFO ] Transformed 144 transitions.
[2020-06-03 21:11:15] [INFO ] Parsed PT model containing 25 places and 144 transitions in 91 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 14 ms.
Incomplete random walk after 100039 steps, including 0 resets, run finished after 31 ms. (steps per millisecond=3227 ) properties seen :[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 0, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
// Phase 1: matrix 144 rows 25 cols
[2020-06-03 21:11:15] [INFO ] Computed 1 place invariants in 4 ms
[2020-06-03 21:11:15] [INFO ] [Real]Absence check using 1 positive place invariants in 9 ms returned unsat
[2020-06-03 21:11:15] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned unsat
[2020-06-03 21:11:15] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned unsat
Successfully simplified 3 atomic propositions for a total of 3 simplifications.
[2020-06-03 21:11:16] [INFO ] Initial state reduction rules for CTL removed 5 formulas.
[2020-06-03 21:11:16] [INFO ] Flatten gal took : 55 ms
[2020-06-03 21:11:16] [INFO ] Initial state reduction rules for CTL removed 5 formulas.
[2020-06-03 21:11:16] [INFO ] Flatten gal took : 8 ms
FORMULA Diffusion2D-PT-D05N100-CTLCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Diffusion2D-PT-D05N100-CTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Diffusion2D-PT-D05N100-CTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Diffusion2D-PT-D05N100-CTLCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Diffusion2D-PT-D05N100-CTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-06-03 21:11:16] [INFO ] Export to MCC properties in file /home/mcc/execution/CTLCardinality.sr.xml took 2 ms.
[2020-06-03 21:11:16] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 2 ms.
info: Time: 3600 - MCC
vrfy: Checking CTLCardinality @ Diffusion2D-PT-D05N100 @ 3570 seconds

FORMULA Diffusion2D-PT-D05N100-CTLCardinality-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Diffusion2D-PT-D05N100-CTLCardinality-03 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Diffusion2D-PT-D05N100-CTLCardinality-06 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Diffusion2D-PT-D05N100-CTLCardinality-01 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Diffusion2D-PT-D05N100-CTLCardinality-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Diffusion2D-PT-D05N100-CTLCardinality-04 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Diffusion2D-PT-D05N100-CTLCardinality-00 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Diffusion2D-PT-D05N100-CTLCardinality-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Diffusion2D-PT-D05N100-CTLCardinality-02 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Diffusion2D-PT-D05N100-CTLCardinality-08 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Diffusion2D-PT-D05N100-CTLCardinality-05 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 2657
rslt: Output for CTLCardinality @ Diffusion2D-PT-D05N100

{
"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",
"--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 21:11:16 2020
",
"timelimit": 3570
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 324
},
"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": "TRUE",
"processed_size": 4,
"rewrites": 12
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 0,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 356
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 1,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 5,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "A (G (((p17 <= 1) OR ((p9 <= p8) AND (p2 <= p13)))))",
"processed_size": 53,
"rewrites": 14
},
"result":
{
"edges": 4,
"markings": 5,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 1,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 4,
"problems": 2
},
"type": "invariance",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 396
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 1,
"F": 0,
"G": 1,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "AG(EX((p3 <= p14)))",
"processed_size": 19,
"rewrites": 14
},
"net":
{
"conflict_clusters": 25,
"singleton_clusters": 0
},
"result":
{
"edges": 13421,
"markings": 4706,
"produced_by": "CTL model checker",
"value": false
},
"task":
{
"compoundnumber": 2,
"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": 1,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 396
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 2,
"F": 0,
"G": 0,
"U": 1,
"X": 1,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 3,
"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": "E(((p6 <= 2) AND (p19 <= 0)) U EX((p12 <= p11)))",
"processed_size": 48,
"rewrites": 14
},
"net":
{
"conflict_clusters": 25,
"singleton_clusters": 0
},
"result":
{
"edges": 2814,
"markings": 1166,
"produced_by": "CTL model checker",
"value": true
},
"task":
{
"compoundnumber": 2,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 445
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 2,
"F": 0,
"G": 2,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "AG((EG((p10 <= p23)) OR EX((p4 <= p1))))",
"processed_size": 40,
"rewrites": 15
},
"net":
{
"conflict_clusters": 25,
"singleton_clusters": 0
},
"result":
{
"edges": 32437,
"markings": 6703,
"produced_by": "CTL model checker",
"value": false
},
"task":
{
"compoundnumber": 3,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
},

{
"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": 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": "(2 <= p4)",
"processed_size": 9,
"rewrites": 12
},
"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": 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": 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": 9,
"rewrites": 12
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 5,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 713
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 0,
"G": 0,
"U": 1,
"X": 0,
"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": 2,
"visible_transitions": 0
},
"processed": "E (((1 <= p1) U (2 <= p18)))",
"processed_size": 28,
"rewrites": 15
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "state space /EU",
"value": false
},
"task":
{
"compoundnumber": 6,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "eu preserving",
"visible": 5
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "existential_until",
"workflow": "stateequation"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 891
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 0,
"G": 0,
"U": 1,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "E (((1 <= p1) U (p2 <= p20)))",
"processed_size": 29,
"rewrites": 15
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "state space /EU",
"value": true
},
"task":
{
"compoundnumber": 7,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "eu preserving",
"visible": 5
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "existential_until",
"workflow": "stateequation"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1189
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"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": "EX((1 <= p20))",
"processed_size": 14,
"rewrites": 13
},
"net":
{
"conflict_clusters": 25,
"singleton_clusters": 0
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "CTL model checker",
"value": false
},
"task":
{
"compoundnumber": 8,
"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": 594
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "E (F ((3 <= p23)))",
"processed_size": 18,
"rewrites": 13
},
"result":
{
"edges": 6,
"markings": 7,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 5,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "reachability",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 713
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"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": "E (F ((p12 <= p23)))",
"processed_size": 20,
"rewrites": 13
},
"result":
{
"edges": 100,
"markings": 101,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 6,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "reachability",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1128
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "E (G ((p11 <= p3)))",
"processed_size": 19,
"rewrites": 13
},
"result":
{
"edges": 302,
"markings": 302,
"produced_by": "state space / EG",
"value": true
},
"task":
{
"compoundnumber": 8,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 26
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "possible_preservation",
"workflow": "stateequation"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3127
},
"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": 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": 12
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 10,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"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 (F (((3 <= p1) OR (3 <= p9))))",
"processed_size": 33,
"rewrites": 13
},
"result":
{
"edges": 1137,
"markings": 523,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 12,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 2,
"problems": 2
},
"type": "reachability",
"workflow": "stateequation||search"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": null
},
"task":
{
"compoundnumber": 10,
"type": "boolean"
}
},

{
"child":
[

{
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 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": 12
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 13,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 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": "(p15 <= 2)",
"processed_size": 10,
"rewrites": 12
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 14,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"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 (F (((3 <= p1) OR (3 <= p9))))",
"processed_size": 33,
"rewrites": 13
},
"result":
{
"edges": 1137,
"markings": 523,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 15,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 2,
"problems": 2
},
"type": "reachability",
"workflow": "stateequation||search"
}
}
],
"result":
{
"produced_by": "boolean",
"value": true
},
"task":
{
"compoundnumber": 13,
"type": "boolean"
}
}
],
"exit":
{
"error": null,
"memory": 3900,
"runtime": 913.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "CTLCardinality.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "E(F(**)) : A(G((E(G(**)) OR E(X(**))))) : E(F(A(G(*)))) : (A(G(E(X(**)))) OR A(G(**))) : E(F(**)) : (** AND (** OR E(F(**)))) : E((** U E(X(**)))) : E((** U A(G(**)))) : TRUE : (** OR (E((** U **)) OR (E((** U **)) AND (** OR E(X(**)))))) : E(G(**))"
},
"net":
{
"arcs": 288,
"conflict_clusters": 25,
"places": 25,
"places_significant": 24,
"singleton_clusters": 0,
"transitions": 144
},
"result":
{
"preliminary_value": "yes no unknown no yes yes yes unknown yes no yes ",
"value": "yes no unknown no yes yes yes unknown yes no yes "
},
"task":
{
"type": "compound"
}
}
lola: LoLA will run for 3570 seconds at most (--timelimit)
lola: NET
lola: input: PNML file (--pnml)
lola: reading net from model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file model.pnml
lola: 169/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 800
lola: finding significant places
lola: 25 places, 144 transitions, 24 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: A ((A (F ((p11 <= p10))) U E (F ((p12 <= p23))))) : A (G ((E (G ((p10 <= p23))) OR E (X ((p4 <= p1)))))) : E (F (NOT(E (F ((2 <= p0)))))) : (A (G (E (X ((p3 <= p14))))) OR A (G (((p17 <= 1) OR ((p9 <= p8) AND (p2 <= p13)))))) : E (F ((3 <= p23))) : ((p15 <= 2) AND ((3 <= p16) OR E (F (((3 <= p1) OR (3 <= p9)))))) : E ((((p6 <= 2) AND (p19 <= 0)) U E (X ((p12 <= p11))))) : E ((((p6 <= 1) OR (p6 + 1 <= p12)) U A (G ((p0 <= p3))))) : E (G (((((p20 <= p1) OR (1 <= p12)) OR E (G ((0 <= 0)))) OR ((p24 <= p7) AND (1 <= p16))))) : (((1 <= p5) OR E (((1 <= p1) U (2 <= p18)))) OR (E (((1 <= p1) U (p2 <= p20))) AND ((2 <= p4) OR E (X ((1 <= p20)))))) : E (G ((p11 <= p3)))
lola: rewrite Frontend/Parser/formula_rewrite.k:452
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:332
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:123
lola: rewrite Frontend/Parser/formula_rewrite.k:124
lola: rewrite Frontend/Parser/formula_rewrite.k:160
lola: rewrite Frontend/Parser/formula_rewrite.k:148
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: TRUE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: TRUE
lola: processed formula length: 4
lola: 12 rewrites
lola: closed formula file CTLCardinality.xml
lola: processed formula with 0 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 1 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (G (E (X ((p3 <= p14))))) OR A (G (((p17 <= 1) OR ((p9 <= p8) AND (p2 <= p13))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 1 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((p17 <= 1) OR ((p9 <= p8) AND (p2 <= p13)))))
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 (((p17 <= 1) OR ((p9 <= p8) AND (p2 <= p13)))))
lola: processed formula length: 53
lola: 14 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: SUBRESULT
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((2 <= p17) AND ((p8 + 1 <= p9) OR (p13 + 1 <= p2)))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 4 literals and 2 conjunctive subformulas
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 5 markings, 4 edges
lola: ========================================
lola: subprocess 2 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (E (X ((p3 <= p14)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:807
lola: rewrite Frontend/Parser/formula_rewrite.k:813
lola: processed formula: AG(EX((p3 <= p14)))
lola: processed formula length: 19
lola: 14 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 1 significant temporal operators and needs 5 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: 4706 markings, 13421 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 2 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E ((((p6 <= 2) AND (p19 <= 0)) U E (X ((p12 <= p11)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:807
lola: rewrite Frontend/Parser/formula_rewrite.k:809
lola: processed formula: E(((p6 <= 2) AND (p19 <= 0)) U EX((p12 <= p11)))
lola: processed formula length: 48
lola: 14 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 1 significant temporal operators and needs 5 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: 1166 markings, 2814 edges
lola: ========================================
lola: subprocess 3 will run for 445 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((E (G ((p10 <= p23))) OR E (X ((p4 <= p1))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:808
lola: rewrite Frontend/Parser/formula_rewrite.k:807
lola: rewrite Frontend/Parser/formula_rewrite.k:813
lola: processed formula: AG((EG((p10 <= p23)) OR EX((p4 <= p1))))
lola: processed formula length: 40
lola: 15 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: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 6703 markings, 32437 edges
lola: ========================================
lola: subprocess 4 will run for 509 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((1 <= p5) OR (E (((1 <= p1) U (2 <= p18))) OR (E (((1 <= p1) U (p2 <= p20))) AND ((2 <= p4) OR E (X ((1 <= p20)))))))
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 <= p4)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (2 <= p4)
lola: processed formula length: 9
lola: 12 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 5 will run for 594 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: 9
lola: 12 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 6 will run for 713 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (((1 <= p1) U (2 <= p18)))
lola: ========================================
lola: SUBTASK
lola: checking existential until
lola: rewrite Frontend/Parser/formula_rewrite.k:618
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: rewrite Frontend/Parser/formula_rewrite.k:738
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: E (((1 <= p1) U (2 <= p18)))
lola: processed formula length: 28
lola: 15 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 /EU)
lola: state space: using reachability graph (EU version) (--search=depth)
lola: state space: using eu preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: state equation task get result started, id 0
lola: SUBRESULT
lola: result: no
lola: produced by: state space /EU
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: (2 <= p18)
lola: state equation task get result unparse finished id 0
lola: There is no path where Predicate Phi holds until Predicate Psi.
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 7 will run for 891 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (((1 <= p1) U (p2 <= p20)))
lola: ========================================
lola: SUBTASK
lola: checking existential until
lola: rewrite Frontend/Parser/formula_rewrite.k:618
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: rewrite Frontend/Parser/formula_rewrite.k:738
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: E (((1 <= p1) U (p2 <= p20)))
lola: processed formula length: 29
lola: 15 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 /EU)
lola: state space: using reachability graph (EU version) (--search=depth)
lola: state space: using eu preserving stubborn set method (--stubborn=tarjan)
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: (p2 <= p20)
lola: state equation task get result unparse finished id 0
lola: SUBRESULT
lola: result: yes
lola: produced by: state space /EU
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: There is a path where Predicate Phi holds until Predicate Psi.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 8 will run for 1189 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (X ((1 <= p20)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:807
lola: processed formula: EX((1 <= p20))
lola: processed formula length: 14
lola: 13 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 594 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((3 <= p23)))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: processed formula: E (F ((3 <= p23)))
lola: processed formula length: 18
lola: 13 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:711
lola: state equation task get result rewrite finished id 0
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (3 <= p23)
lola: state equation task get result unparse finished id 0
lola: 7 markings, 6 edges
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: ========================================
lola: subprocess 6 will run for 713 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((p12 <= p23)))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: processed formula: E (F ((p12 <= p23)))
lola: processed formula length: 20
lola: 13 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:711
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (p12 <= p23)
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: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 101 markings, 100 edges
lola: ========================================
lola: subprocess 7 will run for 891 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (A (G ((p0 <= 1)))))
lola: ========================================
lola: SUBTASK
lola: checking possible invariance
lola: rewrite Frontend/Parser/formula_rewrite.k:604
lola: rewrite Frontend/Parser/formula_rewrite.k:614
lola: rewrite Frontend/Parser/formula_rewrite.k:726
lola: rewrite Frontend/Parser/formula_rewrite.k:788
lola: processed formula: (2 <= p0)
lola: processed formula length: 9
lola: 16 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
lola: using tscc preserving stubborn set method (--stubborn)
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:700
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (p0 <= 1)
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation task get result started, id 1
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:788
lola: state equation task get result rewrite finished id 1
lola: state equation task get result unparse finished++ id 1
lola: formula 1: (2 <= p0)
lola: state equation task get result unparse finished id 1
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to CTLCardinality-7-0.sara
lola: state equation: calling and running sara
lola: state equation: write sara problem file to CTLCardinality-7-1.sara
lola: state equation: calling and running sara
sara: try reading problem file CTLCardinality-7-0.sara.
sara: try reading problem file CTLCardinality-7-1.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 || 2700935 markings, 7942151 edges, 540187 markings/sec, 0 secs
lola: sara is running 5 secs || sara is running 5 secs || 5383347 markings, 15600285 edges, 536482 markings/sec, 5 secs
lola: sara is running 10 secs || sara is running 10 secs || 8047001 markings, 23106989 edges, 532731 markings/sec, 10 secs
lola: sara is running 15 secs || sara is running 15 secs || 10702703 markings, 30658014 edges, 531140 markings/sec, 15 secs
lola: sara is running 20 secs || sara is running 20 secs || 13355742 markings, 38141591 edges, 530608 markings/sec, 20 secs
lola: sara is running 25 secs || sara is running 25 secs || 15993913 markings, 45498860 edges, 527634 markings/sec, 25 secs
lola: sara is running 30 secs || sara is running 30 secs || 18612782 markings, 52848589 edges, 523774 markings/sec, 30 secs
lola: sara is running 35 secs || sara is running 35 secs || 21212620 markings, 60183694 edges, 519968 markings/sec, 35 secs
lola: sara is running 40 secs || sara is running 40 secs || 23791469 markings, 67419296 edges, 515770 markings/sec, 40 secs
lola: sara is running 45 secs || sara is running 45 secs || 26367600 markings, 74622624 edges, 515226 markings/sec, 45 secs
lola: sara is running 50 secs || sara is running 50 secs || 28970570 markings, 81947606 edges, 520594 markings/sec, 50 secs
lola: sara is running 55 secs || sara is running 55 secs || 31559703 markings, 89209644 edges, 517827 markings/sec, 55 secs
lola: sara is running 60 secs || sara is running 60 secs || 34146140 markings, 96411709 edges, 517287 markings/sec, 60 secs
lola: sara is running 65 secs || sara is running 65 secs || 36716001 markings, 103578959 edges, 513972 markings/sec, 65 secs
lola: sara is running 70 secs || sara is running 70 secs || 39300840 markings, 110870243 edges, 516968 markings/sec, 70 secs
lola: sara is running 75 secs || sara is running 75 secs || 41868856 markings, 118046105 edges, 513603 markings/sec, 75 secs
lola: sara is running 80 secs || sara is running 80 secs || 44453657 markings, 125292768 edges, 516960 markings/sec, 80 secs
lola: sara is running 85 secs || sara is running 85 secs || 47013151 markings, 132380557 edges, 511899 markings/sec, 85 secs
lola: sara is running 90 secs || sara is running 90 secs || 49580967 markings, 139501327 edges, 513563 markings/sec, 90 secs
lola: sara is running 95 secs || sara is running 95 secs || 52145854 markings, 146635407 edges, 512977 markings/sec, 95 secs
lola: sara is running 100 secs || sara is running 100 secs || 54693640 markings, 153722378 edges, 509557 markings/sec, 100 secs
lola: sara is running 105 secs || sara is running 105 secs || 57252002 markings, 160826103 edges, 511672 markings/sec, 105 secs
lola: sara is running 110 secs || sara is running 110 secs || 59862553 markings, 168230328 edges, 522110 markings/sec, 110 secs
lola: sara is running 115 secs || sara is running 115 secs || 62422000 markings, 175372346 edges, 511889 markings/sec, 115 secs
lola: sara is running 120 secs || sara is running 120 secs || 64969227 markings, 182509747 edges, 509445 markings/sec, 120 secs
lola: sara is running 125 secs || sara is running 125 secs || 66877233 markings, 187809440 edges, 381601 markings/sec, 125 secs
lola: sara is running 130 secs || sara is running 130 secs || 68684618 markings, 192864442 edges, 361477 markings/sec, 130 secs
lola: sara is running 135 secs || sara is running 135 secs || 70235378 markings, 197198144 edges, 310152 markings/sec, 135 secs
lola: sara is running 140 secs || sara is running 140 secs || 71854481 markings, 201687586 edges, 323821 markings/sec, 140 secs
lola: sara is running 145 secs || sara is running 145 secs || 73693937 markings, 206881209 edges, 367891 markings/sec, 145 secs
lola: sara is running 150 secs || sara is running 150 secs || 75190115 markings, 211036646 edges, 299236 markings/sec, 150 secs
lola: sara is running 155 secs || sara is running 155 secs || 76391724 markings, 214374440 edges, 240322 markings/sec, 155 secs
lola: sara is running 160 secs || sara is running 160 secs || 77788982 markings, 218238521 edges, 279452 markings/sec, 160 secs
lola: sara is running 165 secs || sara is running 165 secs || 79007412 markings, 221586212 edges, 243686 markings/sec, 165 secs
lola: sara is running 170 secs || sara is running 170 secs || 80474945 markings, 225638288 edges, 293507 markings/sec, 170 secs
lola: lola: Child process aborted or communication problem between parent and child process
lola: subprocess 8 will run for 1128 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G ((p11 <= p3)))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation
lola: rewrite Frontend/Parser/formula_rewrite.k:583
lola: processed formula: E (G ((p11 <= p3)))
lola: processed formula length: 19
lola: 13 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: SUBRESULT
lola: result: yes
lola: produced by: state space / EG
lola: The predicate is possibly preserved.
lola: 302 markings, 302 edges
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (p3 + 1 <= p11)
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: ========================================
lola: subprocess 9 will run for 1692 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E ((((p6 <= 1) OR (p6 + 1 <= p12)) U A (G ((p0 <= p3)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:813
lola: rewrite Frontend/Parser/formula_rewrite.k:809
lola: processed formula: E(((p6 <= 1) OR (p6 + 1 <= p12)) U AG((p0 <= p3)))
lola: processed formula length: 51
lola: 14 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: 1690974 markings, 7280270 edges, 338195 markings/sec, 0 secs
lola: 3421405 markings, 13924623 edges, 346086 markings/sec, 5 secs
lola: 5406302 markings, 21513006 edges, 396979 markings/sec, 10 secs
lola: 7402962 markings, 29261246 edges, 399332 markings/sec, 15 secs
lola: 9377864 markings, 36751086 edges, 394980 markings/sec, 20 secs
lola: 11332954 markings, 44104117 edges, 391018 markings/sec, 25 secs
lola: 13279337 markings, 51485621 edges, 389277 markings/sec, 30 secs
lola: 15107859 markings, 58376618 edges, 365704 markings/sec, 35 secs
lola: 16985128 markings, 65471743 edges, 375454 markings/sec, 40 secs
lola: 18850219 markings, 72475965 edges, 373018 markings/sec, 45 secs
lola: 20697395 markings, 79592114 edges, 369435 markings/sec, 50 secs
lola: 22649519 markings, 87007486 edges, 390425 markings/sec, 55 secs
lola: 24571632 markings, 94271762 edges, 384423 markings/sec, 60 secs
lola: 26382128 markings, 101207569 edges, 362099 markings/sec, 65 secs
lola: 28275741 markings, 108445360 edges, 378723 markings/sec, 70 secs
lola: 30086082 markings, 115279627 edges, 362068 markings/sec, 75 secs
lola: 31934603 markings, 122235870 edges, 369704 markings/sec, 80 secs
lola: 33847189 markings, 129458565 edges, 382517 markings/sec, 85 secs
lola: 35777830 markings, 136762150 edges, 386128 markings/sec, 90 secs
lola: 37555190 markings, 143446580 edges, 355472 markings/sec, 95 secs
lola: 39302840 markings, 149976421 edges, 349530 markings/sec, 100 secs
lola: 41052601 markings, 156607672 edges, 349952 markings/sec, 105 secs
lola: 42818797 markings, 163237116 edges, 353239 markings/sec, 110 secs
lola: 44724956 markings, 170376856 edges, 381232 markings/sec, 115 secs
lola: 46633378 markings, 177545563 edges, 381684 markings/sec, 120 secs
lola: 48404875 markings, 184191087 edges, 354299 markings/sec, 125 secs
lola: 50162641 markings, 190821360 edges, 351553 markings/sec, 130 secs
lola: 52093917 markings, 198106818 edges, 386255 markings/sec, 135 secs
lola: 54043797 markings, 205559839 edges, 389976 markings/sec, 140 secs
lola: 55981590 markings, 212959185 edges, 387559 markings/sec, 145 secs
lola: 57871017 markings, 220026057 edges, 377885 markings/sec, 150 secs
lola: 59141293 markings, 224744990 edges, 254055 markings/sec, 155 secs
lola: 60115337 markings, 228383619 edges, 194809 markings/sec, 160 secs
lola: 61183259 markings, 232407235 edges, 213584 markings/sec, 165 secs
lola: 62294612 markings, 236645329 edges, 222271 markings/sec, 170 secs
lola: 62991055 markings, 239255630 edges, 139289 markings/sec, 175 secs
lola: 63685006 markings, 241840594 edges, 138790 markings/sec, 180 secs
lola: 64534248 markings, 245121006 edges, 169848 markings/sec, 185 secs
lola: 65445492 markings, 248606587 edges, 182249 markings/sec, 190 secs
lola: 66273855 markings, 251730136 edges, 165673 markings/sec, 195 secs
lola: 67055363 markings, 254694289 edges, 156302 markings/sec, 200 secs
lola: 67588347 markings, 256688858 edges, 106597 markings/sec, 205 secs
lola: 68249303 markings, 259165822 edges, 132191 markings/sec, 210 secs
lola: 68944289 markings, 261777649 edges, 138997 markings/sec, 215 secs
lola: 69968424 markings, 265662152 edges, 204827 markings/sec, 220 secs
lola: 70802551 markings, 268819988 edges, 166825 markings/sec, 225 secs
lola: 71218667 markings, 270364794 edges, 83223 markings/sec, 230 secs
lola: 71391711 markings, 271012934 edges, 34609 markings/sec, 235 secs
lola: 71436233 markings, 271174598 edges, 8904 markings/sec, 240 secs
lola: 71449472 markings, 271222476 edges, 2648 markings/sec, 245 secs
lola: 71455380 markings, 271244812 edges, 1182 markings/sec, 250 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 10 will run for 3127 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((p15 <= 2) AND ((3 <= p16) OR E (F (((3 <= p1) OR (3 <= p9))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 10 will run for 3127 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (3 <= p16)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (3 <= p16)
lola: processed formula length: 10
lola: 12 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: Child process aborted or communication problem between parent and child process
lola: subprocess 12 will run for 1 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((3 <= p1) OR (3 <= p9))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: processed formula: E (F (((3 <= p1) OR (3 <= p9))))
lola: processed formula length: 33
lola: 13 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:711
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((3 <= p1) OR (3 <= p9))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 2 literals and 2 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 523 markings, 1137 edges
lola: state equation: write sara problem file to CTLCardinality-12-0.sara
lola: state equation: calling and running sara
sara: try reading problem file CTLCardinality-12-0.sara.
lola: ========================================
lola: SUBRESULT
lola: result: unknown
lola: The Boolean predicate may be true or false.
lola: ========================================
lola: ========================================
lola: ...considering subproblem: E (F (A (G ((p0 <= 1)))))
lola: ========================================
lola: SUBTASK
lola: checking possible invariance
lola: rewrite Frontend/Parser/formula_rewrite.k:604
lola: rewrite Frontend/Parser/formula_rewrite.k:614
lola: rewrite Frontend/Parser/formula_rewrite.k:726
lola: rewrite Frontend/Parser/formula_rewrite.k:788
lola: processed formula: (2 <= p0)
lola: processed formula length: 9
lola: 16 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)
sara: place or transition ordering is non-deterministic
lola: SEARCH
lola: using tscc preserving stubborn set method (--stubborn)
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:700
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (p0 <= 1)
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation task get result started, id 1
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:788
lola: state equation task get result rewrite finished id 1
lola: state equation task get result unparse finished++ id 1
lola: formula 1: (2 <= p0)
lola: state equation task get result unparse finished id 1
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to CTLCardinality-11-0.sara

lola: state equation: calling and running sara
sara: try reading problem file CTLCardinality-11-0.sara.
sara: place or transition ordering is non-deterministic

lola: state equation: write sara problem file to CTLCardinality-11-1.sara
lola: state equation: calling and running sara
sara: try reading problem file CTLCardinality-11-1.sara.
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 || 2144462 markings, 6346916 edges, 428892 markings/sec, 0 secs
lola: sara is running 5 secs || sara is running 5 secs || 4313035 markings, 12578585 edges, 433715 markings/sec, 5 secs
lola: sara is running 10 secs || sara is running 10 secs || 6694387 markings, 19283187 edges, 476270 markings/sec, 10 secs
lola: sara is running 15 secs || sara is running 15 secs || 9061774 markings, 25986110 edges, 473477 markings/sec, 15 secs
lola: sara is running 20 secs || sara is running 20 secs || 11386498 markings, 32589763 edges, 464945 markings/sec, 20 secs
lola: sara is running 25 secs || sara is running 25 secs || 13801044 markings, 39393542 edges, 482909 markings/sec, 25 secs
lola: sara is running 30 secs || sara is running 30 secs || 15796317 markings, 44946369 edges, 399055 markings/sec, 30 secs
lola: sara is running 35 secs || sara is running 35 secs || 18141278 markings, 51546382 edges, 468992 markings/sec, 35 secs
lola: sara is running 40 secs || sara is running 40 secs || 20448389 markings, 58003110 edges, 461422 markings/sec, 40 secs
lola: sara is running 45 secs || sara is running 45 secs || 22777838 markings, 64578883 edges, 465890 markings/sec, 45 secs
lola: sara is running 50 secs || sara is running 50 secs || 25028067 markings, 70890632 edges, 450046 markings/sec, 50 secs
lola: sara is running 55 secs || sara is running 55 secs || 27605620 markings, 78113632 edges, 515511 markings/sec, 55 secs
lola: sara is running 60 secs || sara is running 60 secs || 30083702 markings, 85084286 edges, 495616 markings/sec, 60 secs
lola: sara is running 65 secs || sara is running 65 secs || 32689311 markings, 92343516 edges, 521122 markings/sec, 65 secs
lola: sara is running 70 secs || sara is running 70 secs || 35297051 markings, 99632421 edges, 521548 markings/sec, 70 secs
lola: sara is running 75 secs || sara is running 75 secs || 37894009 markings, 106877642 edges, 519392 markings/sec, 75 secs
lola: sara is running 80 secs || sara is running 80 secs || 40329542 markings, 113720525 edges, 487107 markings/sec, 80 secs
lola: sara is running 85 secs || sara is running 85 secs || 42951666 markings, 121107106 edges, 524425 markings/sec, 85 secs
lola: sara is running 90 secs || sara is running 90 secs || 45542919 markings, 128293361 edges, 518251 markings/sec, 90 secs
lola: sara is running 95 secs || sara is running 95 secs || 48137998 markings, 135522107 edges, 519016 markings/sec, 95 secs
lola: sara is running 100 secs || sara is running 100 secs || 50565339 markings, 142220291 edges, 485468 markings/sec, 100 secs
lola: sara is running 105 secs || sara is running 105 secs || 53167305 markings, 149494955 edges, 520393 markings/sec, 105 secs
lola: sara is running 110 secs || sara is running 110 secs || 55516623 markings, 156010417 edges, 469864 markings/sec, 110 secs
lola: sara is running 115 secs || sara is running 115 secs || 57837428 markings, 162458847 edges, 464161 markings/sec, 115 secs
lola: sara is running 120 secs || sara is running 120 secs || 60246021 markings, 169305290 edges, 481719 markings/sec, 120 secs
lola: sara is running 125 secs || sara is running 125 secs || 62610472 markings, 175903347 edges, 472890 markings/sec, 125 secs
lola: sara is running 130 secs || sara is running 130 secs || 65193694 markings, 183140315 edges, 516644 markings/sec, 130 secs
lola: sara is running 135 secs || sara is running 135 secs || 67448494 markings, 189399114 edges, 450960 markings/sec, 135 secs
lola: sara is running 140 secs || sara is running 140 secs || 68991564 markings, 193708453 edges, 308614 markings/sec, 140 secs
lola: sara is running 145 secs || sara is running 145 secs || 70458513 markings, 197811929 edges, 293390 markings/sec, 145 secs
lola: sara is running 150 secs || sara is running 150 secs || 71846945 markings, 201666281 edges, 277686 markings/sec, 150 secs
lola: sara is running 155 secs || sara is running 155 secs || 73555481 markings, 206480234 edges, 341707 markings/sec, 155 secs
lola: sara is running 160 secs || sara is running 160 secs || 75089057 markings, 210754202 edges, 306715 markings/sec, 160 secs
lola: sara is running 165 secs || sara is running 165 secs || 76431794 markings, 214485689 edges, 268547 markings/sec, 165 secs
lola: sara is running 170 secs || sara is running 170 secs || 77969653 markings, 218735824 edges, 307572 markings/sec, 170 secs
lola: sara is running 175 secs || sara is running 175 secs || 79329937 markings, 222473266 edges, 272057 markings/sec, 175 secs
lola: sara is running 180 secs || sara is running 180 secs || 81100690 markings, 227366967 edges, 354151 markings/sec, 180 secs
lola: Child process aborted or communication problem between parent and child process
lola: ========================================
lola: ...considering subproblem: E ((((p6 <= 1) OR (p6 + 1 <= p12)) U A (G ((p0 <= p3)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:813
lola: rewrite Frontend/Parser/formula_rewrite.k:809
lola: processed formula: E(((p6 <= 1) OR (p6 + 1 <= p12)) U AG((p0 <= p3)))
lola: processed formula length: 51
lola: 14 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: 1674771 markings, 7217829 edges, 334954 markings/sec, 0 secs
lola: 3639351 markings, 14776465 edges, 392916 markings/sec, 5 secs
lola: 5607748 markings, 22274038 edges, 393679 markings/sec, 10 secs
lola: 7575022 markings, 29921157 edges, 393455 markings/sec, 15 secs
lola: 9527359 markings, 37319680 edges, 390467 markings/sec, 20 secs
lola: 11472336 markings, 44635507 edges, 388995 markings/sec, 25 secs
lola: 13412779 markings, 51981409 edges, 388089 markings/sec, 30 secs
lola: 15344343 markings, 59270983 edges, 386313 markings/sec, 35 secs
lola: 17175555 markings, 66195675 edges, 366242 markings/sec, 40 secs
lola: 18935788 markings, 72802351 edges, 352047 markings/sec, 45 secs
lola: 20841976 markings, 80133495 edges, 381238 markings/sec, 50 secs
lola: 22732521 markings, 87319450 edges, 378109 markings/sec, 55 secs
lola: 24520323 markings, 94075283 edges, 357560 markings/sec, 60 secs
lola: 26253833 markings, 100713005 edges, 346702 markings/sec, 65 secs
lola: 27949401 markings, 107145300 edges, 339114 markings/sec, 70 secs
lola: 29714552 markings, 113865506 edges, 353030 markings/sec, 75 secs
lola: 31431453 markings, 120355941 edges, 343380 markings/sec, 80 secs
lola: 33094877 markings, 126633574 edges, 332685 markings/sec, 85 secs
lola: 34871519 markings, 133345842 edges, 355328 markings/sec, 90 secs
lola: 36774482 markings, 140520437 edges, 380593 markings/sec, 95 secs
lola: 38430807 markings, 146715446 edges, 331265 markings/sec, 100 secs
lola: 40093265 markings, 152972097 edges, 332492 markings/sec, 105 secs
lola: 41841782 markings, 159566511 edges, 349703 markings/sec, 110 secs
lola: 43516101 markings, 165849031 edges, 334864 markings/sec, 115 secs
lola: 45213784 markings, 172217852 edges, 339537 markings/sec, 120 secs
lola: 46868560 markings, 178423245 edges, 330955 markings/sec, 125 secs
lola: 48690086 markings, 185257957 edges, 364305 markings/sec, 130 secs
lola: 50394567 markings, 191689650 edges, 340896 markings/sec, 135 secs
lola: 52076964 markings, 198041450 edges, 336479 markings/sec, 140 secs
lola: 53769503 markings, 204509365 edges, 338508 markings/sec, 145 secs
lola: 55501005 markings, 211138876 edges, 346300 markings/sec, 150 secs
lola: 57197678 markings, 217518004 edges, 339335 markings/sec, 155 secs
lola: 58354592 markings, 221822176 edges, 231383 markings/sec, 160 secs
lola: 59296804 markings, 225322331 edges, 188442 markings/sec, 165 secs
lola: 60097520 markings, 228319188 edges, 160143 markings/sec, 170 secs
lola: 60836260 markings, 231073654 edges, 147748 markings/sec, 175 secs
lola: 61854774 markings, 234974301 edges, 203703 markings/sec, 180 secs
lola: 62742235 markings, 238329891 edges, 177492 markings/sec, 185 secs
lola: 63404259 markings, 240793675 edges, 132405 markings/sec, 190 secs
lola: 63858376 markings, 242495817 edges, 90823 markings/sec, 195 secs
lola: 64789481 markings, 246119380 edges, 186221 markings/sec, 200 secs
lola: 65490784 markings, 248777585 edges, 140261 markings/sec, 205 secs
lola: 66501147 markings, 252596225 edges, 202073 markings/sec, 210 secs
lola: 67153023 markings, 255057125 edges, 130375 markings/sec, 215 secs
lola: 67872073 markings, 257759347 edges, 143810 markings/sec, 220 secs
lola: 68363153 markings, 259584560 edges, 98216 markings/sec, 225 secs
lola: 68941310 markings, 261766186 edges, 115631 markings/sec, 230 secs
lola: 69600995 markings, 264269686 edges, 131937 markings/sec, 235 secs
lola: 70345838 markings, 267089393 edges, 148969 markings/sec, 240 secs
lola: 70942620 markings, 269340236 edges, 119356 markings/sec, 245 secs
lola: 71309703 markings, 270705969 edges, 73417 markings/sec, 250 secs
lola: 71385925 markings, 270991665 edges, 15244 markings/sec, 255 secs
lola: 71419402 markings, 271113339 edges, 6695 markings/sec, 260 secs
lola: 71474424 markings, 271315837 edges, 11004 markings/sec, 265 secs
lola: 71494737 markings, 271392517 edges, 4063 markings/sec, 270 secs
lola: Child process aborted or communication problem between parent and child process
lola: ========================================
lola: ...considering subproblem: ((p15 <= 2) AND ((3 <= p16) OR E (F (((3 <= p1) OR (3 <= p9))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: ...considering subproblem: (3 <= p16)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (3 <= p16)
lola: processed formula length: 10
lola: 12 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: ========================================
lola: ...considering subproblem: (p15 <= 2)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p15 <= 2)
lola: processed formula length: 10
lola: 12 rewrites
lola: closed formula file CTLCardinality.xml
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: ========================================
lola: ...considering subproblem: E (F (((3 <= p1) OR (3 <= p9))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: processed formula: E (F (((3 <= p1) OR (3 <= p9))))
lola: processed formula length: 33
lola: 13 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:711
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((3 <= p1) OR (3 <= p9))
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-15-0.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 523 markings, 1137 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: RESULT
lola:
SUMMARY: yes no unknown no yes yes yes unknown yes no yes
lola:
preliminary result: yes no unknown no yes yes yes unknown yes no yes
lola: memory consumption: 3900 KB
lola: time consumption: 913 seconds
lola: print data as JSON (--json)
lola: writing JSON to CTLCardinality.json
lola: closed JSON file CTLCardinality.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="Diffusion2D-PT-D05N100"
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 Diffusion2D-PT-D05N100, 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 r178-tajo-158987882300371"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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