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-159033477700587.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 ShieldPPPt-PT-002A, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r211-tajo-159033477700587
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 196K
-rw-r--r-- 1 mcc users 3.7K May 14 01:49 CTLCardinality.txt
-rw-r--r-- 1 mcc users 22K May 14 01:49 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.8K May 13 19:14 CTLFireability.txt
-rw-r--r-- 1 mcc users 21K May 13 19:14 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.2K May 14 10:03 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 14 10:03 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K May 14 10:03 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 14 10:03 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 May 12 20:42 NewModel
-rw-r--r-- 1 mcc users 3.3K May 13 14:05 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 17K May 13 14:05 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.9K May 13 08:49 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 20K May 13 08:49 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 13 16:53 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K 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 14K 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 ShieldPPPt-PT-002A-CTLCardinality-00
FORMULA_NAME ShieldPPPt-PT-002A-CTLCardinality-01
FORMULA_NAME ShieldPPPt-PT-002A-CTLCardinality-02
FORMULA_NAME ShieldPPPt-PT-002A-CTLCardinality-03
FORMULA_NAME ShieldPPPt-PT-002A-CTLCardinality-04
FORMULA_NAME ShieldPPPt-PT-002A-CTLCardinality-05
FORMULA_NAME ShieldPPPt-PT-002A-CTLCardinality-06
FORMULA_NAME ShieldPPPt-PT-002A-CTLCardinality-07
FORMULA_NAME ShieldPPPt-PT-002A-CTLCardinality-08
FORMULA_NAME ShieldPPPt-PT-002A-CTLCardinality-09
FORMULA_NAME ShieldPPPt-PT-002A-CTLCardinality-10
FORMULA_NAME ShieldPPPt-PT-002A-CTLCardinality-11
FORMULA_NAME ShieldPPPt-PT-002A-CTLCardinality-12
FORMULA_NAME ShieldPPPt-PT-002A-CTLCardinality-13
FORMULA_NAME ShieldPPPt-PT-002A-CTLCardinality-14
FORMULA_NAME ShieldPPPt-PT-002A-CTLCardinality-15

=== Now, execution of the tool begins

BK_START 1591316476201

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-05 00:21:17] [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 00:21:17] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-05 00:21:17] [INFO ] Load time of PNML (sax parser for PT used): 37 ms
[2020-06-05 00:21:17] [INFO ] Transformed 53 places.
[2020-06-05 00:21:17] [INFO ] Transformed 39 transitions.
[2020-06-05 00:21:17] [INFO ] Found NUPN structural information;
[2020-06-05 00:21:17] [INFO ] Parsed PT model containing 53 places and 39 transitions in 78 ms.
Ensure Unique test removed 1 transitions
Reduce redundant transitions removed 1 transitions.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 17 ms.
Finished random walk after 629 steps, including 0 resets, run visited all 15 properties in 10 ms. (steps per millisecond=62 )
[2020-06-05 00:21:18] [INFO ] Initial state reduction rules for CTL removed 8 formulas.
[2020-06-05 00:21:18] [INFO ] Flatten gal took : 27 ms
[2020-06-05 00:21:18] [INFO ] Initial state reduction rules for CTL removed 8 formulas.
[2020-06-05 00:21:18] [INFO ] Flatten gal took : 14 ms
FORMULA ShieldPPPt-PT-002A-CTLCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-002A-CTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-002A-CTLCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-002A-CTLCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-002A-CTLCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-002A-CTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-002A-CTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-002A-CTLCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-06-05 00:21:18] [INFO ] Export to MCC properties in file /home/mcc/execution/CTLCardinality.sr.xml took 3 ms.
[2020-06-05 00:21:18] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 2 ms.
info: Time: 3600 - MCC
vrfy: Checking CTLCardinality @ ShieldPPPt-PT-002A @ 3570 seconds

FORMULA ShieldPPPt-PT-002A-CTLCardinality-09 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldPPPt-PT-002A-CTLCardinality-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldPPPt-PT-002A-CTLCardinality-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldPPPt-PT-002A-CTLCardinality-06 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldPPPt-PT-002A-CTLCardinality-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldPPPt-PT-002A-CTLCardinality-03 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldPPPt-PT-002A-CTLCardinality-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldPPPt-PT-002A-CTLCardinality-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 3129
rslt: Output for CTLCardinality @ ShieldPPPt-PT-002A

{
"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 00:21:18 2020
",
"timelimit": 3570
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 445
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 1,
"F": 0,
"G": 1,
"U": 0,
"X": 1,
"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": "EG(AX((((p35 <= 0)) OR ((1 <= p12)))))",
"processed_size": 39,
"rewrites": 10
},
"net":
{
"conflict_clusters": 25,
"singleton_clusters": 0
},
"result":
{
"edges": 0,
"markings": 1,
"produced_by": "CTL model checker",
"value": false
},
"task":
{
"compoundnumber": 0,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 509
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 3,
"adisj": 1,
"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": "A (G ((((p38 <= 0)) OR ((1 <= p41)) OR ((1 <= p21)))))",
"processed_size": 56,
"rewrites": 10
},
"result":
{
"edges": 16,
"markings": 17,
"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": 3,
"problems": 3
},
"type": "invariance",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 594
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"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": "((1 <= p16))",
"processed_size": 12,
"rewrites": 12
},
"result":
{
"edges": 149500723,
"markings": 25517004,
"produced_by": "parallel",
"value": false
},
"task":
{
"compoundnumber": 2,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "tscc preserving/always up"
}
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"store":
{
"type": "dfs/tscc"
},
"type": "possible_invariance",
"workflow": "stateequation"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 673
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"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": "((1 <= p42))",
"processed_size": 12,
"rewrites": 11
},
"result":
{
"edges": 155329921,
"markings": 28581324,
"produced_by": "tscc_search",
"value": true
},
"task":
{
"compoundnumber": 3,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "tscc preserving/always up"
}
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"store":
{
"type": "dfs/tscc"
},
"type": "liveness",
"workflow": "stateequation"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 782
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"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": "(((p42 <= 0)) OR ((1 <= p43)))",
"processed_size": 31,
"rewrites": 11
},
"result":
{
"edges": 69,
"markings": 68,
"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"
},
"type": "eventual_occurrence",
"workflow": "stateequation"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1043
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 5,
"adisj": 2,
"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": "E (G (((p44 <= 0) OR (((1 <= p13)) AND ((p41 <= 0))) OR (((1 <= p39)) AND ((p7 <= 0))))))",
"processed_size": 91,
"rewrites": 9
},
"result":
{
"edges": 53,
"markings": 51,
"produced_by": "state space / EG",
"value": true
},
"task":
{
"compoundnumber": 5,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 10
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 12,
"problems": 4
},
"type": "possible_preservation",
"workflow": "stateequation"
}
},

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

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3129
},
"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 <= p14)) AND ((p29 <= 0)))",
"processed_size": 31,
"rewrites": 12
},
"result":
{
"edges": 44,
"markings": 44,
"produced_by": "state space /EFEG",
"value": false
},
"task":
{
"compoundnumber": 7,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 2
},
"threads": 1,
"type": "dfs"
},
"type": "eventual_occurrence_from_all_states",
"workflow": "stateequation"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 6,
"type": "boolean"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3129
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"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": "((1 <= p32) AND (((1 <= p48)) OR ((p9 <= 0)) OR ((1 <= p25))))",
"processed_size": 64,
"rewrites": 8
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 7,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"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": "A (G ((((p6 <= 0)) OR ((1 <= p35)))))",
"processed_size": 38,
"rewrites": 10
},
"result":
{
"edges": 13,
"markings": 14,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 9,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"type": "invariance",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"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": "A (G ((((p14 <= 0)) OR ((1 <= p44)))))",
"processed_size": 39,
"rewrites": 10
},
"result":
{
"edges": 10,
"markings": 11,
"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"
},
"type": "invariance",
"workflow": "stateequation||search"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 7,
"type": "boolean"
}
}
],
"exit":
{
"error": null,
"memory": 27348,
"runtime": 441.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "CTLCardinality.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "E(G(*)) : A(G(E(F(**)))) : E(G(A(X(**)))) : A(F(**)) : E(F(A(G(*)))) : (A(G(**)) OR ((A(G(**)) OR **) AND **)) : A(G(**)) : (A(G(A(F(**)))) AND E(F(**)))"
},
"net":
{
"arcs": 148,
"conflict_clusters": 25,
"places": 53,
"places_significant": 30,
"singleton_clusters": 0,
"transitions": 38
},
"result":
{
"preliminary_value": "yes yes no no no no no no ",
"value": "yes yes no no no no no 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: 91/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 1696
lola: finding significant places
lola: 53 places, 38 transitions, 30 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: (p44 <= 1)
lola: LP says that atomic proposition is always true: (p41 <= 1)
lola: LP says that atomic proposition is always true: (p7 <= 1)
lola: LP says that atomic proposition is always true: (p42 <= 1)
lola: LP says that atomic proposition is always true: (p12 <= 1)
lola: LP says that atomic proposition is always true: (p43 <= 1)
lola: LP says that atomic proposition is always true: (p16 <= 1)
lola: LP says that atomic proposition is always true: (p44 <= 1)
lola: LP says that atomic proposition is always true: (p35 <= 1)
lola: LP says that atomic proposition is always true: (p32 <= 1)
lola: LP says that atomic proposition is always true: (p48 <= 1)
lola: LP says that atomic proposition is always true: (p25 <= 1)
lola: LP says that atomic proposition is always true: (p16 <= 1)
lola: LP says that atomic proposition is always true: (p43 <= 1)
lola: LP says that atomic proposition is always true: (p9 <= 1)
lola: LP says that atomic proposition is always true: (p41 <= 1)
lola: LP says that atomic proposition is always true: (p21 <= 1)
lola: LP says that atomic proposition is always true: (p29 <= 1)
lola: LP says that atomic proposition is always true: (p34 <= 1)
lola: LP says that atomic proposition is always true: (p23 <= 1)
lola: NOT(A (F (((1 <= p44) AND (((p13 <= 0)) OR ((1 <= p41))) AND (((p39 <= 0)) OR ((1 <= p7))))))) : A (G (E (F (((1 <= p42)))))) : E (G (A (X ((((p35 <= 0)) OR ((1 <= p12))))))) : A (F ((((1 <= p42)) AND ((p43 <= 0))))) : NOT(A (G (E (F (((1 <= p16))))))) : (A (G ((((p14 <= 0)) OR ((1 <= p44))))) OR ((A (G ((((p6 <= 0)) OR ((1 <= p35))))) OR ((1 <= p32) AND (((1 <= p48)) OR ((p9 <= 0)) OR ((1 <= p25))))) AND ((((1 <= p51)) AND ((p16 <= 0))) OR ((((p51 <= 0)) OR ((1 <= p43))) AND (((p11 <= 0)) OR ((1 <= p9))))))) : A (G ((((p38 <= 0)) OR ((1 <= p41)) OR ((1 <= p21))))) : (A (G (A (F ((((p14 <= 0)) OR ((1 <= p29))))))) AND E (F ((((1 <= p34)) OR ((p32 <= 0)) OR ((1 <= p23))))))
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:326
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 445 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G (A (X ((((p35 <= 0)) OR ((1 <= p12)))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:812
lola: rewrite Frontend/Parser/formula_rewrite.k:808
lola: processed formula: EG(AX((((p35 <= 0)) OR ((1 <= p12)))))
lola: processed formula length: 39
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 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 1 markings, 0 edges
lola: ========================================
lola: subprocess 1 will run for 509 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((((p38 <= 0)) OR ((1 <= p41)) OR ((1 <= p21)))))
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 ((((p38 <= 0)) OR ((1 <= p41)) OR ((1 <= p21)))))
lola: processed formula length: 56
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 <= p38)) AND ((p41 <= 0)) AND ((p21 <= 0)))
lola: state equation task get result unparse finished id 0
lola: SUBRESULT
lola: state equation: Generated DNF with 3 literals and 1 conjunctive subformulas
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 17 markings, 16 edges
lola: ========================================
lola: subprocess 2 will run for 594 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (A (G (((p16 <= 0))))))
lola: ========================================
lola: SUBTASK
lola: checking possible invariance
lola: rewrite Frontend/Parser/formula_rewrite.k:604
lola: rewrite Frontend/Parser/formula_rewrite.k:614
lola: rewrite Frontend/Parser/formula_rewrite.k:726
lola: rewrite Frontend/Parser/formula_rewrite.k:788
lola: processed formula: ((1 <= p16))
lola: processed formula length: 12
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
lola: using tscc preserving stubborn set method (--stubborn)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:700
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((p16 <= 0))
lola: state equation task get result unparse finished id 0
lola: state equation task get result started, id 1
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:788
lola: state equation task get result rewrite finished id 1
lola: state equation task get result unparse finished++ id 1
lola: formula 1: ((1 <= p16))
lola: state equation task get result unparse finished id 1
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to CTLCardinality-2-0.sara
lola: state equation: calling and running sara
lola: state equation: write sara problem file to CTLCardinality-2-1.sara
lola: state equation: calling and running sara
sara: try reading problem file CTLCardinality-2-1.sara.
sara: try reading problem file CTLCardinality-2-0.sara.
sara: place or transition ordering is non-deterministic

sara: place or transition ordering is non-deterministic

lola: state equation 0: solution produced
lola: state equation 1: solution produced
lola: sara is running 0 secs || sara is running 0 secs || 2245729 markings, 4232652 edges, 449146 markings/sec, 0 secs
lola: sara is running 5 secs || sara is running 5 secs || 4258593 markings, 8635434 edges, 402573 markings/sec, 5 secs
lola: sara is running 10 secs || sara is running 10 secs || 6166600 markings, 13133527 edges, 381601 markings/sec, 10 secs
lola: sara is running 15 secs || sara is running 15 secs || 7920779 markings, 17542959 edges, 350836 markings/sec, 15 secs
lola: sara is running 20 secs || sara is running 20 secs || 9448551 markings, 21597202 edges, 305554 markings/sec, 20 secs
lola: sara is running 25 secs || sara is running 25 secs || 10894494 markings, 25631208 edges, 289189 markings/sec, 25 secs
lola: sara is running 30 secs || sara is running 30 secs || 12265790 markings, 29615187 edges, 274259 markings/sec, 30 secs
lola: sara is running 35 secs || sara is running 35 secs || 13597039 markings, 33635906 edges, 266250 markings/sec, 35 secs
lola: sara is running 40 secs || sara is running 40 secs || 14866457 markings, 37634500 edges, 253884 markings/sec, 40 secs
lola: sara is running 45 secs || sara is running 45 secs || 16046770 markings, 41514016 edges, 236063 markings/sec, 45 secs
lola: sara is running 50 secs || sara is running 50 secs || 17187763 markings, 45408531 edges, 228199 markings/sec, 50 secs
lola: sara is running 55 secs || sara is running 55 secs || 18277240 markings, 49262299 edges, 217895 markings/sec, 55 secs
lola: sara is running 60 secs || sara is running 60 secs || 19311370 markings, 53057369 edges, 206826 markings/sec, 60 secs
lola: sara is running 65 secs || sara is running 65 secs || 20342072 markings, 56996949 edges, 206140 markings/sec, 65 secs
lola: sara is running 70 secs || sara is running 70 secs || 21090638 markings, 59973589 edges, 149713 markings/sec, 70 secs
lola: sara is running 75 secs || sara is running 75 secs || 21957211 markings, 63558512 edges, 173315 markings/sec, 75 secs
lola: sara is running 80 secs || sara is running 80 secs || 22820465 markings, 67452988 edges, 172651 markings/sec, 80 secs
lola: sara is running 85 secs || sara is running 85 secs || 23652859 markings, 71661700 edges, 166479 markings/sec, 85 secs
lola: sara is running 90 secs || sara is running 90 secs || 24287387 markings, 76706046 edges, 126906 markings/sec, 90 secs
lola: sara is running 95 secs || sara is running 95 secs || 24388204 markings, 80205673 edges, 20163 markings/sec, 95 secs
lola: sara is running 100 secs || sara is running 100 secs || 24475330 markings, 82745340 edges, 17425 markings/sec, 100 secs
lola: sara is running 105 secs || sara is running 105 secs || 24514143 markings, 85371038 edges, 7763 markings/sec, 105 secs
lola: sara is running 110 secs || sara is running 110 secs || 24575599 markings, 89101872 edges, 12291 markings/sec, 110 secs
lola: sara is running 115 secs || sara is running 115 secs || 24636539 markings, 92944092 edges, 12188 markings/sec, 115 secs
lola: sara is running 120 secs || sara is running 120 secs || 24689007 markings, 96806003 edges, 10494 markings/sec, 120 secs
lola: sara is running 125 secs || sara is running 125 secs || 24753925 markings, 100918793 edges, 12984 markings/sec, 125 secs
lola: sara is running 130 secs || sara is running 130 secs || 24822046 markings, 104829789 edges, 13624 markings/sec, 130 secs
lola: sara is running 135 secs || sara is running 135 secs || 24880956 markings, 108773523 edges, 11782 markings/sec, 135 secs
lola: sara is running 140 secs || sara is running 140 secs || 24948867 markings, 112641574 edges, 13582 markings/sec, 140 secs
lola: sara is running 145 secs || sara is running 145 secs || 24994811 markings, 115287059 edges, 9189 markings/sec, 145 secs
lola: sara is running 150 secs || sara is running 150 secs || 25041401 markings, 117723024 edges, 9318 markings/sec, 150 secs
lola: sara is running 155 secs || sara is running 155 secs || 25087728 markings, 120574382 edges, 9265 markings/sec, 155 secs
lola: sara is running 160 secs || sara is running 160 secs || 25152593 markings, 124438956 edges, 12973 markings/sec, 160 secs
lola: sara is running 165 secs || sara is running 165 secs || 25225749 markings, 128373664 edges, 14631 markings/sec, 165 secs
lola: sara is running 170 secs || sara is running 170 secs || 25296752 markings, 132379916 edges, 14201 markings/sec, 170 secs
lola: sara is running 175 secs || sara is running 175 secs || 25354982 markings, 136418880 edges, 11646 markings/sec, 175 secs
lola: sara is running 180 secs || sara is running 180 secs || 25409432 markings, 139624824 edges, 10890 markings/sec, 180 secs
lola: sara is running 185 secs || sara is running 185 secs || 25448929 markings, 142495498 edges, 7899 markings/sec, 185 secs
lola: sara is running 190 secs || sara is running 190 secs || 25489775 markings, 145625774 edges, 8169 markings/sec, 190 secs
lola: SUBRESULT
lola: result: no
lola: produced by: parallel
lola: The predicate is not possibly invariant.
lola: 25517004 markings, 149500723 edges
lola: ========================================
lola: subprocess 3 will run for 673 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (E (F (((1 <= p42))))))
lola: ========================================
lola: SUBTASK
lola: checking liveness
lola: rewrite Frontend/Parser/formula_rewrite.k:603
lola: rewrite Frontend/Parser/formula_rewrite.k:613
lola: rewrite Frontend/Parser/formula_rewrite.k:703
lola: processed formula: ((1 <= p42))
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
lola: using tscc preserving stubborn set method (--stubborn)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 1
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 1
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: state equation task get result unparse finished++ id 1
lola: formula 1: ((1 <= p42))
lola: state equation task get result unparse finished id 1
lola: state equation task get result rewrite finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((p42 <= 0))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to CTLCardinality-3-1.sara
lola: state equation: write sara problem file to CTLCardinality-3-0.sara
lola: state equation: calling and running sara
lola: state equation: calling and running sara
sara: try reading problem file CTLCardinality-3-1.sara.
sara: place or transition ordering is non-deterministic

sara: try reading problem file CTLCardinality-3-0.sara.
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 || 1849014 markings, 5405757 edges, 369803 markings/sec, 0 secs
lola: sara is running 5 secs || sara is running 5 secs || 3378011 markings, 10329254 edges, 305799 markings/sec, 5 secs
lola: sara is running 10 secs || sara is running 10 secs || 4800059 markings, 15060090 edges, 284410 markings/sec, 10 secs
lola: sara is running 15 secs || sara is running 15 secs || 5997882 markings, 19130432 edges, 239565 markings/sec, 15 secs
lola: sara is running 20 secs || sara is running 20 secs || 6958203 markings, 22442440 edges, 192064 markings/sec, 20 secs
lola: sara is running 25 secs || sara is running 25 secs || 7874606 markings, 25636635 edges, 183281 markings/sec, 25 secs
lola: sara is running 30 secs || sara is running 30 secs || 8798428 markings, 28868663 edges, 184764 markings/sec, 30 secs
lola: sara is running 35 secs || sara is running 35 secs || 9702117 markings, 32066738 edges, 180738 markings/sec, 35 secs
lola: sara is running 40 secs || sara is running 40 secs || 10545994 markings, 35062324 edges, 168775 markings/sec, 40 secs
lola: sara is running 45 secs || sara is running 45 secs || 11389208 markings, 38073088 edges, 168643 markings/sec, 45 secs
lola: sara is running 50 secs || sara is running 50 secs || 12271329 markings, 41229628 edges, 176424 markings/sec, 50 secs
lola: sara is running 55 secs || sara is running 55 secs || 13154607 markings, 44401739 edges, 176656 markings/sec, 55 secs
lola: sara is running 60 secs || sara is running 60 secs || 14046872 markings, 47613851 edges, 178453 markings/sec, 60 secs
lola: sara is running 65 secs || sara is running 65 secs || 14935397 markings, 50824826 edges, 177705 markings/sec, 65 secs
lola: sara is running 70 secs || sara is running 70 secs || 15809264 markings, 53965974 edges, 174773 markings/sec, 70 secs
lola: sara is running 75 secs || sara is running 75 secs || 16694176 markings, 57187941 edges, 176982 markings/sec, 75 secs
lola: sara is running 80 secs || sara is running 80 secs || 17620773 markings, 60576402 edges, 185319 markings/sec, 80 secs
lola: sara is running 85 secs || sara is running 85 secs || 18575132 markings, 64095214 edges, 190872 markings/sec, 85 secs
lola: sara is running 90 secs || sara is running 90 secs || 19611133 markings, 68010328 edges, 207200 markings/sec, 90 secs
lola: sara is running 95 secs || sara is running 95 secs || 20751224 markings, 72437120 edges, 228018 markings/sec, 95 secs
lola: sara is running 100 secs || sara is running 100 secs || 22029484 markings, 77373030 edges, 255652 markings/sec, 100 secs
lola: sara is running 105 secs || sara is running 105 secs || 23459280 markings, 82446357 edges, 285959 markings/sec, 105 secs
lola: sara is running 110 secs || sara is running 110 secs || 24771764 markings, 86822965 edges, 262497 markings/sec, 110 secs
lola: sara is running 115 secs || sara is running 115 secs || 25298430 markings, 90298998 edges, 105333 markings/sec, 115 secs
lola: sara is running 120 secs || sara is running 120 secs || 25630329 markings, 93237151 edges, 66380 markings/sec, 120 secs
lola: sara is running 125 secs || sara is running 125 secs || 25882861 markings, 95931421 edges, 50506 markings/sec, 125 secs
lola: sara is running 130 secs || sara is running 130 secs || 26107873 markings, 98567125 edges, 45002 markings/sec, 130 secs
lola: sara is running 135 secs || sara is running 135 secs || 26300516 markings, 101214273 edges, 38529 markings/sec, 135 secs
lola: sara is running 140 secs || sara is running 140 secs || 26487681 markings, 103798868 edges, 37433 markings/sec, 140 secs
lola: sara is running 145 secs || sara is running 145 secs || 26646677 markings, 106322027 edges, 31799 markings/sec, 145 secs
lola: sara is running 150 secs || sara is running 150 secs || 26792359 markings, 108897467 edges, 29136 markings/sec, 150 secs
lola: sara is running 155 secs || sara is running 155 secs || 26938993 markings, 111462331 edges, 29327 markings/sec, 155 secs
lola: sara is running 160 secs || sara is running 160 secs || 27077150 markings, 114046960 edges, 27631 markings/sec, 160 secs
lola: sara is running 165 secs || sara is running 165 secs || 27204214 markings, 116598155 edges, 25413 markings/sec, 165 secs
lola: sara is running 170 secs || sara is running 170 secs || 27331139 markings, 119126695 edges, 25385 markings/sec, 170 secs
lola: sara is running 175 secs || sara is running 175 secs || 27439938 markings, 121558618 edges, 21760 markings/sec, 175 secs
lola: sara is running 180 secs || sara is running 180 secs || 27546171 markings, 123987965 edges, 21247 markings/sec, 180 secs
lola: sara is running 185 secs || sara is running 185 secs || 27651192 markings, 126437839 edges, 21004 markings/sec, 185 secs
lola: sara is running 190 secs || sara is running 190 secs || 27760863 markings, 129041346 edges, 21934 markings/sec, 190 secs
lola: sara is running 195 secs || sara is running 195 secs || 27860810 markings, 131675537 edges, 19989 markings/sec, 195 secs
lola: sara is running 200 secs || sara is running 200 secs || 27961848 markings, 134344952 edges, 20208 markings/sec, 200 secs
lola: sara is running 205 secs || sara is running 205 secs || 28059116 markings, 137102477 edges, 19454 markings/sec, 205 secs
lola: sara is running 210 secs || sara is running 210 secs || 28153447 markings, 139887355 edges, 18866 markings/sec, 210 secs
lola: sara is running 215 secs || sara is running 215 secs || 28246092 markings, 142734216 edges, 18529 markings/sec, 215 secs
lola: sara is running 220 secs || sara is running 220 secs || 28336535 markings, 145691734 edges, 18089 markings/sec, 220 secs
lola: sara is running 225 secs || sara is running 225 secs || 28427642 markings, 148823035 edges, 18221 markings/sec, 225 secs
lola: sara is running 230 secs || sara is running 230 secs || 28517758 markings, 152295969 edges, 18023 markings/sec, 230 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: tscc_search
lola: The predicate is live.
lola: 28581324 markings, 155329921 edges
lola: ========================================
lola: subprocess 4 will run for 782 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F ((((1 <= p42)) AND ((p43 <= 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:787
lola: processed formula: (((p42 <= 0)) OR ((1 <= p43)))
lola: processed formula length: 31
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 / 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: SUBRESULT
lola: result: no
lola: produced by: state space / EG
lola: The predicate does not eventually occur.
lola: 68 markings, 69 edges
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (((1 <= p42)) AND ((p43 <= 0)))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: ========================================
lola: subprocess 5 will run for 1043 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G (((p44 <= 0) OR (((1 <= p13)) AND ((p41 <= 0))) OR (((1 <= p39)) AND ((p7 <= 0))))))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation
lola: rewrite Frontend/Parser/formula_rewrite.k:583
lola: processed formula: E (G (((p44 <= 0) OR (((1 <= p13)) AND ((p41 <= 0))) OR (((1 <= p39)) AND ((p7 <= 0))))))
lola: processed formula length: 91
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 <= p44) AND (((p13 <= 0)) OR ((1 <= p41))) AND (((p39 <= 0)) OR ((1 <= p7))))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 12 literals and 4 conjunctive subformulas
lola: state equation: write sara problem file to CTLCardinality-5-0.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space / EG
lola: The predicate is possibly preserved.
lola: 51 markings, 53 edges
lola: ========================================
lola: subprocess 6 will run for 1564 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (G (A (F ((((p14 <= 0)) OR ((1 <= p29))))))) AND E (F ((((1 <= p34)) OR ((p32 <= 0)) OR ((1 <= p23))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 6 will run for 1564 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((((1 <= p34)) OR ((p32 <= 0)) OR ((1 <= p23)))))
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 <= p34)) OR ((p32 <= 0)) OR ((1 <= p23)))))
lola: processed formula length: 56
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: 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 <= p34)) OR ((p32 <= 0)) OR ((1 <= p23)))
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-6-0.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 7 will run for 3129 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (A (F ((((p14 <= 0)) OR ((1 <= p29)))))))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence from all states
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 <= p14)) AND ((p29 <= 0)))
lola: processed formula length: 31
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: SUBRESULT
lola: result: no
lola: produced by: state space /EFEG
lola: state equation task get result started, id 0
lola: The predicate does not eventually occur from all states.
lola: 44 markings, 44 edges
lola: state equation task get result started, id 1
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: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 7 will run for 3129 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (G ((((p14 <= 0)) OR ((1 <= p44))))) OR ((A (G ((((p6 <= 0)) OR ((1 <= p35))))) OR ((1 <= p32) AND (((1 <= p48)) OR ((p9 <= 0)) OR ((1 <= p25))))) AND ((((1 <= p51)) AND ((p16 <= 0))) OR ((((p51 <= 0)) OR ((1 <= p43))) AND (((p11 <= 0)) OR ((1 <= p9)))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 7 will run for 3129 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((1 <= p32) AND (((1 <= p48)) OR ((p9 <= 0)) OR ((1 <= p25))))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((1 <= p32) AND (((1 <= p48)) OR ((p9 <= 0)) OR ((1 <= p25))))
lola: processed formula length: 64
lola: 8 rewrites
lola: closed formula file CTLCardinality.xml
lola: processed formula with 4 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: Child process aborted or communication problem between parent and child process
lola: subprocess 9 will run for 1 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((((p6 <= 0)) OR ((1 <= p35)))))
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 ((((p6 <= 0)) OR ((1 <= p35)))))
lola: processed formula length: 38
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 <= p6)) AND ((p35 <= 0)))
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 14 markings, 13 edges
lola: ========================================
lola: subprocess 10 will run for 1 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((((p14 <= 0)) OR ((1 <= p44)))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: A (G ((((p14 <= 0)) OR ((1 <= p44)))))
lola: processed formula length: 39
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: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 11 markings, 10 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: RESULT
lola:
SUMMARY: yes yes no no no no no no
lola:
preliminary result: yes yes no no no no no no
lola: memory consumption: 27348 KB
lola: time consumption: 441 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="ShieldPPPt-PT-002A"
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 ShieldPPPt-PT-002A, 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-159033477700587"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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