MCC'2020 - Execution of r174-csrt-158987852700132

About the Execution of ITS-LoLa for NQueens-PT-10

Execution Summary
Max Memory Used (MB)	Time wait (ms)	CPU Usage (ms)	I/O Wait (ms)	Computed Result	Execution Status
15745.520	3600000.00	316154.00	1719.10	FTFFTFTFTFTFFFTF	normal

Execution Chart

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

Trace from the execution

Formatting '/local/x2003239/mcc2020-input.r174-csrt-158987852700132.qcow2', fmt=qcow2 size=4294967296 backing_file=/local/x2003239/mcc2020-input.qcow2 encryption=off cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itslola
Input is NQueens-PT-10, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r174-csrt-158987852700132
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 268K
-rw-r--r-- 1 mcc users 3.0K Apr 8 13:11 CTLCardinality.txt
-rw-r--r-- 1 mcc users 17K Apr 8 13:11 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.7K Apr 7 16:38 CTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 7 16:38 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 24 05:37 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.1K Mar 24 05:37 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.2K Apr 14 12:43 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Apr 28 14:01 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 14 12:43 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 28 14:01 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Apr 6 19:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 18K Apr 6 19:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.9K Apr 6 02:50 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 6 02:50 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 6 20:24 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Apr 6 20:24 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 24 05:37 instance
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 iscolored
-rw-r--r-- 1 mcc users 90K 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 NQueens-PT-10-CTLFireability-00
FORMULA_NAME NQueens-PT-10-CTLFireability-01
FORMULA_NAME NQueens-PT-10-CTLFireability-02
FORMULA_NAME NQueens-PT-10-CTLFireability-03
FORMULA_NAME NQueens-PT-10-CTLFireability-04
FORMULA_NAME NQueens-PT-10-CTLFireability-05
FORMULA_NAME NQueens-PT-10-CTLFireability-06
FORMULA_NAME NQueens-PT-10-CTLFireability-07
FORMULA_NAME NQueens-PT-10-CTLFireability-08
FORMULA_NAME NQueens-PT-10-CTLFireability-09
FORMULA_NAME NQueens-PT-10-CTLFireability-10
FORMULA_NAME NQueens-PT-10-CTLFireability-11
FORMULA_NAME NQueens-PT-10-CTLFireability-12
FORMULA_NAME NQueens-PT-10-CTLFireability-13
FORMULA_NAME NQueens-PT-10-CTLFireability-14
FORMULA_NAME NQueens-PT-10-CTLFireability-15

=== Now, execution of the tool begins

BK_START 1591130426733

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-02 20:40:29] [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-02 20:40:29] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-02 20:40:29] [INFO ] Load time of PNML (sax parser for PT used): 94 ms
[2020-06-02 20:40:29] [INFO ] Transformed 160 places.
[2020-06-02 20:40:29] [INFO ] Transformed 100 transitions.
[2020-06-02 20:40:29] [INFO ] Parsed PT model containing 160 places and 100 transitions in 159 ms.
Reduce places removed 2 places and 0 transitions.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 28 ms.
Finished random walk after 43 steps, including 4 resets, run visited all 34 properties in 6 ms. (steps per millisecond=7 )
[2020-06-02 20:40:29] [INFO ] Flatten gal took : 54 ms
[2020-06-02 20:40:29] [INFO ] Flatten gal took : 20 ms
[2020-06-02 20:40:29] [INFO ] Export to MCC properties in file /home/mcc/execution/CTLFireability.sr.xml took 5 ms.
[2020-06-02 20:40:29] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 4 ms.
info: Time: 3600 - MCC
vrfy: Checking CTLFireability @ NQueens-PT-10 @ 3570 seconds

FORMULA NQueens-PT-10-CTLFireability-01 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA NQueens-PT-10-CTLFireability-03 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA NQueens-PT-10-CTLFireability-06 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

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

FORMULA NQueens-PT-10-CTLFireability-09 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA NQueens-PT-10-CTLFireability-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA NQueens-PT-10-CTLFireability-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA NQueens-PT-10-CTLFireability-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA NQueens-PT-10-CTLFireability-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA NQueens-PT-10-CTLFireability-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA NQueens-PT-10-CTLFireability-05 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA NQueens-PT-10-CTLFireability-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA NQueens-PT-10-CTLFireability-04 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA NQueens-PT-10-CTLFireability-08 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA NQueens-PT-10-CTLFireability-00 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA NQueens-PT-10-CTLFireability-02 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 3265
rslt: Output for CTLFireability @ NQueens-PT-10

{
"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": "Tue Jun 2 20:40:29 2020
",
"timelimit": 3570
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 222
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 2,
"E": 1,
"F": 1,
"G": 1,
"U": 0,
"X": 1,
"aconj": 1,
"adisj": 0,
"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": "EF(AX(AG(((1 <= p100) AND (1 <= p111) AND (1 <= p128) AND (1 <= p140)))))",
"processed_size": 73,
"rewrites": 36
},
"net":
{
"conflict_clusters": 101,
"singleton_clusters": 0
},
"result":
{
"edges": 16,
"markings": 8,
"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": 237
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 237
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 3,
"adisj": 0,
"aneg": 0,
"comp": 19,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 19,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 17,
"visible_transitions": 0
},
"processed": "(((1 <= p105) AND (1 <= p111) AND (1 <= p133) AND (1 <= p145)) OR ((1 <= p106) AND (1 <= p119) AND (1 <= p126) AND (1 <= p154) AND (1 <= p100) AND (1 <= p114) AND (1 <= p125) AND (1 <= p143)) OR ((1 <= p101) AND (1 <= p112) AND (1 <= p128) AND (1 <= p142) AND (1 <= p100) AND (1 <= p111) AND (1 <= p140)))",
"processed_size": 305,
"rewrites": 36
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 1,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 254
},
"formula":
{
"count":
{
"A": 2,
"E": 0,
"F": 1,
"G": 0,
"U": 0,
"X": 1,
"aconj": 2,
"adisj": 0,
"aneg": 0,
"comp": 8,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 8,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 7,
"visible_transitions": 0
},
"processed": "AX((AF(((1 <= p107) AND (1 <= p118) AND (1 <= p128) AND (1 <= p154))) OR ((1 <= p106) AND (1 <= p119) AND (1 <= p126) AND (1 <= p154))))",
"processed_size": 136,
"rewrites": 35
},
"net":
{
"conflict_clusters": 101,
"singleton_clusters": 0
},
"result":
{
"edges": 53,
"markings": 54,
"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"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 1,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 254
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 2,
"F": 0,
"G": 0,
"U": 1,
"X": 1,
"aconj": 4,
"adisj": 3,
"aneg": 0,
"comp": 29,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 29,
"taut": 0,
"tconj": 2,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 24,
"visible_transitions": 0
},
"processed": "E(((1 <= p108) AND (1 <= p116) AND (1 <= p131) AND (1 <= p153) AND (((1 <= p107) AND (1 <= p110) AND (1 <= p136) AND (1 <= p146) AND (1 <= p103) AND (1 <= p114) AND (1 <= p128)) OR ((1 <= p110) AND (1 <= p137) AND (1 <= p147) AND (1 <= p105) AND (1 <= p128) AND (1 <= p150)))) U (EX(((1 <= p100) AND (1 <= p113) AND (1 <= p126) AND (1 <= p142))) AND (((p100 <= 0) OR (p115 <= 0) OR (p124 <= 0) OR (p144 <= 0)) AND ((p102 <= 0) OR (p116 <= 0) OR (p125 <= 0) OR (p147 <= 0)))))",
"processed_size": 482,
"rewrites": 35
},
"net":
{
"conflict_clusters": 101,
"singleton_clusters": 0
},
"result":
{
"edges": 12,
"markings": 13,
"produced_by": "CTL model checker",
"value": true
},
"task":
{
"compoundnumber": 2,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 274
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 2,
"aneg": 1,
"comp": 8,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 8,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 8,
"visible_transitions": 0
},
"processed": "E (G ((((1 <= p101) AND (1 <= p115) AND (1 <= p125) AND (1 <= p145)) OR ((1 <= p106) AND (1 <= p112) AND (1 <= p133) AND (1 <= p147)))))",
"processed_size": 137,
"rewrites": 34
},
"result":
{
"edges": 4686337,
"markings": 878346,
"produced_by": "state space / EG",
"value": false
},
"task":
{
"compoundnumber": 3,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 53
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 32,
"problems": 16
},
"type": "possible_preservation",
"workflow": "stateequation"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 3,
"type": "boolean"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 296
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 0,
"G": 0,
"U": 0,
"X": 1,
"aconj": 1,
"adisj": 0,
"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": "EX(((1 <= p107) AND (1 <= p116) AND (1 <= p130) AND (1 <= p152)))",
"processed_size": 65,
"rewrites": 34
},
"net":
{
"conflict_clusters": 101,
"singleton_clusters": 0
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "CTL model checker",
"value": true
},
"task":
{
"compoundnumber": 4,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 323
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 1,
"aconj": 2,
"adisj": 1,
"aneg": 0,
"comp": 12,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 12,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 11,
"visible_transitions": 0
},
"processed": "AX((EF(((1 <= p103) AND (1 <= p117) AND (1 <= p125) AND (1 <= p149))) OR ((1 <= p105) AND (1 <= p116) AND (1 <= p128) AND (1 <= p150) AND ((p105 <= 0) OR (p112 <= 0) OR (p132 <= 0) OR (p146 <= 0)))))",
"processed_size": 202,
"rewrites": 35
},
"net":
{
"conflict_clusters": 101,
"singleton_clusters": 0
},
"result":
{
"edges": 2532923,
"markings": 478491,
"produced_by": "CTL model checker",
"value": false
},
"task":
{
"compoundnumber": 5,
"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": false
},
"task":
{
"compoundnumber": 4,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 322
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 4,
"E": 0,
"F": 1,
"G": 0,
"U": 1,
"X": 2,
"aconj": 2,
"adisj": 1,
"aneg": 0,
"comp": 12,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 12,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 11,
"visible_transitions": 0
},
"processed": "(AF(AX(((p108 <= 0) OR (p111 <= 0) OR (p136 <= 0) OR (p148 <= 0)))) AND A(AX(((1 <= p101) AND (1 <= p110) AND (1 <= p130) AND (1 <= p140))) U ((1 <= p106) AND (1 <= p111) AND (1 <= p134) AND (1 <= p146))))",
"processed_size": 208,
"rewrites": 37
},
"net":
{
"conflict_clusters": 101,
"singleton_clusters": 0
},
"result":
{
"edges": 4778841,
"markings": 2791955,
"produced_by": "CTL model checker",
"value": true
},
"task":
{
"compoundnumber": 5,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 352
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 2,
"F": 0,
"G": 1,
"U": 0,
"X": 1,
"aconj": 2,
"adisj": 1,
"aneg": 0,
"comp": 16,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 16,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 15,
"visible_transitions": 0
},
"processed": "EG(EX((((1 <= p103) AND (1 <= p110) AND (1 <= p132) AND (1 <= p142) AND (1 <= p108) AND (1 <= p116) AND (1 <= p131) AND (1 <= p153)) OR ((1 <= p103) AND (1 <= p117) AND (1 <= p125) AND (1 <= p149) AND (1 <= p101) AND (1 <= p114) AND (1 <= p126) AND (1 <= p144)))))",
"processed_size": 265,
"rewrites": 35
},
"net":
{
"conflict_clusters": 101,
"singleton_clusters": 0
},
"result":
{
"edges": 1191767,
"markings": 866116,
"produced_by": "CTL model checker",
"value": false
},
"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": 391
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 3,
"F": 1,
"G": 1,
"U": 0,
"X": 1,
"aconj": 1,
"adisj": 0,
"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": "EX(EG(EF(((1 <= p109) AND (1 <= p112) AND (1 <= p136) AND (1 <= p150)))))",
"processed_size": 73,
"rewrites": 36
},
"net":
{
"conflict_clusters": 101,
"singleton_clusters": 0
},
"result":
{
"edges": 49368376,
"markings": 7535368,
"produced_by": "CTL model checker",
"value": false
},
"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": 429
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 1,
"aconj": 2,
"adisj": 1,
"aneg": 0,
"comp": 12,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 12,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 12,
"visible_transitions": 0
},
"processed": "AX(EF(((p102 <= 0) OR (p114 <= 0) OR (p127 <= 0) OR (p145 <= 0) OR ((1 <= p104) AND (1 <= p110) AND (1 <= p133) AND (1 <= p143)) OR ((1 <= p103) AND (1 <= p116) AND (1 <= p126) AND (1 <= p148)))))",
"processed_size": 201,
"rewrites": 35
},
"net":
{
"conflict_clusters": 101,
"singleton_clusters": 0
},
"result":
{
"edges": 120,
"markings": 121,
"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": 490
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 1,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "AX(EF(((1 <= p107) AND (1 <= p111) AND (1 <= p135) AND (1 <= p147))))",
"processed_size": 69,
"rewrites": 35
},
"net":
{
"conflict_clusters": 101,
"singleton_clusters": 0
},
"result":
{
"edges": 2532923,
"markings": 478491,
"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": 572
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "E (G (((1 <= p103) AND (1 <= p118) AND (1 <= p124) AND (1 <= p150))))",
"processed_size": 69,
"rewrites": 34
},
"result":
{
"edges": 2547773,
"markings": 481316,
"produced_by": "state space / EG",
"value": false
},
"task":
{
"compoundnumber": 10,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 30
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 4,
"problems": 4
},
"type": "possible_preservation",
"workflow": "stateequation"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 685
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 2,
"adisj": 1,
"aneg": 1,
"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": "(((p102 <= 0) OR (p111 <= 0) OR (p130 <= 0) OR (p142 <= 0)) AND ((p103 <= 0) OR (p110 <= 0) OR (p132 <= 0) OR (p142 <= 0)))",
"processed_size": 129,
"rewrites": 37
},
"result":
{
"edges": 46115895,
"markings": 7535359,
"produced_by": "parallel",
"value": false
},
"task":
{
"compoundnumber": 11,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "tscc preserving/always up"
}
},
"stateequation":
{
"literals": 32,
"problems": 16
},
"store":
{
"type": "dfs/tscc"
},
"type": "possible_invariance",
"workflow": "stateequation"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 838
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 2,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 1,
"aneg": 2,
"comp": 8,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 8,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 8,
"visible_transitions": 0
},
"processed": "EG((EF(((p102 <= 0) OR (p118 <= 0) OR (p123 <= 0) OR (p149 <= 0))) OR ((1 <= p108) AND (1 <= p114) AND (1 <= p133) AND (1 <= p151))))",
"processed_size": 136,
"rewrites": 35
},
"net":
{
"conflict_clusters": 101,
"singleton_clusters": 0
},
"result":
{
"edges": 17,
"markings": 8,
"produced_by": "CTL model checker",
"value": true
},
"task":
{
"compoundnumber": 12,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1117
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 1,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 2,
"adisj": 1,
"aneg": 2,
"comp": 16,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 16,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 15,
"visible_transitions": 0
},
"processed": "AG((EF(((p102 <= 0) OR (p115 <= 0) OR (p126 <= 0) OR (p146 <= 0))) OR ((1 <= p101) AND (1 <= p110) AND (1 <= p130) AND (1 <= p140) AND ((p100 <= 0) OR (p112 <= 0) OR (p127 <= 0) OR (p141 <= 0) OR (p102 <= 0) OR (p113 <= 0) OR (p128 <= 0) OR (p144 <= 0)))))",
"processed_size": 266,
"rewrites": 35
},
"net":
{
"conflict_clusters": 101,
"singleton_clusters": 0
},
"result":
{
"edges": 54206492,
"markings": 7535369,
"produced_by": "CTL model checker",
"value": true
},
"task":
{
"compoundnumber": 13,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1632
},
"formula":
{
"count":
{
"A": 2,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 7,
"adisj": 3,
"aneg": 0,
"comp": 31,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 31,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 24,
"visible_transitions": 0
},
"processed": "AF((AG(((1 <= p103) AND (1 <= p116) AND (1 <= p126) AND (1 <= p148))) AND (((1 <= p104) AND (1 <= p116) AND (1 <= p127) AND (1 <= p149) AND (1 <= p100) AND (1 <= p115) AND (1 <= p124) AND (1 <= p144) AND (1 <= p109) AND (1 <= p133) AND (1 <= p153)) OR ((((1 <= p103) AND (1 <= p111) AND (1 <= p131) AND (1 <= p143)) OR ((1 <= p105) AND (1 <= p110) AND (1 <= p134) AND (1 <= p144))) AND (((1 <= p101) AND (1 <= p112) AND (1 <= p128) AND (1 <= p142)) OR ((1 <= p105) AND (1 <= p110) AND (1 <= p134) AND (1 <= p144)))))))",
"processed_size": 521,
"rewrites": 35
},
"net":
{
"conflict_clusters": 101,
"singleton_clusters": 0
},
"result":
{
"edges": 16,
"markings": 8,
"produced_by": "CTL model checker",
"value": false
},
"task":
{
"compoundnumber": 14,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3265
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 2,
"adisj": 3,
"aneg": 0,
"comp": 17,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 17,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 17,
"visible_transitions": 0
},
"processed": "((1 <= p100) AND (1 <= p115) AND (1 <= p124) AND (1 <= p144) AND ((p104 <= 0) OR (p119 <= 0) OR (p152 <= 0) OR ((1 <= p101) AND (1 <= p125) AND (1 <= p145) AND ((p103 <= 0) OR (p117 <= 0) OR (p149 <= 0)) AND ((p106 <= 0) OR (p113 <= 0) OR (p132 <= 0) OR (p148 <= 0)))))",
"processed_size": 277,
"rewrites": 33
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 15,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": null
},
"task":
{
"compoundnumber": 15,
"type": "boolean"
}
},

{
"child":
[

{
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 2,
"adisj": 3,
"aneg": 0,
"comp": 17,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 17,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 17,
"visible_transitions": 0
},
"processed": "((1 <= p100) AND (1 <= p115) AND (1 <= p124) AND (1 <= p144) AND ((p104 <= 0) OR (p119 <= 0) OR (p152 <= 0) OR ((1 <= p101) AND (1 <= p125) AND (1 <= p145) AND ((p103 <= 0) OR (p117 <= 0) OR (p149 <= 0)) AND ((p106 <= 0) OR (p113 <= 0) OR (p132 <= 0) OR (p148 <= 0)))))",
"processed_size": 277,
"rewrites": 33
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 16,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 1,
"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": "((p109 <= 0) OR (p111 <= 0) OR (p137 <= 0) OR (p149 <= 0))",
"processed_size": 61,
"rewrites": 37
},
"result":
{
"edges": 9,
"markings": 10,
"produced_by": "state space /EFEG",
"value": false
},
"task":
{
"compoundnumber": 17,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 0
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 4,
"problems": 4
},
"type": "eventual_occurrence_from_all_states",
"workflow": "stateequation"
}
}
],
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 16,
"type": "boolean"
}
}
],
"exit":
{
"error": null,
"memory": 60408,
"runtime": 305.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "CTLFireability.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "A(F((A(G(**)) AND **))) : E(F(A(X(A(G(**)))))) : (A(G(A(F(**)))) OR **) : (A(X((A(F(**)) OR **))) AND (A(G(**)) OR (E(F(**)) OR (** OR (** OR **))))) : E(G((E(F(*)) OR *))) : E(G(**)) : E((** U (E(X(**)) AND (** AND **)))) : (E(G(*)) AND E(X(A(F(**))))) : A(G((E(F(*)) OR *))) : (A(X((E(F(**)) OR **))) AND E(X(**))) : (A(F(A(X(**)))) AND A((A(X(**)) U **))) : E(F(A(G(**)))) : E(G(E(X(**)))) : E(X(E(G(E(F(**)))))) : A(X(E(F(**)))) : A(X(E(F(**))))"
},
"net":
{
"arcs": 500,
"conflict_clusters": 101,
"places": 158,
"places_significant": 100,
"singleton_clusters": 0,
"transitions": 100
},
"result":
{
"preliminary_value": "no yes no no yes no yes no yes no yes no no no yes no ",
"value": "no yes no no yes no yes no yes no yes no no no yes no "
},
"task":
{
"type": "compound"
}
}
lola: LoLA will run for 3570 seconds at most (--timelimit)
lola: NET
lola: input: PNML file (--pnml)
lola: reading net from model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file model.pnml
lola: 258/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 158
lola: finding significant places
lola: 158 places, 100 transitions, 100 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: A (F ((A (G (((1 <= p103) AND (1 <= p116) AND (1 <= p126) AND (1 <= p148)))) AND (((1 <= p104) AND (1 <= p116) AND (1 <= p127) AND (1 <= p149) AND (1 <= p100) AND (1 <= p115) AND (1 <= p124) AND (1 <= p144) AND (1 <= p109) AND (1 <= p133) AND (1 <= p153)) OR ((((1 <= p103) AND (1 <= p111) AND (1 <= p131) AND (1 <= p143)) OR ((1 <= p105) AND (1 <= p110) AND (1 <= p134) AND (1 <= p144))) AND (((1 <= p101) AND (1 <= p112) AND (1 <= p128) AND (1 <= p142)) OR ((1 <= p105) AND (1 <= p110) AND (1 <= p134) AND (1 <= p144)))))))) : E (F (A (G (A (X (((1 <= p100) AND (1 <= p111) AND (1 <= p128) AND (1 <= p140)))))))) : (A (G (A (F (((1 <= p109) AND (1 <= p111) AND (1 <= p137) AND (1 <= p149)))))) OR ((1 <= p100) AND (1 <= p115) AND (1 <= p124) AND (1 <= p144) AND ((p104 <= 0) OR (p119 <= 0) OR (p152 <= 0) OR ((1 <= p101) AND (1 <= p125) AND (1 <= p145) AND ((p103 <= 0) OR (p117 <= 0) OR (p149 <= 0)) AND ((p106 <= 0) OR (p113 <= 0) OR (p132 <= 0) OR (p148 <= 0)))))) : (A (X ((A (F (((1 <= p107) AND (1 <= p118) AND (1 <= p128) AND (1 <= p154)))) OR ((1 <= p106) AND (1 <= p119) AND (1 <= p126) AND (1 <= p154))))) AND ((((A (G (((p109 <= 0) OR (p113 <= 0) OR (p135 <= 0) OR (p151 <= 0)))) OR E (F (((1 <= p104) AND (1 <= p115) AND (1 <= p128) AND (1 <= p148))))) OR ((1 <= p105) AND (1 <= p111) AND (1 <= p133) AND (1 <= p145))) OR ((1 <= p106) AND (1 <= p119) AND (1 <= p126) AND (1 <= p154) AND (1 <= p100) AND (1 <= p114) AND (1 <= p125) AND (1 <= p143))) OR ((1 <= p101) AND (1 <= p112) AND (1 <= p128) AND (1 <= p142) AND (1 <= p100) AND (1 <= p111) AND (1 <= p140)))) : NOT(A (F ((A (G (((1 <= p102) AND (1 <= p118) AND (1 <= p123) AND (1 <= p149)))) AND ((p108 <= 0) OR (p114 <= 0) OR (p133 <= 0) OR (p151 <= 0)))))) : E (G (((1 <= p103) AND (1 <= p118) AND (1 <= p124) AND (1 <= p150)))) : E ((((1 <= p108) AND (1 <= p116) AND (1 <= p131) AND (1 <= p153) AND (((1 <= p107) AND (1 <= p110) AND (1 <= p136) AND (1 <= p146) AND (1 <= p103) AND (1 <= p114) AND (1 <= p128)) OR ((1 <= p110) AND (1 <= p137) AND (1 <= p147) AND (1 <= p105) AND (1 <= p128) AND (1 <= p150)))) U ((E (X (((1 <= p100) AND (1 <= p113) AND (1 <= p126) AND (1 <= p142)))) AND ((p100 <= 0) OR (p115 <= 0) OR (p124 <= 0) OR (p144 <= 0))) AND ((p102 <= 0) OR (p116 <= 0) OR (p125 <= 0) OR (p147 <= 0))))) : (NOT(A (F ((((p101 <= 0) OR (p115 <= 0) OR (p125 <= 0) OR (p145 <= 0)) AND ((p106 <= 0) OR (p112 <= 0) OR (p133 <= 0) OR (p147 <= 0)))))) AND E (X (A (F (((p104 <= 0) OR (p117 <= 0) OR (p126 <= 0) OR (p150 <= 0))))))) : NOT(E (F ((A (G (((1 <= p102) AND (1 <= p115) AND (1 <= p126) AND (1 <= p146)))) AND ((p101 <= 0) OR (p110 <= 0) OR (p130 <= 0) OR (p140 <= 0) OR ((1 <= p100) AND (1 <= p112) AND (1 <= p127) AND (1 <= p141) AND (1 <= p102) AND (1 <= p113) AND (1 <= p128) AND (1 <= p144))))))) : (A (X ((E (F (((1 <= p103) AND (1 <= p117) AND (1 <= p125) AND (1 <= p149)))) OR ((1 <= p105) AND (1 <= p116) AND (1 <= p128) AND (1 <= p150) AND ((p105 <= 0) OR (p112 <= 0) OR (p132 <= 0) OR (p146 <= 0)))))) AND E (X (((1 <= p107) AND (1 <= p116) AND (1 <= p130) AND (1 <= p152))))) : (A (F (A (X (((p108 <= 0) OR (p111 <= 0) OR (p136 <= 0) OR (p148 <= 0)))))) AND A ((A (X (((1 <= p101) AND (1 <= p110) AND (1 <= p130) AND (1 <= p140)))) U ((1 <= p106) AND (1 <= p111) AND (1 <= p134) AND (1 <= p146))))) : E (F (A (G ((((1 <= p102) AND (1 <= p111) AND (1 <= p130) AND (1 <= p142)) OR ((1 <= p103) AND (1 <= p110) AND (1 <= p132) AND (1 <= p142))))))) : E (G (E (X ((((1 <= p103) AND (1 <= p110) AND (1 <= p132) AND (1 <= p142) AND (1 <= p108) AND (1 <= p116) AND (1 <= p131) AND (1 <= p153)) OR ((1 <= p103) AND (1 <= p117) AND (1 <= p125) AND (1 <= p149) AND (1 <= p101) AND (1 <= p114) AND (1 <= p126) AND (1 <= p144))))))) : E (X (E (G (E (F (((1 <= p109) AND (1 <= p112) AND (1 <= p136) AND (1 <= p150)))))))) : A (X (E (F (((p102 <= 0) OR (p114 <= 0) OR (p127 <= 0) OR (p145 <= 0) OR ((1 <= p104) AND (1 <= p110) AND (1 <= p133) AND (1 <= p143)) OR ((1 <= p103) AND (1 <= p116) AND (1 <= p126) AND (1 <= p148))))))) : NOT(E (X (NOT(E (F (((1 <= p107) AND (1 <= p111) AND (1 <= p135) AND (1 <= p147))))))))
lola: rewrite Frontend/Parser/formula_rewrite.k:398
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k: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:326
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 222 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (A (X (A (G (((1 <= p100) AND (1 <= p111) AND (1 <= p128) AND (1 <= p140))))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:813
lola: rewrite Frontend/Parser/formula_rewrite.k:812
lola: rewrite Frontend/Parser/formula_rewrite.k:806
lola: processed formula: EF(AX(AG(((1 <= p100) AND (1 <= p111) AND (1 <= p128) AND (1 <= p140)))))
lola: processed formula length: 73
lola: 36 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: 8 markings, 16 edges
lola: ========================================
lola: subprocess 1 will run for 237 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (X ((A (F (((1 <= p107) AND (1 <= p118) AND (1 <= p128) AND (1 <= p154)))) OR ((1 <= p106) AND (1 <= p119) AND (1 <= p126) AND (1 <= p154))))) AND (A (G (((p109 <= 0) OR (p113 <= 0) OR (p135 <= 0) OR (p151 <= 0)))) OR (E (F (((1 <= p104) AND (1 <= p115) AND (1 <= p128) AND (1 <= p148)))) OR (((1 <= p105) AND (1 <= p111) AND (1 <= p133) AND (1 <= p145)) OR (((1 <= p106) AND (1 <= p119) AND (1... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 1 will run for 237 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (((1 <= p105) AND (1 <= p111) AND (1 <= p133) AND (1 <= p145)) OR (((1 <= p106) AND (1 <= p119) AND (1 <= p126) AND (1 <= p154) AND (1 <= p100) AND (1 <= p114) AND (1 <= p125) AND (1 <= p143)) OR ((1 <= p101) AND (1 <= p112) AND (1 <= p128) AND (1 <= p142) AND (1 <= p100) AND (1 <= p111) AND (1 <= p140))))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: rewrite Frontend/Parser/formula_rewrite.k:797
lola: rewrite Frontend/Parser/formula_rewrite.k:797
lola: rewrite Frontend/Parser/formula_rewrite.k:798
lola: processed formula: (((1 <= p105) AND (1 <= p111) AND (1 <= p133) AND (1 <= p145)) OR ((1 <= p106) AND (1 <= p119) AND (1 <= p126) AND (1 <= p154) AND (1 <= p100) AND (1 <= p114) AND (1 <= p125) AND (1 <= p143)) OR ((1 <= p101) AND (1 <= p112) AND (1 <= p128) AND (1 <= p142) AND (1 <= p100) AND (1 <= p111) AND (1 <= p140)))
lola: processed formula length: 305
lola: 36 rewrites
lola: closed formula file CTLFireability.xml
lola: processed formula with 19 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 2 will run for 254 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X ((A (F (((1 <= p107) AND (1 <= p118) AND (1 <= p128) AND (1 <= p154)))) OR ((1 <= p106) AND (1 <= p119) AND (1 <= p126) AND (1 <= p154)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:811
lola: rewrite Frontend/Parser/formula_rewrite.k:812
lola: processed formula: AX((AF(((1 <= p107) AND (1 <= p118) AND (1 <= p128) AND (1 <= p154))) OR ((1 <= p106) AND (1 <= p119) AND (1 <= p126) AND (1 <= p154))))
lola: processed formula length: 136
lola: 35 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: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 54 markings, 53 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 2 will run for 254 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E ((((1 <= p108) AND (1 <= p116) AND (1 <= p131) AND (1 <= p153) AND (((1 <= p107) AND (1 <= p110) AND (1 <= p136) AND (1 <= p146) AND (1 <= p103) AND (1 <= p114) AND (1 <= p128)) OR ((1 <= p110) AND (1 <= p137) AND (1 <= p147) AND (1 <= p105) AND (1 <= p128) AND (1 <= p150)))) U (E (X (((1 <= p100) AND (1 <= p113) AND (1 <= p126) AND (1 <= p142)))) AND (((p100 <= 0) OR (p115 <= 0) OR (p124 <= ... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:807
lola: rewrite Frontend/Parser/formula_rewrite.k:809
lola: processed formula: E(((1 <= p108) AND (1 <= p116) AND (1 <= p131) AND (1 <= p153) AND (((1 <= p107) AND (1 <= p110) AND (1 <= p136) AND (1 <= p146) AND (1 <= p103) AND (1 <= p114) AND (1 <= p128)) OR ((1 <= p110) AND (1 <= p137) AND (1 <= p147) AND (1 <= p105) AND (1 <= p128) AND (1 <= p150)))) U (EX(((1 <= p100) AND (1 <= p113) AND (1 <= p126) AND (1 <= p142))) AND (((p100 <= 0) OR (p115 <= 0) OR (p124 <= 0) OR ... (shortened)
lola: processed formula length: 482
lola: 35 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: 13 markings, 12 edges
lola: ========================================
lola: subprocess 3 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E (G ((((1 <= p101) AND (1 <= p115) AND (1 <= p125) AND (1 <= p145)) OR ((1 <= p106) AND (1 <= p112) AND (1 <= p133) AND (1 <= p147))))) AND E (X (A (F (((p104 <= 0) OR (p117 <= 0) OR (p126 <= 0) OR (p150 <= 0)))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 3 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G ((((1 <= p101) AND (1 <= p115) AND (1 <= p125) AND (1 <= p145)) OR ((1 <= p106) AND (1 <= p112) AND (1 <= p133) AND (1 <= p147)))))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation
lola: rewrite Frontend/Parser/formula_rewrite.k:583
lola: processed formula: E (G ((((1 <= p101) AND (1 <= p115) AND (1 <= p125) AND (1 <= p145)) OR ((1 <= p106) AND (1 <= p112) AND (1 <= p133) AND (1 <= p147)))))
lola: processed formula length: 137
lola: 34 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 / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:788
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (((p101 <= 0) OR (p115 <= 0) OR (p125 <= 0) OR (p145 <= 0)) AND ((p106 <= 0) OR (p112 <= 0) OR (p133 <= 0) OR (p147 <= 0)))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 32 literals and 16 conjunctive subformulas
lola: state equation: write sara problem file to CTLFireability-3-0.sara
lola: state equation: calling and running sara
sara: try reading problem file CTLFireability-3-0.sara.
sara: place or transition ordering is non-deterministic

lola: state equation 0: solution produced
lola: 385275 markings, 1736810 edges, 77055 markings/sec, 0 secs || sara is running 0 secs
lola: 724081 markings, 3515065 edges, 67761 markings/sec, 5 secs || sara is running 5 secs
lola: SUBRESULT
lola: result: no
lola: produced by: state space / EG
lola: The predicate is not possibly preserved.
lola: 878346 markings, 4686337 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 4 will run for 296 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (X ((E (F (((1 <= p103) AND (1 <= p117) AND (1 <= p125) AND (1 <= p149)))) OR ((1 <= p105) AND (1 <= p116) AND (1 <= p128) AND (1 <= p150) AND ((p105 <= 0) OR (p112 <= 0) OR (p132 <= 0) OR (p146 <= 0)))))) AND E (X (((1 <= p107) AND (1 <= p116) AND (1 <= p130) AND (1 <= p152)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 4 will run for 296 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (X (((1 <= p107) AND (1 <= p116) AND (1 <= p130) AND (1 <= p152))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:807
lola: processed formula: EX(((1 <= p107) AND (1 <= p116) AND (1 <= p130) AND (1 <= p152)))
lola: processed formula length: 65
lola: 34 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 0 significant temporal operators and needs 0 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 5 will run for 323 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X ((E (F (((1 <= p103) AND (1 <= p117) AND (1 <= p125) AND (1 <= p149)))) OR ((1 <= p105) AND (1 <= p116) AND (1 <= p128) AND (1 <= p150) AND ((p105 <= 0) OR (p112 <= 0) OR (p132 <= 0) OR (p146 <= 0))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:806
lola: rewrite Frontend/Parser/formula_rewrite.k:812
lola: processed formula: AX((EF(((1 <= p103) AND (1 <= p117) AND (1 <= p125) AND (1 <= p149))) OR ((1 <= p105) AND (1 <= p116) AND (1 <= p128) AND (1 <= p150) AND ((p105 <= 0) OR (p112 <= 0) OR (p132 <= 0) OR (p146 <= 0)))))
lola: processed formula length: 202
lola: 35 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: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 478491 markings, 2532923 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 5 will run for 322 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (F (A (X (((p108 <= 0) OR (p111 <= 0) OR (p136 <= 0) OR (p148 <= 0)))))) AND A ((A (X (((1 <= p101) AND (1 <= p110) AND (1 <= p130) AND (1 <= p140)))) U ((1 <= p106) AND (1 <= p111) AND (1 <= p134) AND (1 <= p146)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:812
lola: rewrite Frontend/Parser/formula_rewrite.k:811
lola: rewrite Frontend/Parser/formula_rewrite.k:812
lola: rewrite Frontend/Parser/formula_rewrite.k:814
lola: processed formula: (AF(AX(((p108 <= 0) OR (p111 <= 0) OR (p136 <= 0) OR (p148 <= 0)))) AND A(AX(((1 <= p101) AND (1 <= p110) AND (1 <= p130) AND (1 <= p140))) U ((1 <= p106) AND (1 <= p111) AND (1 <= p134) AND (1 <= p146))))
lola: processed formula length: 208
lola: 37 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: 764228 markings, 1270255 edges, 152846 markings/sec, 0 secs
lola: 1475984 markings, 2481511 edges, 142351 markings/sec, 5 secs
lola: 2113653 markings, 3577437 edges, 127534 markings/sec, 10 secs
lola: 2678708 markings, 4560554 edges, 113011 markings/sec, 15 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 2791955 markings, 4778841 edges
lola: ========================================
lola: subprocess 6 will run for 352 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G (E (X ((((1 <= p103) AND (1 <= p110) AND (1 <= p132) AND (1 <= p142) AND (1 <= p108) AND (1 <= p116) AND (1 <= p131) AND (1 <= p153)) OR ((1 <= p103) AND (1 <= p117) AND (1 <= p125) AND (1 <= p149) AND (1 <= p101) AND (1 <= p114) AND (1 <= p126) AND (1 <= p144)))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:807
lola: rewrite Frontend/Parser/formula_rewrite.k:808
lola: processed formula: EG(EX((((1 <= p103) AND (1 <= p110) AND (1 <= p132) AND (1 <= p142) AND (1 <= p108) AND (1 <= p116) AND (1 <= p131) AND (1 <= p153)) OR ((1 <= p103) AND (1 <= p117) AND (1 <= p125) AND (1 <= p149) AND (1 <= p101) AND (1 <= p114) AND (1 <= p126) AND (1 <= p144)))))
lola: processed formula length: 265
lola: 35 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: 558893 markings, 736050 edges, 111779 markings/sec, 0 secs
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 866116 markings, 1191767 edges
lola: ========================================
lola: subprocess 7 will run for 391 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (X (E (G (E (F (((1 <= p109) AND (1 <= p112) AND (1 <= p136) AND (1 <= p150))))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:806
lola: rewrite Frontend/Parser/formula_rewrite.k:808
lola: rewrite Frontend/Parser/formula_rewrite.k:807
lola: processed formula: EX(EG(EF(((1 <= p109) AND (1 <= p112) AND (1 <= p136) AND (1 <= p150)))))
lola: processed formula length: 73
lola: 36 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: 697840 markings, 3481539 edges, 139568 markings/sec, 0 secs
lola: 1293692 markings, 6718830 edges, 119170 markings/sec, 5 secs
lola: 1839833 markings, 9869368 edges, 109228 markings/sec, 10 secs
lola: 2423174 markings, 13022724 edges, 116668 markings/sec, 15 secs
lola: 3004708 markings, 16117991 edges, 116307 markings/sec, 20 secs
lola: 3544349 markings, 19127068 edges, 107928 markings/sec, 25 secs
lola: 4011281 markings, 22088575 edges, 93386 markings/sec, 30 secs
lola: 4494429 markings, 24996550 edges, 96630 markings/sec, 35 secs
lola: 4979840 markings, 27966952 edges, 97082 markings/sec, 40 secs
lola: 5470010 markings, 30859206 edges, 98034 markings/sec, 45 secs
lola: 5870118 markings, 33705358 edges, 80022 markings/sec, 50 secs
lola: 6247053 markings, 36560387 edges, 75387 markings/sec, 55 secs
lola: 6644419 markings, 39399593 edges, 79473 markings/sec, 60 secs
lola: 6954998 markings, 42208487 edges, 62116 markings/sec, 65 secs
lola: 7243763 markings, 45026283 edges, 57753 markings/sec, 70 secs
lola: 7460647 markings, 47850008 edges, 43377 markings/sec, 75 secs
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 7535368 markings, 49368376 edges
lola: subprocess 8 will run for 429 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ========================================
lola: ...considering subproblem: A (X (E (F (((p102 <= 0) OR (p114 <= 0) OR (p127 <= 0) OR (p145 <= 0) OR ((1 <= p104) AND (1 <= p110) AND (1 <= p133) AND (1 <= p143)) OR ((1 <= p103) AND (1 <= p116) AND (1 <= p126) AND (1 <= p148)))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:806
lola: rewrite Frontend/Parser/formula_rewrite.k:812
lola: processed formula: AX(EF(((p102 <= 0) OR (p114 <= 0) OR (p127 <= 0) OR (p145 <= 0) OR ((1 <= p104) AND (1 <= p110) AND (1 <= p133) AND (1 <= p143)) OR ((1 <= p103) AND (1 <= p116) AND (1 <= p126) AND (1 <= p148)))))
lola: processed formula length: 201
lola: 35 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: 121 markings, 120 edges
lola: ========================================
lola: subprocess 9 will run for 490 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (E (F (((1 <= p107) AND (1 <= p111) AND (1 <= p135) AND (1 <= p147))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:806
lola: rewrite Frontend/Parser/formula_rewrite.k:812
lola: processed formula: AX(EF(((1 <= p107) AND (1 <= p111) AND (1 <= p135) AND (1 <= p147))))
lola: processed formula length: 69
lola: 35 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: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 478491 markings, 2532923 edges
lola: ========================================
lola: subprocess 10 will run for 572 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G (((1 <= p103) AND (1 <= p118) AND (1 <= p124) AND (1 <= p150))))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation
lola: rewrite Frontend/Parser/formula_rewrite.k:583
lola: processed formula: E (G (((1 <= p103) AND (1 <= p118) AND (1 <= p124) AND (1 <= p150))))
lola: processed formula length: 69
lola: 34 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 / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((p103 <= 0) OR (p118 <= 0) OR (p124 <= 0) OR (p150 <= 0))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 4 literals and 4 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: place or transition ordering is non-deterministic

lola: state equation 0: solution produced
lola: 344179 markings, 1594676 edges, 68836 markings/sec, 0 secs || sara is running 0 secs
lola: SUBRESULT
lola: result: no
lola: produced by: state space / EG
lola: The predicate is not possibly preserved.
lola: 481316 markings, 2547773 edges
lola: ========================================
lola: subprocess 11 will run for 685 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (A (G ((((1 <= p102) AND (1 <= p111) AND (1 <= p130) AND (1 <= p142)) OR ((1 <= p103) AND (1 <= p110) AND (1 <= p132) AND (1 <= p142)))))))
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: (((p102 <= 0) OR (p111 <= 0) OR (p130 <= 0) OR (p142 <= 0)) AND ((p103 <= 0) OR (p110 <= 0) OR (p132 <= 0) OR (p142 <= 0)))
lola: processed formula length: 129
lola: 37 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 <= p102) AND (1 <= p111) AND (1 <= p130) AND (1 <= p142)) OR ((1 <= p103) AND (1 <= p110) AND (1 <= p132) AND (1 <= p142)))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 8 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: (((p102 <= 0) OR (p111 <= 0) OR (p130 <= 0) OR (p142 <= 0)) AND ((p103 <= 0) OR (p110 <= 0) OR (p132 <= 0) OR (p142 <= 0)))
lola: state equation task get result unparse finished id 1
lola: state equation: Generated DNF with 32 literals and 16 conjunctive subformulas
lola: state equation: write sara problem file to CTLFireability-11-0.sara
lola: state equation: calling and running sara
sara: try reading problem file CTLFireability-11-0.sara.
sara: place or transition ordering is non-deterministic

lola: state equation 0: solution produced
lola: state equation: write sara problem file to CTLFireability-11-1.sara
lola: state equation: calling and running sara
sara: try reading problem file CTLFireability-11-1.sara.
sara: place or transition ordering is non-deterministic

lola: state equation 1: solution produced
lola: sara is running 0 secs || sara is running 0 secs || 677991 markings, 3483512 edges, 135598 markings/sec, 0 secs
lola: sara is running 5 secs || sara is running 5 secs || 1336830 markings, 6929415 edges, 131768 markings/sec, 5 secs
lola: sara is running 10 secs || sara is running 10 secs || 1938929 markings, 10223057 edges, 120420 markings/sec, 10 secs
lola: sara is running 15 secs || sara is running 15 secs || 2566133 markings, 13465505 edges, 125441 markings/sec, 15 secs
lola: sara is running 20 secs || sara is running 20 secs || 3127329 markings, 16586921 edges, 112239 markings/sec, 20 secs
lola: sara is running 25 secs || sara is running 25 secs || 3727080 markings, 19663965 edges, 119950 markings/sec, 25 secs
lola: sara is running 30 secs || sara is running 30 secs || 4328347 markings, 22794976 edges, 120253 markings/sec, 30 secs
lola: sara is running 35 secs || sara is running 35 secs || 4861208 markings, 26101934 edges, 106572 markings/sec, 35 secs
lola: sara is running 40 secs || sara is running 40 secs || 5380252 markings, 29483648 edges, 103809 markings/sec, 40 secs
lola: sara is running 45 secs || sara is running 45 secs || 5867696 markings, 32575989 edges, 97489 markings/sec, 45 secs
lola: sara is running 50 secs || sara is running 50 secs || 6327691 markings, 35537154 edges, 91999 markings/sec, 50 secs
lola: sara is running 55 secs || sara is running 55 secs || 6755862 markings, 38777777 edges, 85634 markings/sec, 55 secs
lola: sara is running 60 secs || sara is running 60 secs || 7125861 markings, 41804306 edges, 74000 markings/sec, 60 secs
lola: sara is running 65 secs || sara is running 65 secs || 7389493 markings, 44345461 edges, 52726 markings/sec, 65 secs
lola: SUBRESULT
lola: result: no
lola: produced by: parallel
lola: The predicate is not possibly invariant.
lola: 7535359 markings, 46115895 edges
lola: ========================================
lola: subprocess 12 will run for 838 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G ((E (F (((p102 <= 0) OR (p118 <= 0) OR (p123 <= 0) OR (p149 <= 0)))) OR ((1 <= p108) AND (1 <= p114) AND (1 <= p133) AND (1 <= p151)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:806
lola: rewrite Frontend/Parser/formula_rewrite.k:808
lola: processed formula: EG((EF(((p102 <= 0) OR (p118 <= 0) OR (p123 <= 0) OR (p149 <= 0))) OR ((1 <= p108) AND (1 <= p114) AND (1 <= p133) AND (1 <= p151))))
lola: processed formula length: 136
lola: 35 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: 8 markings, 17 edges
lola: ========================================
lola: subprocess 13 will run for 1117 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((E (F (((p102 <= 0) OR (p115 <= 0) OR (p126 <= 0) OR (p146 <= 0)))) OR ((1 <= p101) AND (1 <= p110) AND (1 <= p130) AND (1 <= p140) AND ((p100 <= 0) OR (p112 <= 0) OR (p127 <= 0) OR (p141 <= 0) OR (p102 <= 0) OR (p113 <= 0) OR (p128 <= 0) OR (p144 <= 0))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:806
lola: rewrite Frontend/Parser/formula_rewrite.k:813
lola: processed formula: AG((EF(((p102 <= 0) OR (p115 <= 0) OR (p126 <= 0) OR (p146 <= 0))) OR ((1 <= p101) AND (1 <= p110) AND (1 <= p130) AND (1 <= p140) AND ((p100 <= 0) OR (p112 <= 0) OR (p127 <= 0) OR (p141 <= 0) OR (p102 <= 0) OR (p113 <= 0) OR (p128 <= 0) OR (p144 <= 0)))))
lola: processed formula length: 266
lola: 35 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: 602082 markings, 3662178 edges, 120416 markings/sec, 0 secs
lola: 1148884 markings, 7097517 edges, 109360 markings/sec, 5 secs
lola: 1666102 markings, 10399330 edges, 103444 markings/sec, 10 secs
lola: 2173067 markings, 13670787 edges, 101393 markings/sec, 15 secs
lola: 2687293 markings, 16924372 edges, 102845 markings/sec, 20 secs
lola: 3166314 markings, 20151915 edges, 95804 markings/sec, 25 secs
lola: 3611916 markings, 23233015 edges, 89120 markings/sec, 30 secs
lola: 4103923 markings, 26380372 edges, 98401 markings/sec, 35 secs
lola: 4568239 markings, 29502302 edges, 92863 markings/sec, 40 secs
lola: 5000221 markings, 32639161 edges, 86396 markings/sec, 45 secs
lola: 5462213 markings, 35701289 edges, 92398 markings/sec, 50 secs
lola: 5873065 markings, 38726398 edges, 82170 markings/sec, 55 secs
lola: 6243292 markings, 41649167 edges, 74045 markings/sec, 60 secs
lola: 6648351 markings, 44722252 edges, 81012 markings/sec, 65 secs
lola: 6960674 markings, 47597336 edges, 62465 markings/sec, 70 secs
lola: 7264407 markings, 50542223 edges, 60747 markings/sec, 75 secs
lola: 7503733 markings, 53540981 edges, 47865 markings/sec, 80 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 7535369 markings, 54206492 edges
lola: ========================================
lola: subprocess 14 will run for 1632 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F ((A (G (((1 <= p103) AND (1 <= p116) AND (1 <= p126) AND (1 <= p148)))) AND (((1 <= p104) AND (1 <= p116) AND (1 <= p127) AND (1 <= p149) AND (1 <= p100) AND (1 <= p115) AND (1 <= p124) AND (1 <= p144) AND (1 <= p109) AND (1 <= p133) AND (1 <= p153)) OR ((((1 <= p103) AND (1 <= p111) AND (1 <= p131) AND (1 <= p143)) OR ((1 <= p105) AND (1 <= p110) AND (1 <= p134) AND (1 <= p144))) AND (((1 ... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:813
lola: rewrite Frontend/Parser/formula_rewrite.k:811
lola: processed formula: AF((AG(((1 <= p103) AND (1 <= p116) AND (1 <= p126) AND (1 <= p148))) AND (((1 <= p104) AND (1 <= p116) AND (1 <= p127) AND (1 <= p149) AND (1 <= p100) AND (1 <= p115) AND (1 <= p124) AND (1 <= p144) AND (1 <= p109) AND (1 <= p133) AND (1 <= p153)) OR ((((1 <= p103) AND (1 <= p111) AND (1 <= p131) AND (1 <= p143)) OR ((1 <= p105) AND (1 <= p110) AND (1 <= p134) AND (1 <= p144))) AND (((1 <= p101... (shortened)
lola: processed formula length: 521
lola: 35 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: 8 markings, 16 edges
lola: ========================================
lola: subprocess 15 will run for 3265 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (G (A (F (((1 <= p109) AND (1 <= p111) AND (1 <= p137) AND (1 <= p149)))))) OR ((1 <= p100) AND (1 <= p115) AND (1 <= p124) AND (1 <= p144) AND ((p104 <= 0) OR (p119 <= 0) OR (p152 <= 0) OR ((1 <= p101) AND (1 <= p125) AND (1 <= p145) AND ((p103 <= 0) OR (p117 <= 0) OR (p149 <= 0)) AND ((p106 <= 0) OR (p113 <= 0) OR (p132 <= 0) OR (p148 <= 0))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 15 will run for 3265 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((1 <= p100) AND (1 <= p115) AND (1 <= p124) AND (1 <= p144) AND ((p104 <= 0) OR (p119 <= 0) OR (p152 <= 0) OR ((1 <= p101) AND (1 <= p125) AND (1 <= p145) AND ((p103 <= 0) OR (p117 <= 0) OR (p149 <= 0)) AND ((p106 <= 0) OR (p113 <= 0) OR (p132 <= 0) OR (p148 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((1 <= p100) AND (1 <= p115) AND (1 <= p124) AND (1 <= p144) AND ((p104 <= 0) OR (p119 <= 0) OR (p152 <= 0) OR ((1 <= p101) AND (1 <= p125) AND (1 <= p145) AND ((p103 <= 0) OR (p117 <= 0) OR (p149 <= 0)) AND ((p106 <= 0) OR (p113 <= 0) OR (p132 <= 0) OR (p148 <= 0)))))
lola: processed formula length: 277
lola: 33 rewrites
lola: closed formula file CTLFireability.xml
lola: processed formula with 17 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: (A (G (A (F (((1 <= p109) AND (1 <= p111) AND (1 <= p137) AND (1 <= p149)))))) OR ((1 <= p100) AND (1 <= p115) AND (1 <= p124) AND (1 <= p144) AND ((p104 <= 0) OR (p119 <= 0) OR (p152 <= 0) OR ((1 <= p101) AND (1 <= p125) AND (1 <= p145) AND ((p103 <= 0) OR (p117 <= 0) OR (p149 <= 0)) AND ((p106 <= 0) OR (p113 <= 0) OR (p132 <= 0) OR (p148 <= 0))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: ...considering subproblem: ((1 <= p100) AND (1 <= p115) AND (1 <= p124) AND (1 <= p144) AND ((p104 <= 0) OR (p119 <= 0) OR (p152 <= 0) OR ((1 <= p101) AND (1 <= p125) AND (1 <= p145) AND ((p103 <= 0) OR (p117 <= 0) OR (p149 <= 0)) AND ((p106 <= 0) OR (p113 <= 0) OR (p132 <= 0) OR (p148 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((1 <= p100) AND (1 <= p115) AND (1 <= p124) AND (1 <= p144) AND ((p104 <= 0) OR (p119 <= 0) OR (p152 <= 0) OR ((1 <= p101) AND (1 <= p125) AND (1 <= p145) AND ((p103 <= 0) OR (p117 <= 0) OR (p149 <= 0)) AND ((p106 <= 0) OR (p113 <= 0) OR (p132 <= 0) OR (p148 <= 0)))))
lola: processed formula length: 277
lola: 33 rewrites
lola: closed formula file CTLFireability.xml
lola: processed formula with 17 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: ========================================
lola: ...considering subproblem: A (G (A (F (((1 <= p109) AND (1 <= p111) AND (1 <= p137) AND (1 <= p149))))))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence from all states
lola: rewrite Frontend/Parser/formula_rewrite.k:599
lola: rewrite Frontend/Parser/formula_rewrite.k:634
lola: rewrite Frontend/Parser/formula_rewrite.k:734
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: ((p109 <= 0) OR (p111 <= 0) OR (p137 <= 0) OR (p149 <= 0))
lola: processed formula length: 61
lola: 37 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 /EFEG)
lola: state space: using reachability graph (EFEG version) (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 1
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: state equation task get result rewrite finished id 1
lola: state equation task get result 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 <= p109) AND (1 <= p111) AND (1 <= p137) AND (1 <= p149))
lola: SUBRESULT
lola: state equation task get result unparse finished++ id 1
lola: formula 1: ((p109 <= 0) OR (p111 <= 0) OR (p137 <= 0) OR (p149 <= 0))
lola: state equation task get result unparse finished id 1
lola: result: no
lola: produced by: state space /EFEG
lola: The predicate does not eventually occur from all states.
lola: 10 markings, 9 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: RESULT
lola:
SUMMARY: no yes no no yes no yes no yes no yes no no no yes no
lola:
preliminary result: no yes no no yes no yes no yes no yes no no no yes no
lola: memory consumption: 60408 KB
lola: time consumption: 305 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="NQueens-PT-10"
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 NQueens-PT-10, 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 r174-csrt-158987852700132"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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