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.r178-tajo-158987882600604.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 DiscoveryGPU-PT-07a, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r178-tajo-158987882600604
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 192K
-rw-r--r-- 1 mcc users 3.4K Mar 31 06:44 CTLCardinality.txt
-rw-r--r-- 1 mcc users 20K Mar 31 06:44 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Mar 29 23:11 CTLFireability.txt
-rw-r--r-- 1 mcc users 16K Mar 29 23:11 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 24 05:37 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K Mar 24 05:37 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.1K Apr 8 14:49 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Apr 28 14:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Apr 8 14:49 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 28 14:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K Mar 28 14:34 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 20K Mar 28 14:34 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Mar 27 07:34 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 12K Mar 27 07:34 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 28 14:50 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Mar 28 14:50 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 24 05:37 instance
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 iscolored
-rw-r--r-- 1 mcc users 25K Mar 24 05:37 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME DiscoveryGPU-PT-07a-CTLFireability-00
FORMULA_NAME DiscoveryGPU-PT-07a-CTLFireability-01
FORMULA_NAME DiscoveryGPU-PT-07a-CTLFireability-02
FORMULA_NAME DiscoveryGPU-PT-07a-CTLFireability-03
FORMULA_NAME DiscoveryGPU-PT-07a-CTLFireability-04
FORMULA_NAME DiscoveryGPU-PT-07a-CTLFireability-05
FORMULA_NAME DiscoveryGPU-PT-07a-CTLFireability-06
FORMULA_NAME DiscoveryGPU-PT-07a-CTLFireability-07
FORMULA_NAME DiscoveryGPU-PT-07a-CTLFireability-08
FORMULA_NAME DiscoveryGPU-PT-07a-CTLFireability-09
FORMULA_NAME DiscoveryGPU-PT-07a-CTLFireability-10
FORMULA_NAME DiscoveryGPU-PT-07a-CTLFireability-11
FORMULA_NAME DiscoveryGPU-PT-07a-CTLFireability-12
FORMULA_NAME DiscoveryGPU-PT-07a-CTLFireability-13
FORMULA_NAME DiscoveryGPU-PT-07a-CTLFireability-14
FORMULA_NAME DiscoveryGPU-PT-07a-CTLFireability-15

=== Now, execution of the tool begins

BK_START 1591231235213

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-04 00:40:36] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -timeout, 3600, -rebuildPNML]
[2020-06-04 00:40:36] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-04 00:40:37] [INFO ] Load time of PNML (sax parser for PT used): 40 ms
[2020-06-04 00:40:37] [INFO ] Transformed 73 places.
[2020-06-04 00:40:37] [INFO ] Transformed 99 transitions.
[2020-06-04 00:40:37] [INFO ] Found NUPN structural information;
[2020-06-04 00:40:37] [INFO ] Parsed PT model containing 73 places and 99 transitions in 84 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 16 ms.
Incomplete random walk after 100000 steps, including 1313 resets, run finished after 155 ms. (steps per millisecond=645 ) properties seen :[1, 1, 1, 0, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1]
[2020-06-04 00:40:37] [INFO ] Flow matrix only has 92 transitions (discarded 7 similar events)
// Phase 1: matrix 92 rows 73 cols
[2020-06-04 00:40:37] [INFO ] Computed 2 place invariants in 3 ms
[2020-06-04 00:40:37] [INFO ] [Real]Absence check using 2 positive place invariants in 9 ms returned sat
[2020-06-04 00:40:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 00:40:37] [INFO ] [Real]Absence check using state equation in 49 ms returned unsat
[2020-06-04 00:40:37] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2020-06-04 00:40:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 00:40:37] [INFO ] [Real]Absence check using state equation in 16 ms returned unsat
[2020-06-04 00:40:37] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned unsat
[2020-06-04 00:40:37] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2020-06-04 00:40:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 00:40:37] [INFO ] [Real]Absence check using state equation in 31 ms returned unsat
Successfully simplified 4 atomic propositions for a total of 4 simplifications.
[2020-06-04 00:40:37] [INFO ] Initial state reduction rules for CTL removed 4 formulas.
[2020-06-04 00:40:37] [INFO ] Flatten gal took : 31 ms
[2020-06-04 00:40:37] [INFO ] Initial state reduction rules for CTL removed 4 formulas.
[2020-06-04 00:40:37] [INFO ] Flatten gal took : 9 ms
FORMULA DiscoveryGPU-PT-07a-CTLFireability-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-07a-CTLFireability-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-07a-CTLFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-07a-CTLFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-06-04 00:40:37] [INFO ] Export to MCC properties in file /home/mcc/execution/CTLFireability.sr.xml took 3 ms.
[2020-06-04 00:40:37] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 2 ms.
info: Time: 3600 - MCC
vrfy: Checking CTLFireability @ DiscoveryGPU-PT-07a @ 3570 seconds

FORMULA DiscoveryGPU-PT-07a-CTLFireability-04 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DiscoveryGPU-PT-07a-CTLFireability-08 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DiscoveryGPU-PT-07a-CTLFireability-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DiscoveryGPU-PT-07a-CTLFireability-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DiscoveryGPU-PT-07a-CTLFireability-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DiscoveryGPU-PT-07a-CTLFireability-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DiscoveryGPU-PT-07a-CTLFireability-00 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DiscoveryGPU-PT-07a-CTLFireability-06 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DiscoveryGPU-PT-07a-CTLFireability-05 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DiscoveryGPU-PT-07a-CTLFireability-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DiscoveryGPU-PT-07a-CTLFireability-02 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DiscoveryGPU-PT-07a-CTLFireability-07 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 3183
rslt: Output for CTLFireability @ DiscoveryGPU-PT-07a

{
"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=CTLFireability.xml",
"--mcc",
"--donotcomputecapacities",
"--encoder=simplecompressed",
"--safe",
"--check=modelchecking",
"--stubborn=tarjan",
"--stateequation=par",
"--quickchecks",
"--timelimit=3570",
"--localtimelimit=0",
"--preference=force_ctl",
"--json=CTLFireability.json",
"--jsoninclude=formula,formulastat,net"
],
"starttime": "Thu Jun 4 00:40:37 2020
",
"timelimit": 3570
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 297
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 2,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 2,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "EF(AX(AX(((1 <= p28) AND (1 <= p72)))))",
"processed_size": 39,
"rewrites": 24
},
"net":
{
"conflict_clusters": 10,
"singleton_clusters": 0
},
"result":
{
"edges": 36,
"markings": 37,
"produced_by": "CTL model checker",
"value": true
},
"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": 324
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 2,
"E": 1,
"F": 1,
"G": 1,
"U": 0,
"X": 1,
"aconj": 2,
"adisj": 0,
"aneg": 2,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "EF((AX(((p60 <= 0) OR (p71 <= 0))) AND AG(((p46 <= 0)))))",
"processed_size": 58,
"rewrites": 24
},
"net":
{
"conflict_clusters": 10,
"singleton_clusters": 0
},
"result":
{
"edges": 108,
"markings": 43,
"produced_by": "CTL model checker",
"value": true
},
"task":
{
"compoundnumber": 1,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 356
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 2,
"F": 1,
"G": 1,
"U": 0,
"X": 1,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "EX(AG(EF(((1 <= p29) AND (1 <= p71)))))",
"processed_size": 39,
"rewrites": 24
},
"net":
{
"conflict_clusters": 10,
"singleton_clusters": 0
},
"result":
{
"edges": 3170,
"markings": 834,
"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": 396
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "E (F (((1 <= p13))))",
"processed_size": 20,
"rewrites": 22
},
"result":
{
"edges": 8,
"markings": 9,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 3,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"type": "reachability",
"workflow": "stateequation||search"
}
},

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

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 594
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 1,
"F": 1,
"G": 0,
"U": 1,
"X": 0,
"aconj": 1,
"adisj": 1,
"aneg": 0,
"comp": 5,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 5,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "EF(A(((p20 <= 0) OR (p71 <= 0)) U ((1 <= p23) AND (1 <= p58) AND (1 <= p72))))",
"processed_size": 79,
"rewrites": 23
},
"net":
{
"conflict_clusters": 10,
"singleton_clusters": 0
},
"result":
{
"edges": 88401308,
"markings": 8000230,
"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"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 700
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 1,
"F": 2,
"G": 0,
"U": 0,
"X": 0,
"aconj": 8,
"adisj": 1,
"aneg": 0,
"comp": 10,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 10,
"taut": 0,
"tconj": 5,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 9,
"visible_transitions": 0
},
"processed": "EF((AF(((1 <= p35) AND (1 <= p71))) AND (((1 <= p68)) AND (((1 <= p72)) AND (((1 <= p28)) AND (((1 <= p3)) AND (((1 <= p18)) OR ((1 <= p58)) OR ((1 <= p67) AND (1 <= p71)))))))))",
"processed_size": 180,
"rewrites": 23
},
"net":
{
"conflict_clusters": 10,
"singleton_clusters": 0
},
"result":
{
"edges": 5454645,
"markings": 575300,
"produced_by": "CTL model checker",
"value": true
},
"task":
{
"compoundnumber": 7,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 875
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 2,
"F": 3,
"G": 0,
"U": 0,
"X": 0,
"aconj": 3,
"adisj": 0,
"aneg": 0,
"comp": 6,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 6,
"taut": 0,
"tconj": 2,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "EF((((1 <= p19) AND (1 <= p71)) AND (AF(((1 <= p2) AND (1 <= p71))) AND EF(((1 <= p56) AND (1 <= p71))))))",
"processed_size": 106,
"rewrites": 24
},
"net":
{
"conflict_clusters": 10,
"singleton_clusters": 0
},
"result":
{
"edges": 70733288,
"markings": 6084037,
"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"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1149
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 2,
"E": 1,
"F": 3,
"G": 0,
"U": 0,
"X": 0,
"aconj": 4,
"adisj": 1,
"aneg": 0,
"comp": 10,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 10,
"taut": 0,
"tconj": 2,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 7,
"visible_transitions": 0
},
"processed": "EF((AF(((1 <= p69) AND (1 <= p71) AND (1 <= p45) AND (1 <= p71))) AND (AF(((1 <= p20) AND (1 <= p71))) AND (((1 <= p47) AND (1 <= p71)) OR ((1 <= p44) AND (1 <= p72))))))",
"processed_size": 171,
"rewrites": 24
},
"net":
{
"conflict_clusters": 10,
"singleton_clusters": 0
},
"result":
{
"edges": 212742018,
"markings": 19487172,
"produced_by": "CTL model checker",
"value": false
},
"task":
{
"compoundnumber": 9,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1644
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 0,
"G": 0,
"U": 1,
"X": 0,
"aconj": 2,
"adisj": 3,
"aneg": 0,
"comp": 8,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 8,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 7,
"visible_transitions": 0
},
"processed": "E ((((p66 <= 0) OR (p71 <= 0) OR (p9 <= 0) OR (((p32 <= 0) OR (p71 <= 0)) AND ((p63 <= 0) OR (p72 <= 0)))) U ((1 <= p11))))",
"processed_size": 128,
"rewrites": 24
},
"result":
{
"edges": 52028,
"markings": 10028,
"produced_by": "state space /EU",
"value": true
},
"task":
{
"compoundnumber": 10,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "eu preserving",
"visible": 66
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "existential_until",
"workflow": "stateequation"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3289
},
"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 <= p31))",
"processed_size": 12,
"rewrites": 21
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 11,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": null
},
"task":
{
"compoundnumber": 11,
"type": "boolean"
}
},

{
"child":
[

{
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 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 <= p31))",
"processed_size": 12,
"rewrites": 21
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 12,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 2,
"adisj": 1,
"aneg": 1,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "(((p1 <= 0)) AND ((p37 <= 0) OR (p71 <= 0)))",
"processed_size": 45,
"rewrites": 25
},
"result":
{
"edges": 147581281,
"markings": 19326121,
"produced_by": "parallel",
"value": false
},
"task":
{
"compoundnumber": 13,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "tscc preserving/always up"
}
},
"stateequation":
{
"literals": 4,
"problems": 2
},
"store":
{
"type": "dfs/tscc"
},
"type": "possible_invariance",
"workflow": "stateequation"
}
}
],
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 12,
"type": "boolean"
}
}
],
"exit":
{
"error": null,
"memory": 35896,
"runtime": 387.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "CTLFireability.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "E(F(A((** U **)))) : E((** U **)) : E(F(A(X(A(X(**)))))) : E(F((** AND (A(F(**)) AND E(F(**)))))) : E(F((A(F(**)) AND (** AND (** AND (** AND (** AND **))))))) : (E(F(A(G(**)))) OR **) : E(F((A(X(*)) AND A(G(*))))) : E(F((A(F(**)) AND (A(F(**)) AND **)))) : E(F(**)) : E(X(A(G(E(F(**)))))) : E(F(**)) : E(F(**))"
},
"net":
{
"arcs": 318,
"conflict_clusters": 10,
"places": 73,
"places_significant": 71,
"singleton_clusters": 0,
"transitions": 99
},
"result":
{
"preliminary_value": "yes yes yes yes yes no yes no yes no yes yes ",
"value": "yes yes yes yes yes no yes no yes no yes yes "
},
"task":
{
"type": "compound"
}
}
lola: LoLA will run for 3570 seconds at most (--timelimit)
lola: NET
lola: input: PNML file (--pnml)
lola: reading net from model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file model.pnml
lola: 172/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 73
lola: finding significant places
lola: 73 places, 99 transitions, 71 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 CTLFireability.xml
lola: LP says that atomic proposition is always true: (p20 <= 1)
lola: LP says that atomic proposition is always true: (p71 <= 1)
lola: LP says that atomic proposition is always true: (p23 <= 1)
lola: LP says that atomic proposition is always true: (p58 <= 1)
lola: LP says that atomic proposition is always true: (p72 <= 1)
lola: LP says that atomic proposition is always true: (p66 <= 1)
lola: LP says that atomic proposition is always true: (p71 <= 1)
lola: LP says that atomic proposition is always true: (p9 <= 1)
lola: LP says that atomic proposition is always true: (p32 <= 1)
lola: LP says that atomic proposition is always true: (p71 <= 1)
lola: LP says that atomic proposition is always true: (p63 <= 1)
lola: LP says that atomic proposition is always true: (p72 <= 1)
lola: LP says that atomic proposition is always true: (p11 <= 1)
lola: LP says that atomic proposition is always true: (p28 <= 1)
lola: LP says that atomic proposition is always true: (p72 <= 1)
lola: LP says that atomic proposition is always true: (p19 <= 1)
lola: LP says that atomic proposition is always true: (p71 <= 1)
lola: LP says that atomic proposition is always true: (p2 <= 1)
lola: LP says that atomic proposition is always true: (p71 <= 1)
lola: LP says that atomic proposition is always true: (p56 <= 1)
lola: LP says that atomic proposition is always true: (p71 <= 1)
lola: LP says that atomic proposition is always true: (p35 <= 1)
lola: LP says that atomic proposition is always true: (p71 <= 1)
lola: LP says that atomic proposition is always true: (p68 <= 1)
lola: LP says that atomic proposition is always true: (p72 <= 1)
lola: LP says that atomic proposition is always true: (p28 <= 1)
lola: LP says that atomic proposition is always true: (p3 <= 1)
lola: LP says that atomic proposition is always true: (p18 <= 1)
lola: LP says that atomic proposition is always true: (p58 <= 1)
lola: LP says that atomic proposition is always true: (p67 <= 1)
lola: LP says that atomic proposition is always true: (p71 <= 1)
lola: LP says that atomic proposition is always true: (p1 <= 1)
lola: LP says that atomic proposition is always true: (p37 <= 1)
lola: LP says that atomic proposition is always true: (p71 <= 1)
lola: LP says that atomic proposition is always true: (p31 <= 1)
lola: LP says that atomic proposition is always true: (p60 <= 1)
lola: LP says that atomic proposition is always true: (p71 <= 1)
lola: LP says that atomic proposition is always true: (p46 <= 1)
lola: LP says that atomic proposition is always true: (p69 <= 1)
lola: LP says that atomic proposition is always true: (p71 <= 1)
lola: LP says that atomic proposition is always true: (p45 <= 1)
lola: LP says that atomic proposition is always true: (p71 <= 1)
lola: LP says that atomic proposition is always true: (p20 <= 1)
lola: LP says that atomic proposition is always true: (p71 <= 1)
lola: LP says that atomic proposition is always true: (p47 <= 1)
lola: LP says that atomic proposition is always true: (p71 <= 1)
lola: LP says that atomic proposition is always true: (p44 <= 1)
lola: LP says that atomic proposition is always true: (p72 <= 1)
lola: LP says that atomic proposition is always true: (p13 <= 1)
lola: LP says that atomic proposition is always true: (p29 <= 1)
lola: LP says that atomic proposition is always true: (p71 <= 1)
lola: LP says that atomic proposition is always true: (p1 <= 1)
lola: LP says that atomic proposition is always true: (p34 <= 1)
lola: LP says that atomic proposition is always true: (p31 <= 1)
lola: LP says that atomic proposition is always true: (p6 <= 1)
lola: LP says that atomic proposition is always true: (p71 <= 1)
lola: LP says that atomic proposition is always true: (p45 <= 1)
lola: E (F (A ((((p20 <= 0) OR (p71 <= 0)) U ((1 <= p23) AND (1 <= p58) AND (1 <= p72)))))) : E ((((p66 <= 0) OR (p71 <= 0) OR (p9 <= 0) OR (((p32 <= 0) OR (p71 <= 0)) AND ((p63 <= 0) OR (p72 <= 0)))) U ((1 <= p11)))) : E (F (A (X (A (X (((1 <= p28) AND (1 <= p72)))))))) : E (F (((((1 <= p19) AND (1 <= p71)) AND A (F (((1 <= p2) AND (1 <= p71))))) AND E (F (((1 <= p56) AND (1 <= p71))))))) : E (F ((((((A (F (((1 <= p35) AND (1 <= p71)))) AND ((1 <= p68))) AND ((1 <= p72))) AND ((1 <= p28))) AND ((1 <= p3))) AND (((1 <= p18)) OR ((1 <= p58)) OR ((1 <= p67) AND (1 <= p71)))))) : (E (F (A (G ((((1 <= p1)) OR ((1 <= p37) AND (1 <= p71))))))) OR ((1 <= p31))) : E (F ((NOT(E (X (((1 <= p60) AND (1 <= p71))))) AND NOT(E (F (((1 <= p46)))))))) : E (F (((A (F (((1 <= p69) AND (1 <= p71) AND (1 <= p45) AND (1 <= p71)))) AND A (F (((1 <= p20) AND (1 <= p71))))) AND (((1 <= p47) AND (1 <= p71)) OR ((1 <= p44) AND (1 <= p72)))))) : E (F (A (F (E (F (((1 <= p13)))))))) : E (X (A (G (E (F (((1 <= p29) AND (1 <= p71)))))))) : E (F (((1 <= p1)))) : E ((A (F ((((1 <= p34)) OR ((1 <= p31))))) U E (F (((1 <= p6) AND (1 <= p71) AND (1 <= p45))))))
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:251
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:251
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:326
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:449
lola: rewrite Frontend/Parser/formula_rewrite.k:401
lola: rewrite Frontend/Parser/formula_rewrite.k:473
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (A (X (A (X (((1 <= p28) AND (1 <= p72))))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:812
lola: rewrite Frontend/Parser/formula_rewrite.k:812
lola: rewrite Frontend/Parser/formula_rewrite.k:806
lola: processed formula: EF(AX(AX(((1 <= p28) AND (1 <= p72)))))
lola: processed formula length: 39
lola: 24 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 37 markings, 36 edges
lola: ========================================
lola: subprocess 1 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((A (X (((p60 <= 0) OR (p71 <= 0)))) AND A (G (((p46 <= 0)))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:812
lola: rewrite Frontend/Parser/formula_rewrite.k:813
lola: rewrite Frontend/Parser/formula_rewrite.k:806
lola: processed formula: EF((AX(((p60 <= 0) OR (p71 <= 0))) AND AG(((p46 <= 0)))))
lola: processed formula length: 58
lola: 24 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 43 markings, 108 edges
lola: ========================================
lola: subprocess 2 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (X (A (G (E (F (((1 <= p29) AND (1 <= p71))))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:806
lola: rewrite Frontend/Parser/formula_rewrite.k:813
lola: rewrite Frontend/Parser/formula_rewrite.k:807
lola: processed formula: EX(AG(EF(((1 <= p29) AND (1 <= p71)))))
lola: processed formula length: 39
lola: 24 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 834 markings, 3170 edges
lola: ========================================
lola: subprocess 3 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((1 <= p13))))
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 <= p13))))
lola: processed formula length: 20
lola: 22 rewrites
lola: closed formula file CTLFireability.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: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 9 markings, 8 edges
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((1 <= p13))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: ========================================
lola: subprocess 4 will run for 445 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((1 <= p1))))
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 <= p1))))
lola: processed formula length: 19
lola: 22 rewrites
lola: closed formula file CTLFireability.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: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 11 markings, 10 edges
lola: formula 0: ((1 <= p1))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: ========================================
lola: subprocess 5 will run for 509 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((1 <= p6) AND (1 <= p71) AND (1 <= p45))))
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 <= p6) AND (1 <= p71) AND (1 <= p45))))
lola: processed formula length: 49
lola: 22 rewrites
lola: closed formula file CTLFireability.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 <= p6) AND (1 <= p71) AND (1 <= p45))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 3 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to CTLFireability-5-0.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 11 markings, 10 edges
lola: ========================================
lola: subprocess 6 will run for 594 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (A ((((p20 <= 0) OR (p71 <= 0)) U ((1 <= p23) AND (1 <= p58) AND (1 <= p72))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:814
lola: rewrite Frontend/Parser/formula_rewrite.k:806
lola: processed formula: EF(A(((p20 <= 0) OR (p71 <= 0)) U ((1 <= p23) AND (1 <= p58) AND (1 <= p72))))
lola: processed formula length: 79
lola: 23 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: 694943 markings, 6794906 edges, 138989 markings/sec, 0 secs
lola: 1396002 markings, 13952159 edges, 140212 markings/sec, 5 secs
lola: 2055532 markings, 21117710 edges, 131906 markings/sec, 10 secs
lola: 2706786 markings, 28211936 edges, 130251 markings/sec, 15 secs
lola: 3342666 markings, 35268264 edges, 127176 markings/sec, 20 secs
lola: 3928862 markings, 42333275 edges, 117239 markings/sec, 25 secs
lola: 4584185 markings, 49419262 edges, 131065 markings/sec, 30 secs
lola: 5194588 markings, 56534435 edges, 122081 markings/sec, 35 secs
lola: 5808195 markings, 63548980 edges, 122721 markings/sec, 40 secs
lola: 6413131 markings, 70539240 edges, 120987 markings/sec, 45 secs
lola: 6987121 markings, 77441494 edges, 114798 markings/sec, 50 secs
lola: 7626649 markings, 84287801 edges, 127906 markings/sec, 55 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 8000230 markings, 88401308 edges
lola: ========================================
lola: subprocess 7 will run for 700 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((A (F (((1 <= p35) AND (1 <= p71)))) AND (((1 <= p68)) AND (((1 <= p72)) AND (((1 <= p28)) AND (((1 <= p3)) AND (((1 <= p18)) OR ((1 <= p58)) OR ((1 <= p67) AND (1 <= p71))))))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:811
lola: rewrite Frontend/Parser/formula_rewrite.k:806
lola: processed formula: EF((AF(((1 <= p35) AND (1 <= p71))) AND (((1 <= p68)) AND (((1 <= p72)) AND (((1 <= p28)) AND (((1 <= p3)) AND (((1 <= p18)) OR ((1 <= p58)) OR ((1 <= p67) AND (1 <= p71)))))))))
lola: processed formula length: 180
lola: 23 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 575300 markings, 5454645 edges
lola: ========================================
lola: subprocess 8 will run for 875 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((((1 <= p19) AND (1 <= p71)) AND (A (F (((1 <= p2) AND (1 <= p71)))) AND E (F (((1 <= p56) AND (1 <= p71))))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:811
lola: rewrite Frontend/Parser/formula_rewrite.k:806
lola: rewrite Frontend/Parser/formula_rewrite.k:806
lola: processed formula: EF((((1 <= p19) AND (1 <= p71)) AND (AF(((1 <= p2) AND (1 <= p71))) AND EF(((1 <= p56) AND (1 <= p71))))))
lola: processed formula length: 106
lola: 24 rewrites
lola: closed formula file CTLFireability.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: 677693 markings, 6648298 edges, 135539 markings/sec, 0 secs
lola: 1331741 markings, 13627495 edges, 130810 markings/sec, 5 secs
lola: 1951695 markings, 20623272 edges, 123991 markings/sec, 10 secs
lola: 2568555 markings, 27597969 edges, 123372 markings/sec, 15 secs
lola: 3137618 markings, 34508398 edges, 113813 markings/sec, 20 secs
lola: 3684295 markings, 41523653 edges, 109335 markings/sec, 25 secs
lola: 4264909 markings, 48443973 edges, 116123 markings/sec, 30 secs
lola: 4836965 markings, 55487837 edges, 114411 markings/sec, 35 secs
lola: 5377099 markings, 62471209 edges, 108027 markings/sec, 40 secs
lola: 5945171 markings, 69417606 edges, 113614 markings/sec, 45 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 6084037 markings, 70733288 edges
lola: ========================================
lola: subprocess 9 will run for 1149 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((A (F (((1 <= p69) AND (1 <= p71) AND (1 <= p45) AND (1 <= p71)))) AND (A (F (((1 <= p20) AND (1 <= p71)))) AND (((1 <= p47) AND (1 <= p71)) OR ((1 <= p44) AND (1 <= p72)))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:811
lola: rewrite Frontend/Parser/formula_rewrite.k:811
lola: rewrite Frontend/Parser/formula_rewrite.k:806
lola: processed formula: EF((AF(((1 <= p69) AND (1 <= p71) AND (1 <= p45) AND (1 <= p71))) AND (AF(((1 <= p20) AND (1 <= p71))) AND (((1 <= p47) AND (1 <= p71)) OR ((1 <= p44) AND (1 <= p72))))))
lola: processed formula length: 171
lola: 24 rewrites
lola: closed formula file CTLFireability.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: 728744 markings, 7111662 edges, 145749 markings/sec, 0 secs
lola: 1418972 markings, 14198558 edges, 138046 markings/sec, 5 secs
lola: 2070009 markings, 21285531 edges, 130207 markings/sec, 10 secs
lola: 2713454 markings, 28303312 edges, 128689 markings/sec, 15 secs
lola: 3340565 markings, 35278471 edges, 125422 markings/sec, 20 secs
lola: 3920830 markings, 42274090 edges, 116053 markings/sec, 25 secs
lola: 4566390 markings, 49264846 edges, 129112 markings/sec, 30 secs
lola: 5170883 markings, 56307683 edges, 120899 markings/sec, 35 secs
lola: 5778013 markings, 63248019 edges, 121426 markings/sec, 40 secs
lola: 6376961 markings, 70175115 edges, 119790 markings/sec, 45 secs
lola: 6946743 markings, 77025332 edges, 113956 markings/sec, 50 secs
lola: 7576736 markings, 83812141 edges, 125999 markings/sec, 55 secs
lola: 8206264 markings, 90541724 edges, 125906 markings/sec, 60 secs
lola: 8815996 markings, 97449629 edges, 121946 markings/sec, 65 secs
lola: 9396241 markings, 104249837 edges, 116049 markings/sec, 70 secs
lola: 9994322 markings, 111034900 edges, 119616 markings/sec, 75 secs
lola: 10553900 markings, 116990098 edges, 111916 markings/sec, 80 secs
lola: 11087815 markings, 122732832 edges, 106783 markings/sec, 85 secs
lola: 11697288 markings, 129420582 edges, 121895 markings/sec, 90 secs
lola: 12295180 markings, 135703483 edges, 119578 markings/sec, 95 secs
lola: 12903739 markings, 142395322 edges, 121712 markings/sec, 100 secs
lola: 13514925 markings, 148812654 edges, 122237 markings/sec, 105 secs
lola: 14138306 markings, 155655488 edges, 124676 markings/sec, 110 secs
lola: 14747678 markings, 162055346 edges, 121874 markings/sec, 115 secs
lola: 15367486 markings, 168853837 edges, 123962 markings/sec, 120 secs
lola: 15957031 markings, 175157063 edges, 117909 markings/sec, 125 secs
lola: 16594824 markings, 181859575 edges, 127559 markings/sec, 130 secs
lola: 17182558 markings, 188317370 edges, 117547 markings/sec, 135 secs
lola: 17789787 markings, 194586032 edges, 121446 markings/sec, 140 secs
lola: 18355920 markings, 200741925 edges, 113227 markings/sec, 145 secs
lola: 18916909 markings, 206806547 edges, 112198 markings/sec, 150 secs
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 19487172 markings, 212742018 edges
lola: ========================================
lola: subprocess 10 will run for 1644 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E ((((p66 <= 0) OR (p71 <= 0) OR (p9 <= 0) OR (((p32 <= 0) OR (p71 <= 0)) AND ((p63 <= 0) OR (p72 <= 0)))) U ((1 <= p11))))
lola: ========================================
lola: SUBTASK
lola: checking existential until
lola: rewrite Frontend/Parser/formula_rewrite.k:618
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: rewrite Frontend/Parser/formula_rewrite.k:738
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: E ((((p66 <= 0) OR (p71 <= 0) OR (p9 <= 0) OR (((p32 <= 0) OR (p71 <= 0)) AND ((p63 <= 0) OR (p72 <= 0)))) U ((1 <= p11))))
lola: processed formula length: 128
lola: 24 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /EU)
lola: state space: using reachability graph (EU version) (--search=depth)
lola: state space: using eu preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((1 <= p11))
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 CTLFireability-10-0.sara
lola: state equation: calling and running sara
sara: try reading problem file CTLFireability-10-0.sara.
sara: error: :640: error near 'TRANSITION': syntax error, unexpected KEY_TRANSITION, expecting SEMICOLON or COMMA
sara: error while reading Petri net from file -- aborting [#04]
sara: see manual for a documentation of this error
sara: last error message: No such file or directory
lola: state equation:solution unknown
lola: SUBRESULT
lola: result: yes
lola: produced by: state space /EU
lola: There is a path where Predicate Phi holds until Predicate Psi.
lola: 10028 markings, 52028 edges
lola: ========================================
lola: subprocess 11 will run for 3289 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E (F (A (G ((((1 <= p1)) OR ((1 <= p37) AND (1 <= p71))))))) OR ((1 <= p31)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 11 will run for 3289 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((1 <= p31))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((1 <= p31))
lola: processed formula length: 12
lola: 21 rewrites
lola: closed formula file CTLFireability.xml
lola: processed formula with 1 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: SUBRESULT
lola: result: unknown
lola: The Boolean predicate may be true or false.
lola: ========================================
lola: ========================================
lola: ...considering subproblem: (E (F (A (G ((((1 <= p1)) OR ((1 <= p37) AND (1 <= p71))))))) OR ((1 <= p31)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: ...considering subproblem: ((1 <= p31))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((1 <= p31))
lola: processed formula length: 12
lola: 21 rewrites
lola: closed formula file CTLFireability.xml
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: ========================================
lola: ...considering subproblem: E (F (A (G ((((1 <= p1)) OR ((1 <= p37) AND (1 <= p71)))))))
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:787
lola: processed formula: (((p1 <= 0)) AND ((p37 <= 0) OR (p71 <= 0)))
lola: processed formula length: 45
lola: 25 rewrites
lola: closed formula file CTLFireability.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: (((1 <= p1)) OR ((1 <= p37) AND (1 <= p71)))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 3 literals and 2 conjunctive subformulas
lola: state equation task get result started, id 1
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: state equation task get result rewrite finished id 1
lola: state equation task get result unparse finished++ id 1
lola: formula 1: (((p1 <= 0)) AND ((p37 <= 0) OR (p71 <= 0)))
lola: state equation task get result unparse finished id 1
lola: state equation: Generated DNF with 4 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to CTLFireability-13-0.sara
lola: state equation: calling and running sara
lola: state equation: write sara problem file to CTLFireability-13-1.sara
sara: try reading problem file CTLFireability-13-0.sara.
lola: state equation: calling and running sara
sara: error: :640: error near 'TRANSITION': syntax error, unexpected KEY_TRANSITION, expecting SEMICOLON or COMMA
sara: error while reading Petri net from file -- aborting [#04]
sara: see manual for a documentation of this error
sara: last error message: No such file or directory
sara: try reading problem file CTLFireability-13-1.sara.
lola: state equation:solution unknown
sara: error: :640: error near 'TRANSITION': syntax error, unexpected KEY_TRANSITION, expecting SEMICOLON or COMMA
sara: error while reading Petri net from file -- aborting [#04]
sara: see manual for a documentation of this error
sara: last error message: No such file or directory
lola: state equation:solution unknown
lola: sara is running 0 secs || sara is running 0 secs || 1112071 markings, 7392616 edges, 222414 markings/sec, 0 secs
lola: sara is running 5 secs || sara is running 5 secs || 2136578 markings, 15030183 edges, 204901 markings/sec, 5 secs
lola: sara is running 10 secs || sara is running 10 secs || 3137105 markings, 22630658 edges, 200105 markings/sec, 10 secs
lola: sara is running 15 secs || sara is running 15 secs || 4067336 markings, 30207933 edges, 186046 markings/sec, 15 secs
lola: sara is running 20 secs || sara is running 20 secs || 4970967 markings, 37798950 edges, 180726 markings/sec, 20 secs
lola: sara is running 25 secs || sara is running 25 secs || 5967621 markings, 45178229 edges, 199331 markings/sec, 25 secs
lola: sara is running 30 secs || sara is running 30 secs || 6850994 markings, 52616890 edges, 176675 markings/sec, 30 secs
lola: sara is running 35 secs || sara is running 35 secs || 7827896 markings, 59957205 edges, 195380 markings/sec, 35 secs
lola: sara is running 40 secs || sara is running 40 secs || 8756857 markings, 67373113 edges, 185792 markings/sec, 40 secs
lola: sara is running 45 secs || sara is running 45 secs || 9680044 markings, 74625134 edges, 184637 markings/sec, 45 secs
lola: sara is running 50 secs || sara is running 50 secs || 10561460 markings, 80984411 edges, 176283 markings/sec, 50 secs
lola: sara is running 55 secs || sara is running 55 secs || 11467052 markings, 87660048 edges, 181118 markings/sec, 55 secs
lola: sara is running 60 secs || sara is running 60 secs || 12341050 markings, 94098947 edges, 174800 markings/sec, 60 secs
lola: sara is running 65 secs || sara is running 65 secs || 13160274 markings, 100228915 edges, 163845 markings/sec, 65 secs
lola: sara is running 70 secs || sara is running 70 secs || 14027825 markings, 107165328 edges, 173510 markings/sec, 70 secs
lola: sara is running 75 secs || sara is running 75 secs || 14890823 markings, 113713531 edges, 172600 markings/sec, 75 secs
lola: sara is running 80 secs || sara is running 80 secs || 15814077 markings, 120588394 edges, 184651 markings/sec, 80 secs
lola: sara is running 85 secs || sara is running 85 secs || 16682705 markings, 127485183 edges, 173726 markings/sec, 85 secs
lola: sara is running 90 secs || sara is running 90 secs || 17469926 markings, 133774631 edges, 157444 markings/sec, 90 secs
lola: sara is running 95 secs || sara is running 95 secs || 18297815 markings, 140337965 edges, 165578 markings/sec, 95 secs
lola: sara is running 100 secs || sara is running 100 secs || 19166061 markings, 146343865 edges, 173649 markings/sec, 100 secs
lola: SUBRESULT
lola: result: no
lola: produced by: parallel
lola: The predicate is not possibly invariant.
lola: 19326121 markings, 147581281 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: RESULT
lola:
SUMMARY: yes yes yes yes yes no yes no yes no yes yes
lola:
preliminary result: yes yes yes yes yes no yes no yes no yes yes
lola: memory consumption: 35896 KB
lola: time consumption: 387 seconds
lola: print data as JSON (--json)
lola: writing JSON to CTLFireability.json
lola: closed JSON file CTLFireability.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="DiscoveryGPU-PT-07a"
export BK_EXAMINATION="CTLFireability"
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 DiscoveryGPU-PT-07a, examination is CTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r178-tajo-158987882600604"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/DiscoveryGPU-PT-07a.tgz
mv DiscoveryGPU-PT-07a execution
cd execution
if [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "UpperBounds" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] || [ "CTLFireability" = "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 [ "CTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLFireability" != "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 "CTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLFireability.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 '' CTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLFireability"
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 ;