Execution Chart

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

Trace from the execution

Formatting '/data/fko/mcc2020-input.r186-oct2-158987938500075.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fko/mcc2020-input.qcow2 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 RefineWMG-PT-015016, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r186-oct2-158987938500075
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 220K
-rw-r--r-- 1 mcc users 3.3K Apr 12 10:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 21K Apr 12 10:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 11 12:00 CTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 11 12:00 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.6K Apr 14 12:48 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K Apr 28 14:02 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K Apr 14 12:48 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Apr 28 14:02 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.0K Apr 10 16:32 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 16K Apr 10 16:32 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Apr 9 22:56 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 9 22:56 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.4K Apr 10 22:28 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.4K 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 7 Mar 24 05:38 instance
-rw-r--r-- 1 mcc users 6 Mar 24 05:38 iscolored
-rw-r--r-- 1 mcc users 35K 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 n0-CTLCardinality-00
FORMULA_NAME n0-CTLCardinality-01
FORMULA_NAME n0-CTLCardinality-02
FORMULA_NAME n0-CTLCardinality-03
FORMULA_NAME n0-CTLCardinality-04
FORMULA_NAME n0-CTLCardinality-05
FORMULA_NAME n0-CTLCardinality-06
FORMULA_NAME n0-CTLCardinality-07
FORMULA_NAME n0-CTLCardinality-08
FORMULA_NAME n0-CTLCardinality-09
FORMULA_NAME n0-CTLCardinality-10
FORMULA_NAME n0-CTLCardinality-11
FORMULA_NAME n0-CTLCardinality-12
FORMULA_NAME n0-CTLCardinality-13
FORMULA_NAME n0-CTLCardinality-14
FORMULA_NAME n0-CTLCardinality-15

=== Now, execution of the tool begins

BK_START 1591225380718

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-03 23:03:04] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -timeout, 3600, -rebuildPNML]
[2020-06-03 23:03:04] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-03 23:03:12] [INFO ] Load time of PNML (sax parser for PT used): 8623 ms
[2020-06-03 23:03:12] [INFO ] Transformed 79 places.
[2020-06-03 23:03:12] [INFO ] Transformed 63 transitions.
[2020-06-03 23:03:12] [INFO ] Parsed PT model containing 79 places and 63 transitions in 8684 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 32 ms.
Incomplete random walk after 100011 steps, including 0 resets, run finished after 205 ms. (steps per millisecond=487 ) properties seen :[1, 1, 1, 1, 1, 1, 0, 1, 0, 0, 0, 0, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1]
// Phase 1: matrix 63 rows 79 cols
[2020-06-03 23:03:13] [INFO ] Computed 32 place invariants in 3 ms
[2020-06-03 23:03:13] [INFO ] [Real]Absence check using 32 positive place invariants in 212 ms returned sat
[2020-06-03 23:03:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 23:03:13] [INFO ] [Real]Absence check using state equation in 78 ms returned sat
[2020-06-03 23:03:13] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 23:03:13] [INFO ] [Nat]Absence check using 32 positive place invariants in 29 ms returned sat
[2020-06-03 23:03:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 23:03:13] [INFO ] [Nat]Absence check using state equation in 49 ms returned sat
[2020-06-03 23:03:13] [INFO ] Computed and/alt/rep : 47/62/47 causal constraints in 13 ms.
[2020-06-03 23:03:13] [INFO ] Added : 34 causal constraints over 7 iterations in 238 ms. Result :sat
[2020-06-03 23:03:14] [INFO ] [Real]Absence check using 32 positive place invariants in 30 ms returned sat
[2020-06-03 23:03:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 23:03:14] [INFO ] [Real]Absence check using state equation in 40 ms returned sat
[2020-06-03 23:03:14] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 23:03:14] [INFO ] [Nat]Absence check using 32 positive place invariants in 9 ms returned sat
[2020-06-03 23:03:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 23:03:14] [INFO ] [Nat]Absence check using state equation in 28 ms returned sat
[2020-06-03 23:03:14] [INFO ] Computed and/alt/rep : 47/62/47 causal constraints in 25 ms.
[2020-06-03 23:03:14] [INFO ] Added : 34 causal constraints over 7 iterations in 113 ms. Result :sat
[2020-06-03 23:03:14] [INFO ] [Real]Absence check using 32 positive place invariants in 97 ms returned unsat
[2020-06-03 23:03:14] [INFO ] [Real]Absence check using 32 positive place invariants in 8 ms returned sat
[2020-06-03 23:03:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 23:03:14] [INFO ] [Real]Absence check using state equation in 33 ms returned sat
[2020-06-03 23:03:14] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 23:03:14] [INFO ] [Nat]Absence check using 32 positive place invariants in 19 ms returned sat
[2020-06-03 23:03:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 23:03:14] [INFO ] [Nat]Absence check using state equation in 42 ms returned sat
[2020-06-03 23:03:14] [INFO ] Computed and/alt/rep : 47/62/47 causal constraints in 10 ms.
[2020-06-03 23:03:14] [INFO ] Added : 31 causal constraints over 7 iterations in 61 ms. Result :sat
[2020-06-03 23:03:14] [INFO ] [Real]Absence check using 32 positive place invariants in 16 ms returned sat
[2020-06-03 23:03:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 23:03:14] [INFO ] [Real]Absence check using state equation in 87 ms returned sat
[2020-06-03 23:03:14] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 23:03:14] [INFO ] [Nat]Absence check using 32 positive place invariants in 15 ms returned sat
[2020-06-03 23:03:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 23:03:14] [INFO ] [Nat]Absence check using state equation in 70 ms returned sat
[2020-06-03 23:03:14] [INFO ] Computed and/alt/rep : 47/62/47 causal constraints in 8 ms.
[2020-06-03 23:03:14] [INFO ] Added : 36 causal constraints over 8 iterations in 73 ms. Result :sat
[2020-06-03 23:03:14] [INFO ] [Real]Absence check using 32 positive place invariants in 6 ms returned sat
[2020-06-03 23:03:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 23:03:15] [INFO ] [Real]Absence check using state equation in 37 ms returned sat
[2020-06-03 23:03:15] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 23:03:15] [INFO ] [Nat]Absence check using 32 positive place invariants in 12 ms returned sat
[2020-06-03 23:03:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 23:03:15] [INFO ] [Nat]Absence check using state equation in 92 ms returned sat
[2020-06-03 23:03:15] [INFO ] Computed and/alt/rep : 47/62/47 causal constraints in 6 ms.
[2020-06-03 23:03:15] [INFO ] Added : 34 causal constraints over 7 iterations in 78 ms. Result :sat
[2020-06-03 23:03:15] [INFO ] [Real]Absence check using 32 positive place invariants in 15 ms returned sat
[2020-06-03 23:03:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 23:03:15] [INFO ] [Real]Absence check using state equation in 67 ms returned sat
[2020-06-03 23:03:15] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 23:03:15] [INFO ] [Nat]Absence check using 32 positive place invariants in 8 ms returned sat
[2020-06-03 23:03:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 23:03:15] [INFO ] [Nat]Absence check using state equation in 45 ms returned sat
[2020-06-03 23:03:15] [INFO ] Computed and/alt/rep : 47/62/47 causal constraints in 6 ms.
[2020-06-03 23:03:15] [INFO ] Added : 30 causal constraints over 6 iterations in 30 ms. Result :sat
[2020-06-03 23:03:15] [INFO ] [Real]Absence check using 32 positive place invariants in 5 ms returned sat
[2020-06-03 23:03:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 23:03:15] [INFO ] [Real]Absence check using state equation in 25 ms returned sat
[2020-06-03 23:03:15] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 23:03:15] [INFO ] [Nat]Absence check using 32 positive place invariants in 7 ms returned sat
[2020-06-03 23:03:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 23:03:15] [INFO ] [Nat]Absence check using state equation in 24 ms returned sat
[2020-06-03 23:03:15] [INFO ] Computed and/alt/rep : 47/62/47 causal constraints in 3 ms.
[2020-06-03 23:03:15] [INFO ] Added : 33 causal constraints over 7 iterations in 39 ms. Result :sat
Successfully simplified 1 atomic propositions for a total of 1 simplifications.
[2020-06-03 23:03:18] [INFO ] Flatten gal took : 57 ms
[2020-06-03 23:03:18] [INFO ] Flatten gal took : 31 ms
[2020-06-03 23:03:18] [INFO ] Export to MCC properties in file /home/mcc/execution/CTLCardinality.sr.xml took 8 ms.
[2020-06-03 23:03:18] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 0 ms.
info: Time: 3600 - MCC
vrfy: Checking CTLCardinality @ RefineWMG-PT-015016 @ 3570 seconds

FORMULA n0-CTLCardinality-03 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA n0-CTLCardinality-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA n0-CTLCardinality-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA n0-CTLCardinality-02 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA n0-CTLCardinality-06 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA n0-CTLCardinality-07 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA n0-CTLCardinality-01 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA n0-CTLCardinality-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA n0-CTLCardinality-05 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA n0-CTLCardinality-00 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA n0-CTLCardinality-04 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA n0-CTLCardinality-12 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA n0-CTLCardinality-09 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA n0-CTLCardinality-13 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA n0-CTLCardinality-11 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA n0-CTLCardinality-08 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 1335
rslt: Output for CTLCardinality @ RefineWMG-PT-015016

{
"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=CTLCardinality.xml",
"--mcc",
"--donotcomputecapacities",
"--encoder=simplecompressed",
"--check=modelchecking",
"--stubborn=tarjan",
"--stateequation=par",
"--quickchecks",
"--timelimit=3570",
"--localtimelimit=0",
"--preference=force_ctl",
"--json=CTLCardinality.json",
"--jsoninclude=formula,formulastat,net"
],
"starttime": "Wed Jun 3 23:03:55 2020
",
"timelimit": 3570
},
"child":
[

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 222
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"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 ((p77 <= p10)))",
"processed_size": 20,
"rewrites": 21
},
"result":
{
"edges": 16,
"markings": 17,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 0,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"type": "reachability",
"workflow": "stateequation||search"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 254
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 0,
"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": "AX(((1 <= p36) OR (1 <= p21)))",
"processed_size": 31,
"rewrites": 21
},
"net":
{
"conflict_clusters": 48,
"singleton_clusters": 0
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "CTL model checker",
"value": true
},
"task":
{
"compoundnumber": 2,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 274
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"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": "AX((p24 + 1 <= p67))",
"processed_size": 20,
"rewrites": 21
},
"net":
{
"conflict_clusters": 48,
"singleton_clusters": 0
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "CTL model checker",
"value": true
},
"task":
{
"compoundnumber": 3,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": true
},
"task":
{
"compoundnumber": 0,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 237
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 1,
"aneg": 1,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "((p40 + 1 <= p49) AND (p17 + 1 <= p18))",
"processed_size": 39,
"rewrites": 23
},
"result":
{
"edges": 16,
"markings": 17,
"produced_by": "state space /EXEF",
"value": false
},
"task":
{
"compoundnumber": 2,
"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"
}
},

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

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

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

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 369
},
"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 (((2 <= p62) AND (2 <= p31))))",
"processed_size": 35,
"rewrites": 22
},
"result":
{
"edges": 15,
"markings": 16,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 7,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 2,
"problems": 2
},
"type": "invariance",
"workflow": "stateequation||search"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 474
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 2,
"adisj": 1,
"aneg": 0,
"comp": 5,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 8,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 8,
"visible_transitions": 0
},
"processed": "E (F (((1 <= p5) AND ((p43 <= p13) OR (p0 <= p71) OR ((2 <= p15) AND (p41 <= p39))))))",
"processed_size": 88,
"rewrites": 21
},
"result":
{
"edges": 16,
"markings": 17,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 9,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 7,
"problems": 3
},
"type": "reachability",
"workflow": "stateequation||search"
}
},

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

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 884
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"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 ((p66 <= p58)))",
"processed_size": 20,
"rewrites": 21
},
"result":
{
"edges": 16,
"markings": 17,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 13,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"type": "reachability",
"workflow": "stateequation||search"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": true
},
"task":
{
"compoundnumber": 12,
"type": "boolean"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 884
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"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": "A (G (((2 <= p30) OR (1 <= p36))))",
"processed_size": 35,
"rewrites": 22
},
"result":
{
"edges": 227,
"markings": 228,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 13,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 2,
"problems": 2
},
"type": "invariance",
"workflow": "stateequation||search"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 13,
"type": "boolean"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1327
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 0,
"U": 1,
"X": 0,
"aconj": 0,
"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 (((1 <= p26) U (1 <= p18)))",
"processed_size": 29,
"rewrites": 25
},
"result":
{
"edges": 7,
"markings": 7,
"produced_by": "state space /ER",
"value": false
},
"task":
{
"compoundnumber": 14,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl",
"visible": 3
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "universal_until",
"workflow": "stateequation"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 2654
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"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": "(p11 <= p59)",
"processed_size": 12,
"rewrites": 20
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 15,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": null
},
"task":
{
"compoundnumber": 14,
"type": "boolean"
}
},

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

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

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 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": "(p58 <= 0)",
"processed_size": 10,
"rewrites": 23
},
"result":
{
"edges": 7,
"markings": 7,
"produced_by": "state space / EG",
"value": false
},
"task":
{
"compoundnumber": 18,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 3
},
"threads": 1,
"type": "dfs"
},
"type": "eventual_occurrence",
"workflow": "stateequation"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": null
},
"task":
{
"compoundnumber": 15,
"type": "boolean"
}
},

{
"child":
[

{
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 0,
"G": 0,
"U": 0,
"X": 1,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "EX(((2 <= p65) AND (p30 <= p56)))",
"processed_size": 33,
"rewrites": 21
},
"net":
{
"conflict_clusters": 48,
"singleton_clusters": 0
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "CTL model checker",
"value": false
},
"task":
{
"compoundnumber": 17,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
},

{
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"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": "(p57 <= p30)",
"processed_size": 12,
"rewrites": 20
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 18,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

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

{
"child":
[

{
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 0,
"U": 1,
"X": 0,
"aconj": 0,
"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 (((1 <= p26) U (1 <= p18)))",
"processed_size": 29,
"rewrites": 25
},
"result":
{
"edges": 7,
"markings": 7,
"produced_by": "state space /ER",
"value": false
},
"task":
{
"compoundnumber": 19,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl",
"visible": 3
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "universal_until",
"workflow": "stateequation"
}
},

{
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"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": "(p11 <= p59)",
"processed_size": 12,
"rewrites": 20
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 20,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
}
],
"result":
{
"produced_by": "boolean",
"value": null
},
"task":
{
"compoundnumber": 19,
"type": "boolean"
}
},

{
"child":
[

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

{
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"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 ((p28 + 1 <= p12)))",
"processed_size": 24,
"rewrites": 22
},
"result":
{
"edges": 16,
"markings": 17,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 21,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "invariance",
"workflow": "stateequation||search"
}
},

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

{
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "(p58 <= 0)",
"processed_size": 10,
"rewrites": 23
},
"result":
{
"edges": 7,
"markings": 7,
"produced_by": "state space / EG",
"value": false
},
"task":
{
"compoundnumber": 23,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 3
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "eventual_occurrence",
"workflow": "stateequation"
}
}
],
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 20,
"type": "boolean"
}
}
],
"exit":
{
"error": null,
"memory": 3788,
"runtime": 2235.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "CTLCardinality.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "(** OR E(F(**))) : A(G(**)) : E(F(**)) : (E(F(**)) AND (A(F(**)) AND (A(X(**)) AND A(X(**))))) : (A(G(**)) AND A(G(**))) : E(F(**)) : E(F(**)) : A(G(*)) : (A(G(**)) OR (A(G(**)) OR (A(F(**)) OR **))) : E(F((A(G(**)) AND A(G(**))))) : E(F(**)) : (A((** U **)) OR (** OR E(F(A(G(**)))))) : (A(G(E(F(**)))) OR (E(X(**)) OR (A(F(**)) OR **))) : E((E(F(**)) U A(G(**)))) : A(X(A(G(**)))) : E(F(*))"
},
"net":
{
"arcs": 188,
"conflict_clusters": 48,
"places": 79,
"places_significant": 47,
"singleton_clusters": 0,
"transitions": 63
},
"result":
{
"preliminary_value": "yes no yes yes no yes yes no no unknown yes unknown unknown unknown no yes ",
"value": "yes no yes yes no yes yes no no unknown yes unknown unknown unknown 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: 142/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 2528
lola: finding significant places
lola: 79 places, 63 transitions, 47 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 CTLCardinality.xml
lola: ((2 <= p4) OR E (F ((p66 <= p58)))) : A (G (A (G (((2 <= p62) AND (2 <= p31)))))) : E (F (E (((2 <= p25) U (3 <= p64))))) : (((E (F ((p77 <= p10))) AND A (F (((1 <= p36) OR (p59 <= p44))))) AND A (X ((p24 + 1 <= p67)))) AND A (X (((1 <= p36) OR (1 <= p21))))) : (A (G (((2 <= p30) OR (1 <= p36)))) AND A (G (((1 <= p37) OR (2 <= p29) OR (1 <= p11))))) : E (F (((1 <= p5) AND ((p43 <= p13) OR (p0 <= p71) OR ((2 <= p15) AND (p41 <= p39)))))) : A ((A (X ((p31 <= p55))) U E (F ((2 <= p30))))) : NOT(E (F ((p11 <= p58)))) : (((A (G ((p3 <= 1))) OR A (G ((p28 + 1 <= p12)))) OR A (F ((1 <= p58)))) OR ((3 <= p8) AND (p5 <= p45))) : E (F ((A (G ((3 <= p78))) AND A (G ((3 <= p30)))))) : A ((((p76 + 1 <= p63) OR (p3 <= p35)) U E (F ((3 <= p75))))) : ((A (((1 <= p26) U (1 <= p18))) OR (p11 <= p59)) OR E (F (A (G ((3 <= p29)))))) : (((A (G (E (F ((p12 <= p42))))) OR E (X (((2 <= p65) AND (p30 <= p56))))) OR A (F ((1 <= p74)))) OR (p57 <= p30)) : E ((E (F ((p7 <= p12))) U A (G ((3 <= p59))))) : A (X (A (G (((p49 <= p40) OR (p18 <= p17)))))) : NOT(A (G (((p53 <= p57) OR (3 <= p43) OR (p32 <= 2)))))
lola: rewrite Frontend/Parser/formula_rewrite.k:389
lola: rewrite Frontend/Parser/formula_rewrite.k:446
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:452
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:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:452
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:323
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 222 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E (F ((p77 <= p10))) AND (A (F (((1 <= p36) OR (p59 <= p44)))) AND (A (X ((p24 + 1 <= p67))) AND A (X (((1 <= p36) OR (1 <= p21)))))))
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: E (F ((p77 <= p10)))
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 ((p77 <= p10)))
lola: processed formula length: 20
lola: 21 rewrites
lola: closed formula file CTLCardinality.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: (p77 <= p10)
lola: state equation task get result unparse finished id 0
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 17 markings, 16 edges
lola: ========================================
lola: subprocess 1 will run for 237 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (((1 <= p36) OR (p59 <= p44))))
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: ((p36 <= 0) AND (p44 + 1 <= p59))
lola: processed formula length: 33
lola: 23 rewrites
lola: closed formula file CTLCardinality.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 <= p36) OR (p59 <= p44))
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 / EG
lola: The predicate eventually occurs.
lola: 1 markings, 0 edges
lola: subprocess 2 will run for 254 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (((1 <= p36) OR (1 <= p21))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:812
lola: processed formula: AX(((1 <= p36) OR (1 <= p21)))
lola: processed formula length: 31
lola: 21 rewrites
lola: state equation: write sara problem file to CTLCardinality-0.sara
lola: closed formula file CTLCardinality.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: state equation: calling and running sara
lola: CTL formula contains 0 significant temporal operators and needs 0 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: 0 markings, 0 edges
lola: ========================================
lola: ========================================
lola: subprocess 3 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X ((p24 + 1 <= p67)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:812
lola: processed formula: AX((p24 + 1 <= p67))
lola: processed formula length: 20
lola: 21 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 0 significant temporal operators and needs 0 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 0 markings, 0 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 1 will run for 237 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (G (E (F ((p12 <= p42))))) OR (E (X (((2 <= p65) AND (p30 <= p56)))) OR (A (F ((1 <= p74))) OR (p57 <= p30))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 1 will run for 237 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (E (F ((p12 <= p42)))))
lola: ========================================
lola: SUBTASK
lola: checking liveness
lola: rewrite Frontend/Parser/formula_rewrite.k:603
lola: rewrite Frontend/Parser/formula_rewrite.k:613
lola: rewrite Frontend/Parser/formula_rewrite.k:703
lola: processed formula: (p12 <= p42)
lola: processed formula length: 12
lola: 23 rewrites
lola: closed formula file CTLCardinality.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:787
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (p42 + 1 <= p12)
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to CTLCardinality-0.sara
lola: state equation: calling and running sara
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 unparse finished++ id 1
lola: formula 1: (p12 <= p42)
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 CTLCardinality-1.sara
lola: state equation: calling and running sara
sara: try reading problem file CTLCardinality-0.sara.
sara: try reading problem file CTLCardinality-1.sara.
sara: try reading problem file CTLCardinality-0.sara.
sara: place or transition ordering is non-deterministic
sara: place or transition ordering is non-deterministic
sara: place or transition ordering is non-deterministic



lola: state equation 0: solution produced
lola: state equation 1: solution produced
lola: sara is running 0 secs || sara is running 0 secs || 4531777 markings, 6939254 edges, 906355 markings/sec, 0 secs
lola: sara is running 5 secs || sara is running 5 secs || 8985576 markings, 13759138 edges, 890760 markings/sec, 5 secs
lola: sara is running 10 secs || sara is running 10 secs || 13276532 markings, 20329659 edges, 858191 markings/sec, 10 secs
lola: sara is running 15 secs || sara is running 15 secs || 17810995 markings, 27273053 edges, 906893 markings/sec, 15 secs
lola: sara is running 20 secs || sara is running 20 secs || 22391661 markings, 34287209 edges, 916133 markings/sec, 20 secs
lola: sara is running 25 secs || sara is running 25 secs || 26764525 markings, 40983147 edges, 874573 markings/sec, 25 secs
lola: sara is running 30 secs || sara is running 30 secs || 30996765 markings, 47463757 edges, 846448 markings/sec, 30 secs
lola: sara is running 35 secs || sara is running 35 secs || 35157628 markings, 53835088 edges, 832173 markings/sec, 35 secs
lola: sara is running 40 secs || sara is running 40 secs || 39407282 markings, 60342373 edges, 849931 markings/sec, 40 secs
lola: sara is running 45 secs || sara is running 45 secs || 43808585 markings, 67081862 edges, 880261 markings/sec, 45 secs
lola: sara is running 50 secs || sara is running 50 secs || 48072867 markings, 73611559 edges, 852856 markings/sec, 50 secs
lola: sara is running 55 secs || sara is running 55 secs || 52425198 markings, 80276055 edges, 870466 markings/sec, 55 secs
lola: sara is running 60 secs || sara is running 60 secs || 56739628 markings, 86882522 edges, 862886 markings/sec, 60 secs
lola: sara is running 65 secs || sara is running 65 secs || 60826109 markings, 93139947 edges, 817296 markings/sec, 65 secs
lola: sara is running 70 secs || sara is running 70 secs || 64913786 markings, 99399204 edges, 817535 markings/sec, 70 secs
lola: sara is running 75 secs || sara is running 75 secs || 69026913 markings, 105697430 edges, 822625 markings/sec, 75 secs
lola: sara is running 80 secs || sara is running 80 secs || 73270568 markings, 112195523 edges, 848731 markings/sec, 80 secs
lola: sara is running 85 secs || sara is running 85 secs || 77628707 markings, 118868922 edges, 871628 markings/sec, 85 secs
lola: sara is running 90 secs || sara is running 90 secs || 82023730 markings, 125598806 edges, 879005 markings/sec, 90 secs
lola: sara is running 95 secs || sara is running 95 secs || 86189541 markings, 131977703 edges, 833162 markings/sec, 95 secs
lola: sara is running 100 secs || sara is running 100 secs || 90370919 markings, 138380455 edges, 836276 markings/sec, 100 secs
lola: sara is running 105 secs || sara is running 105 secs || 94668347 markings, 144960880 edges, 859486 markings/sec, 105 secs
lola: sara is running 110 secs || sara is running 110 secs || 96795213 markings, 148217652 edges, 425373 markings/sec, 110 secs
lola: sara is running 115 secs || sara is running 115 secs || 97446359 markings, 149214707 edges, 130229 markings/sec, 115 secs
lola: sara is running 120 secs || sara is running 120 secs || 98904450 markings, 151447470 edges, 291618 markings/sec, 120 secs
lola: sara is running 125 secs || sara is running 125 secs || 99654473 markings, 152595886 edges, 150005 markings/sec, 125 secs
lola: sara is running 130 secs || sara is running 130 secs || 99654473 markings, 152595886 edges, 0 markings/sec, 130 secs
lola: sara is running 135 secs || sara is running 135 secs || 99654473 markings, 152595886 edges, 0 markings/sec, 135 secs
lola: sara is running 140 secs || sara is running 140 secs || 99654473 markings, 152595886 edges, 0 markings/sec, 140 secs
lola: sara is running 145 secs || sara is running 145 secs || 100049408 markings, 153200635 edges, 78987 markings/sec, 145 secs
lola: sara is running 150 secs || sara is running 150 secs || 101387987 markings, 155250327 edges, 267716 markings/sec, 150 secs
lola: sara is running 155 secs || sara is running 155 secs || 102153828 markings, 156423020 edges, 153168 markings/sec, 155 secs
lola: sara is running 160 secs || sara is running 160 secs || 102187862 markings, 156475136 edges, 6807 markings/sec, 160 secs
lola: sara is running 165 secs || sara is running 165 secs || 103037432 markings, 157776039 edges, 169914 markings/sec, 165 secs
lola: sara is running 170 secs || sara is running 170 secs || 104144845 markings, 159471760 edges, 221483 markings/sec, 170 secs
lola: sara is running 175 secs || sara is running 175 secs || 104144845 markings, 159471760 edges, 0 markings/sec, 175 secs
lola: sara is running 180 secs || sara is running 180 secs || 104144845 markings, 159471760 edges, 0 markings/sec, 180 secs
lola: sara is running 185 secs || sara is running 185 secs || 104145562 markings, 159472861 edges, 143 markings/sec, 185 secs
lola: sara is running 190 secs || sara is running 190 secs || 105219968 markings, 161118051 edges, 214881 markings/sec, 190 secs
lola: sara is running 195 secs || sara is running 195 secs || 105219968 markings, 161118051 edges, 0 markings/sec, 195 secs
lola: sara is running 200 secs || sara is running 200 secs || 105219968 markings, 161118051 edges, 0 markings/sec, 200 secs
lola: sara is running 205 secs || sara is running 205 secs || 105384099 markings, 161369379 edges, 32826 markings/sec, 205 secs
lola: local time limit reached - aborting
lola: local time limit reached - aborting
lola:
preliminary result: unknown unknown unknown yes unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown
lola:
preliminary result: unknown unknown unknown yes unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown
lola: caught signal User defined signal 1 - aborting LoLA
lola:
preliminary result: unknown unknown unknown yes unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown
lola: memory consumption: 15986060 KB
lola: time consumption: 245 seconds
lola: print data as JSON (--json)
lola: memory consumption: 15986320 KB
lola: time consumption: 245 seconds
lola: print data as JSON (--json)
lola: writing JSON to CTLCardinality.json
lola: closed JSON file CTLCardinality.json
lola: caught signal User defined signal 1 - aborting LoLA
lola:
preliminary result: unknown unknown unknown yes unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown
lola: memory consumption: 15929048 KB
lola: time consumption: 245 seconds
lola: print data as JSON (--json)
lola: writing JSON to CTLCardinality.json
lola: closed JSON file CTLCardinality.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: A (X (A (G (((p49 <= p40) OR (p18 <= p17))))))
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 + 1 <= p49) AND (p17 + 1 <= p18))
lola: processed formula length: 39
lola: 23 rewrites
lola: closed formula file CTLCardinality.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: state equation task get result unparse finished++ id 0
lola: formula 0: ((p40 + 1 <= p49) AND (p17 + 1 <= p18))
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 /EXEF
lola: The predicate is not invariant from successors.
lola: 17 markings, 16 edges
lola: ========================================
lola: subprocess 3 will run for 255 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((3 <= p75)))
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 ((3 <= p75)))
lola: processed formula length: 18
lola: 21 rewrites
lola: closed formula file CTLCardinality.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: (3 <= p75)
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to CTLCardinality-3-0.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 6 markings, 5 edges
lola: ========================================
lola: subprocess 4 will run for 277 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((3 <= p64)))
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 ((3 <= p64)))
lola: processed formula length: 18
lola: 21 rewrites
lola: closed formula file CTLCardinality.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: (3 <= p64)
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
lola: The predicate is reachable.
lola: 12 markings, 11 edges
lola: state equation: write sara problem file to CTLCardinality-4-0.sara
lola: state equation: calling and running sara
lola: ========================================
lola: subprocess 5 will run for 302 seconds at most (--localtimelimit=0)
lola: ========================================
sara: try reading problem file CTLCardinality-4-0.sara.
lola: ...considering subproblem: E (F ((2 <= p30)))
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 ((2 <= p30)))
lola: processed formula length: 18
lola: 21 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
sara: place or transition ordering is non-deterministic
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: (2 <= p30)
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to CTLCardinality-5-0.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 22 markings, 21 edges
lola: ========================================

lola: subprocess 6 will run for 332 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((p58 + 1 <= p11)))
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 ((p58 + 1 <= p11)))
lola: processed formula length: 24
lola: 22 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:788
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (p11 <= p58)
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: 17 markings, 16 edges
lola: state equation: write sara problem file to CTLCardinality-6-0.sara
lola: ========================================
lola: state equation: calling and running sara
lola: subprocess 7 will run for 369 seconds at most (--localtimelimit=0)
lola: ========================================
sara: try reading problem file CTLCardinality-6-0.sara.
sara: place or transition ordering is non-deterministic
lola: ...considering subproblem: A (G (((2 <= p62) AND (2 <= p31))))
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 (((2 <= p62) AND (2 <= p31))))
lola: processed formula length: 35
lola: 22 rewrites
lola: closed formula file CTLCardinality.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: ((p62 <= 1) OR (p31 <= 1))
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: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 16 markings, 15 edges
lola: state equation: write sara problem file to CTLCardinality-7-0.sara
lola: state equation: calling and running sara
lola: ========================================
lola: subprocess 8 will run for 415 seconds at most (--localtimelimit=0)
lola: ========================================
sara: try reading problem file CTLCardinality-7-0.sara.
lola: ...considering subproblem: E (F (((p57 + 1 <= p53) AND (p43 <= 2) AND (3 <= p32))))
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 (((p57 + 1 <= p53) AND (p43 <= 2) AND (3 <= p32))))
lola: processed formula length: 56
lola: 21 rewrites
lola: closed formula file CTLCardinality.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: ((p57 + 1 <= p53) AND (p43 <= 2) AND (3 <= p32))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 3 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 18 markings, 17 edges
lola: state equation: write sara problem file to CTLCardinality-8-0.sara
sara: place or transition ordering is non-deterministic

lola: state equation: calling and running sara
sara: try reading problem file CTLCardinality-8-0.sara.
sara: place or transition ordering is non-deterministic

lola: ========================================
lola: subprocess 9 will run for 474 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((1 <= p5) AND ((p43 <= p13) OR (p0 <= p71) OR ((2 <= p15) AND (p41 <= p39))))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: processed formula: E (F (((1 <= p5) AND ((p43 <= p13) OR (p0 <= p71) OR ((2 <= p15) AND (p41 <= p39))))))
lola: processed formula length: 88
lola: 21 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((1 <= p5) AND ((p43 <= p13) OR (p0 <= p71) OR ((2 <= p15) AND (p41 <= p39))))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 7 literals and 3 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 17 markings, 16 edges
lola: state equation: write sara problem file to CTLCardinality-9-0.sara
lola: state equation: calling and running sara
sara: try reading problem file CTLCardinality-9-0.sara.
sara: place or transition ordering is non-deterministic

lola: ========================================
lola: subprocess 10 will run for 554 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((A (G ((3 <= p78))) AND A (G ((3 <= p30))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:813
lola: rewrite Frontend/Parser/formula_rewrite.k:813
lola: rewrite Frontend/Parser/formula_rewrite.k:806
lola: processed formula: EF((AG((3 <= p78)) AND AG((3 <= p30))))
lola: processed formula length: 39
lola: 23 rewrites
lola: closed formula file CTLCardinality.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: 2120306 markings, 7986170 edges, 424061 markings/sec, 0 secs
lola: 4179013 markings, 15740409 edges, 411741 markings/sec, 5 secs
lola: 6239593 markings, 23501651 edges, 412116 markings/sec, 10 secs
lola: 8270407 markings, 31150808 edges, 406163 markings/sec, 15 secs
lola: 10290608 markings, 38760001 edges, 404040 markings/sec, 20 secs
lola: 12276909 markings, 46241440 edges, 397260 markings/sec, 25 secs
lola: 14249472 markings, 53671242 edges, 394513 markings/sec, 30 secs
lola: 16276172 markings, 61304887 edges, 405340 markings/sec, 35 secs
lola: 18340482 markings, 69080169 edges, 412862 markings/sec, 40 secs
lola: 20456710 markings, 77051092 edges, 423246 markings/sec, 45 secs
lola: 22506944 markings, 84773332 edges, 410047 markings/sec, 50 secs
lola: 24561265 markings, 92511048 edges, 410864 markings/sec, 55 secs
lola: 25646183 markings, 96597412 edges, 216984 markings/sec, 60 secs
lola: 26871286 markings, 101211798 edges, 245021 markings/sec, 65 secs
lola: 28819608 markings, 108550289 edges, 389664 markings/sec, 70 secs
lola: 30762063 markings, 115866622 edges, 388491 markings/sec, 75 secs
lola: 32731916 markings, 123286145 edges, 393971 markings/sec, 80 secs
lola: 34632832 markings, 130446005 edges, 380183 markings/sec, 85 secs
lola: 36496704 markings, 137466382 edges, 372774 markings/sec, 90 secs
lola: 38411133 markings, 144677192 edges, 382886 markings/sec, 95 secs
lola: 40321432 markings, 151872386 edges, 382060 markings/sec, 100 secs
lola: 42231466 markings, 159066636 edges, 382007 markings/sec, 105 secs
lola: 44218290 markings, 166550075 edges, 397365 markings/sec, 110 secs
lola: 46176693 markings, 173926519 edges, 391681 markings/sec, 115 secs
lola: 48191362 markings, 181514870 edges, 402934 markings/sec, 120 secs
lola: 50159401 markings, 188927560 edges, 393608 markings/sec, 125 secs
lola: 52092539 markings, 196209820 edges, 386628 markings/sec, 130 secs
lola: 54026639 markings, 203493666 edges, 386820 markings/sec, 135 secs
lola: 55928094 markings, 210655541 edges, 380291 markings/sec, 140 secs
lola: 57814071 markings, 217759162 edges, 377195 markings/sec, 145 secs
lola: 59750462 markings, 225052714 edges, 387278 markings/sec, 150 secs
lola: 61646440 markings, 232193996 edges, 379196 markings/sec, 155 secs
lola: 63577671 markings, 239468049 edges, 386246 markings/sec, 160 secs
lola: 65593704 markings, 247061536 edges, 403207 markings/sec, 165 secs
lola: 67550744 markings, 254432810 edges, 391408 markings/sec, 170 secs
lola: 69529423 markings, 261885613 edges, 395736 markings/sec, 175 secs
lola: 71568231 markings, 269564862 edges, 407762 markings/sec, 180 secs
lola: 73603661 markings, 277231393 edges, 407086 markings/sec, 185 secs
lola: 75615250 markings, 284808125 edges, 402318 markings/sec, 190 secs
lola: 77538549 markings, 292052322 edges, 384660 markings/sec, 195 secs
lola: 79534247 markings, 299569209 edges, 399140 markings/sec, 200 secs
lola: 79929959 markings, 301065985 edges, 79142 markings/sec, 205 secs
lola: 81293801 markings, 306196854 edges, 272768 markings/sec, 210 secs
lola: 81391633 markings, 306565134 edges, 19566 markings/sec, 215 secs
lola: 81391633 markings, 306565134 edges, 0 markings/sec, 220 secs
lola: 81391633 markings, 306565134 edges, 0 markings/sec, 225 secs
lola: 81391633 markings, 306565134 edges, 0 markings/sec, 230 secs
lola: 81391633 markings, 306565134 edges, 0 markings/sec, 235 secs
lola: 81716890 markings, 307790230 edges, 65051 markings/sec, 240 secs
lola: 82706093 markings, 311516123 edges, 197841 markings/sec, 245 secs
lola: 82706093 markings, 311516123 edges, 0 markings/sec, 250 secs
lola: 82706093 markings, 311516123 edges, 0 markings/sec, 255 secs
lola: 82706093 markings, 311516123 edges, 0 markings/sec, 260 secs
lola: 84141940 markings, 316924237 edges, 287169 markings/sec, 265 secs
lola: 84561929 markings, 318506199 edges, 83998 markings/sec, 270 secs
lola: 84561929 markings, 318506199 edges, 0 markings/sec, 275 secs
lola: 84582111 markings, 318582221 edges, 4036 markings/sec, 280 secs
lola: 85469729 markings, 321925459 edges, 177524 markings/sec, 285 secs
lola: 85674803 markings, 322697895 edges, 41015 markings/sec, 290 secs
lola: 86175793 markings, 324584897 edges, 100198 markings/sec, 295 secs
lola: 86851165 markings, 327128718 edges, 135074 markings/sec, 300 secs
lola: 87335966 markings, 328954681 edges, 96960 markings/sec, 305 secs
lola: 88219669 markings, 332283250 edges, 176741 markings/sec, 310 secs
lola: 88273525 markings, 332486089 edges, 10771 markings/sec, 315 secs
lola: 88604570 markings, 333732940 edges, 66209 markings/sec, 320 secs
lola: 89699134 markings, 337855691 edges, 218913 markings/sec, 325 secs
lola: 90401578 markings, 340501483 edges, 140489 markings/sec, 330 secs
lola: 91395995 markings, 344247008 edges, 198883 markings/sec, 335 secs
lola: 92660587 markings, 349010132 edges, 252918 markings/sec, 340 secs
lola: 93385025 markings, 351738771 edges, 144888 markings/sec, 345 secs
lola: 94499713 markings, 355937288 edges, 222938 markings/sec, 350 secs
lola: 96241041 markings, 362496077 edges, 348266 markings/sec, 355 secs
lola: 98067524 markings, 369375606 edges, 365297 markings/sec, 360 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 11 will run for 589 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E ((E (F ((p7 <= p12))) U A (G ((3 <= p59)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:806
lola: rewrite Frontend/Parser/formula_rewrite.k:813
lola: rewrite Frontend/Parser/formula_rewrite.k:809
lola: processed formula: E(EF((p7 <= p12)) U AG((3 <= p59)))
lola: processed formula length: 35
lola: 23 rewrites
lola: closed formula file CTLCardinality.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: 2538708 markings, 8964794 edges, 507742 markings/sec, 0 secs
lola: 4942058 markings, 17451613 edges, 480670 markings/sec, 5 secs
lola: 7356825 markings, 25978768 edges, 482953 markings/sec, 10 secs
lola: 9659051 markings, 34108500 edges, 460445 markings/sec, 15 secs
lola: 12028796 markings, 42476669 edges, 473949 markings/sec, 20 secs
lola: 14369862 markings, 50743552 edges, 468213 markings/sec, 25 secs
lola: 16741431 markings, 59118154 edges, 474314 markings/sec, 30 secs
lola: 19149842 markings, 67622847 edges, 481682 markings/sec, 35 secs
lola: 21551308 markings, 76103032 edges, 480293 markings/sec, 40 secs
lola: 24014168 markings, 84800007 edges, 492572 markings/sec, 45 secs
lola: 26362557 markings, 93092752 edges, 469678 markings/sec, 50 secs
lola: 28705605 markings, 101366634 edges, 468610 markings/sec, 55 secs
lola: 31015335 markings, 109522868 edges, 461946 markings/sec, 60 secs
lola: 33294261 markings, 117570327 edges, 455785 markings/sec, 65 secs
lola: 35543093 markings, 125511518 edges, 449766 markings/sec, 70 secs
lola: 37818990 markings, 133548278 edges, 455179 markings/sec, 75 secs
lola: 40091215 markings, 141572086 edges, 454445 markings/sec, 80 secs
lola: 42366602 markings, 149607028 edges, 455077 markings/sec, 85 secs
lola: 44677537 markings, 157767525 edges, 462187 markings/sec, 90 secs
lola: 47045996 markings, 166131141 edges, 473692 markings/sec, 95 secs
lola: 49392469 markings, 174417129 edges, 469295 markings/sec, 100 secs
lola: 51737423 markings, 182697752 edges, 468991 markings/sec, 105 secs
lola: 54009480 markings, 190720957 edges, 454411 markings/sec, 110 secs
lola: 56254077 markings, 198647185 edges, 448919 markings/sec, 115 secs
lola: 58451248 markings, 206405936 edges, 439434 markings/sec, 120 secs
lola: 60654816 markings, 214187297 edges, 440714 markings/sec, 125 secs
lola: 62815863 markings, 221818493 edges, 432209 markings/sec, 130 secs
lola: 65058432 markings, 229737558 edges, 448514 markings/sec, 135 secs
lola: 67314322 markings, 237703670 edges, 451178 markings/sec, 140 secs
lola: 69576721 markings, 245692764 edges, 452480 markings/sec, 145 secs
lola: 71897045 markings, 253886408 edges, 464065 markings/sec, 150 secs
lola: 74262222 markings, 262238438 edges, 473035 markings/sec, 155 secs
lola: 76580354 markings, 270424341 edges, 463626 markings/sec, 160 secs
lola: 78877745 markings, 278536999 edges, 459478 markings/sec, 165 secs
lola: 80544813 markings, 284423962 edges, 333414 markings/sec, 170 secs
lola: 81178753 markings, 286662435 edges, 126788 markings/sec, 175 secs
lola: 83156907 markings, 293666415 edges, 395631 markings/sec, 180 secs
lola: 85019620 markings, 300225510 edges, 372543 markings/sec, 185 secs
lola: 85367699 markings, 301454671 edges, 69616 markings/sec, 190 secs
lola: 85487223 markings, 301876736 edges, 23905 markings/sec, 195 secs
lola: 87293068 markings, 308253622 edges, 361169 markings/sec, 200 secs
lola: 88185376 markings, 311404585 edges, 178462 markings/sec, 205 secs
lola: 89760025 markings, 316965060 edges, 314930 markings/sec, 210 secs
lola: 91525387 markings, 323198996 edges, 353072 markings/sec, 215 secs
lola: 93098580 markings, 328754330 edges, 314639 markings/sec, 220 secs
lola: 93098580 markings, 328754330 edges, 0 markings/sec, 225 secs
lola: 93098580 markings, 328754330 edges, 0 markings/sec, 230 secs
lola: 93558639 markings, 330378921 edges, 92012 markings/sec, 235 secs
lola: 94654264 markings, 334247847 edges, 219125 markings/sec, 240 secs
lola: 96431244 markings, 340522817 edges, 355396 markings/sec, 245 secs
lola: 96550277 markings, 340943160 edges, 23807 markings/sec, 250 secs
lola: 96550277 markings, 340943160 edges, 0 markings/sec, 255 secs
lola: 97328104 markings, 343689838 edges, 155565 markings/sec, 260 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 12 will run for 663 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((2 <= p4) OR E (F ((p66 <= p58))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 12 will run for 663 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (2 <= p4)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (2 <= p4)
lola: processed formula length: 9
lola: 20 rewrites
lola: closed formula file CTLCardinality.xml
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: subprocess 13 will run for 884 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((p66 <= p58)))
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 ((p66 <= p58)))
lola: processed formula length: 20
lola: 21 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 17 markings, 16 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: ========================================
lola: subprocess 13 will run for 884 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (G (((2 <= p30) OR (1 <= p36)))) AND A (G (((1 <= p37) OR (2 <= p29) OR (1 <= p11)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 13 will run for 884 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((2 <= p30) OR (1 <= p36))))
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 (((2 <= p30) OR (1 <= p36))))
lola: processed formula length: 35
lola: 22 rewrites
lola: closed formula file CTLCardinality.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: ((p30 <= 1) AND (p36 <= 0))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 228 markings, 227 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 14 will run for 1327 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (((1 <= p26) U (1 <= p18))) OR ((p11 <= p59) OR E (F (A (G ((3 <= p29)))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 14 will run for 1327 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (((1 <= p26) U (1 <= p18)))
lola: ========================================
lola: SUBTASK
lola: checking universal until
lola: rewrite Frontend/Parser/formula_rewrite.k:577
lola: rewrite Frontend/Parser/formula_rewrite.k:735
lola: rewrite Frontend/Parser/formula_rewrite.k:695
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: A (((1 <= p26) U (1 <= p18)))
lola: processed formula length: 29
lola: 25 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /ER)
lola: state space: using reachability graph (ER version) (--search=depth)
lola: state space: using ltl preserving stubborn set method (--stubborn=tarjan)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: 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 <= p26)
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: 1
lola: SUBRESULT
lola: result: no
lola: produced by: state space /ER
lola: Predicate Phi does not hild until Predicate Psi on all paths.
lola: 7 markings, 7 edges
lola: ========================================
lola: subprocess 15 will run for 2654 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (p11 <= p59)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p11 <= p59)
lola: processed formula length: 12
lola: 20 rewrites
lola: closed formula file CTLCardinality.xml
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: 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 2654 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (G ((p3 <= 1))) OR (A (G ((p28 + 1 <= p12))) OR (A (F ((1 <= p58))) OR ((3 <= p8) AND (p5 <= p45)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 15 will run for 2654 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((p3 <= 1)))
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 ((p3 <= 1)))
lola: processed formula length: 17
lola: 22 rewrites
lola: closed formula file CTLCardinality.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: (2 <= p3)
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to CTLCardinality-15-0.sara
lola: state equation: calling and running sara
sara: try reading problem file CTLCardinality-15-0.sara.
sara: place or transition ordering is non-deterministic
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 2 markings, 1 edges
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 17 will run for 1 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((3 <= p8) AND (p5 <= p45))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((3 <= p8) AND (p5 <= p45))
lola: processed formula length: 27
lola: 20 rewrites
lola: closed formula file CTLCardinality.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 18 will run for 1 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F ((1 <= p58)))
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: (p58 <= 0)
lola: processed formula length: 10
lola: 23 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: state space / EG
lola: The predicate does not eventually occur.
lola: 7 markings, 7 edges
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:700
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (1 <= p58)
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to CTLCardinality-18-0.sara
lola: state equation: calling and running sara
sara: try reading problem file CTLCardinality-18-0.sara.
sara: place or transition ordering is non-deterministic
lola: ========================================
lola: ========================================
lola: SUBRESULT
lola: result: unknown
lola: The Boolean predicate may be true or false.
lola: ========================================
lola: ========================================

lola: ...considering subproblem: (A (G (E (F ((p12 <= p42))))) OR (E (X (((2 <= p65) AND (p30 <= p56)))) OR (A (F ((1 <= p74))) OR (p57 <= p30))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: ...considering subproblem: A (G (E (F ((p12 <= p42)))))
lola: ========================================
lola: SUBTASK
lola: checking liveness
lola: rewrite Frontend/Parser/formula_rewrite.k:603
lola: rewrite Frontend/Parser/formula_rewrite.k:613
lola: rewrite Frontend/Parser/formula_rewrite.k:703
lola: processed formula: (p12 <= p42)
lola: processed formula length: 12
lola: 23 rewrites
lola: closed formula file CTLCardinality.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:787
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (p42 + 1 <= p12)
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: state equation task get result rewrite finished id 1
lola: state equation task get result unparse finished++ id 1
lola: formula 1: (p12 <= p42)
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 CTLCardinality-16-1.sara
lola: state equation: write sara problem file to CTLCardinality-16-0.sara
lola: state equation: calling and running sara
lola: state equation: calling and running sara
sara: try reading problem file CTLCardinality-16-0.sara.
sara: place or transition ordering is non-deterministic

sara: try reading problem file CTLCardinality-16-1.sara.
sara: place or transition ordering is non-deterministic

lola: state equation 0: solution produced
lola: state equation 1: solution produced
lola: sara is running 0 secs || sara is running 0 secs || 4701042 markings, 7198446 edges, 940208 markings/sec, 0 secs
lola: sara is running 5 secs || sara is running 5 secs || 9403305 markings, 14398786 edges, 940453 markings/sec, 5 secs
lola: sara is running 10 secs || sara is running 10 secs || 13921620 markings, 21317452 edges, 903663 markings/sec, 10 secs
lola: sara is running 15 secs || sara is running 15 secs || 18664299 markings, 28579675 edges, 948536 markings/sec, 15 secs
lola: sara is running 20 secs || sara is running 20 secs || 23240496 markings, 35586984 edges, 915239 markings/sec, 20 secs
lola: sara is running 25 secs || sara is running 25 secs || 27666565 markings, 42364393 edges, 885214 markings/sec, 25 secs
lola: sara is running 30 secs || sara is running 30 secs || 32036840 markings, 49056386 edges, 874055 markings/sec, 30 secs
lola: sara is running 35 secs || sara is running 35 secs || 36357172 markings, 55671888 edges, 864066 markings/sec, 35 secs
lola: sara is running 40 secs || sara is running 40 secs || 40666376 markings, 62270362 edges, 861841 markings/sec, 40 secs
lola: sara is running 45 secs || sara is running 45 secs || 45022111 markings, 68940086 edges, 871147 markings/sec, 45 secs
lola: sara is running 50 secs || sara is running 50 secs || 49470148 markings, 75751131 edges, 889607 markings/sec, 50 secs
lola: sara is running 55 secs || sara is running 55 secs || 53803091 markings, 82385964 edges, 866589 markings/sec, 55 secs
lola: sara is running 60 secs || sara is running 60 secs || 58092172 markings, 88953607 edges, 857816 markings/sec, 60 secs
lola: sara is running 65 secs || sara is running 65 secs || 62331754 markings, 95445469 edges, 847916 markings/sec, 65 secs
lola: sara is running 70 secs || sara is running 70 secs || 66607530 markings, 101992753 edges, 855155 markings/sec, 70 secs
lola: sara is running 75 secs || sara is running 75 secs || 70905692 markings, 108574307 edges, 859632 markings/sec, 75 secs
lola: sara is running 80 secs || sara is running 80 secs || 75351628 markings, 115382145 edges, 889187 markings/sec, 80 secs
lola: sara is running 85 secs || sara is running 85 secs || 79711704 markings, 122058518 edges, 872015 markings/sec, 85 secs
lola: sara is running 90 secs || sara is running 90 secs || 83922569 markings, 128506402 edges, 842173 markings/sec, 90 secs
lola: sara is running 95 secs || sara is running 95 secs || 88170353 markings, 135010831 edges, 849557 markings/sec, 95 secs
lola: sara is running 100 secs || sara is running 100 secs || 92400015 markings, 141487487 edges, 845932 markings/sec, 100 secs
lola: sara is running 105 secs || sara is running 105 secs || 96547800 markings, 147838803 edges, 829557 markings/sec, 105 secs
lola: sara is running 110 secs || sara is running 110 secs || 96550277 markings, 147842608 edges, 495 markings/sec, 110 secs
lola: sara is running 115 secs || sara is running 115 secs || 96550277 markings, 147842608 edges, 0 markings/sec, 115 secs
lola: sara is running 120 secs || sara is running 120 secs || 96665557 markings, 148019104 edges, 23056 markings/sec, 120 secs
lola: sara is running 125 secs || sara is running 125 secs || 98569741 markings, 150934957 edges, 380837 markings/sec, 125 secs
lola: sara is running 130 secs || sara is running 130 secs || 98605587 markings, 150989781 edges, 7169 markings/sec, 130 secs
lola: sara is running 135 secs || sara is running 135 secs || 98658016 markings, 151070052 edges, 10486 markings/sec, 135 secs
lola: sara is running 140 secs || sara is running 140 secs || 98762873 markings, 151230628 edges, 20971 markings/sec, 140 secs
lola: sara is running 145 secs || sara is running 145 secs || 100566087 markings, 153991799 edges, 360643 markings/sec, 145 secs
lola: sara is running 150 secs || sara is running 150 secs || 102443558 markings, 156866678 edges, 375494 markings/sec, 150 secs
lola: sara is running 155 secs || sara is running 155 secs || 103672986 markings, 158749230 edges, 245886 markings/sec, 155 secs
lola: sara is running 160 secs || sara is running 160 secs || 103674522 markings, 158751581 edges, 307 markings/sec, 160 secs
lola: sara is running 165 secs || sara is running 165 secs || 104983706 markings, 160756274 edges, 261837 markings/sec, 165 secs
lola: sara is running 170 secs || sara is running 170 secs || 107174834 markings, 164111434 edges, 438226 markings/sec, 170 secs
lola: sara is running 175 secs || sara is running 175 secs || 107180850 markings, 164120654 edges, 1203 markings/sec, 175 secs
lola: sara is running 180 secs || sara is running 180 secs || 107180850 markings, 164120654 edges, 0 markings/sec, 180 secs
lola: sara is running 185 secs || sara is running 185 secs || 107180850 markings, 164120654 edges, 0 markings/sec, 185 secs
lola: sara is running 190 secs || sara is running 190 secs || 107181260 markings, 164121280 edges, 82 markings/sec, 190 secs
lola: sara is running 195 secs || sara is running 195 secs || 107575831 markings, 164725475 edges, 78914 markings/sec, 195 secs
lola: sara is running 200 secs || sara is running 200 secs || 108948632 markings, 166827555 edges, 274560 markings/sec, 200 secs
lola: sara is running 205 secs || sara is running 205 secs || 108948632 markings, 166827555 edges, 0 markings/sec, 205 secs
lola: sara is running 210 secs || sara is running 210 secs || 108948632 markings, 166827555 edges, 0 markings/sec, 210 secs
lola: sara is running 215 secs || sara is running 215 secs || 110854332 markings, 169745661 edges, 381140 markings/sec, 215 secs
lola: sara is running 220 secs || sara is running 220 secs || 111927591 markings, 171389098 edges, 214652 markings/sec, 220 secs
lola: sara is running 225 secs || sara is running 225 secs || 111927591 markings, 171389098 edges, 0 markings/sec, 225 secs
lola: sara is running 230 secs || sara is running 230 secs || 111927591 markings, 171389098 edges, 0 markings/sec, 230 secs
lola: sara is running 235 secs || sara is running 235 secs || 112089478 markings, 171636976 edges, 32377 markings/sec, 235 secs
lola: sara is running 240 secs || sara is running 240 secs || 113348913 markings, 173565484 edges, 251887 markings/sec, 240 secs
lola: sara is running 245 secs || sara is running 245 secs || 113474662 markings, 173758052 edges, 25150 markings/sec, 245 secs
lola: sara is running 250 secs || sara is running 250 secs || 114532138 markings, 175377301 edges, 211495 markings/sec, 250 secs
lola: sara is running 255 secs || sara is running 255 secs || 114667800 markings, 175585033 edges, 27132 markings/sec, 255 secs
lola: sara is running 260 secs || sara is running 260 secs || 115892562 markings, 177460453 edges, 244952 markings/sec, 260 secs
lola: sara is running 265 secs || sara is running 265 secs || 117585737 markings, 180053129 edges, 338635 markings/sec, 265 secs
lola: sara is running 270 secs || sara is running 270 secs || 117749314 markings, 180303598 edges, 32715 markings/sec, 270 secs
lola: sara is running 275 secs || sara is running 275 secs || 117788611 markings, 180363773 edges, 7859 markings/sec, 275 secs
lola: Child process aborted or communication problem between parent and child process
lola: ========================================
lola: ...considering subproblem: E (X (((2 <= p65) AND (p30 <= p56))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:807
lola: processed formula: EX(((2 <= p65) AND (p30 <= p56)))
lola: processed formula length: 33
lola: 21 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 0 significant temporal operators and needs 0 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 0 markings, 0 edges
lola: ========================================
lola: ========================================
lola: ...considering subproblem: (p57 <= p30)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p57 <= p30)
lola: processed formula length: 12
lola: 20 rewrites
lola: closed formula file CTLCardinality.xml
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: ...considering subproblem: A (F ((1 <= p74)))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: ========================================
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: (p74 <= 0)
lola: processed formula length: 10
lola: 23 rewrites
lola: closed formula file CTLCardinality.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 <= p74)
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space / EG
lola: The predicate does not eventually occur.
lola: 7 markings, 7 edges
lola: ========================================
lola: SUBRESULT
lola: result: unknown
lola: The Boolean predicate may be true or false.
lola: ========================================
lola: ========================================
lola: ...considering subproblem: E (F ((A (G ((3 <= p78))) AND A (G ((3 <= p30))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:813
lola: rewrite Frontend/Parser/formula_rewrite.k:813
lola: rewrite Frontend/Parser/formula_rewrite.k:806
lola: processed formula: EF((AG((3 <= p78)) AND AG((3 <= p30))))
lola: processed formula length: 39
lola: 23 rewrites
lola: closed formula file CTLCardinality.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: 2111497 markings, 7952966 edges, 422299 markings/sec, 0 secs
lola: 4163400 markings, 15681590 edges, 410381 markings/sec, 5 secs
lola: 6170898 markings, 23242947 edges, 401500 markings/sec, 10 secs
lola: 8131710 markings, 30628412 edges, 392162 markings/sec, 15 secs
lola: 10137873 markings, 38184688 edges, 401233 markings/sec, 20 secs
lola: 12100363 markings, 45576523 edges, 392498 markings/sec, 25 secs
lola: 14065084 markings, 52976733 edges, 392944 markings/sec, 30 secs
lola: 16086934 markings, 60592117 edges, 404370 markings/sec, 35 secs
lola: 18086061 markings, 68121916 edges, 399825 markings/sec, 40 secs
lola: 20087198 markings, 75659258 edges, 400227 markings/sec, 45 secs
lola: 22162456 markings, 83475805 edges, 415052 markings/sec, 50 secs
lola: 24248220 markings, 91331956 edges, 417153 markings/sec, 55 secs
lola: 26307097 markings, 99086804 edges, 411775 markings/sec, 60 secs
lola: 28289345 markings, 106553023 edges, 396450 markings/sec, 65 secs
lola: 30261547 markings, 113981389 edges, 394440 markings/sec, 70 secs
lola: 32297387 markings, 121649498 edges, 407168 markings/sec, 75 secs
lola: 34270657 markings, 129081903 edges, 394654 markings/sec, 80 secs
lola: 36259165 markings, 136571728 edges, 397702 markings/sec, 85 secs
lola: 38191008 markings, 143848014 edges, 386369 markings/sec, 90 secs
lola: 40144310 markings, 151205291 edges, 390660 markings/sec, 95 secs
lola: 42087364 markings, 158523870 edges, 388611 markings/sec, 100 secs
lola: 44054531 markings, 165933267 edges, 393433 markings/sec, 105 secs
lola: 46077614 markings, 173553301 edges, 404617 markings/sec, 110 secs
lola: 48137558 markings, 181312212 edges, 411989 markings/sec, 115 secs
lola: 50183930 markings, 189019950 edges, 409274 markings/sec, 120 secs
lola: 52060628 markings, 196088558 edges, 375340 markings/sec, 125 secs
lola: 53961126 markings, 203246881 edges, 380100 markings/sec, 130 secs
lola: 55840393 markings, 210325253 edges, 375853 markings/sec, 135 secs
lola: 57704390 markings, 217346073 edges, 372799 markings/sec, 140 secs
lola: 59580918 markings, 224414087 edges, 375306 markings/sec, 145 secs
lola: 61416072 markings, 231326312 edges, 367031 markings/sec, 150 secs
lola: 63252599 markings, 238243656 edges, 367305 markings/sec, 155 secs
lola: 65129171 markings, 245311813 edges, 375314 markings/sec, 160 secs
lola: 67029862 markings, 252470885 edges, 380138 markings/sec, 165 secs
lola: 68907220 markings, 259542018 edges, 375472 markings/sec, 170 secs
lola: 70814525 markings, 266725997 edges, 381461 markings/sec, 175 secs
lola: 72762370 markings, 274062589 edges, 389569 markings/sec, 180 secs
lola: 74731848 markings, 281480755 edges, 393896 markings/sec, 185 secs
lola: 76644402 markings, 288684493 edges, 382511 markings/sec, 190 secs
lola: 78596377 markings, 296036683 edges, 390395 markings/sec, 195 secs
lola: 79982903 markings, 301259234 edges, 277305 markings/sec, 200 secs
lola: 80617826 markings, 303650547 edges, 126985 markings/sec, 205 secs
lola: 82293041 markings, 309960411 edges, 335043 markings/sec, 210 secs
lola: 83847397 markings, 315833868 edges, 310871 markings/sec, 215 secs
lola: 85539816 markings, 322189470 edges, 338484 markings/sec, 220 secs
lola: 85544479 markings, 322207034 edges, 933 markings/sec, 225 secs
lola: 85985581 markings, 323868439 edges, 88220 markings/sec, 230 secs
lola: 86943698 markings, 327477222 edges, 191623 markings/sec, 235 secs
lola: 86943698 markings, 327477222 edges, 0 markings/sec, 240 secs
lola: 87513788 markings, 329624522 edges, 114018 markings/sec, 245 secs
lola: 87917231 markings, 331144070 edges, 80689 markings/sec, 250 secs
lola: 88685598 markings, 334038163 edges, 153673 markings/sec, 255 secs
lola: 89451276 markings, 336922113 edges, 153136 markings/sec, 260 secs
lola: 89451276 markings, 336922113 edges, 0 markings/sec, 265 secs
lola: 89847100 markings, 338413015 edges, 79165 markings/sec, 270 secs
lola: 90278855 markings, 340039227 edges, 86351 markings/sec, 275 secs
lola: 90997292 markings, 342745287 edges, 143687 markings/sec, 280 secs
lola: 91418321 markings, 344331108 edges, 84206 markings/sec, 285 secs
lola: 91577392 markings, 344930211 edges, 31814 markings/sec, 290 secs
lola: 92410359 markings, 348067638 edges, 166593 markings/sec, 295 secs
lola: 92978417 markings, 350207254 edges, 113612 markings/sec, 300 secs
lola: 93846105 markings, 353475457 edges, 173538 markings/sec, 305 secs
lola: 95373776 markings, 359229507 edges, 305534 markings/sec, 310 secs
lola: 95522441 markings, 359789445 edges, 29733 markings/sec, 315 secs
lola: 95522441 markings, 359789445 edges, 0 markings/sec, 320 secs
lola: 95522441 markings, 359789445 edges, 0 markings/sec, 325 secs
lola: 95522441 markings, 359789445 edges, 0 markings/sec, 330 secs
lola: 95522441 markings, 359789445 edges, 0 markings/sec, 335 secs
lola: 95680697 markings, 360385529 edges, 31651 markings/sec, 340 secs
lola: 96453823 markings, 363297552 edges, 154625 markings/sec, 345 secs
lola: 96641020 markings, 364002625 edges, 37439 markings/sec, 350 secs
lola: 98317173 markings, 370315928 edges, 335231 markings/sec, 355 secs
lola: Child process aborted or communication problem between parent and child process
lola: ========================================
lola: ...considering subproblem: E ((E (F ((p7 <= p12))) U A (G ((3 <= p59)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:806
lola: rewrite Frontend/Parser/formula_rewrite.k:813
lola: rewrite Frontend/Parser/formula_rewrite.k:809
lola: processed formula: E(EF((p7 <= p12)) U AG((3 <= p59)))
lola: processed formula length: 35
lola: 23 rewrites
lola: closed formula file CTLCardinality.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: 2509525 markings, 8861736 edges, 501905 markings/sec, 0 secs
lola: 4975627 markings, 17570157 edges, 493220 markings/sec, 5 secs
lola: 7435754 markings, 26257469 edges, 492025 markings/sec, 10 secs
lola: 9841121 markings, 34751429 edges, 481073 markings/sec, 15 secs
lola: 12250369 markings, 43259085 edges, 481850 markings/sec, 20 secs
lola: 14659918 markings, 51767817 edges, 481910 markings/sec, 25 secs
lola: 17040864 markings, 60175528 edges, 476189 markings/sec, 30 secs
lola: 19451921 markings, 68689561 edges, 482211 markings/sec, 35 secs
lola: 21870155 markings, 77228953 edges, 483647 markings/sec, 40 secs
lola: 24322126 markings, 85887467 edges, 490394 markings/sec, 45 secs
lola: 26686907 markings, 94238115 edges, 472956 markings/sec, 50 secs
lola: 28940254 markings, 102195242 edges, 450669 markings/sec, 55 secs
lola: 31259144 markings, 110383824 edges, 463778 markings/sec, 60 secs
lola: 33635622 markings, 118775769 edges, 475296 markings/sec, 65 secs
lola: 35964801 markings, 127000675 edges, 465836 markings/sec, 70 secs
lola: 38313810 markings, 135295609 edges, 469802 markings/sec, 75 secs
lola: 40586060 markings, 143319494 edges, 454450 markings/sec, 80 secs
lola: 42950585 markings, 151669235 edges, 472905 markings/sec, 85 secs
lola: 45425393 markings, 160408403 edges, 494962 markings/sec, 90 secs
lola: 47859026 markings, 169002159 edges, 486727 markings/sec, 95 secs
lola: 50182147 markings, 177205675 edges, 464624 markings/sec, 100 secs
lola: 52413990 markings, 185086876 edges, 446369 markings/sec, 105 secs
lola: 54645326 markings, 192966283 edges, 446267 markings/sec, 110 secs
lola: 56873417 markings, 200834230 edges, 445618 markings/sec, 115 secs
lola: 59081596 markings, 208631859 edges, 441636 markings/sec, 120 secs
lola: 61289814 markings, 216429621 edges, 441644 markings/sec, 125 secs
lola: 63448721 markings, 224053269 edges, 431781 markings/sec, 130 secs
lola: 65690385 markings, 231969146 edges, 448333 markings/sec, 135 secs
lola: 67934977 markings, 239895352 edges, 448918 markings/sec, 140 secs
lola: 70152800 markings, 247727037 edges, 443565 markings/sec, 145 secs
lola: 72378189 markings, 255585445 edges, 445078 markings/sec, 150 secs
lola: 74703921 markings, 263798184 edges, 465146 markings/sec, 155 secs
lola: 76979908 markings, 271835276 edges, 455197 markings/sec, 160 secs
lola: 79160260 markings, 279535794 edges, 436070 markings/sec, 165 secs
lola: 80877329 markings, 285598649 edges, 343414 markings/sec, 170 secs
lola: 81989057 markings, 289525164 edges, 222346 markings/sec, 175 secs
lola: 83544673 markings, 295017096 edges, 311123 markings/sec, 180 secs
lola: 84898351 markings, 299797279 edges, 270736 markings/sec, 185 secs
lola: 86756119 markings, 306357512 edges, 371554 markings/sec, 190 secs
lola: 87196801 markings, 307913680 edges, 88136 markings/sec, 195 secs
lola: 87438010 markings, 308765442 edges, 48242 markings/sec, 200 secs
lola: 88428534 markings, 312263225 edges, 198105 markings/sec, 205 secs
lola: 89527890 markings, 316145330 edges, 219871 markings/sec, 210 secs
lola: 90996194 markings, 321330287 edges, 293661 markings/sec, 215 secs
lola: 91122301 markings, 321775599 edges, 25221 markings/sec, 220 secs
lola: 91250830 markings, 322229467 edges, 25706 markings/sec, 225 secs
lola: 92838949 markings, 327837514 edges, 317624 markings/sec, 230 secs
lola: 93435759 markings, 329944996 edges, 119362 markings/sec, 235 secs
lola: 93435848 markings, 329945317 edges, 18 markings/sec, 240 secs
lola: 93435848 markings, 329945317 edges, 0 markings/sec, 245 secs
lola: 94061014 markings, 332152929 edges, 125033 markings/sec, 250 secs
lola: 94901844 markings, 335122112 edges, 168166 markings/sec, 255 secs
lola: 94901844 markings, 335122112 edges, 0 markings/sec, 260 secs
lola: 95249866 markings, 336351058 edges, 69604 markings/sec, 265 secs
lola: 97046530 markings, 342695531 edges, 359333 markings/sec, 270 secs
lola: 97046530 markings, 342695531 edges, 0 markings/sec, 275 secs
lola: 97046530 markings, 342695531 edges, 0 markings/sec, 280 secs
lola: 97675620 markings, 344917004 edges, 125818 markings/sec, 285 secs
lola: Child process aborted or communication problem between parent and child process
lola: ========================================
lola: ...considering subproblem: (A (((1 <= p26) U (1 <= p18))) OR ((p11 <= p59) OR E (F (A (G ((3 <= p29)))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: ...considering subproblem: A (((1 <= p26) U (1 <= p18)))
lola: ========================================
lola: SUBTASK
lola: checking universal until
lola: rewrite Frontend/Parser/formula_rewrite.k:577
lola: rewrite Frontend/Parser/formula_rewrite.k:735
lola: rewrite Frontend/Parser/formula_rewrite.k:695
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: A (((1 <= p26) U (1 <= p18)))
lola: processed formula length: 29
lola: 25 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /ER)
lola: state space: using reachability graph (ER version) (--search=depth)
lola: state space: using ltl preserving stubborn set method (--stubborn=tarjan)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: 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 <= p26)
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: 1
lola: SUBRESULT
lola: result: no
lola: produced by: state space /ER
lola: Predicate Phi does not hild until Predicate Psi on all paths.
lola: 7 markings, 7 edges
lola: state equation: write sara problem file to CTLCardinality-19-0.sara
lola: state equation: calling and running sara
lola: ========================================
lola: ...considering subproblem: (p11 <= p59)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p11 <= p59)
lola: processed formula length: 12
lola: 20 rewrites
lola: closed formula file CTLCardinality.xml
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: ========================================
lola: ========================================
lola: ...considering subproblem: E (F (A (G ((3 <= p29)))))
lola: ========================================
lola: SUBTASK
lola: checking possible invariance
lola: rewrite Frontend/Parser/formula_rewrite.k:604
lola: rewrite Frontend/Parser/formula_rewrite.k:614
lola: rewrite Frontend/Parser/formula_rewrite.k:726
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: (p29 <= 2)
lola: processed formula length: 10
lola: 24 rewrites
lola: closed formula file CTLCardinality.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: (3 <= p29)
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:787
lola: state equation task get result rewrite finished id 1
lola: state equation task get result unparse finished++ id 1
lola: formula 1: (p29 <= 2)
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 CTLCardinality-21-1.sara
lola: state equation: calling and running sara
lola: state equation: write sara problem file to CTLCardinality-21-0.sara
sara: try reading problem file CTLCardinality-21-1.sara.
sara: try reading problem file CTLCardinality-19-0.sara.
sara: place or transition ordering is non-deterministic
sara: place or transition ordering is non-deterministic
lola: state equation: calling and running sara
sara: try reading problem file CTLCardinality-21-0.sara.
sara: place or transition ordering is non-deterministic



lola: state equation 0: solution produced
lola: state equation 1: solution produced
lola: sara is running 0 secs || sara is running 0 secs || 4549760 markings, 6966789 edges, 909952 markings/sec, 0 secs
lola: sara is running 5 secs || sara is running 5 secs || 9026012 markings, 13821061 edges, 895250 markings/sec, 5 secs
lola: sara is running 10 secs || sara is running 10 secs || 13334313 markings, 20418140 edges, 861660 markings/sec, 10 secs
lola: sara is running 15 secs || sara is running 15 secs || 17454464 markings, 26727116 edges, 824030 markings/sec, 15 secs
lola: sara is running 20 secs || sara is running 20 secs || 21963183 markings, 33631090 edges, 901744 markings/sec, 20 secs
lola: sara is running 25 secs || sara is running 25 secs || 26459565 markings, 40516173 edges, 899276 markings/sec, 25 secs
lola: sara is running 30 secs || sara is running 30 secs || 30784752 markings, 47139128 edges, 865037 markings/sec, 30 secs
lola: sara is running 35 secs || sara is running 35 secs || 34842153 markings, 53352015 edges, 811480 markings/sec, 35 secs
lola: sara is running 40 secs || sara is running 40 secs || 38987186 markings, 59699102 edges, 829007 markings/sec, 40 secs
lola: sara is running 45 secs || sara is running 45 secs || 43140501 markings, 66058861 edges, 830663 markings/sec, 45 secs
lola: sara is running 50 secs || sara is running 50 secs || 47357970 markings, 72516859 edges, 843494 markings/sec, 50 secs
lola: sara is running 55 secs || sara is running 55 secs || 51741658 markings, 79229382 edges, 876738 markings/sec, 55 secs
lola: sara is running 60 secs || sara is running 60 secs || 55938083 markings, 85655163 edges, 839285 markings/sec, 60 secs
lola: sara is running 65 secs || sara is running 65 secs || 60109065 markings, 92041981 edges, 834196 markings/sec, 65 secs
lola: sara is running 70 secs || sara is running 70 secs || 64231405 markings, 98354313 edges, 824468 markings/sec, 70 secs
lola: sara is running 75 secs || sara is running 75 secs || 68468336 markings, 104842112 edges, 847386 markings/sec, 75 secs
lola: sara is running 80 secs || sara is running 80 secs || 72831861 markings, 111523754 edges, 872705 markings/sec, 80 secs
lola: sara is running 85 secs || sara is running 85 secs || 77193188 markings, 118202048 edges, 872265 markings/sec, 85 secs
lola: sara is running 90 secs || sara is running 90 secs || 81504816 markings, 124804218 edges, 862326 markings/sec, 90 secs
lola: sara is running 95 secs || sara is running 95 secs || 85588307 markings, 131057064 edges, 816698 markings/sec, 95 secs
lola: sara is running 100 secs || sara is running 100 secs || 89718159 markings, 137380900 edges, 825970 markings/sec, 100 secs
lola: sara is running 105 secs || sara is running 105 secs || 93833430 markings, 143682410 edges, 823054 markings/sec, 105 secs
lola: sara is running 110 secs || sara is running 110 secs || 97634830 markings, 149503304 edges, 760280 markings/sec, 110 secs
lola: sara is running 115 secs || sara is running 115 secs || 100825193 markings, 154388577 edges, 638073 markings/sec, 115 secs
lola: sara is running 120 secs || sara is running 120 secs || 102912495 markings, 157584732 edges, 417460 markings/sec, 120 secs
lola: sara is running 125 secs || sara is running 125 secs || 105507544 markings, 161558403 edges, 519010 markings/sec, 125 secs
lola: sara is running 130 secs || sara is running 130 secs || 106803677 markings, 163543088 edges, 259227 markings/sec, 130 secs
lola: sara is running 135 secs || sara is running 135 secs || 106803677 markings, 163543088 edges, 0 markings/sec, 135 secs
lola: sara is running 140 secs || sara is running 140 secs || 106803677 markings, 163543088 edges, 0 markings/sec, 140 secs
lola: sara is running 145 secs || sara is running 145 secs || 106904844 markings, 163698014 edges, 20233 markings/sec, 145 secs
lola: sara is running 150 secs || sara is running 150 secs || 109887748 markings, 168265580 edges, 596581 markings/sec, 150 secs
lola: sara is running 155 secs || sara is running 155 secs || 111472283 markings, 170691893 edges, 316907 markings/sec, 155 secs
lola: sara is running 160 secs || sara is running 160 secs || 111494912 markings, 170726555 edges, 4526 markings/sec, 160 secs
lola: sara is running 165 secs || sara is running 165 secs || 111510284 markings, 170750082 edges, 3074 markings/sec, 165 secs
lola: sara is running 170 secs || sara is running 170 secs || 112944026 markings, 172945514 edges, 286748 markings/sec, 170 secs
lola: sara is running 175 secs || sara is running 175 secs || 114749499 markings, 175710138 edges, 361095 markings/sec, 175 secs
lola: sara is running 180 secs || sara is running 180 secs || 114749499 markings, 175710138 edges, 0 markings/sec, 180 secs
lola: sara is running 185 secs || sara is running 185 secs || 115659768 markings, 177103983 edges, 182054 markings/sec, 185 secs
lola: sara is running 190 secs || sara is running 190 secs || 116851840 markings, 178929349 edges, 238414 markings/sec, 190 secs
lola: sara is running 195 secs || sara is running 195 secs || 119015941 markings, 182243128 edges, 432820 markings/sec, 195 secs
lola: sara is running 200 secs || sara is running 200 secs || 119016888 markings, 182244568 edges, 189 markings/sec, 200 secs
lola: sara is running 205 secs || sara is running 205 secs || 119085189 markings, 182349162 edges, 13660 markings/sec, 205 secs
lola: Child process aborted or communication problem between parent and child process
lola: SUBRESULT
lola: result: unknown
lola: The Boolean predicate may be true or false.
lola: ========================================
lola: ========================================
lola: ...considering subproblem: (A (G ((p3 <= 1))) OR (A (G ((p28 + 1 <= p12))) OR (A (F ((1 <= p58))) OR ((3 <= p8) AND (p5 <= p45)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: ...considering subproblem: A (G ((p3 <= 1)))
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 ((p3 <= 1)))
lola: processed formula length: 17
lola: 22 rewrites
lola: closed formula file CTLCardinality.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: (2 <= p3)
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: 2 markings, 1 edges
lola: ========================================
lola: ========================================
lola: ...considering subproblem: A (G ((p28 + 1 <= p12)))
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 ((p28 + 1 <= p12)))
lola: processed formula length: 24
lola: 22 rewrites
lola: closed formula file CTLCardinality.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: (p12 <= p28)
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to CTLCardinality-21-0.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 17 markings, 16 edges
lola: ========================================
lola: ========================================
lola: ...considering subproblem: ((3 <= p8) AND (p5 <= p45))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((3 <= p8) AND (p5 <= p45))
lola: processed formula length: 27
lola: 20 rewrites
lola: closed formula file CTLCardinality.xml
lola: processed formula with 2 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: ========================================
lola: ...considering subproblem: A (F ((1 <= p58)))
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: (p58 <= 0)
lola: processed formula length: 10
lola: 23 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: state space / EG
lola: The predicate does not eventually occur.
lola: 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 <= p58)
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: 7 markings, 7 edges
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: state equation: write sara problem file to CTLCardinality-23-0.sara
lola: lola: ========================================
========================================
lola: RESULT
lola:
SUMMARY: yes no yes yes no yes yes no no unknown yes unknown unknown unknown no yes
lola:
preliminary result: yes no yes yes no yes yes no no unknown yes unknown unknown unknown no yes
lola: state equation: calling and running sara
sara: try reading problem file CTLCardinality-23-0.sara.
sara: place or transition ordering is non-deterministic

lola: memory consumption: 3788 KB
lola: time consumption: 2235 seconds
lola: print data as JSON (--json)
lola: writing JSON to CTLCardinality.json
lola: closed JSON file CTLCardinality.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="RefineWMG-PT-015016"
export BK_EXAMINATION="CTLCardinality"
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 RefineWMG-PT-015016, examination is CTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r186-oct2-158987938500075"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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