Execution Chart

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

Trace from the execution

Formatting '/local/x2003239/mcc2020-input.r194-csrt-159033389500099.qcow2', fmt=qcow2 size=4294967296 backing_file=/local/x2003239/mcc2020-input.qcow2 encryption=off cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...............................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itslola
Input is SmallOperatingSystem-PT-MT1024DC0512, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r194-csrt-159033389500099
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 200K
-rw-r--r-- 1 mcc users 4.8K Apr 12 17:46 CTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Apr 12 17:46 CTLCardinality.xml
-rw-r--r-- 1 mcc users 3.0K Apr 11 20:04 CTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 11 20:04 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 24 05:38 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K Mar 24 05:38 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K Apr 14 12:52 LTLCardinality.txt
-rw-r--r-- 1 mcc users 21K Apr 28 14:02 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.7K Apr 14 12:52 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 28 14:02 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Apr 10 20:34 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 18K Apr 10 20:34 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.2K Apr 10 05:24 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 15K Apr 10 05:24 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.0K Apr 10 22:29 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.1K Apr 10 22:29 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 24 05:38 equiv_col
-rw-r--r-- 1 mcc users 13 Mar 24 05:38 instance
-rw-r--r-- 1 mcc users 6 Mar 24 05:38 iscolored
-rw-r--r-- 1 mcc users 8.1K 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 SmallOperatingSystem-PT-MT1024DC0512-CTLCardinality-00
FORMULA_NAME SmallOperatingSystem-PT-MT1024DC0512-CTLCardinality-01
FORMULA_NAME SmallOperatingSystem-PT-MT1024DC0512-CTLCardinality-02
FORMULA_NAME SmallOperatingSystem-PT-MT1024DC0512-CTLCardinality-03
FORMULA_NAME SmallOperatingSystem-PT-MT1024DC0512-CTLCardinality-04
FORMULA_NAME SmallOperatingSystem-PT-MT1024DC0512-CTLCardinality-05
FORMULA_NAME SmallOperatingSystem-PT-MT1024DC0512-CTLCardinality-06
FORMULA_NAME SmallOperatingSystem-PT-MT1024DC0512-CTLCardinality-07
FORMULA_NAME SmallOperatingSystem-PT-MT1024DC0512-CTLCardinality-08
FORMULA_NAME SmallOperatingSystem-PT-MT1024DC0512-CTLCardinality-09
FORMULA_NAME SmallOperatingSystem-PT-MT1024DC0512-CTLCardinality-10
FORMULA_NAME SmallOperatingSystem-PT-MT1024DC0512-CTLCardinality-11
FORMULA_NAME SmallOperatingSystem-PT-MT1024DC0512-CTLCardinality-12
FORMULA_NAME SmallOperatingSystem-PT-MT1024DC0512-CTLCardinality-13
FORMULA_NAME SmallOperatingSystem-PT-MT1024DC0512-CTLCardinality-14
FORMULA_NAME SmallOperatingSystem-PT-MT1024DC0512-CTLCardinality-15

=== Now, execution of the tool begins

BK_START 1591200220667

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-03 16:03:42] [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 16:03:42] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-03 16:03:43] [INFO ] Load time of PNML (sax parser for PT used): 37 ms
[2020-06-03 16:03:43] [INFO ] Transformed 9 places.
[2020-06-03 16:03:43] [INFO ] Transformed 8 transitions.
[2020-06-03 16:03:43] [INFO ] Parsed PT model containing 9 places and 8 transitions in 92 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 15 ms.
Incomplete random walk after 100032 steps, including 0 resets, run finished after 62 ms. (steps per millisecond=1613 ) properties seen :[1, 0, 1, 0, 1, 1, 1, 1, 0, 1, 0, 0, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 0, 1, 1, 1, 0, 1, 0, 1, 1]
// Phase 1: matrix 8 rows 9 cols
[2020-06-03 16:03:43] [INFO ] Computed 4 place invariants in 3 ms
[2020-06-03 16:03:43] [INFO ] [Real]Absence check using 4 positive place invariants in 18 ms returned unsat
[2020-06-03 16:03:43] [INFO ] [Real]Absence check using 4 positive place invariants in 4 ms returned unsat
[2020-06-03 16:03:43] [INFO ] [Real]Absence check using 4 positive place invariants in 4 ms returned unsat
[2020-06-03 16:03:43] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned unsat
[2020-06-03 16:03:43] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned unsat
[2020-06-03 16:03:43] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned unsat
[2020-06-03 16:03:43] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned unsat
[2020-06-03 16:03:43] [INFO ] [Real]Absence check using 4 positive place invariants in 3 ms returned unsat
[2020-06-03 16:03:43] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned unsat
Successfully simplified 9 atomic propositions for a total of 9 simplifications.
[2020-06-03 16:03:43] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
[2020-06-03 16:03:43] [INFO ] Flatten gal took : 23 ms
[2020-06-03 16:03:43] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
[2020-06-03 16:03:43] [INFO ] Flatten gal took : 4 ms
FORMULA SmallOperatingSystem-PT-MT1024DC0512-CTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmallOperatingSystem-PT-MT1024DC0512-CTLCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-06-03 16:03:43] [INFO ] Export to MCC properties in file /home/mcc/execution/CTLCardinality.sr.xml took 3 ms.
[2020-06-03 16:03:43] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 0 ms.
info: Time: 3600 - MCC
vrfy: Checking CTLCardinality @ SmallOperatingSystem-PT-MT1024DC0512 @ 3570 seconds

FORMULA SmallOperatingSystem-PT-MT1024DC0512-CTLCardinality-02 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA SmallOperatingSystem-PT-MT1024DC0512-CTLCardinality-07 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA SmallOperatingSystem-PT-MT1024DC0512-CTLCardinality-08 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA SmallOperatingSystem-PT-MT1024DC0512-CTLCardinality-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA SmallOperatingSystem-PT-MT1024DC0512-CTLCardinality-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA SmallOperatingSystem-PT-MT1024DC0512-CTLCardinality-05 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA SmallOperatingSystem-PT-MT1024DC0512-CTLCardinality-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA SmallOperatingSystem-PT-MT1024DC0512-CTLCardinality-00 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA SmallOperatingSystem-PT-MT1024DC0512-CTLCardinality-03 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA SmallOperatingSystem-PT-MT1024DC0512-CTLCardinality-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA SmallOperatingSystem-PT-MT1024DC0512-CTLCardinality-01 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA SmallOperatingSystem-PT-MT1024DC0512-CTLCardinality-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA SmallOperatingSystem-PT-MT1024DC0512-CTLCardinality-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA SmallOperatingSystem-PT-MT1024DC0512-CTLCardinality-06 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 2705
rslt: Output for CTLCardinality @ SmallOperatingSystem-PT-MT1024DC0512

{
"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 16:03:43 2020
",
"timelimit": 3570
},
"child":
[

{
"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": 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": "(p2 <= 2)",
"processed_size": 9,
"rewrites": 24
},
"result":
{
"edges": 509,
"markings": 510,
"produced_by": "state space /EXEF",
"value": false
},
"task":
{
"compoundnumber": 0,
"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"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 274
},
"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": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "(p2 + 1 <= p5)",
"processed_size": 14,
"rewrites": 23
},
"result":
{
"edges": 1541,
"markings": 1541,
"produced_by": "state space /EXEF",
"value": true
},
"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": "reachability_from_a_successor",
"workflow": "stateequation"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 297
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 2,
"F": 2,
"G": 0,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "EF((AF((p8 <= p5)) AND EX((p1 <= p2))))",
"processed_size": 39,
"rewrites": 24
},
"net":
{
"conflict_clusters": 4,
"singleton_clusters": 0
},
"result":
{
"edges": 158420731,
"markings": 45265396,
"produced_by": "CTL model checker",
"value": true
},
"task":
{
"compoundnumber": 2,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 311
},
"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 ((p1 + 1 <= p5)))",
"processed_size": 22,
"rewrites": 22
},
"result":
{
"edges": 1540,
"markings": 1540,
"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"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": true
},
"task":
{
"compoundnumber": 3,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 342
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 1,
"F": 1,
"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(EF((p1 + 1 <= p2)))",
"processed_size": 22,
"rewrites": 23
},
"net":
{
"conflict_clusters": 4,
"singleton_clusters": 0
},
"result":
{
"edges": 113554947,
"markings": 45528067,
"produced_by": "CTL model checker",
"value": true
},
"task":
{
"compoundnumber": 4,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 371
},
"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 ((p0 <= p8)))",
"processed_size": 18,
"rewrites": 22
},
"result":
{
"edges": 512,
"markings": 513,
"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": 418
},
"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 (((1 <= p7) AND (p2 <= 1))))",
"processed_size": 33,
"rewrites": 22
},
"result":
{
"edges": 514,
"markings": 515,
"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": 478
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"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": "A (G ((((2 <= p8) OR (p7 <= p1)))))",
"processed_size": 36,
"rewrites": 23
},
"result":
{
"edges": 2048,
"markings": 2049,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 7,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 2,
"problems": 2
},
"type": "invariance",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 557
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 1,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "A (G (((p8 <= p1) OR (p3 <= p1))))",
"processed_size": 35,
"rewrites": 23
},
"result":
{
"edges": 1546,
"markings": 1545,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 8,
"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": 669
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 1,
"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": "A (G ((((p3 + 1 <= p1) OR (p7 + 1 <= p5)))))",
"processed_size": 45,
"rewrites": 23
},
"result":
{
"edges": 1536,
"markings": 1537,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 9,
"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": 1005
},
"child":
[

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

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1507
},
"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": "(p4 <= p8)",
"processed_size": 10,
"rewrites": 21
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 12,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3014
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 0,
"G": 0,
"U": 1,
"X": 0,
"aconj": 0,
"adisj": 1,
"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 ((((p6 <= p8) OR (p4 <= p3)) U (2 <= p5)))",
"processed_size": 45,
"rewrites": 24
},
"result":
{
"edges": 512,
"markings": 513,
"produced_by": "state space /EU",
"value": false
},
"task":
{
"compoundnumber": 13,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "eu preserving",
"visible": 3
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "existential_until",
"workflow": "stateequation"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 12,
"type": "boolean"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3014
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 0,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 0,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 0,
"visible_transitions": 0
},
"processed": "NOT DEADLOCK",
"processed_size": 12,
"rewrites": 21
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 13,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 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 ((p2 <= p6)))",
"processed_size": 18,
"rewrites": 23
},
"result":
{
"edges": 1539,
"markings": 1540,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 15,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "invariance",
"workflow": "stateequation||search"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 13,
"type": "boolean"
}
}
],
"exit":
{
"error": null,
"memory": 3360,
"runtime": 864.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "CTLCardinality.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "A(G(**)) : (** AND (A(G(**)) AND **)) : A(X(A(G(**)))) : A(G(**)) : E(F(**)) : A(G(E(F(**)))) : E(X(E(F(*)))) : E(F((A(F(**)) AND E(X(**))))) : (E((** U **)) AND **) : E(F(**)) : (E(X(**)) OR E(F(**))) : A(G(**)) : A(X(E(F(**)))) : (NODEADLOCK AND (** AND (A(G(**)) AND **)))"
},
"net":
{
"arcs": 27,
"conflict_clusters": 4,
"places": 9,
"places_significant": 5,
"singleton_clusters": 0,
"transitions": 8
},
"result":
{
"preliminary_value": "no no no no yes unknown yes yes no yes yes no yes no ",
"value": "no no no no yes unknown yes yes no yes yes no yes no "
},
"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: 17/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 288
lola: finding significant places
lola: 9 places, 8 transitions, 5 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: LP says that atomic proposition is always true: (p1 <= p6)
lola: LP says that atomic proposition is always true: (3 <= p0)
lola: (A (G ((((2 <= p8) OR (p7 <= p1))))) OR (NOT(E (G ((0 <= 0)))) AND E (F ((p3 <= p4))))) : ((((3 <= p2) AND (p8 <= p1)) AND A (G ((3 <= p1)))) AND ((p2 + 1 <= p8) OR (p5 <= p4) OR ((3 <= p1) AND ((2 <= p8) OR (1 <= p4))))) : A (G (A (X ((3 <= p2))))) : A (G (E (G (((p8 <= p1) OR (p3 <= p1)))))) : E (F ((p0 <= p8))) : A (G (E (F ((p3 <= p2))))) : NOT(A (X (A (G ((p5 <= p2)))))) : E (F ((A (F ((p8 <= p5))) AND E (X ((p1 <= p2)))))) : (E ((((p6 <= p8) OR (p4 <= p3)) U (2 <= p5))) AND (p4 <= p8)) : E (F (((1 <= p7) AND (p2 <= 1)))) : (E (X ((p1 <= p8))) OR E (((0 <= 0) U (p1 + 1 <= p5)))) : A (G ((((p3 + 1 <= p1) OR (p7 + 1 <= p5))))) : A (X (E (F ((p1 + 1 <= p2))))) : (((E (X ((0 <= 0))) AND (p4 <= p3)) AND A (G ((p2 <= p6)))) AND ((1 <= p2) OR (p0 <= p8) OR ((p3 <= p7))))
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:160
lola: rewrite Frontend/Parser/formula_rewrite.k:148
lola: rewrite Frontend/Parser/formula_rewrite.k:279
lola: rewrite Frontend/Parser/formula_rewrite.k:118
lola: rewrite Frontend/Parser/formula_rewrite.k:121
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:398
lola: rewrite Frontend/Parser/formula_rewrite.k:458
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:335
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:100
lola: rewrite Frontend/Parser/formula_rewrite.k:169
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:130
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 254 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (A (G ((3 <= p2)))))
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: (p2 <= 2)
lola: processed formula length: 9
lola: 24 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (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: (p2 <= 2)
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to CTLCardinality-0.sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space /EXEF
lola: The predicate is not invariant from successors.
lola: 510 markings, 509 edges
lola: ========================================
lola: subprocess 1 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (X (E (F ((p2 + 1 <= p5)))))
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: (p2 + 1 <= p5)
lola: processed formula length: 14
lola: 23 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /EXEF)
lola: state space: using reachability graph (EXef version) (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (p2 + 1 <= p5)
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to CTLCardinality-0.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space /EXEF
lola: The predicate is reachable from some successor.
lola: 1541 markings, 1541 edges
lola: ========================================
lola: subprocess 2 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((A (F ((p8 <= p5))) AND E (X ((p1 <= p2))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:811
lola: rewrite Frontend/Parser/formula_rewrite.k:807
lola: rewrite Frontend/Parser/formula_rewrite.k:806
lola: processed formula: EF((AF((p8 <= p5)) AND EX((p1 <= p2))))
lola: processed formula length: 39
lola: 24 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: 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: 1654935 markings, 5789194 edges, 330987 markings/sec, 0 secs
lola: 3348999 markings, 11717731 edges, 338813 markings/sec, 5 secs
lola: 5129432 markings, 17948604 edges, 356087 markings/sec, 10 secs
lola: 6983474 markings, 24437246 edges, 370808 markings/sec, 15 secs
lola: 8772466 markings, 30698056 edges, 357798 markings/sec, 20 secs
lola: 10610197 markings, 37130334 edges, 367546 markings/sec, 25 secs
lola: 12456596 markings, 43591836 edges, 369280 markings/sec, 30 secs
lola: 14262373 markings, 49912139 edges, 361155 markings/sec, 35 secs
lola: 16008296 markings, 56022321 edges, 349185 markings/sec, 40 secs
lola: 17766434 markings, 62175457 edges, 351628 markings/sec, 45 secs
lola: 19542637 markings, 68392040 edges, 355241 markings/sec, 50 secs
lola: 21315499 markings, 74597449 edges, 354572 markings/sec, 55 secs
lola: 23029525 markings, 80595523 edges, 342805 markings/sec, 60 secs
lola: 24626248 markings, 86184246 edges, 319345 markings/sec, 65 secs
lola: 26314903 markings, 92095178 edges, 337731 markings/sec, 70 secs
lola: 27953876 markings, 97830789 edges, 327795 markings/sec, 75 secs
lola: 29558042 markings, 103445642 edges, 320833 markings/sec, 80 secs
lola: 31153956 markings, 109030933 edges, 319183 markings/sec, 85 secs
lola: 32856232 markings, 114989053 edges, 340455 markings/sec, 90 secs
lola: 34554658 markings, 120933025 edges, 339685 markings/sec, 95 secs
lola: 36182196 markings, 126628439 edges, 325508 markings/sec, 100 secs
lola: 37719828 markings, 132010705 edges, 307526 markings/sec, 105 secs
lola: 39302357 markings, 137549059 edges, 316506 markings/sec, 110 secs
lola: 40953840 markings, 143328786 edges, 330297 markings/sec, 115 secs
lola: 42614998 markings, 149143631 edges, 332232 markings/sec, 120 secs
lola: 44311286 markings, 155079807 edges, 339258 markings/sec, 125 secs
lola: 45265396 markings, 158420731 edges, 190822 markings/sec, 130 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 45265396 markings, 158420731 edges
lola: ========================================
lola: subprocess 3 will run for 311 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E (X ((p1 <= p8))) OR E (F ((p1 + 1 <= p5))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 3 will run for 311 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((p1 + 1 <= p5)))
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 ((p1 + 1 <= p5)))
lola: processed formula length: 22
lola: 22 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (p1 + 1 <= p5)
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to CTLCardinality-3-0.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 1540 markings, 1540 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 4 will run for 342 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (E (F ((p1 + 1 <= p2)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:806
lola: rewrite Frontend/Parser/formula_rewrite.k:812
lola: processed formula: AX(EF((p1 + 1 <= p2)))
lola: processed formula length: 22
lola: 23 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: 3201964 markings, 7959318 edges, 640393 markings/sec, 0 secs
lola: 6243051 markings, 15536585 edges, 608217 markings/sec, 5 secs
lola: 9367315 markings, 23324777 edges, 624853 markings/sec, 10 secs
lola: 12349348 markings, 30761333 edges, 596407 markings/sec, 15 secs
lola: 15153558 markings, 37756290 edges, 560842 markings/sec, 20 secs
lola: 17975587 markings, 44795784 edges, 564406 markings/sec, 25 secs
lola: 20860006 markings, 51990875 edges, 576884 markings/sec, 30 secs
lola: 23627622 markings, 58897400 edges, 553523 markings/sec, 35 secs
lola: 26435103 markings, 65902482 edges, 561496 markings/sec, 40 secs
lola: 29262602 markings, 72957964 edges, 565500 markings/sec, 45 secs
lola: 32149676 markings, 80163001 edges, 577415 markings/sec, 50 secs
lola: 34876131 markings, 86966919 edges, 545291 markings/sec, 55 secs
lola: 37654084 markings, 93900407 edges, 555591 markings/sec, 60 secs
lola: 40411106 markings, 100782558 edges, 551404 markings/sec, 65 secs
lola: 43215564 markings, 107781028 edges, 560892 markings/sec, 70 secs
lola: 45528067 markings, 113554947 edges, 462501 markings/sec, 75 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 45528067 markings, 113554947 edges
lola: ========================================
lola: subprocess 5 will run for 371 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((p0 <= p8)))
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 ((p0 <= p8)))
lola: processed formula length: 18
lola: 22 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k: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 <= p8)
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to CTLCardinality-5-0.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 513 markings, 512 edges
lola: ========================================
lola: subprocess 6 will run for 418 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((1 <= p7) AND (p2 <= 1))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: processed formula: E (F (((1 <= p7) AND (p2 <= 1))))
lola: processed formula length: 33
lola: 22 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((1 <= p7) AND (p2 <= 1))
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-6-0.sara
lola: state equation: calling and running sara
sara: try reading problem file CTLCardinality-6-0.sara.
sara: place or transition ordering is non-deterministic
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 515 markings, 514 edges
lola: ========================================
lola: subprocess 7 will run for 478 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((((2 <= p8) OR (p7 <= p1)))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: A (G ((((2 <= p8) OR (p7 <= p1)))))
lola: processed formula length: 36
lola: 23 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
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: (((p8 <= 1) AND (p1 + 1 <= p7)))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to CTLCardinality-7-0.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 2049 markings, 2048 edges
lola: ========================================
lola: subprocess 8 will run for 557 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((p8 <= p1) OR (p3 <= p1))))
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 (((p8 <= p1) OR (p3 <= p1))))
lola: processed formula length: 35
lola: 23 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: 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: ((p1 + 1 <= p8) AND (p1 + 1 <= p3))
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-8-0.sara
lola: state equation: calling and running sara
sara: try reading problem file CTLCardinality-8-0.sara.
sara: place or transition ordering is non-deterministic
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 1545 markings, 1546 edges
lola: ========================================
lola: subprocess 9 will run for 669 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((((p3 + 1 <= p1) OR (p7 + 1 <= p5)))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: A (G ((((p3 + 1 <= p1) OR (p7 + 1 <= p5)))))
lola: processed formula length: 45
lola: 23 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
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: (((p1 <= p3) AND (p5 <= p7)))
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-9-0.sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 1537 markings, 1536 edges
lola: ========================================
lola: subprocess 10 will run for 836 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (E (F ((p3 <= p2)))))
lola: ========================================
lola: SUBTASK
lola: checking liveness
lola: rewrite Frontend/Parser/formula_rewrite.k:603
lola: rewrite Frontend/Parser/formula_rewrite.k:613
lola: rewrite Frontend/Parser/formula_rewrite.k:703
lola: processed formula: (p3 <= p2)
lola: processed formula length: 10
lola: 24 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using tscc preserving stubborn set method (--stubborn)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (p2 + 1 <= p3)
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to CTLCardinality-10-0.sara
lola: state equation task get result started, id 1
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: state equation task get result rewrite finished id 1
lola: state equation task get result unparse finished++ id 1
lola: formula 1: (p3 <= p2)
lola: state equation task get result unparse finished id 1
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to CTLCardinality-10-1.sara
lola: state equation: calling and running sara
sara: try reading problem file CTLCardinality-10-1.sara.
sara: place or transition ordering is non-deterministic

lola: state equation 1: solution produced
lola: sara is running 0 secs || sara is running 0 secs || 3355151 markings, 8341141 edges, 671030 markings/sec, 0 secs
lola: sara is running 5 secs || sara is running 5 secs || 6352539 markings, 15809132 edges, 599478 markings/sec, 5 secs
lola: sara is running 10 secs || sara is running 10 secs || 9225618 markings, 22971832 edges, 574616 markings/sec, 10 secs
lola: sara is running 15 secs || sara is running 15 secs || 11986914 markings, 29857263 edges, 552259 markings/sec, 15 secs
lola: sara is running 20 secs || sara is running 20 secs || 14897377 markings, 37117196 edges, 582093 markings/sec, 20 secs
lola: sara is running 25 secs || sara is running 25 secs || 18009790 markings, 44880182 edges, 622483 markings/sec, 25 secs
lola: sara is running 30 secs || sara is running 30 secs || 21145898 markings, 52705293 edges, 627222 markings/sec, 30 secs
lola: sara is running 35 secs || sara is running 35 secs || 24198213 markings, 60320062 edges, 610463 markings/sec, 35 secs
lola: sara is running 40 secs || sara is running 40 secs || 27209166 markings, 67834244 edges, 602191 markings/sec, 40 secs
lola: sara is running 45 secs || sara is running 45 secs || 30269894 markings, 75471699 edges, 612146 markings/sec, 45 secs
lola: sara is running 50 secs || sara is running 50 secs || 33384941 markings, 83245467 edges, 623009 markings/sec, 50 secs
lola: sara is running 55 secs || sara is running 55 secs || 36478487 markings, 90966044 edges, 618709 markings/sec, 55 secs
lola: sara is running 60 secs || sara is running 60 secs || 39543146 markings, 98615152 edges, 612932 markings/sec, 60 secs
lola: sara is running 65 secs || sara is running 65 secs || 42600159 markings, 106245959 edges, 611403 markings/sec, 65 secs
lola: sara is running 70 secs || sara is running 70 secs || 45616899 markings, 113775212 edges, 603348 markings/sec, 70 secs
lola: sara is running 75 secs || sara is running 75 secs || 48841280 markings, 121823483 edges, 644876 markings/sec, 75 secs
lola: sara is running 80 secs || sara is running 80 secs || 52031744 markings, 129788148 edges, 638093 markings/sec, 80 secs
lola: sara is running 85 secs || sara is running 85 secs || 55091060 markings, 137425813 edges, 611863 markings/sec, 85 secs
lola: sara is running 90 secs || sara is running 90 secs || 58246935 markings, 145302856 edges, 631175 markings/sec, 90 secs
lola: sara is running 95 secs || sara is running 95 secs || 61370472 markings, 153102078 edges, 624707 markings/sec, 95 secs
lola: sara is running 100 secs || sara is running 100 secs || 64410280 markings, 160689520 edges, 607962 markings/sec, 100 secs
lola: sara is running 105 secs || sara is running 105 secs || 67445449 markings, 168266889 edges, 607034 markings/sec, 105 secs
lola: sara is running 110 secs || sara is running 110 secs || 70521477 markings, 175948078 edges, 615206 markings/sec, 110 secs
lola: sara is running 115 secs || sara is running 115 secs || 73612674 markings, 183664817 edges, 618239 markings/sec, 115 secs
lola: sara is running 120 secs || sara is running 120 secs || 76651805 markings, 191253079 edges, 607826 markings/sec, 120 secs
lola: sara is running 125 secs || sara is running 125 secs || 79682935 markings, 198821038 edges, 606226 markings/sec, 125 secs
lola: sara is running 130 secs || sara is running 130 secs || 82640410 markings, 206204398 edges, 591495 markings/sec, 130 secs
lola: sara is running 135 secs || sara is running 135 secs || 85615727 markings, 213634191 edges, 595063 markings/sec, 135 secs
lola: sara is running 140 secs || sara is running 140 secs || 88594192 markings, 221071821 edges, 595693 markings/sec, 140 secs
lola: sara is running 145 secs || sara is running 145 secs || 91744263 markings, 228936059 edges, 630014 markings/sec, 145 secs
lola: sara is running 150 secs || sara is running 150 secs || 94456124 markings, 235708219 edges, 542372 markings/sec, 150 secs
lola: sara is running 155 secs || sara is running 155 secs || 97213032 markings, 242590524 edges, 551382 markings/sec, 155 secs
lola: sara is running 160 secs || sara is running 160 secs || 100065326 markings, 249713718 edges, 570459 markings/sec, 160 secs
lola: sara is running 165 secs || sara is running 165 secs || 103035605 markings, 257129595 edges, 594056 markings/sec, 165 secs
lola: sara is running 170 secs || sara is running 170 secs || 105731508 markings, 263863567 edges, 539181 markings/sec, 170 secs
lola: sara is running 175 secs || sara is running 175 secs || 108313624 markings, 270309816 edges, 516423 markings/sec, 175 secs
lola: sara is running 180 secs || sara is running 180 secs || 110799170 markings, 276517126 edges, 497109 markings/sec, 180 secs
lola: sara is running 185 secs || sara is running 185 secs || 113327818 markings, 282832057 edges, 505730 markings/sec, 185 secs
lola: sara is running 190 secs || sara is running 190 secs || 115916884 markings, 289295644 edges, 517813 markings/sec, 190 secs
lola: sara is running 195 secs || sara is running 195 secs || 118644440 markings, 296107827 edges, 545511 markings/sec, 195 secs
lola: sara is running 200 secs || sara is running 200 secs || 121416847 markings, 303029625 edges, 554481 markings/sec, 200 secs
lola: sara is running 205 secs || sara is running 205 secs || 124132541 markings, 309812105 edges, 543139 markings/sec, 205 secs
lola: sara is running 210 secs || sara is running 210 secs || 126715770 markings, 316262921 edges, 516646 markings/sec, 210 secs
lola: sara is running 215 secs || sara is running 215 secs || 129291538 markings, 322694826 edges, 515154 markings/sec, 215 secs
lola: sara is running 220 secs || sara is running 220 secs || 131736135 markings, 328801073 edges, 488919 markings/sec, 220 secs
lola: sara is running 225 secs || sara is running 225 secs || 134467683 markings, 335622636 edges, 546310 markings/sec, 225 secs
lola: sara is running 230 secs || sara is running 230 secs || 137048831 markings, 342067675 edges, 516230 markings/sec, 230 secs
lola: sara is running 235 secs || sara is running 235 secs || 139496846 markings, 348182552 edges, 489603 markings/sec, 235 secs
lola: sara is running 240 secs || sara is running 240 secs || 141574573 markings, 353370207 edges, 415545 markings/sec, 240 secs
lola: sara is running 245 secs || sara is running 245 secs || 143337600 markings, 357773314 edges, 352605 markings/sec, 245 secs
lola: sara is running 250 secs || sara is running 250 secs || 145659814 markings, 363572919 edges, 464443 markings/sec, 250 secs
lola: sara is running 255 secs || sara is running 255 secs || 147993328 markings, 369400648 edges, 466703 markings/sec, 255 secs
lola: sara is running 260 secs || sara is running 260 secs || 150346456 markings, 375277424 edges, 470626 markings/sec, 260 secs
lola: sara is running 265 secs || sara is running 265 secs || 152946064 markings, 381768009 edges, 519922 markings/sec, 265 secs
lola: sara is running 270 secs || sara is running 270 secs || 155053686 markings, 387033035 edges, 421524 markings/sec, 270 secs
lola: sara is running 275 secs || sara is running 275 secs || 157911982 markings, 394170688 edges, 571659 markings/sec, 275 secs
lola: sara is running 280 secs || sara is running 280 secs || 160662913 markings, 401039889 edges, 550186 markings/sec, 280 secs
lola: sara is running 285 secs || sara is running 285 secs || 163090911 markings, 407106195 edges, 485600 markings/sec, 285 secs
lola: sara is running 290 secs || sara is running 290 secs || 165652439 markings, 413501020 edges, 512306 markings/sec, 290 secs
lola: sara is running 295 secs || sara is running 295 secs || 168048869 markings, 419488176 edges, 479286 markings/sec, 295 secs
lola: sara is running 300 secs || sara is running 300 secs || 170467659 markings, 425528319 edges, 483758 markings/sec, 300 secs
lola: sara is running 305 secs || sara is running 305 secs || 172837713 markings, 431446828 edges, 474011 markings/sec, 305 secs
lola: sara is running 310 secs || sara is running 310 secs || 172909764 markings, 431627020 edges, 14410 markings/sec, 310 secs
lola: sara is running 315 secs || sara is running 315 secs || 172911290 markings, 431630716 edges, 305 markings/sec, 315 secs
lola: sara is running 320 secs || sara is running 320 secs || 173004643 markings, 431864317 edges, 18671 markings/sec, 320 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 11 will run for 1005 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (((3 <= p2) AND (p8 <= p1)) AND (A (G ((3 <= p1))) AND ((p2 + 1 <= p8) OR (p5 <= p4) OR ((3 <= p1) AND ((2 <= p8) OR (1 <= p4))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 11 will run for 1005 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((3 <= p1)))
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 ((3 <= p1)))
lola: processed formula length: 17
lola: 23 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
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: (p1 <= 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
lola: The predicate is not invariant.
lola: 1533 markings, 1532 edges
lola: state equation: write sara problem file to CTLCardinality-11-0.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: ========================================
lola: subprocess 12 will run for 1507 seconds at most (--localtimelimit=0)
lola: ========================================
sara: try reading problem file CTLCardinality-11-0.sara.
sara: place or transition ordering is non-deterministic
lola: ...considering subproblem: (E ((((p6 <= p8) OR (p4 <= p3)) U (2 <= p5))) AND (p4 <= p8))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 12 will run for 1507 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (p4 <= p8)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p4 <= p8)
lola: processed formula length: 10
lola: 21 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 13 will run for 3014 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E ((((p6 <= p8) OR (p4 <= p3)) U (2 <= p5)))
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 ((((p6 <= p8) OR (p4 <= p3)) U (2 <= p5)))
lola: processed formula length: 45
lola: 24 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (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: (2 <= p5)
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-13-0.sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space /EU
lola: There is no path where Predicate Phi holds until Predicate Psi.
lola: 513 markings, 512 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 13 will run for 3014 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (NOT DEADLOCK AND ((p4 <= p3) AND (A (G ((p2 <= p6))) AND ((1 <= p2) OR (p0 <= p8) OR ((p3 <= p7))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 13 will run for 3014 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: NOT DEADLOCK
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: NOT DEADLOCK
lola: processed formula length: 12
lola: 21 rewrites
lola: closed formula file CTLCardinality.xml
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 15 will run for 1 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((p2 <= p6)))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: A (G ((p2 <= p6)))
lola: processed formula length: 18
lola: 23 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (p6 + 1 <= p2)
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to CTLCardinality-15-0.sara
lola: state equation: calling and running sara
sara: try reading problem file CTLCardinality-15-0.sara.

sara: place or transition ordering is non-deterministic
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 1540 markings, 1539 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: ========================================
lola: ...considering subproblem: A (G (E (F ((p3 <= p2)))))
lola: ========================================
lola: SUBTASK
lola: checking liveness
lola: rewrite Frontend/Parser/formula_rewrite.k:603
lola: rewrite Frontend/Parser/formula_rewrite.k:613
lola: rewrite Frontend/Parser/formula_rewrite.k:703
lola: processed formula: (p3 <= p2)
lola: processed formula length: 10
lola: 24 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using tscc preserving stubborn set method (--stubborn)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (p2 + 1 <= p3)
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to CTLCardinality-14-0.sara
lola: state equation task get result started, id 1
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: state equation task get result rewrite finished id 1
lola: state equation task get result unparse finished++ id 1
lola: formula 1: (p3 <= p2)
lola: state equation task get result unparse finished id 1
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to CTLCardinality-14-1.sara
lola: state equation: calling and running sara
sara: try reading problem file CTLCardinality-14-1.sara.
sara: place or transition ordering is non-deterministic

lola: state equation 1: solution produced
lola: sara is running 0 secs || sara is running 0 secs || 3417964 markings, 8497044 edges, 683593 markings/sec, 0 secs
lola: sara is running 5 secs || sara is running 5 secs || 6703568 markings, 16684867 edges, 657121 markings/sec, 5 secs
lola: sara is running 10 secs || sara is running 10 secs || 9920437 markings, 24704854 edges, 643374 markings/sec, 10 secs
lola: sara is running 15 secs || sara is running 15 secs || 13163155 markings, 32791267 edges, 648544 markings/sec, 15 secs
lola: sara is running 20 secs || sara is running 20 secs || 16272173 markings, 40546077 edges, 621804 markings/sec, 20 secs
lola: sara is running 25 secs || sara is running 25 secs || 19262301 markings, 48005523 edges, 598026 markings/sec, 25 secs
lola: sara is running 30 secs || sara is running 30 secs || 22428725 markings, 55905797 edges, 633285 markings/sec, 30 secs
lola: sara is running 35 secs || sara is running 35 secs || 25520965 markings, 63621350 edges, 618448 markings/sec, 35 secs
lola: sara is running 40 secs || sara is running 40 secs || 28574982 markings, 71242785 edges, 610803 markings/sec, 40 secs
lola: sara is running 45 secs || sara is running 45 secs || 31522700 markings, 78598377 edges, 589544 markings/sec, 45 secs
lola: sara is running 50 secs || sara is running 50 secs || 34555338 markings, 86167079 edges, 606528 markings/sec, 50 secs
lola: sara is running 55 secs || sara is running 55 secs || 37554462 markings, 93652803 edges, 599825 markings/sec, 55 secs
lola: sara is running 60 secs || sara is running 60 secs || 40504489 markings, 101014475 edges, 590005 markings/sec, 60 secs
lola: sara is running 65 secs || sara is running 65 secs || 43479242 markings, 108439284 edges, 594951 markings/sec, 65 secs
lola: sara is running 70 secs || sara is running 70 secs || 46512330 markings, 116010913 edges, 606618 markings/sec, 70 secs
lola: sara is running 75 secs || sara is running 75 secs || 49581854 markings, 123673407 edges, 613905 markings/sec, 75 secs
lola: sara is running 80 secs || sara is running 80 secs || 52575691 markings, 131145718 edges, 598767 markings/sec, 80 secs
lola: sara is running 85 secs || sara is running 85 secs || 55667410 markings, 138864430 edges, 618344 markings/sec, 85 secs
lola: sara is running 90 secs || sara is running 90 secs || 58720159 markings, 146485024 edges, 610550 markings/sec, 90 secs
lola: sara is running 95 secs || sara is running 95 secs || 61715678 markings, 153964111 edges, 599104 markings/sec, 95 secs
lola: sara is running 100 secs || sara is running 100 secs || 64595740 markings, 161153497 edges, 576012 markings/sec, 100 secs
lola: sara is running 105 secs || sara is running 105 secs || 67540339 markings, 168504372 edges, 588920 markings/sec, 105 secs
lola: sara is running 110 secs || sara is running 110 secs || 70484142 markings, 175854658 edges, 588761 markings/sec, 110 secs
lola: sara is running 115 secs || sara is running 115 secs || 73446431 markings, 183251268 edges, 592458 markings/sec, 115 secs
lola: sara is running 120 secs || sara is running 120 secs || 76296284 markings, 190365633 edges, 569971 markings/sec, 120 secs
lola: sara is running 125 secs || sara is running 125 secs || 79195713 markings, 197604146 edges, 579886 markings/sec, 125 secs
lola: sara is running 130 secs || sara is running 130 secs || 82021445 markings, 204659847 edges, 565146 markings/sec, 130 secs
lola: sara is running 135 secs || sara is running 135 secs || 84923084 markings, 211905546 edges, 580328 markings/sec, 135 secs
lola: sara is running 140 secs || sara is running 140 secs || 87771794 markings, 219018371 edges, 569742 markings/sec, 140 secs
lola: sara is running 145 secs || sara is running 145 secs || 90707689 markings, 226346925 edges, 587179 markings/sec, 145 secs
lola: sara is running 150 secs || sara is running 150 secs || 93648600 markings, 233692268 edges, 588182 markings/sec, 150 secs
lola: sara is running 155 secs || sara is running 155 secs || 96598694 markings, 241057983 edges, 590019 markings/sec, 155 secs
lola: sara is running 160 secs || sara is running 160 secs || 99425423 markings, 248114815 edges, 565346 markings/sec, 160 secs
lola: sara is running 165 secs || sara is running 165 secs || 102224830 markings, 255105502 edges, 559881 markings/sec, 165 secs
lola: sara is running 170 secs || sara is running 170 secs || 105082228 markings, 262241032 edges, 571480 markings/sec, 170 secs
lola: sara is running 175 secs || sara is running 175 secs || 107972462 markings, 269458604 edges, 578047 markings/sec, 175 secs
lola: sara is running 180 secs || sara is running 180 secs || 110887743 markings, 276738782 edges, 583056 markings/sec, 180 secs
lola: sara is running 185 secs || sara is running 185 secs || 113812032 markings, 284041222 edges, 584858 markings/sec, 185 secs
lola: sara is running 190 secs || sara is running 190 secs || 116782192 markings, 291458252 edges, 594032 markings/sec, 190 secs
lola: sara is running 195 secs || sara is running 195 secs || 119823450 markings, 299050422 edges, 608252 markings/sec, 195 secs
lola: sara is running 200 secs || sara is running 200 secs || 122861294 markings, 306639095 edges, 607569 markings/sec, 200 secs
lola: sara is running 205 secs || sara is running 205 secs || 125890676 markings, 314203502 edges, 605876 markings/sec, 205 secs
lola: sara is running 210 secs || sara is running 210 secs || 128909041 markings, 321740427 edges, 603673 markings/sec, 210 secs
lola: sara is running 215 secs || sara is running 215 secs || 131864531 markings, 329119994 edges, 591098 markings/sec, 215 secs
lola: sara is running 220 secs || sara is running 220 secs || 134823995 markings, 336511647 edges, 591893 markings/sec, 220 secs
lola: sara is running 225 secs || sara is running 225 secs || 137842619 markings, 344048649 edges, 603725 markings/sec, 225 secs
lola: sara is running 230 secs || sara is running 230 secs || 140599241 markings, 350935390 edges, 551324 markings/sec, 230 secs
lola: sara is running 235 secs || sara is running 235 secs || 143042983 markings, 357036372 edges, 488748 markings/sec, 235 secs
lola: sara is running 240 secs || sara is running 240 secs || 145613097 markings, 363455989 edges, 514023 markings/sec, 240 secs
lola: sara is running 245 secs || sara is running 245 secs || 148060141 markings, 369568183 edges, 489409 markings/sec, 245 secs
lola: sara is running 250 secs || sara is running 250 secs || 150618164 markings, 375954593 edges, 511605 markings/sec, 250 secs
lola: sara is running 255 secs || sara is running 255 secs || 152802141 markings, 381408242 edges, 436795 markings/sec, 255 secs
lola: sara is running 260 secs || sara is running 260 secs || 155426424 markings, 387962906 edges, 524857 markings/sec, 260 secs
lola: sara is running 265 secs || sara is running 265 secs || 158017145 markings, 394433706 edges, 518144 markings/sec, 265 secs
lola: sara is running 270 secs || sara is running 270 secs || 160502312 markings, 400640447 edges, 497033 markings/sec, 270 secs
lola: sara is running 275 secs || sara is running 275 secs || 163117449 markings, 407169931 edges, 523027 markings/sec, 275 secs
lola: sara is running 280 secs || sara is running 280 secs || 165813745 markings, 413904542 edges, 539259 markings/sec, 280 secs
lola: sara is running 285 secs || sara is running 285 secs || 168221277 markings, 419916668 edges, 481506 markings/sec, 285 secs
lola: sara is running 290 secs || sara is running 290 secs || 170744769 markings, 426219024 edges, 504698 markings/sec, 290 secs
lola: sara is running 295 secs || sara is running 295 secs || 172881962 markings, 431557410 edges, 427439 markings/sec, 295 secs
lola: sara is running 300 secs || sara is running 300 secs || 173035087 markings, 431940436 edges, 30625 markings/sec, 300 secs
lola: Child process aborted or communication problem between parent and child process
lola: RESULT
lola:
SUMMARY: no no no no yes unknown yes yes no yes yes no yes no
lola:
preliminary result: no no no no yes unknown yes yes no yes yes no yes no
lola: memory consumption: 3360 KB
lola: time consumption: 864 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: 16427460 kB
MemFree: 16296696 kB
After kill :
MemTotal: 16427460 kB
MemFree: 16296192 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="SmallOperatingSystem-PT-MT1024DC0512"
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 SmallOperatingSystem-PT-MT1024DC0512, 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 r194-csrt-159033389500099"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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