Execution Chart

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

Trace from the execution

Formatting '/local/x2003239/mcc2019-input.r082-csrt-155246550300949.qcow2', fmt=qcow2 size=4294967296 backing_file=/local/x2003239/mcc2019-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-3954
Executing tool lola
Input is JoinFreeModules-PT-0100, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r082-csrt-155246550300949
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 728K
-rw-r--r-- 1 mcc users 3.5K Feb 11 06:03 CTLCardinality.txt
-rw-r--r-- 1 mcc users 19K Feb 11 06:03 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Feb 7 05:21 CTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 7 05:21 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 10 17:31 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 5.7K Mar 10 17:31 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 110 Feb 24 15:05 GlobalProperties.txt
-rw-r--r-- 1 mcc users 348 Feb 24 15:05 GlobalProperties.xml
-rw-r--r-- 1 mcc users 2.6K Feb 5 00:06 LTLCardinality.txt
-rw-r--r-- 1 mcc users 12K Feb 5 00:06 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Feb 4 22:36 LTLFireability.txt
-rw-r--r-- 1 mcc users 9.8K Feb 4 22:36 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K Feb 3 11:55 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 18K Feb 3 11:55 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Jan 31 06:59 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 14K Jan 31 06:59 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 4 22:21 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 4 22:21 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jan 29 09:34 equiv_col
-rw-r--r-- 1 mcc users 5 Jan 29 09:34 instance
-rw-r--r-- 1 mcc users 6 Jan 29 09:34 iscolored
-rw-r--r-- 1 mcc users 566K Mar 10 17:31 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 JoinFreeModules-PT-0100-CTLCardinality-00
FORMULA_NAME JoinFreeModules-PT-0100-CTLCardinality-01
FORMULA_NAME JoinFreeModules-PT-0100-CTLCardinality-02
FORMULA_NAME JoinFreeModules-PT-0100-CTLCardinality-03
FORMULA_NAME JoinFreeModules-PT-0100-CTLCardinality-04
FORMULA_NAME JoinFreeModules-PT-0100-CTLCardinality-05
FORMULA_NAME JoinFreeModules-PT-0100-CTLCardinality-06
FORMULA_NAME JoinFreeModules-PT-0100-CTLCardinality-07
FORMULA_NAME JoinFreeModules-PT-0100-CTLCardinality-08
FORMULA_NAME JoinFreeModules-PT-0100-CTLCardinality-09
FORMULA_NAME JoinFreeModules-PT-0100-CTLCardinality-10
FORMULA_NAME JoinFreeModules-PT-0100-CTLCardinality-11
FORMULA_NAME JoinFreeModules-PT-0100-CTLCardinality-12
FORMULA_NAME JoinFreeModules-PT-0100-CTLCardinality-13
FORMULA_NAME JoinFreeModules-PT-0100-CTLCardinality-14
FORMULA_NAME JoinFreeModules-PT-0100-CTLCardinality-15

=== Now, execution of the tool begins

BK_START 1552685647390

info: Time: 3600 - MCC
vrfy: Checking CTLCardinality @ JoinFreeModules-PT-0100 @ 3570 seconds

FORMULA JoinFreeModules-PT-0100-CTLCardinality-04 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA JoinFreeModules-PT-0100-CTLCardinality-08 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA JoinFreeModules-PT-0100-CTLCardinality-00 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA JoinFreeModules-PT-0100-CTLCardinality-02 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA JoinFreeModules-PT-0100-CTLCardinality-01 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA JoinFreeModules-PT-0100-CTLCardinality-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA JoinFreeModules-PT-0100-CTLCardinality-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA JoinFreeModules-PT-0100-CTLCardinality-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA JoinFreeModules-PT-0100-CTLCardinality-05 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA JoinFreeModules-PT-0100-CTLCardinality-06 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA JoinFreeModules-PT-0100-CTLCardinality-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA JoinFreeModules-PT-0100-CTLCardinality-14 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA JoinFreeModules-PT-0100-CTLCardinality-12 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA JoinFreeModules-PT-0100-CTLCardinality-09 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA JoinFreeModules-PT-0100-CTLCardinality-07 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA JoinFreeModules-PT-0100-CTLCardinality-03 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 1460
rslt: Output for CTLCardinality @ JoinFreeModules-PT-0100

{
"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": "mcc2019",
"markinglimit": null,
"parameters":
[
"--pnmlnet",
"model.pnml",
"--xmlformula",
"--formula=CTLCardinality.xml",
"--mcc",
"--donotcomputecapacities",
"--encoder=simplecompressed",
"--check=modelchecking",
"--stubborn=tarjan",
"--stateequation=par",
"--quickchecks",
"--timelimit=3570",
"--localtimelimit=0",
"--preference=force_ctl",
"--json=CTLCardinality.json",
"--jsoninclude=formula,formulastat,net"
],
"starttime": "Fri Mar 15 21:34:07 2019
",
"timelimit": 3570
},
"child":
[

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 221
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 1,
"aneg": 1,
"comp": 2,
"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": "((p218 <= p479) AND (1 <= p242))",
"processed_size": 32,
"rewrites": 23
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 0,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 236
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 1,
"aneg": 0,
"comp": 3,
"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": "A (G (((3 <= p407) OR (p106 <= p146) OR (p317 <= p402))))",
"processed_size": 59,
"rewrites": 25
},
"result":
{
"edges": 3,
"markings": 4,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 1,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 3,
"problems": 3
},
"type": "invariance",
"workflow": "stateequation||search"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 0,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 236
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"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(AF((p353 + 1 <= p479)))",
"processed_size": 26,
"rewrites": 25
},
"net":
{
"conflict_clusters": 401,
"singleton_clusters": 0
},
"result":
{
"edges": 60594,
"markings": 60394,
"produced_by": "CTL model checker",
"value": false
},
"task":
{
"compoundnumber": 1,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
},

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

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 263
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"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 ((2 <= p45)))",
"processed_size": 18,
"rewrites": 24
},
"result":
{
"edges": 2,
"markings": 3,
"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"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "reachability",
"workflow": "stateequation||search"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 311
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "E (F ((p98 <= p469)))",
"processed_size": 21,
"rewrites": 24
},
"result":
{
"edges": 100,
"markings": 101,
"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": 1,
"problems": 1
},
"type": "reachability",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 342
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"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 (G ((p377 <= 2)))",
"processed_size": 19,
"rewrites": 24
},
"result":
{
"edges": 214,
"markings": 214,
"produced_by": "state space / EG",
"value": true
},
"task":
{
"compoundnumber": 6,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 4
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "possible_preservation",
"workflow": "stateequation"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 454
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 0,
"U": 1,
"X": 0,
"aconj": 1,
"adisj": 1,
"aneg": 0,
"comp": 5,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 7,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 7,
"visible_transitions": 0
},
"processed": "A ((((1 <= p28) OR (1 <= p403) OR (1 <= p223)) U ((p148 <= p16) AND (p482 + 1 <= p243))))",
"processed_size": 91,
"rewrites": 28
},
"result":
{
"edges": 214,
"markings": 214,
"produced_by": "state space /ER",
"value": false
},
"task":
{
"compoundnumber": 9,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl",
"visible": 16
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 3,
"problems": 3
},
"type": "universal_until",
"workflow": "stateequation"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 530
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"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": "(p108 <= p338)",
"processed_size": 14,
"rewrites": 27
},
"result":
{
"edges": 302,
"markings": 302,
"produced_by": "state space /EGEF",
"value": false
},
"task":
{
"compoundnumber": 10,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving",
"visible": 5
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "eventual_invariance",
"workflow": "stateequation"
}
},

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

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 847
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "(p207 <= 1)",
"processed_size": 11,
"rewrites": 23
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 13,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

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

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 847
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "((1 <= p83) AND (p290 <= p142) AND (1 <= p134))",
"processed_size": 47,
"rewrites": 23
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 13,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1271
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "A (G ((p92 <= p483)))",
"processed_size": 21,
"rewrites": 25
},
"result":
{
"edges": 100,
"markings": 101,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 14,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "invariance",
"workflow": "stateequation||search"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 13,
"type": "boolean"
}
},

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

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 2543
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 0,
"U": 1,
"X": 0,
"aconj": 1,
"adisj": 1,
"aneg": 0,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 6,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 6,
"visible_transitions": 0
},
"processed": "A ((((3 <= p78) OR (p158 <= p8)) U ((1 <= p95) AND (p214 <= p426))))",
"processed_size": 69,
"rewrites": 28
},
"result":
{
"edges": 214,
"markings": 214,
"produced_by": "state space /ER",
"value": false
},
"task":
{
"compoundnumber": 15,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl",
"visible": 15
},
"threads": 1,
"type": "dfs"
},
"type": "universal_until",
"workflow": "stateequation"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 14,
"type": "boolean"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 2543
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "A (G ((p173 + 1 <= p118)))",
"processed_size": 26,
"rewrites": 25
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 15,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"type": "invariance",
"workflow": "stateequation||search"
}
}
],
"result":
{
"produced_by": "boolean",
"value": null
},
"task":
{
"compoundnumber": 15,
"type": "boolean"
}
},

{
"child":
[

{
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 0,
"G": 0,
"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(((p176 <= 0) AND (p406 <= 0)))",
"processed_size": 33,
"rewrites": 24
},
"net":
{
"conflict_clusters": 401,
"singleton_clusters": 0
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "CTL model checker",
"value": false
},
"task":
{
"compoundnumber": 17,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
}
],
"result":
{
"produced_by": "boolean",
"value": null
},
"task":
{
"compoundnumber": 16,
"type": "boolean"
}
},

{
"child":
[

{
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "A (G ((p173 + 1 <= p118)))",
"processed_size": 26,
"rewrites": 25
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 20,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "invariance",
"workflow": "stateequation||search"
}
},

{
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 0,
"U": 1,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "A (((p190 <= p202) U (2 <= p295)))",
"processed_size": 34,
"rewrites": 28
},
"result":
{
"edges": 214,
"markings": 214,
"produced_by": "state space /ER",
"value": false
},
"task":
{
"compoundnumber": 21,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl",
"visible": 6
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "universal_until",
"workflow": "stateequation"
}
}
],
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 20,
"type": "boolean"
}
}
],
"exit":
{
"error": null,
"memory": 28604,
"runtime": 2110.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "CTLCardinality.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "E(F(**)) : E(F(**)) : A(G(**)) : ((A(G(*)) AND A((** U **))) OR A((** U **))) : (A(G(**)) OR (* AND A(X(*)))) : ((A(G(*)) OR A(G(*))) AND *) : (** OR (A(G(**)) AND A(F(**)))) : E(F((E(G(**)) AND **))) : E(X(A(F(**)))) : A((E(F(**)) U E(G(**)))) : A(F(A(G(*)))) : E(G(**)) : A(F(E((** U **)))) : A((** U **)) : (E((** U **)) OR E(X(**))) : (A((** U **)) AND E(G(**)))"
},
"net":
{
"arcs": 2302,
"conflict_clusters": 401,
"places": 501,
"places_significant": 400,
"singleton_clusters": 0,
"transitions": 801
},
"result":
{
"preliminary_value": "yes yes no no no no no unknown no unknown no yes unknown no unknown no ",
"value": "yes yes no no no no no unknown no unknown no yes unknown no unknown 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: 1302/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 16032
lola: finding significant places
lola: 501 places, 801 transitions, 400 significant places
lola: compute conflict clusters
lola: computed conflict clusters
lola: Computing conflicting sets
lola: Computing back conflicting sets
lola: TASK
lola: Reading formula in XML format (--xmlformula)
lola: reading pnml
lola: reading formula from CTLCardinality.xml
lola: E (((p141 <= p290) U E (F ((2 <= p45))))) : E (F ((p98 <= p469))) : A (G (A (G (((2 <= p121) OR (1 <= p242)))))) : ((NOT(E (F ((p118 <= p173)))) AND A (((p181 <= p85) U (1 <= p486)))) OR A (((p190 <= p202) U (2 <= p295)))) : (A (G (((3 <= p407) OR (p106 <= p146) OR (p317 <= p402)))) OR NOT((((p479 + 1 <= p218) OR (p242 <= 0)) OR E (X ((3 <= p314)))))) : NOT(((E (F ((3 <= p224))) AND E (F ((p42 <= p198)))) OR (2 <= p207))) : A ((A (G ((p92 <= p483))) U ((1 <= p83) AND (p290 <= p142) AND (1 <= p134)))) : E (F ((E (G ((p19 <= p341))) AND (p183 <= p91)))) : E (X (A (F ((p353 + 1 <= p479))))) : A ((E (F ((p337 <= p484))) U E (G ((p18 <= p364))))) : A (F (NOT(E (F ((p108 <= p338)))))) : E (G ((p377 <= 2))) : A (F (E (((p305 <= p92) U (p213 <= p169))))) : A ((((1 <= p28) OR (1 <= p403) OR (1 <= p223)) U ((p148 <= p16) AND (p482 + 1 <= p243)))) : (E (((p255 <= p429) U (p293 <= 1))) OR E (X (((p176 <= 0) AND (p406 <= 0))))) : (A ((((3 <= p78) OR (p158 <= p8)) U ((1 <= p95) AND (p214 <= p426)))) AND E (G ((p306 + 1 <= p273))))
lola: rewrite Frontend/Parser/formula_rewrite.k:473
lola: rewrite Frontend/Parser/formula_rewrite.k:389
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:318
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:297
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:315
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:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:479
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (G (((3 <= p407) OR (p106 <= p146) OR (p317 <= p402)))) OR (((p218 <= p479) AND (1 <= p242)) AND A (X ((p314 <= 2)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((p218 <= p479) AND (1 <= p242))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((p218 <= p479) AND (1 <= p242))
lola: processed formula length: 32
lola: 23 rewrites
lola: closed formula file CTLCardinality.xml
lola: processed formula with 2 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 1 will run for 236 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((3 <= p407) OR (p106 <= p146) OR (p317 <= p402))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: A (G (((3 <= p407) OR (p106 <= p146) OR (p317 <= p402))))
lola: processed formula length: 59
lola: 25 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((p407 <= 2) AND (p146 + 1 <= p106) AND (p402 + 1 <= p317))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 3 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 4 markings, 3 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 1 will run for 236 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (X (A (F ((p353 + 1 <= p479)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:811
lola: rewrite Frontend/Parser/formula_rewrite.k:807
lola: processed formula: EX(AF((p353 + 1 <= p479)))
lola: processed formula length: 26
lola: 25 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 60394 markings, 60594 edges
lola: ========================================
lola: subprocess 2 will run for 253 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E (((p255 <= p429) U (p293 <= 1))) OR E (X (((p176 <= 0) AND (p406 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 2 will run for 253 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (((p255 <= p429) U (p293 <= 1)))
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 (((p255 <= p429) U (p293 <= 1)))
lola: processed formula length: 34
lola: 26 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /EU)
lola: state space: using reachability graph (EU version) (--search=depth)
lola: state space: using eu preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (p293 <= 1)
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to CTLCardinality-2-0.sara
lola: state equation: calling and running sara
sara: try reading problem file CTLCardinality-2-0.sara.
sara: place or transition ordering is non-deterministic

lola: state equation 0: solution produced
lola: sara is running 0 secs || 764121 markings, 1087859 edges, 152824 markings/sec, 0 secs
lola: sara is running 5 secs || 1537262 markings, 2188896 edges, 154628 markings/sec, 5 secs
lola: sara is running 10 secs || 2320668 markings, 3304592 edges, 156681 markings/sec, 10 secs
lola: sara is running 15 secs || 3103305 markings, 4419227 edges, 156527 markings/sec, 15 secs
lola: sara is running 20 secs || 3887345 markings, 5535751 edges, 156808 markings/sec, 20 secs
lola: sara is running 25 secs || 4667972 markings, 6647385 edges, 156125 markings/sec, 25 secs
lola: sara is running 30 secs || 5436473 markings, 7741784 edges, 153700 markings/sec, 30 secs
lola: sara is running 35 secs || 6194932 markings, 8822023 edges, 151692 markings/sec, 35 secs
lola: sara is running 40 secs || 6953376 markings, 9902122 edges, 151689 markings/sec, 40 secs
lola: sara is running 45 secs || 7719839 markings, 10993683 edges, 153293 markings/sec, 45 secs
lola: sara is running 50 secs || 8487193 markings, 12086404 edges, 153471 markings/sec, 50 secs
lola: sara is running 55 secs || 9235857 markings, 13152692 edges, 149733 markings/sec, 55 secs
lola: sara is running 60 secs || 9988834 markings, 14224936 edges, 150595 markings/sec, 60 secs
lola: sara is running 65 secs || 10751569 markings, 15311172 edges, 152547 markings/sec, 65 secs
lola: sara is running 70 secs || 11508123 markings, 16388599 edges, 151311 markings/sec, 70 secs
lola: sara is running 75 secs || 12266904 markings, 17469201 edges, 151756 markings/sec, 75 secs
lola: sara is running 80 secs || 13011641 markings, 18529731 edges, 148947 markings/sec, 80 secs
lola: sara is running 85 secs || 13730008 markings, 19552865 edges, 143673 markings/sec, 85 secs
lola: sara is running 90 secs || 14456102 markings, 20586775 edges, 145219 markings/sec, 90 secs
lola: sara is running 95 secs || 15195150 markings, 21639356 edges, 147810 markings/sec, 95 secs
lola: sara is running 100 secs || 15926433 markings, 22680720 edges, 146257 markings/sec, 100 secs
lola: sara is running 105 secs || 16615575 markings, 23662170 edges, 137828 markings/sec, 105 secs
lola: sara is running 110 secs || 17295817 markings, 24630924 edges, 136048 markings/sec, 110 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 3 will run for 263 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (X (((p176 <= 0) AND (p406 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:807
lola: processed formula: EX(((p176 <= 0) AND (p406 <= 0)))
lola: processed formula length: 33
lola: 24 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 0 significant temporal operators and needs 0 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 0 markings, 0 edges
lola: SUBRESULT
lola: result: unknown
lola: The Boolean predicate may be true or false.
lola: ========================================
lola: ========================================
lola: subprocess 3 will run for 263 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((2 <= 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 ((2 <= p45)))
lola: processed formula length: 18
lola: 24 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (2 <= p45)
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 3 markings, 2 edges
lola: ========================================
lola: subprocess 4 will run for 285 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((2 <= p121) OR (1 <= p242))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: A (G (((2 <= p121) OR (1 <= p242))))
lola: processed formula length: 37
lola: 25 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((p121 <= 1) AND (p242 <= 0))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 6 markings, 5 edges
lola: subprocess 5 will run for 311 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ========================================
lola: ...considering subproblem: E (F ((p98 <= p469)))
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 ((p98 <= p469)))
lola: processed formula length: 21
lola: 24 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (p98 <= p469)
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 101 markings, 100 edges
lola: state equation: write sara problem file to CTLCardinality-5-0.sara
lola: state equation: calling and running sara
lola: subprocess 6 will run for 342 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G ((p377 <= 2)))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation
lola: rewrite Frontend/Parser/formula_rewrite.k:583
lola: processed formula: E (G ((p377 <= 2)))
lola: processed formula length: 19
lola: 24 rewrites
lola: closed formula file CTLCardinality.xml
lola: ========================================
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: SUBRESULT
lola: result: yes
lola: produced by: state space / EG
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: (3 <= p377)
lola: state equation task get result unparse finished id 0
lola: The predicate is possibly preserved.
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: 214 markings, 214 edges
lola: ========================================
lola: subprocess 7 will run for 380 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (E (((p305 <= p92) U (p213 <= p169)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:809
lola: rewrite Frontend/Parser/formula_rewrite.k:811
lola: processed formula: AF(E((p305 <= p92) U (p213 <= p169)))
lola: processed formula length: 37
lola: 25 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
sara: try reading problem file CTLCardinality-5-0.sara.
sara: place or transition ordering is non-deterministic

lola: 702834 markings, 1000572 edges, 140567 markings/sec, 0 secs
lola: 1344792 markings, 1914732 edges, 128392 markings/sec, 5 secs
lola: 1991222 markings, 2835468 edges, 129286 markings/sec, 10 secs
lola: 2649173 markings, 3772351 edges, 131590 markings/sec, 15 secs
lola: 3289090 markings, 4683734 edges, 127983 markings/sec, 20 secs
lola: 3935386 markings, 5604073 edges, 129259 markings/sec, 25 secs
lola: 4650374 markings, 6622352 edges, 142998 markings/sec, 30 secs
lola: 5343665 markings, 7609715 edges, 138658 markings/sec, 35 secs
lola: 6040456 markings, 8602027 edges, 139358 markings/sec, 40 secs
lola: 6729345 markings, 9583022 edges, 137778 markings/sec, 45 secs
lola: 7414910 markings, 10559389 edges, 137113 markings/sec, 50 secs
lola: 8113326 markings, 11553976 edges, 139683 markings/sec, 55 secs
lola: 8802703 markings, 12535821 edges, 137875 markings/sec, 60 secs
lola: 9495563 markings, 13522519 edges, 138572 markings/sec, 65 secs
lola: 10187310 markings, 14507631 edges, 138349 markings/sec, 70 secs
lola: 10881363 markings, 15495990 edges, 138811 markings/sec, 75 secs
lola: 11559033 markings, 16461084 edges, 135534 markings/sec, 80 secs
lola: 12242250 markings, 17434078 edges, 136643 markings/sec, 85 secs
lola: 12936829 markings, 18423171 edges, 138916 markings/sec, 90 secs
lola: 13627515 markings, 19406906 edges, 138137 markings/sec, 95 secs
lola: 14338636 markings, 20419527 edges, 142224 markings/sec, 100 secs
lola: 15029071 markings, 21402910 edges, 138087 markings/sec, 105 secs
lola: 15721416 markings, 22388782 edges, 138469 markings/sec, 110 secs
lola: 16414137 markings, 23375277 edges, 138544 markings/sec, 115 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 8 will run for 413 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A ((E (F ((p337 <= p484))) U E (G ((p18 <= p364)))))
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:814
lola: processed formula: A(EF((p337 <= p484)) U EG((p18 <= p364)))
lola: processed formula length: 41
lola: 26 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 3 significant temporal operators and needs 13 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: 682730 markings, 972050 edges, 136546 markings/sec, 0 secs
lola: 1373515 markings, 1955680 edges, 138157 markings/sec, 5 secs
lola: 2056031 markings, 2927765 edges, 136503 markings/sec, 10 secs
lola: 2732359 markings, 3890824 edges, 135266 markings/sec, 15 secs
lola: 3400226 markings, 4841990 edges, 133573 markings/sec, 20 secs
lola: 4046853 markings, 5762793 edges, 129325 markings/sec, 25 secs
lola: 4686434 markings, 6673707 edges, 127916 markings/sec, 30 secs
lola: 5340649 markings, 7605386 edges, 130843 markings/sec, 35 secs
lola: 6040312 markings, 8601794 edges, 139933 markings/sec, 40 secs
lola: 6735232 markings, 9591455 edges, 138984 markings/sec, 45 secs
lola: 7425950 markings, 10575169 edges, 138144 markings/sec, 50 secs
lola: 8126138 markings, 11572256 edges, 140038 markings/sec, 55 secs
lola: 8817416 markings, 12556740 edges, 138256 markings/sec, 60 secs
lola: 9509856 markings, 13542878 edges, 138488 markings/sec, 65 secs
lola: 10205456 markings, 14533415 edges, 139120 markings/sec, 70 secs
lola: 10897492 markings, 15519038 edges, 138407 markings/sec, 75 secs
lola: 11595097 markings, 16512459 edges, 139521 markings/sec, 80 secs
lola: 12287041 markings, 17497891 edges, 138389 markings/sec, 85 secs
lola: 12985341 markings, 18492347 edges, 139660 markings/sec, 90 secs
lola: 13681015 markings, 19483107 edges, 139135 markings/sec, 95 secs
lola: 14377253 markings, 20474485 edges, 139248 markings/sec, 100 secs
lola: 15068515 markings, 21459094 edges, 138252 markings/sec, 105 secs
lola: 15745051 markings, 22422391 edges, 135307 markings/sec, 110 secs
lola: 16435363 markings, 23405553 edges, 138062 markings/sec, 115 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 9 will run for 454 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A ((((1 <= p28) OR (1 <= p403) OR (1 <= p223)) U ((p148 <= p16) AND (p482 + 1 <= p243))))
lola: ========================================
lola: SUBTASK
lola: checking universal until
lola: rewrite Frontend/Parser/formula_rewrite.k:577
lola: rewrite Frontend/Parser/formula_rewrite.k:735
lola: rewrite Frontend/Parser/formula_rewrite.k:695
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: A ((((1 <= p28) OR (1 <= p403) OR (1 <= p223)) U ((p148 <= p16) AND (p482 + 1 <= p243))))
lola: processed formula length: 91
lola: 28 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /ER)
lola: state space: using reachability graph (ER version) (--search=depth)
lola: state space: using ltl preserving stubborn set method (--stubborn=tarjan)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: 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 <= p28) OR (1 <= p403) OR (1 <= p223))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 3 literals and 3 conjunctive subformulas
lola: 1
lola: SUBRESULT
lola: result: no
lola: produced by: state space /ER
lola: Predicate Phi does not hild until Predicate Psi on all paths.
lola: 214 markings, 214 edges
lola: ========================================
lola: subprocess 10 will run for 530 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (A (G ((p338 + 1 <= p108)))))
lola: ========================================
lola: SUBTASK
lola: checking eventual invariance
lola: rewrite Frontend/Parser/formula_rewrite.k:594
lola: rewrite Frontend/Parser/formula_rewrite.k:629
lola: rewrite Frontend/Parser/formula_rewrite.k:758
lola: rewrite Frontend/Parser/formula_rewrite.k:788
lola: processed formula: (p108 <= p338)
lola: processed formula length: 14
lola: 27 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /EGEF)
lola: state space: using reachability graph (EGEF version) (--search=depth)
lola: state space: using ctl preserving stubborn set method (--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:788
lola: state equation task get result rewrite finished id 1
lola: state equation task get result unparse finished++ id 1
lola: formula 1: (p108 <= p338)
lola: state equation task get result unparse finished id 1
lola: state equation task get result started, id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
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: (p338 + 1 <= p108)
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space /EGEF
lola: The predicate is not eventually invariant.
lola: 302 markings, 302 edges
lola: state equation: write sara problem file to CTLCardinality-10-0.sara
lola: state equation: write sara problem file to CTLCardinality-10-1.sara
lola: ========================================
lola: state equation: calling and running sara
lola: subprocess 11 will run for 636 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((E (G ((p19 <= p341))) AND (p183 <= p91))))
lola: ========================================
lola: SUBTASK
lola: checking an existential CTL formula with single witness path (use LTL...)
lola: rewrite Frontend/Parser/formula_rewrite.k:658
lola: rewrite Frontend/Parser/formula_rewrite.k:659
lola: rewrite Frontend/Parser/formula_rewrite.k:661
lola: rewrite Frontend/Parser/formula_rewrite.k:666
lola: rewrite Frontend/Parser/formula_rewrite.k:659
lola: rewrite Frontend/Parser/formula_rewrite.k:662
lola: rewrite Frontend/Parser/formula_rewrite.k:668
lola: rewrite Frontend/Parser/formula_rewrite.k:668
lola: rewrite Frontend/Parser/formula_rewrite.k:679
lola: rewrite Frontend/Parser/formula_rewrite.k:679
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((F ((p341 + 1 <= p19)) OR (p91 + 1 <= p183)))
lola: processed formula length: 48
lola: 33 rewrites
lola: closed formula file CTLCardinality.xml
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
sara: try reading problem file CTLCardinality-10-0.sara.
sara: place or transition ordering is non-deterministic

lola: 723308 markings, 1182022 edges, 144662 markings/sec, 0 secs
lola: 1439201 markings, 2352052 edges, 143179 markings/sec, 5 secs
lola: 2104004 markings, 3438716 edges, 132961 markings/sec, 10 secs
lola: 2785376 markings, 4552536 edges, 136274 markings/sec, 15 secs
lola: 3496528 markings, 5714929 edges, 142230 markings/sec, 20 secs
lola: 4207237 markings, 6876483 edges, 142142 markings/sec, 25 secs
lola: 4923199 markings, 8046858 edges, 143192 markings/sec, 30 secs
lola: 5648837 markings, 9232876 edges, 145128 markings/sec, 35 secs
lola: 6354783 markings, 10386854 edges, 141189 markings/sec, 40 secs
lola: 7000366 markings, 11442120 edges, 129117 markings/sec, 45 secs
lola: 7649568 markings, 12503170 edges, 129840 markings/sec, 50 secs
lola: 8302448 markings, 13570455 edges, 130576 markings/sec, 55 secs
lola: 8996646 markings, 14705043 edges, 138840 markings/sec, 60 secs
lola: 9723403 markings, 15893131 edges, 145351 markings/sec, 65 secs
lola: 10439243 markings, 17063076 edges, 143168 markings/sec, 70 secs
lola: 11115021 markings, 18167628 edges, 135156 markings/sec, 75 secs
lola: 11754634 markings, 19213127 edges, 127923 markings/sec, 80 secs
lola: 12389936 markings, 20251590 edges, 127060 markings/sec, 85 secs
lola: 13028610 markings, 21295368 edges, 127735 markings/sec, 90 secs
lola: 13726625 markings, 22436541 edges, 139603 markings/sec, 95 secs
lola: 14378440 markings, 23502031 edges, 130363 markings/sec, 100 secs
lola: 15021538 markings, 24553237 edges, 128620 markings/sec, 105 secs
lola: 15661113 markings, 25598325 edges, 127915 markings/sec, 110 secs
lola: 16304182 markings, 26649660 edges, 128614 markings/sec, 115 secs
lola: 16945103 markings, 27697383 edges, 128184 markings/sec, 120 secs
lola: 17579399 markings, 28733816 edges, 126859 markings/sec, 125 secs
lola: 18267095 markings, 29858224 edges, 137539 markings/sec, 130 secs
lola: 18947484 markings, 30970222 edges, 136078 markings/sec, 135 secs
lola: 19626637 markings, 32080421 edges, 135831 markings/sec, 140 secs
lola: 20316937 markings, 33208615 edges, 138060 markings/sec, 145 secs
lola: 21022556 markings, 34362107 edges, 141124 markings/sec, 150 secs
lola: 21728064 markings, 35515269 edges, 141102 markings/sec, 155 secs
lola: 22423434 markings, 36651975 edges, 139074 markings/sec, 160 secs
lola: 23135984 markings, 37816366 edges, 142510 markings/sec, 165 secs
lola: 23828998 markings, 38949436 edges, 138603 markings/sec, 170 secs
lola: 24504989 markings, 40054411 edges, 135198 markings/sec, 175 secs
lola: 25195373 markings, 41182734 edges, 138077 markings/sec, 180 secs
lola: 25878660 markings, 42299475 edges, 136657 markings/sec, 185 secs
lola: 26557639 markings, 43409288 edges, 135796 markings/sec, 190 secs
lola: 27257266 markings, 44552912 edges, 139925 markings/sec, 195 secs
lola: 27964598 markings, 45709123 edges, 141466 markings/sec, 200 secs
lola: 28658226 markings, 46843012 edges, 138726 markings/sec, 205 secs
lola: 29354078 markings, 47980229 edges, 139170 markings/sec, 210 secs
lola: 30050086 markings, 49117748 edges, 139202 markings/sec, 215 secs
lola: 30716637 markings, 50207469 edges, 133310 markings/sec, 220 secs
lola: 31375065 markings, 51283663 edges, 131686 markings/sec, 225 secs
lola: 32040502 markings, 52371305 edges, 133087 markings/sec, 230 secs
lola: 32698897 markings, 53447528 edges, 131679 markings/sec, 235 secs
lola: 33361708 markings, 54531079 edges, 132562 markings/sec, 240 secs
lola: 34058103 markings, 55669228 edges, 139279 markings/sec, 245 secs
lola: 34748957 markings, 56798553 edges, 138171 markings/sec, 250 secs
lola: 35431663 markings, 57914277 edges, 136541 markings/sec, 255 secs
lola: 36121597 markings, 59041983 edges, 137987 markings/sec, 260 secs
lola: 36806959 markings, 60162389 edges, 137072 markings/sec, 265 secs
lola: 37478884 markings, 61260730 edges, 134385 markings/sec, 270 secs
lola: 38151239 markings, 62359697 edges, 134471 markings/sec, 275 secs
lola: 38810550 markings, 63437449 edges, 131862 markings/sec, 280 secs
lola: 39464105 markings, 64505611 edges, 130711 markings/sec, 285 secs
lola: 40125515 markings, 65587057 edges, 132282 markings/sec, 290 secs
lola: 40835388 markings, 66747099 edges, 141975 markings/sec, 295 secs
lola: 41534114 markings, 67889323 edges, 139745 markings/sec, 300 secs
lola: 42204979 markings, 68985652 edges, 134173 markings/sec, 305 secs
lola: 42877586 markings, 70084983 edges, 134521 markings/sec, 310 secs
lola: 43552530 markings, 71188509 edges, 134989 markings/sec, 315 secs
lola: 44222233 markings, 72283144 edges, 133941 markings/sec, 320 secs
lola: 44910109 markings, 73407340 edges, 137575 markings/sec, 325 secs
lola: 45590931 markings, 74520178 edges, 136164 markings/sec, 330 secs
lola: 46262902 markings, 75618625 edges, 134394 markings/sec, 335 secs
lola: 46951336 markings, 76743912 edges, 137687 markings/sec, 340 secs
lola: 47648000 markings, 77882419 edges, 139333 markings/sec, 345 secs
lola: 48333267 markings, 79002711 edges, 137053 markings/sec, 350 secs
lola: 49015851 markings, 80118448 edges, 136517 markings/sec, 355 secs
lola: 49704216 markings, 81243517 edges, 137673 markings/sec, 360 secs
lola: 50386886 markings, 82359616 edges, 136534 markings/sec, 365 secs
lola: 51059715 markings, 83459214 edges, 134566 markings/sec, 370 secs
lola: 51735251 markings, 84563267 edges, 135107 markings/sec, 375 secs
lola: 52405639 markings, 85659071 edges, 134078 markings/sec, 380 secs
lola: 53067285 markings, 86740645 edges, 132329 markings/sec, 385 secs
lola: 53727577 markings, 87819884 edges, 132058 markings/sec, 390 secs
lola: 54394196 markings, 88909451 edges, 133324 markings/sec, 395 secs
lola: 55050537 markings, 89982447 edges, 131268 markings/sec, 400 secs
lola: 55705437 markings, 91052817 edges, 130980 markings/sec, 405 secs
lola: 56365746 markings, 92132153 edges, 132062 markings/sec, 410 secs
lola: 57016286 markings, 93195490 edges, 130108 markings/sec, 415 secs
lola: 57660832 markings, 94248944 edges, 128909 markings/sec, 420 secs
lola: 58312553 markings, 95314368 edges, 130344 markings/sec, 425 secs
lola: 58953399 markings, 96361666 edges, 128169 markings/sec, 430 secs
lola: 59592994 markings, 97407205 edges, 127919 markings/sec, 435 secs
lola: 60273142 markings, 98518995 edges, 136030 markings/sec, 440 secs
lola: 60988149 markings, 99687627 edges, 143001 markings/sec, 445 secs
lola: 61697156 markings, 100846645 edges, 141801 markings/sec, 450 secs
lola: 62393083 markings, 101984096 edges, 139185 markings/sec, 455 secs
lola: 63059580 markings, 103073613 edges, 133299 markings/sec, 460 secs
lola: 63735345 markings, 104178278 edges, 135153 markings/sec, 465 secs
lola: 64401385 markings, 105266841 edges, 133208 markings/sec, 470 secs
lola: 65076414 markings, 106369989 edges, 135006 markings/sec, 475 secs
lola: 65756090 markings, 107481207 edges, 135935 markings/sec, 480 secs
lola: 66435761 markings, 108591899 edges, 135934 markings/sec, 485 secs
lola: 67144064 markings, 109749969 edges, 141661 markings/sec, 490 secs
lola: 67854377 markings, 110910814 edges, 142063 markings/sec, 495 secs
lola: 68551575 markings, 112050632 edges, 139440 markings/sec, 500 secs
lola: 69248904 markings, 113190331 edges, 139466 markings/sec, 505 secs
lola: 69916672 markings, 114281794 edges, 133554 markings/sec, 510 secs
lola: 70599600 markings, 115398051 edges, 136586 markings/sec, 515 secs
lola: 71283019 markings, 116515214 edges, 136684 markings/sec, 520 secs
lola: 71969170 markings, 117636550 edges, 137230 markings/sec, 525 secs
lola: 72645987 markings, 118743043 edges, 135363 markings/sec, 530 secs
lola: 73311049 markings, 119830147 edges, 133012 markings/sec, 535 secs
lola: 74000721 markings, 120957271 edges, 137934 markings/sec, 540 secs
lola: 74690819 markings, 122085424 edges, 138020 markings/sec, 545 secs
lola: 75374692 markings, 123203102 edges, 136775 markings/sec, 550 secs
lola: 76057128 markings, 124318799 edges, 136487 markings/sec, 555 secs
lola: 76731126 markings, 125420205 edges, 134800 markings/sec, 560 secs
lola: 77405550 markings, 126522837 edges, 134885 markings/sec, 565 secs
lola: 78080764 markings, 127626384 edges, 135043 markings/sec, 570 secs
lola: 78755394 markings, 128728936 edges, 134926 markings/sec, 575 secs
lola: 79420173 markings, 129815764 edges, 132956 markings/sec, 580 secs
lola: 80090276 markings, 130911181 edges, 134021 markings/sec, 585 secs
lola: 80784902 markings, 132046617 edges, 138925 markings/sec, 590 secs
lola: 81436821 markings, 133112189 edges, 130384 markings/sec, 595 secs
lola: 82076800 markings, 134158111 edges, 127996 markings/sec, 600 secs
lola: 82730048 markings, 135225880 edges, 130650 markings/sec, 605 secs
lola: 83389163 markings, 136303207 edges, 131823 markings/sec, 610 secs
lola: 84030899 markings, 137352158 edges, 128347 markings/sec, 615 secs
lola: 84670284 markings, 138397376 edges, 127877 markings/sec, 620 secs
lola: 85350337 markings, 139508925 edges, 136011 markings/sec, 625 secs
lola: 86032800 markings, 140624467 edges, 136493 markings/sec, 630 secs
lola: local time limit reached - aborting
lola:
preliminary result: yes yes no unknown no unknown unknown unknown no unknown no yes unknown no unknown unknown
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 12 will run for 635 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((A (G ((p224 <= 2))) OR A (G ((p198 + 1 <= p42)))) AND (p207 <= 1))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 12 will run for 635 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((p224 <= 2)))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:788
lola: processed formula: A (G ((p224 <= 2)))
lola: processed formula length: 19
lola: 25 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:788
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (3 <= p224)
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 4 markings, 3 edges
lola: state equation: write sara problem file to CTLCardinality-12-0.sara
lola: subprocess 13 will run for 847 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (p207 <= 1)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p207 <= 1)
lola: processed formula length: 11
lola: 23 rewrites
lola: closed formula file CTLCardinality.xml
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 14 will run for 1271 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((p198 + 1 <= p42)))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:788
lola: processed formula: A (G ((p198 + 1 <= p42)))
lola: processed formula length: 25
lola: 25 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: ========================================
lola: state equation: calling and running sara
sara: try reading problem file CTLCardinality-12-0.sara.
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:788
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (p42 <= p198)
lola: state equation task get result unparse finished id 0
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 0 markings, 0 edges
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 13 will run for 847 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (((1 <= p83) AND (p290 <= p142) AND (1 <= p134)) OR (A (G ((p92 <= p483))) AND A (F (((1 <= p83) AND (p290 <= p142) AND (1 <= p134))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 13 will run for 847 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((1 <= p83) AND (p290 <= p142) AND (1 <= p134))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((1 <= p83) AND (p290 <= p142) AND (1 <= p134))
lola: processed formula length: 47
lola: 23 rewrites
lola: closed formula file CTLCardinality.xml
lola: processed formula with 3 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 14 will run for 1271 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((p92 <= p483)))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: A (G ((p92 <= p483)))
lola: processed formula length: 21
lola: 25 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (p483 + 1 <= p92)
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 101 markings, 100 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 14 will run for 1271 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A ((((3 <= p78) OR (p158 <= p8)) U ((1 <= p95) AND (p214 <= p426)))) AND E (G ((p306 + 1 <= p273))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 14 will run for 1271 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G ((p306 + 1 <= p273)))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation
lola: rewrite Frontend/Parser/formula_rewrite.k:583
lola: processed formula: E (G ((p306 + 1 <= p273)))
lola: processed formula length: 26
lola: 24 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (p273 <= p306)
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to CTLCardinality-14-0.sara
lola: state equation: calling and running sara
sara: try reading problem file CTLCardinality-14-0.sara.
sara: place or transition ordering is non-deterministic
lola: SUBRESULT
lola: result: yes
lola: produced by: state space / EG
lola: The predicate is possibly preserved.
lola: 214 markings, 214 edges
lola: ========================================
lola: subprocess 15 will run for 2543 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A ((((3 <= p78) OR (p158 <= p8)) U ((1 <= p95) AND (p214 <= p426))))
lola: ========================================
lola: SUBTASK
lola: checking universal until
lola: rewrite Frontend/Parser/formula_rewrite.k:577
lola: rewrite Frontend/Parser/formula_rewrite.k:735
lola: rewrite Frontend/Parser/formula_rewrite.k:695
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: A ((((3 <= p78) OR (p158 <= p8)) U ((1 <= p95) AND (p214 <= p426))))
lola: processed formula length: 69
lola: 28 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /ER)
lola: state space: using reachability graph (ER version) (--search=depth)
lola: state space: using ltl preserving stubborn set method (--stubborn=tarjan)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: 1
lola: SUBRESULT
lola: result: no
lola: produced by: state space /ER
lola: Predicate Phi does not hild until Predicate Psi on all paths.
lola: 214 markings, 214 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 15 will run for 2543 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((A (G ((p173 + 1 <= p118))) AND A (((p181 <= p85) U (1 <= p486)))) OR A (((p190 <= p202) U (2 <= p295))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 15 will run for 2543 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((p173 + 1 <= p118)))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:788
lola: processed formula: A (G ((p173 + 1 <= p118)))
lola: processed formula length: 26
lola: 25 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 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 (((p255 <= p429) U (p293 <= 1))) OR E (X (((p176 <= 0) AND (p406 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: ...considering subproblem: E (((p255 <= p429) U (p293 <= 1)))
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 (((p255 <= p429) U (p293 <= 1)))
lola: processed formula length: 34
lola: 26 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /EU)
lola: state space: using reachability graph (EU version) (--search=depth)
lola: state space: using eu preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (p293 <= 1)
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas

lola: state equation: write sara problem file to CTLCardinality-16-0.sara
lola: state equation: calling and running sara
sara: try reading problem file CTLCardinality-16-0.sara.
sara: place or transition ordering is non-deterministic

lola: state equation 0: solution produced
lola: sara is running 0 secs || 743557 markings, 1058551 edges, 148711 markings/sec, 0 secs
lola: sara is running 5 secs || 1496071 markings, 2130297 edges, 150503 markings/sec, 5 secs
lola: sara is running 10 secs || 2249226 markings, 3202877 edges, 150631 markings/sec, 10 secs
lola: sara is running 15 secs || 3001069 markings, 4273579 edges, 150369 markings/sec, 15 secs
lola: sara is running 20 secs || 3746957 markings, 5335743 edges, 149178 markings/sec, 20 secs
lola: sara is running 25 secs || 4498635 markings, 6406262 edges, 150336 markings/sec, 25 secs
lola: sara is running 30 secs || 5243576 markings, 7467202 edges, 148988 markings/sec, 30 secs
lola: sara is running 35 secs || 5971013 markings, 8503121 edges, 145487 markings/sec, 35 secs
lola: sara is running 40 secs || 6720635 markings, 9570673 edges, 149924 markings/sec, 40 secs
lola: sara is running 45 secs || 7452976 markings, 10613588 edges, 146468 markings/sec, 45 secs
lola: sara is running 50 secs || 8204200 markings, 11683484 edges, 150245 markings/sec, 50 secs
lola: sara is running 55 secs || 8945191 markings, 12738667 edges, 148198 markings/sec, 55 secs
lola: sara is running 60 secs || 9676222 markings, 13779701 edges, 146206 markings/sec, 60 secs
lola: sara is running 65 secs || 10427723 markings, 14849895 edges, 150300 markings/sec, 65 secs
lola: sara is running 70 secs || 11170098 markings, 15907258 edges, 148475 markings/sec, 70 secs
lola: sara is running 75 secs || 11902125 markings, 16949651 edges, 146405 markings/sec, 75 secs
lola: sara is running 80 secs || 12645170 markings, 18007871 edges, 148609 markings/sec, 80 secs
lola: sara is running 85 secs || 13374230 markings, 19046130 edges, 145812 markings/sec, 85 secs
lola: sara is running 90 secs || 14113589 markings, 20099060 edges, 147872 markings/sec, 90 secs
lola: sara is running 95 secs || 14821408 markings, 21107038 edges, 141564 markings/sec, 95 secs
lola: sara is running 100 secs || 15508331 markings, 22085280 edges, 137385 markings/sec, 100 secs
lola: sara is running 105 secs || 16198604 markings, 23068303 edges, 138055 markings/sec, 105 secs
lola: sara is running 110 secs || 16908514 markings, 24079268 edges, 141982 markings/sec, 110 secs
lola: sara is running 115 secs || 17632526 markings, 25110452 edges, 144802 markings/sec, 115 secs
lola: Child process aborted or communication problem between parent and child process
lola: ========================================
lola: ...considering subproblem: E (X (((p176 <= 0) AND (p406 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:807
lola: processed formula: EX(((p176 <= 0) AND (p406 <= 0)))
lola: processed formula length: 33
lola: 24 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 0 significant temporal operators and needs 0 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 0 markings, 0 edges
lola: SUBRESULT
lola: result: unknown
lola: The Boolean predicate may be true or false.
lola: ========================================
lola: ...considering subproblem: A (F (E (((p305 <= p92) U (p213 <= p169)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:809
lola: rewrite Frontend/Parser/formula_rewrite.k:811
lola: processed formula: AF(E((p305 <= p92) U (p213 <= p169)))
lola: processed formula length: 37
lola: 25 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: ========================================
lola: ========================================
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: 642494 markings, 914730 edges, 128499 markings/sec, 0 secs
lola: 1272776 markings, 1812168 edges, 126056 markings/sec, 5 secs
lola: 1910062 markings, 2719793 edges, 127457 markings/sec, 10 secs
lola: 2537340 markings, 3613187 edges, 125456 markings/sec, 15 secs
lola: 3191459 markings, 4544671 edges, 130824 markings/sec, 20 secs
lola: 3839652 markings, 5467807 edges, 129639 markings/sec, 25 secs
lola: 4481431 markings, 6381759 edges, 128356 markings/sec, 30 secs
lola: 5116568 markings, 7286290 edges, 127027 markings/sec, 35 secs
lola: 5758858 markings, 8200911 edges, 128458 markings/sec, 40 secs
lola: 6398356 markings, 9111768 edges, 127900 markings/sec, 45 secs
lola: 7034786 markings, 10017982 edges, 127286 markings/sec, 50 secs
lola: 7680832 markings, 10938048 edges, 129209 markings/sec, 55 secs
lola: 8371509 markings, 11921734 edges, 138135 markings/sec, 60 secs
lola: 9058912 markings, 12900646 edges, 137481 markings/sec, 65 secs
lola: 9746981 markings, 13880480 edges, 137614 markings/sec, 70 secs
lola: 10417603 markings, 14835507 edges, 134124 markings/sec, 75 secs
lola: 11108232 markings, 15819170 edges, 138126 markings/sec, 80 secs
lola: 11803162 markings, 16808772 edges, 138986 markings/sec, 85 secs
lola: 12494402 markings, 17793194 edges, 138248 markings/sec, 90 secs
lola: 13189043 markings, 18782362 edges, 138928 markings/sec, 95 secs
lola: 13888180 markings, 19778003 edges, 139827 markings/sec, 100 secs
lola: 14587423 markings, 20773846 edges, 139849 markings/sec, 105 secs
lola: 15273306 markings, 21750675 edges, 137177 markings/sec, 110 secs
lola: 15971720 markings, 22745335 edges, 139683 markings/sec, 115 secs
lola: 16672182 markings, 23742822 edges, 140092 markings/sec, 120 secs
lola: Child process aborted or communication problem between parent and child process
lola: ========================================
lola: ...considering subproblem: A ((E (F ((p337 <= p484))) U E (G ((p18 <= p364)))))
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:814
lola: processed formula: A(EF((p337 <= p484)) U EG((p18 <= p364)))
lola: processed formula length: 41
lola: 26 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 3 significant temporal operators and needs 13 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: 613006 markings, 872665 edges, 122601 markings/sec, 0 secs
lola: 1272081 markings, 1811182 edges, 131815 markings/sec, 5 secs
lola: 1929584 markings, 2747633 edges, 131501 markings/sec, 10 secs
lola: 2578617 markings, 3671882 edges, 129807 markings/sec, 15 secs
lola: 3207233 markings, 4567176 edges, 125723 markings/sec, 20 secs
lola: 3905879 markings, 5562173 edges, 139729 markings/sec, 25 secs
lola: 4591070 markings, 6537847 edges, 137038 markings/sec, 30 secs
lola: 5279085 markings, 7517744 edges, 137603 markings/sec, 35 secs
lola: 5976597 markings, 8511136 edges, 139502 markings/sec, 40 secs
lola: 6668375 markings, 9496283 edges, 138356 markings/sec, 45 secs
lola: 7348358 markings, 10464624 edges, 135997 markings/sec, 50 secs
lola: 8041813 markings, 11452192 edges, 138691 markings/sec, 55 secs
lola: 8724158 markings, 12423859 edges, 136469 markings/sec, 60 secs
lola: 9406685 markings, 13395995 edges, 136505 markings/sec, 65 secs
lola: 10076571 markings, 14349883 edges, 133977 markings/sec, 70 secs
lola: 10763590 markings, 15328332 edges, 137404 markings/sec, 75 secs
lola: 11456231 markings, 16314631 edges, 138528 markings/sec, 80 secs
lola: 12132447 markings, 17277769 edges, 135243 markings/sec, 85 secs
lola: 12800983 markings, 18229760 edges, 133707 markings/sec, 90 secs
lola: 13483584 markings, 19201834 edges, 136520 markings/sec, 95 secs
lola: 14176692 markings, 20188872 edges, 138622 markings/sec, 100 secs
lola: 14869052 markings, 21174908 edges, 138472 markings/sec, 105 secs
lola: 15553460 markings, 22149613 edges, 136882 markings/sec, 110 secs
lola: 16232792 markings, 23117058 edges, 135866 markings/sec, 115 secs
lola: 16892160 markings, 24056127 edges, 131874 markings/sec, 120 secs
lola: Child process aborted or communication problem between parent and child process
lola: ========================================
lola: ...considering subproblem: E (F ((E (G ((p19 <= p341))) AND (p183 <= p91))))
lola: ========================================
lola: SUBTASK
lola: checking an existential CTL formula with single witness path (use LTL...)
lola: rewrite Frontend/Parser/formula_rewrite.k:658
lola: rewrite Frontend/Parser/formula_rewrite.k:659
lola: rewrite Frontend/Parser/formula_rewrite.k:661
lola: rewrite Frontend/Parser/formula_rewrite.k:666
lola: rewrite Frontend/Parser/formula_rewrite.k:659
lola: rewrite Frontend/Parser/formula_rewrite.k:662
lola: rewrite Frontend/Parser/formula_rewrite.k:668
lola: rewrite Frontend/Parser/formula_rewrite.k:668
lola: rewrite Frontend/Parser/formula_rewrite.k:679
lola: rewrite Frontend/Parser/formula_rewrite.k:679
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((F ((p341 + 1 <= p19)) OR (p91 + 1 <= p183)))
lola: processed formula length: 48
lola: 33 rewrites
lola: closed formula file CTLCardinality.xml
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: 701797 markings, 1146862 edges, 140359 markings/sec, 0 secs
lola: 1401277 markings, 2289956 edges, 139896 markings/sec, 5 secs
lola: 2105708 markings, 3441613 edges, 140886 markings/sec, 10 secs
lola: 2786415 markings, 4554140 edges, 136141 markings/sec, 15 secs
lola: 3443911 markings, 5628785 edges, 131499 markings/sec, 20 secs
lola: 4096036 markings, 6694819 edges, 130425 markings/sec, 25 secs
lola: 4769267 markings, 7795457 edges, 134646 markings/sec, 30 secs
lola: 5456487 markings, 8918575 edges, 137444 markings/sec, 35 secs
lola: 6160334 markings, 10068986 edges, 140769 markings/sec, 40 secs
lola: 6869623 markings, 11228257 edges, 141858 markings/sec, 45 secs
lola: 7583165 markings, 12394869 edges, 142708 markings/sec, 50 secs
lola: 8281850 markings, 13536607 edges, 139737 markings/sec, 55 secs
lola: 8973254 markings, 14667034 edges, 138281 markings/sec, 60 secs
lola: 9678050 markings, 15818844 edges, 140959 markings/sec, 65 secs
lola: 10377781 markings, 16962765 edges, 139946 markings/sec, 70 secs
lola: 11058681 markings, 18075606 edges, 136180 markings/sec, 75 secs
lola: 11721096 markings, 19158387 edges, 132483 markings/sec, 80 secs
lola: 12356504 markings, 20197021 edges, 127082 markings/sec, 85 secs
lola: 12966746 markings, 21194406 edges, 122048 markings/sec, 90 secs
lola: 13596829 markings, 22224297 edges, 126017 markings/sec, 95 secs
lola: 14258974 markings, 23306632 edges, 132429 markings/sec, 100 secs
lola: 14898794 markings, 24352441 edges, 127964 markings/sec, 105 secs
lola: 15533296 markings, 25389534 edges, 126900 markings/sec, 110 secs
lola: 16183058 markings, 26451620 edges, 129952 markings/sec, 115 secs
lola: 16810161 markings, 27476578 edges, 125421 markings/sec, 120 secs
lola: 17447697 markings, 28518741 edges, 127507 markings/sec, 125 secs
lola: 18110882 markings, 29602797 edges, 132637 markings/sec, 130 secs
lola: 18760672 markings, 30665003 edges, 129958 markings/sec, 135 secs
lola: 19393105 markings, 31698900 edges, 126487 markings/sec, 140 secs
lola: 20044810 markings, 32763609 edges, 130341 markings/sec, 145 secs
lola: 20757062 markings, 33928184 edges, 142450 markings/sec, 150 secs
lola: 21462824 markings, 35081618 edges, 141152 markings/sec, 155 secs
lola: 22156167 markings, 36214860 edges, 138669 markings/sec, 160 secs
lola: 22848718 markings, 37347102 edges, 138510 markings/sec, 165 secs
lola: 23509812 markings, 38427562 edges, 132219 markings/sec, 170 secs
lola: 24182070 markings, 39526557 edges, 134452 markings/sec, 175 secs
lola: 24869705 markings, 40650485 edges, 137527 markings/sec, 180 secs
lola: 25556154 markings, 41772241 edges, 137290 markings/sec, 185 secs
lola: 26236419 markings, 42884175 edges, 136053 markings/sec, 190 secs
lola: 26904172 markings, 43975925 edges, 133551 markings/sec, 195 secs
lola: 27587919 markings, 45093445 edges, 136749 markings/sec, 200 secs
lola: 28265140 markings, 46200341 edges, 135444 markings/sec, 205 secs
lola: 28933408 markings, 47292777 edges, 133654 markings/sec, 210 secs
lola: 29576087 markings, 48343039 edges, 128536 markings/sec, 215 secs
lola: 30221755 markings, 49398556 edges, 129134 markings/sec, 220 secs
lola: 30856180 markings, 50435558 edges, 126885 markings/sec, 225 secs
lola: 31491579 markings, 51474158 edges, 127080 markings/sec, 230 secs
lola: 32126296 markings, 52511648 edges, 126943 markings/sec, 235 secs
lola: 32751496 markings, 53533463 edges, 125040 markings/sec, 240 secs
lola: 33377474 markings, 54556657 edges, 125196 markings/sec, 245 secs
lola: 34035279 markings, 55631984 edges, 131561 markings/sec, 250 secs
lola: 34672022 markings, 56672640 edges, 127349 markings/sec, 255 secs
lola: 35300513 markings, 57699854 edges, 125698 markings/sec, 260 secs
lola: 35979422 markings, 58809700 edges, 135782 markings/sec, 265 secs
lola: 36663274 markings, 59927563 edges, 136770 markings/sec, 270 secs
lola: 37338048 markings, 61030356 edges, 134955 markings/sec, 275 secs
lola: 38006759 markings, 62123495 edges, 133742 markings/sec, 280 secs
lola: 38674686 markings, 63215228 edges, 133585 markings/sec, 285 secs
lola: 39337948 markings, 64299454 edges, 132652 markings/sec, 290 secs
lola: 39995681 markings, 65374843 edges, 131547 markings/sec, 295 secs
lola: 40703052 markings, 66530947 edges, 141474 markings/sec, 300 secs
lola: 41399624 markings, 67669397 edges, 139314 markings/sec, 305 secs
lola: 42087038 markings, 68793019 edges, 137483 markings/sec, 310 secs
lola: 42783866 markings, 69932021 edges, 139366 markings/sec, 315 secs
lola: 43474981 markings, 71061649 edges, 138223 markings/sec, 320 secs
lola: 44157513 markings, 72177241 edges, 136506 markings/sec, 325 secs
lola: 44840047 markings, 73292889 edges, 136507 markings/sec, 330 secs
lola: 45518851 markings, 74402360 edges, 135761 markings/sec, 335 secs
lola: 46201656 markings, 75518565 edges, 136561 markings/sec, 340 secs
lola: 46863381 markings, 76600136 edges, 132345 markings/sec, 345 secs
lola: 47507350 markings, 77652753 edges, 128794 markings/sec, 350 secs
lola: 48148973 markings, 78701417 edges, 128325 markings/sec, 355 secs
lola: 48779175 markings, 79731466 edges, 126040 markings/sec, 360 secs
lola: 49439000 markings, 80810200 edges, 131965 markings/sec, 365 secs
lola: 50089801 markings, 81873833 edges, 130160 markings/sec, 370 secs
lola: 50738311 markings, 82933735 edges, 129702 markings/sec, 375 secs
lola: 51393137 markings, 84004181 edges, 130965 markings/sec, 380 secs
lola: 52043611 markings, 85067463 edges, 130095 markings/sec, 385 secs
lola: 52686878 markings, 86118821 edges, 128653 markings/sec, 390 secs
lola: 53329340 markings, 87169168 edges, 128492 markings/sec, 395 secs
lola: 54013457 markings, 88287300 edges, 136823 markings/sec, 400 secs
lola: 54675639 markings, 89369745 edges, 132436 markings/sec, 405 secs
lola: 55349642 markings, 90471364 edges, 134801 markings/sec, 410 secs
lola: 56023996 markings, 91573615 edges, 134871 markings/sec, 415 secs
lola: 56681029 markings, 92647363 edges, 131407 markings/sec, 420 secs
lola: 57328701 markings, 93706113 edges, 129534 markings/sec, 425 secs
lola: 57975416 markings, 94763199 edges, 129343 markings/sec, 430 secs
lola: 58617916 markings, 95813513 edges, 128500 markings/sec, 435 secs
lola: 59260341 markings, 96863488 edges, 128485 markings/sec, 440 secs
lola: 59893552 markings, 97898620 edges, 126642 markings/sec, 445 secs
lola: 60585576 markings, 99029574 edges, 138405 markings/sec, 450 secs
lola: 61269655 markings, 100147857 edges, 136816 markings/sec, 455 secs
lola: 61949017 markings, 101258159 edges, 135872 markings/sec, 460 secs
lola: 62612525 markings, 102342659 edges, 132702 markings/sec, 465 secs
lola: 63295095 markings, 103458526 edges, 136514 markings/sec, 470 secs
lola: 63957283 markings, 104540869 edges, 132438 markings/sec, 475 secs
lola: 64625271 markings, 105632842 edges, 133598 markings/sec, 480 secs
lola: 65291282 markings, 106721302 edges, 133202 markings/sec, 485 secs
lola: 65953089 markings, 107803037 edges, 132361 markings/sec, 490 secs
lola: 66594038 markings, 108850962 edges, 128190 markings/sec, 495 secs
lola: 67249696 markings, 109922653 edges, 131132 markings/sec, 500 secs
lola: 67904255 markings, 110992467 edges, 130912 markings/sec, 505 secs
lola: 68547092 markings, 112043138 edges, 128567 markings/sec, 510 secs
lola: 69194390 markings, 113101235 edges, 129460 markings/sec, 515 secs
lola: 69863520 markings, 114194948 edges, 133826 markings/sec, 520 secs
lola: 70528778 markings, 115282375 edges, 133052 markings/sec, 525 secs
lola: 71195676 markings, 116372541 edges, 133380 markings/sec, 530 secs
lola: 71865907 markings, 117467827 edges, 134046 markings/sec, 535 secs
lola: 72525627 markings, 118546219 edges, 131944 markings/sec, 540 secs
lola: 73167224 markings, 119595044 edges, 128319 markings/sec, 545 secs
lola: 73813186 markings, 120650750 edges, 129192 markings/sec, 550 secs
lola: 74453577 markings, 121697655 edges, 128078 markings/sec, 555 secs
lola: 75088040 markings, 122734625 edges, 126893 markings/sec, 560 secs
lola: 75734348 markings, 123791175 edges, 129262 markings/sec, 565 secs
lola: 76392120 markings, 124866189 edges, 131554 markings/sec, 570 secs
lola: 77047928 markings, 125938116 edges, 131162 markings/sec, 575 secs
lola: 77733221 markings, 127058256 edges, 137059 markings/sec, 580 secs
lola: 78356042 markings, 128076162 edges, 124564 markings/sec, 585 secs
lola: 78977747 markings, 129092608 edges, 124341 markings/sec, 590 secs
lola: 79611966 markings, 130129158 edges, 126844 markings/sec, 595 secs
lola: 80303242 markings, 131259117 edges, 138255 markings/sec, 600 secs
lola: 80990944 markings, 132383241 edges, 137540 markings/sec, 605 secs
lola: 81638516 markings, 133441708 edges, 129514 markings/sec, 610 secs
lola: 82284563 markings, 134497900 edges, 129209 markings/sec, 615 secs
lola: 82933961 markings, 135559294 edges, 129880 markings/sec, 620 secs
lola: 83602387 markings, 136651719 edges, 133685 markings/sec, 625 secs
lola: 84275100 markings, 137751351 edges, 134543 markings/sec, 630 secs
lola: 84948626 markings, 138852372 edges, 134705 markings/sec, 635 secs
lola: 85595288 markings, 139909362 edges, 129332 markings/sec, 640 secs
lola: 86244328 markings, 140970119 edges, 129808 markings/sec, 645 secs
lola: 86911129 markings, 142060101 edges, 133360 markings/sec, 650 secs
lola: 87586942 markings, 143164713 edges, 135163 markings/sec, 655 secs
lola: 88271516 markings, 144283670 edges, 136915 markings/sec, 660 secs
lola: 88964381 markings, 145416229 edges, 138573 markings/sec, 665 secs
lola: 89663627 markings, 146559082 edges, 139849 markings/sec, 670 secs
lola: 90355944 markings, 147690932 edges, 138463 markings/sec, 675 secs
lola: 91036435 markings, 148803125 edges, 136098 markings/sec, 680 secs
lola: 91718211 markings, 149917506 edges, 136355 markings/sec, 685 secs
lola: 92081883 markings, 150511878 edges, 72734 markings/sec, 690 secs
lola: 92082005 markings, 150512071 edges, 24 markings/sec, 695 secs
lola: 92082505 markings, 150512728 edges, 100 markings/sec, 700 secs
lola: Child process aborted or communication problem between parent and child process
lola: ========================================
lola: ...considering subproblem: ((A (G ((p173 + 1 <= p118))) AND A (((p181 <= p85) U (1 <= p486)))) OR A (((p190 <= p202) U (2 <= p295))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: ...considering subproblem: A (G ((p173 + 1 <= p118)))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:788
lola: processed formula: A (G ((p173 + 1 <= p118)))
lola: processed formula length: 26
lola: 25 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 0 markings, 0 edges
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: (p118 <= p173)
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: ========================================
lola: ========================================
lola: ...considering subproblem: A (((p190 <= p202) U (2 <= p295)))
lola: ========================================
lola: SUBTASK
lola: checking universal until
lola: rewrite Frontend/Parser/formula_rewrite.k:577
lola: rewrite Frontend/Parser/formula_rewrite.k:735
lola: rewrite Frontend/Parser/formula_rewrite.k:695
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: A (((p190 <= p202) U (2 <= p295)))
lola: processed formula length: 34
lola: 28 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /ER)
lola: state space: using reachability graph (ER version) (--search=depth)
lola: state space: using ltl preserving stubborn set method (--stubborn=tarjan)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: 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: (p190 <= p202)
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to CTLCardinality-21-0.sara
lola: state equation: calling and running sara
lola: 1
lola: SUBRESULT
lola: result: no
lola: produced by: state space /ER
lola: Predicate Phi does not hild until Predicate Psi on all paths.
lola: 214 markings, 214 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: RESULT
lola:
SUMMARY: yes yes no no no no no unknown no unknown no yes unknown no unknown no
lola:
preliminary result: yes yes no no no no no unknown no unknown no yes unknown no unknown no
lola: ========================================
lola: memory consumption: 28604 KB
lola: time consumption: 2110 seconds
lola: print data as JSON (--json)
lola: writing JSON to CTLCardinality.json
lola: closed JSON file CTLCardinality.json
rslt: finished

BK_STOP 1552687757634

--------------------
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="JoinFreeModules-PT-0100"
export BK_EXAMINATION="CTLCardinality"
export BK_TOOL="lola"
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-3954"
echo " Executing tool lola"
echo " Input is JoinFreeModules-PT-0100, examination is CTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r082-csrt-155246550300949"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/JoinFreeModules-PT-0100.tgz
mv JoinFreeModules-PT-0100 execution
cd execution
if [ "CTLCardinality" = "GlobalProperties" ] ; then
rm -f GenericPropertiesVerdict.xml
fi
if [ "CTLCardinality" = "UpperBounds" ] ; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "CTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "CTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' CTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
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 ;