About the Execution of ITS-LoLa for SwimmingPool-PT-06
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 15741.780 | 3600000.00 | 1346684.00 | 2312.70 | TF?T?FF??TTTTF?? | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/local/x2003239/mcc2020-input.r194-csrt-159033389800284.qcow2', fmt=qcow2 size=4294967296 backing_file=/local/x2003239/mcc2020-input.qcow2 encryption=off cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
..................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itslola
Input is SwimmingPool-PT-06, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r194-csrt-159033389800284
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 180K
-rw-r--r-- 1 mcc users 4.0K Apr 12 18:40 CTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Apr 12 18:40 CTLCardinality.xml
-rw-r--r-- 1 mcc users 3.0K Apr 11 20:57 CTLFireability.txt
-rw-r--r-- 1 mcc users 23K Apr 11 20:57 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 3.3K Apr 14 12:53 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Apr 28 14:02 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K Apr 14 12:53 LTLFireability.txt
-rw-r--r-- 1 mcc users 14K Apr 28 14:02 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.2K Apr 10 21:17 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 15K Apr 10 21:17 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Apr 10 05:50 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 14K Apr 10 05:50 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 10 22:29 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 10 22:29 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 3.9K 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 SwimmingPool-PT-06-CTLFireability-00
FORMULA_NAME SwimmingPool-PT-06-CTLFireability-01
FORMULA_NAME SwimmingPool-PT-06-CTLFireability-02
FORMULA_NAME SwimmingPool-PT-06-CTLFireability-03
FORMULA_NAME SwimmingPool-PT-06-CTLFireability-04
FORMULA_NAME SwimmingPool-PT-06-CTLFireability-05
FORMULA_NAME SwimmingPool-PT-06-CTLFireability-06
FORMULA_NAME SwimmingPool-PT-06-CTLFireability-07
FORMULA_NAME SwimmingPool-PT-06-CTLFireability-08
FORMULA_NAME SwimmingPool-PT-06-CTLFireability-09
FORMULA_NAME SwimmingPool-PT-06-CTLFireability-10
FORMULA_NAME SwimmingPool-PT-06-CTLFireability-11
FORMULA_NAME SwimmingPool-PT-06-CTLFireability-12
FORMULA_NAME SwimmingPool-PT-06-CTLFireability-13
FORMULA_NAME SwimmingPool-PT-06-CTLFireability-14
FORMULA_NAME SwimmingPool-PT-06-CTLFireability-15
=== Now, execution of the tool begins
BK_START 1591212280832
bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-03 19:24:42] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -timeout, 3600, -rebuildPNML]
[2020-06-03 19:24:42] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-03 19:24:42] [INFO ] Load time of PNML (sax parser for PT used): 35 ms
[2020-06-03 19:24:42] [INFO ] Transformed 9 places.
[2020-06-03 19:24:43] [INFO ] Transformed 7 transitions.
[2020-06-03 19:24:43] [INFO ] Parsed PT model containing 9 places and 7 transitions in 76 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 20 ms.
Finished random walk after 855 steps, including 0 resets, run visited all 25 properties in 5 ms. (steps per millisecond=171 )
[2020-06-03 19:24:43] [INFO ] Flatten gal took : 25 ms
[2020-06-03 19:24:43] [INFO ] Flatten gal took : 4 ms
[2020-06-03 19:24:43] [INFO ] Export to MCC properties in file /home/mcc/execution/CTLFireability.sr.xml took 4 ms.
[2020-06-03 19:24:43] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 1 ms.
info: Time: 3600 - MCC
vrfy: Checking CTLFireability @ SwimmingPool-PT-06 @ 3570 seconds
FORMULA SwimmingPool-PT-06-CTLFireability-01 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA SwimmingPool-PT-06-CTLFireability-05 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA SwimmingPool-PT-06-CTLFireability-09 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA SwimmingPool-PT-06-CTLFireability-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA SwimmingPool-PT-06-CTLFireability-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA SwimmingPool-PT-06-CTLFireability-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA SwimmingPool-PT-06-CTLFireability-03 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA SwimmingPool-PT-06-CTLFireability-06 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA SwimmingPool-PT-06-CTLFireability-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA SwimmingPool-PT-06-CTLFireability-00 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 0
rslt: Output for CTLFireability @ SwimmingPool-PT-06
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 2247
},
"exit":
{
"localtimelimitreached": false,
"memory": 33920,
"runtime": 3570.000000,
"signal": "User defined signal 1"
},
"result":
{
"preliminary_value": "yes no unknown yes unknown no no unknown unknown yes yes yes yes no unknown unknown "
},
"task":
{
"compoundnumber": 15,
"type": "boolean"
}
}
ncoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 4
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 2,
"problems": 2
},
"type": "eventual_occurrence",
"workflow": "stateequation"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": null
},
"task":
{
"compoundnumber": 14,
"type": "boolean"
}
}
],
"exit":
{
"error": null,
"memory": 33920,
"runtime": 3570.000000,
"signal": null,
"timelimitreached": true
},
"files":
{
"formula": "CTLFireability.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "A((* R *)) : (** AND (A(G(**)) OR (A(X(**)) AND **))) : E(F((A(G(**)) AND (** AND **)))) : E((** U A(F(**)))) : (** AND A((A(F(**)) U E(X(**))))) : (E(G(*)) OR ((A((* R *)) AND (A(X(*)) AND (** AND **))) OR (E(X(*)) AND A(G(*))))) : A((** U E(G(**)))) : ((A(G(**)) AND (** AND **)) OR ((E(G(*)) AND E((** U **))) OR (A(G(**)) AND (** OR (E(G(**)) OR (** OR (A(F(**)) AND **))))))) : E(F(A(G(*)))) : E(G(A(X(A(F(**)))))) : A(F(**)) : A(X(E(F(**)))) : A((** U (A(F(**)) AND E(F(**))))) : (A(G(A((** U **)))) AND (** OR ((E(X(**)) AND **) OR (E(X(**)) AND (** AND **))))) : E(F((A(F(**)) AND A(G(**))))) : (A(F(**)) AND (E(G(**)) OR (** OR (** OR **))))"
},
"net":
{
"arcs": 20,
"conflict_clusters": 6,
"places": 9,
"places_significant": 6,
"singleton_clusters": 0,
"transitions": 7
},
"result":
{
"interim_value": "yes no unknown yes unknown no no unknown unknown yes yes yes yes no unknown unknown ",
"preliminary_value": "yes no unknown yes unknown no no unknown unknown yes yes yes yes no unknown unknown "
},
"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: 16/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 288
lola: finding significant places
lola: 9 places, 7 transitions, 6 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: NOT(E ((((p1 <= 0) OR (p8 <= 0) OR (1 <= p4) OR ((1 <= p3) AND (1 <= p7))) U (1 <= p4)))) : (((1 <= p6) OR (p3 <= 0) OR (p7 <= 0) OR ((1 <= p0) AND (1 <= p7)) OR ((1 <= p2) AND ((1 <= p4) OR ((1 <= p3) AND (1 <= p7))))) AND (A (G ((1 <= p6))) OR (A (X (((1 <= p2) OR ((1 <= p1) AND (1 <= p8))))) AND ((p0 <= 0) OR (p7 <= 0))))) : E (F (((A (G ((p6 <= 0))) AND (1 <= p4)) AND ((p3 <= 0) OR (p7 <= 0))))) : E ((((1 <= p1) AND (1 <= p8)) U A (F ((((1 <= p3) AND (1 <= p7)) OR ((1 <= p1) AND (1 <= p8))))))) : ((p4 <= 0) AND A ((A (F ((1 <= p5))) U E (X ((1 <= p4)))))) : ((NOT(A (F (((1 <= p1) AND (1 <= p8))))) OR (((NOT(E ((((1 <= p3) AND (1 <= p7)) U (1 <= p6)))) AND NOT(E (X ((1 <= p4))))) AND (p5 <= 0)) AND (p4 <= 0))) OR (NOT(A (X ((1 <= p2)))) AND NOT(E (F (((1 <= p3) AND (1 <= p7))))))) : A ((((1 <= p4) OR (p5 <= 0)) U E (G (((p3 <= 0) OR (p7 <= 0)))))) : ((((A (G (((1 <= p2) OR ((1 <= p3) AND (1 <= p7))))) AND (p6 <= 0)) AND ((p3 <= 0) OR (p7 <= 0))) OR (NOT(A (F ((1 <= p2)))) AND E (((1 <= p4) U ((1 <= p0) AND (1 <= p7)))))) OR (A (G (((1 <= p6) OR ((1 <= p0) AND (1 <= p7)) OR ((1 <= p1) AND (1 <= p8) AND (1 <= p3) AND (1 <= p7))))) AND (((((1 <= p6) OR (1 <= p5)) OR E (G ((1 <= p5)))) OR ((1 <= p0) AND (1 <= p7))) OR (A (F ((1 <= p5))) AND (1 <= p4))))) : E (((0 <= 0) U NOT(E (F ((1 <= p4)))))) : E (G (A (X (A (F (((1 <= p1) AND (1 <= p8)))))))) : A (F (A ((((1 <= p3) AND (1 <= p7) AND (1 <= p4)) U (1 <= p2))))) : A (X (E (F (((p6 <= 0) AND (p5 <= 0)))))) : A (((1 <= p6) U (A (F (((1 <= p1) AND (1 <= p8)))) AND E (F (((1 <= p3) AND (1 <= p7))))))) : (A (G (A (((1 <= p2) U (1 <= p6))))) AND ((((p1 <= 0) OR (p8 <= 0) OR (1 <= p4)) OR (E (X ((1 <= p2))) AND ((1 <= p4) OR ((1 <= p6) AND (1 <= p2))))) OR ((E (X ((1 <= p2))) AND (p6 <= 0)) AND (p2 <= 0)))) : E (F ((A (F (((1 <= p3) AND (1 <= p7)))) AND A (G (((p0 <= 0) OR (p7 <= 0))))))) : (A (F (((1 <= p3) AND (1 <= p7)))) AND (((E (G ((1 <= p4))) OR (p4 <= 0)) OR (p1 <= 0)) OR (p8 <= 0)))
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:251
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k: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:326
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
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:254
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:100
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:169
lola: rewrite Frontend/Parser/formula_rewrite.k:440
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 222 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (((1 <= p6) OR (p3 <= 0) OR (p7 <= 0) OR ((1 <= p0) AND (1 <= p7)) OR ((1 <= p2) AND ((1 <= p4) OR ((1 <= p3) AND (1 <= p7))))) AND (A (G ((1 <= p6))) OR (A (X (((1 <= p2) OR ((1 <= p1) AND (1 <= p8))))) AND ((p0 <= 0) OR (p7 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 0 will run for 222 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((1 <= p6)))
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 <= p6)))
lola: processed formula length: 17
lola: 46 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: (p6 <= 0)
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 121 markings, 120 edges
lola: state equation: write sara problem file to CTLFireability-0.sara
lola: state equation: calling and running sara
lola: ========================================
lola: subprocess 1 will run for 237 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((p0 <= 0) OR (p7 <= 0))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((p0 <= 0) OR (p7 <= 0))
lola: processed formula length: 25
lola: 44 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 2 will run for 254 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((1 <= p6) OR (p3 <= 0) OR (p7 <= 0) OR ((1 <= p0) AND (1 <= p7)) OR ((1 <= p2) AND ((1 <= p4) OR ((1 <= p3) AND (1 <= p7)))))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((1 <= p6) OR (p3 <= 0) OR (p7 <= 0) OR ((1 <= p0) AND (1 <= p7)) OR ((1 <= p2) AND ((1 <= p4) OR ((1 <= p3) AND (1 <= p7)))))
lola: processed formula length: 131
lola: 44 rewrites
lola: closed formula file CTLFireability.xml
lola: processed formula with 9 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 3 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (((1 <= p2) OR ((1 <= p1) AND (1 <= p8)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:812
lola: processed formula: AX(((1 <= p2) OR ((1 <= p1) AND (1 <= p8))))
lola: processed formula length: 45
lola: 45 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
sara: try reading problem file CTLFireability-0.sara.
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 0 significant temporal operators and needs 0 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 0 markings, 0 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 1 will run for 237 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((p4 <= 0) AND A ((A (F ((1 <= p5))) U E (X ((1 <= p4))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:811
lola: rewrite Frontend/Parser/formula_rewrite.k:807
lola: rewrite Frontend/Parser/formula_rewrite.k:814
sara: place or transition ordering is non-deterministic
lola: processed formula: ((p4 <= 0) AND A(AF((1 <= p5)) U EX((1 <= p4))))
lola: processed formula length: 48
lola: 47 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: 2746809 markings, 6541023 edges, 549362 markings/sec, 0 secs
lola: 5300396 markings, 13175728 edges, 510717 markings/sec, 5 secs
lola: 7317401 markings, 19024123 edges, 403401 markings/sec, 10 secs
lola: 9243154 markings, 24872842 edges, 385151 markings/sec, 15 secs
lola: 10901545 markings, 29646227 edges, 331678 markings/sec, 20 secs
lola: 12421137 markings, 34069339 edges, 303918 markings/sec, 25 secs
lola: 13893280 markings, 38610902 edges, 294429 markings/sec, 30 secs
lola: 15687266 markings, 43762797 edges, 358797 markings/sec, 35 secs
lola: 17153708 markings, 48034832 edges, 293288 markings/sec, 40 secs
lola: 18673408 markings, 52687586 edges, 303940 markings/sec, 45 secs
lola: 20223909 markings, 57154079 edges, 310100 markings/sec, 50 secs
lola: 21687446 markings, 61417130 edges, 292707 markings/sec, 55 secs
lola: 23061051 markings, 65672803 edges, 274721 markings/sec, 60 secs
lola: 24618416 markings, 70133640 edges, 311473 markings/sec, 65 secs
lola: 26113710 markings, 74486267 edges, 299059 markings/sec, 70 secs
lola: 27542764 markings, 78749824 edges, 285811 markings/sec, 75 secs
lola: 29080802 markings, 83309036 edges, 307608 markings/sec, 80 secs
lola: 30501524 markings, 87442508 edges, 284144 markings/sec, 85 secs
lola: 31912493 markings, 91564576 edges, 282194 markings/sec, 90 secs
lola: 33412697 markings, 96105484 edges, 300041 markings/sec, 95 secs
lola: 34912627 markings, 100466588 edges, 299986 markings/sec, 100 secs
lola: 36325084 markings, 104592438 edges, 282491 markings/sec, 105 secs
lola: 37876146 markings, 109281258 edges, 310212 markings/sec, 110 secs
lola: 39307964 markings, 113441832 edges, 286364 markings/sec, 115 secs
lola: 40701432 markings, 117511213 edges, 278694 markings/sec, 120 secs
lola: 42146074 markings, 121898226 edges, 288928 markings/sec, 125 secs
lola: 43664930 markings, 126306410 edges, 303771 markings/sec, 130 secs
lola: 45086446 markings, 130457352 edges, 284303 markings/sec, 135 secs
lola: 46550038 markings, 134900855 edges, 292718 markings/sec, 140 secs
lola: 47997960 markings, 139100440 edges, 289584 markings/sec, 145 secs
lola: 49297651 markings, 142893095 edges, 259938 markings/sec, 150 secs
lola: 50748645 markings, 147312833 edges, 290199 markings/sec, 155 secs
lola: 52318512 markings, 151857101 edges, 313973 markings/sec, 160 secs
lola: 53759482 markings, 156061232 edges, 288194 markings/sec, 165 secs
lola: 55280783 markings, 160679995 edges, 304260 markings/sec, 170 secs
lola: 56837985 markings, 165192620 edges, 311440 markings/sec, 175 secs
lola: 58369075 markings, 169659645 edges, 306218 markings/sec, 180 secs
lola: 59943670 markings, 174423434 edges, 314919 markings/sec, 185 secs
lola: 61503010 markings, 178949339 edges, 311868 markings/sec, 190 secs
lola: 63007208 markings, 183341460 edges, 300840 markings/sec, 195 secs
lola: 64598209 markings, 188142625 edges, 318200 markings/sec, 200 secs
lola: 66185169 markings, 192755445 edges, 317392 markings/sec, 205 secs
lola: 67734645 markings, 197289765 edges, 309895 markings/sec, 210 secs
lola: 69329465 markings, 202083912 edges, 318964 markings/sec, 215 secs
lola: 70908740 markings, 206682568 edges, 315855 markings/sec, 220 secs
lola: 72497045 markings, 211509358 edges, 317661 markings/sec, 225 secs
lola: 74122680 markings, 216206141 edges, 325127 markings/sec, 230 secs
lola: local time limit reached - aborting
lola:
preliminary result: unknown no unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown
lola: memory consumption: 5448100 KB
lola: time consumption: 240 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 237 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E (G (((p1 <= 0) OR (p8 <= 0)))) OR ((A ((((p3 <= 0) OR (p7 <= 0)) R (p6 <= 0))) AND (A (X ((p4 <= 0))) AND ((p5 <= 0) AND (p4 <= 0)))) OR (E (X ((p2 <= 0))) AND A (G (((p3 <= 0) OR (p7 <= 0)))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 2 will run for 237 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((p5 <= 0) AND (p4 <= 0))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: rewrite Frontend/Parser/formula_rewrite.k:793
lola: processed formula: ((p5 <= 0) AND (p4 <= 0))
lola: processed formula length: 25
lola: 45 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 3 will run for 256 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((p3 <= 0) OR (p7 <= 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 (((p3 <= 0) OR (p7 <= 0))))
lola: processed formula length: 33
lola: 46 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:788
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: formula 0: ((1 <= p3) AND (1 <= p7))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: The predicate is not invariant.
lola: 5 markings, 4 edges
lola: ========================================
lola: subprocess 4 will run for 277 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G (((p1 <= 0) OR (p8 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation
lola: rewrite Frontend/Parser/formula_rewrite.k:583
lola: processed formula: E (G (((p1 <= 0) OR (p8 <= 0))))
lola: processed formula length: 33
lola: 45 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:788
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((1 <= p1) AND (1 <= p8))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space / EG
lola: The predicate is not possibly preserved.
lola: 121 markings, 120 edges
lola: state equation: write sara problem file to CTLFireability-4-0.sara
lola: ========================================
lola: subprocess 5 will run for 302 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A ((((p3 <= 0) OR (p7 <= 0)) R (p6 <= 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 ((((p3 <= 0) OR (p7 <= 0)) R (p6 <= 0)))
lola: processed formula length: 43
lola: 49 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: state equation task get result rewrite finished id 0
lola: SUBRESULT
lola: result: no
lola: produced by: state space /EU
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (1 <= p6)
lola: state equation task get result unparse finished id 0
lola: Predicate Phi does not release Predicate Psi on all paths.
lola: 0 markings, 0 edges
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 3 will run for 256 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G (A (X (A (F (((1 <= p1) AND (1 <= p8))))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:811
lola: rewrite Frontend/Parser/formula_rewrite.k:812
lola: rewrite Frontend/Parser/formula_rewrite.k:808
lola: processed formula: EG(AX(AF(((1 <= p1) AND (1 <= p8)))))
lola: processed formula length: 37
lola: 47 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 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: 250 markings, 623 edges
lola: ========================================
lola: subprocess 4 will run for 277 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (E (F (((p6 <= 0) AND (p5 <= 0))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:806
lola: rewrite Frontend/Parser/formula_rewrite.k:812
lola: processed formula: AX(EF(((p6 <= 0) AND (p5 <= 0))))
lola: processed formula length: 33
lola: 46 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 120 markings, 119 edges
lola: ========================================
lola: subprocess 5 will run for 302 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (G (A (((1 <= p2) U (1 <= p6))))) AND (((p1 <= 0) OR (p8 <= 0) OR (1 <= p4)) OR ((E (X ((1 <= p2))) AND ((1 <= p4) OR ((1 <= p6) AND (1 <= p2)))) OR (E (X ((1 <= p2))) AND ((p6 <= 0) AND (p2 <= 0))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 5 will run for 302 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((p6 <= 0) AND (p2 <= 0))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: rewrite Frontend/Parser/formula_rewrite.k:793
lola: processed formula: ((p6 <= 0) AND (p2 <= 0))
lola: processed formula length: 25
lola: 45 rewrites
lola: closed formula file CTLFireability.xml
lola: processed formula with 2 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 6 will run for 333 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((1 <= p4) OR ((1 <= p6) AND (1 <= p2)))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((1 <= p4) OR ((1 <= p6) AND (1 <= p2)))
lola: processed formula length: 41
lola: 44 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 7 will run for 370 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((p1 <= 0) OR (p8 <= 0) OR (1 <= p4))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((p1 <= 0) OR (p8 <= 0) OR (1 <= p4))
lola: processed formula length: 39
lola: 44 rewrites
lola: closed formula file CTLFireability.xml
lola: processed formula with 3 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 8 will run for 416 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (A (((1 <= p2) U (1 <= p6)))))
lola: ========================================
lola: SUBTASK
lola: checking a universal CTL formula with single counterexample path (use LTL...)
lola: rewrite Frontend/Parser/formula_rewrite.k:679
lola: rewrite Frontend/Parser/formula_rewrite.k:679
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (((1 <= p2) U (1 <= p6)))
lola: processed formula length: 27
lola: 46 rewrites
lola: closed formula file CTLFireability.xml
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The universal single path CTL formula does not hold.
lola: 426 markings, 426 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 6 will run for 333 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (A (G ((p4 <= 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 <= p4)
lola: processed formula length: 9
lola: 48 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using tscc preserving stubborn set method (--stubborn)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:700
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (p4 <= 0)
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation task get result started, id 1
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:788
lola: state equation task get result rewrite finished id 1
lola: state equation task get result unparse finished++ id 1
lola: formula 1: (1 <= p4)
lola: state equation task get result unparse finished id 1
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to CTLFireability-6-0.sara
lola: state equation: write sara problem file to CTLFireability-6-1.sara
lola: state equation: calling and running sara
sara: try reading problem file CTLFireability-6-1.sara.
sara: place or transition ordering is non-deterministic
lola: state equation: calling and running sara
sara: try reading problem file CTLFireability-6-0.sara.
sara: place or transition ordering is non-deterministic
lola: state equation 1: solution produced
lola: state equation 0: solution produced
lola: sara is running 0 secs || sara is running 0 secs || 2191433 markings, 6670569 edges, 438287 markings/sec, 0 secs
lola: sara is running 5 secs || sara is running 5 secs || 3944803 markings, 12351807 edges, 350674 markings/sec, 5 secs
lola: sara is running 10 secs || sara is running 10 secs || 5474939 markings, 17386508 edges, 306027 markings/sec, 10 secs
lola: sara is running 15 secs || sara is running 15 secs || 6986536 markings, 22406387 edges, 302319 markings/sec, 15 secs
lola: sara is running 20 secs || sara is running 20 secs || 8385961 markings, 27081534 edges, 279885 markings/sec, 20 secs
lola: sara is running 25 secs || sara is running 25 secs || 9779611 markings, 31758127 edges, 278730 markings/sec, 25 secs
lola: sara is running 30 secs || sara is running 30 secs || 11154607 markings, 36404486 edges, 274999 markings/sec, 30 secs
lola: sara is running 35 secs || sara is running 35 secs || 12534525 markings, 41069377 edges, 275984 markings/sec, 35 secs
lola: sara is running 40 secs || sara is running 40 secs || 13893972 markings, 45679022 edges, 271889 markings/sec, 40 secs
lola: sara is running 45 secs || sara is running 45 secs || 15228186 markings, 50225788 edges, 266843 markings/sec, 45 secs
lola: sara is running 50 secs || sara is running 50 secs || 16559333 markings, 54764732 edges, 266229 markings/sec, 50 secs
lola: sara is running 55 secs || sara is running 55 secs || 17871963 markings, 59247809 edges, 262526 markings/sec, 55 secs
lola: sara is running 60 secs || sara is running 60 secs || 18995106 markings, 63094101 edges, 224629 markings/sec, 60 secs
lola: sara is running 65 secs || sara is running 65 secs || 20100995 markings, 66886203 edges, 221178 markings/sec, 65 secs
lola: sara is running 70 secs || sara is running 70 secs || 21332478 markings, 71122377 edges, 246297 markings/sec, 70 secs
lola: sara is running 75 secs || sara is running 75 secs || 22648913 markings, 75665370 edges, 263287 markings/sec, 75 secs
lola: sara is running 80 secs || sara is running 80 secs || 23970246 markings, 80207957 edges, 264267 markings/sec, 80 secs
lola: sara is running 85 secs || sara is running 85 secs || 25274839 markings, 84702154 edges, 260919 markings/sec, 85 secs
lola: sara is running 90 secs || sara is running 90 secs || 26578326 markings, 89211599 edges, 260697 markings/sec, 90 secs
lola: sara is running 95 secs || sara is running 95 secs || 27879434 markings, 93708251 edges, 260222 markings/sec, 95 secs
lola: sara is running 100 secs || sara is running 100 secs || 29169115 markings, 98177046 edges, 257936 markings/sec, 100 secs
lola: sara is running 105 secs || sara is running 105 secs || 30427189 markings, 102540100 edges, 251615 markings/sec, 105 secs
lola: sara is running 110 secs || sara is running 110 secs || 31715336 markings, 107004722 edges, 257629 markings/sec, 110 secs
lola: sara is running 115 secs || sara is running 115 secs || 32996255 markings, 111457473 edges, 256184 markings/sec, 115 secs
lola: sara is running 120 secs || sara is running 120 secs || 34270843 markings, 115886895 edges, 254918 markings/sec, 120 secs
lola: sara is running 125 secs || sara is running 125 secs || 35533860 markings, 120280854 edges, 252603 markings/sec, 125 secs
lola: sara is running 130 secs || sara is running 130 secs || 36804052 markings, 124697755 edges, 254038 markings/sec, 130 secs
lola: sara is running 135 secs || sara is running 135 secs || 38082239 markings, 129140938 edges, 255637 markings/sec, 135 secs
lola: sara is running 140 secs || sara is running 140 secs || 39343439 markings, 133540943 edges, 252240 markings/sec, 140 secs
lola: sara is running 145 secs || sara is running 145 secs || 40608725 markings, 137956723 edges, 253057 markings/sec, 145 secs
lola: sara is running 150 secs || sara is running 150 secs || 41855435 markings, 142312977 edges, 249342 markings/sec, 150 secs
lola: sara is running 155 secs || sara is running 155 secs || 43112792 markings, 146708195 edges, 251471 markings/sec, 155 secs
lola: sara is running 160 secs || sara is running 160 secs || 44354574 markings, 151062823 edges, 248356 markings/sec, 160 secs
lola: sara is running 165 secs || sara is running 165 secs || 45604329 markings, 155437559 edges, 249951 markings/sec, 165 secs
lola: sara is running 170 secs || sara is running 170 secs || 46840798 markings, 159769433 edges, 247294 markings/sec, 170 secs
lola: sara is running 175 secs || sara is running 175 secs || 48082888 markings, 164116850 edges, 248418 markings/sec, 175 secs
lola: sara is running 180 secs || sara is running 180 secs || 49302050 markings, 168400133 edges, 243832 markings/sec, 180 secs
lola: sara is running 185 secs || sara is running 185 secs || 50467163 markings, 172493257 edges, 233023 markings/sec, 185 secs
lola: sara is running 190 secs || sara is running 190 secs || 51642948 markings, 176615971 edges, 235157 markings/sec, 190 secs
lola: sara is running 195 secs || sara is running 195 secs || 52822227 markings, 180752778 edges, 235856 markings/sec, 195 secs
lola: sara is running 200 secs || sara is running 200 secs || 53999436 markings, 184887926 edges, 235442 markings/sec, 200 secs
lola: sara is running 205 secs || sara is running 205 secs || 55161686 markings, 188972112 edges, 232450 markings/sec, 205 secs
lola: sara is running 210 secs || sara is running 210 secs || 56319806 markings, 193041649 edges, 231624 markings/sec, 210 secs
lola: sara is running 215 secs || sara is running 215 secs || 57472667 markings, 197090143 edges, 230572 markings/sec, 215 secs
lola: sara is running 220 secs || sara is running 220 secs || 58661543 markings, 201271140 edges, 237775 markings/sec, 220 secs
lola: sara is running 225 secs || sara is running 225 secs || 59836606 markings, 205415922 edges, 235013 markings/sec, 225 secs
lola: sara is running 230 secs || sara is running 230 secs || 61012136 markings, 209563291 edges, 235106 markings/sec, 230 secs
lola: sara is running 235 secs || sara is running 235 secs || 62199593 markings, 213747349 edges, 237491 markings/sec, 235 secs
lola: sara is running 240 secs || sara is running 240 secs || 63374724 markings, 217894740 edges, 235026 markings/sec, 240 secs
lola: sara is running 245 secs || sara is running 245 secs || 64567700 markings, 222094380 edges, 238595 markings/sec, 245 secs
lola: sara is running 250 secs || sara is running 250 secs || 65696585 markings, 226081772 edges, 225777 markings/sec, 250 secs
lola: sara is running 255 secs || sara is running 255 secs || 66857862 markings, 230184598 edges, 232255 markings/sec, 255 secs
lola: sara is running 260 secs || sara is running 260 secs || 68014070 markings, 234260300 edges, 231242 markings/sec, 260 secs
lola: sara is running 265 secs || sara is running 265 secs || 69097975 markings, 238087238 edges, 216781 markings/sec, 265 secs
lola: sara is running 270 secs || sara is running 270 secs || 70246280 markings, 242141645 edges, 229661 markings/sec, 270 secs
lola: sara is running 275 secs || sara is running 275 secs || 71392360 markings, 246202577 edges, 229216 markings/sec, 275 secs
lola: sara is running 280 secs || sara is running 280 secs || 72467278 markings, 249994100 edges, 214984 markings/sec, 280 secs
lola: sara is running 285 secs || sara is running 285 secs || 73551962 markings, 253840664 edges, 216937 markings/sec, 285 secs
lola: sara is running 290 secs || sara is running 290 secs || 74679196 markings, 257822742 edges, 225447 markings/sec, 290 secs
lola: sara is running 295 secs || sara is running 295 secs || 75793779 markings, 261778204 edges, 222917 markings/sec, 295 secs
lola: sara is running 300 secs || sara is running 300 secs || 76916056 markings, 265750185 edges, 224455 markings/sec, 300 secs
lola: sara is running 305 secs || sara is running 305 secs || 78028842 markings, 269689214 edges, 222557 markings/sec, 305 secs
lola: sara is running 310 secs || sara is running 310 secs || 79091723 markings, 273462899 edges, 212576 markings/sec, 310 secs
lola: sara is running 315 secs || sara is running 315 secs || 80214122 markings, 277436973 edges, 224480 markings/sec, 315 secs
lola: sara is running 320 secs || sara is running 320 secs || 81359091 markings, 281490021 edges, 228994 markings/sec, 320 secs
lola: sara is running 325 secs || sara is running 325 secs || 82501812 markings, 285541719 edges, 228544 markings/sec, 325 secs
lola: local time limit reached - aborting
lola:
preliminary result: unknown no unknown unknown unknown no unknown unknown unknown yes unknown yes unknown no unknown unknown
lola: memory consumption: 9001300 KB
lola: time consumption: 573 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 7 will run for 332 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F ((1 <= p2)))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:584
lola: rewrite Frontend/Parser/formula_rewrite.k:749
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: (p2 <= 0)
lola: processed formula length: 9
lola: 47 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:700
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (1 <= p2)
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space / EG
lola: The predicate eventually occurs.
lola: 181 markings, 180 edges
lola: state equation: write sara problem file to CTLFireability-7-0.sara
lola: state equation: calling and running sara
lola: ========================================
sara: try reading problem file CTLFireability-7-0.sara.
sara: place or transition ordering is non-deterministic
lola: subprocess 8 will run for 374 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((A (F (((1 <= p3) AND (1 <= p7)))) AND A (G (((p0 <= 0) OR (p7 <= 0)))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:811
lola: rewrite Frontend/Parser/formula_rewrite.k:813
lola: rewrite Frontend/Parser/formula_rewrite.k:806
lola: processed formula: EF((AF(((1 <= p3) AND (1 <= p7))) AND AG(((p0 <= 0) OR (p7 <= 0)))))
lola: processed formula length: 69
lola: 47 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 3 significant temporal operators and needs 13 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: 2870984 markings, 7497554 edges, 574197 markings/sec, 0 secs
lola: 5419161 markings, 14488881 edges, 509635 markings/sec, 5 secs
lola: 7841475 markings, 21138183 edges, 484463 markings/sec, 10 secs
lola: 10199750 markings, 27617829 edges, 471655 markings/sec, 15 secs
lola: 12505524 markings, 34106729 edges, 461155 markings/sec, 20 secs
lola: 14573110 markings, 40108596 edges, 413517 markings/sec, 25 secs
lola: 16593903 markings, 46017301 edges, 404159 markings/sec, 30 secs
lola: 18682554 markings, 52163325 edges, 417730 markings/sec, 35 secs
lola: 20572292 markings, 57799785 edges, 377948 markings/sec, 40 secs
lola: 22399790 markings, 63378754 edges, 365500 markings/sec, 45 secs
lola: 24449938 markings, 69506792 edges, 410030 markings/sec, 50 secs
lola: 26372394 markings, 75395964 edges, 384491 markings/sec, 55 secs
lola: 28290218 markings, 81207500 edges, 383565 markings/sec, 60 secs
lola: 30104033 markings, 86894269 edges, 362763 markings/sec, 65 secs
lola: 31875479 markings, 92614967 edges, 354289 markings/sec, 70 secs
lola: 33787402 markings, 98343251 edges, 382385 markings/sec, 75 secs
lola: 35486742 markings, 103860869 edges, 339868 markings/sec, 80 secs
lola: 37334136 markings, 109700749 edges, 369479 markings/sec, 85 secs
lola: 39048049 markings, 115138170 edges, 342783 markings/sec, 90 secs
lola: 40785723 markings, 120825330 edges, 347535 markings/sec, 95 secs
lola: 42436319 markings, 126265029 edges, 330119 markings/sec, 100 secs
lola: 43981504 markings, 131649706 edges, 309037 markings/sec, 105 secs
lola: 45551534 markings, 137107287 edges, 314006 markings/sec, 110 secs
lola: 47173267 markings, 142506391 edges, 324347 markings/sec, 115 secs
lola: 48631825 markings, 147919347 edges, 291712 markings/sec, 120 secs
lola: 50142680 markings, 153339532 edges, 302171 markings/sec, 125 secs
lola: 51592819 markings, 158972040 edges, 290028 markings/sec, 130 secs
lola: 53046753 markings, 164243734 edges, 290787 markings/sec, 135 secs
lola: 54322379 markings, 169685378 edges, 255125 markings/sec, 140 secs
lola: 55603185 markings, 174960925 edges, 256161 markings/sec, 145 secs
lola: 56954084 markings, 180327335 edges, 270180 markings/sec, 150 secs
lola: 58176863 markings, 185773362 edges, 244556 markings/sec, 155 secs
lola: 59449606 markings, 191022351 edges, 254549 markings/sec, 160 secs
lola: 60775319 markings, 196351506 edges, 265143 markings/sec, 165 secs
lola: 61948979 markings, 201576240 edges, 234732 markings/sec, 170 secs
lola: 63071483 markings, 206742194 edges, 224501 markings/sec, 175 secs
lola: 64250712 markings, 212289591 edges, 235846 markings/sec, 180 secs
lola: 65478495 markings, 217913522 edges, 245557 markings/sec, 185 secs
lola: 66691366 markings, 223510069 edges, 242574 markings/sec, 190 secs
lola: 67721331 markings, 228993171 edges, 205993 markings/sec, 195 secs
lola: 68868695 markings, 234573635 edges, 229473 markings/sec, 200 secs
lola: 70042369 markings, 239982114 edges, 234735 markings/sec, 205 secs
lola: 71305574 markings, 245535661 edges, 252641 markings/sec, 210 secs
lola: 72418998 markings, 251141275 edges, 222685 markings/sec, 215 secs
lola: 73309789 markings, 256454188 edges, 178158 markings/sec, 220 secs
lola: 74388285 markings, 261881504 edges, 215699 markings/sec, 225 secs
lola: 75390388 markings, 267262021 edges, 200421 markings/sec, 230 secs
lola: 76523524 markings, 272765120 edges, 226627 markings/sec, 235 secs
lola: 77419647 markings, 278194497 edges, 179225 markings/sec, 240 secs
lola: 78582263 markings, 283866421 edges, 232523 markings/sec, 245 secs
lola: 79698870 markings, 289410063 edges, 223321 markings/sec, 250 secs
lola: 80631160 markings, 294516705 edges, 186458 markings/sec, 255 secs
lola: 81513937 markings, 299691739 edges, 176555 markings/sec, 260 secs
lola: 82346629 markings, 304713358 edges, 166538 markings/sec, 265 secs
lola: 83479546 markings, 309863831 edges, 226583 markings/sec, 270 secs
lola: 84242170 markings, 314815787 edges, 152525 markings/sec, 275 secs
lola: 85206787 markings, 320008233 edges, 192923 markings/sec, 280 secs
lola: 86115564 markings, 325162578 edges, 181755 markings/sec, 285 secs
lola: 86936367 markings, 330120581 edges, 164161 markings/sec, 290 secs
lola: 87766926 markings, 335071684 edges, 166112 markings/sec, 295 secs
lola: 88731047 markings, 340111702 edges, 192824 markings/sec, 300 secs
lola: 89446237 markings, 345000327 edges, 143038 markings/sec, 305 secs
lola: 90376686 markings, 349942802 edges, 186090 markings/sec, 310 secs
lola: 91317693 markings, 354922309 edges, 188201 markings/sec, 315 secs
lola: 92158717 markings, 359849994 edges, 168205 markings/sec, 320 secs
lola: 92974921 markings, 364883570 edges, 163241 markings/sec, 325 secs
lola: 93789421 markings, 369766915 edges, 162900 markings/sec, 330 secs
lola: 94505367 markings, 374624914 edges, 143189 markings/sec, 335 secs
lola: 95410778 markings, 379653970 edges, 181082 markings/sec, 340 secs
lola: 96097842 markings, 384464863 edges, 137413 markings/sec, 345 secs
lola: 97011606 markings, 389339522 edges, 182753 markings/sec, 350 secs
lola: 97829433 markings, 394211849 edges, 163565 markings/sec, 355 secs
lola: 98561054 markings, 399273468 edges, 146324 markings/sec, 360 secs
lola: 99293497 markings, 404332735 edges, 146489 markings/sec, 365 secs
lola: local time limit reached - aborting
lola:
preliminary result: unknown no unknown unknown unknown no unknown unknown unknown yes yes yes unknown no unknown unknown
lola: memory consumption: 9602308 KB
lola: time consumption: 948 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 9 will run for 374 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((A (G ((p6 <= 0))) AND ((1 <= p4) AND ((p3 <= 0) OR (p7 <= 0))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:813
lola: rewrite Frontend/Parser/formula_rewrite.k:806
lola: processed formula: EF((AG((p6 <= 0)) AND ((1 <= p4) AND ((p3 <= 0) OR (p7 <= 0)))))
lola: processed formula length: 65
lola: 46 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: 1648285 markings, 7264678 edges, 329657 markings/sec, 0 secs
lola: 2998810 markings, 13437096 edges, 270105 markings/sec, 5 secs
lola: 4288568 markings, 19369446 edges, 257952 markings/sec, 10 secs
lola: 5513539 markings, 25038702 edges, 244994 markings/sec, 15 secs
lola: 6712384 markings, 30596855 edges, 239769 markings/sec, 20 secs
lola: 7896618 markings, 36100116 edges, 236847 markings/sec, 25 secs
lola: 9048451 markings, 41465528 edges, 230367 markings/sec, 30 secs
lola: 10176363 markings, 46728391 edges, 225582 markings/sec, 35 secs
lola: 11307182 markings, 52010016 edges, 226164 markings/sec, 40 secs
lola: 12441120 markings, 57310020 edges, 226788 markings/sec, 45 secs
lola: 13548494 markings, 62491853 edges, 221475 markings/sec, 50 secs
lola: 14647765 markings, 67641048 edges, 219854 markings/sec, 55 secs
lola: 15730282 markings, 72722092 edges, 216503 markings/sec, 60 secs
lola: 16812069 markings, 77792864 edges, 216357 markings/sec, 65 secs
lola: 17852447 markings, 82673647 edges, 208076 markings/sec, 70 secs
lola: 18897839 markings, 87588206 edges, 209078 markings/sec, 75 secs
lola: 19936412 markings, 92471138 edges, 207715 markings/sec, 80 secs
lola: 20988444 markings, 97414378 edges, 210406 markings/sec, 85 secs
lola: 21991293 markings, 102138541 edges, 200570 markings/sec, 90 secs
lola: 23017632 markings, 106972361 edges, 205268 markings/sec, 95 secs
lola: 24057164 markings, 111867994 edges, 207906 markings/sec, 100 secs
lola: 25095453 markings, 116761280 edges, 207658 markings/sec, 105 secs
lola: 26130691 markings, 121636638 edges, 207048 markings/sec, 110 secs
lola: 27166608 markings, 126521810 edges, 207183 markings/sec, 115 secs
lola: 28201688 markings, 131404065 edges, 207016 markings/sec, 120 secs
lola: 29232618 markings, 136274321 edges, 206186 markings/sec, 125 secs
lola: 30266892 markings, 141152447 edges, 206855 markings/sec, 130 secs
lola: 31308568 markings, 146069154 edges, 208335 markings/sec, 135 secs
lola: 32266199 markings, 150596715 edges, 191526 markings/sec, 140 secs
lola: 33202586 markings, 155026737 edges, 187277 markings/sec, 145 secs
lola: 34145448 markings, 159477550 edges, 188572 markings/sec, 150 secs
lola: 35101937 markings, 163998634 edges, 191298 markings/sec, 155 secs
lola: 36116968 markings, 168799409 edges, 203006 markings/sec, 160 secs
lola: 37130626 markings, 173588016 edges, 202732 markings/sec, 165 secs
lola: 38128050 markings, 178306388 edges, 199485 markings/sec, 170 secs
lola: 39139532 markings, 183097469 edges, 202296 markings/sec, 175 secs
lola: 40131210 markings, 187792219 edges, 198336 markings/sec, 180 secs
lola: 41154197 markings, 192632141 edges, 204597 markings/sec, 185 secs
lola: 42151078 markings, 197355163 edges, 199376 markings/sec, 190 secs
lola: 43064010 markings, 201686455 edges, 182586 markings/sec, 195 secs
lola: 43996294 markings, 206100387 edges, 186457 markings/sec, 200 secs
lola: 44918163 markings, 210465710 edges, 184374 markings/sec, 205 secs
lola: 45865913 markings, 214958427 edges, 189550 markings/sec, 210 secs
lola: 46866227 markings, 219697774 edges, 200063 markings/sec, 215 secs
lola: 47850676 markings, 224369922 edges, 196890 markings/sec, 220 secs
lola: 48851674 markings, 229114861 edges, 200200 markings/sec, 225 secs
lola: 49814609 markings, 233683475 edges, 192587 markings/sec, 230 secs
lola: 50781688 markings, 238270670 edges, 193416 markings/sec, 235 secs
lola: 51750667 markings, 242864110 edges, 193796 markings/sec, 240 secs
lola: 52723919 markings, 247484198 edges, 194650 markings/sec, 245 secs
lola: 53700765 markings, 252118086 edges, 195369 markings/sec, 250 secs
lola: 54679872 markings, 256762127 edges, 195821 markings/sec, 255 secs
lola: 55656128 markings, 261398734 edges, 195251 markings/sec, 260 secs
lola: 56635333 markings, 266040711 edges, 195841 markings/sec, 265 secs
lola: 57602799 markings, 270639043 edges, 193493 markings/sec, 270 secs
lola: 58561187 markings, 275192593 edges, 191678 markings/sec, 275 secs
lola: 59526025 markings, 279776125 edges, 192968 markings/sec, 280 secs
lola: 60486254 markings, 284341490 edges, 192046 markings/sec, 285 secs
lola: 61444502 markings, 288900939 edges, 191650 markings/sec, 290 secs
lola: 62414917 markings, 293506223 edges, 194083 markings/sec, 295 secs
lola: 63377582 markings, 298080169 edges, 192533 markings/sec, 300 secs
lola: 64339528 markings, 302653827 edges, 192389 markings/sec, 305 secs
lola: 65301785 markings, 307225543 edges, 192451 markings/sec, 310 secs
lola: 66261064 markings, 311787767 edges, 191856 markings/sec, 315 secs
lola: 67216649 markings, 316332126 edges, 191117 markings/sec, 320 secs
lola: 68170108 markings, 320866669 edges, 190692 markings/sec, 325 secs
lola: 69108001 markings, 325322529 edges, 187579 markings/sec, 330 secs
lola: 70048762 markings, 329797859 edges, 188152 markings/sec, 335 secs
lola: 70979119 markings, 334220939 edges, 186071 markings/sec, 340 secs
lola: 71917184 markings, 338688698 edges, 187613 markings/sec, 345 secs
lola: 72862463 markings, 343183944 edges, 189056 markings/sec, 350 secs
lola: 73793269 markings, 347613998 edges, 186161 markings/sec, 355 secs
lola: 74723999 markings, 352046970 edges, 186146 markings/sec, 360 secs
lola: 75661755 markings, 356511320 edges, 187551 markings/sec, 365 secs
lola: local time limit reached - aborting
lola:
preliminary result: unknown no unknown unknown unknown no unknown unknown unknown yes yes yes unknown no unknown unknown
lola: memory consumption: 10941080 KB
lola: time consumption: 1322 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 10 will run for 374 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E ((((1 <= p1) AND (1 <= p8)) U A (F ((((1 <= p3) AND (1 <= p7)) OR ((1 <= p1) AND (1 <= p8)))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:811
lola: rewrite Frontend/Parser/formula_rewrite.k:809
lola: processed formula: E(((1 <= p1) AND (1 <= p8)) U AF((((1 <= p3) AND (1 <= p7)) OR ((1 <= p1) AND (1 <= p8)))))
lola: processed formula length: 92
lola: 46 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: 241 markings, 241 edges
lola: ========================================
lola: subprocess 11 will run for 449 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A ((((1 <= p4) OR (p5 <= 0)) U E (G (((p3 <= 0) OR (p7 <= 0))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:808
lola: rewrite Frontend/Parser/formula_rewrite.k:814
lola: processed formula: A(((1 <= p4) OR (p5 <= 0)) U EG(((p3 <= 0) OR (p7 <= 0))))
lola: processed formula length: 60
lola: 46 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 307991 markings, 608671 edges
lola: ========================================
lola: subprocess 12 will run for 561 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (((1 <= p6) U (A (F (((1 <= p1) AND (1 <= p8)))) AND E (F (((1 <= p3) AND (1 <= p7)))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:811
lola: rewrite Frontend/Parser/formula_rewrite.k:806
lola: rewrite Frontend/Parser/formula_rewrite.k:814
lola: processed formula: A((1 <= p6) U (AF(((1 <= p1) AND (1 <= p8))) AND EF(((1 <= p3) AND (1 <= p7)))))
lola: processed formula length: 80
lola: 47 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 3 significant temporal operators and needs 13 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 243 markings, 365 edges
lola: ========================================
lola: subprocess 13 will run for 749 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A ((((1 <= p1) AND (1 <= p8) AND (p4 <= 0) AND ((p3 <= 0) OR (p7 <= 0))) R (p4 <= 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 ((((1 <= p1) AND (1 <= p8) AND (p4 <= 0) AND ((p3 <= 0) OR (p7 <= 0))) R (p4 <= 0)))
lola: processed formula length: 87
lola: 49 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: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (1 <= p4)
lola: state equation task get result unparse finished id 0
lola: SUBRESULT
lola: result: yes
lola: produced by: state space /EU
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: Predicate Phi releases Predicate Psi on all paths.
lola: 121 markings, 120 edges
lola: ========================================
lola: subprocess 14 will run for 1123 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (F (((1 <= p3) AND (1 <= p7)))) AND (E (G ((1 <= p4))) OR ((p4 <= 0) OR ((p1 <= 0) OR (p8 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 14 will run for 1123 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G ((1 <= p4)))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation
lola: rewrite Frontend/Parser/formula_rewrite.k:583
lola: processed formula: E (G ((1 <= p4)))
lola: processed formula length: 17
lola: 45 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (p4 <= 0)
lola: state equation task get result unparse finished id 0
lola: SUBRESULT
lola: result: no
lola: produced by: state space / EG
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: The predicate is not possibly preserved.
lola: 1 markings, 0 edges
lola: ========================================
lola: subprocess 15 will run for 2247 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (((1 <= p3) AND (1 <= p7))))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:584
lola: rewrite Frontend/Parser/formula_rewrite.k:749
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: ((p3 <= 0) OR (p7 <= 0))
lola: processed formula length: 25
lola: 47 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:700
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((1 <= p3) AND (1 <= p7))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space / EG
lola: The predicate eventually occurs.
lola: 241 markings, 240 edges
lola: state equation: write sara problem file to CTLFireability-15-0.sara
lola: ========================================
lola: Child process aborted or communication problem between parent and child process
lola: SUBRESULT
lola: result: unknown
lola: The Boolean predicate may be true or false.
lola: ========================================
lola: subprocess 15 will run for 2247 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((A (G (((1 <= p2) OR ((1 <= p3) AND (1 <= p7))))) AND ((p6 <= 0) AND ((p3 <= 0) OR (p7 <= 0)))) OR ((E (G ((p2 <= 0))) AND E (((1 <= p4) U ((1 <= p0) AND (1 <= p7))))) OR (A (G (((1 <= p6) OR ((1 <= p0) AND (1 <= p7)) OR ((1 <= p1) AND (1 <= p8) AND (1 <= p3) AND (1 <= p7))))) AND (((1 <= p6) OR (1 <= p5)) OR (E (G ((1 <= p5))) OR (((1 <= p0) AND (1 <= p7)) OR (A (F ((1 <= p5))) AND (1 <= p4... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: time limit reached - aborting
lola:
preliminary result: yes no unknown yes unknown no no unknown unknown yes yes yes yes no unknown unknown
lola:
preliminary result: yes no unknown yes unknown no no unknown unknown yes yes yes yes no unknown unknown
lola: caught signal User defined signal 1 - aborting LoLA
lola:
preliminary result: yes no unknown yes unknown no no unknown unknown yes yes yes yes no unknown unknown
lola: memory consumption: 33920 KB
lola: time consumption: 3570 seconds
lola: print data as JSON (--json)
lola: memory consumption: 33920 KB
lola: time consumption: 3570 seconds
lola: print data as JSON (--json)
lola: writing JSON to CTLFireability.json
lola: closed JSON file CTLFireability.json
lola: writing JSON to CTLFireability.json
lola: closed JSON file CTLFireability.json
lola: caught signal User defined signal 1 - aborting LoLA
rslt: finished
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16427332 kB
MemFree: 16127172 kB
After kill :
MemTotal: 16427332 kB
MemFree: 16126904 kB
--------------------
content from stderr:
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="SwimmingPool-PT-06"
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 SwimmingPool-PT-06, examination is CTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r194-csrt-159033389800284"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/SwimmingPool-PT-06.tgz
mv SwimmingPool-PT-06 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 '
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 ;