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.r182-oct2-158987913400115.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 BART-PT-050, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r182-oct2-158987913400115
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 22M
-rw-r--r-- 1 mcc users 4.6K Apr 15 13:45 CTLCardinality.txt
-rw-r--r-- 1 mcc users 21K Apr 15 13:45 CTLCardinality.xml
-rw-r--r-- 1 mcc users 3.5K Apr 15 13:36 CTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 15 13:36 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 24 05:37 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.1K Mar 24 05:37 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 1.5M Apr 8 14:42 LTLCardinality.txt
-rw-r--r-- 1 mcc users 3.7M Apr 28 14:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.4M Apr 8 14:42 LTLFireability.txt
-rw-r--r-- 1 mcc users 3.3M Apr 28 14:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 5.0K Apr 15 13:29 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 22K Apr 15 13:29 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.6K Apr 15 13:24 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 15K Apr 15 13:24 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 15 13:29 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 15 13:29 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 24 05:37 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 24 05:37 instance
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 iscolored
-rw-r--r-- 1 mcc users 12M 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 BART-PT-050-CTLCardinality-00
FORMULA_NAME BART-PT-050-CTLCardinality-01
FORMULA_NAME BART-PT-050-CTLCardinality-02
FORMULA_NAME BART-PT-050-CTLCardinality-03
FORMULA_NAME BART-PT-050-CTLCardinality-04
FORMULA_NAME BART-PT-050-CTLCardinality-05
FORMULA_NAME BART-PT-050-CTLCardinality-06
FORMULA_NAME BART-PT-050-CTLCardinality-07
FORMULA_NAME BART-PT-050-CTLCardinality-08
FORMULA_NAME BART-PT-050-CTLCardinality-09
FORMULA_NAME BART-PT-050-CTLCardinality-10
FORMULA_NAME BART-PT-050-CTLCardinality-11
FORMULA_NAME BART-PT-050-CTLCardinality-12
FORMULA_NAME BART-PT-050-CTLCardinality-13
FORMULA_NAME BART-PT-050-CTLCardinality-14
FORMULA_NAME BART-PT-050-CTLCardinality-15

=== Now, execution of the tool begins

BK_START 1591128035187

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-02 20:00:37] [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-02 20:00:37] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-02 20:00:37] [INFO ] Load time of PNML (sax parser for PT used): 536 ms
[2020-06-02 20:00:37] [INFO ] Transformed 6810 places.
[2020-06-02 20:00:37] [INFO ] Transformed 10100 transitions.
[2020-06-02 20:00:37] [INFO ] Found NUPN structural information;
[2020-06-02 20:00:37] [INFO ] Parsed PT model containing 6810 places and 10100 transitions in 714 ms.
Reduce places removed 210 places and 0 transitions.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 95 ms.
Incomplete random walk after 100000 steps, including 0 resets, run finished after 825 ms. (steps per millisecond=121 ) properties seen :[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 0, 1]
// Phase 1: matrix 10100 rows 6600 cols
[2020-06-02 20:00:39] [INFO ] Computed 50 place invariants in 171 ms
[2020-06-02 20:00:41] [INFO ] [Real]Absence check using 50 positive place invariants in 395 ms returned sat
[2020-06-02 20:00:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-02 20:00:59] [INFO ] [Real]Absence check using state equation in 18082 ms returned (error "Solver has unexpectedly terminated")
[2020-06-02 20:01:00] [INFO ] [Real]Absence check using 50 positive place invariants in 359 ms returned sat
[2020-06-02 20:01:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-02 20:01:19] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-02 20:01:19] [INFO ] [Real]Absence check using state equation in 19113 ms returned (error "Failed to check-sat")
[2020-06-02 20:01:19] [INFO ] Initial state reduction rules for CTL removed 4 formulas.
[2020-06-02 20:01:19] [INFO ] Flatten gal took : 487 ms
[2020-06-02 20:01:20] [INFO ] Initial state reduction rules for CTL removed 4 formulas.
[2020-06-02 20:01:20] [INFO ] Flatten gal took : 227 ms
FORMULA BART-PT-050-CTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BART-PT-050-CTLCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BART-PT-050-CTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BART-PT-050-CTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-06-02 20:01:20] [INFO ] Export to MCC properties in file /home/mcc/execution/CTLCardinality.sr.xml took 3 ms.
[2020-06-02 20:01:20] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 58 ms.
info: Time: 3600 - MCC
vrfy: Checking CTLCardinality @ BART-PT-050 @ 3570 seconds

FORMULA BART-PT-050-CTLCardinality-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA BART-PT-050-CTLCardinality-04 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA BART-PT-050-CTLCardinality-09 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA BART-PT-050-CTLCardinality-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA BART-PT-050-CTLCardinality-01 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA BART-PT-050-CTLCardinality-00 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA BART-PT-050-CTLCardinality-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA BART-PT-050-CTLCardinality-05 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA BART-PT-050-CTLCardinality-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA BART-PT-050-CTLCardinality-06 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA BART-PT-050-CTLCardinality-03 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA BART-PT-050-CTLCardinality-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 3376
rslt: Output for CTLCardinality @ BART-PT-050

{
"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",
"--safe",
"--check=modelchecking",
"--stubborn=tarjan",
"--stateequation=par",
"--quickchecks",
"--timelimit=3570",
"--localtimelimit=0",
"--preference=force_ctl",
"--json=CTLCardinality.json",
"--jsoninclude=formula,formulastat,net"
],
"starttime": "Tue Jun 2 20:01:20 2020
",
"timelimit": 3570
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 281
},
"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": "TRUE",
"processed_size": 4,
"rewrites": 19
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 0,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 307
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 1,
"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": "AX(NOT DEADLOCK)",
"processed_size": 16,
"rewrites": 20
},
"net":
{
"conflict_clusters": 6600,
"singleton_clusters": 0
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "CTL model checker",
"value": true
},
"task":
{
"compoundnumber": 1,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 337
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 1,
"F": 0,
"G": 0,
"U": 1,
"X": 1,
"aconj": 4,
"adisj": 2,
"aneg": 0,
"comp": 4,
"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": "AX(E((((p5922 <= 0)) OR ((1 <= p4223))) U (((p2536 <= 0)) OR ((1 <= p5769)))))",
"processed_size": 80,
"rewrites": 21
},
"net":
{
"conflict_clusters": 6600,
"singleton_clusters": 0
},
"result":
{
"edges": 2437,
"markings": 2438,
"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": 375
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 2,
"F": 0,
"G": 1,
"U": 0,
"X": 1,
"aconj": 5,
"adisj": 2,
"aneg": 0,
"comp": 5,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 5,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "EG((EX((((p4306 <= 0)) OR ((1 <= p5431)))) OR ((1 <= p5053) AND (((p1369 <= 0)) OR ((1 <= p6234))))))",
"processed_size": 103,
"rewrites": 21
},
"net":
{
"conflict_clusters": 6600,
"singleton_clusters": 0
},
"result":
{
"edges": 666,
"markings": 666,
"produced_by": "CTL model checker",
"value": true
},
"task":
{
"compoundnumber": 3,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
},

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

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 482
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 2,
"adisj": 1,
"aneg": 1,
"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 <= p1455)) AND ((p5653 <= 0)))))",
"processed_size": 43,
"rewrites": 20
},
"result":
{
"edges": 4,
"markings": 5,
"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": 2,
"problems": 2
},
"type": "reachability",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 562
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 2,
"adisj": 5,
"aneg": 0,
"comp": 5,
"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": "A (G (((p3653 <= 0) OR (((1 <= p2108)) AND ((p4759 <= 0))) OR (((1 <= p4125)) AND ((p122 <= 0))))))",
"processed_size": 101,
"rewrites": 21
},
"result":
{
"edges": 4,
"markings": 5,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 6,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 12,
"problems": 4
},
"type": "invariance",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 675
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"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": "((p3139 <= 0))",
"processed_size": 14,
"rewrites": 22
},
"result":
{
"edges": 19,
"markings": 19,
"produced_by": "state space / EG",
"value": false
},
"task":
{
"compoundnumber": 7,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 4
},
"threads": 1,
"type": "dfs"
},
"type": "eventual_occurrence",
"workflow": "stateequation"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 844
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 4,
"adisj": 3,
"aneg": 1,
"comp": 5,
"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": "(((p2110 <= 0)) OR ((1 <= p5406)) OR (((1 <= p5866)) AND ((p4389 <= 0)) AND ((p120 <= 0))))",
"processed_size": 93,
"rewrites": 22
},
"result":
{
"edges": 19,
"markings": 19,
"produced_by": "state space / EG",
"value": false
},
"task":
{
"compoundnumber": 8,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 13
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 9,
"problems": 3
},
"type": "eventual_occurrence",
"workflow": "stateequation"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1125
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"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 (((1 <= p4485))))",
"processed_size": 22,
"rewrites": 20
},
"result":
{
"edges": 4,
"markings": 5,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 9,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "reachability",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1688
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 2,
"adisj": 1,
"aneg": 1,
"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": "(((1 <= p4968)) AND ((p2651 <= 0)))",
"processed_size": 35,
"rewrites": 22
},
"result":
{
"edges": 0,
"markings": 1,
"produced_by": "state space / EG",
"value": true
},
"task":
{
"compoundnumber": 10,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 5
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 2,
"problems": 2
},
"type": "eventual_occurrence",
"workflow": "stateequation"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": true
},
"task":
{
"compoundnumber": 9,
"type": "boolean"
}
},

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

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

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3376
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 8,
"adisj": 2,
"aneg": 0,
"comp": 8,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 8,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 8,
"visible_transitions": 0
},
"processed": "((1 <= p5816) AND (((1 <= p5864))) AND (((1 <= p5020)) OR ((p3228 <= 0)) OR ((1 <= p5244)) OR ((1 <= p1219)) OR ((p5109 <= 0)) OR ((1 <= p1370))))",
"processed_size": 151,
"rewrites": 19
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 11,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": null
},
"task":
{
"compoundnumber": 11,
"type": "boolean"
}
},

{
"child":
[

{
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 8,
"adisj": 2,
"aneg": 0,
"comp": 8,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 8,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 8,
"visible_transitions": 0
},
"processed": "((1 <= p5816) AND (((1 <= p5864))) AND (((1 <= p5020)) OR ((p3228 <= 0)) OR ((1 <= p5244)) OR ((1 <= p1219)) OR ((p5109 <= 0)) OR ((1 <= p1370))))",
"processed_size": 151,
"rewrites": 19
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 12,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"formula":
{
"count":
{
"A": 1,
"E": 1,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 2,
"adisj": 1,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "AF(EG((((p4394 <= 0)) OR ((1 <= p626)))))",
"processed_size": 42,
"rewrites": 21
},
"net":
{
"conflict_clusters": 6600,
"singleton_clusters": 0
},
"result":
{
"edges": 667,
"markings": 666,
"produced_by": "CTL model checker",
"value": true
},
"task":
{
"compoundnumber": 13,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
}
],
"result":
{
"produced_by": "boolean",
"value": true
},
"task":
{
"compoundnumber": 12,
"type": "boolean"
}
}
],
"exit":
{
"error": null,
"memory": 363624,
"runtime": 194.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "CTLCardinality.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "E(F(*)) : (A(X(**)) AND A(F(*))) : (A(F(**)) AND A(G(*))) : A(X(NODEADLOCK)) : A(F(**)) : (A(F(**)) AND E(F(**))) : A(X(E((** U **)))) : E(G((E(X(**)) OR **))) : A(F(**)) : TRUE : (A(F(E(G(**)))) OR **) : A(G(**))"
},
"net":
{
"arcs": 20200,
"conflict_clusters": 6600,
"places": 6600,
"places_significant": 6550,
"singleton_clusters": 0,
"transitions": 10100
},
"result":
{
"preliminary_value": "yes no no yes no yes yes yes no yes yes no ",
"value": "yes no no yes no yes yes yes no yes 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: 16700/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 6600
lola: finding significant places
lola: 6600 places, 10100 transitions, 6550 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: (p5653 <= 1)
lola: LP says that atomic proposition is always true: (p4695 <= 1)
lola: LP says that atomic proposition is always true: (p279 <= 1)
lola: LP says that atomic proposition is always true: (p1771 <= 1)
lola: LP says that atomic proposition is always true: (p4014 <= 1)
lola: LP says that atomic proposition is always true: (p6136 <= 1)
lola: LP says that atomic proposition is always true: (p4874 <= 1)
lola: LP says that atomic proposition is always true: (p3640 <= 1)
lola: LP says that atomic proposition is always true: (p3139 <= 1)
lola: LP says that atomic proposition is always true: (p2651 <= 1)
lola: LP says that atomic proposition is always true: (p4485 <= 1)
lola: LP says that atomic proposition is always true: (p4223 <= 1)
lola: LP says that atomic proposition is always true: (p5769 <= 1)
lola: LP says that atomic proposition is always true: (p5431 <= 1)
lola: LP says that atomic proposition is always true: (p5053 <= 1)
lola: LP says that atomic proposition is always true: (p6234 <= 1)
lola: LP says that atomic proposition is always true: (p5406 <= 1)
lola: LP says that atomic proposition is always true: (p4389 <= 1)
lola: LP says that atomic proposition is always true: (p120 <= 1)
lola: LP says that atomic proposition is always true: (p1819 <= 1)
lola: LP says that atomic proposition is always true: (p5719 <= 1)
lola: LP says that atomic proposition is always true: (p6438 <= 1)
lola: LP says that atomic proposition is always true: (p626 <= 1)
lola: LP says that atomic proposition is always true: (p5816 <= 1)
lola: LP says that atomic proposition is always true: (p5864 <= 1)
lola: LP says that atomic proposition is always true: (p1599 <= 1)
lola: LP says that atomic proposition is always true: (p5020 <= 1)
lola: LP says that atomic proposition is always true: (p5244 <= 1)
lola: LP says that atomic proposition is always true: (p1219 <= 1)
lola: LP says that atomic proposition is always true: (p1370 <= 1)
lola: LP says that atomic proposition is always true: (p3653 <= 1)
lola: LP says that atomic proposition is always true: (p4759 <= 1)
lola: LP says that atomic proposition is always true: (p122 <= 1)
lola: NOT(A (G ((((p1455 <= 0)) OR ((1 <= p5653)))))) : (A (X ((((p909 <= 0)) OR ((1 <= p4695)) OR ((1 <= p279)) OR ((1 <= p1771))))) AND NOT(E (G ((((p3198 <= 0)) OR ((1 <= p4014))))))) : (A (F ((((p519 <= 0)) OR ((1 <= p6136)) OR ((1 <= p4874))))) AND NOT(E (F ((((1 <= p2002)) AND ((p3640 <= 0))))))) : NOT(E (X (A (X ((1 <= 0)))))) : A (F (((1 <= p3139)))) : (A (F (A (F ((((p4968 <= 0)) OR ((1 <= p2651))))))) AND E (F (A (F (((1 <= p4485))))))) : A (X (E (((((p5922 <= 0)) OR ((1 <= p4223))) U (((p2536 <= 0)) OR ((1 <= p5769))))))) : E (G ((E (X ((((p4306 <= 0)) OR ((1 <= p5431))))) OR ((1 <= p5053) AND (((p1369 <= 0)) OR ((1 <= p6234))))))) : A (F ((((1 <= p2110)) AND ((p5406 <= 0)) AND (((p5866 <= 0)) OR ((1 <= p4389)) OR ((1 <= p120)))))) : A (G (())) : (A (F (E (G ((((p4394 <= 0)) OR ((1 <= p626))))))) OR ((1 <= p5816) AND (((1 <= p5864))) AND (((1 <= p5020)) OR ((p3228 <= 0)) OR ((1 <= p5244)) OR ((1 <= p1219)) OR ((p5109 <= 0)) OR ((1 <= p1370))))) : A (G (((p3653 <= 0) OR (((1 <= p2108)) AND ((p4759 <= 0))) OR (((1 <= p4125)) AND ((p122 <= 0))))))
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:326
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:139
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:285
lola: rewrite Frontend/Parser/formula_rewrite.k:392
lola: rewrite Frontend/Parser/formula_rewrite.k:455
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:160
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 281 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: TRUE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: TRUE
lola: processed formula length: 4
lola: 19 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: subprocess 1 will run for 307 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (NOT DEADLOCK))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:812
lola: processed formula: AX(NOT DEADLOCK)
lola: processed formula length: 16
lola: 20 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 0 significant temporal operators and needs 0 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 2 will run for 337 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (E (((((p5922 <= 0)) OR ((1 <= p4223))) U (((p2536 <= 0)) OR ((1 <= p5769)))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:809
lola: rewrite Frontend/Parser/formula_rewrite.k:812
lola: processed formula: AX(E((((p5922 <= 0)) OR ((1 <= p4223))) U (((p2536 <= 0)) OR ((1 <= p5769)))))
lola: processed formula length: 80
lola: 21 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 2438 markings, 2437 edges
lola: ========================================
lola: subprocess 3 will run for 375 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G ((E (X ((((p4306 <= 0)) OR ((1 <= p5431))))) OR ((1 <= p5053) AND (((p1369 <= 0)) OR ((1 <= p6234)))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:807
lola: rewrite Frontend/Parser/formula_rewrite.k:808
lola: processed formula: EG((EX((((p4306 <= 0)) OR ((1 <= p5431)))) OR ((1 <= p5053) AND (((p1369 <= 0)) OR ((1 <= p6234))))))
lola: processed formula length: 103
lola: 21 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 666 markings, 666 edges
lola: ========================================
lola: subprocess 4 will run for 422 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (X ((((p909 <= 0)) OR ((1 <= p4695)) OR ((1 <= p279)) OR ((1 <= p1771))))) AND A (F ((((1 <= p3198)) AND ((p4014 <= 0))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 4 will run for 422 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F ((((1 <= p3198)) AND ((p4014 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:584
lola: rewrite Frontend/Parser/formula_rewrite.k:749
lola: rewrite Frontend/Parser/formula_rewrite.k:788
lola: processed formula: (((p3198 <= 0)) OR ((1 <= p4014)))
lola: processed formula length: 35
lola: 22 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:700
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (((1 <= p3198)) AND ((p4014 <= 0)))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space / EG
lola: The predicate does not eventually occur.
lola: 19 markings, 19 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 5 will run for 482 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((((1 <= p1455)) AND ((p5653 <= 0)))))
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 <= p1455)) AND ((p5653 <= 0)))))
lola: processed formula length: 43
lola: 20 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (((1 <= p1455)) AND ((p5653 <= 0)))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 5 markings, 4 edges
lola: subprocess 6 will run for 562 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((p3653 <= 0) OR (((1 <= p2108)) AND ((p4759 <= 0))) OR (((1 <= p4125)) AND ((p122 <= 0))))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: A (G (((p3653 <= 0) OR (((1 <= p2108)) AND ((p4759 <= 0))) OR (((1 <= p4125)) AND ((p122 <= 0))))))
lola: processed formula length: 101
lola: 21 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((1 <= p3653) AND (((p2108 <= 0)) OR ((1 <= p4759))) AND (((p4125 <= 0)) OR ((1 <= p122))))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 12 literals and 4 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 5 markings, 4 edges
lola: ========================================
lola: subprocess 7 will run for 675 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (((1 <= p3139))))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:584
lola: rewrite Frontend/Parser/formula_rewrite.k:749
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: ((p3139 <= 0))
lola: processed formula length: 14
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 / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: state space / EG
lola: The predicate does not eventually occur.
lola: 19 markings, 19 edges
lola: ========================================
lola: ========================================
lola: subprocess 8 will run for 844 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F ((((1 <= p2110)) AND ((p5406 <= 0)) AND (((p5866 <= 0)) OR ((1 <= p4389)) OR ((1 <= p120))))))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:584
lola: rewrite Frontend/Parser/formula_rewrite.k:749
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: (((p2110 <= 0)) OR ((1 <= p5406)) OR (((1 <= p5866)) AND ((p4389 <= 0)) AND ((p120 <= 0))))
lola: processed formula length: 93
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 / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:700
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (((1 <= p2110)) AND ((p5406 <= 0)) AND (((p5866 <= 0)) OR ((1 <= p4389)) OR ((1 <= p120))))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 9 literals and 3 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space / EG
lola: The predicate does not eventually occur.
lola: 19 markings, 19 edges
lola: ========================================
lola: subprocess 9 will run for 1125 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (F ((((p4968 <= 0)) OR ((1 <= p2651))))) AND E (F (((1 <= p4485)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 9 will run for 1125 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((1 <= p4485))))
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 <= p4485))))
lola: processed formula length: 22
lola: 20 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((1 <= p4485))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 5 markings, 4 edges
lola: ========================================
lola: subprocess 10 will run for 1688 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F ((((p4968 <= 0)) OR ((1 <= p2651)))))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:584
lola: rewrite Frontend/Parser/formula_rewrite.k:749
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: (((1 <= p4968)) AND ((p2651 <= 0)))
lola: processed formula length: 35
lola: 22 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:700
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (((p4968 <= 0)) OR ((1 <= p2651)))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 2 literals and 2 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space / EG
lola: The predicate eventually occurs.
lola: 1 markings, 0 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 10 will run for 1688 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (F ((((p519 <= 0)) OR ((1 <= p6136)) OR ((1 <= p4874))))) AND A (G ((((p2002 <= 0)) OR ((1 <= p3640))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 10 will run for 1688 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((((p2002 <= 0)) OR ((1 <= p3640)))))
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 ((((p2002 <= 0)) OR ((1 <= p3640)))))
lola: processed formula length: 43
lola: 21 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:788
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (((1 <= p2002)) AND ((p3640 <= 0)))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 4 markings, 3 edges
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 11 will run for 3376 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (F (E (G ((((p4394 <= 0)) OR ((1 <= p626))))))) OR ((1 <= p5816) AND (((1 <= p5864))) AND (((1 <= p5020)) OR ((p3228 <= 0)) OR ((1 <= p5244)) OR ((1 <= p1219)) OR ((p5109 <= 0)) OR ((1 <= p1370)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 11 will run for 3376 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((1 <= p5816) AND (((1 <= p5864))) AND (((1 <= p5020)) OR ((p3228 <= 0)) OR ((1 <= p5244)) OR ((1 <= p1219)) OR ((p5109 <= 0)) OR ((1 <= p1370))))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((1 <= p5816) AND (((1 <= p5864))) AND (((1 <= p5020)) OR ((p3228 <= 0)) OR ((1 <= p5244)) OR ((1 <= p1219)) OR ((p5109 <= 0)) OR ((1 <= p1370))))
lola: processed formula length: 151
lola: 19 rewrites
lola: closed formula file CTLCardinality.xml
lola: processed formula with 8 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: ========================================
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: Child process aborted or communication problem between parent and child process
lola: SUBRESULT
lola: result: unknown
lola: The Boolean predicate may be true or false.
lola: ========================================
lola: ========================================
lola: ...considering subproblem: (A (F (E (G ((((p4394 <= 0)) OR ((1 <= p626))))))) OR ((1 <= p5816) AND (((1 <= p5864))) AND (((1 <= p5020)) OR ((p3228 <= 0)) OR ((1 <= p5244)) OR ((1 <= p1219)) OR ((p5109 <= 0)) OR ((1 <= p1370)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: ...considering subproblem: ((1 <= p5816) AND (((1 <= p5864))) AND (((1 <= p5020)) OR ((p3228 <= 0)) OR ((1 <= p5244)) OR ((1 <= p1219)) OR ((p5109 <= 0)) OR ((1 <= p1370))))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((1 <= p5816) AND (((1 <= p5864))) AND (((1 <= p5020)) OR ((p3228 <= 0)) OR ((1 <= p5244)) OR ((1 <= p1219)) OR ((p5109 <= 0)) OR ((1 <= p1370))))
lola: processed formula length: 151
lola: 19 rewrites
lola: closed formula file CTLCardinality.xml
lola: processed formula with 8 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: ========================================
lola: ...considering subproblem: A (F (E (G ((((p4394 <= 0)) OR ((1 <= p626)))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:808
lola: rewrite Frontend/Parser/formula_rewrite.k:811
lola: processed formula: AF(EG((((p4394 <= 0)) OR ((1 <= p626)))))
lola: processed formula length: 42
lola: 21 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 666 markings, 667 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: RESULT
lola:
SUMMARY: yes no no yes no yes yes yes no yes yes no
lola:
preliminary result: yes no no yes no yes yes yes no yes yes no
lola: memory consumption: 363624 KB
lola: time consumption: 194 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="BART-PT-050"
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 BART-PT-050, 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 r182-oct2-158987913400115"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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