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-158987938400051.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-010010, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r186-oct2-158987938400051
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 192K
-rw-r--r-- 1 mcc users 3.3K Apr 12 10:53 CTLCardinality.txt
-rw-r--r-- 1 mcc users 20K Apr 12 10:53 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Apr 11 11:59 CTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 11 11:59 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.0K Apr 14 12:48 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Apr 28 14:02 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Apr 14 12:48 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 28 14:02 LTLFireability.xml
-rw-r--r-- 1 mcc users 2.9K Apr 10 16:31 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 15K Apr 10 16:31 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Apr 9 22:56 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 16K 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 24K Mar 24 05:38 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME 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 1591223833466

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-03 22:37:15] [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 22:37:15] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-03 22:37:15] [INFO ] Load time of PNML (sax parser for PT used): 26 ms
[2020-06-03 22:37:15] [INFO ] Transformed 54 places.
[2020-06-03 22:37:15] [INFO ] Transformed 43 transitions.
[2020-06-03 22:37:15] [INFO ] Parsed PT model containing 54 places and 43 transitions in 56 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 10 ms.
Incomplete random walk after 100003 steps, including 0 resets, run finished after 103 ms. (steps per millisecond=970 ) properties seen :[1, 1, 0, 0, 1, 0, 1, 0, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 0, 1, 1, 1, 1, 1, 0, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 0, 1]
// Phase 1: matrix 43 rows 54 cols
[2020-06-03 22:37:15] [INFO ] Computed 22 place invariants in 3 ms
[2020-06-03 22:37:15] [INFO ] [Real]Absence check using 22 positive place invariants in 17 ms returned sat
[2020-06-03 22:37:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 22:37:15] [INFO ] [Real]Absence check using state equation in 25 ms returned sat
[2020-06-03 22:37:15] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 22:37:15] [INFO ] [Nat]Absence check using 22 positive place invariants in 10 ms returned sat
[2020-06-03 22:37:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 22:37:15] [INFO ] [Nat]Absence check using state equation in 30 ms returned sat
[2020-06-03 22:37:15] [INFO ] Computed and/alt/rep : 32/42/32 causal constraints in 10 ms.
[2020-06-03 22:37:15] [INFO ] Added : 23 causal constraints over 5 iterations in 42 ms. Result :sat
[2020-06-03 22:37:15] [INFO ] [Real]Absence check using 22 positive place invariants in 4 ms returned sat
[2020-06-03 22:37:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 22:37:15] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2020-06-03 22:37:15] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 22:37:15] [INFO ] [Nat]Absence check using 22 positive place invariants in 7 ms returned sat
[2020-06-03 22:37:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 22:37:15] [INFO ] [Nat]Absence check using state equation in 16 ms returned sat
[2020-06-03 22:37:15] [INFO ] Computed and/alt/rep : 32/42/32 causal constraints in 4 ms.
[2020-06-03 22:37:15] [INFO ] Added : 22 causal constraints over 5 iterations in 26 ms. Result :sat
[2020-06-03 22:37:15] [INFO ] [Real]Absence check using 22 positive place invariants in 4 ms returned sat
[2020-06-03 22:37:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 22:37:15] [INFO ] [Real]Absence check using state equation in 15 ms returned sat
[2020-06-03 22:37:15] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 22:37:15] [INFO ] [Nat]Absence check using 22 positive place invariants in 5 ms returned sat
[2020-06-03 22:37:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 22:37:15] [INFO ] [Nat]Absence check using state equation in 21 ms returned sat
[2020-06-03 22:37:15] [INFO ] Computed and/alt/rep : 32/42/32 causal constraints in 3 ms.
[2020-06-03 22:37:15] [INFO ] Added : 16 causal constraints over 4 iterations in 17 ms. Result :sat
[2020-06-03 22:37:15] [INFO ] [Real]Absence check using 22 positive place invariants in 5 ms returned sat
[2020-06-03 22:37:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 22:37:15] [INFO ] [Real]Absence check using state equation in 15 ms returned sat
[2020-06-03 22:37:15] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 22:37:15] [INFO ] [Nat]Absence check using 22 positive place invariants in 5 ms returned sat
[2020-06-03 22:37:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 22:37:15] [INFO ] [Nat]Absence check using state equation in 14 ms returned sat
[2020-06-03 22:37:15] [INFO ] Computed and/alt/rep : 32/42/32 causal constraints in 2 ms.
[2020-06-03 22:37:15] [INFO ] Added : 21 causal constraints over 5 iterations in 18 ms. Result :sat
[2020-06-03 22:37:15] [INFO ] [Real]Absence check using 22 positive place invariants in 4 ms returned sat
[2020-06-03 22:37:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 22:37:15] [INFO ] [Real]Absence check using state equation in 19 ms returned sat
[2020-06-03 22:37:15] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 22:37:15] [INFO ] [Nat]Absence check using 22 positive place invariants in 7 ms returned sat
[2020-06-03 22:37:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 22:37:15] [INFO ] [Nat]Absence check using state equation in 16 ms returned sat
[2020-06-03 22:37:15] [INFO ] Computed and/alt/rep : 32/42/32 causal constraints in 2 ms.
[2020-06-03 22:37:16] [INFO ] Added : 24 causal constraints over 5 iterations in 20 ms. Result :sat
[2020-06-03 22:37:16] [INFO ] [Real]Absence check using 22 positive place invariants in 4 ms returned sat
[2020-06-03 22:37:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 22:37:16] [INFO ] [Real]Absence check using state equation in 15 ms returned sat
[2020-06-03 22:37:16] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 22:37:16] [INFO ] [Nat]Absence check using 22 positive place invariants in 11 ms returned sat
[2020-06-03 22:37:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 22:37:16] [INFO ] [Nat]Absence check using state equation in 15 ms returned sat
[2020-06-03 22:37:16] [INFO ] Computed and/alt/rep : 32/42/32 causal constraints in 2 ms.
[2020-06-03 22:37:16] [INFO ] Added : 25 causal constraints over 5 iterations in 19 ms. Result :sat
[2020-06-03 22:37:16] [INFO ] [Real]Absence check using 22 positive place invariants in 4 ms returned sat
[2020-06-03 22:37:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 22:37:16] [INFO ] [Real]Absence check using state equation in 14 ms returned sat
[2020-06-03 22:37:16] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 22:37:16] [INFO ] [Nat]Absence check using 22 positive place invariants in 5 ms returned sat
[2020-06-03 22:37:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 22:37:16] [INFO ] [Nat]Absence check using state equation in 16 ms returned sat
[2020-06-03 22:37:16] [INFO ] Computed and/alt/rep : 32/42/32 causal constraints in 3 ms.
[2020-06-03 22:37:16] [INFO ] Added : 23 causal constraints over 5 iterations in 19 ms. Result :sat
[2020-06-03 22:37:16] [INFO ] [Real]Absence check using 22 positive place invariants in 6 ms returned sat
[2020-06-03 22:37:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 22:37:16] [INFO ] [Real]Absence check using state equation in 19 ms returned sat
[2020-06-03 22:37:16] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 22:37:16] [INFO ] [Nat]Absence check using 22 positive place invariants in 7 ms returned sat
[2020-06-03 22:37:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 22:37:16] [INFO ] [Nat]Absence check using state equation in 14 ms returned sat
[2020-06-03 22:37:16] [INFO ] Computed and/alt/rep : 32/42/32 causal constraints in 5 ms.
[2020-06-03 22:37:16] [INFO ] Added : 22 causal constraints over 5 iterations in 27 ms. Result :sat
[2020-06-03 22:37:16] [INFO ] [Real]Absence check using 22 positive place invariants in 13 ms returned sat
[2020-06-03 22:37:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 22:37:16] [INFO ] [Real]Absence check using state equation in 17 ms returned sat
[2020-06-03 22:37:16] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 22:37:16] [INFO ] [Nat]Absence check using 22 positive place invariants in 5 ms returned sat
[2020-06-03 22:37:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 22:37:16] [INFO ] [Nat]Absence check using state equation in 15 ms returned sat
[2020-06-03 22:37:16] [INFO ] Computed and/alt/rep : 32/42/32 causal constraints in 1 ms.
[2020-06-03 22:37:16] [INFO ] Added : 17 causal constraints over 4 iterations in 15 ms. Result :sat
[2020-06-03 22:37:16] [INFO ] Flatten gal took : 23 ms
[2020-06-03 22:37:16] [INFO ] Flatten gal took : 7 ms
[2020-06-03 22:37:16] [INFO ] Export to MCC properties in file /home/mcc/execution/CTLCardinality.sr.xml took 2 ms.
[2020-06-03 22:37:16] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 2 ms.
info: Time: 3600 - MCC
vrfy: Checking CTLCardinality @ RefineWMG-PT-010010 @ 3570 seconds

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

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

FORMULA n0-CTLCardinality-11 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-00 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

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

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

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

FORMULA n0-CTLCardinality-07 TRUE 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-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

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

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

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

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

FORMULA n0-CTLCardinality-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 1373
rslt: Output for CTLCardinality @ RefineWMG-PT-010010

{
"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 22:37:16 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": 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(((p4 <= 0) AND (p37 + 1 <= p5)))",
"processed_size": 35,
"rewrites": 20
},
"net":
{
"conflict_clusters": 33,
"singleton_clusters": 0
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "CTL model checker",
"value": false
},
"task":
{
"compoundnumber": 0,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 237
},
"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": "(p16 <= 2)",
"processed_size": 10,
"rewrites": 22
},
"result":
{
"edges": 80,
"markings": 81,
"produced_by": "state space /EXEF",
"value": false
},
"task":
{
"compoundnumber": 1,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "invariance_from_all_successors",
"workflow": "stateequation"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 0,
"type": "boolean"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 237
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 0,
"G": 0,
"U": 0,
"X": 1,
"aconj": 1,
"adisj": 1,
"aneg": 0,
"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": "EX(((2 <= p25) AND ((p40 <= p41) OR (1 <= p43))))",
"processed_size": 50,
"rewrites": 20
},
"net":
{
"conflict_clusters": 33,
"singleton_clusters": 0
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "CTL model checker",
"value": false
},
"task":
{
"compoundnumber": 1,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 254
},
"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": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "(p31 <= p38)",
"processed_size": 12,
"rewrites": 21
},
"result":
{
"edges": 10,
"markings": 11,
"produced_by": "state space /EXEF",
"value": true
},
"task":
{
"compoundnumber": 2,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "reachability_from_a_successor",
"workflow": "stateequation"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": true
},
"task":
{
"compoundnumber": 1,
"type": "boolean"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 254
},
"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 ((p2 + 1 <= p30)))",
"processed_size": 23,
"rewrites": 21
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 2,
"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": 274
},
"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": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "A (G ((p33 <= p12)))",
"processed_size": 20,
"rewrites": 21
},
"result":
{
"edges": 11,
"markings": 12,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 3,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "invariance",
"workflow": "stateequation||search"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 2,
"type": "boolean"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 274
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 1,
"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": "E (F (((3 <= p52) OR (p30 <= p26))))",
"processed_size": 37,
"rewrites": 20
},
"result":
{
"edges": 0,
"markings": 0,
"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": 2,
"problems": 2
},
"type": "reachability",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 297
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 5,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "E (F (((p21 <= p25) AND (2 <= p0) AND (p19 <= p41))))",
"processed_size": 53,
"rewrites": 20
},
"result":
{
"edges": 56,
"markings": 57,
"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": 3,
"problems": 3
},
"type": "reachability",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 324
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 0,
"G": 0,
"U": 0,
"X": 1,
"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": "EX((p13 <= 1))",
"processed_size": 14,
"rewrites": 20
},
"net":
{
"conflict_clusters": 33,
"singleton_clusters": 0
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "CTL model checker",
"value": true
},
"task":
{
"compoundnumber": 5,
"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": 3,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 297
},
"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 <= p9)))",
"processed_size": 17,
"rewrites": 20
},
"result":
{
"edges": 19,
"markings": 20,
"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": 324
},
"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 ((p46 <= p43)))",
"processed_size": 20,
"rewrites": 20
},
"result":
{
"edges": 10,
"markings": 11,
"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": 356
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "E (F (((2 <= p15) AND (2 <= p25))))",
"processed_size": 35,
"rewrites": 20
},
"result":
{
"edges": 17,
"markings": 18,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 6,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 2,
"problems": 2
},
"type": "reachability",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 396
},
"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 ((p32 <= p14)))",
"processed_size": 20,
"rewrites": 20
},
"result":
{
"edges": 10,
"markings": 11,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 7,
"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": 462
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 462
},
"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": "(1 <= p33)",
"processed_size": 10,
"rewrites": 19
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 9,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 539
},
"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 ((p31 <= p44)))",
"processed_size": 20,
"rewrites": 20
},
"result":
{
"edges": 77,
"markings": 78,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 10,
"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"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": true
},
"task":
{
"compoundnumber": 9,
"type": "boolean"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 539
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "((p36 <= p1) OR (2 <= p13))",
"processed_size": 27,
"rewrites": 20
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 10,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": null
},
"task":
{
"compoundnumber": 10,
"type": "boolean"
}
},

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

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 889
},
"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 ((p6 <= p25)))",
"processed_size": 19,
"rewrites": 20
},
"result":
{
"edges": 54,
"markings": 55,
"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"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "reachability",
"workflow": "stateequation||search"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": true
},
"task":
{
"compoundnumber": 12,
"type": "boolean"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 889
},
"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 <= p6)",
"processed_size": 9,
"rewrites": 19
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 13,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": null
},
"task":
{
"compoundnumber": 13,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1209
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 2,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 5,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "G ((G ((3 <= p21)) OR ((1 <= p20) AND (1 <= p30) AND (p28 <= p53))))",
"processed_size": 68,
"rewrites": 21
},
"result":
{
"edges": 9305,
"markings": 6532,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 14,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "universal single path",
"workflow": "product automaton"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 2419
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 2,
"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": "E (((p2 + 1 <= p49) R (p29 <= 2)))",
"processed_size": 34,
"rewrites": 22
},
"result":
{
"edges": 4,
"markings": 4,
"produced_by": "state space /ER",
"value": true
},
"task":
{
"compoundnumber": 15,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl",
"visible": 3
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "existential_release",
"workflow": "stateequation"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": null
},
"task":
{
"compoundnumber": 15,
"type": "boolean"
}
},

{
"child":
[

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

{
"child":
[

{
"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 <= p6)",
"processed_size": 9,
"rewrites": 19
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 19,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
}
],
"result":
{
"produced_by": "boolean",
"value": null
},
"task":
{
"compoundnumber": 19,
"type": "boolean"
}
},

{
"child":
[

{
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 2,
"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": "E (((p2 + 1 <= p49) R (p29 <= 2)))",
"processed_size": 34,
"rewrites": 22
},
"result":
{
"edges": 4,
"markings": 4,
"produced_by": "state space /ER",
"value": true
},
"task":
{
"compoundnumber": 20,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl",
"visible": 3
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "existential_release",
"workflow": "stateequation"
}
},

{
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 0,
"G": 0,
"U": 1,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 6,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 6,
"visible_transitions": 0
},
"processed": "E ((((p34 <= p18) AND (p25 <= p43)) U (p42 <= p38)))",
"processed_size": 52,
"rewrites": 22
},
"result":
{
"edges": 1869,
"markings": 1210,
"produced_by": "state space /EU",
"value": true
},
"task":
{
"compoundnumber": 21,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "eu preserving",
"visible": 4
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "existential_until",
"workflow": "stateequation"
}
}
],
"result":
{
"produced_by": "boolean",
"value": true
},
"task":
{
"compoundnumber": 20,
"type": "boolean"
}
}
],
"exit":
{
"error": null,
"memory": 3932,
"runtime": 2197.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "CTLCardinality.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "E(F(**)) : E(F(**)) : (E(X(**)) OR A(X(A(G(**))))) : E(F(**)) : (E((** U **)) AND **) : E((** U **)) : A(G((E(G(**)) OR (** OR (** OR **))))) : (E(F(**)) OR **) : (E((** U **)) OR (** OR **)) : (E(X(E(F(**)))) OR E(X(**))) : (** AND E(F(**))) : (A(G(**)) OR (A(G(*)) AND A(X(*)))) : A(G((A(G(**)) OR **))) : E(F(**)) : (E((** U **)) AND E((* R *))) : (E(F(**)) AND (E(F(**)) AND E(X(*))))"
},
"net":
{
"arcs": 128,
"conflict_clusters": 33,
"places": 54,
"places_significant": 32,
"singleton_clusters": 0,
"transitions": 43
},
"result":
{
"preliminary_value": "yes yes no yes unknown unknown unknown yes unknown yes yes no no yes yes yes ",
"value": "yes yes no yes unknown unknown unknown yes unknown yes yes no no yes yes yes "
},
"task":
{
"type": "compound"
}
}
lola: LoLA will run for 3570 seconds at most (--timelimit)
lola: NET
lola: input: PNML file (--pnml)
lola: reading net from model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file model.pnml
lola: 97/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 1728
lola: finding significant places
lola: 54 places, 43 transitions, 32 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: E (F ((2 <= p9))) : E (F ((p32 <= p14))) : (E (X (((p4 <= 0) AND (p37 + 1 <= p5)))) OR A (X (A (G ((3 <= p16)))))) : E (F ((p46 <= p43))) : (E ((((p24 <= p10) OR (p19 <= p41)) U (3 <= p25))) AND (2 <= p6)) : E ((((p48 <= 2) AND (p23 <= 2)) U ((p13 + 1 <= p10) AND ((2 <= p37) OR (1 <= p48))))) : A (G ((((E (G ((2 <= p49))) OR (p43 <= p9)) OR (p11 <= p21)) OR ((p10 <= p1) AND (p19 <= p52))))) : (E (F ((p31 <= p44))) OR (1 <= p33)) : ((E (((1 <= p17) U (3 <= p15))) OR (p36 <= p1)) OR (2 <= p13)) : E (X ((E (F ((p31 <= p38))) OR ((2 <= p25) AND ((p40 <= p41) OR (1 <= p43)))))) : (((p8 <= 1) AND (p12 <= p7)) AND E (F ((p6 <= p25)))) : (A (G ((p33 <= p12))) OR (NOT(E (F ((p30 <= p2)))) AND NOT(E (X ((p25 <= p29)))))) : A (G ((A (G ((3 <= p21))) OR ((1 <= p20) AND (1 <= p30) AND (p28 <= p53))))) : E (F (((2 <= p15) AND (2 <= p25)))) : (E ((((p34 <= p18) AND (p25 <= p43)) U (p42 <= p38))) AND NOT(A (((p49 <= p2) U (3 <= p29))))) : ((E (F (((p21 <= p25) AND (2 <= p0) AND (p19 <= p41)))) AND E (F (((3 <= p52) OR (p30 <= p26))))) AND NOT(A (X ((2 <= p13)))))
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:554
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:338
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 222 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E (X (((p4 <= 0) AND (p37 + 1 <= p5)))) OR A (X (A (G ((3 <= p16))))))
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 (X (((p4 <= 0) AND (p37 + 1 <= p5))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:807
lola: processed formula: EX(((p4 <= 0) AND (p37 + 1 <= p5)))
lola: processed formula length: 35
lola: 20 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: subprocess 1 will run for 237 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (A (G ((3 <= p16)))))
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: (p16 <= 2)
lola: processed formula length: 10
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 /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: (p16 <= 2)
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 /EXEF
lola: The predicate is not invariant from successors.
lola: 81 markings, 80 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 1 will run for 237 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E (X (E (F ((p31 <= p38))))) OR E (X (((2 <= p25) AND ((p40 <= p41) OR (1 <= p43))))))
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: E (X (((2 <= p25) AND ((p40 <= p41) OR (1 <= p43)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:807
lola: processed formula: EX(((2 <= p25) AND ((p40 <= p41) OR (1 <= p43))))
lola: processed formula length: 50
lola: 20 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: subprocess 2 will run for 254 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (X (E (F ((p31 <= p38)))))
lola: ========================================
lola: SUBTASK
lola: checking reachability from a successor
lola: rewrite Frontend/Parser/formula_rewrite.k:623
lola: rewrite Frontend/Parser/formula_rewrite.k:714
lola: processed formula: (p31 <= p38)
lola: processed formula length: 12
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 /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: state equation task get result rewrite finished id 0
lola: SUBRESULT
lola: result: yes
lola: produced by: state space /EXEF
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (p31 <= p38)
lola: state equation task get result unparse finished id 0
lola: The predicate is reachable from some successor.
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: 11 markings, 10 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 2 will run for 254 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (G ((p33 <= p12))) OR (A (G ((p2 + 1 <= p30))) AND A (X ((p29 + 1 <= p25)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 2 will run for 254 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((p2 + 1 <= p30)))
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 ((p2 + 1 <= p30)))
lola: processed formula length: 23
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:721
lola: rewrite Frontend/Parser/formula_rewrite.k:788
lola: state equation task get result rewrite finished id 0
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (p30 <= p2)
lola: state equation task get result unparse finished id 0
lola: 0 markings, 0 edges
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: ========================================
lola: subprocess 3 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((p33 <= 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 ((p33 <= p12)))
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: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 + 1 <= p33)
lola: state equation task get result unparse finished id 0
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: The predicate is not invariant.
lola: 12 markings, 11 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 3 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E (F (((p21 <= p25) AND (2 <= p0) AND (p19 <= p41)))) AND (E (F (((3 <= p52) OR (p30 <= p26)))) AND E (X ((p13 <= 1)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 3 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((3 <= p52) OR (p30 <= p26))))
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 <= p52) OR (p30 <= p26))))
lola: processed formula length: 37
lola: 20 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: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((3 <= p52) OR (p30 <= p26))
lola: state equation task get result unparse finished id 0
lola: The predicate is reachable.
lola: 0 markings, 0 edges
lola: state equation: Generated DNF with 2 literals and 2 conjunctive subformulas
lola: ========================================
lola: subprocess 4 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((p21 <= p25) AND (2 <= p0) AND (p19 <= p41))))
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 (((p21 <= p25) AND (2 <= p0) AND (p19 <= p41))))
lola: processed formula length: 53
lola: 20 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: ((p21 <= p25) AND (2 <= p0) AND (p19 <= p41))
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: 57 markings, 56 edges
lola: ========================================
lola: subprocess 5 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (X ((p13 <= 1)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:807
lola: processed formula: EX((p13 <= 1))
lola: processed formula length: 14
lola: 20 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 4 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((2 <= p9)))
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 <= p9)))
lola: processed formula length: 17
lola: 20 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: (2 <= p9)
lola: state equation task get result unparse finished id 0
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: The predicate is reachable.
lola: 20 markings, 19 edges
lola: ========================================
lola: subprocess 5 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((p46 <= p43)))
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 ((p46 <= p43)))
lola: processed formula length: 20
lola: 20 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: (p46 <= p43)
lola: state equation task get result unparse finished id 0
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: The predicate is reachable.
lola: 11 markings, 10 edges
lola: ========================================
lola: subprocess 6 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((2 <= p15) AND (2 <= p25))))
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 <= p15) AND (2 <= p25))))
lola: processed formula length: 35
lola: 20 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: ((2 <= p15) AND (2 <= p25))
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: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: 18 markings, 17 edges
lola: ========================================
lola: subprocess 7 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((p32 <= p14)))
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 ((p32 <= p14)))
lola: processed formula length: 20
lola: 20 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: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: formula 0: (p32 <= p14)
lola: state equation task get result unparse finished id 0
lola: The predicate is reachable.
lola: 11 markings, 10 edges
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: ========================================
lola: subprocess 8 will run for 445 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((E (G ((2 <= p49))) OR ((p43 <= p9) OR ((p11 <= p21) OR ((p10 <= p1) AND (p19 <= p52)))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:808
lola: rewrite Frontend/Parser/formula_rewrite.k:813
lola: processed formula: AG((EG((2 <= p49)) OR ((p43 <= p9) OR ((p11 <= p21) OR ((p10 <= p1) AND (p19 <= p52))))))
lola: processed formula length: 89
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 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: 3514634 markings, 8962304 edges, 702927 markings/sec, 0 secs
lola: 6876025 markings, 17533846 edges, 672278 markings/sec, 5 secs
lola: 10265011 markings, 26175755 edges, 677797 markings/sec, 10 secs
lola: 13648473 markings, 34803587 edges, 676692 markings/sec, 15 secs
lola: 17024273 markings, 43411869 edges, 675160 markings/sec, 20 secs
lola: 20426388 markings, 52087260 edges, 680423 markings/sec, 25 secs
lola: 23777774 markings, 60633303 edges, 670277 markings/sec, 30 secs
lola: 27007134 markings, 68868166 edges, 645872 markings/sec, 35 secs
lola: 30050696 markings, 76629246 edges, 608712 markings/sec, 40 secs
lola: 33277777 markings, 84858306 edges, 645416 markings/sec, 45 secs
lola: 36438578 markings, 92918353 edges, 632160 markings/sec, 50 secs
lola: 39666917 markings, 101150620 edges, 645668 markings/sec, 55 secs
lola: 42954401 markings, 109533703 edges, 657497 markings/sec, 60 secs
lola: 46175343 markings, 117747109 edges, 644188 markings/sec, 65 secs
lola: 49404795 markings, 125982205 edges, 645890 markings/sec, 70 secs
lola: 52660547 markings, 134284365 edges, 651150 markings/sec, 75 secs
lola: 55862226 markings, 142448652 edges, 640336 markings/sec, 80 secs
lola: 59154981 markings, 150845179 edges, 658551 markings/sec, 85 secs
lola: 62511558 markings, 159404449 edges, 671315 markings/sec, 90 secs
lola: 65772234 markings, 167719179 edges, 652135 markings/sec, 95 secs
lola: 68956162 markings, 175838193 edges, 636786 markings/sec, 100 secs
lola: 72131316 markings, 183934832 edges, 635031 markings/sec, 105 secs
lola: 75261190 markings, 191916010 edges, 625975 markings/sec, 110 secs
lola: 78437725 markings, 200016179 edges, 635307 markings/sec, 115 secs
lola: 81722961 markings, 208393535 edges, 657047 markings/sec, 120 secs
lola: 84909721 markings, 216519765 edges, 637352 markings/sec, 125 secs
lola: 86963713 markings, 221761178 edges, 410798 markings/sec, 130 secs
lola: 87982445 markings, 224355783 edges, 203746 markings/sec, 135 secs
lola: 88730162 markings, 226262413 edges, 149543 markings/sec, 140 secs
lola: 91448744 markings, 233194575 edges, 543716 markings/sec, 145 secs
lola: 93063777 markings, 237312612 edges, 323007 markings/sec, 150 secs
lola: 93871843 markings, 239373171 edges, 161613 markings/sec, 155 secs
lola: 96193427 markings, 245293214 edges, 464317 markings/sec, 160 secs
lola: 96960472 markings, 247249183 edges, 153409 markings/sec, 165 secs
lola: 96960472 markings, 247249183 edges, 0 markings/sec, 170 secs
lola: 96993457 markings, 247333285 edges, 6597 markings/sec, 175 secs
lola: 97615423 markings, 248919300 edges, 124393 markings/sec, 180 secs
lola: 99273409 markings, 253147168 edges, 331597 markings/sec, 185 secs
lola: 99273409 markings, 253147168 edges, 0 markings/sec, 190 secs
lola: 100900290 markings, 257295711 edges, 325376 markings/sec, 195 secs
lola: 103007117 markings, 262668122 edges, 421365 markings/sec, 200 secs
lola: 103007117 markings, 262668122 edges, 0 markings/sec, 205 secs
lola: 103007117 markings, 262668122 edges, 0 markings/sec, 210 secs
lola: 103696290 markings, 264425515 edges, 137835 markings/sec, 215 secs
lola: 103696290 markings, 264425515 edges, 0 markings/sec, 220 secs
lola: 103721241 markings, 264489142 edges, 4990 markings/sec, 225 secs
lola: 105260847 markings, 268415141 edges, 307921 markings/sec, 230 secs
lola: 105420996 markings, 268823515 edges, 32030 markings/sec, 235 secs
lola: 105434649 markings, 268858327 edges, 2731 markings/sec, 240 secs
lola: 107258912 markings, 273510203 edges, 364853 markings/sec, 245 secs
lola: 107258912 markings, 273510203 edges, 0 markings/sec, 250 secs
lola: 107258912 markings, 273510203 edges, 0 markings/sec, 255 secs
lola: 107967788 markings, 275317836 edges, 141775 markings/sec, 260 secs
lola: 107994290 markings, 275385411 edges, 5300 markings/sec, 265 secs
lola: 108198785 markings, 275906874 edges, 40899 markings/sec, 270 secs
lola: 108224416 markings, 275972237 edges, 5126 markings/sec, 275 secs
lola: 108294417 markings, 276150730 edges, 14000 markings/sec, 280 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 9 will run for 462 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E (F ((p31 <= p44))) OR (1 <= p33))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 9 will run for 462 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (1 <= p33)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (1 <= p33)
lola: processed formula length: 10
lola: 19 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: subprocess 10 will run for 539 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((p31 <= p44)))
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 ((p31 <= p44)))
lola: processed formula length: 20
lola: 20 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: (p31 <= p44)
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: 78 markings, 77 edges
lola: state equation: write sara problem file to CTLCardinality-10-0.sara
lola: state equation: calling and running sara
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 10 will run for 539 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E (((1 <= p17) U (3 <= p15))) OR ((p36 <= p1) OR (2 <= p13)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 10 will run for 539 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((p36 <= p1) OR (2 <= p13))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: rewrite Frontend/Parser/formula_rewrite.k:797
lola: processed formula: ((p36 <= p1) OR (2 <= p13))
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 11 will run for 647 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (((1 <= p17) U (3 <= p15)))
lola: ========================================
lola: SUBTASK
lola: checking existential until
lola: rewrite Frontend/Parser/formula_rewrite.k:618
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: rewrite Frontend/Parser/formula_rewrite.k:738
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: E (((1 <= p17) U (3 <= p15)))
lola: processed formula length: 29
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 /EU)
lola: state space: using reachability graph (EU version) (--search=depth)
lola: state space: using eu preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (3 <= p15)
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-11-0.sara
lola: state equation: calling and running sara
sara: try reading problem file CTLCardinality-11-0.sara.
sara: try reading problem file CTLCardinality-10-0.sara.
sara: place or transition ordering is non-deterministic
sara: place or transition ordering is non-deterministic


lola: state equation 0: solution produced
lola: sara is running 0 secs || 5123118 markings, 7940817 edges, 1024624 markings/sec, 0 secs
lola: sara is running 5 secs || 10043841 markings, 15567938 edges, 984145 markings/sec, 5 secs
lola: sara is running 10 secs || 14932851 markings, 23145899 edges, 977802 markings/sec, 10 secs
lola: sara is running 15 secs || 19882232 markings, 30817438 edges, 989876 markings/sec, 15 secs
lola: sara is running 20 secs || 24866469 markings, 38543014 edges, 996847 markings/sec, 20 secs
lola: sara is running 25 secs || 29751765 markings, 46115215 edges, 977059 markings/sec, 25 secs
lola: sara is running 30 secs || 34605735 markings, 53638870 edges, 970794 markings/sec, 30 secs
lola: sara is running 35 secs || 39404113 markings, 61076358 edges, 959676 markings/sec, 35 secs
lola: sara is running 40 secs || 44325613 markings, 68704674 edges, 984300 markings/sec, 40 secs
lola: sara is running 45 secs || 49140491 markings, 76167741 edges, 962976 markings/sec, 45 secs
lola: sara is running 50 secs || 53963949 markings, 83644097 edges, 964692 markings/sec, 50 secs
lola: sara is running 55 secs || 58872831 markings, 91252863 edges, 981776 markings/sec, 55 secs
lola: sara is running 60 secs || 63845879 markings, 98961092 edges, 994610 markings/sec, 60 secs
lola: sara is running 65 secs || 68669457 markings, 106437641 edges, 964716 markings/sec, 65 secs
lola: sara is running 70 secs || 73481840 markings, 113896832 edges, 962477 markings/sec, 70 secs
lola: sara is running 75 secs || 78186857 markings, 121189613 edges, 941003 markings/sec, 75 secs
lola: sara is running 80 secs || 83101504 markings, 128807311 edges, 982929 markings/sec, 80 secs
lola: sara is running 85 secs || 87913246 markings, 136265510 edges, 962348 markings/sec, 85 secs
lola: sara is running 90 secs || 92754947 markings, 143770150 edges, 968340 markings/sec, 90 secs
lola: sara is running 95 secs || 97810649 markings, 151606474 edges, 1011140 markings/sec, 95 secs
lola: sara is running 100 secs || 102974754 markings, 159610840 edges, 1032821 markings/sec, 100 secs
lola: sara is running 105 secs || 107949857 markings, 167322251 edges, 995021 markings/sec, 105 secs
lola: sara is running 110 secs || 112983594 markings, 175124547 edges, 1006747 markings/sec, 110 secs
lola: sara is running 115 secs || 118006533 markings, 182910107 edges, 1004588 markings/sec, 115 secs
lola: sara is running 120 secs || 123082931 markings, 190778524 edges, 1015280 markings/sec, 120 secs
lola: sara is running 125 secs || 126140036 markings, 195517028 edges, 611421 markings/sec, 125 secs
lola: sara is running 130 secs || 127073057 markings, 196963215 edges, 186604 markings/sec, 130 secs
lola: sara is running 135 secs || 128479507 markings, 199143210 edges, 281290 markings/sec, 135 secs
lola: sara is running 140 secs || 130466487 markings, 202223031 edges, 397396 markings/sec, 140 secs
lola: sara is running 145 secs || 133298029 markings, 206611917 edges, 566308 markings/sec, 145 secs
lola: sara is running 150 secs || 133515108 markings, 206948385 edges, 43416 markings/sec, 150 secs
lola: sara is running 155 secs || 133515108 markings, 206948385 edges, 0 markings/sec, 155 secs
lola: sara is running 160 secs || 133536985 markings, 206982297 edges, 4375 markings/sec, 160 secs
lola: sara is running 165 secs || 137616531 markings, 213305594 edges, 815909 markings/sec, 165 secs
lola: sara is running 170 secs || 142251178 markings, 220489301 edges, 926929 markings/sec, 170 secs
lola: sara is running 175 secs || 142443648 markings, 220787631 edges, 38494 markings/sec, 175 secs
lola: sara is running 180 secs || 142443648 markings, 220787631 edges, 0 markings/sec, 180 secs
lola: sara is running 185 secs || 142481997 markings, 220847063 edges, 7670 markings/sec, 185 secs
lola: sara is running 190 secs || 145042567 markings, 224815952 edges, 512114 markings/sec, 190 secs
lola: sara is running 195 secs || 145606741 markings, 225690425 edges, 112835 markings/sec, 195 secs
lola: sara is running 200 secs || 149670813 markings, 231989734 edges, 812814 markings/sec, 200 secs
lola: sara is running 205 secs || 149868366 markings, 232295942 edges, 39511 markings/sec, 205 secs
lola: sara is running 210 secs || 150041315 markings, 232564016 edges, 34590 markings/sec, 210 secs
lola: sara is running 215 secs || 153800706 markings, 238391066 edges, 751878 markings/sec, 215 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: subprocess 11 will run for 591 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E ((((p48 <= 2) AND (p23 <= 2)) U ((p13 + 1 <= p10) AND ((2 <= p37) OR (1 <= p48)))))
lola: ========================================
lola: SUBTASK
lola: checking existential until
lola: rewrite Frontend/Parser/formula_rewrite.k:618
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: rewrite Frontend/Parser/formula_rewrite.k:738
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: E ((((p48 <= 2) AND (p23 <= 2)) U ((p13 + 1 <= p10) AND ((2 <= p37) OR (1 <= p48)))))
lola: processed formula length: 86
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 /EU)
lola: state space: using reachability graph (EU version) (--search=depth)
lola: state space: using eu preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((p13 + 1 <= p10) AND ((2 <= p37) OR (1 <= p48)))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 4 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to CTLCardinality-11-0.sara
lola: state equation: calling and running sara
sara: try reading problem file CTLCardinality-11-0.sara.
sara: place or transition ordering is non-deterministic

lola: state equation 0: solution produced
lola: sara is running 0 secs || 4974475 markings, 7770715 edges, 994895 markings/sec, 0 secs
lola: sara is running 5 secs || 9930521 markings, 15512657 edges, 991209 markings/sec, 5 secs
lola: sara is running 10 secs || 14966075 markings, 23378804 edges, 1007111 markings/sec, 10 secs
lola: sara is running 15 secs || 20240915 markings, 31618751 edges, 1054968 markings/sec, 15 secs
lola: sara is running 20 secs || 25387450 markings, 39658268 edges, 1029307 markings/sec, 20 secs
lola: sara is running 25 secs || 30457756 markings, 47578694 edges, 1014061 markings/sec, 25 secs
lola: sara is running 30 secs || 35649386 markings, 55688654 edges, 1038326 markings/sec, 30 secs
lola: sara is running 35 secs || 40729942 markings, 63625101 edges, 1016111 markings/sec, 35 secs
lola: sara is running 40 secs || 45916656 markings, 71727371 edges, 1037343 markings/sec, 40 secs
lola: sara is running 45 secs || 51179701 markings, 79948888 edges, 1052609 markings/sec, 45 secs
lola: sara is running 50 secs || 56308423 markings, 87960578 edges, 1025744 markings/sec, 50 secs
lola: sara is running 55 secs || 61361662 markings, 95854346 edges, 1010648 markings/sec, 55 secs
lola: sara is running 60 secs || 66444194 markings, 103793884 edges, 1016506 markings/sec, 60 secs
lola: sara is running 65 secs || 71540618 markings, 111755116 edges, 1019285 markings/sec, 65 secs
lola: sara is running 70 secs || 76652767 markings, 119740904 edges, 1022430 markings/sec, 70 secs
lola: sara is running 75 secs || 81921173 markings, 127970800 edges, 1053681 markings/sec, 75 secs
lola: sara is running 80 secs || 87111593 markings, 136078872 edges, 1038084 markings/sec, 80 secs
lola: sara is running 85 secs || 92299359 markings, 144182788 edges, 1037553 markings/sec, 85 secs
lola: sara is running 90 secs || 97510814 markings, 152323719 edges, 1042291 markings/sec, 90 secs
lola: sara is running 95 secs || 102651846 markings, 160354634 edges, 1028206 markings/sec, 95 secs
lola: sara is running 100 secs || 107861743 markings, 168493119 edges, 1041979 markings/sec, 100 secs
lola: sara is running 105 secs || 113106441 markings, 176685982 edges, 1048940 markings/sec, 105 secs
lola: sara is running 110 secs || 118353210 markings, 184882067 edges, 1049354 markings/sec, 110 secs
lola: sara is running 115 secs || 121924191 markings, 190460378 edges, 714196 markings/sec, 115 secs
lola: sara is running 120 secs || 126556426 markings, 197696492 edges, 926447 markings/sec, 120 secs
lola: sara is running 125 secs || 126775708 markings, 198039039 edges, 43856 markings/sec, 125 secs
lola: sara is running 130 secs || 126775708 markings, 198039039 edges, 0 markings/sec, 130 secs
lola: sara is running 135 secs || 126775708 markings, 198039039 edges, 0 markings/sec, 135 secs
lola: sara is running 140 secs || 127026472 markings, 198430758 edges, 50153 markings/sec, 140 secs
lola: sara is running 145 secs || 131726430 markings, 205772660 edges, 939992 markings/sec, 145 secs
lola: sara is running 150 secs || 131875272 markings, 206005167 edges, 29768 markings/sec, 150 secs
lola: sara is running 155 secs || 131875272 markings, 206005167 edges, 0 markings/sec, 155 secs
lola: sara is running 160 secs || 131875272 markings, 206005167 edges, 0 markings/sec, 160 secs
lola: sara is running 165 secs || 131875272 markings, 206005167 edges, 0 markings/sec, 165 secs
lola: sara is running 170 secs || 131875272 markings, 206005167 edges, 0 markings/sec, 170 secs
lola: sara is running 175 secs || 132684816 markings, 207269778 edges, 161909 markings/sec, 175 secs
lola: sara is running 180 secs || 136308543 markings, 212930479 edges, 724745 markings/sec, 180 secs
lola: sara is running 185 secs || 136308543 markings, 212930479 edges, 0 markings/sec, 185 secs
lola: sara is running 190 secs || 136308543 markings, 212930479 edges, 0 markings/sec, 190 secs
lola: sara is running 195 secs || 136308543 markings, 212930479 edges, 0 markings/sec, 195 secs
lola: sara is running 200 secs || 137574644 markings, 214908289 edges, 253220 markings/sec, 200 secs
lola: sara is running 205 secs || 141207522 markings, 220583276 edges, 726576 markings/sec, 205 secs
lola: sara is running 210 secs || 141207522 markings, 220583276 edges, 0 markings/sec, 210 secs
lola: sara is running 215 secs || 141207522 markings, 220583276 edges, 0 markings/sec, 215 secs
lola: sara is running 220 secs || 141740983 markings, 221416606 edges, 106692 markings/sec, 220 secs
lola: sara is running 225 secs || 143563543 markings, 224263669 edges, 364512 markings/sec, 225 secs
lola: sara is running 230 secs || 143563543 markings, 224263669 edges, 0 markings/sec, 230 secs
lola: sara is running 235 secs || 145607643 markings, 227456796 edges, 408820 markings/sec, 235 secs
lola: sara is running 240 secs || 148748332 markings, 232362940 edges, 628138 markings/sec, 240 secs
lola: sara is running 245 secs || 148748332 markings, 232362940 edges, 0 markings/sec, 245 secs
lola: sara is running 250 secs || 148748332 markings, 232362940 edges, 0 markings/sec, 250 secs
lola: sara is running 255 secs || 148748332 markings, 232362940 edges, 0 markings/sec, 255 secs
lola: sara is running 260 secs || 150589489 markings, 235239049 edges, 368231 markings/sec, 260 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 12 will run for 667 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (((p8 <= 1) AND (p12 <= p7)) AND E (F ((p6 <= p25))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 12 will run for 667 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((p8 <= 1) AND (p12 <= p7))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((p8 <= 1) AND (p12 <= p7))
lola: processed formula length: 27
lola: 19 rewrites
lola: closed formula file CTLCardinality.xml
lola: processed formula with 2 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: subprocess 13 will run for 889 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((p6 <= p25)))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: ========================================
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: processed formula: E (F ((p6 <= p25)))
lola: processed formula length: 19
lola: 20 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: (p6 <= p25)
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: 55 markings, 54 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 13 will run for 889 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E ((((p24 <= p10) OR (p19 <= p41)) U (3 <= p25))) AND (2 <= p6))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 13 will run for 889 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (2 <= p6)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (2 <= p6)
lola: processed formula length: 9
lola: 19 rewrites
lola: closed formula file CTLCardinality.xml
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 14 will run for 1334 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E ((((p24 <= p10) OR (p19 <= p41)) U (3 <= p25)))
lola: ========================================
lola: SUBTASK
lola: checking existential until
lola: rewrite Frontend/Parser/formula_rewrite.k:618
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: rewrite Frontend/Parser/formula_rewrite.k:738
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: E ((((p24 <= p10) OR (p19 <= p41)) U (3 <= p25)))
lola: processed formula length: 50
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 /EU)
lola: state space: using reachability graph (EU version) (--search=depth)
lola: state space: using eu preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (3 <= p25)
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-14-0.sara
lola: state equation: calling and running sara
sara: try reading problem file CTLCardinality-14-0.sara.
sara: place or transition ordering is non-deterministic

lola: state equation 0: solution produced
lola: sara is running 0 secs || 5464622 markings, 8470147 edges, 1092924 markings/sec, 0 secs
lola: sara is running 5 secs || 10587403 markings, 16410450 edges, 1024556 markings/sec, 5 secs
lola: sara is running 10 secs || 15940361 markings, 24707532 edges, 1070592 markings/sec, 10 secs
lola: sara is running 15 secs || 21291688 markings, 33002101 edges, 1070265 markings/sec, 15 secs
lola: sara is running 20 secs || 26568931 markings, 41181816 edges, 1055449 markings/sec, 20 secs
lola: sara is running 25 secs || 31730244 markings, 49181855 edges, 1032263 markings/sec, 25 secs
lola: sara is running 30 secs || 36631761 markings, 56779216 edges, 980303 markings/sec, 30 secs
lola: sara is running 35 secs || 41583060 markings, 64453731 edges, 990260 markings/sec, 35 secs
lola: sara is running 40 secs || 46631238 markings, 72278396 edges, 1009636 markings/sec, 40 secs
lola: sara is running 45 secs || 51588872 markings, 79962727 edges, 991527 markings/sec, 45 secs
lola: sara is running 50 secs || 56344441 markings, 87333864 edges, 951114 markings/sec, 50 secs
lola: sara is running 55 secs || 61258066 markings, 94949979 edges, 982725 markings/sec, 55 secs
lola: sara is running 60 secs || 66177161 markings, 102574575 edges, 983819 markings/sec, 60 secs
lola: sara is running 65 secs || 70944340 markings, 109963705 edges, 953436 markings/sec, 65 secs
lola: sara is running 70 secs || 75967349 markings, 117749365 edges, 1004602 markings/sec, 70 secs
lola: sara is running 75 secs || 81149156 markings, 125781178 edges, 1036361 markings/sec, 75 secs
lola: sara is running 80 secs || 86043743 markings, 133367779 edges, 978917 markings/sec, 80 secs
lola: sara is running 85 secs || 90939152 markings, 140955657 edges, 979082 markings/sec, 85 secs
lola: sara is running 90 secs || 95779412 markings, 148458065 edges, 968052 markings/sec, 90 secs
lola: sara is running 95 secs || 101138448 markings, 156764568 edges, 1071807 markings/sec, 95 secs
lola: sara is running 100 secs || 106219997 markings, 164640965 edges, 1016310 markings/sec, 100 secs
lola: sara is running 105 secs || 111281048 markings, 172485595 edges, 1012210 markings/sec, 105 secs
lola: sara is running 110 secs || 116303105 markings, 180269795 edges, 1004411 markings/sec, 110 secs
lola: sara is running 115 secs || 121361911 markings, 188110932 edges, 1011761 markings/sec, 115 secs
lola: sara is running 120 secs || 126249616 markings, 195686878 edges, 977541 markings/sec, 120 secs
lola: sara is running 125 secs || 130787025 markings, 202719868 edges, 907482 markings/sec, 125 secs
lola: sara is running 130 secs || 131134653 markings, 203258691 edges, 69526 markings/sec, 130 secs
lola: sara is running 135 secs || 131134653 markings, 203258691 edges, 0 markings/sec, 135 secs
lola: sara is running 140 secs || 131982895 markings, 204573457 edges, 169648 markings/sec, 140 secs
lola: sara is running 145 secs || 134978654 markings, 209216890 edges, 599152 markings/sec, 145 secs
lola: sara is running 150 secs || 139526384 markings, 216265870 edges, 909546 markings/sec, 150 secs
lola: sara is running 155 secs || 139745254 markings, 216605113 edges, 43774 markings/sec, 155 secs
lola: sara is running 160 secs || 139745254 markings, 216605113 edges, 0 markings/sec, 160 secs
lola: sara is running 165 secs || 140423992 markings, 217657157 edges, 135748 markings/sec, 165 secs
lola: sara is running 170 secs || 143712241 markings, 222753943 edges, 657650 markings/sec, 170 secs
lola: sara is running 175 secs || 143712241 markings, 222753943 edges, 0 markings/sec, 175 secs
lola: sara is running 180 secs || 143712241 markings, 222753943 edges, 0 markings/sec, 180 secs
lola: sara is running 185 secs || 143712241 markings, 222753943 edges, 0 markings/sec, 185 secs
lola: sara is running 190 secs || 146614561 markings, 227252548 edges, 580464 markings/sec, 190 secs
lola: sara is running 195 secs || 147814472 markings, 229112403 edges, 239982 markings/sec, 195 secs
lola: sara is running 200 secs || 147814472 markings, 229112403 edges, 0 markings/sec, 200 secs
lola: sara is running 205 secs || 147814472 markings, 229112403 edges, 0 markings/sec, 205 secs
lola: sara is running 210 secs || 151063187 markings, 234147922 edges, 649743 markings/sec, 210 secs
lola: sara is running 215 secs || 151256823 markings, 234448049 edges, 38727 markings/sec, 215 secs
lola: sara is running 220 secs || 151309921 markings, 234530349 edges, 10620 markings/sec, 220 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: subprocess 14 will run for 1209 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((A (G ((3 <= p21))) OR ((1 <= p20) AND (1 <= p30) AND (p28 <= p53)))))
lola: ========================================
lola: SUBTASK
lola: checking a universal CTL formula with single counterexample path (use LTL...)
lola: rewrite Frontend/Parser/formula_rewrite.k:679
lola: rewrite Frontend/Parser/formula_rewrite.k:679
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((G ((3 <= p21)) OR ((1 <= p20) AND (1 <= p30) AND (p28 <= p53))))
lola: processed formula length: 68
lola: 21 rewrites
lola: closed formula file CTLCardinality.xml
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The universal single path CTL formula does not hold.
lola: 6532 markings, 9305 edges
lola: ========================================
lola: subprocess 15 will run for 2419 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E ((((p34 <= p18) AND (p25 <= p43)) U (p42 <= p38))) AND E (((p2 + 1 <= p49) R (p29 <= 2))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 15 will run for 2419 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (((p2 + 1 <= p49) R (p29 <= 2)))
lola: ========================================
lola: SUBTASK
lola: checking existential release
lola: rewrite Frontend/Parser/formula_rewrite.k:576
lola: rewrite Frontend/Parser/formula_rewrite.k:736
lola: rewrite Frontend/Parser/formula_rewrite.k:696
lola: processed formula: E (((p2 + 1 <= p49) R (p29 <= 2)))
lola: processed formula length: 34
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 /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:788
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: 1
lola: SUBRESULT
lola: result: yes
lola: produced by: state space /ER
lola: There is a path where Predicate Phi releases Predicate Psi.
lola: 4 markings, 4 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: ========================================
lola: ...considering subproblem: A (G ((E (G ((2 <= p49))) OR ((p43 <= p9) OR ((p11 <= p21) OR ((p10 <= p1) AND (p19 <= p52)))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:808
lola: rewrite Frontend/Parser/formula_rewrite.k:813
lola: processed formula: AG((EG((2 <= p49)) OR ((p43 <= p9) OR ((p11 <= p21) OR ((p10 <= p1) AND (p19 <= p52))))))
lola: processed formula length: 89
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 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: 3394246 markings, 8655314 edges, 678849 markings/sec, 0 secs
lola: 6687993 markings, 17055469 edges, 658749 markings/sec, 5 secs
lola: 9938604 markings, 25343414 edges, 650122 markings/sec, 10 secs
lola: 13204662 markings, 33671867 edges, 653212 markings/sec, 15 secs
lola: 16444032 markings, 41932258 edges, 647874 markings/sec, 20 secs
lola: 19750694 markings, 50364237 edges, 661332 markings/sec, 25 secs
lola: 23033179 markings, 58734573 edges, 656497 markings/sec, 30 secs
lola: 26227809 markings, 66880885 edges, 638926 markings/sec, 35 secs
lola: 29391804 markings, 74949080 edges, 632799 markings/sec, 40 secs
lola: 32562441 markings, 83034209 edges, 634127 markings/sec, 45 secs
lola: 35662527 markings, 90939428 edges, 620017 markings/sec, 50 secs
lola: 38790997 markings, 98917023 edges, 625694 markings/sec, 55 secs
lola: 42061263 markings, 107256196 edges, 654053 markings/sec, 60 secs
lola: 45181656 markings, 115213205 edges, 624079 markings/sec, 65 secs
lola: 48280368 markings, 123114916 edges, 619742 markings/sec, 70 secs
lola: 51418346 markings, 131116752 edges, 627596 markings/sec, 75 secs
lola: 54592019 markings, 139209619 edges, 634735 markings/sec, 80 secs
lola: 57832092 markings, 147471807 edges, 648015 markings/sec, 85 secs
lola: 61108154 markings, 155825770 edges, 655212 markings/sec, 90 secs
lola: 64382248 markings, 164174707 edges, 654819 markings/sec, 95 secs
lola: 67662282 markings, 172538800 edges, 656007 markings/sec, 100 secs
lola: 70821026 markings, 180593592 edges, 631749 markings/sec, 105 secs
lola: 74114293 markings, 188991424 edges, 658653 markings/sec, 110 secs
lola: 77387657 markings, 197338506 edges, 654673 markings/sec, 115 secs
lola: 80631024 markings, 205609085 edges, 648673 markings/sec, 120 secs
lola: 83938570 markings, 214043324 edges, 661509 markings/sec, 125 secs
lola: 87087745 markings, 222073725 edges, 629835 markings/sec, 130 secs
lola: 88424688 markings, 225486586 edges, 267389 markings/sec, 135 secs
lola: 91301647 markings, 232819665 edges, 575392 markings/sec, 140 secs
lola: 91904138 markings, 234355526 edges, 120498 markings/sec, 145 secs
lola: 92098820 markings, 234851969 edges, 38936 markings/sec, 150 secs
lola: 93897392 markings, 239438320 edges, 359714 markings/sec, 155 secs
lola: 94607255 markings, 241248477 edges, 141973 markings/sec, 160 secs
lola: 94688182 markings, 241454836 edges, 16185 markings/sec, 165 secs
lola: 97166822 markings, 247775363 edges, 495728 markings/sec, 170 secs
lola: 100299929 markings, 255764784 edges, 626621 markings/sec, 175 secs
lola: 100445964 markings, 256137183 edges, 29207 markings/sec, 180 secs
lola: 100445964 markings, 256137183 edges, 0 markings/sec, 185 secs
lola: 101195985 markings, 258049738 edges, 150004 markings/sec, 190 secs
lola: 103911243 markings, 264973643 edges, 543052 markings/sec, 195 secs
lola: 103911243 markings, 264973643 edges, 0 markings/sec, 200 secs
lola: 103911243 markings, 264973643 edges, 0 markings/sec, 205 secs
lola: 105682524 markings, 269490415 edges, 354256 markings/sec, 210 secs
lola: 107012319 markings, 272881387 edges, 265959 markings/sec, 215 secs
lola: 107012319 markings, 272881387 edges, 0 markings/sec, 220 secs
lola: 107032870 markings, 272933789 edges, 4110 markings/sec, 225 secs
lola: 108349915 markings, 276292257 edges, 263409 markings/sec, 230 secs
lola: Child process aborted or communication problem between parent and child process
lola: ========================================
lola: ...considering subproblem: (E (((1 <= p17) U (3 <= p15))) OR ((p36 <= p1) OR (2 <= p13)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: ...considering subproblem: ((p36 <= p1) OR (2 <= p13))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: rewrite Frontend/Parser/formula_rewrite.k:797
lola: processed formula: ((p36 <= p1) OR (2 <= p13))
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: E (((1 <= p17) U (3 <= p15)))
lola: ========================================
lola: SUBTASK
lola: checking existential until
lola: rewrite Frontend/Parser/formula_rewrite.k:618
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: rewrite Frontend/Parser/formula_rewrite.k:738
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: E (((1 <= p17) U (3 <= p15)))
lola: processed formula length: 29
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 /EU)
lola: state space: using reachability graph (EU version) (--search=depth)
lola: state space: using eu preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (3 <= p15)
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: state equation 0: solution produced
lola: sara is running 0 secs || 5020221 markings, 7781317 edges, 1004044 markings/sec, 0 secs
lola: sara is running 5 secs || 9953304 markings, 15427605 edges, 986617 markings/sec, 5 secs
lola: sara is running 10 secs || 14883552 markings, 23069487 edges, 986050 markings/sec, 10 secs
lola: sara is running 15 secs || 19888702 markings, 30827464 edges, 1001030 markings/sec, 15 secs
lola: sara is running 20 secs || 24883228 markings, 38568981 edges, 998905 markings/sec, 20 secs
lola: sara is running 25 secs || 29686324 markings, 46013780 edges, 960619 markings/sec, 25 secs
lola: sara is running 30 secs || 34469957 markings, 53428420 edges, 956727 markings/sec, 30 secs
lola: sara is running 35 secs || 39220470 markings, 60791708 edges, 950103 markings/sec, 35 secs
lola: sara is running 40 secs || 44120980 markings, 68387501 edges, 980102 markings/sec, 40 secs
lola: sara is running 45 secs || 49047168 markings, 76023092 edges, 985238 markings/sec, 45 secs
lola: sara is running 50 secs || 53989723 markings, 83684046 edges, 988511 markings/sec, 50 secs
lola: sara is running 55 secs || 59071936 markings, 91561478 edges, 1016443 markings/sec, 55 secs
lola: sara is running 60 secs || 63971078 markings, 99155146 edges, 979828 markings/sec, 60 secs
lola: sara is running 65 secs || 68794460 markings, 106631384 edges, 964676 markings/sec, 65 secs
lola: sara is running 70 secs || 73636610 markings, 114136721 edges, 968430 markings/sec, 70 secs
lola: sara is running 75 secs || 78402817 markings, 121524338 edges, 953241 markings/sec, 75 secs
lola: sara is running 80 secs || 83414685 markings, 129292736 edges, 1002374 markings/sec, 80 secs
lola: sara is running 85 secs || 88246006 markings, 136781292 edges, 966264 markings/sec, 85 secs
lola: sara is running 90 secs || 93024567 markings, 144188055 edges, 955712 markings/sec, 90 secs
lola: sara is running 95 secs || 98154925 markings, 152140106 edges, 1026072 markings/sec, 95 secs
lola: sara is running 100 secs || 103381951 markings, 160242001 edges, 1045405 markings/sec, 100 secs
lola: sara is running 105 secs || 108401733 markings, 168022663 edges, 1003956 markings/sec, 105 secs
lola: sara is running 110 secs || 113418801 markings, 175799124 edges, 1003414 markings/sec, 110 secs
lola: sara is running 115 secs || 118244452 markings, 183278877 edges, 965130 markings/sec, 115 secs
lola: sara is running 120 secs || 123113782 markings, 190826336 edges, 973866 markings/sec, 120 secs
lola: sara is running 125 secs || 124728975 markings, 193329887 edges, 323039 markings/sec, 125 secs
lola: sara is running 130 secs || 129033464 markings, 200001837 edges, 860898 markings/sec, 130 secs
lola: sara is running 135 secs || 133584814 markings, 207056440 edges, 910270 markings/sec, 135 secs
lola: sara is running 140 secs || 137861992 markings, 213686068 edges, 855436 markings/sec, 140 secs
lola: sara is running 145 secs || 141688808 markings, 219617626 edges, 765363 markings/sec, 145 secs
lola: sara is running 150 secs || 141688808 markings, 219617626 edges, 0 markings/sec, 150 secs
lola: sara is running 155 secs || 142669076 markings, 221137042 edges, 196054 markings/sec, 155 secs
lola: sara is running 160 secs || 146254970 markings, 226695179 edges, 717179 markings/sec, 160 secs
lola: sara is running 165 secs || 146254970 markings, 226695179 edges, 0 markings/sec, 165 secs
lola: sara is running 170 secs || 146254970 markings, 226695179 edges, 0 markings/sec, 170 secs
lola: sara is running 175 secs || 148787731 markings, 230620963 edges, 506552 markings/sec, 175 secs
lola: sara is running 180 secs || 150649200 markings, 233506230 edges, 372294 markings/sec, 180 secs
lola: sara is running 185 secs || 150649200 markings, 233506230 edges, 0 markings/sec, 185 secs
lola: sara is running 190 secs || 150649200 markings, 233506230 edges, 0 markings/sec, 190 secs
lola: sara is running 195 secs || 152621091 markings, 236562671 edges, 394378 markings/sec, 195 secs
lola: sara is running 200 secs || 153853988 markings, 238473656 edges, 246579 markings/sec, 200 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: E ((((p48 <= 2) AND (p23 <= 2)) U ((p13 + 1 <= p10) AND ((2 <= p37) OR (1 <= p48)))))
lola: ========================================
lola: SUBTASK
lola: checking existential until
lola: rewrite Frontend/Parser/formula_rewrite.k:618
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: rewrite Frontend/Parser/formula_rewrite.k:738
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: E ((((p48 <= 2) AND (p23 <= 2)) U ((p13 + 1 <= p10) AND ((2 <= p37) OR (1 <= p48)))))
lola: processed formula length: 86
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 /EU)
lola: state space: using reachability graph (EU version) (--search=depth)
lola: state space: using eu preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((p13 + 1 <= p10) AND ((2 <= p37) OR (1 <= p48)))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 4 literals and 2 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: state equation 0: solution produced
lola: sara is running 0 secs || 4891357 markings, 7640869 edges, 978271 markings/sec, 0 secs
lola: sara is running 5 secs || 9743676 markings, 15220792 edges, 970464 markings/sec, 5 secs
lola: sara is running 10 secs || 14606485 markings, 22817089 edges, 972562 markings/sec, 10 secs
lola: sara is running 15 secs || 19770276 markings, 30883550 edges, 1032758 markings/sec, 15 secs
lola: sara is running 20 secs || 24894586 markings, 38888349 edges, 1024862 markings/sec, 20 secs
lola: sara is running 25 secs || 29960817 markings, 46802419 edges, 1013246 markings/sec, 25 secs
lola: sara is running 30 secs || 35112525 markings, 54850010 edges, 1030342 markings/sec, 30 secs
lola: sara is running 35 secs || 40187087 markings, 62777089 edges, 1014912 markings/sec, 35 secs
lola: sara is running 40 secs || 45270252 markings, 70717609 edges, 1016633 markings/sec, 40 secs
lola: sara is running 45 secs || 50450488 markings, 78809770 edges, 1036047 markings/sec, 45 secs
lola: sara is running 50 secs || 55661152 markings, 86949455 edges, 1042133 markings/sec, 50 secs
lola: sara is running 55 secs || 60794271 markings, 94968018 edges, 1026624 markings/sec, 55 secs
lola: sara is running 60 secs || 65828748 markings, 102832487 edges, 1006895 markings/sec, 60 secs
lola: sara is running 65 secs || 70822211 markings, 110632874 edges, 998693 markings/sec, 65 secs
lola: sara is running 70 secs || 75883777 markings, 118539655 edges, 1012313 markings/sec, 70 secs
lola: sara is running 75 secs || 81296062 markings, 126994303 edges, 1082457 markings/sec, 75 secs
lola: sara is running 80 secs || 86848695 markings, 135668192 edges, 1110527 markings/sec, 80 secs
lola: sara is running 85 secs || 92087511 markings, 143851860 edges, 1047763 markings/sec, 85 secs
lola: sara is running 90 secs || 97237929 markings, 151897440 edges, 1030084 markings/sec, 90 secs
lola: sara is running 95 secs || 102481080 markings, 160087874 edges, 1048630 markings/sec, 95 secs
lola: sara is running 100 secs || 107947166 markings, 168626563 edges, 1093217 markings/sec, 100 secs
lola: sara is running 105 secs || 113497875 markings, 177297447 edges, 1110142 markings/sec, 105 secs
lola: sara is running 110 secs || 118726773 markings, 185465616 edges, 1045780 markings/sec, 110 secs
lola: sara is running 115 secs || 121828665 markings, 190311156 edges, 620378 markings/sec, 115 secs
lola: sara is running 120 secs || 125856710 markings, 196603444 edges, 805609 markings/sec, 120 secs
lola: sara is running 125 secs || 128358755 markings, 200511951 edges, 500409 markings/sec, 125 secs
lola: sara is running 130 secs || 128358755 markings, 200511951 edges, 0 markings/sec, 130 secs
lola: sara is running 135 secs || 130068427 markings, 203182662 edges, 341934 markings/sec, 135 secs
lola: sara is running 140 secs || 133195188 markings, 208067037 edges, 625352 markings/sec, 140 secs
lola: sara is running 145 secs || 137383900 markings, 214610325 edges, 837742 markings/sec, 145 secs
lola: sara is running 150 secs || 137543162 markings, 214859104 edges, 31852 markings/sec, 150 secs
lola: sara is running 155 secs || 137543162 markings, 214859104 edges, 0 markings/sec, 155 secs
lola: sara is running 160 secs || 137543162 markings, 214859104 edges, 0 markings/sec, 160 secs
lola: sara is running 165 secs || 140256464 markings, 219097610 edges, 542660 markings/sec, 165 secs
lola: sara is running 170 secs || 142303763 markings, 222295742 edges, 409460 markings/sec, 170 secs
lola: sara is running 175 secs || 142303763 markings, 222295742 edges, 0 markings/sec, 175 secs
lola: sara is running 180 secs || 142303763 markings, 222295742 edges, 0 markings/sec, 180 secs
lola: sara is running 185 secs || 145172165 markings, 226776528 edges, 573680 markings/sec, 185 secs
lola: sara is running 190 secs || 147266887 markings, 230048735 edges, 418944 markings/sec, 190 secs
lola: sara is running 195 secs || 150258742 markings, 234722380 edges, 598371 markings/sec, 195 secs
lola: Child process aborted or communication problem between parent and child process
lola: ========================================
lola: ...considering subproblem: (E ((((p24 <= p10) OR (p19 <= p41)) U (3 <= p25))) AND (2 <= p6))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: ...considering subproblem: (2 <= p6)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (2 <= p6)
lola: processed formula length: 9
lola: 19 rewrites
lola: closed formula file CTLCardinality.xml
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: ========================================
lola: ...considering subproblem: E ((((p24 <= p10) OR (p19 <= p41)) U (3 <= p25)))
lola: ========================================
lola: SUBTASK
lola: checking existential until
lola: rewrite Frontend/Parser/formula_rewrite.k:618
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: rewrite Frontend/Parser/formula_rewrite.k:738
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: E ((((p24 <= p10) OR (p19 <= p41)) U (3 <= p25)))
lola: processed formula length: 50
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 /EU)
lola: state space: using reachability graph (EU version) (--search=depth)
lola: state space: using eu preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (3 <= p25)
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-20-0.sara
lola: state equation: calling and running sara
sara: try reading problem file CTLCardinality-20-0.sara.
sara: place or transition ordering is non-deterministic

lola: state equation 0: solution produced
lola: sara is running 0 secs || 5202136 markings, 8063287 edges, 1040427 markings/sec, 0 secs
lola: sara is running 5 secs || 10299276 markings, 15963864 edges, 1019428 markings/sec, 5 secs
lola: sara is running 10 secs || 15337757 markings, 23773498 edges, 1007696 markings/sec, 10 secs
lola: sara is running 15 secs || 20472826 markings, 31732856 edges, 1027014 markings/sec, 15 secs
lola: sara is running 20 secs || 25545808 markings, 39595979 edges, 1014596 markings/sec, 20 secs
lola: sara is running 25 secs || 30449313 markings, 47196407 edges, 980701 markings/sec, 25 secs
lola: sara is running 30 secs || 35221788 markings, 54593749 edges, 954495 markings/sec, 30 secs
lola: sara is running 35 secs || 40080749 markings, 62125140 edges, 971792 markings/sec, 35 secs
lola: sara is running 40 secs || 45079098 markings, 69872580 edges, 999670 markings/sec, 40 secs
lola: sara is running 45 secs || 49967168 markings, 77449092 edges, 977614 markings/sec, 45 secs
lola: sara is running 50 secs || 54845054 markings, 85009810 edges, 975577 markings/sec, 50 secs
lola: sara is running 55 secs || 60063213 markings, 93097961 edges, 1043632 markings/sec, 55 secs
lola: sara is running 60 secs || 65059301 markings, 100841901 edges, 999218 markings/sec, 60 secs
lola: sara is running 65 secs || 70065926 markings, 108602160 edges, 1001325 markings/sec, 65 secs
lola: sara is running 70 secs || 74914686 markings, 116117742 edges, 969752 markings/sec, 70 secs
lola: sara is running 75 secs || 79812883 markings, 123709944 edges, 979639 markings/sec, 75 secs
lola: sara is running 80 secs || 84798773 markings, 131438080 edges, 997178 markings/sec, 80 secs
lola: sara is running 85 secs || 89869786 markings, 139298147 edges, 1014203 markings/sec, 85 secs
lola: sara is running 90 secs || 94798501 markings, 146937646 edges, 985743 markings/sec, 90 secs
lola: sara is running 95 secs || 99849355 markings, 154766482 edges, 1010171 markings/sec, 95 secs
lola: sara is running 100 secs || 104943815 markings, 162662890 edges, 1018892 markings/sec, 100 secs
lola: sara is running 105 secs || 110096417 markings, 170649424 edges, 1030520 markings/sec, 105 secs
lola: sara is running 110 secs || 115032176 markings, 178299845 edges, 987152 markings/sec, 110 secs
lola: sara is running 115 secs || 120062954 markings, 186097559 edges, 1006156 markings/sec, 115 secs
lola: sara is running 120 secs || 124874629 markings, 193555650 edges, 962335 markings/sec, 120 secs
lola: sara is running 125 secs || 126047934 markings, 195374267 edges, 234661 markings/sec, 125 secs
lola: sara is running 130 secs || 129047646 markings, 200023827 edges, 599942 markings/sec, 130 secs
lola: sara is running 135 secs || 133009499 markings, 206164700 edges, 792371 markings/sec, 135 secs
lola: sara is running 140 secs || 137331093 markings, 212863165 edges, 864319 markings/sec, 140 secs
lola: sara is running 145 secs || 137526459 markings, 213165987 edges, 39073 markings/sec, 145 secs
lola: sara is running 150 secs || 137526459 markings, 213165987 edges, 0 markings/sec, 150 secs
lola: sara is running 155 secs || 137526459 markings, 213165987 edges, 0 markings/sec, 155 secs
lola: sara is running 160 secs || 137559029 markings, 213216474 edges, 6514 markings/sec, 160 secs
lola: sara is running 165 secs || 141922870 markings, 219980421 edges, 872768 markings/sec, 165 secs
lola: sara is running 170 secs || 142051440 markings, 220179706 edges, 25714 markings/sec, 170 secs
lola: sara is running 175 secs || 142051440 markings, 220179706 edges, 0 markings/sec, 175 secs
lola: sara is running 180 secs || 146008585 markings, 226313284 edges, 791429 markings/sec, 180 secs
lola: sara is running 185 secs || 147554598 markings, 228709608 edges, 309203 markings/sec, 185 secs
lola: sara is running 190 secs || 150638927 markings, 233490308 edges, 616866 markings/sec, 190 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: (E ((((p34 <= p18) AND (p25 <= p43)) U (p42 <= p38))) AND E (((p2 + 1 <= p49) R (p29 <= 2))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: ...considering subproblem: E (((p2 + 1 <= p49) R (p29 <= 2)))
lola: ========================================
lola: SUBTASK
lola: checking existential release
lola: rewrite Frontend/Parser/formula_rewrite.k:576
lola: rewrite Frontend/Parser/formula_rewrite.k:736
lola: rewrite Frontend/Parser/formula_rewrite.k:696
lola: processed formula: E (((p2 + 1 <= p49) R (p29 <= 2)))
lola: processed formula length: 34
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 /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: 1
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: (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: SUBRESULT
lola: result: yes
lola: produced by: state space /ER
lola: There is a path where Predicate Phi releases Predicate Psi.
lola: 4 markings, 4 edges
lola: ========================================
lola: ========================================
lola: ...considering subproblem: E ((((p34 <= p18) AND (p25 <= p43)) U (p42 <= p38)))
lola: ========================================
lola: SUBTASK
lola: checking existential until
lola: rewrite Frontend/Parser/formula_rewrite.k:618
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: rewrite Frontend/Parser/formula_rewrite.k:738
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: E ((((p34 <= p18) AND (p25 <= p43)) U (p42 <= p38)))
lola: processed formula length: 52
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 /EU)
lola: state space: using reachability graph (EU version) (--search=depth)
lola: state space: using eu preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (p42 <= p38)
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: SUBRESULT
lola: result: yes
lola: produced by: state space /EU
lola: There is a path where Predicate Phi holds until Predicate Psi.
lola: 1210 markings, 1869 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: RESULT
lola:
SUMMARY: yes yes no yes unknown unknown unknown yes unknown yes yes no no yes yes yes
lola:
preliminary result: yes yes no yes unknown unknown unknown yes unknown yes yes no no yes yes yes
lola: ========================================
lola: memory consumption: 3932 KB
lola: time consumption: 2197 seconds
lola: print data as JSON (--json)
lola: writing JSON to CTLCardinality.json
lola: closed JSON file CTLCardinality.json
rslt: finished
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16427332 kB
MemFree: 16310532 kB
After kill :
MemTotal: 16427332 kB
MemFree: 16309768 kB

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

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="RefineWMG-PT-010010"
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-010010, 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-158987938400051"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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