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.r184-oct2-158987928600491.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 Kanban-PT-00010, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r184-oct2-158987928600491
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 204K
-rw-r--r-- 1 mcc users 3.8K Apr 8 12:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Apr 8 12:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.7K Apr 7 16:11 CTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 7 16:11 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 24 05:37 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 5.9K Mar 24 05:37 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.1K Apr 14 12:41 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 28 14:01 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Apr 14 12:41 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 28 14:01 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K Apr 6 19:12 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 19K Apr 6 19:12 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.4K Apr 6 02:32 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 23K Apr 6 02:32 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 6 20:24 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Apr 6 20:24 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 equiv_col
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 instance
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 iscolored
-rw-r--r-- 1 mcc users 14K Mar 24 05:37 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1591211129365

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-03 19:05:31] [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 19:05:31] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-03 19:05:31] [INFO ] Load time of PNML (sax parser for PT used): 23 ms
[2020-06-03 19:05:31] [INFO ] Transformed 16 places.
[2020-06-03 19:05:31] [INFO ] Transformed 16 transitions.
[2020-06-03 19:05:31] [INFO ] Parsed PT model containing 16 places and 16 transitions in 53 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 20 ms.
Incomplete random walk after 100008 steps, including 0 resets, run finished after 78 ms. (steps per millisecond=1282 ) properties seen :[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
// Phase 1: matrix 16 rows 16 cols
[2020-06-03 19:05:31] [INFO ] Computed 5 place invariants in 5 ms
[2020-06-03 19:05:31] [INFO ] [Real]Absence check using 4 positive place invariants in 9 ms returned unsat
[2020-06-03 19:05:31] [INFO ] [Real]Absence check using 4 positive place invariants in 4 ms returned sat
[2020-06-03 19:05:31] [INFO ] [Real]Absence check using 4 positive and 1 generalized place invariants in 1 ms returned sat
[2020-06-03 19:05:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 19:05:31] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2020-06-03 19:05:31] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 19:05:31] [INFO ] [Nat]Absence check using 4 positive place invariants in 5 ms returned unsat
Successfully simplified 2 atomic propositions for a total of 2 simplifications.
[2020-06-03 19:05:31] [INFO ] Initial state reduction rules for CTL removed 5 formulas.
[2020-06-03 19:05:32] [INFO ] Flatten gal took : 29 ms
[2020-06-03 19:05:32] [INFO ] Initial state reduction rules for CTL removed 5 formulas.
[2020-06-03 19:05:32] [INFO ] Flatten gal took : 4 ms
FORMULA Kanban-PT-00010-CTLCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Kanban-PT-00010-CTLCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Kanban-PT-00010-CTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Kanban-PT-00010-CTLCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Kanban-PT-00010-CTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-06-03 19:05:32] [INFO ] Export to MCC properties in file /home/mcc/execution/CTLCardinality.sr.xml took 2 ms.
[2020-06-03 19:05:32] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 1 ms.
info: Time: 3600 - MCC
vrfy: Checking CTLCardinality @ Kanban-PT-00010 @ 3570 seconds

FORMULA Kanban-PT-00010-CTLCardinality-05 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Kanban-PT-00010-CTLCardinality-09 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Kanban-PT-00010-CTLCardinality-07 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Kanban-PT-00010-CTLCardinality-02 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Kanban-PT-00010-CTLCardinality-04 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Kanban-PT-00010-CTLCardinality-06 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Kanban-PT-00010-CTLCardinality-00 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Kanban-PT-00010-CTLCardinality-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Kanban-PT-00010-CTLCardinality-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Kanban-PT-00010-CTLCardinality-01 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Kanban-PT-00010-CTLCardinality-03 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 2731
rslt: Output for CTLCardinality @ Kanban-PT-00010

{
"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 19:05:32 2020
",
"timelimit": 3570
},
"child":
[

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

{
"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": 1,
"aneg": 1,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "E (F (((p13 + 1 <= p11) AND (p4 + 1 <= p6))))",
"processed_size": 45,
"rewrites": 13
},
"result":
{
"edges": 49,
"markings": 49,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 1,
"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": 360
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "AX((p4 <= p13))",
"processed_size": 15,
"rewrites": 13
},
"net":
{
"conflict_clusters": 12,
"singleton_clusters": 0
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "CTL model checker",
"value": true
},
"task":
{
"compoundnumber": 2,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": true
},
"task":
{
"compoundnumber": 1,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 360
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 2,
"F": 0,
"G": 0,
"U": 1,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "E (X (E (((p10 <= p13) U (p0 <= p8)))))",
"processed_size": 39,
"rewrites": 15
},
"result":
{
"edges": 37,
"markings": 38,
"produced_by": "state space / EXEU",
"value": true
},
"task":
{
"compoundnumber": 2,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "eu preserving",
"visible": 2
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "existential_until_from_successors"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 463
},
"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 <= p10)))",
"processed_size": 18,
"rewrites": 13
},
"result":
{
"edges": 14,
"markings": 15,
"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": 540
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 1,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "A (G (((2 <= p4) OR (p11 <= p0))))",
"processed_size": 35,
"rewrites": 14
},
"result":
{
"edges": 46,
"markings": 47,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 5,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 2,
"problems": 2
},
"type": "invariance",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 648
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 2,
"aneg": 0,
"comp": 6,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 8,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 7,
"visible_transitions": 0
},
"processed": "A (G ((((p14 <= p0) OR (1 <= p14) OR (3 <= p8) OR (3 <= p4)) AND ((p13 <= p12) OR (p11 <= 2)))))",
"processed_size": 100,
"rewrites": 14
},
"result":
{
"edges": 23,
"markings": 22,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 6,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"type": "invariance",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 810
},
"exit":
{
"localtimelimitreached": false
},
"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": 4,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "E (((p10 <= p7) U ((2 <= p14) AND (1 <= p11))))",
"processed_size": 47,
"rewrites": 15
},
"result":
{
"edges": 62,
"markings": 63,
"produced_by": "state space /EU",
"value": true
},
"task":
{
"compoundnumber": 7,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "eu preserving",
"visible": 2
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 2,
"problems": 2
},
"type": "existential_until",
"workflow": "stateequation"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1081
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 2,
"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": "A ((((p15 + 1 <= p1) OR (p13 <= 2)) R (p12 <= 1)))",
"processed_size": 51,
"rewrites": 17
},
"result":
{
"edges": 880,
"markings": 286,
"produced_by": "state space /EU",
"value": true
},
"task":
{
"compoundnumber": 8,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "eu preserving",
"visible": 3
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "universal_release",
"workflow": "stateequation"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1621
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 0,
"G": 0,
"U": 1,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 7,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "E (((p14 + 1 <= p13) U ((p0 <= 1) AND (p13 <= p12) AND (p0 <= p4))))",
"processed_size": 68,
"rewrites": 15
},
"result":
{
"edges": 13554,
"markings": 6765,
"produced_by": "state space /EU",
"value": true
},
"task":
{
"compoundnumber": 9,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "eu preserving",
"visible": 2
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 3,
"problems": 3
},
"type": "existential_until",
"workflow": "stateequation"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3243
},
"exit":
{
"localtimelimitreached": false
},
"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": 5,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "E (((p2 <= p5) U ((3 <= p2) AND (p11 <= p2))))",
"processed_size": 46,
"rewrites": 15
},
"result":
{
"edges": 22109,
"markings": 10002,
"produced_by": "state space /EU",
"value": true
},
"task":
{
"compoundnumber": 10,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "eu preserving",
"visible": 3
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 2,
"problems": 2
},
"type": "existential_until",
"workflow": "stateequation"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": true
},
"task":
{
"compoundnumber": 10,
"type": "boolean"
}
}
],
"exit":
{
"error": null,
"memory": 3520,
"runtime": 839.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "CTLCardinality.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "E((** U **)) : (A(F(**)) OR E((** U **))) : E(F(**)) : E((A(X(**)) U A(G(**)))) : A(G(*)) : (A(X(**)) AND E(F(*))) : A(G(**)) : E(F(**)) : E(X(E((** U **)))) : A((* R *)) : E((** U **))"
},
"net":
{
"arcs": 40,
"conflict_clusters": 12,
"places": 16,
"places_significant": 11,
"singleton_clusters": 0,
"transitions": 16
},
"result":
{
"preliminary_value": "yes yes yes unknown no yes no yes yes yes yes ",
"value": "yes yes yes unknown no yes no yes yes yes yes "
},
"task":
{
"type": "compound"
}
}
lola: LoLA will run for 3570 seconds at most (--timelimit)
lola: NET
lola: input: PNML file (--pnml)
lola: reading net from model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file model.pnml
lola: 32/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 512
lola: finding significant places
lola: 16 places, 16 transitions, 11 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 (((p10 <= p7) U ((2 <= p14) AND (1 <= p11)))) : (A (F ((((p3 <= p4) OR (1 <= p8)) AND (p4 <= p12) AND (p15 <= p8)))) OR E (((p2 <= p5) U ((3 <= p2) AND (p11 <= p2))))) : E (((p3 <= 0) U E (F ((2 <= p10))))) : E ((A (X ((2 <= p9))) U A (G ((1 <= p5))))) : NOT(E (F (((p4 <= 1) AND (p0 + 1 <= p11))))) : (A (X ((p4 <= p13))) AND NOT(A (G (((p11 <= p13) OR (p6 <= p4)))))) : A (G ((((p14 <= p0) OR (1 <= p14) OR (3 <= p8) OR (3 <= p4)) AND ((p13 <= p12) OR (p11 <= 2))))) : E ((((p12 <= 1) OR (p5 + 1 <= p0)) U E (F ((3 <= p10))))) : E (X (E (((p10 <= p13) U (p0 <= p8))))) : NOT(E ((((p1 <= p15) AND (3 <= p13)) U (2 <= p12)))) : E (((p14 + 1 <= p13) U ((p0 <= 1) AND (p13 <= p12) AND (p0 <= p4))))
lola: rewrite Frontend/Parser/formula_rewrite.k:473
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:323
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:473
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:338
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E ((A (X ((2 <= p9))) U A (G ((1 <= p5)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:812
lola: rewrite Frontend/Parser/formula_rewrite.k:813
lola: rewrite Frontend/Parser/formula_rewrite.k:809
lola: processed formula: E(AX((2 <= p9)) U AG((1 <= p5)))
lola: processed formula length: 32
lola: 15 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: 1559559 markings, 6955346 edges, 311912 markings/sec, 0 secs
lola: 2806503 markings, 12759907 edges, 249389 markings/sec, 5 secs
lola: 3933669 markings, 18085162 edges, 225433 markings/sec, 10 secs
lola: 5008396 markings, 23242926 edges, 214945 markings/sec, 15 secs
lola: 6052098 markings, 28262245 edges, 208740 markings/sec, 20 secs
lola: 7326741 markings, 34439274 edges, 254929 markings/sec, 25 secs
lola: 8630503 markings, 40756227 edges, 260752 markings/sec, 30 secs
lola: 9897393 markings, 47011057 edges, 253378 markings/sec, 35 secs
lola: 11162787 markings, 53210347 edges, 253079 markings/sec, 40 secs
lola: 12422819 markings, 59395742 edges, 252006 markings/sec, 45 secs
lola: 13672438 markings, 65584310 edges, 249924 markings/sec, 50 secs
lola: 14907468 markings, 71718950 edges, 247006 markings/sec, 55 secs
lola: 16128319 markings, 77765853 edges, 244170 markings/sec, 60 secs
lola: 17343683 markings, 83799449 edges, 243073 markings/sec, 65 secs
lola: 18553979 markings, 89847749 edges, 242059 markings/sec, 70 secs
lola: 19759892 markings, 95856156 edges, 241183 markings/sec, 75 secs
lola: 20944991 markings, 101770221 edges, 237020 markings/sec, 80 secs
lola: 22130919 markings, 107708979 edges, 237186 markings/sec, 85 secs
lola: 23090787 markings, 112514726 edges, 191974 markings/sec, 90 secs
lola: 24121461 markings, 117680962 edges, 206135 markings/sec, 95 secs
lola: 25266824 markings, 123446200 edges, 229073 markings/sec, 100 secs
lola: 26415317 markings, 129259265 edges, 229699 markings/sec, 105 secs
lola: 27581789 markings, 135110514 edges, 233294 markings/sec, 110 secs
lola: 28727462 markings, 140909720 edges, 229135 markings/sec, 115 secs
lola: 29876154 markings, 146710399 edges, 229738 markings/sec, 120 secs
lola: 31019136 markings, 152500215 edges, 228596 markings/sec, 125 secs
lola: 32167006 markings, 158321996 edges, 229574 markings/sec, 130 secs
lola: 33316755 markings, 164120494 edges, 229950 markings/sec, 135 secs
lola: 34458220 markings, 169950728 edges, 228293 markings/sec, 140 secs
lola: 35599566 markings, 175755034 edges, 228269 markings/sec, 145 secs
lola: 36739491 markings, 181562464 edges, 227985 markings/sec, 150 secs
lola: 37874656 markings, 187348089 edges, 227033 markings/sec, 155 secs
lola: 39000366 markings, 193131320 edges, 225142 markings/sec, 160 secs
lola: 40129339 markings, 198917908 edges, 225795 markings/sec, 165 secs
lola: 41285215 markings, 204774732 edges, 231175 markings/sec, 170 secs
lola: 42426724 markings, 210590091 edges, 228302 markings/sec, 175 secs
lola: 43564078 markings, 216434038 edges, 227471 markings/sec, 180 secs
lola: 44702462 markings, 222260779 edges, 227677 markings/sec, 185 secs
lola: 45832455 markings, 228052489 edges, 225999 markings/sec, 190 secs
lola: 46966174 markings, 233863376 edges, 226744 markings/sec, 195 secs
lola: 48093915 markings, 239669968 edges, 225548 markings/sec, 200 secs
lola: 49219457 markings, 245452007 edges, 225108 markings/sec, 205 secs
lola: 50347304 markings, 251226498 edges, 225569 markings/sec, 210 secs
lola: 51463806 markings, 256962478 edges, 223300 markings/sec, 215 secs
lola: 52578874 markings, 262719577 edges, 223014 markings/sec, 220 secs
lola: 53693895 markings, 268491050 edges, 223004 markings/sec, 225 secs
lola: 54806302 markings, 274246052 edges, 222481 markings/sec, 230 secs
lola: 55916158 markings, 279963280 edges, 221971 markings/sec, 235 secs
lola: 57025115 markings, 285716001 edges, 221791 markings/sec, 240 secs
lola: 58134533 markings, 291433114 edges, 221884 markings/sec, 245 secs
lola: 59242751 markings, 297138862 edges, 221644 markings/sec, 250 secs
lola: 60343376 markings, 302827796 edges, 220125 markings/sec, 255 secs
lola: 61444706 markings, 308558657 edges, 220266 markings/sec, 260 secs
lola: 62539057 markings, 314269915 edges, 218870 markings/sec, 265 secs
lola: 63636712 markings, 319968537 edges, 219531 markings/sec, 270 secs
lola: 64740868 markings, 325654320 edges, 220831 markings/sec, 275 secs
lola: 65838526 markings, 331370408 edges, 219532 markings/sec, 280 secs
lola: 66923902 markings, 337007002 edges, 217075 markings/sec, 285 secs
lola: 68021218 markings, 342720999 edges, 219463 markings/sec, 290 secs
lola: 69106033 markings, 348400812 edges, 216963 markings/sec, 295 secs
lola: 70187396 markings, 354026400 edges, 216273 markings/sec, 300 secs
lola: 71276202 markings, 359688504 edges, 217761 markings/sec, 305 secs
lola: 72367694 markings, 365344440 edges, 218298 markings/sec, 310 secs
lola: 73452654 markings, 370987810 edges, 216992 markings/sec, 315 secs
lola: local time limit reached - aborting
lola:
preliminary result: unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 1 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (X ((p4 <= p13))) AND E (F (((p13 + 1 <= p11) AND (p4 + 1 <= p6)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 1 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((p13 + 1 <= p11) AND (p4 + 1 <= p6))))
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 (((p13 + 1 <= p11) AND (p4 + 1 <= p6))))
lola: processed formula length: 45
lola: 13 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: ((p13 + 1 <= p11) AND (p4 + 1 <= p6))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 49 markings, 49 edges
lola: state equation: write sara problem file to CTLCardinality-0.sara
lola: ========================================
lola: state equation: calling and running sara
lola: subprocess 2 will run for 360 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X ((p4 <= p13)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:812
lola: processed formula: AX((p4 <= p13))
lola: processed formula length: 15
lola: 13 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 2 will run for 360 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (X (E (((p10 <= p13) U (p0 <= p8)))))
lola: ========================================
lola: SUBTASK
lola: checking existential until from successors
lola: rewrite Frontend/Parser/formula_rewrite.k:688
lola: built state equation task
lola: rewrite Frontend/Parser/formula_rewrite.k:716
lola: rewrite Frontend/Parser/formula_rewrite.k:688
lola: processed formula: E (X (E (((p10 <= p13) U (p0 <= p8)))))
lola: processed formula length: 39
lola: 15 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 / EXEU)
lola: state space: using reachability graph (EXEU version) (--search=depth)
lola: state space: using eu preserving stubborn set method (--stubborn=tarjan)
sara: try reading problem file CTLCardinality-0.sara.
sara: place or transition ordering is non-deterministic

lola: RUNNING
lola: state equation task get result started, id 0
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (p0 <= p8)
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 / EXEU
lola: There is a path where Predicate Phi holds until Predicate Psi from some successor.
lola: 38 markings, 37 edges
lola: state equation: write sara problem file to CTLCardinality-2-0.sara
lola: ========================================
lola: state equation: calling and running sara
lola: subprocess 3 will run for 405 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((3 <= p10)))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: processed formula: E (F ((3 <= p10)))
lola: processed formula length: 18
lola: 13 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: (3 <= p10)
lola: state equation task get result unparse finished id 0
lola: The predicate is reachable.
lola: 22 markings, 21 edges
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: ========================================
sara: try reading problem file CTLCardinality-2-0.sara.
lola: subprocess 4 will run for 463 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((2 <= p10)))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: processed formula: E (F ((2 <= p10)))
lola: processed formula length: 18
lola: 13 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 <= p10)
lola: state equation task get result unparse finished id 0
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 15 markings, 14 edges
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: ========================================
lola: subprocess 5 will run for 540 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((2 <= p4) OR (p11 <= p0))))
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 (((2 <= p4) OR (p11 <= p0))))
lola: processed formula length: 35
lola: 14 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
sara: place or transition ordering is non-deterministic

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: ((p4 <= 1) AND (p0 + 1 <= p11))
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 47 markings, 46 edges
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to CTLCardinality-5-0.sara
lola: state equation: calling and running sara
sara: try reading problem file CTLCardinality-5-0.sara.
sara: place or transition ordering is non-deterministic

lola: ========================================
lola: subprocess 6 will run for 648 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((((p14 <= p0) OR (1 <= p14) OR (3 <= p8) OR (3 <= p4)) AND ((p13 <= p12) OR (p11 <= 2)))))
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 ((((p14 <= p0) OR (1 <= p14) OR (3 <= p8) OR (3 <= p4)) AND ((p13 <= p12) OR (p11 <= 2)))))
lola: processed formula length: 100
lola: 14 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 22 markings, 23 edges
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: ========================================
lola: subprocess 7 will run for 810 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (((p10 <= p7) U ((2 <= p14) AND (1 <= p11))))
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 (((p10 <= p7) U ((2 <= p14) AND (1 <= p11))))
lola: processed formula length: 47
lola: 15 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: SUBRESULT
lola: result: yes
lola: produced by: state space /EU
lola: formula 0: ((2 <= p14) AND (1 <= p11))
lola: state equation task get result unparse finished id 0
lola: There is a path where Predicate Phi holds until Predicate Psi.
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: 63 markings, 62 edges
lola: ========================================
lola: subprocess 8 will run for 1081 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A ((((p15 + 1 <= p1) OR (p13 <= 2)) R (p12 <= 1)))
lola: ========================================
lola: SUBTASK
lola: checking universal release
lola: rewrite Frontend/Parser/formula_rewrite.k:619
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: rewrite Frontend/Parser/formula_rewrite.k:737
lola: rewrite Frontend/Parser/formula_rewrite.k:693
lola: rewrite Frontend/Parser/formula_rewrite.k:788
lola: rewrite Frontend/Parser/formula_rewrite.k:788
lola: processed formula: A ((((p15 + 1 <= p1) OR (p13 <= 2)) R (p12 <= 1)))
lola: processed formula length: 51
lola: 17 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: rewrite Frontend/Parser/formula_rewrite.k:788
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (2 <= p12)
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to CTLCardinality-8-0.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space /EU
lola: Predicate Phi releases Predicate Psi on all paths.
lola: 286 markings, 880 edges
lola: ========================================
lola: subprocess 9 will run for 1621 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (((p14 + 1 <= p13) U ((p0 <= 1) AND (p13 <= p12) AND (p0 <= p4))))
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 (((p14 + 1 <= p13) U ((p0 <= 1) AND (p13 <= p12) AND (p0 <= p4))))
lola: processed formula length: 68
lola: 15 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: ((p0 <= 1) AND (p13 <= p12) AND (p0 <= p4))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 3 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to CTLCardinality-9-0.sara
lola: state equation: calling and running sara
sara: try reading problem file CTLCardinality-9-0.sara.
sara: place or transition ordering is non-deterministic

lola: SUBRESULT
lola: result: yes
lola: produced by: state space /EU
lola: There is a path where Predicate Phi holds until Predicate Psi.
lola: 6765 markings, 13554 edges
lola: ========================================
lola: subprocess 10 will run for 3243 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (F ((((p3 <= p4) OR (1 <= p8)) AND (p4 <= p12) AND (p15 <= p8)))) OR E (((p2 <= p5) U ((3 <= p2) AND (p11 <= p2)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 10 will run for 3243 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (((p2 <= p5) U ((3 <= p2) AND (p11 <= p2))))
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 (((p2 <= p5) U ((3 <= p2) AND (p11 <= p2))))
lola: processed formula length: 46
lola: 15 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 <= p2) AND (p11 <= p2))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to CTLCardinality-10-0.sara
lola: state equation: calling and running sara
sara: try reading problem file CTLCardinality-10-0.sara.
sara: place or transition ordering is non-deterministic

lola: SUBRESULT
lola: result: yes
lola: produced by: state space /EU
lola: There is a path where Predicate Phi holds until Predicate Psi.
lola: 10002 markings, 22109 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: ========================================
lola: ...considering subproblem: E ((A (X ((2 <= p9))) U A (G ((1 <= p5)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:812
lola: rewrite Frontend/Parser/formula_rewrite.k:813
lola: rewrite Frontend/Parser/formula_rewrite.k:809
lola: processed formula: E(AX((2 <= p9)) U AG((1 <= p5)))
lola: processed formula length: 32
lola: 15 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: 1470808 markings, 6546353 edges, 294162 markings/sec, 0 secs
lola: 2668639 markings, 12117380 edges, 239566 markings/sec, 5 secs
lola: 3771655 markings, 17310947 edges, 220603 markings/sec, 10 secs
lola: 4824781 markings, 22350849 edges, 210625 markings/sec, 15 secs
lola: 5823483 markings, 27155034 edges, 199740 markings/sec, 20 secs
lola: 6801223 markings, 31877930 edges, 195548 markings/sec, 25 secs
lola: 7766320 markings, 36569488 edges, 193019 markings/sec, 30 secs
lola: 8714717 markings, 41172153 edges, 189679 markings/sec, 35 secs
lola: 9631076 markings, 45707442 edges, 183272 markings/sec, 40 secs
lola: 10536124 markings, 50141616 edges, 181010 markings/sec, 45 secs
lola: 11439965 markings, 54570924 edges, 180768 markings/sec, 50 secs
lola: 12341722 markings, 59000934 edges, 180351 markings/sec, 55 secs
lola: 13224992 markings, 63354557 edges, 176654 markings/sec, 60 secs
lola: 14100561 markings, 67693415 edges, 175114 markings/sec, 65 secs
lola: 14976011 markings, 72064153 edges, 175090 markings/sec, 70 secs
lola: 16143214 markings, 77839203 edges, 233441 markings/sec, 75 secs
lola: 17351189 markings, 83837490 edges, 241595 markings/sec, 80 secs
lola: 18556428 markings, 89860059 edges, 241048 markings/sec, 85 secs
lola: 19767416 markings, 95893995 edges, 242198 markings/sec, 90 secs
lola: 20973797 markings, 101916325 edges, 241276 markings/sec, 95 secs
lola: 22184873 markings, 107975702 edges, 242215 markings/sec, 100 secs
lola: 23387298 markings, 113998540 edges, 240485 markings/sec, 105 secs
lola: 24589467 markings, 120011997 edges, 240434 markings/sec, 110 secs
lola: 25773503 markings, 126014208 edges, 236807 markings/sec, 115 secs
lola: 26967396 markings, 132035449 edges, 238779 markings/sec, 120 secs
lola: 28151696 markings, 137998288 edges, 236860 markings/sec, 125 secs
lola: 29333464 markings, 143973206 edges, 236354 markings/sec, 130 secs
lola: 30510194 markings, 149928980 edges, 235346 markings/sec, 135 secs
lola: 31682816 markings, 155853457 edges, 234524 markings/sec, 140 secs
lola: 32846667 markings, 161740834 edges, 232770 markings/sec, 145 secs
lola: 34016575 markings, 167711952 edges, 233982 markings/sec, 150 secs
lola: 35174955 markings, 173596595 edges, 231676 markings/sec, 155 secs
lola: 36323980 markings, 179469265 edges, 229805 markings/sec, 160 secs
lola: 37482636 markings, 185350121 edges, 231731 markings/sec, 165 secs
lola: 38636844 markings, 191237066 edges, 230842 markings/sec, 170 secs
lola: 39777412 markings, 197120334 edges, 228114 markings/sec, 175 secs
lola: 40927172 markings, 202967098 edges, 229952 markings/sec, 180 secs
lola: 42069700 markings, 208784976 edges, 228506 markings/sec, 185 secs
lola: 43212109 markings, 214636133 edges, 228482 markings/sec, 190 secs
lola: 44353284 markings, 220475278 edges, 228235 markings/sec, 195 secs
lola: 45496913 markings, 226336677 edges, 228726 markings/sec, 200 secs
lola: 46643242 markings, 232208698 edges, 229266 markings/sec, 205 secs
lola: 47788753 markings, 238092151 edges, 229102 markings/sec, 210 secs
lola: 48930668 markings, 243971389 edges, 228383 markings/sec, 215 secs
lola: 50069999 markings, 249803993 edges, 227866 markings/sec, 220 secs
lola: 51207401 markings, 255638726 edges, 227480 markings/sec, 225 secs
lola: 52335657 markings, 261462509 edges, 225651 markings/sec, 230 secs
lola: 53461368 markings, 267295509 edges, 225142 markings/sec, 235 secs
lola: 54580760 markings, 273087823 edges, 223878 markings/sec, 240 secs
lola: 55707118 markings, 278878377 edges, 225272 markings/sec, 245 secs
lola: 56823129 markings, 284656069 edges, 223202 markings/sec, 250 secs
lola: 57936234 markings, 290404935 edges, 222621 markings/sec, 255 secs
lola: 59048791 markings, 296128917 edges, 222511 markings/sec, 260 secs
lola: 60161129 markings, 301891921 edges, 222468 markings/sec, 265 secs
lola: 61269717 markings, 307655521 edges, 221718 markings/sec, 270 secs
lola: 62376792 markings, 313433420 edges, 221415 markings/sec, 275 secs
lola: 63483404 markings, 319176092 edges, 221322 markings/sec, 280 secs
lola: 64597546 markings, 324919501 edges, 222828 markings/sec, 285 secs
lola: 65706753 markings, 330686665 edges, 221841 markings/sec, 290 secs
lola: 66806240 markings, 336392534 edges, 219897 markings/sec, 295 secs
lola: 67910592 markings, 342153706 edges, 220870 markings/sec, 300 secs
lola: 69009169 markings, 347891078 edges, 219715 markings/sec, 305 secs
lola: 70100071 markings, 353574244 edges, 218180 markings/sec, 310 secs
lola: 71195096 markings, 359271243 edges, 219005 markings/sec, 315 secs
lola: 72292183 markings, 364957332 edges, 219417 markings/sec, 320 secs
lola: 73384789 markings, 370637788 edges, 218521 markings/sec, 325 secs
lola: 74481147 markings, 376361329 edges, 219272 markings/sec, 330 secs
lola: 75512553 markings, 381758865 edges, 206281 markings/sec, 335 secs
lola: 76469930 markings, 386758725 edges, 191475 markings/sec, 340 secs
lola: 77100960 markings, 390032849 edges, 126206 markings/sec, 345 secs
lola: 77573004 markings, 392490891 edges, 94409 markings/sec, 350 secs
lola: 77890430 markings, 394175741 edges, 63485 markings/sec, 355 secs
lola: 78438948 markings, 397034850 edges, 109704 markings/sec, 360 secs
lola: 79224921 markings, 401173822 edges, 157195 markings/sec, 365 secs
lola: 79944026 markings, 404903971 edges, 143821 markings/sec, 370 secs
lola: 80891227 markings, 409836763 edges, 189440 markings/sec, 375 secs
lola: 81744068 markings, 414352906 edges, 170568 markings/sec, 380 secs
lola: 82039972 markings, 415893935 edges, 59181 markings/sec, 385 secs
lola: 82342238 markings, 417467063 edges, 60453 markings/sec, 390 secs
lola: 83047005 markings, 421138348 edges, 140953 markings/sec, 395 secs
lola: 83664260 markings, 424389564 edges, 123451 markings/sec, 400 secs
lola: 83957961 markings, 425934404 edges, 58740 markings/sec, 405 secs
lola: 84376138 markings, 428121755 edges, 83635 markings/sec, 410 secs
lola: 85153065 markings, 432201150 edges, 155385 markings/sec, 415 secs
lola: 85692348 markings, 434999634 edges, 107857 markings/sec, 420 secs
lola: 86291107 markings, 438147127 edges, 119752 markings/sec, 425 secs
lola: 86974514 markings, 441748263 edges, 136681 markings/sec, 430 secs
lola: 87439668 markings, 444206832 edges, 93031 markings/sec, 435 secs
lola: 88117105 markings, 447727924 edges, 135487 markings/sec, 440 secs
lola: 88722310 markings, 450877674 edges, 121041 markings/sec, 445 secs
lola: 89301724 markings, 453932322 edges, 115883 markings/sec, 450 secs
lola: 89890262 markings, 457002047 edges, 117708 markings/sec, 455 secs
lola: 90275414 markings, 459020614 edges, 77030 markings/sec, 460 secs
lola: 90807396 markings, 461810153 edges, 106396 markings/sec, 465 secs
lola: 91425177 markings, 465046201 edges, 123556 markings/sec, 470 secs
lola: 92028171 markings, 468204139 edges, 120599 markings/sec, 475 secs
lola: 92369387 markings, 469991359 edges, 68243 markings/sec, 480 secs
lola: 92643812 markings, 471417875 edges, 54885 markings/sec, 485 secs
lola: 92898126 markings, 472742586 edges, 50863 markings/sec, 490 secs
lola: 93105220 markings, 473828609 edges, 41419 markings/sec, 495 secs
lola: 93483822 markings, 475829067 edges, 75720 markings/sec, 500 secs
lola: Child process aborted or communication problem between parent and child process
lola: RESULT
lola:
SUMMARY: yes yes yes unknown no yes no yes yes yes yes
lola:
preliminary result: yes yes yes unknown no yes no yes yes yes yes
lola: memory consumption: 3520 KB
lola: time consumption: 839 seconds
lola: print data as JSON (--json)
lola: writing JSON to CTLCardinality.json
lola: closed JSON file CTLCardinality.json
rslt: finished

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

Sequence of Actions to be Executed by the VM

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

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

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