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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 180K
-rw-r--r-- 1 mcc users 3.2K May 14 00:52 CTLCardinality.txt
-rw-r--r-- 1 mcc users 18K May 14 00:52 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K May 13 18:05 CTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 13 18:05 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.3K May 14 10:01 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 14 10:01 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K May 14 10:01 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 14 10:01 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 May 12 20:42 NewModel
-rw-r--r-- 1 mcc users 4.0K May 13 13:25 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 22K May 13 13:25 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 13 07:59 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 13K May 13 07:59 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 6.1K 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 ShieldIIPt-PT-001A-CTLCardinality-00
FORMULA_NAME ShieldIIPt-PT-001A-CTLCardinality-01
FORMULA_NAME ShieldIIPt-PT-001A-CTLCardinality-02
FORMULA_NAME ShieldIIPt-PT-001A-CTLCardinality-03
FORMULA_NAME ShieldIIPt-PT-001A-CTLCardinality-04
FORMULA_NAME ShieldIIPt-PT-001A-CTLCardinality-05
FORMULA_NAME ShieldIIPt-PT-001A-CTLCardinality-06
FORMULA_NAME ShieldIIPt-PT-001A-CTLCardinality-07
FORMULA_NAME ShieldIIPt-PT-001A-CTLCardinality-08
FORMULA_NAME ShieldIIPt-PT-001A-CTLCardinality-09
FORMULA_NAME ShieldIIPt-PT-001A-CTLCardinality-10
FORMULA_NAME ShieldIIPt-PT-001A-CTLCardinality-11
FORMULA_NAME ShieldIIPt-PT-001A-CTLCardinality-12
FORMULA_NAME ShieldIIPt-PT-001A-CTLCardinality-13
FORMULA_NAME ShieldIIPt-PT-001A-CTLCardinality-14
FORMULA_NAME ShieldIIPt-PT-001A-CTLCardinality-15

=== Now, execution of the tool begins

BK_START 1591295153022

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-04 18:25:54] [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-04 18:25:54] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-04 18:25:54] [INFO ] Load time of PNML (sax parser for PT used): 23 ms
[2020-06-04 18:25:54] [INFO ] Transformed 22 places.
[2020-06-04 18:25:54] [INFO ] Transformed 17 transitions.
[2020-06-04 18:25:54] [INFO ] Found NUPN structural information;
[2020-06-04 18:25:54] [INFO ] Parsed PT model containing 22 places and 17 transitions in 58 ms.
Ensure Unique test removed 1 transitions
Reduce redundant transitions removed 1 transitions.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 14 ms.
Incomplete random walk after 100000 steps, including 0 resets, run finished after 121 ms. (steps per millisecond=826 ) properties seen :[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1]
// Phase 1: matrix 16 rows 22 cols
[2020-06-04 18:25:55] [INFO ] Computed 10 place invariants in 3 ms
[2020-06-04 18:25:55] [INFO ] [Real]Absence check using 10 positive place invariants in 21 ms returned sat
[2020-06-04 18:25:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 18:25:55] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2020-06-04 18:25:55] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 18:25:55] [INFO ] [Nat]Absence check using 10 positive place invariants in 9 ms returned unsat
Successfully simplified 1 atomic propositions for a total of 1 simplifications.
[2020-06-04 18:25:55] [INFO ] Initial state reduction rules for CTL removed 11 formulas.
[2020-06-04 18:25:55] [INFO ] Flatten gal took : 24 ms
[2020-06-04 18:25:55] [INFO ] Initial state reduction rules for CTL removed 11 formulas.
[2020-06-04 18:25:55] [INFO ] Flatten gal took : 6 ms
FORMULA ShieldIIPt-PT-001A-CTLCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPt-PT-001A-CTLCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPt-PT-001A-CTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPt-PT-001A-CTLCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPt-PT-001A-CTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPt-PT-001A-CTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPt-PT-001A-CTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPt-PT-001A-CTLCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPt-PT-001A-CTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPt-PT-001A-CTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPt-PT-001A-CTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-06-04 18:25:55] [INFO ] Export to MCC properties in file /home/mcc/execution/CTLCardinality.sr.xml took 2 ms.
[2020-06-04 18:25:55] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 0 ms.
info: Time: 3600 - MCC
vrfy: Checking CTLCardinality @ ShieldIIPt-PT-001A @ 3570 seconds

FORMULA ShieldIIPt-PT-001A-CTLCardinality-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldIIPt-PT-001A-CTLCardinality-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldIIPt-PT-001A-CTLCardinality-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldIIPt-PT-001A-CTLCardinality-08 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldIIPt-PT-001A-CTLCardinality-07 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 3567
rslt: Output for CTLCardinality @ ShieldIIPt-PT-001A

{
"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": "Thu Jun 4 18:25:55 2020
",
"timelimit": 3570
},
"child":
[

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 891
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 0,
"G": 0,
"U": 0,
"X": 1,
"aconj": 6,
"adisj": 4,
"aneg": 0,
"comp": 7,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 7,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 7,
"visible_transitions": 0
},
"processed": "EX((((1 <= p21)) AND ((p14 <= 0)) AND (((p15 <= 0)) OR ((1 <= p2))) AND (((1 <= p7)) OR ((p11 <= 0)) OR ((1 <= p0)))))",
"processed_size": 121,
"rewrites": 10
},
"net":
{
"conflict_clusters": 10,
"singleton_clusters": 0
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "CTL model checker",
"value": false
},
"task":
{
"compoundnumber": 1,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
},

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

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

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

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 0,
"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": "AX((((p14 <= 0)) OR ((1 <= p13))))",
"processed_size": 35,
"rewrites": 10
},
"net":
{
"conflict_clusters": 10,
"singleton_clusters": 0
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "CTL model checker",
"value": true
},
"task":
{
"compoundnumber": 6,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": null
},
"task":
{
"compoundnumber": 3,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3567
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 2,
"F": 0,
"G": 3,
"U": 0,
"X": 0,
"aconj": 4,
"adisj": 2,
"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": "AG((EG((((p3 <= 0)) OR ((1 <= p12)))) OR EG((((p15 <= 0)) OR ((1 <= p8))))))",
"processed_size": 78,
"rewrites": 12
},
"net":
{
"conflict_clusters": 10,
"singleton_clusters": 0
},
"result":
{
"edges": 5,
"markings": 3,
"produced_by": "CTL model checker",
"value": false
},
"task":
{
"compoundnumber": 4,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
},

{
"child":
[

{
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 2,
"adisj": 1,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "(((p11 <= 0)) OR ((1 <= p20)))",
"processed_size": 31,
"rewrites": 9
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 5,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 2,
"adisj": 1,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "(((p3 <= 0)) OR ((1 <= p12)))",
"processed_size": 30,
"rewrites": 12
},
"result":
{
"edges": 1,
"markings": 2,
"produced_by": "state space / EG",
"value": true
},
"task":
{
"compoundnumber": 6,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 5
},
"threads": 1,
"type": "dfs"
},
"type": "eventual_occurrence",
"workflow": "stateequation"
}
},

{
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 0,
"U": 1,
"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": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "A (((((1 <= p9)) AND ((p16 <= 0))) U (((p17 <= 0)) OR ((1 <= p14)))))",
"processed_size": 70,
"rewrites": 14
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "state space /ER",
"value": true
},
"task":
{
"compoundnumber": 7,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl",
"visible": 6
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 2,
"problems": 2
},
"type": "universal_until",
"workflow": "stateequation"
}
},

{
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 0,
"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": "AX((((p14 <= 0)) OR ((1 <= p13))))",
"processed_size": 35,
"rewrites": 10
},
"net":
{
"conflict_clusters": 10,
"singleton_clusters": 0
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "CTL model checker",
"value": true
},
"task":
{
"compoundnumber": 8,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
}
],
"result":
{
"produced_by": "boolean",
"value": true
},
"task":
{
"compoundnumber": 5,
"type": "boolean"
}
}
],
"exit":
{
"error": null,
"memory": 23616,
"runtime": 3.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "CTLCardinality.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "(A((** U **)) AND (A(F(*)) AND (A(X(**)) AND **))) : A(G((E(G(**)) OR E(G(**))))) : E(X(**)) : A(X(E(X(**)))) : DEADLOCK"
},
"net":
{
"arcs": 64,
"conflict_clusters": 10,
"places": 22,
"places_significant": 12,
"singleton_clusters": 0,
"transitions": 16
},
"result":
{
"preliminary_value": "yes no no no no ",
"value": "yes 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: 38/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 704
lola: finding significant places
lola: 22 places, 16 transitions, 12 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: (p16 <= 1)
lola: LP says that atomic proposition is always true: (p14 <= 1)
lola: LP says that atomic proposition is always true: (p12 <= 1)
lola: LP says that atomic proposition is always true: (p13 <= 1)
lola: LP says that atomic proposition is always true: (p20 <= 1)
lola: LP says that atomic proposition is always true: (p12 <= 1)
lola: LP says that atomic proposition is always true: (p8 <= 1)
lola: LP says that atomic proposition is always true: (p14 <= 1)
lola: LP says that atomic proposition is always true: (p2 <= 1)
lola: LP says that atomic proposition is always true: (p7 <= 1)
lola: LP says that atomic proposition is always true: (p0 <= 1)
lola: LP says that atomic proposition is always true: (p11 <= 1)
lola: (((A (((((1 <= p9)) AND ((p16 <= 0))) U (((p17 <= 0)) OR ((1 <= p14))))) AND NOT(E (G ((((p3 <= 0)) OR ((1 <= p12))))))) AND A (X ((((p14 <= 0)) OR ((1 <= p13)))))) AND (((p11 <= 0)) OR ((1 <= p20)))) : A (G ((E (G ((((p3 <= 0)) OR ((1 <= p12))))) OR E (G ((((p15 <= 0)) OR ((1 <= p8)))))))) : E (X ((((1 <= p21)) AND ((p14 <= 0)) AND (((p15 <= 0)) OR ((1 <= p2))) AND (((1 <= p7)) OR ((p11 <= 0)) OR ((1 <= p0)))))) : A (X (E (X ((((p1 <= 0)) OR ((1 <= p11))))))) : NOT(E (X ((0 <= 0))))
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:130
lola: rewrite Frontend/Parser/formula_rewrite.k:288
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 713 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: DEADLOCK
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: DEADLOCK
lola: processed formula length: 8
lola: 9 rewrites
lola: closed formula file CTLCardinality.xml
lola: processed formula with 0 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: subprocess 1 will run for 891 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (X ((((1 <= p21)) AND ((p14 <= 0)) AND (((p15 <= 0)) OR ((1 <= p2))) AND (((1 <= p7)) OR ((p11 <= 0)) OR ((1 <= p0))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:807
lola: processed formula: EX((((1 <= p21)) AND ((p14 <= 0)) AND (((p15 <= 0)) OR ((1 <= p2))) AND (((1 <= p7)) OR ((p11 <= 0)) OR ((1 <= p0)))))
lola: processed formula length: 121
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 0 significant temporal operators and needs 0 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: 0 markings, 0 edges
lola: ========================================
lola: subprocess 2 will run for 1189 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (E (X ((((p1 <= 0)) OR ((1 <= p11)))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:807
lola: rewrite Frontend/Parser/formula_rewrite.k:812
lola: processed formula: AX(EX((((p1 <= 0)) OR ((1 <= p11)))))
lola: processed formula length: 38
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: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 0 significant temporal operators and needs 0 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 3 will run for 1783 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (((((1 <= p9)) AND ((p16 <= 0))) U (((p17 <= 0)) OR ((1 <= p14))))) AND (A (F ((((1 <= p3)) AND ((p12 <= 0))))) AND (A (X ((((p14 <= 0)) OR ((1 <= p13))))) AND (((p11 <= 0)) OR ((1 <= p20))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 3 will run for 1783 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (((p11 <= 0)) OR ((1 <= p20)))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (((p11 <= 0)) OR ((1 <= p20)))
lola: processed formula length: 31
lola: 9 rewrites
lola: closed formula file CTLCardinality.xml
lola: processed formula with 2 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 4 will run for 3567 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F ((((1 <= p3)) AND ((p12 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:584
lola: rewrite Frontend/Parser/formula_rewrite.k:749
lola: rewrite Frontend/Parser/formula_rewrite.k:788
lola: processed formula: (((p3 <= 0)) OR ((1 <= p12)))
lola: processed formula length: 30
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 / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:700
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (((1 <= p3)) AND ((p12 <= 0)))
lola: state equation task get result unparse finished id 0
lola: SUBRESULT
lola: result: yes
lola: produced by: state space / EG
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: The predicate eventually occurs.
lola: 2 markings, 1 edges
lola: ========================================
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 6 will run for 1 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X ((((p14 <= 0)) OR ((1 <= p13)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:812
lola: processed formula: AX((((p14 <= 0)) OR ((1 <= p13))))
lola: processed formula length: 35
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 0 significant temporal operators and needs 0 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 0 markings, 0 edges
lola: ========================================
lola: SUBRESULT
lola: result: unknown
lola: The Boolean predicate may be true or false.
lola: ========================================
lola: subprocess 4 will run for 3567 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((E (G ((((p3 <= 0)) OR ((1 <= p12))))) OR E (G ((((p15 <= 0)) OR ((1 <= p8))))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:808
lola: rewrite Frontend/Parser/formula_rewrite.k:808
lola: rewrite Frontend/Parser/formula_rewrite.k:813
lola: processed formula: AG((EG((((p3 <= 0)) OR ((1 <= p12)))) OR EG((((p15 <= 0)) OR ((1 <= p8))))))
lola: processed formula length: 78
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: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 3 significant temporal operators and needs 13 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: 3 markings, 5 edges
lola: ========================================
lola: ========================================
lola: ...considering subproblem: (A (((((1 <= p9)) AND ((p16 <= 0))) U (((p17 <= 0)) OR ((1 <= p14))))) AND (A (F ((((1 <= p3)) AND ((p12 <= 0))))) AND (A (X ((((p14 <= 0)) OR ((1 <= p13))))) AND (((p11 <= 0)) OR ((1 <= p20))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: ...considering subproblem: (((p11 <= 0)) OR ((1 <= p20)))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (((p11 <= 0)) OR ((1 <= p20)))
lola: processed formula length: 31
lola: 9 rewrites
lola: closed formula file CTLCardinality.xml
lola: processed formula with 2 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: A (F ((((1 <= p3)) AND ((p12 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:584
lola: rewrite Frontend/Parser/formula_rewrite.k:749
lola: rewrite Frontend/Parser/formula_rewrite.k:788
lola: processed formula: (((p3 <= 0)) OR ((1 <= p12)))
lola: processed formula length: 30
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 / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:700
lola: state equation task get result rewrite finished id 0
lola: SUBRESULT
lola: result: yes
lola: produced by: state space / EG
lola: The predicate eventually occurs.
lola: 2 markings, 1 edges
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (((1 <= p3)) AND ((p12 <= 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: ========================================
lola: ...considering subproblem: A (((((1 <= p9)) AND ((p16 <= 0))) U (((p17 <= 0)) OR ((1 <= p14)))))
lola: ========================================
lola: SUBTASK
lola: checking universal until
lola: rewrite Frontend/Parser/formula_rewrite.k:577
lola: rewrite Frontend/Parser/formula_rewrite.k:735
lola: rewrite Frontend/Parser/formula_rewrite.k:695
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: A (((((1 <= p9)) AND ((p16 <= 0))) U (((p17 <= 0)) OR ((1 <= p14)))))
lola: processed formula length: 70
lola: 14 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /ER)
lola: state space: using reachability graph (ER version) (--search=depth)
lola: state space: using ltl preserving stubborn set method (--stubborn=tarjan)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: 0
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: SUBRESULT
lola: result: yes
lola: produced by: state space /ER
lola: state equation task get result unparse finished++ id 0
lola: Predicate Phi holds until Predicate Psi on all paths.
lola: 0 markings, 0 edges
lola: formula 0: (((1 <= p9)) AND ((p16 <= 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: ========================================
lola: ...considering subproblem: A (X ((((p14 <= 0)) OR ((1 <= p13)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:812
lola: processed formula: AX((((p14 <= 0)) OR ((1 <= p13))))
lola: processed formula length: 35
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 0 significant temporal operators and needs 0 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 0 markings, 0 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: RESULT
lola:
SUMMARY: yes no no no no
lola:
preliminary result: yes no no no no
lola: memory consumption: 23616 KB
lola: time consumption: 3 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="ShieldIIPt-PT-001A"
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 ShieldIIPt-PT-001A, 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-159033477100219"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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