Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2026-input.r162-smll-177961107700084.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2026-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5973
Executing tool itstools
Input is IBM5964-PT-none, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r162-smll-177961107700084
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 708K
-rw-r--r-- 1 mcc users 11K Mar 7 17:02 CTLCardinality.txt
-rw-r--r-- 1 mcc users 72K Mar 7 17:02 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.3K Mar 7 17:02 CTLFireability.txt
-rw-r--r-- 1 mcc users 47K Mar 7 17:02 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Mar 3 18:30 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.1K Mar 3 18:30 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 6.3K Mar 15 11:00 LTLCardinality.txt
-rw-r--r-- 1 mcc users 30K Mar 15 11:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 4.1K Mar 15 11:00 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Mar 15 11:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 25K Mar 7 17:02 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 154K Mar 7 17:02 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 17K Mar 7 17:02 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 79K Mar 7 17:02 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.1K Mar 15 11:00 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.1K Mar 15 11:00 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 equiv_col
-rw-r--r-- 1 mcc users 5 Mar 3 18:30 instance
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 iscolored
-rw-r--r-- 1 mcc users 171K Mar 3 18:30 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1779723108903

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=IBM5964-PT-none
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202604301425
[2026-05-25 15:31:50] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2026-05-25 15:31:50] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-25 15:31:50] [INFO ] Load time of PNML (sax parser for PT used): 135 ms
[2026-05-25 15:31:50] [INFO ] Transformed 263 places.
[2026-05-25 15:31:50] [INFO ] Transformed 139 transitions.
[2026-05-25 15:31:50] [INFO ] Parsed PT model containing 263 places and 139 transitions and 541 arcs in 285 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 13 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
FORMULA IBM5964-PT-none-LTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA IBM5964-PT-none-LTLFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA IBM5964-PT-none-LTLFireability-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA IBM5964-PT-none-LTLFireability-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 72 out of 263 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 263/263 places, 139/139 transitions.
Ensure Unique test removed 76 places
Reduce places removed 85 places and 0 transitions.
Iterating post reduction 0 with 85 rules applied. Total rules applied 85 place count 178 transition count 139
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 90 place count 173 transition count 134
Iterating global reduction 1 with 5 rules applied. Total rules applied 95 place count 173 transition count 134
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 96 place count 172 transition count 133
Iterating global reduction 1 with 1 rules applied. Total rules applied 97 place count 172 transition count 133
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 98 place count 171 transition count 132
Iterating global reduction 1 with 1 rules applied. Total rules applied 99 place count 171 transition count 132
Applied a total of 99 rules in 92 ms. Remains 171 /263 variables (removed 92) and now considering 132/139 (removed 7) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7295104036444352433.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4997949331652011856.kers'
[2026-05-25 15:31:51] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7295104036444352433.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4997949331652011856.kers]
Culling duplicate invariants (modulo rational): removing 41 columns.
Culled 41 columns in 0 ms.
// Phase 1: matrix 132 rows 130 cols 283 entries
Finished phase 1 with 120 SingleSign rule and 5 generalized
[2026-05-25 15:31:51] [INFO ] Computed 46 invariants in 1 ms
Computed 46 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-4997949331652011856.kers
Total runtime 3 ms.
[2026-05-25 15:31:51] [INFO ] Implicit Places using invariants in 379 ms returned [27, 134]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 435 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 169/263 places, 132/139 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 167 transition count 130
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 167 transition count 130
Applied a total of 4 rules in 23 ms. Remains 167 /169 variables (removed 2) and now considering 130/132 (removed 2) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-3683905757382651474.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12395599311466104787.kers'
[2026-05-25 15:31:51] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3683905757382651474.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12395599311466104787.kers]
Culling duplicate invariants (modulo rational): removing 41 columns.
Culled 41 columns in 0 ms.
// Phase 1: matrix 130 rows 126 cols 275 entries
Finished phase 1 with 119 SingleSign rule and 4 generalized
[2026-05-25 15:31:51] [INFO ] Computed 44 invariants in 1 ms
Computed 44 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-12395599311466104787.kers
Total runtime 2 ms.
[2026-05-25 15:31:51] [INFO ] Implicit Places using invariants in 173 ms returned []
[2026-05-25 15:31:51] [INFO ] Invariant cache hit.
[2026-05-25 15:31:52] [INFO ] Implicit Places using invariants and state equation in 474 ms returned []
Implicit Place search using SMT with State Equation took 651 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 167/263 places, 130/139 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1233 ms. Remains : 167/263 places, 130/139 transitions.
Starting structural reductions in LTL mode, iteration 0 : 167/167 places, 130/130 transitions.
Applied a total of 0 rules in 8 ms. Remains 167 /167 variables (removed 0) and now considering 130/130 (removed 0) transitions.
[2026-05-25 15:31:52] [INFO ] Invariant cache hit.
[2026-05-25 15:31:52] [INFO ] Implicit Places using invariants in 106 ms returned []
[2026-05-25 15:31:52] [INFO ] Invariant cache hit.
[2026-05-25 15:31:52] [INFO ] Implicit Places using invariants and state equation in 386 ms returned []
Implicit Place search using SMT with State Equation took 495 ms to find 0 implicit places.
Running 129 sub problems to find dead transitions.
[2026-05-25 15:31:53] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/166 variables, 43/43 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/166 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 2 (OVERLAPS) 1/167 variables, 1/44 constraints. Problems are: Problem set: 0 solved, 129 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/167 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 129 unsolved
Problem TDEAD0 is UNSAT
Problem TDEAD1 is UNSAT
Problem TDEAD2 is UNSAT
Problem TDEAD3 is UNSAT
Problem TDEAD4 is UNSAT
Problem TDEAD6 is UNSAT
Problem TDEAD7 is UNSAT
Problem TDEAD8 is UNSAT
Problem TDEAD10 is UNSAT
Problem TDEAD12 is UNSAT
Problem TDEAD13 is UNSAT
Problem TDEAD15 is UNSAT
Problem TDEAD16 is UNSAT
Problem TDEAD17 is UNSAT
Problem TDEAD18 is UNSAT
Problem TDEAD20 is UNSAT
Problem TDEAD21 is UNSAT
Problem TDEAD22 is UNSAT
Problem TDEAD24 is UNSAT
Problem TDEAD25 is UNSAT
Problem TDEAD26 is UNSAT
Problem TDEAD27 is UNSAT
Problem TDEAD28 is UNSAT
Problem TDEAD29 is UNSAT
Problem TDEAD30 is UNSAT
Problem TDEAD31 is UNSAT
Problem TDEAD32 is UNSAT
Problem TDEAD33 is UNSAT
Problem TDEAD34 is UNSAT
Problem TDEAD35 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD40 is UNSAT
Problem TDEAD41 is UNSAT
Problem TDEAD42 is UNSAT
Problem TDEAD43 is UNSAT
Problem TDEAD44 is UNSAT
Problem TDEAD47 is UNSAT
Problem TDEAD48 is UNSAT
Problem TDEAD49 is UNSAT
Problem TDEAD50 is UNSAT
Problem TDEAD51 is UNSAT
Problem TDEAD52 is UNSAT
Problem TDEAD54 is UNSAT
Problem TDEAD55 is UNSAT
Problem TDEAD56 is UNSAT
Problem TDEAD58 is UNSAT
Problem TDEAD59 is UNSAT
Problem TDEAD60 is UNSAT
Problem TDEAD61 is UNSAT
Problem TDEAD62 is UNSAT
Problem TDEAD64 is UNSAT
Problem TDEAD65 is UNSAT
Problem TDEAD66 is UNSAT
Problem TDEAD67 is UNSAT
Problem TDEAD68 is UNSAT
Problem TDEAD69 is UNSAT
Problem TDEAD71 is UNSAT
Problem TDEAD72 is UNSAT
Problem TDEAD73 is UNSAT
Problem TDEAD74 is UNSAT
Problem TDEAD75 is UNSAT
Problem TDEAD76 is UNSAT
Problem TDEAD77 is UNSAT
Problem TDEAD78 is UNSAT
Problem TDEAD79 is UNSAT
Problem TDEAD80 is UNSAT
Problem TDEAD81 is UNSAT
Problem TDEAD82 is UNSAT
Problem TDEAD83 is UNSAT
Problem TDEAD84 is UNSAT
Problem TDEAD85 is UNSAT
Problem TDEAD86 is UNSAT
Problem TDEAD87 is UNSAT
Problem TDEAD88 is UNSAT
Problem TDEAD89 is UNSAT
Problem TDEAD90 is UNSAT
Problem TDEAD91 is UNSAT
Problem TDEAD92 is UNSAT
Problem TDEAD94 is UNSAT
Problem TDEAD95 is UNSAT
Problem TDEAD96 is UNSAT
Problem TDEAD97 is UNSAT
Problem TDEAD98 is UNSAT
Problem TDEAD99 is UNSAT
Problem TDEAD100 is UNSAT
Problem TDEAD101 is UNSAT
Problem TDEAD102 is UNSAT
Problem TDEAD103 is UNSAT
Problem TDEAD104 is UNSAT
Problem TDEAD105 is UNSAT
Problem TDEAD106 is UNSAT
Problem TDEAD107 is UNSAT
Problem TDEAD108 is UNSAT
Problem TDEAD109 is UNSAT
Problem TDEAD110 is UNSAT
Problem TDEAD111 is UNSAT
Problem TDEAD112 is UNSAT
Problem TDEAD113 is UNSAT
Problem TDEAD114 is UNSAT
Problem TDEAD116 is UNSAT
Problem TDEAD117 is UNSAT
Problem TDEAD118 is UNSAT
Problem TDEAD119 is UNSAT
Problem TDEAD123 is UNSAT
Problem TDEAD124 is UNSAT
Problem TDEAD125 is UNSAT
Problem TDEAD126 is UNSAT
Problem TDEAD129 is UNSAT
At refinement iteration 4 (OVERLAPS) 130/297 variables, 167/211 constraints. Problems are: Problem set: 109 solved, 20 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/297 variables, 0/211 constraints. Problems are: Problem set: 109 solved, 20 unsolved
At refinement iteration 6 (OVERLAPS) 0/297 variables, 0/211 constraints. Problems are: Problem set: 109 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Real declared 297/297 variables, and 211 constraints, problems are : Problem set: 109 solved, 20 unsolved in 5425 ms.
Refiners :[Generalized P Invariants (flows): 44/44 constraints, State Equation: 167/167 constraints, PredecessorRefiner: 129/129 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 109 solved, 20 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/25 variables, 6/6 constraints. Problems are: Problem set: 109 solved, 20 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/25 variables, 0/6 constraints. Problems are: Problem set: 109 solved, 20 unsolved
At refinement iteration 2 (OVERLAPS) 1/26 variables, 1/7 constraints. Problems are: Problem set: 109 solved, 20 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/26 variables, 0/7 constraints. Problems are: Problem set: 109 solved, 20 unsolved
At refinement iteration 4 (OVERLAPS) 21/47 variables, 26/33 constraints. Problems are: Problem set: 109 solved, 20 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/47 variables, 13/46 constraints. Problems are: Problem set: 109 solved, 20 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/47 variables, 0/46 constraints. Problems are: Problem set: 109 solved, 20 unsolved
At refinement iteration 7 (OVERLAPS) 7/54 variables, 5/51 constraints. Problems are: Problem set: 109 solved, 20 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/54 variables, 2/53 constraints. Problems are: Problem set: 109 solved, 20 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/54 variables, 7/60 constraints. Problems are: Problem set: 109 solved, 20 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/54 variables, 0/60 constraints. Problems are: Problem set: 109 solved, 20 unsolved
At refinement iteration 11 (OVERLAPS) 6/60 variables, 3/63 constraints. Problems are: Problem set: 109 solved, 20 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/60 variables, 0/63 constraints. Problems are: Problem set: 109 solved, 20 unsolved
At refinement iteration 13 (OVERLAPS) 10/70 variables, 6/69 constraints. Problems are: Problem set: 109 solved, 20 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/70 variables, 2/71 constraints. Problems are: Problem set: 109 solved, 20 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/70 variables, 0/71 constraints. Problems are: Problem set: 109 solved, 20 unsolved
At refinement iteration 16 (OVERLAPS) 8/78 variables, 1/72 constraints. Problems are: Problem set: 109 solved, 20 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/78 variables, 0/72 constraints. Problems are: Problem set: 109 solved, 20 unsolved
At refinement iteration 18 (OVERLAPS) 5/83 variables, 5/77 constraints. Problems are: Problem set: 109 solved, 20 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/83 variables, 0/77 constraints. Problems are: Problem set: 109 solved, 20 unsolved
At refinement iteration 20 (OVERLAPS) 8/91 variables, 14/91 constraints. Problems are: Problem set: 109 solved, 20 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/91 variables, 0/91 constraints. Problems are: Problem set: 109 solved, 20 unsolved
At refinement iteration 22 (OVERLAPS) 2/93 variables, 1/92 constraints. Problems are: Problem set: 109 solved, 20 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/93 variables, 0/92 constraints. Problems are: Problem set: 109 solved, 20 unsolved
At refinement iteration 24 (OVERLAPS) 3/96 variables, 1/93 constraints. Problems are: Problem set: 109 solved, 20 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/96 variables, 0/93 constraints. Problems are: Problem set: 109 solved, 20 unsolved
At refinement iteration 26 (OVERLAPS) 7/103 variables, 5/98 constraints. Problems are: Problem set: 109 solved, 20 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/103 variables, 3/101 constraints. Problems are: Problem set: 109 solved, 20 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/103 variables, 0/101 constraints. Problems are: Problem set: 109 solved, 20 unsolved
At refinement iteration 29 (OVERLAPS) 5/108 variables, 2/103 constraints. Problems are: Problem set: 109 solved, 20 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/108 variables, 0/103 constraints. Problems are: Problem set: 109 solved, 20 unsolved
At refinement iteration 31 (OVERLAPS) 9/117 variables, 5/108 constraints. Problems are: Problem set: 109 solved, 20 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/117 variables, 2/110 constraints. Problems are: Problem set: 109 solved, 20 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/117 variables, 0/110 constraints. Problems are: Problem set: 109 solved, 20 unsolved
At refinement iteration 34 (OVERLAPS) 12/129 variables, 4/114 constraints. Problems are: Problem set: 109 solved, 20 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/129 variables, 0/114 constraints. Problems are: Problem set: 109 solved, 20 unsolved
At refinement iteration 36 (OVERLAPS) 21/150 variables, 12/126 constraints. Problems are: Problem set: 109 solved, 20 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/150 variables, 4/130 constraints. Problems are: Problem set: 109 solved, 20 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/150 variables, 0/130 constraints. Problems are: Problem set: 109 solved, 20 unsolved
At refinement iteration 39 (OVERLAPS) 11/161 variables, 6/136 constraints. Problems are: Problem set: 109 solved, 20 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/161 variables, 0/136 constraints. Problems are: Problem set: 109 solved, 20 unsolved
At refinement iteration 41 (OVERLAPS) 13/174 variables, 7/143 constraints. Problems are: Problem set: 109 solved, 20 unsolved
At refinement iteration 42 (INCLUDED_ONLY) 0/174 variables, 2/145 constraints. Problems are: Problem set: 109 solved, 20 unsolved
At refinement iteration 43 (INCLUDED_ONLY) 0/174 variables, 0/145 constraints. Problems are: Problem set: 109 solved, 20 unsolved
At refinement iteration 44 (OVERLAPS) 15/189 variables, 7/152 constraints. Problems are: Problem set: 109 solved, 20 unsolved
At refinement iteration 45 (INCLUDED_ONLY) 0/189 variables, 0/152 constraints. Problems are: Problem set: 109 solved, 20 unsolved
At refinement iteration 46 (OVERLAPS) 4/193 variables, 1/153 constraints. Problems are: Problem set: 109 solved, 20 unsolved
At refinement iteration 47 (INCLUDED_ONLY) 0/193 variables, 0/153 constraints. Problems are: Problem set: 109 solved, 20 unsolved
At refinement iteration 48 (OVERLAPS) 2/195 variables, 2/155 constraints. Problems are: Problem set: 109 solved, 20 unsolved
At refinement iteration 49 (INCLUDED_ONLY) 0/195 variables, 0/155 constraints. Problems are: Problem set: 109 solved, 20 unsolved
At refinement iteration 50 (OVERLAPS) 22/217 variables, 19/174 constraints. Problems are: Problem set: 109 solved, 20 unsolved
At refinement iteration 51 (INCLUDED_ONLY) 0/217 variables, 7/181 constraints. Problems are: Problem set: 109 solved, 20 unsolved
At refinement iteration 52 (INCLUDED_ONLY) 0/217 variables, 0/181 constraints. Problems are: Problem set: 109 solved, 20 unsolved
At refinement iteration 53 (OVERLAPS) 19/236 variables, 9/190 constraints. Problems are: Problem set: 109 solved, 20 unsolved
At refinement iteration 54 (INCLUDED_ONLY) 0/236 variables, 2/192 constraints. Problems are: Problem set: 109 solved, 20 unsolved
At refinement iteration 55 (INCLUDED_ONLY) 0/236 variables, 0/192 constraints. Problems are: Problem set: 109 solved, 20 unsolved
At refinement iteration 56 (OVERLAPS) 23/259 variables, 14/206 constraints. Problems are: Problem set: 109 solved, 20 unsolved
At refinement iteration 57 (INCLUDED_ONLY) 0/259 variables, 4/210 constraints. Problems are: Problem set: 109 solved, 20 unsolved
At refinement iteration 58 (INCLUDED_ONLY) 0/259 variables, 0/210 constraints. Problems are: Problem set: 109 solved, 20 unsolved
At refinement iteration 59 (OVERLAPS) 16/275 variables, 9/219 constraints. Problems are: Problem set: 109 solved, 20 unsolved
At refinement iteration 60 (INCLUDED_ONLY) 0/275 variables, 0/219 constraints. Problems are: Problem set: 109 solved, 20 unsolved
At refinement iteration 61 (OVERLAPS) 11/286 variables, 6/225 constraints. Problems are: Problem set: 109 solved, 20 unsolved
At refinement iteration 62 (INCLUDED_ONLY) 0/286 variables, 0/225 constraints. Problems are: Problem set: 109 solved, 20 unsolved
At refinement iteration 63 (OVERLAPS) 8/294 variables, 4/229 constraints. Problems are: Problem set: 109 solved, 20 unsolved
At refinement iteration 64 (INCLUDED_ONLY) 0/294 variables, 0/229 constraints. Problems are: Problem set: 109 solved, 20 unsolved
At refinement iteration 65 (OVERLAPS) 3/297 variables, 2/231 constraints. Problems are: Problem set: 109 solved, 20 unsolved
At refinement iteration 66 (INCLUDED_ONLY) 0/297 variables, 0/231 constraints. Problems are: Problem set: 109 solved, 20 unsolved
At refinement iteration 67 (OVERLAPS) 0/297 variables, 0/231 constraints. Problems are: Problem set: 109 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Int declared 297/297 variables, and 231 constraints, problems are : Problem set: 109 solved, 20 unsolved in 8912 ms.
Refiners :[Generalized P Invariants (flows): 44/44 constraints, State Equation: 167/167 constraints, PredecessorRefiner: 20/129 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 14442ms problems are : Problem set: 109 solved, 20 unsolved
Search for dead transitions found 109 dead transitions in 14493ms
Found 109 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 109 transitions
Dead transitions reduction (with SMT) removed 109 transitions
Starting structural reductions in LTL mode, iteration 1 : 167/167 places, 21/130 transitions.
Reduce places removed 79 places and 0 transitions.
Iterating post reduction 0 with 79 rules applied. Total rules applied 79 place count 88 transition count 21
Deduced a syphon composed of 58 places in 0 ms
Applied a total of 79 rules in 2 ms. Remains 88 /167 variables (removed 79) and now considering 21/21 (removed 0) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-24923391961228295.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8641955841555373126.kers'
[2026-05-25 15:32:07] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-24923391961228295.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8641955841555373126.kers]
Culling trivial invariants: removing 58 columns.
Culling duplicate invariants (modulo rational): removing 8 columns.
Culled 66 columns in 0 ms.
// Phase 1: matrix 21 rows 22 cols 47 entries
Finished phase 1 with 20 SingleSign rule and 1 generalized
[2026-05-25 15:32:07] [INFO ] Computed 67 invariants in 0 ms
Computed 67 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-8641955841555373126.kers
Total runtime 1 ms.
[2026-05-25 15:32:07] [INFO ] Implicit Places using invariants in 67 ms returned []
[2026-05-25 15:32:07] [INFO ] Invariant cache hit.
[2026-05-25 15:32:07] [INFO ] Implicit Places using invariants and state equation in 94 ms returned []
Implicit Place search using SMT with State Equation took 164 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 88/167 places, 21/130 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 15206 ms. Remains : 88/167 places, 21/130 transitions.
Deduced a syphon composed of 58 places in 0 ms
Reduce places removed 58 places and 0 transitions.
Support contains 14 out of 30 places after structural reductions.
FORMULA IBM5964-PT-none-LTLFireability-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA IBM5964-PT-none-LTLFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA IBM5964-PT-none-LTLFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA IBM5964-PT-none-LTLFireability-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA IBM5964-PT-none-LTLFireability-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA IBM5964-PT-none-LTLFireability-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA IBM5964-PT-none-LTLFireability-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2026-05-25 15:32:07] [INFO ] Initial state reduction rules for LTL removed 3 formulas.
[2026-05-25 15:32:07] [INFO ] Flatten gal took : 24 ms
FORMULA IBM5964-PT-none-LTLFireability-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA IBM5964-PT-none-LTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA IBM5964-PT-none-LTLFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2026-05-25 15:32:07] [INFO ] Flatten gal took : 8 ms
[2026-05-25 15:32:07] [INFO ] Input system was already deterministic with 21 transitions.
Support contains 11 out of 30 places (down from 14) after GAL structural reductions.
RANDOM walk for 40002 steps (813 resets) in 614 ms. (65 steps per ms) remains 1/2 properties
BEST_FIRST walk for 40004 steps (244 resets) in 257 ms. (155 steps per ms) remains 1/1 properties
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-8237273850190626185.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9143743379161510636.kers'
[2026-05-25 15:32:08] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8237273850190626185.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9143743379161510636.kers]
Culling duplicate invariants (modulo rational): removing 8 columns.
Culled 8 columns in 0 ms.
// Phase 1: matrix 21 rows 22 cols 47 entries
Finished phase 1 with 20 SingleSign rule and 1 generalized
[2026-05-25 15:32:08] [INFO ] Computed 9 invariants in 0 ms
Computed 9 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-9143743379161510636.kers
Total runtime 1 ms.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/4 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 2/6 variables, 4/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/6 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 3/9 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/9 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 2/11 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/11 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 2/13 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/13 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 10/23 variables, 7/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/23 variables, 4/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/23 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 14/37 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem AtomicPropp1 is UNSAT
After SMT solving in domain Real declared 37/51 variables, and 22 constraints, problems are : Problem set: 1 solved, 0 unsolved in 78 ms.
Refiners :[Generalized P Invariants (flows): 7/9 constraints, State Equation: 15/30 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 86ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 1 atomic propositions for a total of 2 simplifications.
FORMULA IBM5964-PT-none-LTLFireability-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 30 stabilizing places and 21 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 30 transition count 21
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 7 out of 30 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 30/30 places, 21/21 transitions.
Graph (complete) has 40 edges and 30 vertex of which 23 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.1 ms
Discarding 7 places :
Also discarding 5 output transitions
Drop transitions (Output transitions of discarded places.) removed 5 transitions
Ensure Unique test removed 2 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 6 rules applied. Total rules applied 7 place count 21 transition count 10
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 13 place count 15 transition count 10
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 13 place count 15 transition count 8
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 17 place count 13 transition count 8
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 23 place count 10 transition count 5
Applied a total of 23 rules in 21 ms. Remains 10 /30 variables (removed 20) and now considering 5/21 (removed 16) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-713243654096131847.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-18257579223730161779.kers'
[2026-05-25 15:32:08] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-713243654096131847.kers, --Pflows, --basisKERS=/tmp/petrispot-output-18257579223730161779.kers]
Culling duplicate invariants (modulo rational): removing 4 columns.
Culled 4 columns in 0 ms.
// Phase 1: matrix 5 rows 6 cols 13 entries
Finished phase 1 with 4 SingleSign rule and 1 generalized
[2026-05-25 15:32:08] [INFO ] Computed 5 invariants in 0 ms
Computed 5 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-18257579223730161779.kers
Total runtime 0 ms.
[2026-05-25 15:32:08] [INFO ] Implicit Places using invariants in 30 ms returned []
[2026-05-25 15:32:08] [INFO ] Invariant cache hit.
[2026-05-25 15:32:08] [INFO ] Implicit Places using invariants and state equation in 33 ms returned []
Implicit Place search using SMT with State Equation took 67 ms to find 0 implicit places.
[2026-05-25 15:32:08] [INFO ] Redundant transitions in 0 ms returned []
Running 4 sub problems to find dead transitions.
[2026-05-25 15:32:08] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/9 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (OVERLAPS) 1/10 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/10 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 5/15 variables, 10/15 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/15 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 0/15 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 15/15 variables, and 15 constraints, problems are : Problem set: 0 solved, 4 unsolved in 96 ms.
Refiners :[Generalized P Invariants (flows): 5/5 constraints, State Equation: 10/10 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/9 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (OVERLAPS) 1/10 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/10 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 5/15 variables, 10/15 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/15 variables, 4/19 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/15 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 0/15 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 15/15 variables, and 19 constraints, problems are : Problem set: 0 solved, 4 unsolved in 96 ms.
Refiners :[Generalized P Invariants (flows): 5/5 constraints, State Equation: 10/10 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 195ms problems are : Problem set: 0 solved, 4 unsolved
Search for dead transitions found 0 dead transitions in 195ms
Starting structural reductions in SI_LTL mode, iteration 1 : 10/30 places, 5/21 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 291 ms. Remains : 10/30 places, 5/21 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Stuttering acceptance computed with spot in 259 ms :[(NOT p0)]
Running random walk in product with property : IBM5964-PT-none-LTLFireability-01
Stuttering criterion allowed to conclude after 9 steps with 0 reset in 2 ms.
FORMULA IBM5964-PT-none-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property IBM5964-PT-none-LTLFireability-01 finished in 662 ms.
All properties solved by simple procedures.
Total runtime 18384 ms.

BK_STOP 1779723129122

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202604301425.jar
+ VERSION=202604301425
+ echo 'Running Version 202604301425'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

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="IBM5964-PT-none"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# 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-5973"
echo " Executing tool itstools"
echo " Input is IBM5964-PT-none, 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 r162-smll-177961107700084"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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