Execution Chart

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

Trace from the execution

Formatting '/data/fko/mcc2019-input.r170-oct2-155297750000018.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fko/mcc2019-input.qcow2 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 SquareGrid-PT-040204, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r170-oct2-155297750000018
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 296K
-rw-r--r-- 1 mcc users 3.6K Feb 12 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 19K Feb 12 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.8K Feb 9 02:17 CTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 9 02:17 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 10 17:31 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 5.9K Mar 10 17:31 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 107 Feb 24 15:05 GlobalProperties.txt
-rw-r--r-- 1 mcc users 345 Feb 24 15:05 GlobalProperties.xml
-rw-r--r-- 1 mcc users 2.6K Feb 5 01:38 LTLCardinality.txt
-rw-r--r-- 1 mcc users 12K Feb 5 01:38 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K Feb 4 22:48 LTLFireability.txt
-rw-r--r-- 1 mcc users 7.8K Feb 4 22:48 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.9K Feb 4 20:46 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 19K Feb 4 20:46 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.4K Feb 1 21:06 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 20K Feb 1 21:06 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 4 22:30 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 4 22:30 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jan 29 09:35 equiv_col
-rw-r--r-- 1 mcc users 7 Jan 29 09:35 instance
-rw-r--r-- 1 mcc users 6 Jan 29 09:35 iscolored
-rwxr-xr-x 1 mcc users 130K 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 SquareGrid-PT-040204-ReachabilityFireability-00
FORMULA_NAME SquareGrid-PT-040204-ReachabilityFireability-01
FORMULA_NAME SquareGrid-PT-040204-ReachabilityFireability-02
FORMULA_NAME SquareGrid-PT-040204-ReachabilityFireability-03
FORMULA_NAME SquareGrid-PT-040204-ReachabilityFireability-04
FORMULA_NAME SquareGrid-PT-040204-ReachabilityFireability-05
FORMULA_NAME SquareGrid-PT-040204-ReachabilityFireability-06
FORMULA_NAME SquareGrid-PT-040204-ReachabilityFireability-07
FORMULA_NAME SquareGrid-PT-040204-ReachabilityFireability-08
FORMULA_NAME SquareGrid-PT-040204-ReachabilityFireability-09
FORMULA_NAME SquareGrid-PT-040204-ReachabilityFireability-10
FORMULA_NAME SquareGrid-PT-040204-ReachabilityFireability-11
FORMULA_NAME SquareGrid-PT-040204-ReachabilityFireability-12
FORMULA_NAME SquareGrid-PT-040204-ReachabilityFireability-13
FORMULA_NAME SquareGrid-PT-040204-ReachabilityFireability-14
FORMULA_NAME SquareGrid-PT-040204-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1553105279114

info: Time: 3600 - MCC
vrfy: Checking ReachabilityFireability @ SquareGrid-PT-040204 @ 3570 seconds

FORMULA SquareGrid-PT-040204-ReachabilityFireability-08 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA SquareGrid-PT-040204-ReachabilityFireability-01 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA SquareGrid-PT-040204-ReachabilityFireability-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA SquareGrid-PT-040204-ReachabilityFireability-05 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA SquareGrid-PT-040204-ReachabilityFireability-07 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA SquareGrid-PT-040204-ReachabilityFireability-09 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA SquareGrid-PT-040204-ReachabilityFireability-06 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA SquareGrid-PT-040204-ReachabilityFireability-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA SquareGrid-PT-040204-ReachabilityFireability-00 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA SquareGrid-PT-040204-ReachabilityFireability-02 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA SquareGrid-PT-040204-ReachabilityFireability-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA SquareGrid-PT-040204-ReachabilityFireability-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA SquareGrid-PT-040204-ReachabilityFireability-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA SquareGrid-PT-040204-ReachabilityFireability-04 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA SquareGrid-PT-040204-ReachabilityFireability-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA SquareGrid-PT-040204-ReachabilityFireability-03 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 3542
rslt: Output for ReachabilityFireability @ SquareGrid-PT-040204

{
"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=ReachabilityFireability.xml",
"--mcc",
"--donotcomputecapacities",
"--encoder=simplecompressed",
"--check=modelchecking",
"--stubborn=tarjan",
"--stateequation=par",
"--timelimit=3570",
"--localtimelimit=0",
"--json=ReachabilityFireability.json",
"--jsoninclude=formula,formulastat,net"
],
"starttime": "Wed Mar 20 18:07:59 2019
",
"timelimit": 3570
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 222
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 0,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 0,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 1,
"unfir": 1,
"visible_places": 0,
"visible_transitions": 1
},
"processed": "A (G (NOT FIREABLE(t2i1_4_4)))",
"processed_size": 30,
"rewrites": 2
},
"result":
{
"edges": 2,
"markings": 3,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 0,
"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": 237
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 1,
"aneg": 0,
"comp": 0,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 0,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 2,
"unfir": 2,
"visible_places": 0,
"visible_transitions": 2
},
"processed": "A (G ((NOT FIREABLE(t2i3_3_4) OR NOT FIREABLE(t3i2_4_1))))",
"processed_size": 59,
"rewrites": 2
},
"result":
{
"edges": 4,
"markings": 5,
"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": 4,
"problems": 4
},
"type": "invariance",
"workflow": "stateequation||search"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 274
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 1,
"aneg": 0,
"comp": 0,
"cont": 0,
"dl": 0,
"fir": 3,
"nodl": 0,
"place_references": 0,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 3,
"unfir": 0,
"visible_places": 0,
"visible_transitions": 3
},
"processed": "E (F (((FIREABLE(t4i1_4_2) OR FIREABLE(t3i2_1_3)) AND FIREABLE(t3i4_4_2))))",
"processed_size": 76,
"rewrites": 1
},
"result":
{
"edges": 3,
"markings": 4,
"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": 8,
"problems": 2
},
"type": "reachability",
"workflow": "stateequation||search"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 324
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 0,
"cont": 0,
"dl": 0,
"fir": 4,
"nodl": 0,
"place_references": 0,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 4,
"unfir": 0,
"visible_places": 0,
"visible_transitions": 4
},
"processed": "E (F ((FIREABLE(t1i4_1_3) AND FIREABLE(t1o_3_4) AND FIREABLE(t4i2_4_2) AND FIREABLE(t2o_2_4))))",
"processed_size": 95,
"rewrites": 1
},
"result":
{
"edges": 3,
"markings": 4,
"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": 8,
"problems": 8
},
"type": "reachability",
"workflow": "stateequation||search"
}
},

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

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 445
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 1,
"aneg": 0,
"comp": 0,
"cont": 0,
"dl": 0,
"fir": 3,
"nodl": 0,
"place_references": 0,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 5,
"unfir": 2,
"visible_places": 0,
"visible_transitions": 5
},
"processed": "E (F ((FIREABLE(t4i1_2_1) AND FIREABLE(t2i4_2_3) AND (NOT FIREABLE(t2i1_3_3) OR NOT FIREABLE(t1i2_3_3)) AND FIREABLE(t4i2_2_1))))",
"processed_size": 130,
"rewrites": 1
},
"result":
{
"edges": 3,
"markings": 4,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 8,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 28,
"problems": 4
},
"type": "reachability",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 509
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 1,
"aneg": 0,
"comp": 0,
"cont": 0,
"dl": 0,
"fir": 4,
"nodl": 0,
"place_references": 0,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 6,
"unfir": 2,
"visible_places": 0,
"visible_transitions": 6
},
"processed": "A (G ((FIREABLE(t3i1_2_3) OR NOT FIREABLE(t2i4_3_4) OR FIREABLE(t4i2_3_3) OR (FIREABLE(t4o_3_1) AND FIREABLE(t2o_2_1) AND NOT FIREABLE(t4i2_2_1)))))",
"processed_size": 151,
"rewrites": 2
},
"result":
{
"edges": 3,
"markings": 4,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 9,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 104,
"problems": 20
},
"type": "invariance",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 594
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 2,
"adisj": 1,
"aneg": 0,
"comp": 0,
"cont": 0,
"dl": 0,
"fir": 2,
"nodl": 0,
"place_references": 0,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 6,
"unfir": 4,
"visible_places": 0,
"visible_transitions": 6
},
"processed": "E (F ((NOT FIREABLE(t2o_3_4) AND NOT FIREABLE(t2i3_1_1) AND FIREABLE(t4i2_4_4) AND (FIREABLE(t2i4_4_1) OR (NOT FIREABLE(t2o_2_1) AND NOT FIREABLE(t4i1_1_2))))))",
"processed_size": 161,
"rewrites": 1
},
"result":
{
"edges": 3,
"markings": 4,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 10,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 120,
"problems": 20
},
"type": "reachability",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 713
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 2,
"adisj": 1,
"aneg": 0,
"comp": 0,
"cont": 0,
"dl": 0,
"fir": 3,
"nodl": 0,
"place_references": 0,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 6,
"unfir": 3,
"visible_places": 0,
"visible_transitions": 6
},
"processed": "E (F ((FIREABLE(t2i4_1_4) AND (NOT FIREABLE(t1i3_4_1) OR NOT FIREABLE(t4o_4_4) OR (FIREABLE(t3i1_3_2) AND FIREABLE(t2o_3_2) AND NOT FIREABLE(t1i2_4_2))))))",
"processed_size": 157,
"rewrites": 1
},
"result":
{
"edges": 2,
"markings": 3,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 11,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 26,
"problems": 6
},
"type": "reachability",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 891
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 2,
"aneg": 0,
"comp": 0,
"cont": 0,
"dl": 0,
"fir": 6,
"nodl": 0,
"place_references": 0,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 8,
"unfir": 2,
"visible_places": 0,
"visible_transitions": 8
},
"processed": "E (F (((FIREABLE(t3i4_2_3) OR FIREABLE(t1i3_2_3) OR NOT FIREABLE(t3i2_3_4)) AND (FIREABLE(t4i1_3_3) OR FIREABLE(t4i3_3_3) OR FIREABLE(t3i4_2_2)) AND NOT FIREABLE(t3i1_3_3) AND FIREABLE(t4i1_1_1))))",
"processed_size": 201,
"rewrites": 1
},
"result":
{
"edges": 3,
"markings": 4,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 12,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 104,
"problems": 16
},
"type": "reachability",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1188
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 2,
"adisj": 2,
"aneg": 0,
"comp": 0,
"cont": 0,
"dl": 0,
"fir": 3,
"nodl": 0,
"place_references": 0,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 8,
"unfir": 5,
"visible_places": 0,
"visible_transitions": 8
},
"processed": "A (G ((NOT FIREABLE(t4i3_3_3) OR NOT FIREABLE(t3i4_1_1) OR FIREABLE(t2o_2_4) OR (NOT FIREABLE(t4i1_3_2) AND NOT FIREABLE(t4i1_2_2) AND (NOT FIREABLE(t3i1_2_2) OR (FIREABLE(t2i3_2_3) AND FIREABLE(t3i4_3_2)))))))",
"processed_size": 214,
"rewrites": 2
},
"result":
{
"edges": 4,
"markings": 5,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 13,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 92,
"problems": 12
},
"type": "invariance",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1783
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 3,
"adisj": 3,
"aneg": 0,
"comp": 0,
"cont": 0,
"dl": 0,
"fir": 12,
"nodl": 0,
"place_references": 0,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 12,
"unfir": 0,
"visible_places": 0,
"visible_transitions": 12
},
"processed": "E (F ((FIREABLE(t3i4_2_1) AND FIREABLE(tf_u_4) AND FIREABLE(t1i4_2_1) AND (FIREABLE(t3i4_1_2) OR FIREABLE(t3i1_3_3) OR FIREABLE(t4o_2_4)) AND ((FIREABLE(t2o_2_2) AND FIREABLE(t3o_3_4)) OR FIREABLE(t4o_4_3) OR ((FIREABLE(t2i3_3_4) OR FIREABLE(t3o_4_4)) AND FIREABLE(t1i2_3_1))))))",
"processed_size": 284,
"rewrites": 1
},
"result":
{
"edges": 3,
"markings": 4,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 14,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 138,
"problems": 12
},
"type": "reachability",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3566
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 3,
"adisj": 2,
"aneg": 0,
"comp": 0,
"cont": 0,
"dl": 0,
"fir": 12,
"nodl": 0,
"place_references": 0,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 13,
"unfir": 1,
"visible_places": 0,
"visible_transitions": 13
},
"processed": "E (F ((FIREABLE(t2i3_4_2) AND FIREABLE(t4i3_3_2) AND FIREABLE(t1o_4_3) AND FIREABLE(t4i2_2_4) AND (FIREABLE(t3i1_3_2) OR (FIREABLE(t1i2_3_1) AND FIREABLE(t3o_3_3))) AND FIREABLE(t2i4_3_1) AND FIREABLE(t2i3_3_2) AND FIREABLE(t3i1_3_1) AND (NOT FIREABLE(t1i2_2_3) OR (FIREABLE(t1i4_2_3) AND FIREABLE(t3i2_4_1))))))",
"processed_size": 314,
"rewrites": 1
},
"result":
{
"edges": 7,
"markings": 8,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 15,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 114,
"problems": 6
},
"type": "reachability",
"workflow": "stateequation||search"
}
}
],
"exit":
{
"error": null,
"memory": 15924,
"runtime": 4.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "ReachabilityFireability.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "E(F(**)) : A(G(**)) : A(G(**)) : E(F(**)) : A(G(**)) : E(F(**)) : E(F(**)) : E(F(**)) : A(G(**)) : E(F(**)) : A(G(**)) : E(F(**)) : E(F(**)) : A(G(**)) : E(F(**)) : E(F(**))"
},
"net":
{
"arcs": 1088,
"conflict_clusters": 96,
"places": 240,
"places_significant": 143,
"singleton_clusters": 0,
"transitions": 272
},
"result":
{
"preliminary_value": "yes no no yes no yes yes yes no yes no yes yes no yes yes ",
"value": "yes no no yes no yes yes yes no yes no yes yes no yes yes "
},
"task":
{
"type": "compound"
}
}
lola: LoLA will run for 3570 seconds at most (--timelimit)
lola: NET
lola: input: PNML file (--pnml)
lola: reading net from model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file model.pnml
lola: 512/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 7680
lola: finding significant places
lola: 240 places, 272 transitions, 143 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 ReachabilityFireability.xml
lola: E (F ((FIREABLE(t4i1_2_1) AND FIREABLE(t2i4_2_3) AND (NOT FIREABLE(t2i1_3_3) OR NOT FIREABLE(t1i2_3_3)) AND FIREABLE(t4i2_2_1)))) : A (G ((NOT FIREABLE(t2i3_3_4) OR NOT FIREABLE(t3i2_4_1)))) : A (G ((FIREABLE(t3i1_2_3) OR NOT FIREABLE(t2i4_3_4) OR FIREABLE(t4i2_3_3) OR (FIREABLE(t4o_3_1) AND FIREABLE(t2o_2_1) AND NOT FIREABLE(t4i2_2_1))))) : E (F ((FIREABLE(t2i3_4_2) AND FIREABLE(t4i3_3_2) AND FIREABLE(t1o_4_3) AND FIREABLE(t4i2_2_4) AND (FIREABLE(t3i1_3_2) OR (FIREABLE(t1i2_3_1) AND FIREABLE(t3o_3_3))) AND FIREABLE(t2i4_3_1) AND FIREABLE(t2i3_3_2) AND FIREABLE(t3i1_3_1) AND (NOT FIREABLE(t1i2_2_3) OR (FIREABLE(t1i4_2_3) AND FIREABLE(t3i2_4_1)))))) : A (G ((NOT FIREABLE(t4i3_3_3) OR NOT FIREABLE(t3i4_1_1) OR FIREABLE(t2o_2_4) OR (NOT FIREABLE(t4i1_3_2) AND NOT FIREABLE(t4i1_2_2) AND (NOT FIREABLE(t3i1_2_2) OR (FIREABLE(t2i3_2_3) AND FIREABLE(t3i4_3_2))))))) : E (F (((FIREABLE(t4i1_4_2) OR FIREABLE(t3i2_1_3)) AND FIREABLE(t3i4_4_2)))) : E (F ((FIREABLE(t4i1_3_3) AND FIREABLE(t1i4_2_4) AND (FIREABLE(t1i2_4_2) OR FIREABLE(tf_d_1))))) : E (F ((FIREABLE(t4i2_1_4) AND FIREABLE(t2i3_1_3) AND NOT FIREABLE(t4o_4_4)))) : A (G (NOT FIREABLE(t2i1_4_4))) : E (F ((FIREABLE(t1i4_1_3) AND FIREABLE(t1o_3_4) AND FIREABLE(t4i2_4_2) AND FIREABLE(t2o_2_4)))) : A (G ((NOT FIREABLE(t3i1_4_1) OR NOT FIREABLE(tf_l_4) OR NOT FIREABLE(t4i1_4_2) OR FIREABLE(t3i2_3_4) OR FIREABLE(t2o_3_4)))) : E (F (((FIREABLE(t3i4_2_3) OR FIREABLE(t1i3_2_3) OR NOT FIREABLE(t3i2_3_4)) AND (FIREABLE(t4i1_3_3) OR FIREABLE(t4i3_3_3) OR FIREABLE(t3i4_2_2)) AND NOT FIREABLE(t3i1_3_3) AND FIREABLE(t4i1_1_1)))) : E (F ((FIREABLE(t3i4_2_1) AND FIREABLE(tf_u_4) AND FIREABLE(t1i4_2_1) AND (FIREABLE(t3i4_1_2) OR FIREABLE(t3i1_3_3) OR FIREABLE(t4o_2_4)) AND ((FIREABLE(t2o_2_2) AND FIREABLE(t3o_3_4)) OR FIREABLE(t4o_4_3) OR ((FIREABLE(t2i3_3_4) OR FIREABLE(t3o_4_4)) AND FIREABLE(t1i2_3_1)))))) : A (G ((NOT FIREABLE(t2i3_4_3) OR NOT FIREABLE(t2i3_4_4)))) : E (F ((NOT FIREABLE(t2o_3_4) AND NOT FIREABLE(t2i3_1_1) AND FIREABLE(t4i2_4_4) AND (FIREABLE(t2i4_4_1) OR (NOT FIREABLE(t2o_2_1) AND NOT FIREABLE(t4i1_1_2)))))) : E (F ((FIREABLE(t2i4_1_4) AND (NOT FIREABLE(t1i3_4_1) OR NOT FIREABLE(t4o_4_4) OR (FIREABLE(t3i1_3_2) AND FIREABLE(t2o_3_2) AND NOT FIREABLE(t1i2_4_2))))))
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 222 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (NOT FIREABLE(t2i1_4_4)))
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 (NOT FIREABLE(t2i1_4_4)))
lola: processed formula length: 30
lola: 2 rewrites
lola: closed formula file ReachabilityFireability.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: FIREABLE(t2i1_4_4)
lola: state equation task get result unparse finished id 0
lola: SUBRESULT
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 3 markings, 2 edges
lola: ========================================
lola: subprocess 1 will run for 237 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((NOT FIREABLE(t2i3_3_4) OR NOT FIREABLE(t3i2_4_1))))
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 ((NOT FIREABLE(t2i3_3_4) OR NOT FIREABLE(t3i2_4_1))))
lola: processed formula length: 59
lola: 2 rewrites
lola: closed formula file ReachabilityFireability.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: (FIREABLE(t2i3_3_4) AND FIREABLE(t3i2_4_1))
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: state equation task get result unparse finished id 0
lola: The predicate is not invariant.
lola: state equation: Generated DNF with 4 literals and 1 conjunctive subformulas
lola: 5 markings, 4 edges
lola: ========================================
lola: subprocess 2 will run for 254 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((NOT FIREABLE(t2i3_4_3) OR NOT FIREABLE(t2i3_4_4))))
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 ((NOT FIREABLE(t2i3_4_3) OR NOT FIREABLE(t2i3_4_4))))
lola: processed formula length: 59
lola: 2 rewrites
lola: closed formula file ReachabilityFireability.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: (FIREABLE(t2i3_4_3) AND FIREABLE(t2i3_4_4))
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: 4 markings, 3 edges
lola: state equation: Generated DNF with 4 literals and 1 conjunctive subformulas
lola: ========================================
lola: subprocess 3 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((FIREABLE(t4i1_4_2) OR FIREABLE(t3i2_1_3)) AND FIREABLE(t3i4_4_2))))
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 (((FIREABLE(t4i1_4_2) OR FIREABLE(t3i2_1_3)) AND FIREABLE(t3i4_4_2))))
lola: processed formula length: 76
lola: 1 rewrites
lola: closed formula file ReachabilityFireability.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: ((FIREABLE(t4i1_4_2) OR FIREABLE(t3i2_1_3)) AND FIREABLE(t3i4_4_2))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 8 literals and 2 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 4 markings, 3 edges
lola: ========================================
lola: subprocess 4 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(t4i2_1_4) AND FIREABLE(t2i3_1_3) AND NOT FIREABLE(t4o_4_4))))
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 ((FIREABLE(t4i2_1_4) AND FIREABLE(t2i3_1_3) AND NOT FIREABLE(t4o_4_4))))
lola: processed formula length: 77
lola: 1 rewrites
lola: closed formula file ReachabilityFireability.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: (FIREABLE(t4i2_1_4) AND FIREABLE(t2i3_1_3) AND NOT FIREABLE(t4o_4_4))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 10 literals and 2 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 4 markings, 3 edges
lola: ========================================
lola: subprocess 5 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(t1i4_1_3) AND FIREABLE(t1o_3_4) AND FIREABLE(t4i2_4_2) AND FIREABLE(t2o_2_4))))
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 ((FIREABLE(t1i4_1_3) AND FIREABLE(t1o_3_4) AND FIREABLE(t4i2_4_2) AND FIREABLE(t2o_2_4))))
lola: processed formula length: 95
lola: 1 rewrites
lola: closed formula file ReachabilityFireability.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: (FIREABLE(t1i4_1_3) AND FIREABLE(t1o_3_4) AND FIREABLE(t4i2_4_2) AND FIREABLE(t2o_2_4))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 8 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 4 markings, 3 edges
lola: ========================================
lola: subprocess 6 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(t4i1_3_3) AND FIREABLE(t1i4_2_4) AND (FIREABLE(t1i2_4_2) OR FIREABLE(tf_d_1)))))
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 ((FIREABLE(t4i1_3_3) AND FIREABLE(t1i4_2_4) AND (FIREABLE(t1i2_4_2) OR FIREABLE(tf_d_1)))))
lola: processed formula length: 97
lola: 1 rewrites
lola: closed formula file ReachabilityFireability.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: (FIREABLE(t4i1_3_3) AND FIREABLE(t1i4_2_4) AND (FIREABLE(t1i2_4_2) OR FIREABLE(tf_d_1)))
lola: state equation task get result unparse finished id 0
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 4 markings, 3 edges
lola: state equation: Generated DNF with 12 literals and 2 conjunctive subformulas
lola: ========================================
lola: subprocess 7 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((NOT FIREABLE(t3i1_4_1) OR NOT FIREABLE(tf_l_4) OR NOT FIREABLE(t4i1_4_2) OR FIREABLE(t3i2_3_4) OR FIREABLE(t2o_3_4))))
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 ((NOT FIREABLE(t3i1_4_1) OR NOT FIREABLE(tf_l_4) OR NOT FIREABLE(t4i1_4_2) OR FIREABLE(t3i2_3_4) OR FIREABLE(t2o_3_4))))
lola: processed formula length: 129
lola: 2 rewrites
lola: closed formula file ReachabilityFireability.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: (FIREABLE(t3i1_4_1) AND FIREABLE(tf_l_4) AND FIREABLE(t4i1_4_2) AND NOT FIREABLE(t3i2_3_4) AND NOT FIREABLE(t2o_3_4))
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 6 markings, 5 edges
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 32 literals and 4 conjunctive subformulas
lola: ========================================
lola: subprocess 8 will run for 445 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(t4i1_2_1) AND FIREABLE(t2i4_2_3) AND (NOT FIREABLE(t2i1_3_3) OR NOT FIREABLE(t1i2_3_3)) AND FIREABLE(t4i2_2_1))))
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 ((FIREABLE(t4i1_2_1) AND FIREABLE(t2i4_2_3) AND (NOT FIREABLE(t2i1_3_3) OR NOT FIREABLE(t1i2_3_3)) AND FIREABLE(t4i2_2_1))))
lola: processed formula length: 130
lola: 1 rewrites
lola: closed formula file ReachabilityFireability.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: (FIREABLE(t4i1_2_1) AND FIREABLE(t2i4_2_3) AND (NOT FIREABLE(t2i1_3_3) OR NOT FIREABLE(t1i2_3_3)) AND FIREABLE(t4i2_2_1))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 28 literals and 4 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 4 markings, 3 edges
lola: ========================================
lola: subprocess 9 will run for 509 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((FIREABLE(t3i1_2_3) OR NOT FIREABLE(t2i4_3_4) OR FIREABLE(t4i2_3_3) OR (FIREABLE(t4o_3_1) AND FIREABLE(t2o_2_1) AND NOT FIREABLE(t4i2_2_1)))))
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 ((FIREABLE(t3i1_2_3) OR NOT FIREABLE(t2i4_3_4) OR FIREABLE(t4i2_3_3) OR (FIREABLE(t4o_3_1) AND FIREABLE(t2o_2_1) AND NOT FIREABLE(t4i2_2_1)))))
lola: processed formula length: 151
lola: 2 rewrites
lola: closed formula file ReachabilityFireability.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: (NOT FIREABLE(t3i1_2_3) AND FIREABLE(t2i4_3_4) AND NOT FIREABLE(t4i2_3_3) AND (NOT FIREABLE(t4o_3_1) OR NOT FIREABLE(t2o_2_1) OR FIREABLE(t4i2_2_1)))
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 4 markings, 3 edges
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 104 literals and 20 conjunctive subformulas
lola: ========================================
lola: subprocess 10 will run for 594 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((NOT FIREABLE(t2o_3_4) AND NOT FIREABLE(t2i3_1_1) AND FIREABLE(t4i2_4_4) AND (FIREABLE(t2i4_4_1) OR (NOT FIREABLE(t2o_2_1) AND NOT FIREABLE(t4i1_1_2))))))
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 ((NOT FIREABLE(t2o_3_4) AND NOT FIREABLE(t2i3_1_1) AND FIREABLE(t4i2_4_4) AND (FIREABLE(t2i4_4_1) OR (NOT FIREABLE(t2o_2_1) AND NOT FIREABLE(t4i1_1_2))))))
lola: processed formula length: 161
lola: 1 rewrites
lola: closed formula file ReachabilityFireability.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: (NOT FIREABLE(t2o_3_4) AND NOT FIREABLE(t2i3_1_1) AND FIREABLE(t4i2_4_4) AND (FIREABLE(t2i4_4_1) OR (NOT FIREABLE(t2o_2_1) AND NOT FIREABLE(t4i1_1_2))))
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: state equation task get result unparse finished id 0
lola: The predicate is reachable.
lola: 4 markings, 3 edges
lola: state equation: Generated DNF with 120 literals and 20 conjunctive subformulas
lola: ========================================
lola: subprocess 11 will run for 713 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(t2i4_1_4) AND (NOT FIREABLE(t1i3_4_1) OR NOT FIREABLE(t4o_4_4) OR (FIREABLE(t3i1_3_2) AND FIREABLE(t2o_3_2) AND NOT FIREABLE(t1i2_4_2))))))
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 ((FIREABLE(t2i4_1_4) AND (NOT FIREABLE(t1i3_4_1) OR NOT FIREABLE(t4o_4_4) OR (FIREABLE(t3i1_3_2) AND FIREABLE(t2o_3_2) AND NOT FIREABLE(t1i2_4_2))))))
lola: processed formula length: 157
lola: 1 rewrites
lola: closed formula file ReachabilityFireability.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: (FIREABLE(t2i4_1_4) AND (NOT FIREABLE(t1i3_4_1) OR NOT FIREABLE(t4o_4_4) OR (FIREABLE(t3i1_3_2) AND FIREABLE(t2o_3_2) AND NOT FIREABLE(t1i2_4_2))))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 26 literals and 6 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 12 will run for 891 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((FIREABLE(t3i4_2_3) OR FIREABLE(t1i3_2_3) OR NOT FIREABLE(t3i2_3_4)) AND (FIREABLE(t4i1_3_3) OR FIREABLE(t4i3_3_3) OR FIREABLE(t3i4_2_2)) AND NOT FIREABLE(t3i1_3_3) AND FIREABLE(t4i1_1_1))))
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 (((FIREABLE(t3i4_2_3) OR FIREABLE(t1i3_2_3) OR NOT FIREABLE(t3i2_3_4)) AND (FIREABLE(t4i1_3_3) OR FIREABLE(t4i3_3_3) OR FIREABLE(t3i4_2_2)) AND NOT FIREABLE(t3i1_3_3) AND FIREABLE(t4i1_1_1))))
lola: processed formula length: 201
lola: 1 rewrites
lola: closed formula file ReachabilityFireability.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: ((FIREABLE(t3i4_2_3) OR FIREABLE(t1i3_2_3) OR NOT FIREABLE(t3i2_3_4)) AND (FIREABLE(t4i1_3_3) OR FIREABLE(t4i3_3_3) OR FIREABLE(t3i4_2_2)) AND NOT FIREABLE(t3i1_3_3) AND FIREABLE(t4i1_1_1))
lola: state equation task get result unparse finished id 0
lola: SUBRESULT
lola: state equation: Generated DNF with 104 literals and 16 conjunctive subformulas
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 4 markings, 3 edges
lola: ========================================
lola: subprocess 13 will run for 1188 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((NOT FIREABLE(t4i3_3_3) OR NOT FIREABLE(t3i4_1_1) OR FIREABLE(t2o_2_4) OR (NOT FIREABLE(t4i1_3_2) AND NOT FIREABLE(t4i1_2_2) AND (NOT FIREABLE(t3i1_2_2) OR (FIREABLE(t2i3_2_3) AND FIREABLE(t3i4_3_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:787
lola: processed formula: A (G ((NOT FIREABLE(t4i3_3_3) OR NOT FIREABLE(t3i4_1_1) OR FIREABLE(t2o_2_4) OR (NOT FIREABLE(t4i1_3_2) AND NOT FIREABLE(t4i1_2_2) AND (NOT FIREABLE(t3i1_2_2) OR (FIREABLE(t2i3_2_3) AND FIREABLE(t3i4_3_2)))))))
lola: processed formula length: 214
lola: 2 rewrites
lola: closed formula file ReachabilityFireability.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: (FIREABLE(t4i3_3_3) AND FIREABLE(t3i4_1_1) AND NOT FIREABLE(t2o_2_4) AND (FIREABLE(t4i1_3_2) OR FIREABLE(t4i1_2_2) OR (FIREABLE(t3i1_2_2) AND (NOT FIREABLE(t2i3_2_3) OR NOT FIREABLE(t3i4_3_2)))))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 92 literals and 12 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 5 markings, 4 edges
lola: ========================================
lola: subprocess 14 will run for 1783 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(t3i4_2_1) AND FIREABLE(tf_u_4) AND FIREABLE(t1i4_2_1) AND (FIREABLE(t3i4_1_2) OR FIREABLE(t3i1_3_3) OR FIREABLE(t4o_2_4)) AND ((FIREABLE(t2o_2_2) AND FIREABLE(t3o_3_4)) OR FIREABLE(t4o_4_3) OR ((FIREABLE(t2i3_3_4) OR FIREABLE(t3o_4_4)) AND FIREABLE(t1i2_3_1))))))
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 ((FIREABLE(t3i4_2_1) AND FIREABLE(tf_u_4) AND FIREABLE(t1i4_2_1) AND (FIREABLE(t3i4_1_2) OR FIREABLE(t3i1_3_3) OR FIREABLE(t4o_2_4)) AND ((FIREABLE(t2o_2_2) AND FIREABLE(t3o_3_4)) OR FIREABLE(t4o_4_3) OR ((FIREABLE(t2i3_3_4) OR FIREABLE(t3o_4_4)) AND FIREABLE(t1i2_3_1))))))
lola: processed formula length: 284
lola: 1 rewrites
lola: closed formula file ReachabilityFireability.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: (FIREABLE(t3i4_2_1) AND FIREABLE(tf_u_4) AND FIREABLE(t1i4_2_1) AND (FIREABLE(t3i4_1_2) OR FIREABLE(t3i1_3_3) OR FIREABLE(t4o_2_4)) AND ((FIREABLE(t2o_2_2) AND FIREABLE(t3o_3_4)) OR FIREABLE(t4o_4_3) OR ((FIREABLE(t2i3_3_4) OR FIREABLE(t3o_4_4)) AND FIREABLE(t1i2_3_1))))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 138 literals and 12 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 4 markings, 3 edges
lola: ========================================
lola: subprocess 15 will run for 3566 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(t2i3_4_2) AND FIREABLE(t4i3_3_2) AND FIREABLE(t1o_4_3) AND FIREABLE(t4i2_2_4) AND (FIREABLE(t3i1_3_2) OR (FIREABLE(t1i2_3_1) AND FIREABLE(t3o_3_3))) AND FIREABLE(t2i4_3_1) AND FIREABLE(t2i3_3_2) AND FIREABLE(t3i1_3_1) AND (NOT FIREABLE(t1i2_2_3) OR (FIREABLE(t1i4_2_3) AND FIREABLE(t3i2_4_1))))))
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 ((FIREABLE(t2i3_4_2) AND FIREABLE(t4i3_3_2) AND FIREABLE(t1o_4_3) AND FIREABLE(t4i2_2_4) AND (FIREABLE(t3i1_3_2) OR (FIREABLE(t1i2_3_1) AND FIREABLE(t3o_3_3))) AND FIREABLE(t2i4_3_1) AND FIREABLE(t2i3_3_2) AND FIREABLE(t3i1_3_1) AND (NOT FIREABLE(t1i2_2_3) OR (FIREABLE(t1i4_2_3) AND FIREABLE(t3i2_4_1))))))
lola: processed formula length: 314
lola: 1 rewrites
lola: closed formula file ReachabilityFireability.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: (FIREABLE(t2i3_4_2) AND FIREABLE(t4i3_3_2) AND FIREABLE(t1o_4_3) AND FIREABLE(t4i2_2_4) AND (FIREABLE(t3i1_3_2) OR (FIREABLE(t1i2_3_1) AND FIREABLE(t3o_3_3))) AND FIREABLE(t2i4_3_1) AND FIREABLE(t2i3_3_2) AND FIREABLE(t3i1_3_1) AND (NOT FIREABLE(t1i2_2_3) OR (FIREABLE(t1i4_2_3) AND FIREABLE(t3i2_4_1))))
lola: state equation task get result unparse finished id 0
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: state equation: Generated DNF with 114 literals and 6 conjunctive subformulas
lola: The predicate is reachable.
lola: 8 markings, 7 edges
lola: ========================================
lola: RESULT
lola:
SUMMARY: yes no no yes no yes yes yes no yes no yes yes no yes yes
lola:
preliminary result: yes no no yes no yes yes yes no yes no yes yes no yes yes
lola: memory consumption: 15924 KB
lola: time consumption: 4 seconds
lola: print data as JSON (--json)
lola: writing JSON to ReachabilityFireability.json
lola: closed JSON file ReachabilityFireability.json
rslt: finished

BK_STOP 1553105307188

--------------------
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="SquareGrid-PT-040204"
export BK_EXAMINATION="ReachabilityFireability"
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 SquareGrid-PT-040204, examination is ReachabilityFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r170-oct2-155297750000018"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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