About the Execution of ITS-Tools for DBSingleClientW-PT-d0m10
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 1564.376 | 88863.00 | 195191.00 | 963.90 | T | normal |
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.r088-smll-177946995200082.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 DBSingleClientW-PT-d0m10, examination is QuasiLiveness
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r088-smll-177946995200082
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 564K
-rw-r--r-- 1 mcc users 6.8K Mar 6 18:21 CTLCardinality.txt
-rw-r--r-- 1 mcc users 70K Mar 6 18:21 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.5K Mar 6 18:21 CTLFireability.txt
-rw-r--r-- 1 mcc users 64K Mar 6 18:21 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.9K Mar 15 08:46 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Mar 15 08:46 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Mar 15 08:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Mar 15 08:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Mar 6 18:21 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 107K Mar 6 18:21 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.8K Mar 6 18:21 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 87K Mar 6 18:21 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 15 08:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Mar 15 08:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 equiv_col
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 instance
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 iscolored
-rw-r--r-- 1 mcc users 119K 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
FORMULA_NAME QuasiLiveness
=== Now, execution of the tool begins
BK_START 1779490045877
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=QuasiLiveness
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=DBSingleClientW-PT-d0m10
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
QuasiLiveness PT
Running Version 202604301425
[2026-05-22 22:47:28] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, QuasiLiveness, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 1800]
[2026-05-22 22:47:28] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-22 22:47:28] [INFO ] Load time of PNML (sax parser for PT used): 189 ms
[2026-05-22 22:47:28] [INFO ] Transformed 553 places.
[2026-05-22 22:47:28] [INFO ] Transformed 150 transitions.
[2026-05-22 22:47:28] [INFO ] Parsed PT model containing 553 places and 150 transitions and 600 arcs in 419 ms.
Starting structural reductions in LIVENESS mode, iteration 0 : 553/553 places, 150/150 transitions.
Reduce places removed 451 places and 0 transitions.
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 0 with 462 rules applied. Total rules applied 462 place count 102 transition count 139
Applied a total of 462 rules in 68 ms. Remains 102 /553 variables (removed 451) and now considering 139/150 (removed 11) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4914364201444565859.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12424464222592229720.kers'
[2026-05-22 22:47:29] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4914364201444565859.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12424464222592229720.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 139 rows 102 cols 416 entries
Finished phase 1 with 98 SingleSign rule and 2 generalized
[2026-05-22 22:47:29] [INFO ] Computed 2 invariants in 1 ms
Computed 2 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-12424464222592229720.kers
Total runtime 2 ms.
[2026-05-22 22:47:29] [INFO ] Implicit Places using invariants in 638 ms returned []
[2026-05-22 22:47:29] [INFO ] Invariant cache hit.
[2026-05-22 22:47:29] [INFO ] State equation strengthened by 63 read => feed constraints.
[2026-05-22 22:47:31] [INFO ] Implicit Places using invariants and state equation in 1509 ms returned []
Implicit Place search using SMT with State Equation took 2225 ms to find 0 implicit places.
Running 138 sub problems to find dead transitions.
[2026-05-22 22:47:31] [INFO ] Invariant cache hit.
[2026-05-22 22:47:31] [INFO ] State equation strengthened by 63 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/101 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 1 (OVERLAPS) 1/102 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/102 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/102 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 4 (OVERLAPS) 139/241 variables, 102/104 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/241 variables, 63/167 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/241 variables, 11/178 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/241 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 8 (OVERLAPS) 0/241 variables, 3/181 constraints. Problems are: Problem set: 0 solved, 138 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/241 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 10 (OVERLAPS) 0/241 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 138 unsolved
No progress, stopping.
After SMT solving in domain Real declared 241/241 variables, and 181 constraints, problems are : Problem set: 0 solved, 138 unsolved in 16679 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 102/102 constraints, ReadFeed: 63/63 constraints, PredecessorRefiner: 138/138 constraints, Known Traps: 14/14 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 138 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/101 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/101 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 2 (OVERLAPS) 1/102 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/102 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/102 variables, 12/16 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/102 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 6 (OVERLAPS) 139/241 variables, 102/118 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/241 variables, 63/181 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/241 variables, 138/319 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/241 variables, 0/319 constraints. Problems are: Problem set: 0 solved, 138 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 241/241 variables, and 319 constraints, problems are : Problem set: 0 solved, 138 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 102/102 constraints, ReadFeed: 63/63 constraints, PredecessorRefiner: 138/138 constraints, Known Traps: 14/14 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 47181ms problems are : Problem set: 0 solved, 138 unsolved
Search for dead transitions found 0 dead transitions in 47209ms
Starting structural reductions in LIVENESS mode, iteration 1 : 102/553 places, 139/150 transitions.
Finished structural reductions in LIVENESS mode , in 1 iterations and 49583 ms. Remains : 102/553 places, 139/150 transitions.
Discarding 48 transitions out of 139. Remains 91
Initial state reduction rules removed 1 formulas.
[2026-05-22 22:48:19] [INFO ] Flatten gal took : 140 ms
[2026-05-22 22:48:19] [INFO ] Flatten gal took : 51 ms
[2026-05-22 22:48:19] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality10768802190123387595.gal : 17 ms
RANDOM walk for 40000 steps (9143 resets) in 2825 ms. (14 steps per ms) remains 49/90 properties
[2026-05-22 22:48:19] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality9772553687192829774.prop : 4 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality10768802190123387595.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality9772553687192829774.prop' '--nowitness' '--gen-order' 'FOLLOW'
BEST_FIRST walk for 4002 steps (179 resets) in 80 ms. (49 steps per ms) remains 49/49 properties
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
BEST_FIRST walk for 4002 steps (189 resets) in 97 ms. (40 steps per ms) remains 49/49 properties
Loading property file /tmp/ReachabilityCardinality9772553687192829774.prop.
BEST_FIRST walk for 4003 steps (215 resets) in 100 ms. (39 steps per ms) remains 49/49 properties
SDD proceeding with computation,49 properties remain. new max is 4
SDD size :1 after 5
BEST_FIRST walk for 4004 steps (187 resets) in 112 ms. (35 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4002 steps (188 resets) in 59 ms. (66 steps per ms) remains 49/49 properties
SDD proceeding with computation,49 properties remain. new max is 8
SDD size :5 after 33
BEST_FIRST walk for 4003 steps (193 resets) in 64 ms. (61 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4003 steps (202 resets) in 45 ms. (87 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4004 steps (203 resets) in 31 ms. (125 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4002 steps (206 resets) in 57 ms. (69 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4002 steps (186 resets) in 22 ms. (174 steps per ms) remains 44/49 properties
BEST_FIRST walk for 4004 steps (202 resets) in 19 ms. (200 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4002 steps (219 resets) in 26 ms. (148 steps per ms) remains 44/44 properties
SDD proceeding with computation,49 properties remain. new max is 16
SDD size :33 after 205
BEST_FIRST walk for 4003 steps (193 resets) in 23 ms. (166 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4001 steps (176 resets) in 26 ms. (148 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4002 steps (183 resets) in 23 ms. (166 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4004 steps (198 resets) in 35 ms. (111 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4003 steps (195 resets) in 28 ms. (138 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4003 steps (200 resets) in 20 ms. (190 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4002 steps (200 resets) in 21 ms. (181 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4003 steps (198 resets) in 33 ms. (117 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4002 steps (194 resets) in 39 ms. (100 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4002 steps (193 resets) in 26 ms. (148 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4004 steps (186 resets) in 39 ms. (100 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4003 steps (202 resets) in 29 ms. (133 steps per ms) remains 44/44 properties
SDD proceeding with computation,49 properties remain. new max is 32
SDD size :205 after 834
BEST_FIRST walk for 4001 steps (195 resets) in 25 ms. (153 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4000 steps (800 resets) in 42 ms. (93 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4000 steps (800 resets) in 44 ms. (88 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4002 steps (405 resets) in 52 ms. (75 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4003 steps (411 resets) in 34 ms. (114 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4002 steps (398 resets) in 63 ms. (62 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4002 steps (384 resets) in 71 ms. (55 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4003 steps (409 resets) in 39 ms. (100 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4002 steps (410 resets) in 35 ms. (111 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4003 steps (384 resets) in 43 ms. (90 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4004 steps (381 resets) in 45 ms. (87 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4003 steps (407 resets) in 43 ms. (90 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4002 steps (417 resets) in 28 ms. (138 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4002 steps (410 resets) in 27 ms. (142 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4001 steps (407 resets) in 34 ms. (114 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4002 steps (397 resets) in 36 ms. (108 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4002 steps (419 resets) in 36 ms. (108 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4003 steps (399 resets) in 40 ms. (97 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4003 steps (392 resets) in 43 ms. (90 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4003 steps (404 resets) in 82 ms. (48 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4002 steps (387 resets) in 40 ms. (97 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4002 steps (410 resets) in 32 ms. (121 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4002 steps (396 resets) in 40 ms. (97 steps per ms) remains 44/44 properties
[2026-05-22 22:48:20] [INFO ] Invariant cache hit.
[2026-05-22 22:48:20] [INFO ] State equation strengthened by 63 read => feed constraints.
Reachability property qltransition_119 is true.
Reachability property qltransition_117 is true.
Reachability property qltransition_115 is true.
Reachability property qltransition_111 is true.
Reachability property qltransition_19 is true.
Reachability property qltransition_12 is true.
SDD proceeding with computation,43 properties remain. new max is 32
SDD size :834 after 18714
At refinement iteration 0 (INCLUDED_ONLY) 0/52 variables, 0/0 constraints. Problems are: Problem set: 3 solved, 41 unsolved
At refinement iteration 1 (OVERLAPS) 18/70 variables, 1/1 constraints. Problems are: Problem set: 3 solved, 41 unsolved
SDD proceeding with computation,43 properties remain. new max is 64
SDD size :18714 after 128164
At refinement iteration 2 (INCLUDED_ONLY) 0/70 variables, 0/1 constraints. Problems are: Problem set: 3 solved, 41 unsolved
At refinement iteration 3 (OVERLAPS) 20/90 variables, 1/2 constraints. Problems are: Problem set: 3 solved, 41 unsolved
SDD proceeding with computation,43 properties remain. new max is 128
SDD size :128164 after 594844
At refinement iteration 4 (INCLUDED_ONLY) 0/90 variables, 0/2 constraints. Problems are: Problem set: 3 solved, 41 unsolved
At refinement iteration 5 (OVERLAPS) 123/213 variables, 90/92 constraints. Problems are: Problem set: 3 solved, 41 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/213 variables, 47/139 constraints. Problems are: Problem set: 3 solved, 41 unsolved
Reachability property qltransition_85 is true.
SDD proceeding with computation,42 properties remain. new max is 128
SDD size :594844 after 1.69867e+06
At refinement iteration 7 (INCLUDED_ONLY) 0/213 variables, 0/139 constraints. Problems are: Problem set: 4 solved, 40 unsolved
SDD proceeding with computation,42 properties remain. new max is 256
SDD size :1.69867e+06 after 2.06878e+06
At refinement iteration 8 (OVERLAPS) 28/241 variables, 12/151 constraints. Problems are: Problem set: 4 solved, 40 unsolved
SDD proceeding with computation,42 properties remain. new max is 512
SDD size :2.06878e+06 after 2.5217e+06
At refinement iteration 9 (INCLUDED_ONLY) 0/241 variables, 16/167 constraints. Problems are: Problem set: 4 solved, 40 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/241 variables, 0/167 constraints. Problems are: Problem set: 4 solved, 40 unsolved
At refinement iteration 11 (OVERLAPS) 0/241 variables, 0/167 constraints. Problems are: Problem set: 4 solved, 40 unsolved
No progress, stopping.
After SMT solving in domain Real declared 241/241 variables, and 167 constraints, problems are : Problem set: 4 solved, 40 unsolved in 2797 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 102/102 constraints, ReadFeed: 63/63 constraints, PredecessorRefiner: 44/44 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 4 solved, 40 unsolved
Reachability property qltransition_104 is true.
Reachability property qltransition_93 is true.
Reachability property qltransition_89 is true.
At refinement iteration 0 (INCLUDED_ONLY) 0/47 variables, 0/0 constraints. Problems are: Problem set: 6 solved, 38 unsolved
At refinement iteration 1 (OVERLAPS) 21/68 variables, 1/1 constraints. Problems are: Problem set: 6 solved, 38 unsolved
Reachability property qltransition_21 is true.
SDD proceeding with computation,38 properties remain. new max is 512
SDD size :2.5217e+06 after 9.5543e+06
At refinement iteration 2 (INCLUDED_ONLY) 0/68 variables, 0/1 constraints. Problems are: Problem set: 6 solved, 38 unsolved
SDD proceeding with computation,38 properties remain. new max is 1024
SDD size :9.5543e+06 after 1.04904e+07
At refinement iteration 3 (OVERLAPS) 21/89 variables, 1/2 constraints. Problems are: Problem set: 6 solved, 38 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/89 variables, 0/2 constraints. Problems are: Problem set: 6 solved, 38 unsolved
At refinement iteration 5 (OVERLAPS) 123/212 variables, 89/91 constraints. Problems are: Problem set: 6 solved, 38 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/212 variables, 47/138 constraints. Problems are: Problem set: 6 solved, 38 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/212 variables, 13/151 constraints. Problems are: Problem set: 6 solved, 38 unsolved
SDD proceeding with computation,38 properties remain. new max is 2048
SDD size :1.04904e+07 after 2.20986e+07
At refinement iteration 8 (INCLUDED_ONLY) 0/212 variables, 13/164 constraints. Problems are: Problem set: 6 solved, 38 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/212 variables, 19/183 constraints. Problems are: Problem set: 6 solved, 38 unsolved
Reachability property qltransition_136 is true.
Reachability property qltransition_133 is true.
SDD proceeding with computation,36 properties remain. new max is 2048
SDD size :2.20986e+07 after 4.51116e+07
Error getting values : (error "Timeout of Z3 solver reached")
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Stream closed")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 212/241 variables, and 183 constraints, problems are : Problem set: 8 solved, 36 unsolved in 5014 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 89/102 constraints, ReadFeed: 47/63 constraints, PredecessorRefiner: 13/44 constraints, Known Traps: 32/32 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 7860ms problems are : Problem set: 8 solved, 36 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 42 out of 102 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 102/102 places, 139/139 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 93 transition count 126
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 93 transition count 126
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 21 place count 90 transition count 123
Iterating global reduction 0 with 3 rules applied. Total rules applied 24 place count 90 transition count 123
Applied a total of 24 rules in 44 ms. Remains 90 /102 variables (removed 12) and now considering 123/139 (removed 16) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 44 ms. Remains : 90/102 places, 123/139 transitions.
SDD proceeding with computation,36 properties remain. new max is 4096
SDD size :4.51116e+07 after 7.10583e+07
RANDOM walk for 4000000 steps (915892 resets) in 30418 ms. (131 steps per ms) remains 14/36 properties
SDD proceeding with computation,36 properties remain. new max is 8192
SDD size :7.10583e+07 after 1.03381e+08
BEST_FIRST walk for 4000002 steps (197897 resets) in 6979 ms. (573 steps per ms) remains 5/14 properties
BEST_FIRST walk for 4000000 steps (800000 resets) in 8743 ms. (457 steps per ms) remains 5/5 properties
SDD proceeding with computation,36 properties remain. new max is 16384
SDD size :1.03381e+08 after 1.28552e+08
BEST_FIRST walk for 4000000 steps (800000 resets) in 8118 ms. (492 steps per ms) remains 5/5 properties
BEST_FIRST walk for 4000002 steps (403003 resets) in 6673 ms. (599 steps per ms) remains 4/5 properties
BEST_FIRST walk for 4000003 steps (404666 resets) in 5020 ms. (796 steps per ms) remains 3/4 properties
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-10960821425910508177.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10237370289135795995.kers'
[2026-05-22 22:48:47] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10960821425910508177.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10237370289135795995.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 123 rows 90 cols 371 entries
Finished phase 1 with 86 SingleSign rule and 2 generalized
[2026-05-22 22:48:47] [INFO ] Computed 2 invariants in 0 ms
Computed 2 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-10237370289135795995.kers
Total runtime 1 ms.
[2026-05-22 22:48:47] [INFO ] State equation strengthened by 54 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 31/36 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/36 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 25/61 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/61 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 88/149 variables, 61/63 constraints. Problems are: Problem set: 0 solved, 3 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/149 variables, 19/82 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/149 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 56/205 variables, 25/107 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/205 variables, 31/138 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/205 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 8/213 variables, 4/142 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/213 variables, 4/146 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/213 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 0/213 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 213/213 variables, and 146 constraints, problems are : Problem set: 0 solved, 3 unsolved in 254 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 90/90 constraints, ReadFeed: 54/54 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 31/36 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/36 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 25/61 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/61 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 88/149 variables, 61/63 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/149 variables, 19/82 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/149 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 56/205 variables, 25/107 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/205 variables, 31/138 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/205 variables, 3/141 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/205 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 8/213 variables, 4/145 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/213 variables, 4/149 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/213 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (OVERLAPS) 0/213 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 213/213 variables, and 149 constraints, problems are : Problem set: 0 solved, 3 unsolved in 330 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 90/90 constraints, ReadFeed: 54/54 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 599ms problems are : Problem set: 0 solved, 3 unsolved
Parikh walk visited 0 properties in 326 ms.
Support contains 5 out of 90 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 90/90 places, 123/123 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 76 transition count 95
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 76 transition count 95
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 37 place count 67 transition count 86
Iterating global reduction 0 with 9 rules applied. Total rules applied 46 place count 67 transition count 86
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 48 place count 67 transition count 84
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 51 place count 64 transition count 78
Iterating global reduction 1 with 3 rules applied. Total rules applied 54 place count 64 transition count 78
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 55 place count 64 transition count 77
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 57 place count 62 transition count 74
Iterating global reduction 2 with 2 rules applied. Total rules applied 59 place count 62 transition count 74
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 61 place count 60 transition count 72
Iterating global reduction 2 with 2 rules applied. Total rules applied 63 place count 60 transition count 72
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 65 place count 60 transition count 70
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 66 place count 59 transition count 69
Iterating global reduction 3 with 1 rules applied. Total rules applied 67 place count 59 transition count 69
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 69 place count 59 transition count 67
Applied a total of 69 rules in 32 ms. Remains 59 /90 variables (removed 31) and now considering 67/123 (removed 56) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 32 ms. Remains : 59/90 places, 67/123 transitions.
RANDOM walk for 4000000 steps (917162 resets) in 8231 ms. (485 steps per ms) remains 1/3 properties
BEST_FIRST walk for 4000000 steps (800000 resets) in 3610 ms. (1107 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-6145747842479138122.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10837870085446027454.kers'
[2026-05-22 22:48:51] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6145747842479138122.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10837870085446027454.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 67 rows 59 cols 215 entries
Finished phase 1 with 55 SingleSign rule and 2 generalized
[2026-05-22 22:48:51] [INFO ] Computed 2 invariants in 0 ms
Computed 2 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-10837870085446027454.kers
Total runtime 0 ms.
[2026-05-22 22:48:51] [INFO ] State equation strengthened by 23 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 20/22 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/22 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 19/41 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/41 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 52/93 variables, 41/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/93 variables, 8/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/93 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 31/124 variables, 17/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/124 variables, 14/82 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/124 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 2/126 variables, 1/83 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/126 variables, 1/84 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/126 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/126 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 126/126 variables, and 84 constraints, problems are : Problem set: 0 solved, 1 unsolved in 103 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 59/59 constraints, ReadFeed: 23/23 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 20/22 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/22 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 19/41 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/41 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 52/93 variables, 41/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/93 variables, 8/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/93 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 31/124 variables, 17/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/124 variables, 14/82 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/124 variables, 1/83 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/124 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 2/126 variables, 1/84 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/126 variables, 1/85 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/126 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/126 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 126/126 variables, and 85 constraints, problems are : Problem set: 0 solved, 1 unsolved in 124 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 59/59 constraints, ReadFeed: 23/23 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 235ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 11 ms.
Support contains 2 out of 59 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 59/59 places, 67/67 transitions.
Applied a total of 0 rules in 5 ms. Remains 59 /59 variables (removed 0) and now considering 67/67 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 59/59 places, 67/67 transitions.
RANDOM walk for 4000000 steps (917364 resets) in 5522 ms. (724 steps per ms) remains 1/1 properties
BEST_FIRST walk for 4000000 steps (800000 resets) in 4080 ms. (980 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 5184 steps, run visited all 1 properties in 27 ms. (steps per millisecond=192 )
Probabilistic random walk after 5184 steps, saw 2329 distinct states, run finished after 32 ms. (steps per millisecond=162 ) properties seen :1
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
Able to resolve query QuasiLiveness after proving 91 properties.
FORMULA QuasiLiveness TRUE TECHNIQUES RANDOM_WALK PROBABILISTIC_WALK DECISION_DIAGRAMS COLLATERAL_PROCESSING BESTFIRST_WALK TOPOLOGICAL INITIAL_STATE
Total runtime 86411 ms.
BK_STOP 1779490134740
--------------------
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
+ [[ QuasiLiveness = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution QuasiLiveness -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 1800
+ 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 QuasiLiveness -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 1800
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="DBSingleClientW-PT-d0m10"
export BK_EXAMINATION="QuasiLiveness"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="1800"
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 DBSingleClientW-PT-d0m10, examination is QuasiLiveness"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r088-smll-177946995200082"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/DBSingleClientW-PT-d0m10.tgz
mv DBSingleClientW-PT-d0m10 execution
cd execution
if [ "QuasiLiveness" = "ReachabilityDeadlock" ] || [ "QuasiLiveness" = "UpperBounds" ] || [ "QuasiLiveness" = "QuasiLiveness" ] || [ "QuasiLiveness" = "StableMarking" ] || [ "QuasiLiveness" = "Liveness" ] || [ "QuasiLiveness" = "OneSafe" ] || [ "QuasiLiveness" = "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 [ "QuasiLiveness" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "QuasiLiveness" != "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 "QuasiLiveness.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 '
echo "FORMULA_NAME $x"
done
elif [ "QuasiLiveness" = "ReachabilityDeadlock" ] || [ "QuasiLiveness" = "QuasiLiveness" ] || [ "QuasiLiveness" = "StableMarking" ] || [ "QuasiLiveness" = "Liveness" ] || [ "QuasiLiveness" = "OneSafe" ] ; then
echo "FORMULA_NAME QuasiLiveness"
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 ;