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.r211-tajo-159033477700644.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 ShieldPPPt-PT-005B, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r211-tajo-159033477700644
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 280K
-rw-r--r-- 1 mcc users 4.2K May 14 01:52 CTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 14 01:52 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.8K May 13 19:18 CTLFireability.txt
-rw-r--r-- 1 mcc users 21K May 13 19:18 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.3K May 14 10:03 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K May 14 10:03 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K May 14 10:03 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 14 10:03 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 May 12 20:42 NewModel
-rw-r--r-- 1 mcc users 3.8K May 13 14:06 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 20K May 13 14:06 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.8K May 13 08:50 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 17K May 13 08:50 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 13 16:53 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 13 16:53 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 12 20:42 equiv_col
-rw-r--r-- 1 mcc users 5 May 12 20:42 instance
-rw-r--r-- 1 mcc users 6 May 12 20:42 iscolored
-rw-r--r-- 1 mcc users 92K May 12 20:42 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 ShieldPPPt-PT-005B-CTLFireability-00
FORMULA_NAME ShieldPPPt-PT-005B-CTLFireability-01
FORMULA_NAME ShieldPPPt-PT-005B-CTLFireability-02
FORMULA_NAME ShieldPPPt-PT-005B-CTLFireability-03
FORMULA_NAME ShieldPPPt-PT-005B-CTLFireability-04
FORMULA_NAME ShieldPPPt-PT-005B-CTLFireability-05
FORMULA_NAME ShieldPPPt-PT-005B-CTLFireability-06
FORMULA_NAME ShieldPPPt-PT-005B-CTLFireability-07
FORMULA_NAME ShieldPPPt-PT-005B-CTLFireability-08
FORMULA_NAME ShieldPPPt-PT-005B-CTLFireability-09
FORMULA_NAME ShieldPPPt-PT-005B-CTLFireability-10
FORMULA_NAME ShieldPPPt-PT-005B-CTLFireability-11
FORMULA_NAME ShieldPPPt-PT-005B-CTLFireability-12
FORMULA_NAME ShieldPPPt-PT-005B-CTLFireability-13
FORMULA_NAME ShieldPPPt-PT-005B-CTLFireability-14
FORMULA_NAME ShieldPPPt-PT-005B-CTLFireability-15

=== Now, execution of the tool begins

BK_START 1591318336194

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-05 00:52:18] [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-05 00:52:19] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-05 00:52:19] [INFO ] Load time of PNML (sax parser for PT used): 109 ms
[2020-06-05 00:52:19] [INFO ] Transformed 393 places.
[2020-06-05 00:52:19] [INFO ] Transformed 358 transitions.
[2020-06-05 00:52:19] [INFO ] Found NUPN structural information;
[2020-06-05 00:52:19] [INFO ] Parsed PT model containing 393 places and 358 transitions in 171 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 54 ms.
Incomplete random walk after 100000 steps, including 0 resets, run finished after 293 ms. (steps per millisecond=341 ) 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, 1, 1, 1, 0, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1]
// Phase 1: matrix 358 rows 393 cols
[2020-06-05 00:52:19] [INFO ] Computed 56 place invariants in 27 ms
[2020-06-05 00:52:19] [INFO ] [Real]Absence check using 56 positive place invariants in 51 ms returned unsat
[2020-06-05 00:52:20] [INFO ] [Real]Absence check using 56 positive place invariants in 38 ms returned sat
[2020-06-05 00:52:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 00:52:21] [INFO ] [Real]Absence check using state equation in 1047 ms returned sat
[2020-06-05 00:52:21] [INFO ] Deduced a trap composed of 15 places in 564 ms
[2020-06-05 00:52:22] [INFO ] Deduced a trap composed of 20 places in 227 ms
[2020-06-05 00:52:22] [INFO ] Deduced a trap composed of 20 places in 154 ms
[2020-06-05 00:52:22] [INFO ] Deduced a trap composed of 23 places in 116 ms
[2020-06-05 00:52:24] [INFO ] Deduced a trap composed of 21 places in 1502 ms
[2020-06-05 00:52:24] [INFO ] Deduced a trap composed of 22 places in 407 ms
[2020-06-05 00:52:24] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 3239 ms
[2020-06-05 00:52:24] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 00:52:24] [INFO ] [Nat]Absence check using 56 positive place invariants in 131 ms returned sat
[2020-06-05 00:52:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-05 00:52:26] [INFO ] [Nat]Absence check using state equation in 1176 ms returned sat
[2020-06-05 00:52:26] [INFO ] Deduced a trap composed of 20 places in 259 ms
[2020-06-05 00:52:26] [INFO ] Deduced a trap composed of 19 places in 232 ms
[2020-06-05 00:52:26] [INFO ] Deduced a trap composed of 21 places in 249 ms
[2020-06-05 00:52:27] [INFO ] Deduced a trap composed of 19 places in 570 ms
[2020-06-05 00:52:27] [INFO ] Deduced a trap composed of 22 places in 138 ms
[2020-06-05 00:52:28] [INFO ] Deduced a trap composed of 20 places in 750 ms
[2020-06-05 00:52:28] [INFO ] Deduced a trap composed of 20 places in 205 ms
[2020-06-05 00:52:29] [INFO ] Deduced a trap composed of 15 places in 898 ms
[2020-06-05 00:52:29] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 3608 ms
[2020-06-05 00:52:29] [INFO ] Computed and/alt/rep : 357/533/357 causal constraints in 42 ms.
[2020-06-05 00:52:31] [INFO ] Added : 322 causal constraints over 65 iterations in 1594 ms. Result :sat
[2020-06-05 00:52:31] [INFO ] [Real]Absence check using 56 positive place invariants in 67 ms returned sat
[2020-06-05 00:52:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 00:52:31] [INFO ] [Real]Absence check using state equation in 509 ms returned sat
[2020-06-05 00:52:32] [INFO ] Deduced a trap composed of 20 places in 344 ms
[2020-06-05 00:52:32] [INFO ] Deduced a trap composed of 16 places in 110 ms
[2020-06-05 00:52:32] [INFO ] Deduced a trap composed of 21 places in 351 ms
[2020-06-05 00:52:32] [INFO ] Deduced a trap composed of 24 places in 211 ms
[2020-06-05 00:52:33] [INFO ] Deduced a trap composed of 21 places in 152 ms
[2020-06-05 00:52:33] [INFO ] Deduced a trap composed of 21 places in 234 ms
[2020-06-05 00:52:33] [INFO ] Deduced a trap composed of 15 places in 102 ms
[2020-06-05 00:52:33] [INFO ] Deduced a trap composed of 23 places in 91 ms
[2020-06-05 00:52:33] [INFO ] Deduced a trap composed of 29 places in 145 ms
[2020-06-05 00:52:33] [INFO ] Deduced a trap composed of 27 places in 164 ms
[2020-06-05 00:52:33] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 2072 ms
[2020-06-05 00:52:33] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 00:52:34] [INFO ] [Nat]Absence check using 56 positive place invariants in 127 ms returned sat
[2020-06-05 00:52:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-05 00:52:34] [INFO ] [Nat]Absence check using state equation in 559 ms returned sat
[2020-06-05 00:52:34] [INFO ] Deduced a trap composed of 15 places in 137 ms
[2020-06-05 00:52:35] [INFO ] Deduced a trap composed of 21 places in 141 ms
[2020-06-05 00:52:35] [INFO ] Deduced a trap composed of 21 places in 102 ms
[2020-06-05 00:52:35] [INFO ] Deduced a trap composed of 23 places in 168 ms
[2020-06-05 00:52:35] [INFO ] Deduced a trap composed of 24 places in 79 ms
[2020-06-05 00:52:36] [INFO ] Deduced a trap composed of 23 places in 687 ms
[2020-06-05 00:52:36] [INFO ] Deduced a trap composed of 19 places in 146 ms
[2020-06-05 00:52:36] [INFO ] Deduced a trap composed of 20 places in 128 ms
[2020-06-05 00:52:37] [INFO ] Deduced a trap composed of 23 places in 730 ms
[2020-06-05 00:52:37] [INFO ] Deduced a trap composed of 21 places in 107 ms
[2020-06-05 00:52:38] [INFO ] Deduced a trap composed of 23 places in 714 ms
[2020-06-05 00:52:38] [INFO ] Deduced a trap composed of 17 places in 93 ms
[2020-06-05 00:52:38] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 3492 ms
[2020-06-05 00:52:38] [INFO ] Computed and/alt/rep : 357/533/357 causal constraints in 19 ms.
[2020-06-05 00:52:39] [INFO ] Added : 339 causal constraints over 69 iterations in 1522 ms. Result :sat
Successfully simplified 1 atomic propositions for a total of 1 simplifications.
[2020-06-05 00:52:40] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2020-06-05 00:52:40] [INFO ] Flatten gal took : 86 ms
[2020-06-05 00:52:40] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2020-06-05 00:52:40] [INFO ] Flatten gal took : 23 ms
FORMULA ShieldPPPt-PT-005B-CTLFireability-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-06-05 00:52:40] [INFO ] Export to MCC properties in file /home/mcc/execution/CTLFireability.sr.xml took 3 ms.
[2020-06-05 00:52:40] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 6 ms.
info: Time: 3600 - MCC
vrfy: Checking CTLFireability @ ShieldPPPt-PT-005B @ 3570 seconds

FORMULA ShieldPPPt-PT-005B-CTLFireability-01 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldPPPt-PT-005B-CTLFireability-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldPPPt-PT-005B-CTLFireability-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldPPPt-PT-005B-CTLFireability-05 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldPPPt-PT-005B-CTLFireability-06 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldPPPt-PT-005B-CTLFireability-02 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldPPPt-PT-005B-CTLFireability-07 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldPPPt-PT-005B-CTLFireability-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldPPPt-PT-005B-CTLFireability-03 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldPPPt-PT-005B-CTLFireability-00 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldPPPt-PT-005B-CTLFireability-08 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldPPPt-PT-005B-CTLFireability-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldPPPt-PT-005B-CTLFireability-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldPPPt-PT-005B-CTLFireability-04 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldPPPt-PT-005B-CTLFireability-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 2129
rslt: Output for CTLFireability @ ShieldPPPt-PT-005B

{
"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",
"--check=modelchecking",
"--stubborn=tarjan",
"--stateequation=par",
"--quickchecks",
"--timelimit=3570",
"--localtimelimit=0",
"--preference=force_ctl",
"--json=CTLFireability.json",
"--jsoninclude=formula,formulastat,net"
],
"starttime": "Fri Jun 5 00:52:40 2020
",
"timelimit": 3570
},
"child":
[

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

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

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 254
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 1,
"F": 0,
"G": 0,
"U": 0,
"X": 2,
"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": "EX(AX(((1 <= p350) AND (1 <= p64))))",
"processed_size": 36,
"rewrites": 44
},
"net":
{
"conflict_clusters": 323,
"singleton_clusters": 0
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "CTL model checker",
"value": false
},
"task":
{
"compoundnumber": 1,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 297
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 2,
"adisj": 1,
"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": "A (G (((p372 <= 0) OR ((1 <= p359)) OR ((1 <= p226)))))",
"processed_size": 57,
"rewrites": 44
},
"result":
{
"edges": 16,
"markings": 17,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 3,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 3,
"problems": 3
},
"type": "invariance",
"workflow": "stateequation||search"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 1,
"type": "boolean"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 274
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 1,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "AF(EG(((1 <= p58))))",
"processed_size": 20,
"rewrites": 44
},
"net":
{
"conflict_clusters": 323,
"singleton_clusters": 0
},
"result":
{
"edges": 244,
"markings": 122,
"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"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 324
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 2,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "(((p46 <= 0)) AND ((p119 <= 0)))",
"processed_size": 32,
"rewrites": 43
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 4,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

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

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

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 324
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "E (F (((1 <= p54))))",
"processed_size": 20,
"rewrites": 43
},
"result":
{
"edges": 114,
"markings": 115,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 4,
"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": 356
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 2,
"adisj": 1,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "E (F ((((1 <= p354)) OR ((1 <= p145)))))",
"processed_size": 41,
"rewrites": 43
},
"result":
{
"edges": 54,
"markings": 55,
"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"
},
"type": "reachability",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 396
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"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": "E (F (((1 <= p275) AND (1 <= p334))))",
"processed_size": 37,
"rewrites": 43
},
"result":
{
"edges": 82,
"markings": 83,
"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"
},
"type": "reachability",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 445
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 2,
"adisj": 1,
"aneg": 1,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "(((p80 <= 0)) AND ((p42 <= 0)))",
"processed_size": 31,
"rewrites": 45
},
"result":
{
"edges": 116,
"markings": 116,
"produced_by": "state space / EG",
"value": false
},
"task":
{
"compoundnumber": 7,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 5
},
"threads": 1,
"type": "dfs"
},
"type": "eventual_occurrence",
"workflow": "stateequation"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 509
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 1,
"F": 1,
"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": "EG(AF(((1 <= p250) AND (1 <= p286))))",
"processed_size": 37,
"rewrites": 44
},
"net":
{
"conflict_clusters": 323,
"singleton_clusters": 0
},
"result":
{
"edges": 123,
"markings": 122,
"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"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 594
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 2,
"F": 1,
"G": 1,
"U": 1,
"X": 0,
"aconj": 5,
"adisj": 3,
"aneg": 0,
"comp": 7,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 7,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 7,
"visible_transitions": 0
},
"processed": "A((((p373 <= 0)) AND ((p273 <= 0)) AND (((1 <= p51)) OR ((1 <= p187) AND (1 <= p297)))) U (EF(((1 <= p211))) OR EG(((1 <= p174)))))",
"processed_size": 132,
"rewrites": 45
},
"net":
{
"conflict_clusters": 323,
"singleton_clusters": 0
},
"result":
{
"edges": 45389,
"markings": 23082,
"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": 712
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 3,
"E": 2,
"F": 3,
"G": 0,
"U": 1,
"X": 0,
"aconj": 7,
"adisj": 0,
"aneg": 3,
"comp": 9,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 9,
"taut": 0,
"tconj": 1,
"tdisj": 3,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 9,
"visible_transitions": 0
},
"processed": "(A(AF(((1 <= p22) AND (1 <= p49))) U ((1 <= p271))) AND (EF(((p311 <= 0))) OR (AF(((1 <= p90))) OR (((1 <= p77)) OR E(((p268 <= 0) OR (p270 <= 0)) R ((p11 <= 0)))))))",
"processed_size": 167,
"rewrites": 47
},
"net":
{
"conflict_clusters": 323,
"singleton_clusters": 0
},
"result":
{
"edges": 123,
"markings": 122,
"produced_by": "CTL model checker",
"value": false
},
"task":
{
"compoundnumber": 10,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 890
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 4,
"adisj": 1,
"aneg": 0,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "(((1 <= p212)) OR ((1 <= p335)) OR ((1 <= p144)) OR ((1 <= p205)))",
"processed_size": 69,
"rewrites": 42
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 11,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1187
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"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": "A (G (((p190 <= 0) OR (p237 <= 0))))",
"processed_size": 37,
"rewrites": 44
},
"result":
{
"edges": 48,
"markings": 49,
"produced_by": "state space",
"value": false
},
"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": "invariance",
"workflow": "stateequation||search"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 11,
"type": "boolean"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1187
},
"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": "((p117 <= 0) OR (p46 <= 0))",
"processed_size": 28,
"rewrites": 45
},
"result":
{
"edges": 869,
"markings": 869,
"produced_by": "state space / EG",
"value": false
},
"task":
{
"compoundnumber": 12,
"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"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 12,
"type": "boolean"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 2129
},
"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 <= p17) AND (1 <= p119))",
"processed_size": 28,
"rewrites": 45
},
"result":
{
"edges": 595,
"markings": 593,
"produced_by": "state space /EFEG",
"value": true
},
"task":
{
"compoundnumber": 14,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 2
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 2,
"problems": 2
},
"type": "reachability_of_possible_preservation",
"workflow": "stateequation"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": true
},
"task":
{
"compoundnumber": 13,
"type": "boolean"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 2129
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"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 (((p56 <= 0) OR ((1 <= p289)))))",
"processed_size": 38,
"rewrites": 43
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 14,
"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"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 2,
"aneg": 0,
"comp": 5,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 5,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "(((p322 <= 0) OR (p165 <= 0)) AND ((p99 <= 0) OR (p126 <= 0) OR (p274 <= 0)))",
"processed_size": 80,
"rewrites": 43
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 16,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"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": "A (G (((p99 <= 0) OR (p126 <= 0))))",
"processed_size": 36,
"rewrites": 44
},
"result":
{
"edges": 113,
"markings": 114,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 17,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 2,
"problems": 2
},
"type": "invariance",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "E (F (((1 <= p191) AND (1 <= p193) AND (1 <= p249) AND (1 <= p290))))",
"processed_size": 69,
"rewrites": 43
},
"result":
{
"edges": 63,
"markings": 64,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 18,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 4,
"problems": 4
},
"type": "reachability",
"workflow": "stateequation||search"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": true
},
"task":
{
"compoundnumber": 14,
"type": "boolean"
}
}
],
"exit":
{
"error": null,
"memory": 4012,
"runtime": 1441.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "CTLFireability.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "A((** U (E(F(**)) OR E(G(**))))) : (A(F(**)) AND (** OR (E(G(*)) OR (E(X(**)) OR A((** U **)))))) : E(F(**)) : E(G(A(F(**)))) : (E(F(E(G(**)))) OR E(F((** AND A(G(**)))))) : A(G(*)) : E(F(**)) : E(F(**)) : (A((A(F(**)) U **)) AND (E(F(*)) OR (A(F(**)) OR (** OR E((* R *)))))) : (E(F(**)) AND (A((** U **)) OR (E(F(**)) OR (A(G(*)) AND (** AND **))))) : (** OR (A(G(*)) AND A(F(**)))) : (E(X(A(X(**)))) OR (A(G(**)) OR (E(G(**)) AND E(X(**))))) : ((E(X(**)) OR **) AND (A(F(E(G(**)))) OR (A(G(**)) OR (E(X(**)) OR (A(F(**)) AND (** AND **)))))) : (A(F(**)) OR (A(G(**)) AND A(F(**)))) : A(F(**))"
},
"net":
{
"arcs": 896,
"conflict_clusters": 323,
"places": 393,
"places_significant": 337,
"singleton_clusters": 0,
"transitions": 358
},
"result":
{
"preliminary_value": "yes no yes no yes no yes yes no yes no no no no no ",
"value": "yes no yes no yes no yes yes no yes no no no no no "
},
"task":
{
"type": "compound"
}
}
lola: LoLA will run for 3570 seconds at most (--timelimit)
lola: NET
lola: input: PNML file (--pnml)
lola: reading net from model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file model.pnml
lola: 751/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 12576
lola: finding significant places
lola: 393 places, 358 transitions, 337 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: LP says that atomic proposition is always true: (p373 <= 1)
lola: LP says that atomic proposition is always true: (p273 <= 1)
lola: LP says that atomic proposition is always true: (p51 <= 1)
lola: LP says that atomic proposition is always true: (p187 <= 1)
lola: LP says that atomic proposition is always true: (p297 <= 1)
lola: LP says that atomic proposition is always true: (p211 <= 1)
lola: LP says that atomic proposition is always true: (p174 <= 1)
lola: LP says that atomic proposition is always true: (p5 <= 1)
lola: LP says that atomic proposition is always true: (p66 <= 1)
lola: LP says that atomic proposition is always true: (p285 <= 1)
lola: LP says that atomic proposition is always true: (p291 <= 1)
lola: LP says that atomic proposition is always true: (p14 <= 1)
lola: LP says that atomic proposition is always true: (p131 <= 1)
lola: LP says that atomic proposition is always true: (p201 <= 1)
lola: LP says that atomic proposition is always true: (p317 <= 1)
lola: LP says that atomic proposition is always true: (p96 <= 1)
lola: LP says that atomic proposition is always true: (p132 <= 1)
lola: LP says that atomic proposition is always true: (p65 <= 1)
lola: LP says that atomic proposition is always true: (p354 <= 1)
lola: LP says that atomic proposition is always true: (p145 <= 1)
lola: LP says that atomic proposition is always true: (p250 <= 1)
lola: LP says that atomic proposition is always true: (p286 <= 1)
lola: LP says that atomic proposition is always true: (p17 <= 1)
lola: LP says that atomic proposition is always true: (p119 <= 1)
lola: LP says that atomic proposition is always true: (p28 <= 1)
lola: LP says that atomic proposition is always true: (p336 <= 1)
lola: LP says that atomic proposition is always true: (p243 <= 1)
lola: LP says that atomic proposition is always true: (p125 <= 1)
lola: LP says that atomic proposition is always true: (p54 <= 1)
lola: LP says that atomic proposition is always true: (p275 <= 1)
lola: LP says that atomic proposition is always true: (p334 <= 1)
lola: LP says that atomic proposition is always true: (p22 <= 1)
lola: LP says that atomic proposition is always true: (p49 <= 1)
lola: LP says that atomic proposition is always true: (p271 <= 1)
lola: LP says that atomic proposition is always true: (p311 <= 1)
lola: LP says that atomic proposition is always true: (p90 <= 1)
lola: LP says that atomic proposition is always true: (p77 <= 1)
lola: LP says that atomic proposition is always true: (p268 <= 1)
lola: LP says that atomic proposition is always true: (p270 <= 1)
lola: LP says that atomic proposition is always true: (p11 <= 1)
lola: LP says that atomic proposition is always true: (p56 <= 1)
lola: LP says that atomic proposition is always true: (p289 <= 1)
lola: LP says that atomic proposition is always true: (p248 <= 1)
lola: LP says that atomic proposition is always true: (p35 <= 1)
lola: LP says that atomic proposition is always true: (p191 <= 1)
lola: LP says that atomic proposition is always true: (p193 <= 1)
lola: LP says that atomic proposition is always true: (p249 <= 1)
lola: LP says that atomic proposition is always true: (p290 <= 1)
lola: LP says that atomic proposition is always true: (p99 <= 1)
lola: LP says that atomic proposition is always true: (p126 <= 1)
lola: LP says that atomic proposition is always true: (p322 <= 1)
lola: LP says that atomic proposition is always true: (p165 <= 1)
lola: LP says that atomic proposition is always true: (p99 <= 1)
lola: LP says that atomic proposition is always true: (p126 <= 1)
lola: LP says that atomic proposition is always true: (p274 <= 1)
lola: LP says that atomic proposition is always true: (p190 <= 1)
lola: LP says that atomic proposition is always true: (p237 <= 1)
lola: LP says that atomic proposition is always true: (p212 <= 1)
lola: LP says that atomic proposition is always true: (p335 <= 1)
lola: LP says that atomic proposition is always true: (p144 <= 1)
lola: LP says that atomic proposition is always true: (p205 <= 1)
lola: LP says that atomic proposition is always true: (p350 <= 1)
lola: LP says that atomic proposition is always true: (p64 <= 1)
lola: LP says that atomic proposition is always true: (p372 <= 1)
lola: LP says that atomic proposition is always true: (p359 <= 1)
lola: LP says that atomic proposition is always true: (p226 <= 1)
lola: LP says that atomic proposition is always true: (p69 <= 1)
lola: LP says that atomic proposition is always true: (p107 <= 1)
lola: LP says that atomic proposition is always true: (p109 <= 1)
lola: LP says that atomic proposition is always true: (p105 <= 1)
lola: LP says that atomic proposition is always true: (p60 <= 1)
lola: LP says that atomic proposition is always true: (p365 <= 1)
lola: LP says that atomic proposition is always true: (p303 <= 1)
lola: LP says that atomic proposition is always true: (p266 <= 1)
lola: LP says that atomic proposition is always true: (p58 <= 1)
lola: LP says that atomic proposition is always true: (p201 <= 1)
lola: LP says that atomic proposition is always true: (p231 <= 1)
lola: LP says that atomic proposition is always true: (p274 <= 1)
lola: LP says that atomic proposition is always true: (p46 <= 1)
lola: LP says that atomic proposition is always true: (p119 <= 1)
lola: LP says that atomic proposition is always true: (p326 <= 1)
lola: LP says that atomic proposition is always true: (p367 <= 1)
lola: LP says that atomic proposition is always true: (p43 <= 1)
lola: LP says that atomic proposition is always true: (p117 <= 1)
lola: LP says that atomic proposition is always true: (p46 <= 1)
lola: LP says that atomic proposition is always true: (p312 <= 1)
lola: LP says that atomic proposition is always true: (p80 <= 1)
lola: LP says that atomic proposition is always true: (p42 <= 1)
lola: A (((((p373 <= 0)) AND ((p273 <= 0)) AND (((1 <= p51)) OR ((1 <= p187) AND (1 <= p297)))) U (E (F (((1 <= p211)))) OR E (G (((1 <= p174))))))) : (A (F (A ((((1 <= p5) AND (1 <= p66)) U ((1 <= p285)))))) AND (((((p291 <= 0)) OR NOT(A (F (((1 <= p14)))))) OR E (X (((p131 <= 0))))) OR A ((((1 <= p201)) U ((1 <= p317)))))) : E (F (E ((((1 <= p96) AND (1 <= p132) AND (1 <= p65)) U (((1 <= p354)) OR ((1 <= p145))))))) : E (G (E (G (A (F (((1 <= p250) AND (1 <= p286)))))))) : E (F ((E (G (((1 <= p17) AND (1 <= p119)))) OR (((1 <= p28)) AND A (G (((1 <= p336)))))))) : NOT(E ((E (X (((1 <= p243)))) U E (F (((1 <= p125))))))) : A (F (E (F (((1 <= p54)))))) : E (F (((1 <= p275) AND (1 <= p334)))) : (A ((A (F (((1 <= p22) AND (1 <= p49)))) U ((1 <= p271)))) AND (((NOT(A (G (((1 <= p311))))) OR A (F (((1 <= p90))))) OR ((1 <= p77))) OR NOT(A ((((1 <= p268) AND (1 <= p270)) U ((1 <= p11))))))) : (E (F (((p56 <= 0) OR ((1 <= p289))))) AND ((A ((((1 <= p248)) U ((1 <= p35)))) OR E (F (((1 <= p191) AND (1 <= p193) AND (1 <= p249) AND (1 <= p290))))) OR ((NOT(E (F (((1 <= p99) AND (1 <= p126))))) AND ((p322 <= 0) OR (p165 <= 0))) AND ((p99 <= 0) OR (p126 <= 0) OR (p274 <= 0))))) : A ((NOT(E (F (((1 <= p190) AND (1 <= p237))))) U (((1 <= p212)) OR ((1 <= p335)) OR ((1 <= p144)) OR ((1 <= p205))))) : ((E (X (A (X (((1 <= p350) AND (1 <= p64)))))) OR A (G (((p372 <= 0) OR ((1 <= p359)) OR ((1 <= p226)))))) OR (E (G (((1 <= p69)))) AND E (X (((1 <= p107) AND (1 <= p109)))))) : ((E (X ((((1 <= p105)) OR ((1 <= p60)) OR ((1 <= p365) AND (1 <= p303))))) OR ((p266 <= 0))) AND (((A (F (E (G (((1 <= p58)))))) OR A (G (((1 <= p201))))) OR E (X (((1 <= p231))))) OR ((A (F (((1 <= p274)))) AND ((p46 <= 0))) AND ((p119 <= 0))))) : A ((A (G (((1 <= p326) AND (1 <= p367) AND (1 <= p43)))) U A (F (((1 <= p117) AND (1 <= p46)))))) : A ((E (X (((1 <= p312)))) U A (F ((((1 <= p80)) OR ((1 <= p42)))))))
lola: rewrite Frontend/Parser/formula_rewrite.k:440
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:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:446
lola: rewrite Frontend/Parser/formula_rewrite.k:461
lola: rewrite Frontend/Parser/formula_rewrite.k:548
lola: rewrite Frontend/Parser/formula_rewrite.k:473
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:449
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:338
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
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:251
lola: rewrite Frontend/Parser/formula_rewrite.k:254
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:479
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
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:479
lola: rewrite Frontend/Parser/formula_rewrite.k:392
lola: rewrite Frontend/Parser/formula_rewrite.k:470
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 237 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (F (((1 <= p285)))) AND (((p291 <= 0)) OR (E (G (((p14 <= 0)))) OR (E (X (((p131 <= 0)))) OR A ((((1 <= p201)) U ((1 <= p317))))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 0 will run for 237 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (((1 <= p285))))
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: ((p285 <= 0))
lola: processed formula length: 13
lola: 45 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 <= p285))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space / EG
lola: state equation: write sara problem file to CTLFireability-0.sara
lola: state equation: calling and running sara
lola: The predicate does not eventually occur.
lola: 116 markings, 116 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 1 will run for 254 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E (X (A (X (((1 <= p350) AND (1 <= p64)))))) OR (A (G (((p372 <= 0) OR ((1 <= p359)) OR ((1 <= p226))))) OR (E (G (((1 <= p69)))) AND E (X (((1 <= p107) AND (1 <= p109)))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
sara: try reading problem file CTLFireability-0.sara.
lola: subprocess 1 will run for 254 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (X (A (X (((1 <= p350) AND (1 <= p64))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:812
lola: rewrite Frontend/Parser/formula_rewrite.k:807
lola: processed formula: EX(AX(((1 <= p350) AND (1 <= p64))))
lola: processed formula length: 36
lola: 44 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 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: subprocess 2 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G (((1 <= p69))))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation
lola: rewrite Frontend/Parser/formula_rewrite.k:583
lola: processed formula: E (G (((1 <= p69))))
lola: processed formula length: 20
lola: 43 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: SUBRESULT
lola: result: no
lola: produced by: state space / EG
lola: The predicate is not possibly preserved.
lola: 1 markings, 0 edges
lola: ========================================
lola: subprocess 3 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((p372 <= 0) OR ((1 <= p359)) OR ((1 <= p226)))))
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 (((p372 <= 0) OR ((1 <= p359)) OR ((1 <= p226)))))
lola: processed formula length: 57
lola: 44 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)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((1 <= p372) AND ((p359 <= 0)) AND ((p226 <= 0)))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 3 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 17 markings, 16 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
sara: place or transition ordering is non-deterministic
lola: subprocess 2 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((E (X ((((1 <= p105)) OR ((1 <= p60)) OR ((1 <= p365) AND (1 <= p303))))) OR ((p266 <= 0))) AND (A (F (E (G (((1 <= p58)))))) OR (A (G (((1 <= p201)))) OR (E (X (((1 <= p231)))) OR (A (F (((1 <= p274)))) AND (((p46 <= 0)) AND ((p119 <= 0))))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 2 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (E (G (((1 <= p58))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:808
lola: rewrite Frontend/Parser/formula_rewrite.k:811
lola: processed formula: AF(EG(((1 <= p58))))
lola: processed formula length: 20
lola: 44 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: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 122 markings, 244 edges

lola: ========================================
lola: subprocess 3 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((1 <= p201))))
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 (((1 <= p201))))
lola: processed formula length: 21
lola: 44 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)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((p201 <= 0))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 4 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (((p46 <= 0)) AND ((p119 <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: rewrite Frontend/Parser/formula_rewrite.k:793
lola: processed formula: (((p46 <= 0)) AND ((p119 <= 0)))
lola: processed formula length: 32
lola: 43 rewrites
lola: closed formula file CTLFireability.xml
lola: processed formula with 2 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 5 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (((1 <= p274))))
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: ((p274 <= 0))
lola: processed formula length: 13
lola: 45 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 does not eventually occur.
lola: 116 markings, 116 edges
lola: ========================================
lola: subprocess 6 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (X (((1 <= p231))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:807
lola: processed formula: EX(((1 <= p231)))
lola: processed formula length: 17
lola: 43 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 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: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: ========================================
lola: subprocess 3 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((p125 <= 0))))
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:788
lola: processed formula: A (G (((p125 <= 0))))
lola: processed formula length: 21
lola: 44 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)
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: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 <= p125))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 122 markings, 121 edges
lola: state equation: write sara problem file to CTLFireability-3-0.sara
lola: state equation: calling and running sara
sara: try reading problem file CTLFireability-3-0.sara.
lola: ========================================
lola: subprocess 4 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((1 <= p54))))
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 (((1 <= p54))))
lola: processed formula length: 20
lola: 43 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)
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: ((1 <= p54))
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: write sara problem file to CTLFireability-4-0.sara
sara: place or transition ordering is non-deterministic
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 115 markings, 114 edges
lola: ========================================
lola: subprocess 5 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((((1 <= p354)) OR ((1 <= p145)))))
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 ((((1 <= p354)) OR ((1 <= p145)))))
lola: processed formula length: 41
lola: 43 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)
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: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 55 markings, 54 edges
lola: ========================================
lola: subprocess 6 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((1 <= p275) AND (1 <= p334))))
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 (((1 <= p275) AND (1 <= p334))))
lola: processed formula length: 37
lola: 43 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)
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: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 83 markings, 82 edges
lola: ========================================
lola: subprocess 7 will run for 445 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F ((((1 <= p80)) OR ((1 <= p42)))))
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: (((p80 <= 0)) AND ((p42 <= 0)))
lola: processed formula length: 31
lola: 45 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 does not eventually occur.
lola: 116 markings, 116 edges
lola: ========================================
lola: subprocess 8 will run for 509 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G (A (F (((1 <= p250) AND (1 <= p286))))))
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(((1 <= p250) AND (1 <= p286))))
lola: processed formula length: 37
lola: 44 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: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 122 markings, 123 edges
lola: ========================================
lola: subprocess 9 will run for 594 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (((((p373 <= 0)) AND ((p273 <= 0)) AND (((1 <= p51)) OR ((1 <= p187) AND (1 <= p297)))) U (E (F (((1 <= p211)))) OR E (G (((1 <= p174)))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:806
lola: rewrite Frontend/Parser/formula_rewrite.k:808
lola: rewrite Frontend/Parser/formula_rewrite.k:814
lola: processed formula: A((((p373 <= 0)) AND ((p273 <= 0)) AND (((1 <= p51)) OR ((1 <= p187) AND (1 <= p297)))) U (EF(((1 <= p211))) OR EG(((1 <= p174)))))
lola: processed formula length: 132
lola: 45 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: 23082 markings, 45389 edges
lola: ========================================
lola: subprocess 10 will run for 712 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A ((A (F (((1 <= p22) AND (1 <= p49)))) U ((1 <= p271)))) AND (E (F (((p311 <= 0)))) OR (A (F (((1 <= p90)))) OR (((1 <= p77)) OR E ((((p268 <= 0) OR (p270 <= 0)) R ((p11 <= 0))))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:811
lola: rewrite Frontend/Parser/formula_rewrite.k:814
lola: rewrite Frontend/Parser/formula_rewrite.k:806
lola: rewrite Frontend/Parser/formula_rewrite.k:811
lola: rewrite Frontend/Parser/formula_rewrite.k:810
lola: processed formula: (A(AF(((1 <= p22) AND (1 <= p49))) U ((1 <= p271))) AND (EF(((p311 <= 0))) OR (AF(((1 <= p90))) OR (((1 <= p77)) OR E(((p268 <= 0) OR (p270 <= 0)) R ((p11 <= 0)))))))
lola: processed formula length: 167
lola: 47 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 5 significant temporal operators and needs 22 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: 122 markings, 123 edges
lola: ========================================
lola: subprocess 11 will run for 890 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((((1 <= p212)) OR ((1 <= p335)) OR ((1 <= p144)) OR ((1 <= p205))) OR (A (G (((p190 <= 0) OR (p237 <= 0)))) AND A (F ((((1 <= p212)) OR ((1 <= p335)) OR ((1 <= p144)) OR ((1 <= p205)))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 11 will run for 890 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (((1 <= p212)) OR ((1 <= p335)) OR ((1 <= p144)) OR ((1 <= p205)))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (((1 <= p212)) OR ((1 <= p335)) OR ((1 <= p144)) OR ((1 <= p205)))
lola: processed formula length: 69
lola: 42 rewrites
lola: closed formula file CTLFireability.xml
lola: processed formula with 4 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 12 will run for 1187 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((p190 <= 0) OR (p237 <= 0))))
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:788
lola: processed formula: A (G (((p190 <= 0) OR (p237 <= 0))))
lola: processed formula length: 37
lola: 44 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)
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: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 <= p190) AND (1 <= p237))
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
lola: The predicate is not invariant.
lola: 49 markings, 48 edges
lola: state equation: write sara problem file to CTLFireability-12-0.sara
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: state equation: calling and running sara
lola: subprocess 12 will run for 1187 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (F (((1 <= p117) AND (1 <= p46)))) OR (A (G (((1 <= p326) AND (1 <= p367) AND (1 <= p43)))) AND A (F (((1 <= p117) AND (1 <= p46))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
sara: try reading problem file CTLFireability-12-0.sara.
lola: subprocess 12 will run for 1187 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (((1 <= p117) AND (1 <= p46))))
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: ((p117 <= 0) OR (p46 <= 0))
lola: processed formula length: 28
lola: 45 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 <= p117) AND (1 <= p46))
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: 869 markings, 869 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
sara: error: :1776: error: syntax error, unexpected $end, expecting COLON
sara: error while reading Petri net from file -- aborting [#04]
sara: see manual for a documentation of this error
sara: last error message: No such file or directory
lola: subprocess 13 will run for 1781 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E (F (E (G (((1 <= p17) AND (1 <= p119)))))) OR E (F ((((1 <= p28)) AND A (G (((1 <= p336))))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 13 will run for 1781 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((((1 <= p28)) AND A (G (((1 <= p336)))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:813
lola: rewrite Frontend/Parser/formula_rewrite.k:806
lola: processed formula: EF((((1 <= p28)) AND AG(((1 <= p336)))))
lola: processed formula length: 40
lola: 44 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: 596237 markings, 1457584 edges, 119247 markings/sec, 0 secs
lola: 1167439 markings, 2965832 edges, 114240 markings/sec, 5 secs
sara: warning, failure of lp_solve (at job 3308)
lola: 1723609 markings, 4487863 edges, 111234 markings/sec, 10 secs
lola: 2265871 markings, 5990944 edges, 108452 markings/sec, 15 secs
lola: 2804450 markings, 7513122 edges, 107716 markings/sec, 20 secs
lola: 3333110 markings, 9020354 edges, 105732 markings/sec, 25 secs
lola: 3871520 markings, 10539788 edges, 107682 markings/sec, 30 secs
lola: 4389535 markings, 12051256 edges, 103603 markings/sec, 35 secs
lola: 4912030 markings, 13567347 edges, 104499 markings/sec, 40 secs
lola: 5434178 markings, 15088310 edges, 104430 markings/sec, 45 secs
lola: 5951279 markings, 16599702 edges, 103420 markings/sec, 50 secs
lola: 6451245 markings, 18083863 edges, 99993 markings/sec, 55 secs
lola: 6963978 markings, 19593016 edges, 102547 markings/sec, 60 secs
lola: 7478006 markings, 21113808 edges, 102806 markings/sec, 65 secs
lola: 7980925 markings, 22610934 edges, 100584 markings/sec, 70 secs
lola: 8485091 markings, 24108151 edges, 100833 markings/sec, 75 secs
lola: 8986381 markings, 25601475 edges, 100258 markings/sec, 80 secs
lola: 9473579 markings, 27059883 edges, 97440 markings/sec, 85 secs
lola: 9972617 markings, 28567723 edges, 99808 markings/sec, 90 secs
lola: 10384558 markings, 29810563 edges, 82388 markings/sec, 95 secs
lola: 10829058 markings, 31154432 edges, 88900 markings/sec, 100 secs
lola: 11268645 markings, 32474925 edges, 87917 markings/sec, 105 secs
lola: 11675316 markings, 33706013 edges, 81334 markings/sec, 110 secs
lola: 12123693 markings, 35073282 edges, 89675 markings/sec, 115 secs
lola: 12551412 markings, 36369313 edges, 85544 markings/sec, 120 secs
lola: 12971277 markings, 37664012 edges, 83973 markings/sec, 125 secs
lola: 13394231 markings, 38954666 edges, 84591 markings/sec, 130 secs
lola: 13815855 markings, 40233393 edges, 84325 markings/sec, 135 secs
lola: 14237330 markings, 41536956 edges, 84295 markings/sec, 140 secs
lola: 14681524 markings, 42910900 edges, 88839 markings/sec, 145 secs
lola: 14888949 markings, 43552630 edges, 41485 markings/sec, 150 secs
lola: 15091980 markings, 44171630 edges, 40606 markings/sec, 155 secs
lola: 15293630 markings, 44796542 edges, 40330 markings/sec, 160 secs
lola: 15549777 markings, 45568414 edges, 51229 markings/sec, 165 secs
lola: 15967702 markings, 46860943 edges, 83585 markings/sec, 170 secs
lola: 16409559 markings, 48206995 edges, 88371 markings/sec, 175 secs
lola: 16842216 markings, 49548251 edges, 86531 markings/sec, 180 secs
lola: 17277459 markings, 50897784 edges, 87049 markings/sec, 185 secs
lola: 17658652 markings, 52091868 edges, 76239 markings/sec, 190 secs
lola: 18053843 markings, 53319468 edges, 79038 markings/sec, 195 secs
lola: 18490767 markings, 54688424 edges, 87385 markings/sec, 200 secs
lola: 18895463 markings, 55939344 edges, 80939 markings/sec, 205 secs
lola: 19293467 markings, 57178134 edges, 79601 markings/sec, 210 secs
lola: 19736579 markings, 58559720 edges, 88622 markings/sec, 215 secs
lola: 20125272 markings, 59764350 edges, 77739 markings/sec, 220 secs
lola: 20525173 markings, 61022078 edges, 79980 markings/sec, 225 secs
lola: 20953445 markings, 62361730 edges, 85654 markings/sec, 230 secs
lola: 21373529 markings, 63674778 edges, 84017 markings/sec, 235 secs
lola: 21794179 markings, 64994014 edges, 84130 markings/sec, 240 secs
lola: 22211687 markings, 66293919 edges, 83502 markings/sec, 245 secs
lola: 22625718 markings, 67591137 edges, 82806 markings/sec, 250 secs
lola: 23054409 markings, 68938834 edges, 85738 markings/sec, 255 secs
lola: 23480449 markings, 70275945 edges, 85208 markings/sec, 260 secs
lola: 23735757 markings, 71086095 edges, 51062 markings/sec, 265 secs
lola: 24172968 markings, 72450641 edges, 87442 markings/sec, 270 secs
lola: 24623917 markings, 73884210 edges, 90190 markings/sec, 275 secs
lola: 25081099 markings, 75328877 edges, 91436 markings/sec, 280 secs
lola: 25547399 markings, 76803312 edges, 93260 markings/sec, 285 secs
lola: 26004195 markings, 78251231 edges, 91359 markings/sec, 290 secs
lola: 26454404 markings, 79686832 edges, 90042 markings/sec, 295 secs
lola: 26908842 markings, 81127424 edges, 90888 markings/sec, 300 secs
lola: 27368303 markings, 82574468 edges, 91892 markings/sec, 305 secs
lola: 27791647 markings, 83903919 edges, 84669 markings/sec, 310 secs
lola: 28192677 markings, 85168068 edges, 80206 markings/sec, 315 secs
lola: 28577604 markings, 86391284 edges, 76985 markings/sec, 320 secs
lola: 29008306 markings, 87755684 edges, 86140 markings/sec, 325 secs
lola: 29427989 markings, 89081825 edges, 83937 markings/sec, 330 secs
lola: 29801520 markings, 90266348 edges, 74706 markings/sec, 335 secs
lola: 30187430 markings, 91495461 edges, 77182 markings/sec, 340 secs
lola: 30596005 markings, 92788355 edges, 81715 markings/sec, 345 secs
lola: 31010061 markings, 94104545 edges, 82811 markings/sec, 350 secs
lola: 31451874 markings, 95490904 edges, 88363 markings/sec, 355 secs
lola: 31874002 markings, 96841792 edges, 84426 markings/sec, 360 secs
lola: 32309502 markings, 98225377 edges, 87100 markings/sec, 365 secs
lola: 32761115 markings, 99666346 edges, 90323 markings/sec, 370 secs
lola: 33211941 markings, 101107085 edges, 90165 markings/sec, 375 secs
lola: 33654629 markings, 102540796 edges, 88538 markings/sec, 380 secs
lola: 34104622 markings, 103992808 edges, 89999 markings/sec, 385 secs
lola: 34559835 markings, 105470833 edges, 91043 markings/sec, 390 secs
lola: 35011420 markings, 106914307 edges, 90317 markings/sec, 395 secs
lola: 35455130 markings, 108343071 edges, 88742 markings/sec, 400 secs
lola: 35905643 markings, 109792549 edges, 90103 markings/sec, 405 secs
lola: 36347245 markings, 111230098 edges, 88320 markings/sec, 410 secs
lola: 36798031 markings, 112688950 edges, 90157 markings/sec, 415 secs
lola: 37241518 markings, 114118218 edges, 88697 markings/sec, 420 secs
lola: 37684796 markings, 115545534 edges, 88656 markings/sec, 425 secs
lola: 38136420 markings, 116997252 edges, 90325 markings/sec, 430 secs
lola: 38587343 markings, 118441388 edges, 90185 markings/sec, 435 secs
lola: 39033399 markings, 119875345 edges, 89211 markings/sec, 440 secs
lola: 39478485 markings, 121296374 edges, 89017 markings/sec, 445 secs
lola: 39922820 markings, 122727313 edges, 88867 markings/sec, 450 secs
lola: 40357609 markings, 124147205 edges, 86958 markings/sec, 455 secs
lola: 40798811 markings, 125574239 edges, 88240 markings/sec, 460 secs
lola: 41241670 markings, 127014707 edges, 88572 markings/sec, 465 secs
lola: 41688450 markings, 128452247 edges, 89356 markings/sec, 470 secs
lola: 42133569 markings, 129872692 edges, 89024 markings/sec, 475 secs
lola: 42587627 markings, 131307198 edges, 90812 markings/sec, 480 secs
lola: 43024925 markings, 132716876 edges, 87460 markings/sec, 485 secs
lola: 43469244 markings, 134152272 edges, 88864 markings/sec, 490 secs
lola: 43914683 markings, 135582690 edges, 89088 markings/sec, 495 secs
lola: 44357598 markings, 137022522 edges, 88583 markings/sec, 500 secs
lola: 44794210 markings, 138452346 edges, 87322 markings/sec, 505 secs
lola: 45237203 markings, 139880993 edges, 88599 markings/sec, 510 secs
lola: 45665837 markings, 141283637 edges, 85727 markings/sec, 515 secs
lola: 46058277 markings, 142562671 edges, 78488 markings/sec, 520 secs
lola: 46465938 markings, 143888759 edges, 81532 markings/sec, 525 secs
lola: 46883487 markings, 145240522 edges, 83510 markings/sec, 530 secs
lola: 47317217 markings, 146659757 edges, 86746 markings/sec, 535 secs
lola: 47717375 markings, 147969501 edges, 80032 markings/sec, 540 secs
lola: 48116845 markings, 149269779 edges, 79894 markings/sec, 545 secs
lola: 48517014 markings, 150572725 edges, 80034 markings/sec, 550 secs
lola: 48939926 markings, 151952422 edges, 84582 markings/sec, 555 secs
lola: 49374186 markings, 153363559 edges, 86852 markings/sec, 560 secs
lola: 49792199 markings, 154719406 edges, 83603 markings/sec, 565 secs
lola: 50210722 markings, 156089481 edges, 83705 markings/sec, 570 secs
lola: 50623724 markings, 157443920 edges, 82600 markings/sec, 575 secs
lola: 51053795 markings, 158843464 edges, 86014 markings/sec, 580 secs
lola: 51429113 markings, 160073162 edges, 75064 markings/sec, 585 secs
lola: 51840619 markings, 161428661 edges, 82301 markings/sec, 590 secs
lola: 52272627 markings, 162833247 edges, 86402 markings/sec, 595 secs
lola: 52675287 markings, 164148528 edges, 80532 markings/sec, 600 secs
lola: 53072057 markings, 165435213 edges, 79354 markings/sec, 605 secs
lola: 53478377 markings, 166763294 edges, 81264 markings/sec, 610 secs
lola: 53901463 markings, 168159736 edges, 84617 markings/sec, 615 secs
lola: 54349959 markings, 169618894 edges, 89699 markings/sec, 620 secs
lola: 54785134 markings, 171040164 edges, 87035 markings/sec, 625 secs
lola: 55217752 markings, 172457190 edges, 86524 markings/sec, 630 secs
lola: 55646532 markings, 173859678 edges, 85756 markings/sec, 635 secs
lola: 56082609 markings, 175294860 edges, 87215 markings/sec, 640 secs
lola: 56506420 markings, 176699994 edges, 84762 markings/sec, 645 secs
lola: 56941279 markings, 178113423 edges, 86972 markings/sec, 650 secs
lola: 57368674 markings, 179517996 edges, 85479 markings/sec, 655 secs
lola: 57801136 markings, 180938906 edges, 86492 markings/sec, 660 secs
lola: 58232267 markings, 182345655 edges, 86226 markings/sec, 665 secs
lola: 58661883 markings, 183754927 edges, 85923 markings/sec, 670 secs
lola: 59094157 markings, 185162669 edges, 86455 markings/sec, 675 secs
lola: 59528927 markings, 186590446 edges, 86954 markings/sec, 680 secs
lola: 59957003 markings, 188006054 edges, 85615 markings/sec, 685 secs
lola: 60384907 markings, 189430470 edges, 85581 markings/sec, 690 secs
lola: 60820388 markings, 190849070 edges, 87096 markings/sec, 695 secs
lola: 61249386 markings, 192289913 edges, 85800 markings/sec, 700 secs
lola: 61679359 markings, 193710321 edges, 85995 markings/sec, 705 secs
lola: 62096819 markings, 195113284 edges, 83492 markings/sec, 710 secs
lola: 62524519 markings, 196533329 edges, 85540 markings/sec, 715 secs
lola: 62957313 markings, 197969020 edges, 86559 markings/sec, 720 secs
lola: 63384037 markings, 199384822 edges, 85345 markings/sec, 725 secs
lola: 63796304 markings, 200749073 edges, 82453 markings/sec, 730 secs
lola: 64191845 markings, 202057936 edges, 79108 markings/sec, 735 secs
lola: 64593194 markings, 203381749 edges, 80270 markings/sec, 740 secs
lola: 65003338 markings, 204741594 edges, 82029 markings/sec, 745 secs
lola: 65421105 markings, 206116792 edges, 83553 markings/sec, 750 secs
lola: 65832107 markings, 207453377 edges, 82200 markings/sec, 755 secs
lola: 66236836 markings, 208778434 edges, 80946 markings/sec, 760 secs
lola: 66633125 markings, 210079332 edges, 79258 markings/sec, 765 secs
lola: 67029414 markings, 211403273 edges, 79258 markings/sec, 770 secs
lola: 67454532 markings, 212797359 edges, 85024 markings/sec, 775 secs
lola: 67877556 markings, 214182742 edges, 84605 markings/sec, 780 secs
lola: 68298667 markings, 215582977 edges, 84222 markings/sec, 785 secs
lola: 68721545 markings, 216974184 edges, 84576 markings/sec, 790 secs
lola: 69139268 markings, 218375305 edges, 83545 markings/sec, 795 secs
lola: 69557715 markings, 219775985 edges, 83689 markings/sec, 800 secs
lola: 69985660 markings, 221173646 edges, 85589 markings/sec, 805 secs
lola: 70403614 markings, 222563867 edges, 83591 markings/sec, 810 secs
lola: 70822522 markings, 223947236 edges, 83782 markings/sec, 815 secs
lola: 71250157 markings, 225353679 edges, 85527 markings/sec, 820 secs
lola: 71672737 markings, 226760586 edges, 84516 markings/sec, 825 secs
lola: 72088395 markings, 228146859 edges, 83132 markings/sec, 830 secs
lola: 72507958 markings, 229534419 edges, 83913 markings/sec, 835 secs
lola: 72922772 markings, 230907845 edges, 82963 markings/sec, 840 secs
lola: 73346724 markings, 232311874 edges, 84790 markings/sec, 845 secs
lola: 73770521 markings, 233713954 edges, 84759 markings/sec, 850 secs
lola: 74197563 markings, 235137392 edges, 85408 markings/sec, 855 secs
lola: 74628446 markings, 236566026 edges, 86177 markings/sec, 860 secs
lola: 75049096 markings, 237968977 edges, 84130 markings/sec, 865 secs
lola: 75475053 markings, 239380717 edges, 85191 markings/sec, 870 secs
lola: 75889659 markings, 240759755 edges, 82921 markings/sec, 875 secs
lola: 76312231 markings, 242164242 edges, 84514 markings/sec, 880 secs
lola: 76731375 markings, 243557741 edges, 83829 markings/sec, 885 secs
lola: 77158429 markings, 244930817 edges, 85411 markings/sec, 890 secs
lola: 77577619 markings, 246328522 edges, 83838 markings/sec, 895 secs
lola: 77994044 markings, 247715016 edges, 83285 markings/sec, 900 secs
lola: 78407049 markings, 249105073 edges, 82601 markings/sec, 905 secs
lola: 78821227 markings, 250475206 edges, 82836 markings/sec, 910 secs
lola: 79240054 markings, 251866142 edges, 83765 markings/sec, 915 secs
lola: 79652317 markings, 253240482 edges, 82453 markings/sec, 920 secs
lola: 80066607 markings, 254634352 edges, 82858 markings/sec, 925 secs
lola: 80471251 markings, 255992821 edges, 80929 markings/sec, 930 secs
lola: 80835643 markings, 257228117 edges, 72878 markings/sec, 935 secs
lola: 81205784 markings, 258461044 edges, 74028 markings/sec, 940 secs
lola: 81505921 markings, 259451119 edges, 60027 markings/sec, 945 secs
lola: 81796462 markings, 260430623 edges, 58108 markings/sec, 950 secs
lola: 82011478 markings, 261141853 edges, 43003 markings/sec, 955 secs
lola: 82190864 markings, 261773268 edges, 35877 markings/sec, 960 secs
lola: 82472724 markings, 262726095 edges, 56372 markings/sec, 965 secs
lola: 82753991 markings, 263663427 edges, 56253 markings/sec, 970 secs
lola: 82967587 markings, 264374437 edges, 42719 markings/sec, 975 secs
lola: 83255270 markings, 265311221 edges, 57537 markings/sec, 980 secs
lola: 83435694 markings, 265915204 edges, 36085 markings/sec, 985 secs
lola: 83591157 markings, 266439662 edges, 31093 markings/sec, 990 secs
lola: 83751779 markings, 266984946 edges, 32124 markings/sec, 995 secs
lola: 83987031 markings, 267766207 edges, 47050 markings/sec, 1000 secs
lola: 84219225 markings, 268537459 edges, 46439 markings/sec, 1005 secs
lola: 84452712 markings, 269317114 edges, 46697 markings/sec, 1010 secs
lola: 84676929 markings, 270058342 edges, 44843 markings/sec, 1015 secs
lola: 84850428 markings, 270641592 edges, 34700 markings/sec, 1020 secs
lola: 85061440 markings, 271356636 edges, 42202 markings/sec, 1025 secs
lola: 85237363 markings, 271933493 edges, 35185 markings/sec, 1030 secs
lola: 85445312 markings, 272619555 edges, 41590 markings/sec, 1035 secs
lola: 85655565 markings, 273329046 edges, 42051 markings/sec, 1040 secs
lola: 85888451 markings, 274100758 edges, 46577 markings/sec, 1045 secs
lola: 86116202 markings, 274869337 edges, 45550 markings/sec, 1050 secs
lola: 86360498 markings, 275687062 edges, 48859 markings/sec, 1055 secs
lola: 86617848 markings, 276543177 edges, 51470 markings/sec, 1060 secs
lola: 86843171 markings, 277307323 edges, 45065 markings/sec, 1065 secs
lola: 87059060 markings, 278033359 edges, 43178 markings/sec, 1070 secs
lola: 87294931 markings, 278833525 edges, 47174 markings/sec, 1075 secs
lola: 87512980 markings, 279561642 edges, 43610 markings/sec, 1080 secs
lola: 87745984 markings, 280348195 edges, 46601 markings/sec, 1085 secs
lola: 88023854 markings, 281285376 edges, 55574 markings/sec, 1090 secs
lola: 88244815 markings, 282016348 edges, 44192 markings/sec, 1095 secs
lola: 88473650 markings, 282778256 edges, 45767 markings/sec, 1100 secs
lola: 88705784 markings, 283559718 edges, 46427 markings/sec, 1105 secs
lola: 88964071 markings, 284427556 edges, 51657 markings/sec, 1110 secs
lola: 89178833 markings, 285125786 edges, 42952 markings/sec, 1115 secs
lola: 89378247 markings, 285793721 edges, 39883 markings/sec, 1120 secs
lola: 89593082 markings, 286515374 edges, 42967 markings/sec, 1125 secs
lola: 89806895 markings, 287231774 edges, 42763 markings/sec, 1130 secs
lola: 90005418 markings, 287892349 edges, 39705 markings/sec, 1135 secs
lola: 90170929 markings, 288458168 edges, 33102 markings/sec, 1140 secs
lola: 90414197 markings, 289273215 edges, 48654 markings/sec, 1145 secs
lola: 90665477 markings, 290122834 edges, 50256 markings/sec, 1150 secs
lola: 90879680 markings, 290847858 edges, 42841 markings/sec, 1155 secs
lola: 91079556 markings, 291507165 edges, 39975 markings/sec, 1160 secs
lola: 91282994 markings, 292196309 edges, 40688 markings/sec, 1165 secs
lola: 91532473 markings, 293043562 edges, 49896 markings/sec, 1170 secs
lola: 91733815 markings, 293718548 edges, 40268 markings/sec, 1175 secs
lola: 91932946 markings, 294390637 edges, 39826 markings/sec, 1180 secs
lola: 92140346 markings, 295091134 edges, 41480 markings/sec, 1185 secs
lola: 92317969 markings, 295693469 edges, 35525 markings/sec, 1190 secs
lola: 92554241 markings, 296488608 edges, 47254 markings/sec, 1195 secs
lola: 92767724 markings, 297207596 edges, 42697 markings/sec, 1200 secs
lola: 93019871 markings, 298050235 edges, 50429 markings/sec, 1205 secs
lola: 93225240 markings, 298736278 edges, 41074 markings/sec, 1210 secs
lola: 93436618 markings, 299439817 edges, 42276 markings/sec, 1215 secs
lola: 93605651 markings, 300016643 edges, 33807 markings/sec, 1220 secs
lola: 93809235 markings, 300687249 edges, 40717 markings/sec, 1225 secs
lola: 94081352 markings, 301599597 edges, 54423 markings/sec, 1230 secs
lola: 94287536 markings, 302292947 edges, 41237 markings/sec, 1235 secs
lola: 94500019 markings, 303014349 edges, 42497 markings/sec, 1240 secs
lola: 94692950 markings, 303652073 edges, 38586 markings/sec, 1245 secs
lola: 94920442 markings, 304397105 edges, 45498 markings/sec, 1250 secs
lola: 95134343 markings, 305112610 edges, 42780 markings/sec, 1255 secs
lola: 95361444 markings, 305876431 edges, 45420 markings/sec, 1260 secs
lola: 95572304 markings, 306577506 edges, 42172 markings/sec, 1265 secs
lola: 95867583 markings, 307473429 edges, 59056 markings/sec, 1270 secs
lola: 96003514 markings, 307936784 edges, 27186 markings/sec, 1275 secs
lola: 96112285 markings, 308309766 edges, 21754 markings/sec, 1280 secs
lola: 96136144 markings, 308387321 edges, 4772 markings/sec, 1285 secs
lola: 96151375 markings, 308440908 edges, 3046 markings/sec, 1290 secs
lola: 96199160 markings, 308600255 edges, 9557 markings/sec, 1295 secs
lola: 96326937 markings, 309018160 edges, 25555 markings/sec, 1300 secs
lola: 96495238 markings, 309584842 edges, 33660 markings/sec, 1305 secs
lola: 96674366 markings, 310180249 edges, 35826 markings/sec, 1310 secs
lola: 96844199 markings, 310748332 edges, 33967 markings/sec, 1315 secs
lola: 96958907 markings, 311136700 edges, 22942 markings/sec, 1320 secs
lola: 97144594 markings, 311766076 edges, 37137 markings/sec, 1325 secs
lola: 97318801 markings, 312353381 edges, 34841 markings/sec, 1330 secs
lola: 97480268 markings, 312892506 edges, 32293 markings/sec, 1335 secs
lola: 97664890 markings, 313516542 edges, 36924 markings/sec, 1340 secs
lola: 97797739 markings, 313956899 edges, 26570 markings/sec, 1345 secs
lola: 97954768 markings, 314491654 edges, 31406 markings/sec, 1350 secs
lola: 98098990 markings, 314981974 edges, 28844 markings/sec, 1355 secs
lola: 98256185 markings, 315508602 edges, 31439 markings/sec, 1360 secs
lola: 98379737 markings, 315916506 edges, 24710 markings/sec, 1365 secs
lola: 98572328 markings, 316550308 edges, 38518 markings/sec, 1370 secs
lola: 98789337 markings, 317274382 edges, 43402 markings/sec, 1375 secs
lola: 98987299 markings, 317941617 edges, 39592 markings/sec, 1380 secs
lola: 99162862 markings, 318531831 edges, 35113 markings/sec, 1385 secs
lola: 99332041 markings, 319102717 edges, 33836 markings/sec, 1390 secs
lola: 99507404 markings, 319700904 edges, 35073 markings/sec, 1395 secs
lola: 99684479 markings, 320296284 edges, 35415 markings/sec, 1400 secs
lola: 99684871 markings, 320297568 edges, 78 markings/sec, 1405 secs
lola: 99685179 markings, 320298589 edges, 62 markings/sec, 1410 secs
lola: 99686166 markings, 320302266 edges, 197 markings/sec, 1415 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 14 will run for 2129 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (E (G (((1 <= p17) AND (1 <= p119))))))
lola: ========================================
lola: SUBTASK
lola: checking reachability of possible preservation
lola: rewrite Frontend/Parser/formula_rewrite.k:598
lola: rewrite Frontend/Parser/formula_rewrite.k:633
lola: rewrite Frontend/Parser/formula_rewrite.k:730
lola: processed formula: ((1 <= p17) AND (1 <= p119))
lola: processed formula length: 28
lola: 45 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:787
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((p17 <= 0) OR (p119 <= 0))
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 /EFEG
lola: state equation task get result started, id 1
lola: The predicate is possibly preserved from a reachable marking.
lola: 593 markings, 595 edges
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 <= p17) AND (1 <= p119))
lola: state equation task get result unparse finished id 1
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 14 will run for 2129 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E (F (((p56 <= 0) OR ((1 <= p289))))) AND (A ((((1 <= p248)) U ((1 <= p35)))) OR (E (F (((1 <= p191) AND (1 <= p193) AND (1 <= p249) AND (1 <= p290)))) OR (A (G (((p99 <= 0) OR (p126 <= 0)))) AND (((p322 <= 0) OR (p165 <= 0)) AND ((p99 <= 0) OR (p126 <= 0) OR (p274 <= 0)))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 14 will run for 2129 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((p56 <= 0) OR ((1 <= p289)))))
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 (((p56 <= 0) OR ((1 <= p289)))))
lola: processed formula length: 38
lola: 43 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)
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: ((p56 <= 0) OR ((1 <= p289)))
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: 0 markings, 0 edges
lola: ========================================
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 16 will run for 1 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (((p322 <= 0) OR (p165 <= 0)) AND ((p99 <= 0) OR (p126 <= 0) OR (p274 <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: rewrite Frontend/Parser/formula_rewrite.k:793
lola: processed formula: (((p322 <= 0) OR (p165 <= 0)) AND ((p99 <= 0) OR (p126 <= 0) OR (p274 <= 0)))
lola: processed formula length: 80
lola: 43 rewrites
lola: closed formula file CTLFireability.xml
lola: processed formula with 5 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 17 will run for 1 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((p99 <= 0) OR (p126 <= 0))))
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:788
lola: processed formula: A (G (((p99 <= 0) OR (p126 <= 0))))
lola: processed formula length: 36
lola: 44 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)
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: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 <= p99) AND (1 <= p126))
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-17-0.sara
lola: state equation: calling and running sara
sara: try reading problem file CTLFireability-17-0.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 114 markings, 113 edges
lola: ========================================
lola: subprocess 18 will run for 1 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((1 <= p191) AND (1 <= p193) AND (1 <= p249) AND (1 <= p290))))
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 (((1 <= p191) AND (1 <= p193) AND (1 <= p249) AND (1 <= p290))))
lola: processed formula length: 69
lola: 43 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)
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: ((1 <= p191) AND (1 <= p193) AND (1 <= p249) AND (1 <= p290))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 4 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 64 markings, 63 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: RESULT
lola:
SUMMARY: yes no yes no yes no yes yes no yes no no no no no
lola:
preliminary result: yes no yes no yes no yes yes no yes no no no no no
lola: memory consumption: 4012 KB
lola: time consumption: 1441 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: 16427456 kB
MemFree: 10175032 kB
After kill :
MemTotal: 16427456 kB
MemFree: 10171748 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="ShieldPPPt-PT-005B"
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 ShieldPPPt-PT-005B, 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 r211-tajo-159033477700644"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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