Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2020-input.r172-smll-158987827600228.qcow2', fmt=qcow2 size=4294967296 backing_file='/data/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 Raft-PT-03, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r172-smll-158987827600228
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 204K
-rw-r--r-- 1 mcc users 3.1K Apr 12 07:56 CTLCardinality.txt
-rw-r--r-- 1 mcc users 19K Apr 12 07:56 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Apr 11 08:56 CTLFireability.txt
-rw-r--r-- 1 mcc users 19K Apr 11 08:56 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 24 05:38 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 5.8K Mar 24 05:38 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 2.8K Apr 14 12:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 21K Apr 28 14:02 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.8K Apr 14 12:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 28 14:02 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K Apr 10 14:45 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 18K Apr 10 14:45 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Apr 9 21:20 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 9 21:20 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K Apr 10 22:28 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.5K Apr 10 22:28 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 24 05:38 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 24 05:38 instance
-rw-r--r-- 1 mcc users 6 Mar 24 05:38 iscolored
-rw-r--r-- 1 mcc users 24K Mar 24 05:38 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 Raft-PT-03-CTLFireability-00
FORMULA_NAME Raft-PT-03-CTLFireability-01
FORMULA_NAME Raft-PT-03-CTLFireability-02
FORMULA_NAME Raft-PT-03-CTLFireability-03
FORMULA_NAME Raft-PT-03-CTLFireability-04
FORMULA_NAME Raft-PT-03-CTLFireability-05
FORMULA_NAME Raft-PT-03-CTLFireability-06
FORMULA_NAME Raft-PT-03-CTLFireability-07
FORMULA_NAME Raft-PT-03-CTLFireability-08
FORMULA_NAME Raft-PT-03-CTLFireability-09
FORMULA_NAME Raft-PT-03-CTLFireability-10
FORMULA_NAME Raft-PT-03-CTLFireability-11
FORMULA_NAME Raft-PT-03-CTLFireability-12
FORMULA_NAME Raft-PT-03-CTLFireability-13
FORMULA_NAME Raft-PT-03-CTLFireability-14
FORMULA_NAME Raft-PT-03-CTLFireability-15

=== Now, execution of the tool begins

BK_START 1591330526453

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-05 04:15:29] [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 04:15:29] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-05 04:15:29] [INFO ] Load time of PNML (sax parser for PT used): 89 ms
[2020-06-05 04:15:29] [INFO ] Transformed 53 places.
[2020-06-05 04:15:29] [INFO ] Transformed 98 transitions.
[2020-06-05 04:15:29] [INFO ] Found NUPN structural information;
[2020-06-05 04:15:29] [INFO ] Parsed PT model containing 53 places and 98 transitions in 170 ms.
Ensure Unique test removed 14 transitions
Reduce redundant transitions removed 14 transitions.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 38 ms.
Incomplete random walk after 100000 steps, including 0 resets, run finished after 606 ms. (steps per millisecond=165 ) properties seen :[1, 0, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 0, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 0, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-06-05 04:15:30] [INFO ] Flow matrix only has 73 transitions (discarded 11 similar events)
// Phase 1: matrix 73 rows 53 cols
[2020-06-05 04:15:30] [INFO ] Computed 9 place invariants in 9 ms
[2020-06-05 04:15:30] [INFO ] [Real]Absence check using 9 positive place invariants in 29 ms returned sat
[2020-06-05 04:15:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 04:15:30] [INFO ] [Real]Absence check using state equation in 107 ms returned sat
[2020-06-05 04:15:30] [INFO ] State equation strengthened by 34 read => feed constraints.
[2020-06-05 04:15:30] [INFO ] [Real]Added 34 Read/Feed constraints in 31 ms returned sat
[2020-06-05 04:15:30] [INFO ] Computed and/alt/rep : 83/502/72 causal constraints in 22 ms.
[2020-06-05 04:15:31] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 04:15:31] [INFO ] [Nat]Absence check using 9 positive place invariants in 22 ms returned sat
[2020-06-05 04:15:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-05 04:15:31] [INFO ] [Nat]Absence check using state equation in 54 ms returned sat
[2020-06-05 04:15:31] [INFO ] [Nat]Added 34 Read/Feed constraints in 13 ms returned sat
[2020-06-05 04:15:31] [INFO ] Computed and/alt/rep : 83/502/72 causal constraints in 23 ms.
[2020-06-05 04:15:31] [INFO ] Added : 69 causal constraints over 14 iterations in 327 ms. Result :sat
[2020-06-05 04:15:31] [INFO ] [Real]Absence check using 9 positive place invariants in 9 ms returned unsat
[2020-06-05 04:15:31] [INFO ] [Real]Absence check using 9 positive place invariants in 9 ms returned sat
[2020-06-05 04:15:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 04:15:31] [INFO ] [Real]Absence check using state equation in 53 ms returned sat
[2020-06-05 04:15:31] [INFO ] [Real]Added 34 Read/Feed constraints in 29 ms returned sat
[2020-06-05 04:15:31] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 04:15:31] [INFO ] [Nat]Absence check using 9 positive place invariants in 15 ms returned sat
[2020-06-05 04:15:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-05 04:15:31] [INFO ] [Nat]Absence check using state equation in 44 ms returned sat
[2020-06-05 04:15:31] [INFO ] [Nat]Added 34 Read/Feed constraints in 14 ms returned sat
[2020-06-05 04:15:31] [INFO ] Computed and/alt/rep : 83/502/72 causal constraints in 12 ms.
[2020-06-05 04:15:31] [INFO ] Added : 67 causal constraints over 14 iterations in 184 ms. Result :sat
[2020-06-05 04:15:31] [INFO ] [Real]Absence check using 9 positive place invariants in 5 ms returned unsat
[2020-06-05 04:15:32] [INFO ] [Real]Absence check using 9 positive place invariants in 6 ms returned unsat
[2020-06-05 04:15:32] [INFO ] [Real]Absence check using 9 positive place invariants in 7 ms returned sat
[2020-06-05 04:15:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 04:15:32] [INFO ] [Real]Absence check using state equation in 35 ms returned sat
[2020-06-05 04:15:32] [INFO ] [Real]Added 34 Read/Feed constraints in 6 ms returned sat
[2020-06-05 04:15:32] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 04:15:32] [INFO ] [Nat]Absence check using 9 positive place invariants in 9 ms returned sat
[2020-06-05 04:15:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-05 04:15:32] [INFO ] [Nat]Absence check using state equation in 34 ms returned sat
[2020-06-05 04:15:32] [INFO ] [Nat]Added 34 Read/Feed constraints in 7 ms returned sat
[2020-06-05 04:15:32] [INFO ] Computed and/alt/rep : 83/502/72 causal constraints in 10 ms.
[2020-06-05 04:15:32] [INFO ] Added : 61 causal constraints over 13 iterations in 187 ms. Result :sat
[2020-06-05 04:15:32] [INFO ] Deduced a trap composed of 10 places in 42 ms
[2020-06-05 04:15:32] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 69 ms
[2020-06-05 04:15:32] [INFO ] [Real]Absence check using 9 positive place invariants in 9 ms returned sat
[2020-06-05 04:15:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 04:15:32] [INFO ] [Real]Absence check using state equation in 53 ms returned sat
[2020-06-05 04:15:32] [INFO ] [Real]Added 34 Read/Feed constraints in 10 ms returned sat
[2020-06-05 04:15:32] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 04:15:32] [INFO ] [Nat]Absence check using 9 positive place invariants in 12 ms returned sat
[2020-06-05 04:15:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-05 04:15:32] [INFO ] [Nat]Absence check using state equation in 50 ms returned sat
[2020-06-05 04:15:32] [INFO ] [Nat]Added 34 Read/Feed constraints in 8 ms returned sat
[2020-06-05 04:15:32] [INFO ] Computed and/alt/rep : 83/502/72 causal constraints in 18 ms.
[2020-06-05 04:15:32] [INFO ] Added : 60 causal constraints over 12 iterations in 222 ms. Result :sat
Successfully simplified 3 atomic propositions for a total of 3 simplifications.
[2020-06-05 04:15:33] [INFO ] Initial state reduction rules for CTL removed 4 formulas.
[2020-06-05 04:15:33] [INFO ] Flatten gal took : 89 ms
[2020-06-05 04:15:33] [INFO ] Initial state reduction rules for CTL removed 4 formulas.
[2020-06-05 04:15:33] [INFO ] Flatten gal took : 24 ms
FORMULA Raft-PT-03-CTLFireability-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Raft-PT-03-CTLFireability-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Raft-PT-03-CTLFireability-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Raft-PT-03-CTLFireability-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-06-05 04:15:33] [INFO ] Export to MCC properties in file /home/mcc/execution/CTLFireability.sr.xml took 8 ms.
[2020-06-05 04:15:33] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 4 ms.
info: Time: 3600 - MCC
vrfy: Checking CTLFireability @ Raft-PT-03 @ 3570 seconds

FORMULA Raft-PT-03-CTLFireability-00 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Raft-PT-03-CTLFireability-08 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Raft-PT-03-CTLFireability-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Raft-PT-03-CTLFireability-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Raft-PT-03-CTLFireability-07 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Raft-PT-03-CTLFireability-04 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Raft-PT-03-CTLFireability-06 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Raft-PT-03-CTLFireability-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Raft-PT-03-CTLFireability-05 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Raft-PT-03-CTLFireability-01 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Raft-PT-03-CTLFireability-02 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

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

{
"build":
{
"architecture": 64,
"assertions": false,
"build_hostname": "mcc2019",
"build_system": "x86_64-unknown-linux-gnu",
"optimizations": true,
"package_version": "2.0",
"svn_version": "3189M"
},
"call":
{
"exec_host": "mcc2020",
"markinglimit": null,
"parameters":
[
"--pnmlnet",
"model.pnml",
"--xmlformula",
"--formula=CTLFireability.xml",
"--mcc",
"--donotcomputecapacities",
"--encoder=simplecompressed",
"--safe",
"--check=modelchecking",
"--stubborn=tarjan",
"--stateequation=par",
"--quickchecks",
"--timelimit=3570",
"--localtimelimit=0",
"--preference=force_ctl",
"--json=CTLFireability.json",
"--jsoninclude=formula,formulastat,net"
],
"starttime": "Fri Jun 5 04:15:34 2020
",
"timelimit": 3570
},
"child":
[

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 297
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"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": "A (G (((p33 <= 0) OR (p52 <= 0) OR (p17 <= 0) OR (p45 <= 0))))",
"processed_size": 65,
"rewrites": 35
},
"result":
{
"edges": 4,
"markings": 5,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 0,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 4,
"problems": 4
},
"type": "invariance",
"workflow": "stateequation||search"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 0,
"type": "boolean"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 324
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 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": "((p16 <= 0) OR (p45 <= 0))",
"processed_size": 27,
"rewrites": 33
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 3,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 364
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 2,
"adisj": 0,
"aneg": 2,
"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": "A ((((p27 <= 0) OR (p40 <= 0)) R ((p1 <= 0) OR (p40 <= 0))))",
"processed_size": 62,
"rewrites": 38
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "state space /EU",
"value": true
},
"task":
{
"compoundnumber": 4,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "eu preserving",
"visible": 19
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 2,
"problems": 2
},
"type": "universal_release",
"workflow": "stateequation"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 364
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 2,
"F": 1,
"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(EF(AX(((1 <= p18) AND (1 <= p45)))))",
"processed_size": 39,
"rewrites": 36
},
"net":
{
"conflict_clusters": 11,
"singleton_clusters": 0
},
"result":
{
"edges": 243838547,
"markings": 33819620,
"produced_by": "CTL model checker",
"value": false
},
"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": 365
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"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": "E (G (((p39 <= 0))))",
"processed_size": 20,
"rewrites": 34
},
"result":
{
"edges": 4,
"markings": 4,
"produced_by": "state space / EG",
"value": true
},
"task":
{
"compoundnumber": 5,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 3
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "possible_preservation",
"workflow": "stateequation"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 426
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"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": "((1 <= p16) AND (1 <= p45) AND (1 <= p4) AND (1 <= p40))",
"processed_size": 56,
"rewrites": 37
},
"result":
{
"edges": 4655387,
"markings": 1828911,
"produced_by": "parallel",
"value": false
},
"task":
{
"compoundnumber": 6,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "tscc preserving/always up"
}
},
"stateequation":
{
"literals": 4,
"problems": 4
},
"store":
{
"type": "dfs/tscc"
},
"type": "possible_invariance",
"workflow": "stateequation"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 510
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 1,
"aneg": 0,
"comp": 6,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 6,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 6,
"visible_transitions": 0
},
"processed": "((1 <= p20) AND (1 <= p40) AND (1 <= p47) AND (1 <= p50) AND ((p33 <= 0) OR (p52 <= 0)))",
"processed_size": 89,
"rewrites": 36
},
"result":
{
"edges": 27,
"markings": 25,
"produced_by": "state space /EFEG",
"value": true
},
"task":
{
"compoundnumber": 7,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 26
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 10,
"problems": 2
},
"type": "reachability_of_possible_preservation",
"workflow": "stateequation"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 638
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 2,
"F": 0,
"G": 1,
"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": "EG(E(((p34 <= 0)) U ((1 <= p12) AND (1 <= p35) AND (1 <= p41))))",
"processed_size": 64,
"rewrites": 35
},
"net":
{
"conflict_clusters": 11,
"singleton_clusters": 0
},
"result":
{
"edges": 237,
"markings": 150,
"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": 851
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 1,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 3,
"adisj": 1,
"aneg": 0,
"comp": 9,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 9,
"taut": 0,
"tconj": 1,
"tdisj": 2,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 8,
"visible_transitions": 0
},
"processed": "EF((((1 <= p10) AND (1 <= p35) AND (1 <= p40) AND (1 <= p48)) AND (((p45 <= 0)) OR (AG(((1 <= p30) AND (1 <= p45))) OR ((1 <= p34) AND (1 <= p22))))))",
"processed_size": 150,
"rewrites": 35
},
"net":
{
"conflict_clusters": 11,
"singleton_clusters": 0
},
"result":
{
"edges": 114893928,
"markings": 16911021,
"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": 1195
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1195
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 2,
"adisj": 0,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "(((1 <= p51) AND (1 <= p35)) OR ((1 <= p51)))",
"processed_size": 45,
"rewrites": 34
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 10,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 2391
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 3,
"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": 5,
"visible_transitions": 0
},
"processed": "A (G (((p31 <= 0) OR (((p30 <= 0) OR (p45 <= 0)) AND ((p9 <= 0) OR (p45 <= 0))) OR (p25 <= 0) OR (p45 <= 0))))",
"processed_size": 115,
"rewrites": 35
},
"result":
{
"edges": 4,
"markings": 5,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 11,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"type": "invariance",
"workflow": "stateequation||search"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 10,
"type": "boolean"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 2391
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 1,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "((p45 <= 0) OR (p46 <= 0))",
"processed_size": 27,
"rewrites": 33
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 11,
"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": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "A (G (((1 <= p25) AND (1 <= p45))))",
"processed_size": 35,
"rewrites": 35
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "state space",
"value": false
},
"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": "invariance",
"workflow": "stateequation||search"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": null
},
"task":
{
"compoundnumber": 11,
"type": "boolean"
}
},

{
"child":
[

{
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"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": "E (F (((p11 <= 0) OR (p35 <= 0))))",
"processed_size": 35,
"rewrites": 34
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 12,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 2,
"problems": 2
},
"type": "reachability",
"workflow": "stateequation||search"
}
},

{
"formula":
{
"count":
{
"A": 1,
"E": 1,
"F": 0,
"G": 1,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 1,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "AG(EX(((p22 <= 0) OR (p35 <= 0))))",
"processed_size": 35,
"rewrites": 35
},
"net":
{
"conflict_clusters": 11,
"singleton_clusters": 0
},
"result":
{
"edges": 243838548,
"markings": 33819621,
"produced_by": "CTL model checker",
"value": true
},
"task":
{
"compoundnumber": 13,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
}
],
"result":
{
"produced_by": "boolean",
"value": true
},
"task":
{
"compoundnumber": 12,
"type": "boolean"
}
},

{
"child":
[

{
"formula":
{
"count":
{
"A": 1,
"E": 1,
"F": 1,
"G": 0,
"U": 1,
"X": 0,
"aconj": 2,
"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(A(((1 <= p31)) U ((1 <= p45))))",
"processed_size": 34,
"rewrites": 35
},
"net":
{
"conflict_clusters": 11,
"singleton_clusters": 0
},
"result":
{
"edges": 3,
"markings": 2,
"produced_by": "CTL model checker",
"value": true
},
"task":
{
"compoundnumber": 13,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
},

{
"formula":
{
"count":
{
"A": 1,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 1,
"aconj": 2,
"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 <= p5) AND (1 <= p35)) AND AX(((1 <= p39)))))",
"processed_size": 53,
"rewrites": 35
},
"net":
{
"conflict_clusters": 11,
"singleton_clusters": 0
},
"result":
{
"edges": 243838548,
"markings": 33819621,
"produced_by": "CTL model checker",
"value": false
},
"task":
{
"compoundnumber": 14,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
}
],
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 13,
"type": "boolean"
}
},

{
"child":
[

{
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 1,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "((p45 <= 0) OR (p46 <= 0))",
"processed_size": 27,
"rewrites": 33
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 14,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 5,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 5,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "((1 <= p36) AND (1 <= p52) AND (1 <= p42) AND (1 <= p10) AND (1 <= p35))",
"processed_size": 72,
"rewrites": 33
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 15,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"result":
{
"edges": 34413816,
"markings": 9717676,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 16,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "deadlock preserving/insertion"
},
"treads": 1,
"type": "dfs"
},
"type": "deadlock",
"workflow": "search"
}
}
],
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 14,
"type": "boolean"
}
}
],
"exit":
{
"error": null,
"memory": 41500,
"runtime": 1945.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "CTLFireability.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "(A(G(E(X(*)))) AND A(G(**))) : (E(F(*)) AND A(G(E(X(**))))) : (E(F(A((** U **)))) AND E(F((** AND A(X(**)))))) : (E(F(DEADLOCK)) OR (** AND (A(G(**)) AND **))) : E(F(E(G(**)))) : (A(G(*)) OR (** OR **)) : E(G(E((** U **)))) : E(F(A(G(*)))) : (A((* R *)) AND (A(X(A(G(**)))) AND **)) : E(F((** AND (** OR (A(G(**)) OR **))))) : E(X(E(F(A(X(**)))))) : E(G(*))"
},
"net":
{
"arcs": 300,
"conflict_clusters": 11,
"places": 53,
"places_significant": 44,
"singleton_clusters": 0,
"transitions": 84
},
"result":
{
"preliminary_value": "no yes no no yes no yes no no yes no yes ",
"value": "no yes no no yes no yes no no yes no yes "
},
"task":
{
"type": "compound"
}
}
lola: LoLA will run for 3570 seconds at most (--timelimit)
lola: NET
lola: input: PNML file (--pnml)
lola: reading net from model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file model.pnml
lola: 137/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 53
lola: finding significant places
lola: 53 places, 84 transitions, 44 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: (p23 <= 1)
lola: LP says that atomic proposition is always true: (p35 <= 1)
lola: LP says that atomic proposition is always true: (p33 <= 1)
lola: LP says that atomic proposition is always true: (p52 <= 1)
lola: LP says that atomic proposition is always true: (p17 <= 1)
lola: LP says that atomic proposition is always true: (p45 <= 1)
lola: LP says that atomic proposition is always true: (p11 <= 1)
lola: LP says that atomic proposition is always true: (p35 <= 1)
lola: LP says that atomic proposition is always true: (p22 <= 1)
lola: LP says that atomic proposition is always true: (p35 <= 1)
lola: LP says that atomic proposition is always true: (p31 <= 1)
lola: LP says that atomic proposition is always true: (p45 <= 1)
lola: LP says that atomic proposition is always true: (p5 <= 1)
lola: LP says that atomic proposition is always true: (p35 <= 1)
lola: LP says that atomic proposition is always true: (p39 <= 1)
lola: LP says that atomic proposition is always true: (p36 <= 1)
lola: LP says that atomic proposition is always true: (p52 <= 1)
lola: LP says that atomic proposition is always true: (p42 <= 1)
lola: LP says that atomic proposition is always true: (p10 <= 1)
lola: LP says that atomic proposition is always true: (p35 <= 1)
lola: LP says that atomic proposition is always true: (p25 <= 1)
lola: LP says that atomic proposition is always true: (p45 <= 1)
lola: LP says that atomic proposition is always true: (p45 <= 1)
lola: LP says that atomic proposition is always true: (p46 <= 1)
lola: LP says that atomic proposition is always true: (p20 <= 1)
lola: LP says that atomic proposition is always true: (p40 <= 1)
lola: LP says that atomic proposition is always true: (p47 <= 1)
lola: LP says that atomic proposition is always true: (p50 <= 1)
lola: LP says that atomic proposition is always true: (p33 <= 1)
lola: LP says that atomic proposition is always true: (p52 <= 1)
lola: LP says that atomic proposition is always true: (p30 <= 1)
lola: LP says that atomic proposition is always true: (p45 <= 1)
lola: LP says that atomic proposition is always true: (p9 <= 1)
lola: LP says that atomic proposition is always true: (p45 <= 1)
lola: LP says that atomic proposition is always true: (p31 <= 1)
lola: LP says that atomic proposition is always true: (p25 <= 1)
lola: LP says that atomic proposition is always true: (p45 <= 1)
lola: LP says that atomic proposition is always true: (p51 <= 1)
lola: LP says that atomic proposition is always true: (p35 <= 1)
lola: LP says that atomic proposition is always true: (p51 <= 1)
lola: LP says that atomic proposition is always true: (p34 <= 1)
lola: LP says that atomic proposition is always true: (p12 <= 1)
lola: LP says that atomic proposition is always true: (p35 <= 1)
lola: LP says that atomic proposition is always true: (p41 <= 1)
lola: LP says that atomic proposition is always true: (p16 <= 1)
lola: LP says that atomic proposition is always true: (p45 <= 1)
lola: LP says that atomic proposition is always true: (p4 <= 1)
lola: LP says that atomic proposition is always true: (p40 <= 1)
lola: LP says that atomic proposition is always true: (p27 <= 1)
lola: LP says that atomic proposition is always true: (p40 <= 1)
lola: LP says that atomic proposition is always true: (p1 <= 1)
lola: LP says that atomic proposition is always true: (p40 <= 1)
lola: LP says that atomic proposition is always true: (p40 <= 1)
lola: LP says that atomic proposition is always true: (p35 <= 1)
lola: LP says that atomic proposition is always true: (p16 <= 1)
lola: LP says that atomic proposition is always true: (p45 <= 1)
lola: LP says that atomic proposition is always true: (p10 <= 1)
lola: LP says that atomic proposition is always true: (p35 <= 1)
lola: LP says that atomic proposition is always true: (p40 <= 1)
lola: LP says that atomic proposition is always true: (p48 <= 1)
lola: LP says that atomic proposition is always true: (p45 <= 1)
lola: LP says that atomic proposition is always true: (p30 <= 1)
lola: LP says that atomic proposition is always true: (p45 <= 1)
lola: LP says that atomic proposition is always true: (p34 <= 1)
lola: LP says that atomic proposition is always true: (p22 <= 1)
lola: LP says that atomic proposition is always true: (p18 <= 1)
lola: LP says that atomic proposition is always true: (p45 <= 1)
lola: LP says that atomic proposition is always true: (p30 <= 1)
lola: LP says that atomic proposition is always true: (p45 <= 1)
lola: LP says that atomic proposition is always true: (p51 <= 1)
lola: LP says that atomic proposition is always true: (p35 <= 1)
lola: LP says that atomic proposition is always true: (p22 <= 1)
lola: LP says that atomic proposition is always true: (p35 <= 1)
lola: LP says that atomic proposition is always true: (p39 <= 1)
lola: A (G ((NOT(A (X (((1 <= p23) AND (1 <= p35))))) AND ((p33 <= 0) OR (p52 <= 0) OR (p17 <= 0) OR (p45 <= 0))))) : (A (F (NOT(A (G (((1 <= p11) AND (1 <= p35))))))) AND A (G (E (X (((p22 <= 0) OR (p35 <= 0))))))) : (E (F (A ((((1 <= p31)) U ((1 <= p45)))))) AND E (F ((((1 <= p5) AND (1 <= p35)) AND A (X (((1 <= p39)))))))) : (E (F (A (X ((1 <= 0))))) OR ((((1 <= p36) AND (1 <= p52) AND (1 <= p42) AND (1 <= p10) AND (1 <= p35)) AND A (G (((1 <= p25) AND (1 <= p45))))) AND ((p45 <= 0) OR (p46 <= 0)))) : E (F (E (G (((1 <= p20) AND (1 <= p40) AND (1 <= p47) AND (1 <= p50) AND ((p33 <= 0) OR (p52 <= 0))))))) : ((NOT(E (F (((1 <= p31) AND (((1 <= p30) AND (1 <= p45)) OR ((1 <= p9) AND (1 <= p45))) AND (1 <= p25) AND (1 <= p45))))) OR A (((1 <= 0) U ((1 <= p51) AND (1 <= p35))))) OR ((1 <= p51))) : E (G (E ((((p34 <= 0)) U ((1 <= p12) AND (1 <= p35) AND (1 <= p41)))))) : NOT(A (G (E (F (((1 <= p16) AND (1 <= p45) AND (1 <= p4) AND (1 <= p40))))))) : ((NOT(E ((((1 <= p27) AND (1 <= p40)) U ((1 <= p1) AND (1 <= p40))))) AND A (G (A (X ((((1 <= p40)) OR ((1 <= p35)))))))) AND ((p16 <= 0) OR (p45 <= 0))) : E (F ((((1 <= p10) AND (1 <= p35) AND (1 <= p40) AND (1 <= p48)) AND ((((p45 <= 0)) OR A (G (((1 <= p30) AND (1 <= p45))))) OR ((1 <= p34) AND (1 <= p22)))))) : E (X (E (F (A (X (((1 <= p18) AND (1 <= p45)))))))) : NOT(A ((((1 <= p30) AND (1 <= p45) AND (1 <= p51) AND (1 <= p35) AND (1 <= p22) AND (1 <= p35)) U A (F (((1 <= p39)))))))
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:545
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:449
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:139
lola: rewrite Frontend/Parser/formula_rewrite.k:251
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:98
lola: rewrite Frontend/Parser/formula_rewrite.k:184
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:329
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:326
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:398
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:470
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (G (E (X (((p23 <= 0) OR (p35 <= 0)))))) AND A (G (((p33 <= 0) OR (p52 <= 0) OR (p17 <= 0) OR (p45 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 0 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((p33 <= 0) OR (p52 <= 0) OR (p17 <= 0) OR (p45 <= 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:787
lola: processed formula: A (G (((p33 <= 0) OR (p52 <= 0) OR (p17 <= 0) OR (p45 <= 0))))
lola: processed formula length: 65
lola: 35 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 <= p33) AND (1 <= p52) AND (1 <= p17) AND (1 <= p45))
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: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 5 markings, 4 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 1 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E (F (((p11 <= 0) OR (p35 <= 0)))) AND A (G (E (X (((p22 <= 0) OR (p35 <= 0)))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 1 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((p11 <= 0) OR (p35 <= 0))))
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 (((p11 <= 0) OR (p35 <= 0))))
lola: processed formula length: 35
lola: 34 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: ((p11 <= 0) OR (p35 <= 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
lola: The predicate is reachable.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 2 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (E (X (((p22 <= 0) OR (p35 <= 0))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:807
lola: rewrite Frontend/Parser/formula_rewrite.k:813
lola: processed formula: AG(EX(((p22 <= 0) OR (p35 <= 0))))
lola: processed formula length: 35
lola: 35 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: 1123212 markings, 3583663 edges, 224642 markings/sec, 0 secs
lola: 1648440 markings, 7651383 edges, 105046 markings/sec, 5 secs
lola: 2220865 markings, 11407017 edges, 114485 markings/sec, 10 secs
lola: 3117035 markings, 15081631 edges, 179234 markings/sec, 15 secs
lola: 3355152 markings, 18894824 edges, 47623 markings/sec, 20 secs
lola: 4005097 markings, 22551615 edges, 129989 markings/sec, 25 secs
lola: 4896117 markings, 26275489 edges, 178204 markings/sec, 30 secs
lola: 5067414 markings, 30052726 edges, 34259 markings/sec, 35 secs
lola: 6028638 markings, 33511617 edges, 192245 markings/sec, 40 secs
lola: 6674721 markings, 37182411 edges, 129217 markings/sec, 45 secs
lola: 6887980 markings, 40690309 edges, 42652 markings/sec, 50 secs
lola: 7920743 markings, 44228103 edges, 206553 markings/sec, 55 secs
lola: 8791581 markings, 47661711 edges, 174168 markings/sec, 60 secs
lola: 9590298 markings, 51090972 edges, 159743 markings/sec, 65 secs
lola: 10338147 markings, 54611339 edges, 149570 markings/sec, 70 secs
lola: 11034381 markings, 58249257 edges, 139247 markings/sec, 75 secs
lola: 11481539 markings, 62087792 edges, 89432 markings/sec, 80 secs
lola: 11653820 markings, 65678632 edges, 34456 markings/sec, 85 secs
lola: 11746476 markings, 69144308 edges, 18531 markings/sec, 90 secs
lola: 11802479 markings, 72553246 edges, 11201 markings/sec, 95 secs
lola: 11832904 markings, 76017991 edges, 6085 markings/sec, 100 secs
lola: 12574018 markings, 79353825 edges, 148223 markings/sec, 105 secs
lola: 13366205 markings, 82589142 edges, 158437 markings/sec, 110 secs
lola: 14101713 markings, 85821914 edges, 147102 markings/sec, 115 secs
lola: 14802045 markings, 89125411 edges, 140066 markings/sec, 120 secs
lola: 15467461 markings, 92519372 edges, 133083 markings/sec, 125 secs
lola: 16100026 markings, 96039062 edges, 126513 markings/sec, 130 secs
lola: 16533799 markings, 99746159 edges, 86755 markings/sec, 135 secs
lola: 16707106 markings, 103189120 edges, 34661 markings/sec, 140 secs
lola: 16804224 markings, 106489254 edges, 19424 markings/sec, 145 secs
lola: 16862977 markings, 109688524 edges, 11751 markings/sec, 150 secs
lola: 16896622 markings, 112864229 edges, 6729 markings/sec, 155 secs
lola: 17347187 markings, 116188245 edges, 90113 markings/sec, 160 secs
lola: 18238269 markings, 119682797 edges, 178216 markings/sec, 165 secs
lola: 18558453 markings, 123343600 edges, 64037 markings/sec, 170 secs
lola: 18907618 markings, 126789157 edges, 69833 markings/sec, 175 secs
lola: 19768493 markings, 130036994 edges, 172175 markings/sec, 180 secs
lola: 20536188 markings, 133245495 edges, 153539 markings/sec, 185 secs
lola: 21259675 markings, 136501568 edges, 144697 markings/sec, 190 secs
lola: 21942513 markings, 139821593 edges, 136568 markings/sec, 195 secs
lola: 22586870 markings, 143242154 edges, 128871 markings/sec, 200 secs
lola: 23149552 markings, 146858670 edges, 112536 markings/sec, 205 secs
lola: 23388526 markings, 150411686 edges, 47795 markings/sec, 210 secs
lola: 23509525 markings, 153759395 edges, 24200 markings/sec, 215 secs
lola: 23582177 markings, 157013098 edges, 14530 markings/sec, 220 secs
lola: 23630621 markings, 160192942 edges, 9689 markings/sec, 225 secs
lola: 23659699 markings, 163396801 edges, 5816 markings/sec, 230 secs
lola: 23981411 markings, 166769852 edges, 64342 markings/sec, 235 secs
lola: 24839396 markings, 170075941 edges, 171597 markings/sec, 240 secs
lola: 25606274 markings, 173344295 edges, 153376 markings/sec, 245 secs
lola: 26327215 markings, 176640498 edges, 144188 markings/sec, 250 secs
lola: 27008484 markings, 179992071 edges, 136254 markings/sec, 255 secs
lola: 27654254 markings, 183428190 edges, 129154 markings/sec, 260 secs
lola: 28228054 markings, 187069256 edges, 114760 markings/sec, 265 secs
lola: 28477126 markings, 190666918 edges, 49814 markings/sec, 270 secs
lola: 28605345 markings, 194073712 edges, 25644 markings/sec, 275 secs
lola: 28676972 markings, 197378299 edges, 14325 markings/sec, 280 secs
lola: 28722449 markings, 200626888 edges, 9095 markings/sec, 285 secs
lola: 28759088 markings, 203932953 edges, 7328 markings/sec, 290 secs
lola: 29602454 markings, 206855027 edges, 168673 markings/sec, 295 secs
lola: 30312896 markings, 209720363 edges, 142088 markings/sec, 300 secs
lola: 30986015 markings, 212625506 edges, 134624 markings/sec, 305 secs
lola: 31627587 markings, 215599546 edges, 128314 markings/sec, 310 secs
lola: 32244996 markings, 218669632 edges, 123482 markings/sec, 315 secs
lola: local time limit reached - aborting
lola:
preliminary result: no unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown
lola: caught signal User defined signal 1 - aborting LoLA
lola:
preliminary result: no unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown
lola: memory consumption: 4081724 KB
lola: time consumption: 327 seconds
lola: print data as JSON (--json)
lola: writing JSON to CTLFireability.json
lola: closed JSON file CTLFireability.json
lola: caught signal User defined signal 1 - aborting LoLA
lola:
preliminary result: no unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown
lola: memory consumption: 4081724 KB
lola: time consumption: 327 seconds
lola: print data as JSON (--json)
lola: writing JSON to CTLFireability.json
lola: closed JSON file CTLFireability.json
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 2 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E (F (A ((((1 <= p31)) U ((1 <= p45)))))) AND E (F ((((1 <= p5) AND (1 <= p35)) AND A (X (((1 <= p39))))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 2 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (A ((((1 <= p31)) U ((1 <= p45))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:814
lola: rewrite Frontend/Parser/formula_rewrite.k:806
lola: processed formula: EF(A(((1 <= p31)) U ((1 <= p45))))
lola: processed formula length: 34
lola: 35 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 2 markings, 3 edges
lola: ========================================
lola: subprocess 3 will run for 360 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((((1 <= p5) AND (1 <= p35)) AND A (X (((1 <= p39)))))))
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 <= p5) AND (1 <= p35)) AND AX(((1 <= p39)))))
lola: processed formula length: 53
lola: 35 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: 1233067 markings, 4025290 edges, 246613 markings/sec, 0 secs
lola: 1664292 markings, 8181928 edges, 86245 markings/sec, 5 secs
lola: 2426653 markings, 12137219 edges, 152472 markings/sec, 10 secs
lola: 3237801 markings, 16172011 edges, 162230 markings/sec, 15 secs
lola: 3372664 markings, 19903104 edges, 26973 markings/sec, 20 secs
lola: 4358208 markings, 23789051 edges, 197109 markings/sec, 25 secs
lola: 5005570 markings, 27785647 edges, 129472 markings/sec, 30 secs
lola: 5405067 markings, 31438295 edges, 79899 markings/sec, 35 secs
lola: 6446293 markings, 35199092 edges, 208245 markings/sec, 40 secs
lola: 6740623 markings, 38893467 edges, 58866 markings/sec, 45 secs
lola: 7462154 markings, 42555891 edges, 144306 markings/sec, 50 secs
lola: 8424918 markings, 46180121 edges, 192553 markings/sec, 55 secs
lola: 9299724 markings, 49809402 edges, 174961 markings/sec, 60 secs
lola: 10106060 markings, 53481648 edges, 161267 markings/sec, 65 secs
lola: 10853631 markings, 57262001 edges, 149514 markings/sec, 70 secs
lola: 11417784 markings, 61231764 edges, 112831 markings/sec, 75 secs
lola: 11626020 markings, 64916387 edges, 41647 markings/sec, 80 secs
lola: 11730964 markings, 68421372 edges, 20989 markings/sec, 85 secs
lola: 11792912 markings, 71822521 edges, 12390 markings/sec, 90 secs
lola: 11828001 markings, 75292371 edges, 7018 markings/sec, 95 secs
lola: 12456507 markings, 78893543 edges, 125701 markings/sec, 100 secs
lola: 13298042 markings, 82300883 edges, 168307 markings/sec, 105 secs
lola: 14071309 markings, 85682730 edges, 154653 markings/sec, 110 secs
lola: 14784198 markings, 89036891 edges, 142578 markings/sec, 115 secs
lola: 15473969 markings, 92553605 edges, 137954 markings/sec, 120 secs
lola: 16124081 markings, 96183100 edges, 130022 markings/sec, 125 secs
lola: 16549984 markings, 99984384 edges, 85181 markings/sec, 130 secs
lola: 16715215 markings, 103412033 edges, 33046 markings/sec, 135 secs
lola: 16801849 markings, 106389167 edges, 17327 markings/sec, 140 secs
lola: 16851753 markings, 108979427 edges, 9981 markings/sec, 145 secs
lola: 16884067 markings, 111466924 edges, 6463 markings/sec, 150 secs
lola: 16905042 markings, 114017463 edges, 4195 markings/sec, 155 secs
lola: 17575253 markings, 116978136 edges, 134042 markings/sec, 160 secs
lola: 18339311 markings, 120191462 edges, 152812 markings/sec, 165 secs
lola: 18557681 markings, 123315262 edges, 43674 markings/sec, 170 secs
lola: 18695606 markings, 126121811 edges, 27585 markings/sec, 175 secs
lola: 19544481 markings, 129152545 edges, 169775 markings/sec, 180 secs
lola: 20244394 markings, 132000852 edges, 139983 markings/sec, 185 secs
lola: 20919975 markings, 134945795 edges, 135116 markings/sec, 190 secs
lola: 21659409 markings, 138414900 edges, 147887 markings/sec, 195 secs
lola: 22298362 markings, 141671052 edges, 127791 markings/sec, 200 secs
lola: 22950371 markings, 145359261 edges, 130402 markings/sec, 205 secs
lola: 23321305 markings, 149109660 edges, 74187 markings/sec, 210 secs
lola: 23471908 markings, 152551929 edges, 30121 markings/sec, 215 secs
lola: 23560844 markings, 155890992 edges, 17787 markings/sec, 220 secs
lola: 23616993 markings, 159156335 edges, 11230 markings/sec, 225 secs
lola: 23651643 markings, 162353029 edges, 6930 markings/sec, 230 secs
lola: 23673642 markings, 165671545 edges, 4400 markings/sec, 235 secs
lola: 24627941 markings, 169224848 edges, 190860 markings/sec, 240 secs
lola: 25457940 markings, 172694826 edges, 166000 markings/sec, 245 secs
lola: 26233106 markings, 176198918 edges, 155033 markings/sec, 250 secs
lola: 26958055 markings, 179738402 edges, 144990 markings/sec, 255 secs
lola: 27646930 markings, 183386764 edges, 137775 markings/sec, 260 secs
lola: 28244831 markings, 187222184 edges, 119580 markings/sec, 265 secs
lola: 28487407 markings, 190886795 edges, 48515 markings/sec, 270 secs
lola: 28612294 markings, 194344061 edges, 24977 markings/sec, 275 secs
lola: 28681976 markings, 197670111 edges, 13936 markings/sec, 280 secs
lola: 28723970 markings, 200804278 edges, 8399 markings/sec, 285 secs
lola: 28858275 markings, 204213896 edges, 26861 markings/sec, 290 secs
lola: 29719359 markings, 207309003 edges, 172217 markings/sec, 295 secs
lola: 30477301 markings, 210412483 edges, 151588 markings/sec, 300 secs
lola: 31197551 markings, 213584408 edges, 144050 markings/sec, 305 secs
lola: 31878753 markings, 216822382 edges, 136240 markings/sec, 310 secs
lola: 32524931 markings, 220155467 edges, 129236 markings/sec, 315 secs
lola: local time limit reached - aborting
lola:
preliminary result: no unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown
lola: caught signal User defined signal 1 - aborting LoLA
lola:
preliminary result: no unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown
lola: memory consumption: 2848468 KB
lola: time consumption: 651 seconds
lola: print data as JSON (--json)
lola: writing JSON to CTLFireability.json
lola: closed JSON file CTLFireability.json
lola: caught signal User defined signal 1 - aborting LoLA
lola:
preliminary result: no unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown
lola: memory consumption: 2848468 KB
lola: time consumption: 651 seconds
lola: print data as JSON (--json)
lola: writing JSON to CTLFireability.json
lola: closed JSON file CTLFireability.json
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 3 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A ((((p27 <= 0) OR (p40 <= 0)) R ((p1 <= 0) OR (p40 <= 0)))) AND (A (X (A (G ((((1 <= p40)) OR ((1 <= p35))))))) AND ((p16 <= 0) OR (p45 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 3 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((p16 <= 0) OR (p45 <= 0))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((p16 <= 0) OR (p45 <= 0))
lola: processed formula length: 27
lola: 33 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 4 will run for 364 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A ((((p27 <= 0) OR (p40 <= 0)) R ((p1 <= 0) OR (p40 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking universal release
lola: rewrite Frontend/Parser/formula_rewrite.k:619
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: rewrite Frontend/Parser/formula_rewrite.k:737
lola: rewrite Frontend/Parser/formula_rewrite.k:693
lola: rewrite Frontend/Parser/formula_rewrite.k:788
lola: rewrite Frontend/Parser/formula_rewrite.k:788
lola: processed formula: A ((((p27 <= 0) OR (p40 <= 0)) R ((p1 <= 0) OR (p40 <= 0))))
lola: processed formula length: 62
lola: 38 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /EU)
lola: state space: using reachability graph (EU version) (--search=depth)
lola: state space: using eu preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:788
lola: SUBRESULT
lola: result: yes
lola: produced by: state space /EU
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: Predicate Phi releases Predicate Psi on all paths.
lola: 0 markings, 0 edges
lola: formula 0: ((1 <= p1) AND (1 <= p40))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: ========================================
lola: subprocess 5 will run for 417 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (A (G ((((1 <= p40)) OR ((1 <= p35)))))))
lola: ========================================
lola: SUBTASK
lola: checking invariance from all successors
lola: rewrite Frontend/Parser/formula_rewrite.k:624
lola: rewrite Frontend/Parser/formula_rewrite.k:753
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: (((p40 <= 0)) AND ((p35 <= 0)))
lola: processed formula length: 31
lola: 36 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /EXEF)
lola: state space: using reachability graph (EXef version) (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: state equation task get result rewrite finished id 0
lola: SUBRESULT
lola: result: no
lola: produced by: state space /EXEF
lola: The predicate is not invariant from successors.
lola: 5 markings, 4 edges
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (((p40 <= 0)) AND ((p35 <= 0)))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 4 will run for 364 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (X (E (F (A (X (((1 <= p18) AND (1 <= p45))))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:812
lola: rewrite Frontend/Parser/formula_rewrite.k:806
lola: rewrite Frontend/Parser/formula_rewrite.k:807
lola: processed formula: EX(EF(AX(((1 <= p18) AND (1 <= p45)))))
lola: processed formula length: 39
lola: 36 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: 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: 1160587 markings, 3729158 edges, 232117 markings/sec, 0 secs
lola: 1650358 markings, 7709317 edges, 97954 markings/sec, 5 secs
lola: 2178459 markings, 11261001 edges, 105620 markings/sec, 10 secs
lola: 3027194 markings, 14624478 edges, 169747 markings/sec, 15 secs
lola: 3346521 markings, 18535873 edges, 63865 markings/sec, 20 secs
lola: 3929644 markings, 22309365 edges, 116625 markings/sec, 25 secs
lola: 4880831 markings, 26133822 edges, 190237 markings/sec, 30 secs
lola: 5065890 markings, 29939805 edges, 37012 markings/sec, 35 secs
lola: 6017131 markings, 33467129 edges, 190248 markings/sec, 40 secs
lola: 6676087 markings, 37205672 edges, 131791 markings/sec, 45 secs
lola: 6911170 markings, 40755536 edges, 47017 markings/sec, 50 secs
lola: 7936903 markings, 44288912 edges, 205147 markings/sec, 55 secs
lola: 8821243 markings, 47783433 edges, 176868 markings/sec, 60 secs
lola: 9630502 markings, 51271405 edges, 161852 markings/sec, 65 secs
lola: 10374433 markings, 54791150 edges, 148786 markings/sec, 70 secs
lola: 11071501 markings, 58461449 edges, 139414 markings/sec, 75 secs
lola: 11482869 markings, 62106402 edges, 82274 markings/sec, 80 secs
lola: 11636315 markings, 65195580 edges, 30689 markings/sec, 85 secs
lola: 11730093 markings, 68384785 edges, 18756 markings/sec, 90 secs
lola: 11792610 markings, 71798776 edges, 12503 markings/sec, 95 secs
lola: 11827601 markings, 75246681 edges, 6998 markings/sec, 100 secs
lola: 12402117 markings, 78683280 edges, 114903 markings/sec, 105 secs
lola: 13208803 markings, 81922305 edges, 161337 markings/sec, 110 secs
lola: 13957755 markings, 85167135 edges, 149790 markings/sec, 115 secs
lola: 14667610 markings, 88469863 edges, 141971 markings/sec, 120 secs
lola: 15341805 markings, 91852300 edges, 134839 markings/sec, 125 secs
lola: 15980092 markings, 95344675 edges, 127657 markings/sec, 130 secs
lola: 16483532 markings, 99052279 edges, 100688 markings/sec, 135 secs
lola: 16683819 markings, 102587751 edges, 40057 markings/sec, 140 secs
lola: 16792241 markings, 105948496 edges, 21684 markings/sec, 145 secs
lola: 16855534 markings, 109214350 edges, 12659 markings/sec, 150 secs
lola: 16892406 markings, 112369621 edges, 7374 markings/sec, 155 secs
lola: 17201167 markings, 115708066 edges, 61752 markings/sec, 160 secs
lola: 18122472 markings, 119154020 edges, 184261 markings/sec, 165 secs
lola: 18537142 markings, 122709816 edges, 82934 markings/sec, 170 secs
lola: 18712691 markings, 126172076 edges, 35110 markings/sec, 175 secs
lola: 19628950 markings, 129486184 edges, 183252 markings/sec, 180 secs
lola: 20416198 markings, 132728766 edges, 157450 markings/sec, 185 secs
lola: 21151244 markings, 136000615 edges, 147009 markings/sec, 190 secs
lola: 21854866 markings, 139384364 edges, 140724 markings/sec, 195 secs
lola: 22508613 markings, 142817521 edges, 130749 markings/sec, 200 secs
lola: 23100304 markings, 146448090 edges, 118338 markings/sec, 205 secs
lola: 23375495 markings, 150124131 edges, 55038 markings/sec, 210 secs
lola: 23502952 markings, 153531553 edges, 25491 markings/sec, 215 secs
lola: 23579155 markings, 156832215 edges, 15241 markings/sec, 220 secs
lola: 23629340 markings, 160087014 edges, 10037 markings/sec, 225 secs
lola: 23659514 markings, 163374319 edges, 6035 markings/sec, 230 secs
lola: 23994649 markings, 166815142 edges, 67027 markings/sec, 235 secs
lola: 24870019 markings, 170201646 edges, 175074 markings/sec, 240 secs
lola: 25644802 markings, 173518468 edges, 154957 markings/sec, 245 secs
lola: 26367805 markings, 176830374 edges, 144601 markings/sec, 250 secs
lola: 27056316 markings, 180235038 edges, 137702 markings/sec, 255 secs
lola: 27712957 markings, 183757356 edges, 131328 markings/sec, 260 secs
lola: 28270481 markings, 187468353 edges, 111505 markings/sec, 265 secs
lola: 28497933 markings, 191115501 edges, 45490 markings/sec, 270 secs
lola: 28618797 markings, 194579929 edges, 24173 markings/sec, 275 secs
lola: 28686213 markings, 197914014 edges, 13483 markings/sec, 280 secs
lola: 28727562 markings, 201189467 edges, 8270 markings/sec, 285 secs
lola: 28955636 markings, 204511637 edges, 45615 markings/sec, 290 secs
lola: 29740864 markings, 207392645 edges, 157046 markings/sec, 295 secs
lola: 30446478 markings, 210280458 edges, 141123 markings/sec, 300 secs
lola: 31117349 markings, 213221255 edges, 134174 markings/sec, 305 secs
lola: 31756940 markings, 216228611 edges, 127918 markings/sec, 310 secs
lola: 32370796 markings, 219327542 edges, 122771 markings/sec, 315 secs
lola: 32955176 markings, 222552207 edges, 116876 markings/sec, 320 secs
lola: 33391802 markings, 225986831 edges, 87325 markings/sec, 325 secs
lola: 33566398 markings, 229191058 edges, 34919 markings/sec, 330 secs
lola: 33666650 markings, 232246489 edges, 20050 markings/sec, 335 secs
lola: 33731158 markings, 235214832 edges, 12902 markings/sec, 340 secs
lola: 33774671 markings, 238121851 edges, 8703 markings/sec, 345 secs
lola: 33802290 markings, 241012079 edges, 5524 markings/sec, 350 secs
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 33819620 markings, 243838547 edges
lola: ========================================
lola: subprocess 5 will run for 365 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G (((p39 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation
lola: rewrite Frontend/Parser/formula_rewrite.k:583
lola: processed formula: E (G (((p39 <= 0))))
lola: processed formula length: 20
lola: 34 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: SUBRESULT
lola: result: yes
lola: produced by: state space / EG
lola: The predicate is possibly preserved.
lola: 4 markings, 4 edges
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((1 <= p39))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: subprocess 6 will run for 426 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (A (G (((p16 <= 0) OR (p45 <= 0) OR (p4 <= 0) OR (p40 <= 0))))))
lola: ========================================
lola: SUBTASK
lola: checking possible invariance
lola: rewrite Frontend/Parser/formula_rewrite.k:604
lola: rewrite Frontend/Parser/formula_rewrite.k:614
lola: rewrite Frontend/Parser/formula_rewrite.k:726
lola: rewrite Frontend/Parser/formula_rewrite.k:788
lola: processed formula: ((1 <= p16) AND (1 <= p45) AND (1 <= p4) AND (1 <= p40))
lola: processed formula length: 56
lola: 37 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: ========================================
lola: SEARCH
lola: using tscc preserving stubborn set method (--stubborn)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:700
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((p16 <= 0) OR (p45 <= 0) OR (p4 <= 0) OR (p40 <= 0))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 4 literals and 4 conjunctive subformulas
lola: state equation task get result started, id 1
lola: state equation: write sara problem file to CTLFireability-6-0.sara
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:788
lola: state equation task get result rewrite finished id 1
lola: state equation task get result unparse finished++ id 1
lola: formula 1: ((1 <= p16) AND (1 <= p45) AND (1 <= p4) AND (1 <= p40))
lola: state equation task get result unparse finished id 1
lola: state equation: Generated DNF with 4 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: state equation: calling and running sara
sara: try reading problem file CTLFireability-6-0.sara.
sara: try reading problem file CTLFireability-6-1.sara.
sara: error: :596: 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
sara: error: :596: 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: state equation:solution unknown
lola: state equation:solution unknown
lola: sara is running 0 secs || sara is running 0 secs || 1718404 markings, 4276445 edges, 343681 markings/sec, 0 secs
lola: SUBRESULT
lola: result: no
lola: produced by: parallel
lola: The predicate is not possibly invariant.
lola: 1828911 markings, 4655387 edges
lola: ========================================
lola: subprocess 7 will run for 510 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (E (G (((1 <= p20) AND (1 <= p40) AND (1 <= p47) AND (1 <= p50) AND ((p33 <= 0) OR (p52 <= 0)))))))
lola: ========================================
lola: SUBTASK
lola: checking reachability of possible preservation
lola: rewrite Frontend/Parser/formula_rewrite.k:598
lola: rewrite Frontend/Parser/formula_rewrite.k:633
lola: rewrite Frontend/Parser/formula_rewrite.k:730
lola: processed formula: ((1 <= p20) AND (1 <= p40) AND (1 <= p47) AND (1 <= p50) AND ((p33 <= 0) OR (p52 <= 0)))
lola: processed formula length: 89
lola: 36 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /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 1
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: state equation task get result rewrite finished id 1
lola: state equation task get result 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: ((p20 <= 0) OR (p40 <= 0) OR (p47 <= 0) OR (p50 <= 0) OR ((1 <= p33) AND (1 <= p52)))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 6 literals and 5 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space /EFEG
lola: The predicate is possibly preserved from a reachable marking.
lola: 25 markings, 27 edges
lola: state equation task get result unparse finished++ id 1
lola: formula 1: ((1 <= p20) AND (1 <= p40) AND (1 <= p47) AND (1 <= p50) AND ((p33 <= 0) OR (p52 <= 0)))
lola: state equation task get result unparse finished id 1
lola: state equation: Generated DNF with 10 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to CTLFireability-7-0.sara
lola: state equation: write sara problem file to CTLFireability-7-1.sara
lola: lola: state equation: calling and running sarastate equation: calling and running sara

sara: try reading problem file CTLFireability-7-1.sara.sara: try reading problem file CTLFireability-7-0.sara.

sara: error: sara: error: ::596596: error: error near ' near 'TRANSITIONTRANSITION'': : syntax error, unexpected KEY_TRANSITION, expecting SEMICOLON or COMMAsyntax error, unexpected KEY_TRANSITION, expecting SEMICOLON or COMMA

sara: sara: error while reading Petri net from fileerror while reading Petri net from file -- aborting [#04]
-- aborting [#04]
sara: sara: see manual for a documentation of this errorsee manual for a documentation of this error

sara: sara: last error message: No such file or directorylast error message: No such file or directory

lola: ========================================
lola: subprocess 8 will run for 638 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G (E ((((p34 <= 0)) U ((1 <= p12) AND (1 <= p35) AND (1 <= p41))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:809
lola: rewrite Frontend/Parser/formula_rewrite.k:808
lola: processed formula: EG(E(((p34 <= 0)) U ((1 <= p12) AND (1 <= p35) AND (1 <= p41))))
lola: processed formula length: 64
lola: 35 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 150 markings, 237 edges
lola: ========================================
lola: subprocess 9 will run for 851 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((((1 <= p10) AND (1 <= p35) AND (1 <= p40) AND (1 <= p48)) AND (((p45 <= 0)) OR (A (G (((1 <= p30) AND (1 <= p45)))) OR ((1 <= p34) AND (1 <= p22)))))))
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 <= p10) AND (1 <= p35) AND (1 <= p40) AND (1 <= p48)) AND (((p45 <= 0)) OR (AG(((1 <= p30) AND (1 <= p45))) OR ((1 <= p34) AND (1 <= p22))))))
lola: processed formula length: 150
lola: 35 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: 1188852 markings, 3845083 edges, 237770 markings/sec, 0 secs
lola: 1655894 markings, 7888824 edges, 93408 markings/sec, 5 secs
lola: 2316954 markings, 11740591 edges, 132212 markings/sec, 10 secs
lola: 3188038 markings, 15599183 edges, 174217 markings/sec, 15 secs
lola: 3363606 markings, 19302692 edges, 35114 markings/sec, 20 secs
lola: 4144015 markings, 23017008 edges, 156082 markings/sec, 25 secs
lola: 4951639 markings, 26877089 edges, 161525 markings/sec, 30 secs
lola: 5072334 markings, 30477866 edges, 24139 markings/sec, 35 secs
lola: 6162282 markings, 34019671 edges, 217990 markings/sec, 40 secs
lola: 6701627 markings, 37697137 edges, 107869 markings/sec, 45 secs
lola: 7052507 markings, 41178798 edges, 70176 markings/sec, 50 secs
lola: 8061180 markings, 44763650 edges, 201735 markings/sec, 55 secs
lola: 8940061 markings, 48275745 edges, 175776 markings/sec, 60 secs
lola: 9748728 markings, 51809017 edges, 161733 markings/sec, 65 secs
lola: 10498517 markings, 55412277 edges, 149958 markings/sec, 70 secs
lola: 11185247 markings, 59168859 edges, 137346 markings/sec, 75 secs
lola: 11536507 markings, 62962606 edges, 70252 markings/sec, 80 secs
lola: 11679310 markings, 66455621 edges, 28561 markings/sec, 85 secs
lola: 11759882 markings, 69832843 edges, 16114 markings/sec, 90 secs
lola: 11809372 markings, 73151421 edges, 9898 markings/sec, 95 secs
lola: 11836408 markings, 76600775 edges, 5407 markings/sec, 100 secs
lola: 12736963 markings, 79997293 edges, 180111 markings/sec, 105 secs
lola: 13532042 markings, 83296838 edges, 159016 markings/sec, 110 secs
lola: 14282164 markings, 86651325 edges, 150024 markings/sec, 115 secs
lola: 14988266 markings, 90052017 edges, 141220 markings/sec, 120 secs
lola: 15654162 markings, 93530306 edges, 133179 markings/sec, 125 secs
lola: 16276257 markings, 97164905 edges, 124419 markings/sec, 130 secs
lola: 16598858 markings, 100797264 edges, 64520 markings/sec, 135 secs
lola: 16741055 markings, 104152198 edges, 28439 markings/sec, 140 secs
lola: 16822719 markings, 107371102 edges, 16333 markings/sec, 145 secs
lola: 16873215 markings, 110466844 edges, 10099 markings/sec, 150 secs
lola: 16901969 markings, 113580380 edges, 5751 markings/sec, 155 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 16911021 markings, 114893928 edges
lola: ========================================
lola: subprocess 10 will run for 1195 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (G (((p31 <= 0) OR (((p30 <= 0) OR (p45 <= 0)) AND ((p9 <= 0) OR (p45 <= 0))) OR (p25 <= 0) OR (p45 <= 0)))) OR (((1 <= p51) AND (1 <= p35)) OR ((1 <= p51))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 10 will run for 1195 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (((1 <= p51) AND (1 <= p35)) OR ((1 <= p51)))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: rewrite Frontend/Parser/formula_rewrite.k:797
lola: processed formula: (((1 <= p51) AND (1 <= p35)) OR ((1 <= p51)))
lola: processed formula length: 45
lola: 34 rewrites
lola: closed formula file CTLFireability.xml
lola: processed formula with 3 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 11 will run for 2391 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((p31 <= 0) OR (((p30 <= 0) OR (p45 <= 0)) AND ((p9 <= 0) OR (p45 <= 0))) OR (p25 <= 0) OR (p45 <= 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 (((p31 <= 0) OR (((p30 <= 0) OR (p45 <= 0)) AND ((p9 <= 0) OR (p45 <= 0))) OR (p25 <= 0) OR (p45 <= 0))))
lola: processed formula length: 115
lola: 35 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: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 5 markings, 4 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 11 will run for 2391 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E (F (DEADLOCK)) OR (((1 <= p36) AND (1 <= p52) AND (1 <= p42) AND (1 <= p10) AND (1 <= p35)) AND (A (G (((1 <= p25) AND (1 <= p45)))) AND ((p45 <= 0) OR (p46 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 11 will run for 2391 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((p45 <= 0) OR (p46 <= 0))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((p45 <= 0) OR (p46 <= 0))
lola: processed formula length: 27
lola: 33 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: Child process aborted or communication problem between parent and child process
lola: subprocess 13 will run for 1 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (DEADLOCK))
lola: ========================================
lola: SUBTASK
lola: checking reachability of deadlocks
lola: Planning: workflow for deadlock check: search (--findpath=off,--siphontrap=off)
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 deadlock preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: RUNNING
lola: local time limit reached - aborting
lola:
preliminary result: no unknown unknown unknown yes no yes no no yes no yes
lola: memory consumption: 51320 KB
lola: time consumption: 1180 seconds
lola: print data as JSON (--json)
lola: writing JSON to CTLFireability.json
lola: closed JSON file CTLFireability.json
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: A (G (((1 <= p25) AND (1 <= p45))))
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 <= p25) AND (1 <= p45))))
lola: processed formula length: 35
lola: 35 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: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 0 markings, 0 edges
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((p25 <= 0) OR (p45 <= 0))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 2 literals and 2 conjunctive subformulas
lola: ========================================
lola: SUBRESULT
lola: result: unknown
lola: The Boolean predicate may be true or false.
lola: ========================================
lola: ========================================
lola: ...considering subproblem: (E (F (((p11 <= 0) OR (p35 <= 0)))) AND A (G (E (X (((p22 <= 0) OR (p35 <= 0)))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: ...considering subproblem: E (F (((p11 <= 0) OR (p35 <= 0))))
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 (((p11 <= 0) OR (p35 <= 0))))
lola: processed formula length: 35
lola: 34 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: ((p11 <= 0) OR (p35 <= 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
lola: The predicate is reachable.
lola: 0 markings, 0 edges
lola: ========================================
lola: ========================================
lola: ...considering subproblem: A (G (E (X (((p22 <= 0) OR (p35 <= 0))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:807
lola: rewrite Frontend/Parser/formula_rewrite.k:813
lola: processed formula: AG(EX(((p22 <= 0) OR (p35 <= 0))))
lola: processed formula length: 35
lola: 35 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: 1128862 markings, 3605542 edges, 225772 markings/sec, 0 secs
lola: 1646582 markings, 7593660 edges, 103544 markings/sec, 5 secs
lola: 2200134 markings, 11335566 edges, 110710 markings/sec, 10 secs
lola: 3098610 markings, 14982839 edges, 179695 markings/sec, 15 secs
lola: 3351751 markings, 18750435 edges, 50628 markings/sec, 20 secs
lola: 3944899 markings, 22358283 edges, 118630 markings/sec, 25 secs
lola: 4867662 markings, 26028550 edges, 184553 markings/sec, 30 secs
lola: 5062251 markings, 29713585 edges, 38918 markings/sec, 35 secs
lola: 5922994 markings, 33124762 edges, 172149 markings/sec, 40 secs
lola: 6645157 markings, 36731383 edges, 144433 markings/sec, 45 secs
lola: 6762586 markings, 40193884 edges, 23486 markings/sec, 50 secs
lola: 7770637 markings, 43671258 edges, 201610 markings/sec, 55 secs
lola: 8637436 markings, 47033376 edges, 173360 markings/sec, 60 secs
lola: 9440222 markings, 50424208 edges, 160557 markings/sec, 65 secs
lola: 10188161 markings, 53875900 edges, 149588 markings/sec, 70 secs
lola: 10887140 markings, 57439840 edges, 139796 markings/sec, 75 secs
lola: 11418703 markings, 61242626 edges, 106313 markings/sec, 80 secs
lola: 11622936 markings, 64839471 edges, 40847 markings/sec, 85 secs
lola: 11728017 markings, 68280726 edges, 21016 markings/sec, 90 secs
lola: 11790496 markings, 71641246 edges, 12496 markings/sec, 95 secs
lola: 11825962 markings, 75027219 edges, 7093 markings/sec, 100 secs
lola: 12339020 markings, 78448010 edges, 102612 markings/sec, 105 secs
lola: 13143721 markings, 81651585 edges, 160940 markings/sec, 110 secs
lola: 13887154 markings, 84850688 edges, 148687 markings/sec, 115 secs
lola: 14592813 markings, 88109337 edges, 141132 markings/sec, 120 secs
lola: 15263793 markings, 91446842 edges, 134196 markings/sec, 125 secs
lola: 15899332 markings, 94884946 edges, 127108 markings/sec, 130 secs
lola: 16439538 markings, 98532364 edges, 108041 markings/sec, 135 secs
lola: 16659937 markings, 102039316 edges, 44080 markings/sec, 140 secs
lola: 16777445 markings, 105357246 edges, 23502 markings/sec, 145 secs
lola: 16844823 markings, 108561786 edges, 13476 markings/sec, 150 secs
lola: 16886689 markings, 111717244 edges, 8373 markings/sec, 155 secs
lola: 16933160 markings, 114939947 edges, 9294 markings/sec, 160 secs
lola: 17923563 markings, 118314580 edges, 198081 markings/sec, 165 secs
lola: 18505304 markings, 121991423 edges, 116348 markings/sec, 170 secs
lola: 18596929 markings, 125420264 edges, 18325 markings/sec, 175 secs
lola: 19438005 markings, 128741549 edges, 168215 markings/sec, 180 secs
lola: 20223670 markings, 131914609 edges, 157133 markings/sec, 185 secs
lola: 20957112 markings, 135112806 edges, 146688 markings/sec, 190 secs
lola: 21651791 markings, 138378394 edges, 138936 markings/sec, 195 secs
lola: 22308589 markings, 141728163 edges, 131360 markings/sec, 200 secs
lola: 22927278 markings, 145213926 edges, 123738 markings/sec, 205 secs
lola: 23307126 markings, 148855513 edges, 75970 markings/sec, 210 secs
lola: 23462086 markings, 152238413 edges, 30992 markings/sec, 215 secs
lola: 23553589 markings, 155505030 edges, 18301 markings/sec, 220 secs
lola: 23610222 markings, 158692058 edges, 11327 markings/sec, 225 secs
lola: 23647513 markings, 161847542 edges, 7458 markings/sec, 230 secs
lola: 23670829 markings, 165122874 edges, 4663 markings/sec, 235 secs
lola: 24430088 markings, 168447744 edges, 151852 markings/sec, 240 secs
lola: 25228950 markings, 171707384 edges, 159772 markings/sec, 245 secs
lola: 25964624 markings, 174959148 edges, 147135 markings/sec, 250 secs
lola: 26663286 markings, 178260131 edges, 139732 markings/sec, 255 secs
lola: 27323847 markings, 181630423 edges, 132112 markings/sec, 260 secs
lola: 27948393 markings, 185119023 edges, 124909 markings/sec, 265 secs
lola: 28371238 markings, 188814745 edges, 84569 markings/sec, 270 secs
lola: 28546633 markings, 192278971 edges, 35079 markings/sec, 275 secs
lola: 28643736 markings, 195618858 edges, 19421 markings/sec, 280 secs
lola: 28701342 markings, 198874203 edges, 11521 markings/sec, 285 secs
lola: 28735163 markings, 202112108 edges, 6764 markings/sec, 290 secs
lola: 29188203 markings, 205292884 edges, 90608 markings/sec, 295 secs
lola: 29926999 markings, 208132120 edges, 147759 markings/sec, 300 secs
lola: 30613870 markings, 210992939 edges, 137374 markings/sec, 305 secs
lola: 31269554 markings, 213916788 edges, 131137 markings/sec, 310 secs
lola: 31897927 markings, 216915836 edges, 125675 markings/sec, 315 secs
lola: 32496904 markings, 220003918 edges, 119795 markings/sec, 320 secs
lola: 33068076 markings, 223227161 edges, 114234 markings/sec, 325 secs
lola: 33433180 markings, 226616121 edges, 73021 markings/sec, 330 secs
lola: 33587741 markings, 229741838 edges, 30912 markings/sec, 335 secs
lola: 33680888 markings, 232741596 edges, 18629 markings/sec, 340 secs
lola: 33738481 markings, 235665251 edges, 11519 markings/sec, 345 secs
lola: 33779539 markings, 238531167 edges, 8212 markings/sec, 350 secs
lola: 33804975 markings, 241390179 edges, 5087 markings/sec, 355 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 33819621 markings, 243838548 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: ========================================
lola: ...considering subproblem: (E (F (A ((((1 <= p31)) U ((1 <= p45)))))) AND E (F ((((1 <= p5) AND (1 <= p35)) AND A (X (((1 <= p39))))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: ...considering subproblem: E (F (A ((((1 <= p31)) U ((1 <= p45))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:814
lola: rewrite Frontend/Parser/formula_rewrite.k:806
lola: processed formula: EF(A(((1 <= p31)) U ((1 <= p45))))
lola: processed formula length: 34
lola: 35 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 2 markings, 3 edges
lola: ========================================
lola: ========================================
lola: ...considering subproblem: E (F ((((1 <= p5) AND (1 <= p35)) AND A (X (((1 <= p39)))))))
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 <= p5) AND (1 <= p35)) AND AX(((1 <= p39)))))
lola: processed formula length: 53
lola: 35 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: 1263794 markings, 4151765 edges, 252759 markings/sec, 0 secs
lola: 1666866 markings, 8280497 edges, 80614 markings/sec, 5 secs
lola: 2450578 markings, 12224817 edges, 156742 markings/sec, 10 secs
lola: 3243334 markings, 16247708 edges, 158551 markings/sec, 15 secs
lola: 3373480 markings, 19967808 edges, 26029 markings/sec, 20 secs
lola: 4372927 markings, 23845601 edges, 199889 markings/sec, 25 secs
lola: 5007395 markings, 27824715 edges, 126894 markings/sec, 30 secs
lola: 5414506 markings, 31466128 edges, 81422 markings/sec, 35 secs
lola: 6449853 markings, 35215889 edges, 207069 markings/sec, 40 secs
lola: 6740670 markings, 38896423 edges, 58163 markings/sec, 45 secs
lola: 7459773 markings, 42547347 edges, 143821 markings/sec, 50 secs
lola: 8419468 markings, 46158542 edges, 191939 markings/sec, 55 secs
lola: 9290196 markings, 49767722 edges, 174146 markings/sec, 60 secs
lola: 10093288 markings, 53421152 edges, 160618 markings/sec, 65 secs
lola: 10836600 markings, 57172481 edges, 148662 markings/sec, 70 secs
lola: 11408583 markings, 61124536 edges, 114397 markings/sec, 75 secs
lola: 11621167 markings, 64799171 edges, 42517 markings/sec, 80 secs
lola: 11728191 markings, 68288774 edges, 21405 markings/sec, 85 secs
lola: 11791011 markings, 71681198 edges, 12564 markings/sec, 90 secs
lola: 11826495 markings, 75092627 edges, 7097 markings/sec, 95 secs
lola: 12388947 markings, 78634641 edges, 112490 markings/sec, 100 secs
lola: 13222166 markings, 81978878 edges, 166644 markings/sec, 105 secs
lola: 14004921 markings, 85380445 edges, 156551 markings/sec, 110 secs
lola: 14739529 markings, 88818706 edges, 146922 markings/sec, 115 secs
lola: 15432949 markings, 92334190 edges, 138684 markings/sec, 120 secs
lola: 16087996 markings, 95968913 edges, 131009 markings/sec, 125 secs
lola: 16533521 markings, 99743515 edges, 89105 markings/sec, 130 secs
lola: 16707839 markings, 103210725 edges, 34864 markings/sec, 135 secs
lola: 16804758 markings, 106515561 edges, 19384 markings/sec, 140 secs
lola: 16863071 markings, 109697048 edges, 11663 markings/sec, 145 secs
lola: 16896250 markings, 112821776 edges, 6636 markings/sec, 150 secs
lola: 17371659 markings, 116271140 edges, 95082 markings/sec, 155 secs
lola: 18305898 markings, 120016597 edges, 186848 markings/sec, 160 secs
lola: 18566814 markings, 123649311 edges, 52183 markings/sec, 165 secs
lola: 19015140 markings, 127153069 edges, 89665 markings/sec, 170 secs
lola: 19901580 markings, 130578373 edges, 177288 markings/sec, 175 secs
lola: 20702362 markings, 133969674 edges, 160156 markings/sec, 180 secs
lola: 21452747 markings, 137413831 edges, 150077 markings/sec, 185 secs
lola: 22158714 markings, 140935205 edges, 141193 markings/sec, 190 secs
lola: 22819802 markings, 144567547 edges, 132218 markings/sec, 195 secs
lola: 23275594 markings, 148342600 edges, 91158 markings/sec, 200 secs
lola: 23446129 markings, 151815314 edges, 34107 markings/sec, 205 secs
lola: 23545791 markings, 155145861 edges, 19932 markings/sec, 210 secs
lola: 23604822 markings, 158379071 edges, 11806 markings/sec, 215 secs
lola: 23644971 markings, 161560162 edges, 8030 markings/sec, 220 secs
lola: 23668892 markings, 164788548 edges, 4784 markings/sec, 225 secs
lola: 24398805 markings, 168324803 edges, 145983 markings/sec, 230 secs
lola: 25238444 markings, 171747976 edges, 167928 markings/sec, 235 secs
lola: 26021262 markings, 175217391 edges, 156564 markings/sec, 240 secs
lola: 26753922 markings, 178711965 edges, 146532 markings/sec, 245 secs
lola: 27444690 markings, 182280422 edges, 138154 markings/sec, 250 secs
lola: 28085270 markings, 185992421 edges, 128116 markings/sec, 255 secs
lola: 28427812 markings, 189745908 edges, 68508 markings/sec, 260 secs
lola: 28579748 markings, 193229321 edges, 30387 markings/sec, 265 secs
lola: 28662593 markings, 196579089 edges, 16569 markings/sec, 270 secs
lola: 28713277 markings, 199795191 edges, 10137 markings/sec, 275 secs
lola: 28742133 markings, 203069842 edges, 5771 markings/sec, 280 secs
lola: 29445764 markings, 206254378 edges, 140726 markings/sec, 285 secs
lola: 30192927 markings, 209222692 edges, 149433 markings/sec, 290 secs
lola: 30909823 markings, 212283050 edges, 143379 markings/sec, 295 secs
lola: 31585291 markings, 215396172 edges, 135094 markings/sec, 300 secs
lola: 32231627 markings, 218600731 edges, 129267 markings/sec, 305 secs
lola: 32844211 markings, 221915944 edges, 122517 markings/sec, 310 secs
lola: 33348189 markings, 225418167 edges, 100796 markings/sec, 315 secs
lola: 33543952 markings, 228684393 edges, 39153 markings/sec, 320 secs
lola: 33653250 markings, 231758547 edges, 21860 markings/sec, 325 secs
lola: 33722227 markings, 234723572 edges, 13795 markings/sec, 330 secs
lola: 33768272 markings, 237598455 edges, 9209 markings/sec, 335 secs
lola: 33797297 markings, 240363303 edges, 5805 markings/sec, 340 secs
lola: 33817277 markings, 243291285 edges, 3996 markings/sec, 345 secs
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 33819621 markings, 243838548 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: ========================================
lola: ...considering subproblem: (E (F (DEADLOCK)) OR (((1 <= p36) AND (1 <= p52) AND (1 <= p42) AND (1 <= p10) AND (1 <= p35)) AND (A (G (((1 <= p25) AND (1 <= p45)))) AND ((p45 <= 0) OR (p46 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: ...considering subproblem: ((p45 <= 0) OR (p46 <= 0))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((p45 <= 0) OR (p46 <= 0))
lola: processed formula length: 27
lola: 33 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: ========================================
lola: ...considering subproblem: ((1 <= p36) AND (1 <= p52) AND (1 <= p42) AND (1 <= p10) AND (1 <= p35))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((1 <= p36) AND (1 <= p52) AND (1 <= p42) AND (1 <= p10) AND (1 <= p35))
lola: processed formula length: 72
lola: 33 rewrites
lola: closed formula file CTLFireability.xml
lola: processed formula with 5 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: E (F (DEADLOCK))
lola: ========================================
lola: SUBTASK
lola: checking reachability of deadlocks
lola: Planning: workflow for deadlock check: search (--findpath=off,--siphontrap=off)
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 deadlock preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: RUNNING
lola: 1324073 markings, 3433013 edges, 264815 markings/sec, 0 secs
lola: 2416779 markings, 7082470 edges, 218541 markings/sec, 5 secs
lola: 3493175 markings, 10789502 edges, 215279 markings/sec, 10 secs
lola: 4447831 markings, 13972569 edges, 190931 markings/sec, 15 secs
lola: 5355478 markings, 17405210 edges, 181529 markings/sec, 20 secs
lola: 6169352 markings, 21002082 edges, 162775 markings/sec, 25 secs
lola: 7316812 markings, 24582857 edges, 229492 markings/sec, 30 secs
lola: 8203120 markings, 27779917 edges, 177262 markings/sec, 35 secs
lola: 9096592 markings, 30829994 edges, 178694 markings/sec, 40 secs
lola: 9692237 markings, 34196154 edges, 119129 markings/sec, 45 secs
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The net does not have deadlocks.
lola: 9717676 markings, 34413816 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: RESULT
lola:
SUMMARY: no yes no no yes no yes no no yes no yes
lola:
preliminary result: no yes no no yes no yes no no yes no yes
lola: memory consumption: 41500 KB
lola: time consumption: 1945 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="Raft-PT-03"
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 Raft-PT-03, 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 r172-smll-158987827600228"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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