Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2020-input.r170-smll-158987815600266.qcow2', fmt=qcow2 size=4294967296 backing_file='/data/fkordon/mcc2020-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
.................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itslola
Input is FlexibleBarrier-PT-04b, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r170-smll-158987815600266
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 240K
-rw-r--r-- 1 mcc users 3.4K Apr 4 18:01 CTLCardinality.txt
-rw-r--r-- 1 mcc users 19K Apr 4 18:01 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Apr 4 06:12 CTLFireability.txt
-rw-r--r-- 1 mcc users 15K Apr 4 06:12 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 24 05:37 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.1K Mar 24 05:37 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.3K Apr 8 14:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Apr 28 14:01 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K Apr 8 14:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Apr 28 14:01 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K Apr 3 20:58 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 18K Apr 3 20:58 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Apr 3 13:15 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 15K Apr 3 13:15 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 4 01:37 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 4 01:37 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 24 05:37 instance
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 iscolored
-rw-r--r-- 1 mcc users 69K Mar 24 05:37 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1591329851473

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-05 04:04:14] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -timeout, 3600, -rebuildPNML]
[2020-06-05 04:04:14] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-05 04:04:14] [INFO ] Load time of PNML (sax parser for PT used): 144 ms
[2020-06-05 04:04:14] [INFO ] Transformed 268 places.
[2020-06-05 04:04:14] [INFO ] Transformed 305 transitions.
[2020-06-05 04:04:14] [INFO ] Found NUPN structural information;
[2020-06-05 04:04:14] [INFO ] Parsed PT model containing 268 places and 305 transitions in 231 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 42 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100000 steps, including 2389 resets, run finished after 546 ms. (steps per millisecond=183 ) properties seen :[1, 1, 1, 1, 1, 1, 1, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 1, 1, 1, 0, 1, 1, 1, 1]
// Phase 1: matrix 305 rows 268 cols
[2020-06-05 04:04:15] [INFO ] Computed 6 place invariants in 24 ms
[2020-06-05 04:04:15] [INFO ] [Real]Absence check using 6 positive place invariants in 43 ms returned sat
[2020-06-05 04:04:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 04:04:16] [INFO ] [Real]Absence check using state equation in 433 ms returned sat
[2020-06-05 04:04:16] [INFO ] Deduced a trap composed of 32 places in 371 ms
[2020-06-05 04:04:17] [INFO ] Deduced a trap composed of 105 places in 267 ms
[2020-06-05 04:04:17] [INFO ] Deduced a trap composed of 58 places in 205 ms
[2020-06-05 04:04:17] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1019 ms
[2020-06-05 04:04:17] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 04:04:20] [INFO ] [Nat]Absence check using 6 positive place invariants in 2533 ms returned sat
[2020-06-05 04:04:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-05 04:04:20] [INFO ] [Nat]Absence check using state equation in 286 ms returned sat
[2020-06-05 04:04:20] [INFO ] Deduced a trap composed of 32 places in 266 ms
[2020-06-05 04:04:20] [INFO ] Deduced a trap composed of 16 places in 240 ms
[2020-06-05 04:04:21] [INFO ] Deduced a trap composed of 79 places in 251 ms
[2020-06-05 04:04:21] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 858 ms
[2020-06-05 04:04:21] [INFO ] Computed and/alt/rep : 304/775/304 causal constraints in 53 ms.
[2020-06-05 04:04:23] [INFO ] Added : 285 causal constraints over 58 iterations in 2740 ms. Result :sat
[2020-06-05 04:04:24] [INFO ] [Real]Absence check using 6 positive place invariants in 24 ms returned sat
[2020-06-05 04:04:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 04:04:24] [INFO ] [Real]Absence check using state equation in 386 ms returned sat
[2020-06-05 04:04:24] [INFO ] Deduced a trap composed of 124 places in 232 ms
[2020-06-05 04:04:24] [INFO ] Deduced a trap composed of 51 places in 211 ms
[2020-06-05 04:04:25] [INFO ] Deduced a trap composed of 49 places in 211 ms
[2020-06-05 04:04:25] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 755 ms
[2020-06-05 04:04:25] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 04:04:27] [INFO ] [Nat]Absence check using 6 positive place invariants in 2225 ms returned sat
[2020-06-05 04:04:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-05 04:04:27] [INFO ] [Nat]Absence check using state equation in 258 ms returned sat
[2020-06-05 04:04:27] [INFO ] Deduced a trap composed of 124 places in 126 ms
[2020-06-05 04:04:28] [INFO ] Deduced a trap composed of 78 places in 140 ms
[2020-06-05 04:04:28] [INFO ] Deduced a trap composed of 49 places in 216 ms
[2020-06-05 04:04:28] [INFO ] Deduced a trap composed of 16 places in 234 ms
[2020-06-05 04:04:28] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 805 ms
[2020-06-05 04:04:28] [INFO ] Computed and/alt/rep : 304/775/304 causal constraints in 56 ms.
[2020-06-05 04:04:31] [INFO ] Added : 299 causal constraints over 60 iterations in 2736 ms. Result :sat
[2020-06-05 04:04:31] [INFO ] [Real]Absence check using 6 positive place invariants in 24 ms returned sat
[2020-06-05 04:04:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 04:04:31] [INFO ] [Real]Absence check using state equation in 416 ms returned sat
[2020-06-05 04:04:32] [INFO ] Deduced a trap composed of 32 places in 186 ms
[2020-06-05 04:04:32] [INFO ] Deduced a trap composed of 69 places in 181 ms
[2020-06-05 04:04:32] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 436 ms
[2020-06-05 04:04:32] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 04:04:35] [INFO ] [Nat]Absence check using 6 positive place invariants in 2721 ms returned sat
[2020-06-05 04:04:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-05 04:04:35] [INFO ] [Nat]Absence check using state equation in 342 ms returned sat
[2020-06-05 04:04:35] [INFO ] Deduced a trap composed of 32 places in 154 ms
[2020-06-05 04:04:35] [INFO ] Deduced a trap composed of 67 places in 202 ms
[2020-06-05 04:04:35] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 414 ms
[2020-06-05 04:04:36] [INFO ] Computed and/alt/rep : 304/775/304 causal constraints in 41 ms.
[2020-06-05 04:04:38] [INFO ] Added : 304 causal constraints over 61 iterations in 2769 ms. Result :sat
[2020-06-05 04:04:38] [INFO ] [Real]Absence check using 6 positive place invariants in 23 ms returned sat
[2020-06-05 04:04:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 04:04:39] [INFO ] [Real]Absence check using state equation in 395 ms returned sat
[2020-06-05 04:04:39] [INFO ] Deduced a trap composed of 32 places in 233 ms
[2020-06-05 04:04:39] [INFO ] Deduced a trap composed of 82 places in 218 ms
[2020-06-05 04:04:40] [INFO ] Deduced a trap composed of 67 places in 205 ms
[2020-06-05 04:04:40] [INFO ] Deduced a trap composed of 84 places in 176 ms
[2020-06-05 04:04:40] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 949 ms
[2020-06-05 04:04:40] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 04:04:42] [INFO ] [Nat]Absence check using 6 positive place invariants in 2384 ms returned sat
[2020-06-05 04:04:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-05 04:04:43] [INFO ] [Nat]Absence check using state equation in 279 ms returned sat
[2020-06-05 04:04:43] [INFO ] Deduced a trap composed of 96 places in 217 ms
[2020-06-05 04:04:43] [INFO ] Deduced a trap composed of 78 places in 178 ms
[2020-06-05 04:04:43] [INFO ] Deduced a trap composed of 49 places in 143 ms
[2020-06-05 04:04:43] [INFO ] Deduced a trap composed of 67 places in 152 ms
[2020-06-05 04:04:43] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 794 ms
[2020-06-05 04:04:43] [INFO ] Computed and/alt/rep : 304/775/304 causal constraints in 39 ms.
[2020-06-05 04:04:46] [INFO ] Added : 299 causal constraints over 60 iterations in 2696 ms. Result :sat
[2020-06-05 04:04:46] [INFO ] Deduced a trap composed of 115 places in 260 ms
[2020-06-05 04:04:46] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 352 ms
[2020-06-05 04:04:46] [INFO ] [Real]Absence check using 6 positive place invariants in 23 ms returned sat
[2020-06-05 04:04:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 04:04:47] [INFO ] [Real]Absence check using state equation in 378 ms returned sat
[2020-06-05 04:04:47] [INFO ] Deduced a trap composed of 32 places in 193 ms
[2020-06-05 04:04:47] [INFO ] Deduced a trap composed of 82 places in 221 ms
[2020-06-05 04:04:48] [INFO ] Deduced a trap composed of 67 places in 231 ms
[2020-06-05 04:04:48] [INFO ] Deduced a trap composed of 84 places in 211 ms
[2020-06-05 04:04:48] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 958 ms
[2020-06-05 04:04:48] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 04:04:50] [INFO ] [Nat]Absence check using 6 positive place invariants in 2349 ms returned sat
[2020-06-05 04:04:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-05 04:04:51] [INFO ] [Nat]Absence check using state equation in 251 ms returned sat
[2020-06-05 04:04:51] [INFO ] Deduced a trap composed of 96 places in 266 ms
[2020-06-05 04:04:51] [INFO ] Deduced a trap composed of 78 places in 186 ms
[2020-06-05 04:04:51] [INFO ] Deduced a trap composed of 49 places in 139 ms
[2020-06-05 04:04:51] [INFO ] Deduced a trap composed of 67 places in 134 ms
[2020-06-05 04:04:51] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 815 ms
[2020-06-05 04:04:51] [INFO ] Computed and/alt/rep : 304/775/304 causal constraints in 41 ms.
[2020-06-05 04:04:54] [INFO ] Added : 299 causal constraints over 60 iterations in 2307 ms. Result :sat
[2020-06-05 04:04:54] [INFO ] Deduced a trap composed of 115 places in 204 ms
[2020-06-05 04:04:54] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 269 ms
[2020-06-05 04:04:54] [INFO ] [Real]Absence check using 6 positive place invariants in 23 ms returned sat
[2020-06-05 04:04:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 04:04:54] [INFO ] [Real]Absence check using state equation in 383 ms returned sat
[2020-06-05 04:04:55] [INFO ] Deduced a trap composed of 32 places in 223 ms
[2020-06-05 04:04:55] [INFO ] Deduced a trap composed of 94 places in 217 ms
[2020-06-05 04:04:55] [INFO ] Deduced a trap composed of 108 places in 188 ms
[2020-06-05 04:04:55] [INFO ] Deduced a trap composed of 67 places in 147 ms
[2020-06-05 04:04:55] [INFO ] Deduced a trap composed of 87 places in 170 ms
[2020-06-05 04:04:56] [INFO ] Deduced a trap composed of 108 places in 160 ms
[2020-06-05 04:04:56] [INFO ] Deduced a trap composed of 82 places in 122 ms
[2020-06-05 04:04:56] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 1397 ms
[2020-06-05 04:04:56] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 04:04:57] [INFO ] [Nat]Absence check using 6 positive place invariants in 660 ms returned sat
[2020-06-05 04:04:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-05 04:04:57] [INFO ] [Nat]Absence check using state equation in 237 ms returned sat
[2020-06-05 04:04:57] [INFO ] Deduced a trap composed of 51 places in 206 ms
[2020-06-05 04:04:57] [INFO ] Deduced a trap composed of 79 places in 232 ms
[2020-06-05 04:04:58] [INFO ] Deduced a trap composed of 68 places in 201 ms
[2020-06-05 04:04:58] [INFO ] Deduced a trap composed of 79 places in 204 ms
[2020-06-05 04:04:58] [INFO ] Deduced a trap composed of 104 places in 209 ms
[2020-06-05 04:04:58] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1165 ms
[2020-06-05 04:04:58] [INFO ] Computed and/alt/rep : 304/775/304 causal constraints in 42 ms.
[2020-06-05 04:05:01] [INFO ] Added : 304 causal constraints over 61 iterations in 2949 ms. Result :sat
[2020-06-05 04:05:01] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
[2020-06-05 04:05:01] [INFO ] Flatten gal took : 128 ms
FORMULA FlexibleBarrier-PT-04b-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FlexibleBarrier-PT-04b-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-06-05 04:05:01] [INFO ] Applying decomposition
[2020-06-05 04:05:01] [INFO ] Flatten gal took : 50 ms
[2020-06-05 04:05:02] [INFO ] Decomposing Gal with order
[2020-06-05 04:05:02] [INFO ] Rewriting arrays to variables to allow decomposition.
[2020-06-05 04:05:02] [INFO ] Removed a total of 21 redundant transitions.
[2020-06-05 04:05:02] [INFO ] Flatten gal took : 101 ms
[2020-06-05 04:05:02] [INFO ] Fuse similar labels procedure discarded/fused a total of 63 labels/synchronizations in 18 ms.
[2020-06-05 04:05:02] [INFO ] Export to MCC properties in file /home/mcc/execution/LTLFireability.sr.xml took 6 ms.
[2020-06-05 04:05:02] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 6 ms.
info: Time: 3600 - MCC
vrfy: Checking LTLFireability @ FlexibleBarrier-PT-04b @ 3570 seconds

FORMULA FlexibleBarrier-PT-04b-00 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA FlexibleBarrier-PT-04b-01 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA FlexibleBarrier-PT-04b-03 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA FlexibleBarrier-PT-04b-04 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA FlexibleBarrier-PT-04b-06 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA FlexibleBarrier-PT-04b-07 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA FlexibleBarrier-PT-04b-09 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA FlexibleBarrier-PT-04b-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA FlexibleBarrier-PT-04b-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA FlexibleBarrier-PT-04b-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA FlexibleBarrier-PT-04b-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA FlexibleBarrier-PT-04b-05 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA FlexibleBarrier-PT-04b-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA FlexibleBarrier-PT-04b-02 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 3562
rslt: Output for LTLFireability @ FlexibleBarrier-PT-04b

{
"build":
{
"architecture": 64,
"assertions": false,
"build_hostname": "mcc2019",
"build_system": "x86_64-unknown-linux-gnu",
"optimizations": true,
"package_version": "2.0",
"svn_version": "3189M"
},
"call":
{
"exec_host": "mcc2020",
"markinglimit": null,
"parameters":
[
"--pnmlnet",
"model.pnml",
"--xmlformula",
"--formula=LTLFireability.xml",
"--mcc",
"--donotcomputecapacities",
"--encoder=simplecompressed",
"--safe",
"--check=modelchecking",
"--stubborn=deletion",
"--stateequation=par",
"--timelimit=3570",
"--localtimelimit=0",
"--preference=force_ltl",
"--json=LTLFireability.json",
"--jsoninclude=formula,formulastat,net"
],
"starttime": "Fri Jun 5 04:05:03 2020
",
"timelimit": 3570
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 254
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 2,
"aconj": 3,
"adisj": 0,
"aneg": 1,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 1,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "X ((F (((p103 <= 0))) OR (X (G (((1 <= p94)))) AND ((1 <= p238)))))",
"processed_size": 67,
"rewrites": 57
},
"result":
{
"edges": 2,
"markings": 3,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 5
},
"compoundnumber": 0,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 274
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 1,
"aconj": 2,
"adisj": 0,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "X ((G (((1 <= p11))) OR ((1 <= p111))))",
"processed_size": 39,
"rewrites": 57
},
"result":
{
"edges": 12,
"markings": 12,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 4
},
"compoundnumber": 1,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 1,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 297
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 3,
"U": 0,
"X": 2,
"aconj": 3,
"adisj": 1,
"aneg": 2,
"comp": 6,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 6,
"taut": 0,
"tconj": 1,
"tdisj": 2,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "X (G ((X (F (((p252 <= 0)))) OR G ((((1 <= p129)) OR (G (((1 <= p156) AND (1 <= p171) AND (1 <= p249))) AND F (((1 <= p129)))))))))",
"processed_size": 131,
"rewrites": 57
},
"result":
{
"edges": 261133,
"markings": 85340,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 6
},
"compoundnumber": 2,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 324
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 2,
"U": 0,
"X": 1,
"aconj": 3,
"adisj": 0,
"aneg": 2,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 1,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "G (F (((X (F (((p18 <= 0)))) AND G (((1 <= p200)))) OR ((p174 <= 0)))))",
"processed_size": 71,
"rewrites": 57
},
"result":
{
"edges": 113,
"markings": 106,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 5
},
"compoundnumber": 3,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 356
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 1,
"U": 0,
"X": 2,
"aconj": 5,
"adisj": 0,
"aneg": 0,
"comp": 5,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 5,
"taut": 0,
"tconj": 1,
"tdisj": 3,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "F ((X ((((1 <= p151)) OR G (((X (((1 <= p68))) OR ((1 <= p237))) AND ((1 <= p20)))))) OR F (((1 <= p237)))))",
"processed_size": 108,
"rewrites": 57
},
"result":
{
"edges": 12,
"markings": 12,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 4
},
"compoundnumber": 4,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 396
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 2,
"aconj": 2,
"adisj": 0,
"aneg": 1,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "X ((((p37 <= 0) OR (p253 <= 0)) OR X (G (((1 <= p15))))))",
"processed_size": 58,
"rewrites": 57
},
"result":
{
"edges": 1,
"markings": 2,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 4
},
"compoundnumber": 5,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 445
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 1,
"U": 1,
"X": 4,
"aconj": 4,
"adisj": 1,
"aneg": 0,
"comp": 5,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 5,
"taut": 0,
"tconj": 1,
"tdisj": 2,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "(X (X (((1 <= p2)))) U (X (((1 <= p40))) OR ((G (((p40 <= 0))) AND X (F (((1 <= p40))))) OR F (((1 <= p194))))))",
"processed_size": 112,
"rewrites": 57
},
"result":
{
"edges": 14,
"markings": 14,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 17
},
"compoundnumber": 6,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 509
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 1,
"U": 0,
"X": 3,
"aconj": 2,
"adisj": 2,
"aneg": 2,
"comp": 6,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 6,
"taut": 0,
"tconj": 1,
"tdisj": 2,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "X (G ((F ((F (((1 <= p112))) OR (X (((p142 <= 0) OR (p265 <= 0))) OR ((p30 <= 0))))) AND X (((1 <= p142) AND (1 <= p265))))))",
"processed_size": 126,
"rewrites": 57
},
"result":
{
"edges": 12,
"markings": 12,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 5
},
"compoundnumber": 7,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 594
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 2,
"U": 0,
"X": 2,
"aconj": 4,
"adisj": 0,
"aneg": 0,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 3,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "X ((G ((G (((1 <= p253))) AND (((1 <= p254)) AND ((1 <= p253))))) AND X (F (((1 <= p7))))))",
"processed_size": 91,
"rewrites": 57
},
"result":
{
"edges": 12,
"markings": 12,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 6
},
"compoundnumber": 8,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 713
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 0,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 1,
"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": "X (F (((p103 <= 0))))",
"processed_size": 21,
"rewrites": 57
},
"result":
{
"edges": 1,
"markings": 2,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 9,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 891
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"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": "((p256 <= 0))",
"processed_size": 13,
"rewrites": 59
},
"result":
{
"edges": 29,
"markings": 29,
"produced_by": "state space / EG",
"value": false
},
"task":
{
"compoundnumber": 10,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 2
},
"threads": 1,
"type": "dfs"
},
"type": "eventual_occurrence"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1188
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"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": "F (G (((p128 <= 0))))",
"processed_size": 21,
"rewrites": 57
},
"result":
{
"edges": 2575,
"markings": 1752,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 11,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "stabilization",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1782
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 2,
"U": 1,
"X": 0,
"aconj": 2,
"adisj": 1,
"aneg": 2,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "((G (((p36 <= 0))) AND ((p36 <= 0))) U G (((p228 <= 0))))",
"processed_size": 57,
"rewrites": 57
},
"result":
{
"edges": 594228,
"markings": 224256,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 6
},
"compoundnumber": 12,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3563
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 3,
"G": 2,
"U": 0,
"X": 0,
"aconj": 3,
"adisj": 1,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "G (F ((F (G ((((1 <= p183)) OR ((1 <= p99))))) AND F (((1 <= p183))))))",
"processed_size": 72,
"rewrites": 57
},
"result":
{
"edges": 35,
"markings": 35,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 7
},
"compoundnumber": 13,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
}
],
"exit":
{
"error": null,
"memory": 34448,
"runtime": 8.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "LTLFireability.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "X((F(*) OR (X(G(**)) AND **))) : ((F(**) U X(X(**))) AND X((G(**) OR **))) : G(F((F(G(**)) AND F(**)))) : X(G((X(F(*)) OR G((** OR (G(*) AND F(**))))))) : G(F(((X(F(*)) AND G(**)) OR *))) : F(G(*)) : F((X((** OR G(((X(**) OR **) AND **)))) OR F(**))) : X((* OR X(G(**)))) : (X(X(**)) U (X(**) OR ((G(**) AND X(F(**))) OR F(**)))) : F(**) : ((G(*) AND **) U G(*)) : X(G((F((F(*) OR (X(*) OR **))) AND X(**)))) : X((G((G(**) AND (** AND **))) AND X(F(**)))) : X(F(**))"
},
"net":
{
"arcs": 743,
"conflict_clusters": 213,
"places": 268,
"places_significant": 262,
"singleton_clusters": 0,
"transitions": 305
},
"result":
{
"preliminary_value": "yes no no no no no no yes no no no no no yes ",
"value": "yes no no no no no no yes no no no no no 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: 573/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 268
lola: finding significant places
lola: 268 places, 305 transitions, 262 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 LTLFireability.xml
lola: LP says that atomic proposition is always true: (p103 <= 1)
lola: LP says that atomic proposition is always true: (p94 <= 1)
lola: LP says that atomic proposition is always true: (p238 <= 1)
lola: LP says that atomic proposition is always true: (p11 <= 1)
lola: LP says that atomic proposition is always true: (p27 <= 1)
lola: LP says that atomic proposition is always true: (p11 <= 1)
lola: LP says that atomic proposition is always true: (p111 <= 1)
lola: LP says that atomic proposition is always true: (p183 <= 1)
lola: LP says that atomic proposition is always true: (p99 <= 1)
lola: LP says that atomic proposition is always true: (p183 <= 1)
lola: LP says that atomic proposition is always true: (p252 <= 1)
lola: LP says that atomic proposition is always true: (p156 <= 1)
lola: LP says that atomic proposition is always true: (p171 <= 1)
lola: LP says that atomic proposition is always true: (p249 <= 1)
lola: LP says that atomic proposition is always true: (p129 <= 1)
lola: LP says that atomic proposition is always true: (p18 <= 1)
lola: LP says that atomic proposition is always true: (p200 <= 1)
lola: LP says that atomic proposition is always true: (p174 <= 1)
lola: LP says that atomic proposition is always true: (p128 <= 1)
lola: LP says that atomic proposition is always true: (p151 <= 1)
lola: LP says that atomic proposition is always true: (p68 <= 1)
lola: LP says that atomic proposition is always true: (p237 <= 1)
lola: LP says that atomic proposition is always true: (p20 <= 1)
lola: LP says that atomic proposition is always true: (p237 <= 1)
lola: LP says that atomic proposition is always true: (p37 <= 1)
lola: LP says that atomic proposition is always true: (p253 <= 1)
lola: LP says that atomic proposition is always true: (p15 <= 1)
lola: LP says that atomic proposition is always true: (p2 <= 1)
lola: LP says that atomic proposition is always true: (p40 <= 1)
lola: LP says that atomic proposition is always true: (p40 <= 1)
lola: LP says that atomic proposition is always true: (p194 <= 1)
lola: LP says that atomic proposition is always true: (p144 <= 1)
lola: LP says that atomic proposition is always true: (p256 <= 1)
lola: LP says that atomic proposition is always true: (p36 <= 1)
lola: LP says that atomic proposition is always true: (p36 <= 1)
lola: LP says that atomic proposition is always true: (p228 <= 1)
lola: LP says that atomic proposition is always true: (p112 <= 1)
lola: LP says that atomic proposition is always true: (p142 <= 1)
lola: LP says that atomic proposition is always true: (p265 <= 1)
lola: LP says that atomic proposition is always true: (p30 <= 1)
lola: LP says that atomic proposition is always true: (p142 <= 1)
lola: LP says that atomic proposition is always true: (p265 <= 1)
lola: LP says that atomic proposition is always true: (p253 <= 1)
lola: LP says that atomic proposition is always true: (p254 <= 1)
lola: LP says that atomic proposition is always true: (p253 <= 1)
lola: LP says that atomic proposition is always true: (p7 <= 1)
lola: LP says that atomic proposition is always true: (p103 <= 1)
lola: (X (NOT(G (((1 <= p103))))) OR (X (X (G (((1 <= p94))))) AND X (((1 <= p238))))) : ((F (((1 <= p11))) U X (X (((1 <= p27))))) AND X ((G (((1 <= p11))) OR ((1 <= p111))))) : G (F (X (F ((F (G ((((1 <= p183)) OR ((1 <= p99))))) AND F (((1 <= p183)))))))) : X (G ((NOT(G (X (((1 <= p252))))) OR G ((NOT(F (((p156 <= 0) OR (p171 <= 0) OR (p249 <= 0)))) U ((1 <= p129))))))) : G (NOT(G (F (G (((X (G (((1 <= p18)))) OR NOT(G (((1 <= p200))))) AND ((1 <= p174)))))))) : G (F (X (X (NOT(F (((1 <= p128)))))))) : F (((X (((1 <= p151))) OR G (X (((X (((1 <= p68))) OR ((1 <= p237))) AND ((1 <= p20)))))) OR F (((1 <= p237))))) : (NOT(X (((1 <= p37) AND (1 <= p253)))) OR X (X (G (((1 <= p15)))))) : (X (X (((1 <= p2)))) U ((G (((p40 <= 0))) U X (((1 <= p40)))) OR F (((1 <= p194))))) : (F (((p144 <= 0))) U F (((1 <= p256)))) : ((NOT(F (((1 <= p36)))) AND ((p36 <= 0))) U G (NOT(F (((1 <= p228)))))) : X (G ((F (((NOT(G (((p112 <= 0)))) OR NOT(X (((1 <= p142) AND (1 <= p265))))) OR ((p30 <= 0)))) AND X (((1 <= p142) AND (1 <= p265)))))) : X ((G (((G (((1 <= p253))) AND ((1 <= p254))) AND ((1 <= p253)))) AND F (X (((1 <= p7)))))) : X (F (((p103 <= 0))))
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:525
lola: rewrite Frontend/Parser/formula_rewrite.k:528
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:374
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:374
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:528
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:528
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:422
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 254 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((F (((p103 <= 0))) OR (X (G (((1 <= p94)))) AND ((1 <= p238)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((F (((p103 <= 0))) OR (X (G (((1 <= p94)))) AND ((1 <= p238)))))
lola: processed formula length: 67
lola: 57 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 5 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 3 markings, 2 edges
lola: ========================================
lola: subprocess 1 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((F (((1 <= p11))) U X (X (((1 <= p27))))) AND X ((G (((1 <= p11))) OR ((1 <= p111)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 1 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((G (((1 <= p11))) OR ((1 <= p111))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((G (((1 <= p11))) OR ((1 <= p111))))
lola: processed formula length: 39
lola: 57 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 4 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 12 markings, 12 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 2 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (G ((X (F (((p252 <= 0)))) OR G ((((1 <= p129)) OR (G (((1 <= p156) AND (1 <= p171) AND (1 <= p249))) AND F (((1 <= p129)))))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (G ((X (F (((p252 <= 0)))) OR G ((((1 <= p129)) OR (G (((1 <= p156) AND (1 <= p171) AND (1 <= p249))) AND F (((1 <= p129)))))))))
lola: processed formula length: 131
lola: 57 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 6 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 85340 markings, 261133 edges
lola: ========================================
lola: subprocess 3 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (F (((X (F (((p18 <= 0)))) AND G (((1 <= p200)))) OR ((p174 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (F (((X (F (((p18 <= 0)))) AND G (((1 <= p200)))) OR ((p174 <= 0)))))
lola: processed formula length: 71
lola: 57 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 5 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 106 markings, 113 edges
lola: ========================================
lola: subprocess 4 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((X ((((1 <= p151)) OR G (((X (((1 <= p68))) OR ((1 <= p237))) AND ((1 <= p20)))))) OR F (((1 <= p237)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F ((X ((((1 <= p151)) OR G (((X (((1 <= p68))) OR ((1 <= p237))) AND ((1 <= p20)))))) OR F (((1 <= p237)))))
lola: processed formula length: 108
lola: 57 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 4 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 12 markings, 12 edges
lola: ========================================
lola: subprocess 5 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((((p37 <= 0) OR (p253 <= 0)) OR X (G (((1 <= p15))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((((p37 <= 0) OR (p253 <= 0)) OR X (G (((1 <= p15))))))
lola: processed formula length: 58
lola: 57 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 4 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 2 markings, 1 edges
lola: ========================================
lola: subprocess 6 will run for 445 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (X (X (((1 <= p2)))) U (X (((1 <= p40))) OR ((G (((p40 <= 0))) AND X (F (((1 <= p40))))) OR F (((1 <= p194))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: (X (X (((1 <= p2)))) U (X (((1 <= p40))) OR ((G (((p40 <= 0))) AND X (F (((1 <= p40))))) OR F (((1 <= p194))))))
lola: processed formula length: 112
lola: 57 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 17 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 14 markings, 14 edges
lola: ========================================
lola: subprocess 7 will run for 509 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (G ((F ((F (((1 <= p112))) OR (X (((p142 <= 0) OR (p265 <= 0))) OR ((p30 <= 0))))) AND X (((1 <= p142) AND (1 <= p265))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (G ((F ((F (((1 <= p112))) OR (X (((p142 <= 0) OR (p265 <= 0))) OR ((p30 <= 0))))) AND X (((1 <= p142) AND (1 <= p265))))))
lola: processed formula length: 126
lola: 57 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 5 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 12 markings, 12 edges
lola: ========================================
lola: subprocess 8 will run for 594 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((G ((G (((1 <= p253))) AND (((1 <= p254)) AND ((1 <= p253))))) AND X (F (((1 <= p7))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((G ((G (((1 <= p253))) AND (((1 <= p254)) AND ((1 <= p253))))) AND X (F (((1 <= p7))))))
lola: processed formula length: 91
lola: 57 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 6 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 12 markings, 12 edges
lola: ========================================
lola: subprocess 9 will run for 713 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (F (((p103 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (F (((p103 <= 0))))
lola: processed formula length: 21
lola: 57 rewrites
lola: closed formula file LTLFireability.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: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 2 markings, 1 edges
lola: ========================================
lola: subprocess 10 will run for 891 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (((1 <= p256)))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:750
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: ((p256 <= 0))
lola: processed formula length: 13
lola: 59 rewrites
lola: closed formula file LTLFireability.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: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: state space / EG
lola: The predicate does not eventually occur.
lola: 29 markings, 29 edges
lola: ========================================
lola: subprocess 11 will run for 1188 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G (((p128 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking stabilization
lola: stabilization not yet implemented, converting to LTL...
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F (G (((p128 <= 0))))
lola: processed formula length: 21
lola: 57 rewrites
lola: closed formula file LTLFireability.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 deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: add low 109
lola: add low 280
lola: add low 23
lola: add low 21
lola: add low 22
lola: add low 93
lola: add low 142
lola: add low 143
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 1752 markings, 2575 edges
lola: ========================================
lola: subprocess 12 will run for 1782 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((G (((p36 <= 0))) AND ((p36 <= 0))) U G (((p228 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: ((G (((p36 <= 0))) AND ((p36 <= 0))) U G (((p228 <= 0))))
lola: processed formula length: 57
lola: 57 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 6 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 deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 224256 markings, 594228 edges
lola: ========================================
lola: subprocess 13 will run for 3563 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (F ((F (G ((((1 <= p183)) OR ((1 <= p99))))) AND F (((1 <= p183))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (F ((F (G ((((1 <= p183)) OR ((1 <= p99))))) AND F (((1 <= p183))))))
lola: processed formula length: 72
lola: 57 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 7 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 deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 35 markings, 35 edges
lola: RESULT
lola:
SUMMARY: yes no no no no no no yes no no no no no yes
lola:
preliminary result: yes no no no no no no yes no no no no no yes
lola: ========================================
lola: memory consumption: 34448 KB
lola: time consumption: 8 seconds
lola: print data as JSON (--json)
lola: writing JSON to LTLFireability.json
lola: closed JSON file LTLFireability.json
rslt: finished

--------------------
content from stderr:

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="FlexibleBarrier-PT-04b"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itslola"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itslola"
echo " Input is FlexibleBarrier-PT-04b, examination is LTLFireability"
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-smll-158987815600266"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/FlexibleBarrier-PT-04b.tgz
mv FlexibleBarrier-PT-04b execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "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 "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.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 '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
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 ;