Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2020-input.r211-tajo-159033478000795.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2020-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
...............
=====================================================================
Generated by BenchKit 2-4028
Executing tool itslola
Input is ShieldRVs-PT-004A, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r211-tajo-159033478000795
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 204K
-rw-r--r-- 1 mcc users 3.6K May 14 02:09 CTLCardinality.txt
-rw-r--r-- 1 mcc users 22K May 14 02:09 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 13 19:39 CTLFireability.txt
-rw-r--r-- 1 mcc users 15K May 13 19:39 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.0K May 14 10:04 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K May 14 10:04 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K May 14 10:04 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K May 14 10:04 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 May 12 20:42 NewModel
-rw-r--r-- 1 mcc users 4.1K May 13 14:20 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 23K May 13 14:20 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.9K May 13 09:04 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 20K May 13 09:04 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 13 16:53 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K May 13 16:53 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 12 20:42 equiv_col
-rw-r--r-- 1 mcc users 5 May 12 20:42 instance
-rw-r--r-- 1 mcc users 6 May 12 20:42 iscolored
-rw-r--r-- 1 mcc users 25K May 12 20:42 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 ShieldRVs-PT-004A-CTLCardinality-00
FORMULA_NAME ShieldRVs-PT-004A-CTLCardinality-01
FORMULA_NAME ShieldRVs-PT-004A-CTLCardinality-02
FORMULA_NAME ShieldRVs-PT-004A-CTLCardinality-03
FORMULA_NAME ShieldRVs-PT-004A-CTLCardinality-04
FORMULA_NAME ShieldRVs-PT-004A-CTLCardinality-05
FORMULA_NAME ShieldRVs-PT-004A-CTLCardinality-06
FORMULA_NAME ShieldRVs-PT-004A-CTLCardinality-07
FORMULA_NAME ShieldRVs-PT-004A-CTLCardinality-08
FORMULA_NAME ShieldRVs-PT-004A-CTLCardinality-09
FORMULA_NAME ShieldRVs-PT-004A-CTLCardinality-10
FORMULA_NAME ShieldRVs-PT-004A-CTLCardinality-11
FORMULA_NAME ShieldRVs-PT-004A-CTLCardinality-12
FORMULA_NAME ShieldRVs-PT-004A-CTLCardinality-13
FORMULA_NAME ShieldRVs-PT-004A-CTLCardinality-14
FORMULA_NAME ShieldRVs-PT-004A-CTLCardinality-15

=== Now, execution of the tool begins

BK_START 1591326459753

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-05 03:07:41] [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-05 03:07:41] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-05 03:07:41] [INFO ] Load time of PNML (sax parser for PT used): 35 ms
[2020-06-05 03:07:41] [INFO ] Transformed 59 places.
[2020-06-05 03:07:41] [INFO ] Transformed 79 transitions.
[2020-06-05 03:07:41] [INFO ] Found NUPN structural information;
[2020-06-05 03:07:41] [INFO ] Parsed PT model containing 59 places and 79 transitions in 67 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 13 ms.
Finished random walk after 215 steps, including 2 resets, run visited all 23 properties in 5 ms. (steps per millisecond=43 )
[2020-06-05 03:07:41] [INFO ] Initial state reduction rules for CTL removed 7 formulas.
[2020-06-05 03:07:41] [INFO ] Flatten gal took : 35 ms
[2020-06-05 03:07:41] [INFO ] Initial state reduction rules for CTL removed 7 formulas.
[2020-06-05 03:07:41] [INFO ] Flatten gal took : 11 ms
FORMULA ShieldRVs-PT-004A-CTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVs-PT-004A-CTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVs-PT-004A-CTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVs-PT-004A-CTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVs-PT-004A-CTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVs-PT-004A-CTLCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVs-PT-004A-CTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-06-05 03:07:41] [INFO ] Export to MCC properties in file /home/mcc/execution/CTLCardinality.sr.xml took 3 ms.
[2020-06-05 03:07:41] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 3 ms.
info: Time: 3600 - MCC
vrfy: Checking CTLCardinality @ ShieldRVs-PT-004A @ 3570 seconds

FORMULA ShieldRVs-PT-004A-CTLCardinality-00 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldRVs-PT-004A-CTLCardinality-09 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldRVs-PT-004A-CTLCardinality-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldRVs-PT-004A-CTLCardinality-04 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldRVs-PT-004A-CTLCardinality-08 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldRVs-PT-004A-CTLCardinality-02 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldRVs-PT-004A-CTLCardinality-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldRVs-PT-004A-CTLCardinality-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldRVs-PT-004A-CTLCardinality-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 3144
rslt: Output for CTLCardinality @ ShieldRVs-PT-004A

{
"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": "Fri Jun 5 03:07:41 2020
",
"timelimit": 3570
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 396
},
"exit":
{
"localtimelimitreached": false
},
"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": "((p56 <= 0))",
"processed_size": 12,
"rewrites": 11
},
"result":
{
"edges": 48,
"markings": 49,
"produced_by": "state space /EXEG",
"value": false
},
"task":
{
"compoundnumber": 0,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "invisibility based",
"visible": 2
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "invariance_from_all_successors",
"workflow": "stateequation"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 445
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 4,
"adisj": 1,
"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": "A (G ((((p10 <= 0)) OR ((1 <= p31)) OR ((p30 <= 0)) OR ((1 <= p14)))))",
"processed_size": 73,
"rewrites": 10
},
"result":
{
"edges": 15,
"markings": 16,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 1,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 4,
"problems": 4
},
"type": "invariance",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 509
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 3,
"adisj": 1,
"aneg": 1,
"comp": 3,
"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": "(((1 <= p45)) AND ((p1 <= 0)) AND ((p4 <= 0)))",
"processed_size": 46,
"rewrites": 12
},
"result":
{
"edges": 339978303,
"markings": 94214674,
"produced_by": "state space /EFEG",
"value": true
},
"task":
{
"compoundnumber": 2,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 8
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 3,
"problems": 3
},
"type": "eventual_occurrence_from_all_states",
"workflow": "stateequation"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 524
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 2,
"F": 0,
"G": 2,
"U": 0,
"X": 0,
"aconj": 3,
"adisj": 3,
"aneg": 0,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "EG((EG((((p52 <= 0)) OR ((1 <= p32)))) OR (((1 <= p17)) AND ((p38 <= 0)))))",
"processed_size": 76,
"rewrites": 10
},
"net":
{
"conflict_clusters": 11,
"singleton_clusters": 0
},
"result":
{
"edges": 6128,
"markings": 1986,
"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": 628
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 0,
"G": 0,
"U": 1,
"X": 0,
"aconj": 1,
"adisj": 3,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "E ((((p29 <= 0)) U (((1 <= p41)) AND ((p22 <= 0)))))",
"processed_size": 52,
"rewrites": 11
},
"result":
{
"edges": 974,
"markings": 357,
"produced_by": "state space /EU",
"value": false
},
"task":
{
"compoundnumber": 4,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "eu preserving",
"visible": 2
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 2,
"problems": 2
},
"type": "existential_until",
"workflow": "stateequation"
}
},

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

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1048
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 4,
"adisj": 1,
"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": "E (G ((((p48 <= 0)) OR ((1 <= p14)) OR ((p25 <= 0)) OR ((1 <= p3)))))",
"processed_size": 72,
"rewrites": 9
},
"result":
{
"edges": 87,
"markings": 87,
"produced_by": "state space / EG",
"value": true
},
"task":
{
"compoundnumber": 6,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 25
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 4,
"problems": 4
},
"type": "possible_preservation",
"workflow": "stateequation"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": true
},
"task":
{
"compoundnumber": 5,
"type": "boolean"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1048
},
"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 <= p53)) AND ((p28 <= 0)))))",
"processed_size": 39,
"rewrites": 9
},
"result":
{
"edges": 2,
"markings": 3,
"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"
},
"type": "reachability",
"workflow": "stateequation||search"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": true
},
"task":
{
"compoundnumber": 6,
"type": "boolean"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1572
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 0,
"G": 1,
"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": "E (G (((p23 <= 0))))",
"processed_size": 20,
"rewrites": 9
},
"result":
{
"edges": 8503,
"markings": 4240,
"produced_by": "state space / EG",
"value": false
},
"task":
{
"compoundnumber": 7,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 10
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "possible_preservation",
"workflow": "stateequation"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 7,
"type": "boolean"
}
},

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

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

{
"child":
[

{
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 1,
"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": "((p52 <= 0))",
"processed_size": 12,
"rewrites": 8
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 9,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 0,
"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": "E (G ((((p24 <= 0)) OR ((1 <= p34)))))",
"processed_size": 39,
"rewrites": 9
},
"result":
{
"edges": 124,
"markings": 125,
"produced_by": "state space / EG",
"value": true
},
"task":
{
"compoundnumber": 10,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 14
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 2,
"problems": 2
},
"type": "possible_preservation",
"workflow": "stateequation"
}
}
],
"result":
{
"produced_by": "boolean",
"value": true
},
"task":
{
"compoundnumber": 9,
"type": "boolean"
}
}
],
"exit":
{
"error": null,
"memory": 29044,
"runtime": 426.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "CTLCardinality.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "A(X(A(F(**)))) : (E(G(**)) AND (** AND **)) : E(G((E(G(**)) OR **))) : E((** U **)) : A(G(**)) : (E(G(*)) AND A(F(**))) : (A(G(**)) OR E(F(*))) : A(G(A(F(**)))) : (E(G(**)) AND (E((** U **)) OR **))"
},
"net":
{
"arcs": 368,
"conflict_clusters": 11,
"places": 59,
"places_significant": 42,
"singleton_clusters": 0,
"transitions": 79
},
"result":
{
"preliminary_value": "no yes yes no no no yes yes yes ",
"value": "no yes yes no no no yes yes yes "
},
"task":
{
"type": "compound"
}
}
lola: LoLA will run for 3570 seconds at most (--timelimit)
lola: NET
lola: input: PNML file (--pnml)
lola: reading net from model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file model.pnml
lola: 138/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 1888
lola: finding significant places
lola: 59 places, 79 transitions, 42 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: (p56 <= 1)
lola: LP says that atomic proposition is always true: (p14 <= 1)
lola: LP says that atomic proposition is always true: (p3 <= 1)
lola: LP says that atomic proposition is always true: (p47 <= 1)
lola: LP says that atomic proposition is always true: (p44 <= 1)
lola: LP says that atomic proposition is always true: (p32 <= 1)
lola: LP says that atomic proposition is always true: (p38 <= 1)
lola: LP says that atomic proposition is always true: (p29 <= 1)
lola: LP says that atomic proposition is always true: (p22 <= 1)
lola: LP says that atomic proposition is always true: (p31 <= 1)
lola: LP says that atomic proposition is always true: (p14 <= 1)
lola: LP says that atomic proposition is always true: (p23 <= 1)
lola: LP says that atomic proposition is always true: (p51 <= 1)
lola: LP says that atomic proposition is always true: (p33 <= 1)
lola: LP says that atomic proposition is always true: (p56 <= 1)
lola: LP says that atomic proposition is always true: (p28 <= 1)
lola: LP says that atomic proposition is always true: (p1 <= 1)
lola: LP says that atomic proposition is always true: (p4 <= 1)
lola: LP says that atomic proposition is always true: (p34 <= 1)
lola: LP says that atomic proposition is always true: (p39 <= 1)
lola: LP says that atomic proposition is always true: (p9 <= 1)
lola: LP says that atomic proposition is always true: (p52 <= 1)
lola: A (X (A (F (((1 <= p56)))))) : ((E (G ((((p48 <= 0)) OR ((1 <= p14)) OR ((p25 <= 0)) OR ((1 <= p3))))) AND ((p47 <= 0))) AND (((p56 <= 0)) OR ((1 <= p44)))) : E (G ((E (G ((((p52 <= 0)) OR ((1 <= p32))))) OR (((1 <= p17)) AND ((p38 <= 0)))))) : E ((((p29 <= 0)) U (((1 <= p41)) AND ((p22 <= 0))))) : A (G (A (G ((((p10 <= 0)) OR ((1 <= p31)) OR ((p30 <= 0)) OR ((1 <= p14))))))) : (NOT(A (F (((1 <= p23))))) AND A (F (((((p32 <= 0)) OR ((1 <= p51))) AND (((p14 <= 0)) OR ((1 <= p33))))))) : (A (G ((((p8 <= 0)) OR ((1 <= p56))))) OR NOT(A (G ((((p53 <= 0)) OR ((1 <= p28))))))) : A (G (A (F ((((p45 <= 0)) OR ((1 <= p1)) OR ((1 <= p4))))))) : (E (G ((((p24 <= 0)) OR ((1 <= p34))))) AND (E ((((1 <= p39)) U (((p14 <= 0)) OR ((1 <= p9))))) OR ((p52 <= 0))))
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:389
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (A (F (((1 <= p56))))))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence from all successors
lola: rewrite Frontend/Parser/formula_rewrite.k:584
lola: rewrite Frontend/Parser/formula_rewrite.k:754
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: ((p56 <= 0))
lola: processed formula length: 12
lola: 11 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 /EXEG)
lola: state space: using reachability graph (EXEG version) (--search=depth)
lola: state space: using invisibility based 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:753
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 <= p56))
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 /EXEG
lola: The predicate does not eventually occur from all successors.
lola: 49 markings, 48 edges
lola: state equation: write sara problem file to CTLCardinality-0.sara
lola: state equation: calling and running sara
sara: try reading problem file CTLCardinality-0.sara.
sara: place or transition ordering is non-deterministic

lola: ========================================
lola: subprocess 1 will run for 445 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((((p10 <= 0)) OR ((1 <= p31)) OR ((p30 <= 0)) OR ((1 <= p14)))))
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 ((((p10 <= 0)) OR ((1 <= p31)) OR ((p30 <= 0)) OR ((1 <= p14)))))
lola: processed formula length: 73
lola: 10 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 <= p10)) AND ((p31 <= 0)) AND ((1 <= p30)) AND ((p14 <= 0)))
lola: state equation task get result unparse finished id 0
lola: SUBRESULT
lola: state equation: Generated DNF with 4 literals and 1 conjunctive subformulas
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 16 markings, 15 edges
lola: subprocess 2 will run for 509 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (A (F ((((p45 <= 0)) OR ((1 <= p1)) OR ((1 <= p4)))))))
lola: ========================================
lola: SUBTASK
lola: lola: checking eventual occurrence from all statesstate equation: write sara problem file to CTLCardinality-0.sara

lola: rewrite Frontend/Parser/formula_rewrite.k:599
lola: rewrite Frontend/Parser/formula_rewrite.k:634
lola: rewrite Frontend/Parser/formula_rewrite.k:734
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: (((1 <= p45)) AND ((p1 <= 0)) AND ((p4 <= 0)))
lola: processed formula length: 46
lola: 12 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 /EFEG)
lola: state space: using reachability graph (EFEG 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: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 1
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: state equation task get result rewrite finished id 1
lola: state equation task get result unparse finished++ id 1
lola: formula 1: (((1 <= p45)) AND ((p1 <= 0)) AND ((p4 <= 0)))
lola: state equation task get result unparse finished id 1
lola: state equation: Generated DNF with 3 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to CTLCardinality-2-1.sara
lola: state equation: calling and running sara
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: (((p45 <= 0)) OR ((1 <= p1)) OR ((1 <= p4)))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 3 literals and 3 conjunctive subformulas
lola: state equation: write sara problem file to CTLCardinality-2-0.sara
lola: state equation: calling and running sara
sara: try reading problem file CTLCardinality-2-1.sara.
sara: place or transition ordering is non-deterministic
lola: ========================================
lola: state equation: calling and running sara
sara: try reading problem file CTLCardinality-2-0.sara.
sara: try reading problem file CTLCardinality-0.sara.

sara: place or transition ordering is non-deterministic
sara: place or transition ordering is non-deterministic
lola: state equation 1: solution produced


lola: state equation 0: solution produced
lola: sara is running 0 secs || sara is running 0 secs || 1435188 markings, 4861249 edges, 287038 markings/sec, 0 secs
lola: sara is running 5 secs || sara is running 5 secs || 2321927 markings, 8396638 edges, 177348 markings/sec, 5 secs
lola: sara is running 10 secs || sara is running 10 secs || 3493361 markings, 13006999 edges, 234287 markings/sec, 10 secs
lola: sara is running 15 secs || sara is running 15 secs || 4605176 markings, 17526538 edges, 222363 markings/sec, 15 secs
lola: sara is running 20 secs || sara is running 20 secs || 5637649 markings, 21699113 edges, 206495 markings/sec, 20 secs
lola: sara is running 25 secs || sara is running 25 secs || 6636338 markings, 25697507 edges, 199738 markings/sec, 25 secs
lola: sara is running 30 secs || sara is running 30 secs || 7719462 markings, 29786603 edges, 216625 markings/sec, 30 secs
lola: sara is running 35 secs || sara is running 35 secs || 8747160 markings, 33855307 edges, 205540 markings/sec, 35 secs
lola: sara is running 40 secs || sara is running 40 secs || 9724013 markings, 37830727 edges, 195371 markings/sec, 40 secs
lola: sara is running 45 secs || sara is running 45 secs || 10787742 markings, 41912608 edges, 212746 markings/sec, 45 secs
lola: sara is running 50 secs || sara is running 50 secs || 11820605 markings, 46055015 edges, 206573 markings/sec, 50 secs
lola: sara is running 55 secs || sara is running 55 secs || 12950407 markings, 50275662 edges, 225960 markings/sec, 55 secs
lola: sara is running 60 secs || sara is running 60 secs || 14045071 markings, 54332770 edges, 218933 markings/sec, 60 secs
lola: sara is running 65 secs || sara is running 65 secs || 15146725 markings, 58512752 edges, 220331 markings/sec, 65 secs
lola: sara is running 70 secs || sara is running 70 secs || 16245739 markings, 62644196 edges, 219803 markings/sec, 70 secs
lola: sara is running 75 secs || sara is running 75 secs || 17397825 markings, 66800731 edges, 230417 markings/sec, 75 secs
lola: sara is running 80 secs || sara is running 80 secs || 18418372 markings, 70676115 edges, 204109 markings/sec, 80 secs
lola: sara is running 85 secs || sara is running 85 secs || 19394922 markings, 74440074 edges, 195310 markings/sec, 85 secs
lola: sara is running 90 secs || sara is running 90 secs || 20393952 markings, 78323425 edges, 199806 markings/sec, 90 secs
lola: sara is running 95 secs || sara is running 95 secs || 21273603 markings, 82070489 edges, 175930 markings/sec, 95 secs
lola: sara is running 100 secs || sara is running 100 secs || 22234864 markings, 86008548 edges, 192252 markings/sec, 100 secs
lola: sara is running 105 secs || sara is running 105 secs || 23416277 markings, 90247837 edges, 236283 markings/sec, 105 secs
lola: sara is running 110 secs || sara is running 110 secs || 24529653 markings, 94492250 edges, 222675 markings/sec, 110 secs
lola: sara is running 115 secs || sara is running 115 secs || 25643345 markings, 98717662 edges, 222738 markings/sec, 115 secs
lola: sara is running 120 secs || sara is running 120 secs || 26758373 markings, 103024926 edges, 223006 markings/sec, 120 secs
lola: sara is running 125 secs || sara is running 125 secs || 27874197 markings, 107148365 edges, 223165 markings/sec, 125 secs
lola: sara is running 130 secs || sara is running 130 secs || 28890012 markings, 111259710 edges, 203163 markings/sec, 130 secs
lola: sara is running 135 secs || sara is running 135 secs || 29974371 markings, 115335616 edges, 216872 markings/sec, 135 secs
lola: sara is running 140 secs || sara is running 140 secs || 31109924 markings, 119519084 edges, 227111 markings/sec, 140 secs
lola: sara is running 145 secs || sara is running 145 secs || 32232067 markings, 123640805 edges, 224429 markings/sec, 145 secs
lola: sara is running 150 secs || sara is running 150 secs || 33315511 markings, 127597752 edges, 216689 markings/sec, 150 secs
lola: sara is running 155 secs || sara is running 155 secs || 34432440 markings, 131738371 edges, 223386 markings/sec, 155 secs
lola: sara is running 160 secs || sara is running 160 secs || 35621509 markings, 136126931 edges, 237814 markings/sec, 160 secs
lola: sara is running 165 secs || sara is running 165 secs || 36802822 markings, 140370076 edges, 236263 markings/sec, 165 secs
lola: sara is running 170 secs || sara is running 170 secs || 37950457 markings, 144456663 edges, 229527 markings/sec, 170 secs
lola: sara is running 175 secs || sara is running 175 secs || 39097680 markings, 148578223 edges, 229445 markings/sec, 175 secs
lola: sara is running 180 secs || sara is running 180 secs || 40234558 markings, 152627558 edges, 227376 markings/sec, 180 secs
lola: sara is running 185 secs || sara is running 185 secs || 41344805 markings, 156794822 edges, 222049 markings/sec, 185 secs
lola: sara is running 190 secs || sara is running 190 secs || 42478683 markings, 160904483 edges, 226776 markings/sec, 190 secs
lola: sara is running 195 secs || sara is running 195 secs || 43544801 markings, 164971918 edges, 213224 markings/sec, 195 secs
lola: sara is running 200 secs || sara is running 200 secs || 44618117 markings, 169047602 edges, 214663 markings/sec, 200 secs
lola: sara is running 205 secs || sara is running 205 secs || 45651699 markings, 173069651 edges, 206716 markings/sec, 205 secs
lola: sara is running 210 secs || sara is running 210 secs || 46759157 markings, 177121153 edges, 221492 markings/sec, 210 secs
lola: sara is running 215 secs || sara is running 215 secs || 47893183 markings, 181236518 edges, 226805 markings/sec, 215 secs
lola: sara is running 220 secs || sara is running 220 secs || 49203133 markings, 185720774 edges, 261990 markings/sec, 220 secs
lola: sara is running 225 secs || sara is running 225 secs || 50477196 markings, 189992536 edges, 254813 markings/sec, 225 secs
lola: sara is running 230 secs || sara is running 230 secs || 51712558 markings, 194139062 edges, 247072 markings/sec, 230 secs
lola: sara is running 235 secs || sara is running 235 secs || 52929187 markings, 198272318 edges, 243326 markings/sec, 235 secs
lola: sara is running 240 secs || sara is running 240 secs || 54085040 markings, 202308817 edges, 231171 markings/sec, 240 secs
lola: sara is running 245 secs || sara is running 245 secs || 55309247 markings, 206411170 edges, 244841 markings/sec, 245 secs
lola: sara is running 250 secs || sara is running 250 secs || 56563738 markings, 210674074 edges, 250898 markings/sec, 250 secs
lola: sara is running 255 secs || sara is running 255 secs || 57780118 markings, 214762983 edges, 243276 markings/sec, 255 secs
lola: sara is running 260 secs || sara is running 260 secs || 58977169 markings, 218765494 edges, 239410 markings/sec, 260 secs
lola: sara is running 265 secs || sara is running 265 secs || 60126797 markings, 222591495 edges, 229926 markings/sec, 265 secs
lola: sara is running 270 secs || sara is running 270 secs || 61375940 markings, 226707563 edges, 249829 markings/sec, 270 secs
lola: sara is running 275 secs || sara is running 275 secs || 62559808 markings, 230501095 edges, 236774 markings/sec, 275 secs
lola: sara is running 280 secs || sara is running 280 secs || 63695702 markings, 234377877 edges, 227179 markings/sec, 280 secs
lola: sara is running 285 secs || sara is running 285 secs || 64824281 markings, 238206926 edges, 225716 markings/sec, 285 secs
lola: sara is running 290 secs || sara is running 290 secs || 65928874 markings, 242102606 edges, 220919 markings/sec, 290 secs
lola: sara is running 295 secs || sara is running 295 secs || 67069915 markings, 246225864 edges, 228208 markings/sec, 295 secs
lola: sara is running 300 secs || sara is running 300 secs || 68211552 markings, 250296228 edges, 228327 markings/sec, 300 secs
lola: sara is running 305 secs || sara is running 305 secs || 69311410 markings, 254198722 edges, 219972 markings/sec, 305 secs
lola: sara is running 310 secs || sara is running 310 secs || 70430120 markings, 258134939 edges, 223742 markings/sec, 310 secs
lola: sara is running 315 secs || sara is running 315 secs || 71533334 markings, 262059940 edges, 220643 markings/sec, 315 secs
lola: sara is running 320 secs || sara is running 320 secs || 72613860 markings, 265996670 edges, 216105 markings/sec, 320 secs
lola: sara is running 325 secs || sara is running 325 secs || 73729049 markings, 269983681 edges, 223038 markings/sec, 325 secs
lola: sara is running 330 secs || sara is running 330 secs || 74820914 markings, 273864890 edges, 218373 markings/sec, 330 secs
lola: sara is running 335 secs || sara is running 335 secs || 75945023 markings, 277736200 edges, 224822 markings/sec, 335 secs
lola: sara is running 340 secs || sara is running 340 secs || 77131943 markings, 281666248 edges, 237384 markings/sec, 340 secs
lola: sara is running 345 secs || sara is running 345 secs || 78351773 markings, 285565697 edges, 243966 markings/sec, 345 secs
lola: sara is running 350 secs || sara is running 350 secs || 79662833 markings, 289734604 edges, 262212 markings/sec, 350 secs
lola: sara is running 355 secs || sara is running 355 secs || 80887630 markings, 293693943 edges, 244959 markings/sec, 355 secs
lola: sara is running 360 secs || sara is running 360 secs || 82090457 markings, 297594359 edges, 240565 markings/sec, 360 secs
lola: sara is running 365 secs || sara is running 365 secs || 83262033 markings, 301339653 edges, 234315 markings/sec, 365 secs
lola: sara is running 370 secs || sara is running 370 secs || 84206230 markings, 305017932 edges, 188839 markings/sec, 370 secs
lola: sara is running 375 secs || sara is running 375 secs || 85129657 markings, 308645984 edges, 184685 markings/sec, 375 secs
lola: sara is running 380 secs || sara is running 380 secs || 86157855 markings, 312297029 edges, 205640 markings/sec, 380 secs
lola: sara is running 385 secs || sara is running 385 secs || 87151563 markings, 315943257 edges, 198742 markings/sec, 385 secs
lola: sara is running 390 secs || sara is running 390 secs || 88193785 markings, 319625960 edges, 208444 markings/sec, 390 secs
lola: sara is running 395 secs || sara is running 395 secs || 89279043 markings, 323538945 edges, 217052 markings/sec, 395 secs
lola: sara is running 400 secs || sara is running 400 secs || 90473299 markings, 327541797 edges, 238851 markings/sec, 400 secs
lola: sara is running 405 secs || sara is running 405 secs || 91469833 markings, 331152027 edges, 199307 markings/sec, 405 secs
lola: sara is running 410 secs || sara is running 410 secs || 92562830 markings, 334784086 edges, 218599 markings/sec, 410 secs
lola: sara is running 415 secs || sara is running 415 secs || 93816409 markings, 338687282 edges, 250716 markings/sec, 415 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: state space /EFEG
lola: The predicate eventually occurs from all states.
lola: 94214674 markings, 339978303 edges
lola: ========================================
lola: subprocess 3 will run for 524 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G ((E (G ((((p52 <= 0)) OR ((1 <= p32))))) OR (((1 <= p17)) AND ((p38 <= 0))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:808
lola: rewrite Frontend/Parser/formula_rewrite.k:808
lola: processed formula: EG((EG((((p52 <= 0)) OR ((1 <= p32)))) OR (((1 <= p17)) AND ((p38 <= 0)))))
lola: processed formula length: 76
lola: 10 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: 1986 markings, 6128 edges
lola: ========================================
lola: subprocess 4 will run for 628 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E ((((p29 <= 0)) U (((1 <= p41)) AND ((p22 <= 0)))))
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 ((((p29 <= 0)) U (((1 <= p41)) AND ((p22 <= 0)))))
lola: processed formula length: 52
lola: 11 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: (((1 <= p41)) AND ((p22 <= 0)))
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-4-0.sara
lola: state equation: calling and running 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: 357 markings, 974 edges
lola: ========================================
lola: subprocess 5 will run for 786 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E (G ((((p48 <= 0)) OR ((1 <= p14)) OR ((p25 <= 0)) OR ((1 <= p3))))) AND (((p47 <= 0)) AND (((p56 <= 0)) OR ((1 <= p44)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 5 will run for 786 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (((p47 <= 0)) AND (((p56 <= 0)) OR ((1 <= p44))))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: rewrite Frontend/Parser/formula_rewrite.k:793
lola: processed formula: (((p47 <= 0)) AND (((p56 <= 0)) OR ((1 <= p44))))
lola: processed formula length: 50
lola: 9 rewrites
lola: closed formula file CTLCardinality.xml
lola: processed formula with 3 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 6 will run for 1048 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G ((((p48 <= 0)) OR ((1 <= p14)) OR ((p25 <= 0)) OR ((1 <= p3)))))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation
lola: rewrite Frontend/Parser/formula_rewrite.k:583
lola: processed formula: E (G ((((p48 <= 0)) OR ((1 <= p14)) OR ((p25 <= 0)) OR ((1 <= p3)))))
lola: processed formula length: 72
lola: 9 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: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 <= p48)) AND ((p14 <= 0)) AND ((1 <= p25)) AND ((p3 <= 0)))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 4 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space / EG
lola: The predicate is possibly preserved.
lola: 87 markings, 87 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 6 will run for 1048 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (G ((((p8 <= 0)) OR ((1 <= p56))))) OR E (F ((((1 <= p53)) AND ((p28 <= 0))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 6 will run for 1048 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((((1 <= p53)) AND ((p28 <= 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 <= p53)) AND ((p28 <= 0)))))
lola: processed formula length: 39
lola: 9 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: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 3 markings, 2 edges
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: ========================================
lola: lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 7 will run for 1572 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E (G (((p23 <= 0)))) AND A (F (((((p32 <= 0)) OR ((1 <= p51))) AND (((p14 <= 0)) OR ((1 <= p33)))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 7 will run for 1572 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G (((p23 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation
lola: rewrite Frontend/Parser/formula_rewrite.k:583
lola: processed formula: E (G (((p23 <= 0))))
lola: processed formula length: 20
lola: 9 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: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 <= p23))
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-7-0.sara
lola: state equation: calling and running sara
sara: try reading problem file CTLCardinality-7-0.sara.
sara: place or transition ordering is non-deterministic

lola: state equation 0: solution produced
lola: SUBRESULT
lola: result: no
lola: produced by: state space / EG
lola: The predicate is not possibly preserved.
lola: 4240 markings, 8503 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 8 will run for 3144 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E (G ((((p24 <= 0)) OR ((1 <= p34))))) AND (E ((((1 <= p39)) U (((p14 <= 0)) OR ((1 <= p9))))) OR ((p52 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 8 will run for 3144 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((p52 <= 0))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((p52 <= 0))
lola: processed formula length: 12
lola: 8 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: Child process aborted or communication problem between parent and child process
lola: SUBRESULT
lola: result: unknown
lola: The Boolean predicate may be true or false.
lola: ========================================
lola: ========================================
lola: ...considering subproblem: (E (G ((((p24 <= 0)) OR ((1 <= p34))))) AND (E ((((1 <= p39)) U (((p14 <= 0)) OR ((1 <= p9))))) OR ((p52 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: ...considering subproblem: ((p52 <= 0))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((p52 <= 0))
lola: processed formula length: 12
lola: 8 rewrites
lola: closed formula file CTLCardinality.xml
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: ========================================
lola: ...considering subproblem: E (G ((((p24 <= 0)) OR ((1 <= p34)))))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation
lola: rewrite Frontend/Parser/formula_rewrite.k:583
lola: processed formula: E (G ((((p24 <= 0)) OR ((1 <= p34)))))
lola: processed formula length: 39
lola: 9 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: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 <= p24)) AND ((p34 <= 0)))
lola: state equation task get result unparse finished id 0
lola: SUBRESULT
lola: result: yes
lola: produced by: state space / EG
lola: The predicate is possibly preserved.
lola: 125 markings, 124 edges
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: RESULT
lola:
SUMMARY: no yes yes no no no yes yes yes
lola:
preliminary result: no yes yes no no no yes yes yes
lola: memory consumption: 29044 KB
lola: time consumption: 426 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="ShieldRVs-PT-004A"
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 ShieldRVs-PT-004A, 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 r211-tajo-159033478000795"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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