Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2020-input.r178-tajo-158987882000156.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 DNAwalker-PT-10ringRL, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r178-tajo-158987882000156
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 280K
-rw-r--r-- 1 mcc users 3.0K Mar 31 04:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 17K Mar 31 04:58 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Mar 29 20:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 16K Mar 29 20:54 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 24 05:37 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 5.6K Mar 24 05:37 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.3K Apr 8 14:52 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 28 14:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Apr 8 14:52 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 28 14:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.2K Mar 28 13:42 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 16K Mar 28 13:42 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.1K Mar 27 06:26 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 19K Mar 27 06:26 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 28 14:49 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Mar 28 14:49 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 equiv_col
-rw-r--r-- 1 mcc users 9 Mar 24 05:37 instance
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 iscolored
-rw-r--r-- 1 mcc users 112K Mar 24 05:37 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME DNAwalker-PT-10ringRL-CTLFireability-00
FORMULA_NAME DNAwalker-PT-10ringRL-CTLFireability-01
FORMULA_NAME DNAwalker-PT-10ringRL-CTLFireability-02
FORMULA_NAME DNAwalker-PT-10ringRL-CTLFireability-03
FORMULA_NAME DNAwalker-PT-10ringRL-CTLFireability-04
FORMULA_NAME DNAwalker-PT-10ringRL-CTLFireability-05
FORMULA_NAME DNAwalker-PT-10ringRL-CTLFireability-06
FORMULA_NAME DNAwalker-PT-10ringRL-CTLFireability-07
FORMULA_NAME DNAwalker-PT-10ringRL-CTLFireability-08
FORMULA_NAME DNAwalker-PT-10ringRL-CTLFireability-09
FORMULA_NAME DNAwalker-PT-10ringRL-CTLFireability-10
FORMULA_NAME DNAwalker-PT-10ringRL-CTLFireability-11
FORMULA_NAME DNAwalker-PT-10ringRL-CTLFireability-12
FORMULA_NAME DNAwalker-PT-10ringRL-CTLFireability-13
FORMULA_NAME DNAwalker-PT-10ringRL-CTLFireability-14
FORMULA_NAME DNAwalker-PT-10ringRL-CTLFireability-15

=== Now, execution of the tool begins

BK_START 1591206545805

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-03 17:49:07] [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-03 17:49:07] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-03 17:49:07] [INFO ] Load time of PNML (sax parser for PT used): 53 ms
[2020-06-03 17:49:07] [INFO ] Transformed 27 places.
[2020-06-03 17:49:07] [INFO ] Transformed 260 transitions.
[2020-06-03 17:49:07] [INFO ] Parsed PT model containing 27 places and 260 transitions in 88 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 13 ms.
Incomplete random walk after 100000 steps, including 8059 resets, run finished after 334 ms. (steps per millisecond=299 ) properties seen :[1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 0, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-06-03 17:49:07] [INFO ] Flow matrix only has 259 transitions (discarded 1 similar events)
// Phase 1: matrix 259 rows 27 cols
[2020-06-03 17:49:07] [INFO ] Computed 0 place invariants in 6 ms
[2020-06-03 17:49:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 17:49:08] [INFO ] [Real]Absence check using state equation in 118 ms returned sat
[2020-06-03 17:49:08] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 17:49:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 17:49:08] [INFO ] [Nat]Absence check using state equation in 194 ms returned unsat
[2020-06-03 17:49:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 17:49:08] [INFO ] [Real]Absence check using state equation in 44 ms returned sat
[2020-06-03 17:49:08] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 17:49:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 17:49:08] [INFO ] [Nat]Absence check using state equation in 76 ms returned unsat
[2020-06-03 17:49:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 17:49:08] [INFO ] [Real]Absence check using state equation in 62 ms returned sat
[2020-06-03 17:49:08] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 17:49:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 17:49:08] [INFO ] [Nat]Absence check using state equation in 139 ms returned unsat
[2020-06-03 17:49:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 17:49:08] [INFO ] [Real]Absence check using state equation in 82 ms returned sat
[2020-06-03 17:49:08] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 17:49:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 17:49:09] [INFO ] [Nat]Absence check using state equation in 142 ms returned unsat
[2020-06-03 17:49:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 17:49:09] [INFO ] [Real]Absence check using state equation in 65 ms returned sat
[2020-06-03 17:49:09] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 17:49:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 17:49:09] [INFO ] [Nat]Absence check using state equation in 102 ms returned unsat
[2020-06-03 17:49:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 17:49:09] [INFO ] [Real]Absence check using state equation in 59 ms returned sat
[2020-06-03 17:49:09] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 17:49:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 17:49:09] [INFO ] [Nat]Absence check using state equation in 243 ms returned unsat
Successfully simplified 6 atomic propositions for a total of 6 simplifications.
[2020-06-03 17:49:09] [INFO ] Initial state reduction rules for CTL removed 3 formulas.
[2020-06-03 17:49:09] [INFO ] Flatten gal took : 49 ms
[2020-06-03 17:49:09] [INFO ] Initial state reduction rules for CTL removed 3 formulas.
[2020-06-03 17:49:09] [INFO ] Flatten gal took : 21 ms
FORMULA DNAwalker-PT-10ringRL-CTLFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DNAwalker-PT-10ringRL-CTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DNAwalker-PT-10ringRL-CTLFireability-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-06-03 17:49:09] [INFO ] Export to MCC properties in file /home/mcc/execution/CTLFireability.sr.xml took 5 ms.
[2020-06-03 17:49:09] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 3 ms.
info: Time: 3600 - MCC
vrfy: Checking CTLFireability @ DNAwalker-PT-10ringRL @ 3570 seconds

FORMULA DNAwalker-PT-10ringRL-CTLFireability-00 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DNAwalker-PT-10ringRL-CTLFireability-04 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DNAwalker-PT-10ringRL-CTLFireability-06 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DNAwalker-PT-10ringRL-CTLFireability-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DNAwalker-PT-10ringRL-CTLFireability-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DNAwalker-PT-10ringRL-CTLFireability-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DNAwalker-PT-10ringRL-CTLFireability-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DNAwalker-PT-10ringRL-CTLFireability-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DNAwalker-PT-10ringRL-CTLFireability-07 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DNAwalker-PT-10ringRL-CTLFireability-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DNAwalker-PT-10ringRL-CTLFireability-02 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DNAwalker-PT-10ringRL-CTLFireability-09 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DNAwalker-PT-10ringRL-CTLFireability-03 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 2326
rslt: Output for CTLFireability @ DNAwalker-PT-10ringRL

{
"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": "Wed Jun 3 17:49:10 2020
",
"timelimit": 3570
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 221
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 2,
"F": 1,
"G": 1,
"U": 0,
"X": 1,
"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": "EF(EG(AX(((2 <= p1) AND (1 <= p21)))))",
"processed_size": 38,
"rewrites": 19
},
"net":
{
"conflict_clusters": 7,
"singleton_clusters": 0
},
"result":
{
"edges": 264975584,
"markings": 27950678,
"produced_by": "CTL model checker",
"value": false
},
"task":
{
"compoundnumber": 0,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
},

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

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

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

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

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 244
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 2,
"adisj": 0,
"aneg": 0,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "(((2 <= p17) AND (1 <= p21)) OR ((2 <= p11) AND (1 <= p13)))",
"processed_size": 60,
"rewrites": 17
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 2,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 269
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 2,
"E": 0,
"F": 1,
"G": 0,
"U": 0,
"X": 1,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "AF(AX(((1 <= p7) AND (2 <= p26))))",
"processed_size": 34,
"rewrites": 18
},
"net":
{
"conflict_clusters": 7,
"singleton_clusters": 0
},
"result":
{
"edges": 6,
"markings": 6,
"produced_by": "CTL model checker",
"value": false
},
"task":
{
"compoundnumber": 3,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 2,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 269
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 2,
"F": 1,
"G": 0,
"U": 0,
"X": 1,
"aconj": 2,
"adisj": 0,
"aneg": 0,
"comp": 5,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 5,
"taut": 0,
"tconj": 2,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "EX((((1 <= p7) AND (2 <= p10)) AND (EF(((1 <= p1) AND (2 <= p17))) AND (1 <= p18))))",
"processed_size": 84,
"rewrites": 18
},
"net":
{
"conflict_clusters": 7,
"singleton_clusters": 0
},
"result":
{
"edges": 37257,
"markings": 6847,
"produced_by": "CTL model checker",
"value": true
},
"task":
{
"compoundnumber": 3,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 299
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 1,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "EF((((1 <= p3) AND (2 <= p5)) AND AX((p4 <= 0))))",
"processed_size": 49,
"rewrites": 18
},
"net":
{
"conflict_clusters": 7,
"singleton_clusters": 0
},
"result":
{
"edges": 29211,
"markings": 5857,
"produced_by": "CTL model checker",
"value": true
},
"task":
{
"compoundnumber": 4,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 336
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"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": "E (G (((p17 <= 1) OR (p19 <= 0))))",
"processed_size": 35,
"rewrites": 17
},
"result":
{
"edges": 10,
"markings": 10,
"produced_by": "state space / EG",
"value": true
},
"task":
{
"compoundnumber": 5,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 44
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 2,
"problems": 2
},
"type": "possible_preservation",
"workflow": "stateequation"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 384
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 1,
"aneg": 1,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "((1 <= p7) AND (2 <= p26))",
"processed_size": 26,
"rewrites": 20
},
"result":
{
"edges": 2,
"markings": 3,
"produced_by": "parallel",
"value": true
},
"task":
{
"compoundnumber": 6,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "tscc preserving/always up"
}
},
"stateequation":
{
"literals": 2,
"problems": 2
},
"store":
{
"type": "dfs/tscc"
},
"type": "possible_invariance",
"workflow": "stateequation"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 448
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 1,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 1,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "EG(AF(((p1 <= 0) OR (p24 <= 1))))",
"processed_size": 34,
"rewrites": 18
},
"net":
{
"conflict_clusters": 7,
"singleton_clusters": 0
},
"result":
{
"edges": 7302,
"markings": 5107,
"produced_by": "CTL model checker",
"value": true
},
"task":
{
"compoundnumber": 7,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 538
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 1,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 1,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 2,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "EF((AG(((p10 <= 1))) AND ((2 <= p21) AND (1 <= p24))))",
"processed_size": 54,
"rewrites": 18
},
"net":
{
"conflict_clusters": 7,
"singleton_clusters": 0
},
"result":
{
"edges": 44670805,
"markings": 3349538,
"produced_by": "CTL model checker",
"value": true
},
"task":
{
"compoundnumber": 8,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 667
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 3,
"F": 2,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "EF(EG(EF(((2 <= p17) AND (1 <= p23)))))",
"processed_size": 39,
"rewrites": 19
},
"net":
{
"conflict_clusters": 7,
"singleton_clusters": 0
},
"result":
{
"edges": 538803290,
"markings": 27950678,
"produced_by": "CTL model checker",
"value": false
},
"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": 775
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 1,
"F": 1,
"G": 0,
"U": 1,
"X": 0,
"aconj": 4,
"adisj": 0,
"aneg": 0,
"comp": 8,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 8,
"taut": 0,
"tconj": 0,
"tdisj": 2,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 8,
"visible_transitions": 0
},
"processed": "(A(EF(((2 <= p11) AND (1 <= p13))) U ((2 <= p15) AND (1 <= p26))) OR (((2 <= p19) AND (1 <= p21)) OR ((2 <= p1) AND (1 <= p17))))",
"processed_size": 129,
"rewrites": 18
},
"net":
{
"conflict_clusters": 7,
"singleton_clusters": 0
},
"result":
{
"edges": 941326,
"markings": 134937,
"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": 1163
},
"child":
[

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 2326
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 2,
"adisj": 1,
"aneg": 1,
"comp": 7,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 7,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 6,
"visible_transitions": 0
},
"processed": "(((p3 <= 0) OR (p26 <= 1) OR (p11 <= 0) OR (p15 <= 1) OR (p14 <= 0)) AND ((p7 <= 0) OR (p15 <= 1)))",
"processed_size": 104,
"rewrites": 19
},
"result":
{
"edges": 9,
"markings": 9,
"produced_by": "state space / EG",
"value": false
},
"task":
{
"compoundnumber": 12,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 112
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 7,
"problems": 2
},
"type": "eventual_occurrence",
"workflow": "stateequation"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 11,
"type": "boolean"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 2326
},
"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": "((2 <= p1) AND (1 <= p17))",
"processed_size": 26,
"rewrites": 16
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 12,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 0,
"G": 0,
"U": 1,
"X": 0,
"aconj": 1,
"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": "E ((((1 <= p17) AND (2 <= p19)) U ((p13 <= 0) OR (p15 <= 1))))",
"processed_size": 63,
"rewrites": 19
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "state space /EU",
"value": true
},
"task":
{
"compoundnumber": 14,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "eu preserving",
"visible": 42
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 2,
"problems": 2
},
"type": "existential_until",
"workflow": "stateequation"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": null
},
"task":
{
"compoundnumber": 12,
"type": "boolean"
}
},

{
"child":
[

{
"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": "((2 <= p1) AND (1 <= p17))",
"processed_size": 26,
"rewrites": 16
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 13,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 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": "((p12 <= 0) OR (p17 <= 1))",
"processed_size": 27,
"rewrites": 19
},
"result":
{
"edges": 11,
"markings": 11,
"produced_by": "state space / EG",
"value": false
},
"task":
{
"compoundnumber": 14,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 43
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 2,
"problems": 2
},
"type": "eventual_occurrence",
"workflow": "stateequation"
}
}
],
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 13,
"type": "boolean"
}
}
],
"exit":
{
"error": null,
"memory": 41992,
"runtime": 1244.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "CTLFireability.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "E(F(E(G(A(X(**)))))) : (A((E(F(**)) U **)) OR (** OR **)) : ((** AND E(F(**))) OR (A(F(**)) AND E((** U **)))) : (E(G(**)) OR (** OR (A(X(**)) AND E((** U **))))) : (A(F(A(X(**)))) OR (** OR **)) : E(F((A(G(*)) AND (** AND **)))) : (A(F(**)) OR **) : E(X((** AND (E(F(**)) AND **)))) : E(F(E(G(E(F(**)))))) : E(F((** AND A(X(**))))) : E(G(A(F(*)))) : E(G(*)) : E(F(A(G(**))))"
},
"net":
{
"arcs": 760,
"conflict_clusters": 7,
"places": 27,
"places_significant": 27,
"singleton_clusters": 0,
"transitions": 260
},
"result":
{
"preliminary_value": "no no no yes no yes no yes no yes yes yes yes ",
"value": "no no no yes no yes no yes no yes yes yes yes "
},
"task":
{
"type": "compound"
}
}
lola: LoLA will run for 3570 seconds at most (--timelimit)
lola: NET
lola: input: PNML file (--pnml)
lola: reading net from model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file model.pnml
lola: 287/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 864
lola: finding significant places
lola: 27 places, 260 transitions, 27 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: atomic prop true by contained trap!
lola: atomic prop true by contained trap!
lola: atomic prop true by contained trap!
lola: E (F (E (G (A (X (((2 <= p1) AND (1 <= p21)))))))) : ((A ((E (F (((2 <= p11) AND (1 <= p13)))) U ((2 <= p15) AND (1 <= p26)))) OR ((2 <= p19) AND (1 <= p21))) OR ((2 <= p1) AND (1 <= p17))) : ((((2 <= p1) AND (1 <= p17)) AND E (F ((((1 <= p17) AND (2 <= p19)) OR ((1 <= p17) AND (2 <= p23)) OR ((2 <= p10) AND (1 <= p13) AND (2 <= p24) AND (1 <= p25)))))) OR (A (F (((1 <= p12) AND (2 <= p17)))) AND E ((((1 <= p17) AND (2 <= p19)) U ((p13 <= 0) OR (p15 <= 1)))))) : ((E (G ((((2 <= p1) AND (1 <= p17)) OR (p2 <= 1) OR (p7 <= 0)))) OR ((2 <= p12))) OR (A (X ((p14 <= 0))) AND E ((((2 <= p1) AND (1 <= p3)) U ((1 <= p1) AND (2 <= p13)))))) : ((A (F (A (X (((1 <= p7) AND (2 <= p26)))))) OR ((2 <= p17) AND (1 <= p21))) OR ((2 <= p11) AND (1 <= p13))) : E (F (((NOT(E (F (((2 <= p10))))) AND (2 <= p21)) AND (1 <= p24)))) : (A (F ((((1 <= p3) AND (2 <= p26) AND (1 <= p11) AND (2 <= p15) AND (1 <= p14)) OR ((1 <= p7) AND (2 <= p15))))) OR ((2 <= p10))) : E (X (((((1 <= p7) AND (2 <= p10)) AND E (F (((1 <= p1) AND (2 <= p17))))) AND A (((1 <= 0) U (1 <= p18)))))) : E (F (E (G (E (F (((2 <= p17) AND (1 <= p23)))))))) : E (F ((((1 <= p3) AND (2 <= p5)) AND A (X ((p4 <= 0)))))) : E (G (NOT(E (G (((1 <= p1) AND (2 <= p24))))))) : NOT(A (F (((2 <= p17) AND (1 <= p19))))) : E (F (A (G (((p7 <= 0) OR (p26 <= 1))))))
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: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:98
lola: rewrite Frontend/Parser/formula_rewrite.k:184
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (E (G (A (X (((2 <= p1) AND (1 <= p21))))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:812
lola: rewrite Frontend/Parser/formula_rewrite.k:808
lola: rewrite Frontend/Parser/formula_rewrite.k:806
lola: processed formula: EF(EG(AX(((2 <= p1) AND (1 <= p21)))))
lola: processed formula length: 38
lola: 19 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: 1030808 markings, 8714163 edges, 206162 markings/sec, 0 secs
lola: 1906983 markings, 16440557 edges, 175235 markings/sec, 5 secs
lola: 2785054 markings, 24399510 edges, 175614 markings/sec, 10 secs
lola: 3712311 markings, 32473275 edges, 185451 markings/sec, 15 secs
lola: 4514686 markings, 39878459 edges, 160475 markings/sec, 20 secs
lola: 5355910 markings, 47699144 edges, 168245 markings/sec, 25 secs
lola: 6150819 markings, 54925063 edges, 158982 markings/sec, 30 secs
lola: 6997457 markings, 62322728 edges, 169328 markings/sec, 35 secs
lola: 7764547 markings, 69370722 edges, 153418 markings/sec, 40 secs
lola: 8554362 markings, 76741860 edges, 157963 markings/sec, 45 secs
lola: 9344612 markings, 83931829 edges, 158050 markings/sec, 50 secs
lola: 10140085 markings, 91228107 edges, 159095 markings/sec, 55 secs
lola: 10874264 markings, 98394851 edges, 146836 markings/sec, 60 secs
lola: 11625902 markings, 105950136 edges, 150328 markings/sec, 65 secs
lola: 12374221 markings, 113100764 edges, 149664 markings/sec, 70 secs
lola: 13124723 markings, 119912848 edges, 150100 markings/sec, 75 secs
lola: 13907622 markings, 126920256 edges, 156580 markings/sec, 80 secs
lola: 14684159 markings, 134101861 edges, 155307 markings/sec, 85 secs
lola: 15426724 markings, 141051949 edges, 148513 markings/sec, 90 secs
lola: 16206469 markings, 148111073 edges, 155949 markings/sec, 95 secs
lola: 16994190 markings, 155370418 edges, 157544 markings/sec, 100 secs
lola: 17714198 markings, 162481951 edges, 144002 markings/sec, 105 secs
lola: 18432745 markings, 169533001 edges, 143709 markings/sec, 110 secs
lola: 19022832 markings, 175458200 edges, 118017 markings/sec, 115 secs
lola: 19868262 markings, 183085944 edges, 169086 markings/sec, 120 secs
lola: 20596520 markings, 189922226 edges, 145652 markings/sec, 125 secs
lola: 21354912 markings, 197229087 edges, 151678 markings/sec, 130 secs
lola: 22033689 markings, 203908326 edges, 135755 markings/sec, 135 secs
lola: 22693226 markings, 210411645 edges, 131907 markings/sec, 140 secs
lola: 23439473 markings, 217476665 edges, 149249 markings/sec, 145 secs
lola: 24086459 markings, 223903975 edges, 129397 markings/sec, 150 secs
lola: 24686444 markings, 230352115 edges, 119997 markings/sec, 155 secs
lola: 25338209 markings, 237012248 edges, 130353 markings/sec, 160 secs
lola: 26061867 markings, 244741917 edges, 144732 markings/sec, 165 secs
lola: 26746850 markings, 252092495 edges, 136997 markings/sec, 170 secs
lola: 27451293 markings, 259605872 edges, 140889 markings/sec, 175 secs
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 27950678 markings, 264975584 edges
lola: ========================================
lola: subprocess 1 will run for 224 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E (G ((((2 <= p1) AND (1 <= p17)) OR (p2 <= 1) OR (p7 <= 0)))) OR (((2 <= p12)) OR (A (X ((p14 <= 0))) AND E ((((2 <= p1) AND (1 <= p3)) U ((1 <= p1) AND (2 <= p13)))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 1 will run for 224 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((2 <= p12))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((2 <= p12))
lola: processed formula length: 12
lola: 16 rewrites
lola: closed formula file CTLFireability.xml
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 2 will run for 244 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E ((((2 <= p1) AND (1 <= p3)) U ((1 <= p1) AND (2 <= p13))))
lola: ========================================
lola: SUBTASK
lola: checking existential until
lola: rewrite Frontend/Parser/formula_rewrite.k:618
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: rewrite Frontend/Parser/formula_rewrite.k:738
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: E ((((2 <= p1) AND (1 <= p3)) U ((1 <= p1) AND (2 <= p13))))
lola: processed formula length: 60
lola: 19 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /EU)
lola: state space: using reachability graph (EU version) (--search=depth)
lola: state space: using eu preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((1 <= p1) AND (2 <= p13))
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-2-0.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space /EU
lola: There is no path where Predicate Phi holds until Predicate Psi.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 3 will run for 269 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G ((((2 <= p1) AND (1 <= p17)) OR (p2 <= 1) OR (p7 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation
lola: rewrite Frontend/Parser/formula_rewrite.k:583
lola: processed formula: E (G ((((2 <= p1) AND (1 <= p17)) OR (p2 <= 1) OR (p7 <= 0))))
lola: processed formula length: 64
lola: 17 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: yes
lola: produced by: state space / EG
lola: The predicate is possibly preserved.
lola: 11 markings, 11 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 2 will run for 244 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (F (A (X (((1 <= p7) AND (2 <= p26)))))) OR (((2 <= p17) AND (1 <= p21)) OR ((2 <= p11) AND (1 <= p13))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 2 will run for 244 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (((2 <= p17) AND (1 <= p21)) OR ((2 <= p11) AND (1 <= p13)))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: rewrite Frontend/Parser/formula_rewrite.k:797
lola: processed formula: (((2 <= p17) AND (1 <= p21)) OR ((2 <= p11) AND (1 <= p13)))
lola: processed formula length: 60
lola: 17 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 3 will run for 269 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (A (X (((1 <= p7) AND (2 <= p26))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:812
lola: rewrite Frontend/Parser/formula_rewrite.k:811
lola: processed formula: AF(AX(((1 <= p7) AND (2 <= p26))))
lola: processed formula length: 34
lola: 18 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 6 markings, 6 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 3 will run for 269 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (X ((((1 <= p7) AND (2 <= p10)) AND (E (F (((1 <= p1) AND (2 <= p17)))) AND (1 <= p18)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:806
lola: rewrite Frontend/Parser/formula_rewrite.k:807
lola: processed formula: EX((((1 <= p7) AND (2 <= p10)) AND (EF(((1 <= p1) AND (2 <= p17))) AND (1 <= p18))))
lola: processed formula length: 84
lola: 18 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 6847 markings, 37257 edges
lola: ========================================
lola: subprocess 4 will run for 299 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((((1 <= p3) AND (2 <= p5)) AND A (X ((p4 <= 0))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:812
lola: rewrite Frontend/Parser/formula_rewrite.k:806
lola: processed formula: EF((((1 <= p3) AND (2 <= p5)) AND AX((p4 <= 0))))
lola: processed formula length: 49
lola: 18 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 5857 markings, 29211 edges
lola: ========================================
lola: subprocess 5 will run for 336 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G (((p17 <= 1) OR (p19 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation
lola: rewrite Frontend/Parser/formula_rewrite.k:583
lola: processed formula: E (G (((p17 <= 1) OR (p19 <= 0))))
lola: processed formula length: 35
lola: 17 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:788
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((2 <= p17) AND (1 <= p19))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space / EG
lola: The predicate is possibly preserved.
lola: 10 markings, 10 edges
lola: ========================================
lola: subprocess 6 will run for 384 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (A (G (((p7 <= 0) OR (p26 <= 1))))))
lola: ========================================
lola: SUBTASK
lola: checking possible invariance
lola: rewrite Frontend/Parser/formula_rewrite.k:604
lola: rewrite Frontend/Parser/formula_rewrite.k:614
lola: rewrite Frontend/Parser/formula_rewrite.k:726
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: ((1 <= p7) AND (2 <= p26))
lola: processed formula length: 26
lola: 20 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using tscc preserving stubborn set method (--stubborn)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: parallel
lola: The predicate is possibly invariant.
lola: 3 markings, 2 edges
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: ((p7 <= 0) OR (p26 <= 1))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 2 literals and 2 conjunctive subformulas
lola: state equation task get result started, id 1
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: state equation task get result rewrite finished id 1
lola: state equation task get result unparse finished++ id 1
lola: formula 1: ((1 <= p7) AND (2 <= p26))
lola: state equation task get result unparse finished id 1
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to CTLFireability-6-1.sara
lola: state equation: calling and running sara
lola: ========================================
lola: subprocess 7 will run for 448 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G (A (F (((p1 <= 0) OR (p24 <= 1))))))
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(((p1 <= 0) OR (p24 <= 1))))
lola: processed formula length: 34
lola: 18 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).
sara: try reading problem file CTLFireability-6-1.sara.
sara: error: :60: error near 'TRANSITION': syntax error, unexpected KEY_TRANSITION, expecting SEMICOLON or COMMA
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: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 5107 markings, 7302 edges
lola: ========================================
lola: subprocess 8 will run for 538 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((A (G (((p10 <= 1)))) AND ((2 <= p21) AND (1 <= p24)))))
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((AG(((p10 <= 1))) AND ((2 <= p21) AND (1 <= p24))))
lola: processed formula length: 54
lola: 18 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: 801585 markings, 10472419 edges, 160317 markings/sec, 0 secs
lola: 1501627 markings, 19938705 edges, 140008 markings/sec, 5 secs
lola: 2170760 markings, 28875076 edges, 133827 markings/sec, 10 secs
lola: 2741537 markings, 36760694 edges, 114155 markings/sec, 15 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 3349538 markings, 44670805 edges
lola: ========================================
lola: subprocess 9 will run for 667 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (E (G (E (F (((2 <= p17) AND (1 <= p23))))))))
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:806
lola: processed formula: EF(EG(EF(((2 <= p17) AND (1 <= p23)))))
lola: processed formula length: 39
lola: 19 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: 1244459 markings, 9387636 edges, 248892 markings/sec, 0 secs
lola: 2210809 markings, 18497041 edges, 193270 markings/sec, 5 secs
lola: 3198587 markings, 27092345 edges, 197556 markings/sec, 10 secs
lola: 4080977 markings, 34118199 edges, 176478 markings/sec, 15 secs
lola: 4870249 markings, 41694115 edges, 157854 markings/sec, 20 secs
lola: 5640344 markings, 49376445 edges, 154019 markings/sec, 25 secs
lola: 6616966 markings, 57279119 edges, 195324 markings/sec, 30 secs
lola: 7551949 markings, 65293398 edges, 186997 markings/sec, 35 secs
lola: 8388149 markings, 73462476 edges, 167240 markings/sec, 40 secs
lola: 9215264 markings, 81011627 edges, 165423 markings/sec, 45 secs
lola: 10219414 markings, 89133203 edges, 200830 markings/sec, 50 secs
lola: 11032296 markings, 97082291 edges, 162576 markings/sec, 55 secs
lola: 11727878 markings, 104191867 edges, 139116 markings/sec, 60 secs
lola: 12397383 markings, 110942284 edges, 133901 markings/sec, 65 secs
lola: 13264246 markings, 117979358 edges, 173373 markings/sec, 70 secs
lola: 14055947 markings, 124568620 edges, 158340 markings/sec, 75 secs
lola: 14808454 markings, 131871786 edges, 150501 markings/sec, 80 secs
lola: 15500792 markings, 138890727 edges, 138468 markings/sec, 85 secs
lola: 16405631 markings, 146174685 edges, 180968 markings/sec, 90 secs
lola: 17144815 markings, 152668870 edges, 147837 markings/sec, 95 secs
lola: 17929977 markings, 160428187 edges, 157032 markings/sec, 100 secs
lola: 18677375 markings, 168124037 edges, 149480 markings/sec, 105 secs
lola: 19418995 markings, 174998657 edges, 148324 markings/sec, 110 secs
lola: 20368827 markings, 182652566 edges, 189966 markings/sec, 115 secs
lola: 21087621 markings, 189640546 edges, 143759 markings/sec, 120 secs
lola: 21777614 markings, 196560606 edges, 137999 markings/sec, 125 secs
lola: 22328802 markings, 202292886 edges, 110238 markings/sec, 130 secs
lola: 23107065 markings, 208980346 edges, 155653 markings/sec, 135 secs
lola: 23854815 markings, 215459922 edges, 149550 markings/sec, 140 secs
lola: 24445775 markings, 221752002 edges, 118192 markings/sec, 145 secs
lola: 25174991 markings, 229369817 edges, 145843 markings/sec, 150 secs
lola: 25890910 markings, 237268176 edges, 143184 markings/sec, 155 secs
lola: 26628230 markings, 245273846 edges, 147464 markings/sec, 160 secs
lola: 27367563 markings, 253290499 edges, 147867 markings/sec, 165 secs
lola: 27950678 markings, 261749010 edges, 116623 markings/sec, 170 secs
lola: 27950678 markings, 272375801 edges, 0 markings/sec, 175 secs
lola: 27950678 markings, 282450713 edges, 0 markings/sec, 180 secs
lola: 27950678 markings, 291936764 edges, 0 markings/sec, 185 secs
lola: 27950678 markings, 300734373 edges, 0 markings/sec, 190 secs
lola: 27950678 markings, 309897400 edges, 0 markings/sec, 195 secs
lola: 27950678 markings, 318595321 edges, 0 markings/sec, 200 secs
lola: 27950678 markings, 327209184 edges, 0 markings/sec, 205 secs
lola: 27950678 markings, 335172828 edges, 0 markings/sec, 210 secs
lola: 27950678 markings, 343293740 edges, 0 markings/sec, 215 secs
lola: 27950678 markings, 352005855 edges, 0 markings/sec, 220 secs
lola: 27950678 markings, 359963946 edges, 0 markings/sec, 225 secs
lola: 27950678 markings, 368986875 edges, 0 markings/sec, 230 secs
lola: 27950678 markings, 377490964 edges, 0 markings/sec, 235 secs
lola: 27950678 markings, 385864954 edges, 0 markings/sec, 240 secs
lola: 27950678 markings, 393900637 edges, 0 markings/sec, 245 secs
lola: 27950678 markings, 401724468 edges, 0 markings/sec, 250 secs
lola: 27950678 markings, 409440969 edges, 0 markings/sec, 255 secs
lola: 27950678 markings, 418157693 edges, 0 markings/sec, 260 secs
lola: 27950678 markings, 425740114 edges, 0 markings/sec, 265 secs
lola: 27950678 markings, 433796382 edges, 0 markings/sec, 270 secs
lola: 27950678 markings, 441796362 edges, 0 markings/sec, 275 secs
lola: 27950678 markings, 449317547 edges, 0 markings/sec, 280 secs
lola: 27950678 markings, 457462479 edges, 0 markings/sec, 285 secs
lola: 27950678 markings, 464691489 edges, 0 markings/sec, 290 secs
lola: 27950678 markings, 472583648 edges, 0 markings/sec, 295 secs
lola: 27950678 markings, 480014412 edges, 0 markings/sec, 300 secs
lola: 27950678 markings, 488062138 edges, 0 markings/sec, 305 secs
lola: 27950678 markings, 495624677 edges, 0 markings/sec, 310 secs
lola: 27950678 markings, 502820333 edges, 0 markings/sec, 315 secs
lola: 27950678 markings, 509908826 edges, 0 markings/sec, 320 secs
lola: 27950678 markings, 518397613 edges, 0 markings/sec, 325 secs
lola: 27950678 markings, 526932988 edges, 0 markings/sec, 330 secs
lola: 27950678 markings, 535491529 edges, 0 markings/sec, 335 secs
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 27950678 markings, 538803290 edges
lola: ========================================
lola: subprocess 10 will run for 775 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A ((E (F (((2 <= p11) AND (1 <= p13)))) U ((2 <= p15) AND (1 <= p26)))) OR (((2 <= p19) AND (1 <= p21)) OR ((2 <= p1) AND (1 <= p17))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:806
lola: rewrite Frontend/Parser/formula_rewrite.k:814
lola: processed formula: (A(EF(((2 <= p11) AND (1 <= p13))) U ((2 <= p15) AND (1 <= p26))) OR (((2 <= p19) AND (1 <= p21)) OR ((2 <= p1) AND (1 <= p17))))
lola: processed formula length: 129
lola: 18 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: 134937 markings, 941326 edges
lola: ========================================
lola: subprocess 11 will run for 1163 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (F ((((1 <= p3) AND (2 <= p26) AND (1 <= p11) AND (2 <= p15) AND (1 <= p14)) OR ((1 <= p7) AND (2 <= p15))))) OR ((2 <= p10)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 11 will run for 1163 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((2 <= p10))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((2 <= p10))
lola: processed formula length: 12
lola: 16 rewrites
lola: closed formula file CTLFireability.xml
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 12 will run for 2326 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F ((((1 <= p3) AND (2 <= p26) AND (1 <= p11) AND (2 <= p15) AND (1 <= p14)) OR ((1 <= p7) AND (2 <= p15)))))
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: (((p3 <= 0) OR (p26 <= 1) OR (p11 <= 0) OR (p15 <= 1) OR (p14 <= 0)) AND ((p7 <= 0) OR (p15 <= 1)))
lola: processed formula length: 104
lola: 19 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 <= p3) AND (2 <= p26) AND (1 <= p11) AND (2 <= p15) AND (1 <= p14)) OR ((1 <= p7) AND (2 <= p15)))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 7 literals and 2 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space / EG
lola: The predicate does not eventually occur.
lola: 9 markings, 9 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 12 will run for 2326 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((((2 <= p1) AND (1 <= p17)) AND E (F ((((1 <= p17) AND (2 <= p19)) OR ((1 <= p17) AND (2 <= p23)) OR ((2 <= p10) AND (1 <= p13) AND (2 <= p24) AND (1 <= p25)))))) OR (A (F (((1 <= p12) AND (2 <= p17)))) AND E ((((1 <= p17) AND (2 <= p19)) U ((p13 <= 0) OR (p15 <= 1))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 12 will run for 2326 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((2 <= p1) AND (1 <= p17))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((2 <= p1) AND (1 <= p17))
lola: processed formula length: 26
lola: 16 rewrites
lola: closed formula file CTLFireability.xml
lola: processed formula with 2 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 14 will run for 1 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E ((((1 <= p17) AND (2 <= p19)) U ((p13 <= 0) OR (p15 <= 1))))
lola: ========================================
lola: SUBTASK
lola: checking existential until
lola: rewrite Frontend/Parser/formula_rewrite.k:618
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: rewrite Frontend/Parser/formula_rewrite.k:738
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: E ((((1 <= p17) AND (2 <= p19)) U ((p13 <= 0) OR (p15 <= 1))))
lola: processed formula length: 63
lola: 19 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /EU)
lola: state space: using reachability graph (EU version) (--search=depth)
lola: state space: using eu preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((p13 <= 0) OR (p15 <= 1))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 2 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to CTLFireability-14-0.sara
lola: lola: SUBRESULT
lola: result: yes
lola: produced by: state space /EU
lola: There is a path where Predicate Phi holds until Predicate Psi.
lola: 0 markings, 0 edges
lola: ========================================
lola: SUBRESULT
lola: result: unknown
lola: The Boolean predicate may be true or false.
lola: ========================================
lola: ========================================
lola: ...considering subproblem: ((((2 <= p1) AND (1 <= p17)) AND E (F ((((1 <= p17) AND (2 <= p19)) OR ((1 <= p17) AND (2 <= p23)) OR ((2 <= p10) AND (1 <= p13) AND (2 <= p24) AND (1 <= p25)))))) OR (A (F (((1 <= p12) AND (2 <= p17)))) AND E ((((1 <= p17) AND (2 <= p19)) U ((p13 <= 0) OR (p15 <= 1))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: ...considering subproblem: ((2 <= p1) AND (1 <= p17))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((2 <= p1) AND (1 <= p17))
lola: processed formula length: 26
lola: 16 rewrites
lola: closed formula file CTLFireability.xml
lola: processed formula with 2 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: ========================================
lola: ...considering subproblem: A (F (((1 <= p12) AND (2 <= p17))))
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: ((p12 <= 0) OR (p17 <= 1))
lola: processed formula length: 27
lola: 19 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: 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: The predicate does not eventually occur.
lola: 11 markings, 11 edges
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((1 <= p12) AND (2 <= p17))
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: The Boolean predicate is false.
lola: ========================================
lola: RESULT
lola:
SUMMARY: no no no yes no yes no yes no yes yes yes yes
lola:
preliminary result: no no no yes no yes no yes no yes yes yes yes
lola: ========================================
lola: memory consumption: 41992 KB
lola: time consumption: 1244 seconds
lola: print data as JSON (--json)
lola: writing JSON to CTLFireability.json
lola: closed JSON file CTLFireability.json
rslt: finished

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

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="DNAwalker-PT-10ringRL"
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 DNAwalker-PT-10ringRL, 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 r178-tajo-158987882000156"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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