fond
Model Checking Contest 2020
10th edition, Paris, France, June 23, 2020
Execution of r194-csrt-159033390400724
Last Updated
Jun 28, 2020

About the Execution of ITS-LoLa for ResAllocation-PT-R020C002

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
15742.190 3600000.00 3714783.00 1442.50 FFFFTTFFTFTFTFTF normal

Execution Chart

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

Trace from the execution

Formatting '/local/x2003239/mcc2020-input.r194-csrt-159033390400724.qcow2', fmt=qcow2 size=4294967296 backing_file=/local/x2003239/mcc2020-input.qcow2 encryption=off cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
......................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itslola
Input is ResAllocation-PT-R020C002, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r194-csrt-159033390400724
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 264K
-rw-r--r-- 1 mcc users 3.3K May 14 00:25 CTLCardinality.txt
-rw-r--r-- 1 mcc users 17K May 14 00:25 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K May 13 17:36 CTLFireability.txt
-rw-r--r-- 1 mcc users 15K May 13 17:36 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K May 12 20:53 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K May 12 20:53 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K May 14 10:00 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 14 10:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 14 10:00 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 14 10:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K May 13 13:05 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 19K May 13 13:05 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.0K May 13 07:35 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 17K May 13 07:35 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K May 13 16:53 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 13 16:53 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 12 20:53 equiv_col
-rw-r--r-- 1 mcc users 9 May 12 20:53 instance
-rw-r--r-- 1 mcc users 6 May 12 20:53 iscolored
-rw-r--r-- 1 mcc users 85K May 12 20:53 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 ResAllocation-PT-R020C002-CTLFireability-00
FORMULA_NAME ResAllocation-PT-R020C002-CTLFireability-01
FORMULA_NAME ResAllocation-PT-R020C002-CTLFireability-02
FORMULA_NAME ResAllocation-PT-R020C002-CTLFireability-03
FORMULA_NAME ResAllocation-PT-R020C002-CTLFireability-04
FORMULA_NAME ResAllocation-PT-R020C002-CTLFireability-05
FORMULA_NAME ResAllocation-PT-R020C002-CTLFireability-06
FORMULA_NAME ResAllocation-PT-R020C002-CTLFireability-07
FORMULA_NAME ResAllocation-PT-R020C002-CTLFireability-08
FORMULA_NAME ResAllocation-PT-R020C002-CTLFireability-09
FORMULA_NAME ResAllocation-PT-R020C002-CTLFireability-10
FORMULA_NAME ResAllocation-PT-R020C002-CTLFireability-11
FORMULA_NAME ResAllocation-PT-R020C002-CTLFireability-12
FORMULA_NAME ResAllocation-PT-R020C002-CTLFireability-13
FORMULA_NAME ResAllocation-PT-R020C002-CTLFireability-14
FORMULA_NAME ResAllocation-PT-R020C002-CTLFireability-15

=== Now, execution of the tool begins

BK_START 1591238932607

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-04 02:48:54] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -timeout, 3600, -rebuildPNML]
[2020-06-04 02:48:54] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-04 02:48:54] [INFO ] Load time of PNML (sax parser for PT used): 77 ms
[2020-06-04 02:48:54] [INFO ] Transformed 80 places.
[2020-06-04 02:48:54] [INFO ] Transformed 42 transitions.
[2020-06-04 02:48:54] [INFO ] Parsed PT model containing 80 places and 42 transitions in 152 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 34 ms.
Incomplete random walk after 100000 steps, including 859 resets, run finished after 313 ms. (steps per millisecond=319 ) properties seen :[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 0, 1, 1, 0, 1]
// Phase 1: matrix 42 rows 80 cols
[2020-06-04 02:48:55] [INFO ] Computed 40 place invariants in 6 ms
[2020-06-04 02:48:55] [INFO ] [Real]Absence check using 40 positive place invariants in 46 ms returned sat
[2020-06-04 02:48:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 02:48:55] [INFO ] [Real]Absence check using state equation in 71 ms returned sat
[2020-06-04 02:48:55] [INFO ] Computed and/alt/rep : 40/40/40 causal constraints in 6 ms.
[2020-06-04 02:48:55] [INFO ] Added : 19 causal constraints over 4 iterations in 82 ms. Result :sat
[2020-06-04 02:48:55] [INFO ] [Real]Absence check using 40 positive place invariants in 25 ms returned sat
[2020-06-04 02:48:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 02:48:55] [INFO ] [Real]Absence check using state equation in 165 ms returned sat
[2020-06-04 02:48:55] [INFO ] Computed and/alt/rep : 40/40/40 causal constraints in 15 ms.
[2020-06-04 02:48:55] [INFO ] Added : 34 causal constraints over 7 iterations in 92 ms. Result :sat
[2020-06-04 02:48:55] [INFO ] [Real]Absence check using 40 positive place invariants in 12 ms returned sat
[2020-06-04 02:48:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 02:48:56] [INFO ] [Real]Absence check using state equation in 37 ms returned sat
[2020-06-04 02:48:56] [INFO ] Computed and/alt/rep : 40/40/40 causal constraints in 3 ms.
[2020-06-04 02:48:56] [INFO ] Added : 28 causal constraints over 6 iterations in 42 ms. Result :sat
[2020-06-04 02:48:56] [INFO ] Flatten gal took : 63 ms
[2020-06-04 02:48:56] [INFO ] Flatten gal took : 11 ms
[2020-06-04 02:48:56] [INFO ] Export to MCC properties in file /home/mcc/execution/CTLFireability.sr.xml took 8 ms.
[2020-06-04 02:48:56] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 12 ms.
info: Time: 3600 - MCC
vrfy: Checking CTLFireability @ ResAllocation-PT-R020C002 @ 3570 seconds

FORMULA ResAllocation-PT-R020C002-CTLFireability-02 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ResAllocation-PT-R020C002-CTLFireability-08 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ResAllocation-PT-R020C002-CTLFireability-01 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ResAllocation-PT-R020C002-CTLFireability-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ResAllocation-PT-R020C002-CTLFireability-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ResAllocation-PT-R020C002-CTLFireability-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ResAllocation-PT-R020C002-CTLFireability-05 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ResAllocation-PT-R020C002-CTLFireability-00 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ResAllocation-PT-R020C002-CTLFireability-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ResAllocation-PT-R020C002-CTLFireability-04 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ResAllocation-PT-R020C002-CTLFireability-07 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ResAllocation-PT-R020C002-CTLFireability-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ResAllocation-PT-R020C002-CTLFireability-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ResAllocation-PT-R020C002-CTLFireability-09 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ResAllocation-PT-R020C002-CTLFireability-06 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ResAllocation-PT-R020C002-CTLFireability-03 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 3469
rslt: Output for CTLFireability @ ResAllocation-PT-R020C002

{
"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=CTLFireability.xml",
"--mcc",
"--donotcomputecapacities",
"--encoder=simplecompressed",
"--safe",
"--check=modelchecking",
"--stubborn=tarjan",
"--stateequation=par",
"--quickchecks",
"--timelimit=3570",
"--localtimelimit=0",
"--preference=force_ctl",
"--json=CTLFireability.json",
"--jsoninclude=formula,formulastat,net"
],
"starttime": "Thu Jun 4 02:48:56 2020
",
"timelimit": 3570
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 222
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 1,
"F": 0,
"G": 0,
"U": 1,
"X": 1,
"aconj": 4,
"adisj": 2,
"aneg": 0,
"comp": 15,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 15,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 15,
"visible_transitions": 0
},
"processed": "E(AX(((p35 <= 0) OR (p75 <= 0) OR (p76 <= 0))) U ((1 <= p8) AND (1 <= p11) AND (((1 <= p29) AND (1 <= p69) AND (1 <= p70)) OR ((1 <= p25) AND (1 <= p65) AND (1 <= p66)) OR ((1 <= p3) AND (1 <= p43) AND (1 <= p44) AND (1 <= p40)))))",
"processed_size": 235,
"rewrites": 37
},
"net":
{
"conflict_clusters": 22,
"singleton_clusters": 0
},
"result":
{
"edges": 9961472,
"markings": 1835008,
"produced_by": "CTL model checker",
"value": false
},
"task":
{
"compoundnumber": 0,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 253
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"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": "((p24 <= 0) OR (p27 <= 0))",
"processed_size": 27,
"rewrites": 39
},
"result":
{
"edges": 43,
"markings": 43,
"produced_by": "state space /EFEG",
"value": false
},
"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": "eventual_occurrence_from_all_states",
"workflow": "stateequation"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 295
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 3,
"adisj": 1,
"aneg": 1,
"comp": 10,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 10,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 10,
"visible_transitions": 0
},
"processed": "((p37 <= 0) OR (p77 <= 0) OR (p78 <= 0) OR (p11 <= 0) OR (p51 <= 0) OR (p52 <= 0) OR (((p20 <= 0) OR (p23 <= 0)) AND ((p16 <= 0) OR (p19 <= 0))))",
"processed_size": 153,
"rewrites": 39
},
"result":
{
"edges": 66846720,
"markings": 11534336,
"produced_by": "parallel",
"value": false
},
"task":
{
"compoundnumber": 4,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "tscc preserving/always up"
}
},
"stateequation":
{
"literals": 14,
"problems": 10
},
"store":
{
"type": "dfs/tscc"
},
"type": "possible_invariance",
"workflow": "stateequation"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 315
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 3,
"adisj": 2,
"aneg": 0,
"comp": 10,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 10,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 10,
"visible_transitions": 0
},
"processed": "(((p34 <= 0) OR (p37 <= 0)) AND ((p10 <= 0) OR (p13 <= 0) OR ((1 <= p11) AND (1 <= p51) AND (1 <= p52)) OR ((1 <= p5) AND (1 <= p45) AND (1 <= p46))))",
"processed_size": 154,
"rewrites": 38
},
"result":
{
"edges": 174,
"markings": 174,
"produced_by": "state space / EG",
"value": false
},
"task":
{
"compoundnumber": 5,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 16
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 38,
"problems": 10
},
"type": "eventual_occurrence",
"workflow": "stateequation"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 347
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 2,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 1,
"aneg": 0,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "EG((EF(((1 <= p6) AND (1 <= p9))) AND ((p16 <= 0) OR (p19 <= 0))))",
"processed_size": 67,
"rewrites": 37
},
"net":
{
"conflict_clusters": 22,
"singleton_clusters": 0
},
"result":
{
"edges": 310593,
"markings": 95054,
"produced_by": "CTL model checker",
"value": true
},
"task":
{
"compoundnumber": 6,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 385
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 3,
"E": 0,
"F": 2,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"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": "AF(AG(AF(((1 <= p39) AND (1 <= p79)))))",
"processed_size": 39,
"rewrites": 38
},
"net":
{
"conflict_clusters": 22,
"singleton_clusters": 0
},
"result":
{
"edges": 3008,
"markings": 2357,
"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"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 434
},
"formula":
{
"count":
{
"A": 1,
"E": 2,
"F": 0,
"G": 2,
"U": 1,
"X": 0,
"aconj": 2,
"adisj": 2,
"aneg": 0,
"comp": 9,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 9,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 9,
"visible_transitions": 0
},
"processed": "A(EG((((1 <= p25) AND (1 <= p65) AND (1 <= p66)) OR ((1 <= p13) AND (1 <= p53) AND (1 <= p54)))) U EG(((p11 <= 0) OR (p51 <= 0) OR (p52 <= 0))))",
"processed_size": 147,
"rewrites": 38
},
"net":
{
"conflict_clusters": 22,
"singleton_clusters": 0
},
"result":
{
"edges": 133,
"markings": 133,
"produced_by": "CTL model checker",
"value": true
},
"task":
{
"compoundnumber": 8,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 496
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 3,
"F": 2,
"G": 1,
"U": 0,
"X": 0,
"aconj": 3,
"adisj": 1,
"aneg": 0,
"comp": 14,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 14,
"taut": 0,
"tconj": 1,
"tdisj": 6,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 11,
"visible_transitions": 0
},
"processed": "EG((EF((((1 <= p6) AND (1 <= p9)) OR ((1 <= p33) AND (1 <= p73) AND (1 <= p74)))) AND (EF(((1 <= p21) AND (1 <= p61) AND (1 <= p62))) OR ((p21 <= 0) OR ((p61 <= 0) OR ((p62 <= 0) OR ((p23 <= 0) OR ((p63 <= 0) OR (p64 <= 0)))))))))",
"processed_size": 231,
"rewrites": 38
},
"net":
{
"conflict_clusters": 22,
"singleton_clusters": 0
},
"result":
{
"edges": 1017,
"markings": 211,
"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": 578
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 0,
"G": 0,
"U": 1,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"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": "E (((1 <= p1) U ((1 <= p24) AND (1 <= p27))))",
"processed_size": 45,
"rewrites": 38
},
"result":
{
"edges": 2621440,
"markings": 524288,
"produced_by": "state space /EU",
"value": false
},
"task":
{
"compoundnumber": 10,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "eu preserving",
"visible": 2
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 2,
"problems": 2
},
"type": "existential_until",
"workflow": "stateequation"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 694
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"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": "((1 <= p25) AND (1 <= p65) AND (1 <= p66))",
"processed_size": 42,
"rewrites": 38
},
"result":
{
"edges": 219,
"markings": 211,
"produced_by": "state space /EGEF",
"value": true
},
"task":
{
"compoundnumber": 11,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving",
"visible": 2
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 3,
"problems": 3
},
"type": "possible_preservation_of_reachability",
"workflow": "stateequation"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 867
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"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": "((1 <= p25) AND (1 <= p65) AND (1 <= p66))",
"processed_size": 42,
"rewrites": 35
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 12,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1156
},
"formula":
{
"count":
{
"A": 1,
"E": 1,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"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": "EG(AF(((p28 <= 0) OR (p31 <= 0))))",
"processed_size": 35,
"rewrites": 37
},
"net":
{
"conflict_clusters": 22,
"singleton_clusters": 0
},
"result":
{
"edges": 422,
"markings": 211,
"produced_by": "CTL model checker",
"value": true
},
"task":
{
"compoundnumber": 13,
"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": true
},
"task":
{
"compoundnumber": 12,
"type": "boolean"
}
},

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

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

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3469
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"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": "E (G (((1 <= p23) AND (1 <= p63) AND (1 <= p64))))",
"processed_size": 50,
"rewrites": 36
},
"result":
{
"edges": 0,
"markings": 1,
"produced_by": "state space / EG",
"value": false
},
"task":
{
"compoundnumber": 15,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 5
},
"threads": 1,
"type": "dfs"
},
"type": "possible_preservation",
"workflow": "stateequation"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 13,
"type": "boolean"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1734
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 0,
"U": 1,
"X": 0,
"aconj": 1,
"adisj": 1,
"aneg": 0,
"comp": 6,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 6,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 6,
"visible_transitions": 0
},
"processed": "A ((((p29 <= 0) OR (p69 <= 0) OR (p70 <= 0)) U ((1 <= p33) AND (1 <= p73) AND (1 <= p74))))",
"processed_size": 93,
"rewrites": 40
},
"result":
{
"edges": 158,
"markings": 159,
"produced_by": "state space /ER",
"value": false
},
"task":
{
"compoundnumber": 14,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl",
"visible": 5
},
"threads": 1,
"type": "dfs"
},
"type": "universal_until",
"workflow": "stateequation"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 14,
"type": "boolean"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3469
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "((1 <= p27) AND (1 <= p67) AND (1 <= p68))",
"processed_size": 42,
"rewrites": 38
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 15,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": null
},
"task":
{
"compoundnumber": 15,
"type": "boolean"
}
},

{
"child":
[

{
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "((1 <= p27) AND (1 <= p67) AND (1 <= p68))",
"processed_size": 42,
"rewrites": 38
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 16,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 2,
"adisj": 1,
"aneg": 1,
"comp": 6,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 6,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 6,
"visible_transitions": 0
},
"processed": "(((p21 <= 0) OR (p61 <= 0) OR (p62 <= 0)) AND ((p35 <= 0) OR (p75 <= 0) OR (p76 <= 0)))",
"processed_size": 91,
"rewrites": 38
},
"result":
{
"edges": 174,
"markings": 175,
"produced_by": "state space / EG",
"value": false
},
"task":
{
"compoundnumber": 17,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 10
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 6,
"problems": 2
},
"type": "eventual_occurrence",
"workflow": "stateequation"
}
}
],
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 16,
"type": "boolean"
}
}
],
"exit":
{
"error": null,
"memory": 36016,
"runtime": 101.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "CTLFireability.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "A(F(A(G(A(F(**)))))) : A(G(A(F(*)))) : E((A(X(**)) U **)) : (A(F(**)) OR (E(F(**)) AND (** AND (** AND **)))) : E(G((E(F(**)) AND (E(F(**)) OR (** OR (** OR (** OR (** OR (** OR **))))))))) : E(G((E(F(**)) AND **))) : (E(F(**)) AND A((** U **))) : E((** U **)) : E(G(*)) : (A(F(**)) OR (E(G(**)) OR **)) : A((E(G(**)) U E(G(**)))) : A(F(**)) : (E(G(A(F(*)))) OR **) : E(F(A(G(**)))) : E(G(E(F(**)))) : A(F(*))"
},
"net":
{
"arcs": 200,
"conflict_clusters": 22,
"places": 80,
"places_significant": 40,
"singleton_clusters": 0,
"transitions": 42
},
"result":
{
"preliminary_value": "no no no no yes yes no no yes no yes no yes no yes no ",
"value": "no no no no yes yes no no yes no yes no 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: 122/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 80
lola: finding significant places
lola: 80 places, 42 transitions, 40 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 CTLFireability.xml
lola: A (F (A (G (A (F (((1 <= p39) AND (1 <= p79)))))))) : NOT(E (F (E (G (((p24 <= 0) OR (p27 <= 0))))))) : E ((A (X (((p35 <= 0) OR (p75 <= 0) OR (p76 <= 0)))) U ((1 <= p8) AND (1 <= p11) AND (((1 <= p29) AND (1 <= p69) AND (1 <= p70)) OR ((1 <= p25) AND (1 <= p65) AND (1 <= p66)) OR ((1 <= p3) AND (1 <= p43) AND (1 <= p44) AND (1 <= p40)))))) : (A (F ((((1 <= p21) AND (1 <= p61) AND (1 <= p62)) OR ((1 <= p35) AND (1 <= p75) AND (1 <= p76))))) OR (((E (F (((1 <= p33) AND (1 <= p73) AND (1 <= p74)))) AND (1 <= p27)) AND (1 <= p67)) AND (1 <= p68))) : E (G ((E (F ((((1 <= p6) AND (1 <= p9)) OR ((1 <= p33) AND (1 <= p73) AND (1 <= p74))))) AND ((((((E (F (((1 <= p21) AND (1 <= p61) AND (1 <= p62)))) OR (p21 <= 0)) OR (p61 <= 0)) OR (p62 <= 0)) OR (p23 <= 0)) OR (p63 <= 0)) OR (p64 <= 0))))) : E (G ((E (F (((1 <= p6) AND (1 <= p9)))) AND ((p16 <= 0) OR (p19 <= 0))))) : (E (F (((((p32 <= 0) OR (p35 <= 0)) AND ((p27 <= 0) OR (p67 <= 0) OR (p68 <= 0))) OR ((1 <= p26) AND (1 <= p29))))) AND A ((((p29 <= 0) OR (p69 <= 0) OR (p70 <= 0)) U ((1 <= p33) AND (1 <= p73) AND (1 <= p74))))) : E (((1 <= p1) U ((1 <= p24) AND (1 <= p27)))) : NOT(A ((((p16 <= 0) OR (p19 <= 0) OR (p59 <= 0) OR (p60 <= 0)) U A (F ((1 <= p40)))))) : ((A (F (((1 <= p0) AND (1 <= p3)))) OR E (G (((1 <= p23) AND (1 <= p63) AND (1 <= p64))))) OR ((1 <= p2) AND (1 <= p5))) : A ((E (G ((((1 <= p25) AND (1 <= p65) AND (1 <= p66)) OR ((1 <= p13) AND (1 <= p53) AND (1 <= p54))))) U E (G (((p11 <= 0) OR (p51 <= 0) OR (p52 <= 0)))))) : A (F (((1 <= p32) AND (1 <= p35)))) : (E (G (NOT(E (G (((1 <= p28) AND (1 <= p31))))))) OR ((1 <= p25) AND (1 <= p65) AND (1 <= p66))) : E (F (A (G (((1 <= p37) AND (1 <= p77) AND (1 <= p78) AND (1 <= p11) AND (1 <= p51) AND (1 <= p52) AND (((1 <= p20) AND (1 <= p23)) OR ((1 <= p16) AND (1 <= p19)))))))) : E (G (E (F (E (F (((1 <= p25) AND (1 <= p65) AND (1 <= p66)))))))) : NOT(E (G ((((p34 <= 0) OR (p37 <= 0)) AND ((p10 <= 0) OR (p13 <= 0) OR ((1 <= p11) AND (1 <= p51) AND (1 <= p52)) OR ((1 <= p5) AND (1 <= p45) AND (1 <= p46)))))))
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:470
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:401
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 222 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E ((A (X (((p35 <= 0) OR (p75 <= 0) OR (p76 <= 0)))) U ((1 <= p8) AND (1 <= p11) AND (((1 <= p29) AND (1 <= p69) AND (1 <= p70)) OR ((1 <= p25) AND (1 <= p65) AND (1 <= p66)) OR ((1 <= p3) AND (1 <= p43) AND (1 <= p44) AND (1 <= p40))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:812
lola: rewrite Frontend/Parser/formula_rewrite.k:809
lola: processed formula: E(AX(((p35 <= 0) OR (p75 <= 0) OR (p76 <= 0))) U ((1 <= p8) AND (1 <= p11) AND (((1 <= p29) AND (1 <= p69) AND (1 <= p70)) OR ((1 <= p25) AND (1 <= p65) AND (1 <= p66)) OR ((1 <= p3) AND (1 <= p43) AND (1 <= p44) AND (1 <= p40)))))
lola: processed formula length: 235
lola: 37 rewrites
lola: closed formula file CTLFireability.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: 968280 markings, 4405216 edges, 193656 markings/sec, 0 secs
lola: 1693242 markings, 6975236 edges, 144992 markings/sec, 5 secs
lola: 1834825 markings, 9530303 edges, 28317 markings/sec, 10 secs
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 1835008 markings, 9961472 edges
lola: ========================================
lola: subprocess 1 will run for 236 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G ((p40 <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation
lola: rewrite Frontend/Parser/formula_rewrite.k:583
lola: processed formula: E (G ((p40 <= 0)))
lola: processed formula length: 18
lola: 36 rewrites
lola: closed formula file CTLFireability.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:788
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (1 <= p40)
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 / EG
lola: The predicate is possibly preserved.
lola: 192 markings, 191 edges
lola: ========================================
lola: subprocess 2 will run for 253 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (A (F (((1 <= p24) AND (1 <= p27))))))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence from all states
lola: rewrite Frontend/Parser/formula_rewrite.k:599
lola: rewrite Frontend/Parser/formula_rewrite.k:634
lola: rewrite Frontend/Parser/formula_rewrite.k:734
lola: rewrite Frontend/Parser/formula_rewrite.k:788
lola: processed formula: ((p24 <= 0) OR (p27 <= 0))
lola: processed formula length: 27
lola: 39 rewrites
lola: closed formula file CTLFireability.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:700
lola: state equation task get result rewrite finished id 0
lola: state equation task get result started, id 1
lola: state equation task get result unparse finished++ id 0
lola: SUBRESULT
lola: result: no
lola: produced by: state space /EFEG
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: formula 0: ((1 <= p24) AND (1 <= p27))
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 0
lola: The predicate does not eventually occur from all states.
lola: state equation task get result unparse finished++ id 1
lola: 43 markings, 43 edges
lola: ========================================
lola: subprocess 3 will run for 273 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (((1 <= p32) AND (1 <= p35))))
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: ((p32 <= 0) OR (p35 <= 0))
lola: processed formula length: 27
lola: 38 rewrites
lola: closed formula file CTLFireability.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: SUBRESULT
lola: result: no
lola: produced by: state space / EG
lola: formula 0: ((1 <= p32) AND (1 <= p35))
lola: state equation task get result unparse finished id 0
lola: The predicate does not eventually occur.
lola: 24 markings, 24 edges
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: ========================================
lola: subprocess 4 will run for 295 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (A (G (((1 <= p37) AND (1 <= p77) AND (1 <= p78) AND (1 <= p11) AND (1 <= p51) AND (1 <= p52) AND (((1 <= p20) AND (1 <= p23)) OR ((1 <= p16) AND (1 <= p19))))))))
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:787
lola: processed formula: ((p37 <= 0) OR (p77 <= 0) OR (p78 <= 0) OR (p11 <= 0) OR (p51 <= 0) OR (p52 <= 0) OR (((p20 <= 0) OR (p23 <= 0)) AND ((p16 <= 0) OR (p19 <= 0))))
lola: processed formula length: 153
lola: 39 rewrites
lola: closed formula file CTLFireability.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: state equation task get result started, id 1
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: state equation task get result rewrite finished id 1
lola: formula 0: ((1 <= p37) AND (1 <= p77) AND (1 <= p78) AND (1 <= p11) AND (1 <= p51) AND (1 <= p52) AND (((1 <= p20) AND (1 <= p23)) OR ((1 <= p16) AND (1 <= p19))))
lola: state equation task get result unparse finished++ id 1
lola: state equation task get result unparse finished id 0
lola: formula 1: ((p37 <= 0) OR (p77 <= 0) OR (p78 <= 0) OR (p11 <= 0) OR (p51 <= 0) OR (p52 <= 0) OR (((p20 <= 0) OR (p23 <= 0)) AND ((p16 <= 0) OR (p19 <= 0))))
lola: state equation: Generated DNF with 16 literals and 2 conjunctive subformulas
lola: state equation task get result unparse finished id 1
lola: state equation: Generated DNF with 14 literals and 10 conjunctive subformulas
lola: state equation: write sara problem file to CTLFireability-4-0.sara
lola: state equation: write sara problem file to CTLFireability-4-1.sara
lola: state equation: calling and running sara
lola: state equation: calling and running sara
sara: try reading problem file CTLFireability-4-0.sara.
sara: place or transition ordering is non-deterministic
sara: try reading problem file CTLFireability-4-1.sara.
sara: place or transition ordering is non-deterministic

lola: state equation 1: solution produced
lola: sara is running 0 secs || sara is running 0 secs || 905697 markings, 3894567 edges, 181139 markings/sec, 0 secs
lola: sara is running 5 secs || sara is running 5 secs || 1627420 markings, 7490452 edges, 144345 markings/sec, 5 secs
lola: sara is running 10 secs || sara is running 10 secs || 2318427 markings, 11096727 edges, 138201 markings/sec, 10 secs
lola: sara is running 15 secs || sara is running 15 secs || 2991640 markings, 14726211 edges, 134643 markings/sec, 15 secs
lola: sara is running 20 secs || sara is running 20 secs || 3762440 markings, 18997708 edges, 154160 markings/sec, 20 secs
lola: sara is running 25 secs || sara is running 25 secs || 4736479 markings, 24473919 edges, 194808 markings/sec, 25 secs
lola: sara is running 30 secs || sara is running 30 secs || 5683713 markings, 29853963 edges, 189447 markings/sec, 30 secs
lola: sara is running 35 secs || sara is running 35 secs || 6602802 markings, 35104113 edges, 183818 markings/sec, 35 secs
lola: sara is running 40 secs || sara is running 40 secs || 7456584 markings, 40098615 edges, 170756 markings/sec, 40 secs
lola: sara is running 45 secs || sara is running 45 secs || 8308180 markings, 44932458 edges, 170319 markings/sec, 45 secs
lola: sara is running 50 secs || sara is running 50 secs || 9159328 markings, 49756343 edges, 170230 markings/sec, 50 secs
lola: sara is running 55 secs || sara is running 55 secs || 9437046 markings, 54079421 edges, 55544 markings/sec, 55 secs
lola: sara is running 60 secs || sara is running 60 secs || 10207773 markings, 58586849 edges, 154145 markings/sec, 60 secs
lola: sara is running 65 secs || sara is running 65 secs || 11030641 markings, 62378783 edges, 164574 markings/sec, 65 secs
lola: sara is running 70 secs || sara is running 70 secs || 11533696 markings, 65616486 edges, 100611 markings/sec, 70 secs
lola: SUBRESULT
lola: result: no
lola: produced by: parallel
lola: The predicate is not possibly invariant.
lola: 11534336 markings, 66846720 edges
lola: ========================================
lola: subprocess 5 will run for 315 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F ((((1 <= p34) AND (1 <= p37)) OR ((1 <= p10) AND (1 <= p13) AND ((p11 <= 0) OR (p51 <= 0) OR (p52 <= 0)) AND ((p5 <= 0) OR (p45 <= 0) OR (p46 <= 0))))))
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:788
lola: processed formula: (((p34 <= 0) OR (p37 <= 0)) AND ((p10 <= 0) OR (p13 <= 0) OR ((1 <= p11) AND (1 <= p51) AND (1 <= p52)) OR ((1 <= p5) AND (1 <= p45) AND (1 <= p46))))
lola: processed formula length: 154
lola: 38 rewrites
lola: closed formula file CTLFireability.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: SUBRESULT
lola: result: no
lola: produced by: state space / EG
lola: state equation task get result unparse finished++ id 0
lola: The predicate does not eventually occur.
lola: formula 0: (((1 <= p34) AND (1 <= p37)) OR ((1 <= p10) AND (1 <= p13) AND ((p11 <= 0) OR (p51 <= 0) OR (p52 <= 0)) AND ((p5 <= 0) OR (p45 <= 0) OR (p46 <= 0))))
lola: 174 markings, 174 edges
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 38 literals and 10 conjunctive subformulas
lola: ========================================
lola: subprocess 6 will run for 347 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G ((E (F (((1 <= p6) AND (1 <= p9)))) AND ((p16 <= 0) OR (p19 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:806
lola: rewrite Frontend/Parser/formula_rewrite.k:808
lola: processed formula: EG((EF(((1 <= p6) AND (1 <= p9))) AND ((p16 <= 0) OR (p19 <= 0))))
lola: processed formula length: 67
lola: 37 rewrites
lola: closed formula file CTLFireability.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: 95054 markings, 310593 edges
lola: ========================================
lola: subprocess 7 will run for 385 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (A (G (A (F (((1 <= p39) AND (1 <= p79))))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:811
lola: rewrite Frontend/Parser/formula_rewrite.k:813
lola: rewrite Frontend/Parser/formula_rewrite.k:811
lola: processed formula: AF(AG(AF(((1 <= p39) AND (1 <= p79)))))
lola: processed formula length: 39
lola: 38 rewrites
lola: closed formula file CTLFireability.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 3 significant temporal operators and needs 13 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: 2357 markings, 3008 edges
lola: ========================================
lola: subprocess 8 will run for 434 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A ((E (G ((((1 <= p25) AND (1 <= p65) AND (1 <= p66)) OR ((1 <= p13) AND (1 <= p53) AND (1 <= p54))))) U E (G (((p11 <= 0) OR (p51 <= 0) OR (p52 <= 0))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:808
lola: rewrite Frontend/Parser/formula_rewrite.k:808
lola: rewrite Frontend/Parser/formula_rewrite.k:814
lola: processed formula: A(EG((((1 <= p25) AND (1 <= p65) AND (1 <= p66)) OR ((1 <= p13) AND (1 <= p53) AND (1 <= p54)))) U EG(((p11 <= 0) OR (p51 <= 0) OR (p52 <= 0))))
lola: processed formula length: 147
lola: 38 rewrites
lola: closed formula file CTLFireability.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 3 significant temporal operators and needs 13 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: 133 markings, 133 edges
lola: ========================================
lola: subprocess 9 will run for 496 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G ((E (F ((((1 <= p6) AND (1 <= p9)) OR ((1 <= p33) AND (1 <= p73) AND (1 <= p74))))) AND (E (F (((1 <= p21) AND (1 <= p61) AND (1 <= p62)))) OR ((p21 <= 0) OR ((p61 <= 0) OR ((p62 <= 0) OR ((p23 <= 0) OR ((p63 <= 0) OR (p64 <= 0))))))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:806
lola: rewrite Frontend/Parser/formula_rewrite.k:806
lola: rewrite Frontend/Parser/formula_rewrite.k:808
lola: processed formula: EG((EF((((1 <= p6) AND (1 <= p9)) OR ((1 <= p33) AND (1 <= p73) AND (1 <= p74)))) AND (EF(((1 <= p21) AND (1 <= p61) AND (1 <= p62))) OR ((p21 <= 0) OR ((p61 <= 0) OR ((p62 <= 0) OR ((p23 <= 0) OR ((p63 <= 0) OR (p64 <= 0)))))))))
lola: processed formula length: 231
lola: 38 rewrites
lola: closed formula file CTLFireability.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 3 significant temporal operators and needs 13 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: 211 markings, 1017 edges
lola: ========================================
lola: subprocess 10 will run for 578 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (((1 <= p1) U ((1 <= p24) AND (1 <= p27))))
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 ((1 <= p24) AND (1 <= p27))))
lola: processed formula length: 45
lola: 38 rewrites
lola: closed formula file CTLFireability.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: ((1 <= p24) AND (1 <= p27))
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 CTLFireability-10-0.sara
lola: state equation: calling and running sara
sara: try reading problem file CTLFireability-10-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 space /EU
lola: There is no path where Predicate Phi holds until Predicate Psi.
lola: 524288 markings, 2621440 edges
lola: ========================================
lola: subprocess 11 will run for 694 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G (E (F (((1 <= p25) AND (1 <= p65) AND (1 <= p66))))))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation of reachability
lola: rewrite Frontend/Parser/formula_rewrite.k:593
lola: rewrite Frontend/Parser/formula_rewrite.k:628
lola: rewrite Frontend/Parser/formula_rewrite.k:731
lola: processed formula: ((1 <= p25) AND (1 <= p65) AND (1 <= p66))
lola: processed formula length: 42
lola: 38 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /EGEF)
lola: state space: using reachability graph (EGEF version) (--search=depth)
lola: state space: using ctl preserving stubborn set method (--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 unparse finished++ id 0
lola: formula 0: ((p25 <= 0) OR (p65 <= 0) OR (p66 <= 0))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 3 literals and 3 conjunctive subformulas
lola: state equation task get result started, id 1
lola: SUBRESULT
lola: result: yes
lola: produced by: state space /EGEF
lola: Reachability of the predicate is possibly preserved.
lola: 211 markings, 219 edges
lola: state equation: write sara problem file to CTLFireability-11-0.sara
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 <= p25) AND (1 <= p65) AND (1 <= p66))
lola: state equation task get result unparse finished id 1
lola: state equation: Generated DNF with 3 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to CTLFireability-11-1.sara
lola: state equation: calling and running sara
sara: try reading problem file CTLFireability-11-0.sara.
sara: place or transition ordering is non-deterministic

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

lola: state equation 1: solution produced
lola: ========================================
lola: subprocess 12 will run for 867 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E (G (A (F (((p28 <= 0) OR (p31 <= 0)))))) OR ((1 <= p25) AND (1 <= p65) AND (1 <= p66)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 12 will run for 867 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((1 <= p25) AND (1 <= p65) AND (1 <= p66))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((1 <= p25) AND (1 <= p65) AND (1 <= p66))
lola: processed formula length: 42
lola: 35 rewrites
lola: closed formula file CTLFireability.xml
lola: processed formula with 3 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 13 will run for 1156 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G (A (F (((p28 <= 0) OR (p31 <= 0))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:811
lola: rewrite Frontend/Parser/formula_rewrite.k:808
lola: processed formula: EG(AF(((p28 <= 0) OR (p31 <= 0))))
lola: processed formula length: 35
lola: 37 rewrites
lola: closed formula file CTLFireability.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: 211 markings, 422 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 13 will run for 1156 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (F (((1 <= p0) AND (1 <= p3)))) OR (E (G (((1 <= p23) AND (1 <= p63) AND (1 <= p64)))) OR ((1 <= p2) AND (1 <= p5))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 13 will run for 1156 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((1 <= p2) AND (1 <= p5))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((1 <= p2) AND (1 <= p5))
lola: processed formula length: 25
lola: 35 rewrites
lola: closed formula file CTLFireability.xml
lola: processed formula with 2 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 14 will run for 1735 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (((1 <= p0) AND (1 <= p3))))
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: ((p0 <= 0) OR (p3 <= 0))
lola: processed formula length: 25
lola: 38 rewrites
lola: closed formula file CTLFireability.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 <= p0) AND (1 <= p3))
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: no
lola: produced by: state space / EG
lola: The predicate does not eventually occur.
lola: 192 markings, 192 edges
lola: state equation: write sara problem file to CTLFireability-14-0.sara
lola: state equation: calling and running sara
lola: ========================================
lola: subprocess 15 will run for 3469 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G (((1 <= p23) AND (1 <= p63) AND (1 <= p64))))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation
lola: rewrite Frontend/Parser/formula_rewrite.k:583
lola: processed formula: E (G (((1 <= p23) AND (1 <= p63) AND (1 <= p64))))
lola: processed formula length: 50
lola: 36 rewrites
lola: closed formula file CTLFireability.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: SUBRESULT
lola: result: no
lola: produced by: state space / EG
lola: The predicate is not possibly preserved.
lola: 1 markings, 0 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
sara: try reading problem file CTLFireability-14-0.sara.
lola: ========================================
lola: subprocess 14 will run for 1734 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E (F (((((p32 <= 0) OR (p35 <= 0)) AND ((p27 <= 0) OR (p67 <= 0) OR (p68 <= 0))) OR ((1 <= p26) AND (1 <= p29))))) AND A ((((p29 <= 0) OR (p69 <= 0) OR (p70 <= 0)) U ((1 <= p33) AND (1 <= p73) AND (1 <= p74)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 14 will run for 1734 seconds at most (--localtimelimit=0)
lola: ========================================
lola: sara: place or transition ordering is non-deterministic
...considering subproblem: A ((((p29 <= 0) OR (p69 <= 0) OR (p70 <= 0)) U ((1 <= p33) AND (1 <= p73) AND (1 <= p74))))
lola: ========================================
lola: SUBTASK
lola: checking universal until
lola: rewrite Frontend/Parser/formula_rewrite.k:577
lola: rewrite Frontend/Parser/formula_rewrite.k:735
lola: rewrite Frontend/Parser/formula_rewrite.k:695
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: A ((((p29 <= 0) OR (p69 <= 0) OR (p70 <= 0)) U ((1 <= p33) AND (1 <= p73) AND (1 <= p74))))
lola: processed formula length: 93
lola: 40 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /ER)
lola: state space: using reachability graph (ER version) (--search=depth)
lola: state space: using ltl preserving stubborn set method (--stubborn=tarjan)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: 1
lola: SUBRESULT
lola: result: no
lola: produced by: state space /ER
lola: Predicate Phi does not hild until Predicate Psi on all paths.
lola: 159 markings, 158 edges

lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 15 will run for 3469 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (F ((((1 <= p21) AND (1 <= p61) AND (1 <= p62)) OR ((1 <= p35) AND (1 <= p75) AND (1 <= p76))))) OR (E (F (((1 <= p33) AND (1 <= p73) AND (1 <= p74)))) AND ((1 <= p27) AND ((1 <= p67) AND (1 <= p68)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 15 will run for 3469 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((1 <= p27) AND ((1 <= p67) AND (1 <= p68)))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: rewrite Frontend/Parser/formula_rewrite.k:793
lola: rewrite Frontend/Parser/formula_rewrite.k:793
lola: rewrite Frontend/Parser/formula_rewrite.k:794
lola: processed formula: ((1 <= p27) AND (1 <= p67) AND (1 <= p68))
lola: processed formula length: 42
lola: 38 rewrites
lola: closed formula file CTLFireability.xml
lola: processed formula with 3 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: SUBRESULT
lola: result: unknown
lola: The Boolean predicate may be true or false.
lola: ========================================
lola: ========================================
lola: ...considering subproblem: (A (F ((((1 <= p21) AND (1 <= p61) AND (1 <= p62)) OR ((1 <= p35) AND (1 <= p75) AND (1 <= p76))))) OR (E (F (((1 <= p33) AND (1 <= p73) AND (1 <= p74)))) AND ((1 <= p27) AND ((1 <= p67) AND (1 <= p68)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: ...considering subproblem: ((1 <= p27) AND ((1 <= p67) AND (1 <= p68)))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: rewrite Frontend/Parser/formula_rewrite.k:793
lola: rewrite Frontend/Parser/formula_rewrite.k:793
lola: rewrite Frontend/Parser/formula_rewrite.k:794
lola: processed formula: ((1 <= p27) AND (1 <= p67) AND (1 <= p68))
lola: processed formula length: 42
lola: 38 rewrites
lola: closed formula file CTLFireability.xml
lola: processed formula with 3 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: A (F ((((1 <= p21) AND (1 <= p61) AND (1 <= p62)) OR ((1 <= p35) AND (1 <= p75) AND (1 <= p76)))))
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: (((p21 <= 0) OR (p61 <= 0) OR (p62 <= 0)) AND ((p35 <= 0) OR (p75 <= 0) OR (p76 <= 0)))
lola: processed formula length: 91
lola: 38 rewrites
lola: closed formula file CTLFireability.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 <= p21) AND (1 <= p61) AND (1 <= p62)) OR ((1 <= p35) AND (1 <= p75) AND (1 <= p76)))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 6 literals and 2 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space / EG
lola: The predicate does not eventually occur.
lola: 175 markings, 174 edges
lola: state equation: write sara problem file to CTLFireability-17-0.sara
lola: state equation: calling and running sara
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
sara: try reading problem file CTLFireability-17-0.sara.
lola: ========================================
sara: place or transition ordering is non-deterministic
lola: RESULT
lola:
SUMMARY: no no no no yes yes no no yes no yes no yes no yes no
lola:
preliminary result: no no no no yes yes no no yes no yes no yes no yes no

lola: memory consumption: 36016 KB
lola: time consumption: 101 seconds
lola: print data as JSON (--json)
lola: writing JSON to CTLFireability.json
lola: closed JSON file CTLFireability.json
rslt: finished
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16427332 kB
MemFree: 14522728 kB
After kill :
MemTotal: 16427332 kB
MemFree: 14522408 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="ResAllocation-PT-R020C002"
export BK_EXAMINATION="CTLFireability"
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 ResAllocation-PT-R020C002, examination is CTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r194-csrt-159033390400724"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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